|
Open CASCADE Technology
6.7.1
|
The class BOPDS_SubIterator is
1.to compute intersections between two sub-sets of
BRep sub-shapes
of arguments of an operation (see the class BOPDS_DS)
in terms of theirs bounding boxes
2.provides interface to iterare the pairs of
intersected sub-shapes of given type
More...
#include <BOPDS_SubIterator.hxx>
Public Member Functions | |
| BOPDS_SubIterator () | |
| Empty contructor More... | |
| virtual | ~BOPDS_SubIterator () |
| BOPDS_SubIterator (const BOPCol_BaseAllocator &theAllocator) | |
Contructor <br> theAllocator - the allocator to manage the memory | |
| void | SetDS (const BOPDS_PDS &pDS) |
| Modifier Sets the data structure <pDS> to process More... | |
| const BOPDS_DS & | DS () const |
| Selector Returns the data structure More... | |
| void | SetSubSet1 (const BOPCol_ListOfInteger &theLI) |
| Modifier Sets the first set of indices <theLI> to process More... | |
| const BOPCol_ListOfInteger & | SubSet1 () const |
| Selector Returns the first set of indices to process More... | |
| void | SetSubSet2 (const BOPCol_ListOfInteger &theLI) |
| Modifier Sets the second set of indices <theLI> to process More... | |
| const BOPCol_ListOfInteger & | SubSet2 () const |
| Selector Returns the second set of indices to process More... | |
| void | Initialize () |
| Initializes the iterator More... | |
| Standard_Boolean | More () const |
| Returns true if still there are pairs of intersected shapes More... | |
| void | Next () |
| Moves iterations ahead More... | |
| void | Value (Standard_Integer &theIndex1, Standard_Integer &theIndex2) const |
| Returns indices (DS) of intersected shapes theIndex1 - the index of the first shape theIndex2 - the index of the second shape More... | |
| virtual void | Prepare () |
| Perform the intersection algorithm and prepare the results to be used More... | |
Protected Member Functions | |
| virtual void | Intersect () |
The class BOPDS_SubIterator is
1.to compute intersections between two sub-sets of
BRep sub-shapes
of arguments of an operation (see the class BOPDS_DS)
in terms of theirs bounding boxes
2.provides interface to iterare the pairs of
intersected sub-shapes of given type
| BOPDS_SubIterator::BOPDS_SubIterator | ( | ) |
Empty contructor
|
virtual |
| BOPDS_SubIterator::BOPDS_SubIterator | ( | const BOPCol_BaseAllocator & | theAllocator | ) |
Contructor <br>
theAllocator - the allocator to manage the memory
| const BOPDS_DS& BOPDS_SubIterator::DS | ( | ) | const |
Selector
Returns the data structure
| void BOPDS_SubIterator::Initialize | ( | ) |
Initializes the iterator
|
protectedvirtual |
| Standard_Boolean BOPDS_SubIterator::More | ( | ) | const |
Returns true if still there are pairs
of intersected shapes
| void BOPDS_SubIterator::Next | ( | ) |
Moves iterations ahead
|
virtual |
Perform the intersection algorithm and prepare
the results to be used
| void BOPDS_SubIterator::SetDS | ( | const BOPDS_PDS & | pDS | ) |
Modifier
Sets the data structure <pDS> to process
| void BOPDS_SubIterator::SetSubSet1 | ( | const BOPCol_ListOfInteger & | theLI | ) |
Modifier
Sets the first set of indices <theLI> to process
| void BOPDS_SubIterator::SetSubSet2 | ( | const BOPCol_ListOfInteger & | theLI | ) |
Modifier
Sets the second set of indices <theLI> to process
| const BOPCol_ListOfInteger& BOPDS_SubIterator::SubSet1 | ( | ) | const |
Selector
Returns the first set of indices to process
| const BOPCol_ListOfInteger& BOPDS_SubIterator::SubSet2 | ( | ) | const |
Selector
Returns the second set of indices to process
| void BOPDS_SubIterator::Value | ( | Standard_Integer & | theIndex1, |
| Standard_Integer & | theIndex2 | ||
| ) | const |
Returns indices (DS) of intersected shapes
theIndex1 - the index of the first shape
theIndex2 - the index of the second shape
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
1.8.5