reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
662 if (Root) stack.push_back(reinterpret_cast<uintptr_t>(Root)); 666 assert(!stack.empty()); 667 return *reinterpret_cast<TreeTy *>(stack.back() & ~Flags); 672 assert(!stack.empty()); 673 return stack.back() & Flags; 676 bool atEnd() const { return stack.empty(); } 679 return stack.size() == 1 && getVisitState() == VisitedNone; 683 assert(!stack.empty()); 684 stack.pop_back(); 685 if (stack.empty()) 689 stack.back() |= VisitedLeft; 692 stack.back() |= VisitedRight; 700 return stack == x.stack; 700 return stack == x.stack; 708 assert(!stack.empty()); 709 TreeTy* Current = reinterpret_cast<TreeTy*>(stack.back() & ~Flags); 714 stack.push_back(reinterpret_cast<uintptr_t>(L)); 716 stack.back() |= VisitedLeft; 720 stack.push_back(reinterpret_cast<uintptr_t>(R)); 722 stack.back() |= VisitedRight; 734 assert(!stack.empty()); 735 TreeTy* Current = reinterpret_cast<TreeTy*>(stack.back() & ~Flags); 739 stack.pop_back(); 742 stack.back() &= ~Flags; // Set state to "VisitedNone." 744 stack.push_back(reinterpret_cast<uintptr_t>(L) | VisitedRight); 747 stack.back() &= ~Flags; 748 stack.back() |= VisitedLeft; 750 stack.push_back(reinterpret_cast<uintptr_t>(R) | VisitedRight);