fn element(&self, rank: usize, idx: usize) -> Option<Self> {
        let (vertices, abs) = self.abs.element_and_vertices(rank, idx)?;

        Some(Self::new(
            vertices
                .into_iter()
                .map(|idx| self.vertices[idx].clone())
                .collect(),
            abs,
        ))
    }
/// Gets the element with a given rank and index as a polytope, or returns
/// `None` if such an element doesn't exist.
Gets the element with a given rank and index as a polytope, or returns
`None` if such an element doesn't exist.
Gets the element with a given rank and index as a polytope or returns ` None ` if such an element doesn ' t exist .
fn element(&self, rank: usize, idx: usize) -> Option<Self> {
        let (vertices, abs) = self.abs.element_and_vertices(rank, idx)?;
        Some(Self::new(
            vertices
                .into_iter()
                .map(|idx| self.vertices[idx].clone())
                .collect(),
            abs,
        ))
    }
fn element ( & self , rank : usize , idx : usize ) -> Option < Self > { let ( vertices , abs ) = self . abs . element_and_vertices ( rank , idx ) ? ; Some ( Self :: new ( vertices . into_iter ( ) . map ( | idx | self . vertices [ idx ] . clone ( ) ) . collect ( ) , abs , ) ) }
Gets the element with a given rank and index as a polytope, or returns
`None` if such an element doesn't exist.
Gets the element with a given rank and index as a polytope or returns ` None ` if such an element doesn ' t exist .
&self
rank
usize
idx
usize