reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
212 return std::make_tuple(MyId, Tree.getNode(MyId).Parent); 229 N.Height = std::max(N.Height, 1 + Tree.getNode(Child).Height); 284 const Node &N = Tree.getNode(Id); 299 for (NodeId Child : Tree.getNode(Ids[Expanded++]).Children) 309 for (NodeId Child : getNode(Id).Children) 322 while ((Parent = getNode(Cur).Parent).isValid() && 323 getNode(Parent).Children[0] == Cur) { 331 return getNode(Id).RightMostDescendant - Id + 1; 335 return Id >= SubtreeRoot && Id <= getNode(SubtreeRoot).RightMostDescendant; 339 NodeId Parent = getNode(Id).Parent; 342 const auto &Siblings = getNode(Parent).Children; 346 Position += getNode(Siblings[I]).Shift; 409 return getNodeValue(getNode(Id)); 508 return Tree.getNode(getIdInRoot(Id)); 714 return Tree.getNode(Id1).Height < Tree.getNode(Id2).Height; 714 return Tree.getNode(Id1).Height < Tree.getNode(Id2).Height; 749 return Tree.getNode(List.top()).Height; 752 for (NodeId Child : Tree.getNode(Id).Children) 759 const Node &N1 = T1.getNode(Id1); 760 const Node &N2 = T2.getNode(Id2); 772 return Options.isMatchingAllowed(T1.getNode(Id1), T2.getNode(Id2)); 772 return Options.isMatchingAllowed(T1.getNode(Id1), T2.getNode(Id2)); 777 NodeId P1 = T1.getNode(Id1).Parent; 778 NodeId P2 = T2.getNode(Id2).Parent; 801 const Node &N1 = T1.getNode(Id1); 846 const Node &N1 = T1.getNode(Id1); 980 return TreeImpl->getNode(Id);