pub struct IndexedPolygonalFaceWithVoids<'m> { /* private fields */ }Expand description
IfcIndexedPolygonalFaceWithVoids: an n-gon with holes.
§The loops must not be merged
InnerCoordIndices are holes. Concatenating them onto the outer loop
produces a self-intersecting polygon that most triangulators will happily
accept and fill in, so the hole disappears and the face is silently solid.
Every accessor here keeps the outer loop and the inner loops separate, and
there is deliberately no method that returns them as one list.
Implementations§
Source§impl<'m> IndexedPolygonalFaceWithVoids<'m>
impl<'m> IndexedPolygonalFaceWithVoids<'m>
Sourcepub fn new(id: EntityId, entity: &'m Entity) -> Self
pub fn new(id: EntityId, entity: &'m Entity) -> Self
Wrap an entity assumed to be an IfcIndexedPolygonalFaceWithVoids.
Sourcepub fn base(&self) -> IndexedPolygonalFace<'m>
pub fn base(&self) -> IndexedPolygonalFace<'m>
The inherited IfcIndexedPolygonalFace attributes, giving the outer
loop.
Sourcepub fn inner_loops_1based(&self) -> GeometryResult<Vec<Vec<i64>>>
pub fn inner_loops_1based(&self) -> GeometryResult<Vec<Vec<i64>>>
The inner loops, as the file wrote them: 1-based indices.
Each entry is one hole. They are never to be appended to the outer loop.
Sourcepub fn inner_loops_0based(&self) -> GeometryResult<Vec<Vec<usize>>>
pub fn inner_loops_0based(&self) -> GeometryResult<Vec<Vec<usize>>>
The inner loops as 0-based indices, one Vec per hole.
Sourcepub fn void_count(&self) -> GeometryResult<usize>
pub fn void_count(&self) -> GeometryResult<usize>
How many holes the face has.
Trait Implementations§
Source§impl<'m> Clone for IndexedPolygonalFaceWithVoids<'m>
impl<'m> Clone for IndexedPolygonalFaceWithVoids<'m>
Source§fn clone(&self) -> IndexedPolygonalFaceWithVoids<'m>
fn clone(&self) -> IndexedPolygonalFaceWithVoids<'m>
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read more