| 57 | }; |
| 58 | |
| 59 | bool Sq::FIFOStack::pop(AABBTreeBuildNode*& entry) |
| 60 | { |
| 61 | const PxU32 NbEntries = mStack.size(); // Get current number of entries |
| 62 | if (!NbEntries) |
| 63 | return false; // Can be NULL when no value has been pushed. This is an invalid pop call. |
| 64 | entry = mStack[mCurIndex++]; // Get oldest entry, move to next one |
| 65 | if (mCurIndex == NbEntries) |
| 66 | { |
| 67 | // All values have been poped |
| 68 | mStack.clear(); |
| 69 | mCurIndex = 0; |
| 70 | } |
| 71 | return true; |
| 72 | } |
| 73 | //~Progressive building |
| 74 | |
| 75 | void flatten(const NodeAllocator& nodeAllocator, AABBTreeRuntimeNode* dest) |