pub fn flatten_vec<'a>(&self, vec: &'a [Point<T>]) -> Cow<'a, [Point<T>]> {
        if self.is_full_rank() {
            Cow::Borrowed(vec)
        } else {
            Cow::Owned(vec.iter().map(|v| self.flatten(v)).collect())
        }
    }
/// Projects a set of points onto the subspace, but returns
/// lower-dimensional coordinates in the subspace's basis.
///
/// This optimizes [`Self::flatten`] by just returning the original set in
/// case that the subspace is of full rank.
Projects a set of points onto the subspace, but returns
lower-dimensional coordinates in the subspace's basis.

This optimizes [`Self::flatten`] by just returning the original set in
case that the subspace is of full rank.
Projects a set of points onto the subspace but returns lower - dimensional coordinates in the subspace ' s basis . This optimizes [ ` Self :: flatten ` ] by just returning the original set in case that the subspace is of full rank .
pub fn flatten_vec<'a>(&self, vec: &'a [Point<T>]) -> Cow<'a, [Point<T>]> {
        if self.is_full_rank() {
            Cow::Borrowed(vec)
        } else {
            Cow::Owned(vec.iter().map(|v| self.flatten(v)).collect())
        }
    }
pub fn flatten_vec < ' a > ( & self , vec : & ' a [ Point < T > ] ) -> Cow < ' a , [ Point < T > ] > { if self . is_full_rank ( ) { Cow :: Borrowed ( vec ) } else { Cow :: Owned ( vec . iter ( ) . map ( | v | self . flatten ( v ) ) . collect ( ) ) } }
Projects a set of points onto the subspace, but returns
lower-dimensional coordinates in the subspace's basis.
Projects a set of points onto the subspace but returns lower - dimensional coordinates in the subspace ' s basis .
&self
vec
&'a [Point<T>]
&self
vec
&'a [Point<T>]