- cuttingPlane and sampledPatch now use PrimitiveMeshedSurface for their
storage.
- cuttingPlane always triangulates since the cut faces tend to look quite
horrible anyhow.
- moved triangulation request out of sampledSurface to the inherited
classes. It might disappear anyhow.
- plain nTriangles() inline method for face class
- triFace gets the same for symmetry
- face::triangles(), face::trianglesQuads() return the number of faces generated
- face::triangles() can append to a DynamicList
* DynamicList::allocSize(label)
- Adjust the allocated size. The addressed list can be truncated but not
extended, use setSize() for that.
* DynamicList::reserve(label)
- Reserve allocation for *at least* this number of elements.
Never shrinks the allocated size, nor touches the addressed list size.
* DynamicList::setSize(label)
- proposed behaviour:
Adjust the addressed list size, allocating extra space if required.
- The current behaviour is ambiguous about what addressable size will
actually get set and using it to extend the addressable size (as
per List) automatically shrinks the allocated space to this size!
- expose faceMap info in triangulate() - for use in inherited classes
- surfMesh::triangulate() works with or without underlying pointField
- onePatch tries to be more intelligent about retaining the patch name
- boundBox::invertedBox is useful for initializing our own calculations
- NOTE treeBoundBox::greatBox is still in place, since it uses GREAT
instead of VGREAT. If this is only historical, we can drop it.
- all formats except ftr and gts are now read as MeshedSurface (thus sorted
immediately). Avoid unnecessary sorting during construction though.
- moved cleanup routines completely into PrimitiveMeshedSurface
- use new HashSet capabilities and sortedOrder function
- make STL format a MeshedSurface instead of an UnsortedMeshedSurface for
better (MeshedSurface) reader efficiency
- operator+= : add in the listed keys
- operator-= : remove the listed keys
- operator&= : intersection of keys
- added xfer constructor (just in case)
- moved labelHashSet typedef to HashSet.H, for consistency with the
wordHashSet typedef being there and since it is used so often
- moved SortableList<T>::less class to UList<T>::less for better accessibility
- add clear() method now also handles the indices
- indices length is caught in sort()
- indices remain (mostly) zero-sized until after sort()
- allow non-const access to indices
- added protected storedPoints(), storedFaces() functions for non-const
access to the data. Mixing protected non-const versions and public const
versions of the same method does not agree with the compiler
- better handling of triFace/face distinction
