pub struct Polyhedron<N: CddNumber = DefaultNumber> { /* private fields */ }Implementations§
Source§impl<N: CddNumber> Polyhedron<N>
impl<N: CddNumber> Polyhedron<N>
pub fn from_matrix<R: RepresentationMarker>(m: &Matrix<N, R>) -> CddResult<Self>
pub fn from_vertices<const D: usize>(vertices: &[[N; D]]) -> CddResult<Self>
pub fn from_vertex_rows(vertices: &[Vec<N>]) -> CddResult<Self>
pub fn facets(&self) -> CddResult<Matrix<N, Inequality>>
pub fn generators(&self) -> CddResult<Matrix<N, Generator>>
pub fn adjacency(&self) -> CddResult<SetFamily<N>>
👎Deprecated: Uses cddlib’s dd_CopyAdjacency, which has a serious performance-limiting bug that causes an approximately superexponential slowdown for “large” numbers of generators. Prefer hullabaloo’s adjacency construction APIs instead.
pub fn input_adjacency(&self) -> CddResult<SetFamily<N>>
pub fn incidence(&self) -> CddResult<SetFamily<N>>
pub fn input_incidence(&self) -> CddResult<SetFamily<N>>
pub fn append_input_rows<R: RepresentationMarker>( &mut self, rows: &Matrix<N, R>, ) -> CddResult<()>
pub fn width_in_direction_real(&self, direction: &[f64]) -> CddResult<f64>
Trait Implementations§
Auto Trait Implementations§
impl<N> Freeze for Polyhedron<N>
impl<N> RefUnwindSafe for Polyhedron<N>where
N: RefUnwindSafe,
impl<N = f64> !Send for Polyhedron<N>
impl<N = f64> !Sync for Polyhedron<N>
impl<N> Unpin for Polyhedron<N>where
N: Unpin,
impl<N> UnsafeUnpin for Polyhedron<N>
impl<N> UnwindSafe for Polyhedron<N>where
N: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more