#include <Standard.hxx>#include <Standard_Macro.hxx>#include <BOPTools_PInterferencePool.hxx>#include <Standard_Address.hxx>#include <Standard_Integer.hxx>#include <Standard_Boolean.hxx>#include <BooleanOperations_PShapesDataStructure.hxx>#include <Handle_BOPTools_HArray2OfIntersectionStatus.hxx>#include <TopAbs_ShapeEnum.hxx>#include <Handle_BOPTools_ListNodeOfListOfCoupleOfInteger.hxx>#include <TCollection_List.lxx>#include <TCollection_ListIterator.lxx>#include <Standard_PrimitiveTypes.hxx>#include <TCollection_BasicMap.hxx>#include <Handle_TopTools_IndexedDataMapNodeOfIndexedDataMapOfShapeAddress.hxx>#include <Handle_Standard_Transient.hxx>#include <Handle_IntTools_IndexedDataMapNodeOfIndexedDataMapOfTransientAddress.hxx>#include <Handle_Geom_Curve.hxx>#include <Standard_Real.hxx>#include <TopAbs_State.hxx>Data Structures | |
| class | BOPTools_PaveFiller |
| The algorithm that provides 1. creation of the data structure (DS) 2. creation of the interferences' pool 3. invocation of Perform() to fill the DS More... | |
1.6.3