Per-Kind dense vector cache for O(1) shape lookup by entity index. Replaces NCollection_DataMap to eliminate hash/equality overhead.
More...
#include <BRepGraphInc_Reconstruct.hxx>
Per-Kind dense vector cache for O(1) shape lookup by entity index. Replaces NCollection_DataMap to eliminate hash/equality overhead.
◆ Cache()
| BRepGraphInc_Reconstruct::Cache::Cache |
( |
| ) |
|
|
inline |
◆ Bind()
Bind a reconstructed shape to a node. Grows the vector as needed.
◆ IsBound()
Check if a node is already cached.
◆ Seek()
Seek a cached shape. Returns nullptr if not yet cached.
◆ myAllocator
◆ myKinds
◆ myTempAllocator
◆ myTempScopeDepth
| int BRepGraphInc_Reconstruct::Cache::myTempScopeDepth = 0 |
◆ THE_DEFAULT_INCREMENT
| constexpr int BRepGraphInc_Reconstruct::Cache::THE_DEFAULT_INCREMENT = 32 |
|
staticconstexpr |
◆ THE_KIND_COUNT
| constexpr int BRepGraphInc_Reconstruct::Cache::THE_KIND_COUNT = BRepGraph_NodeId::THE_KIND_COUNT |
|
staticconstexpr |
Number of Kind slots used by BRepGraph_NodeId dense-kind indexing. Includes topology kinds, assembly kinds, and the reserved gap at kind 9.
The documentation for this struct was generated from the following file: