139   int getSize() const { return Nodes.size(); }  in getSize()  function in clang::diff::SyntaxTree::Impl
142   PreorderIterator end() const { return getSize(); }  in end()
146   bool isValidNodeId(NodeId Id) const { return Id >= 0 && Id < getSize(); }  in isValidNodeId()
224            N.RightMostDescendant < Tree.getSize() &&  in PostTraverse()
308   PostorderIds.resize(getSize());  in initTree()
503   int getSize() const { return RootIds.size(); }  in getSize()  function in clang::diff::Subtree
505     assert(Id > 0 && Id <= getSize() && "Invalid subtree node index.");  in getIdInRoot()
512     assert(Id > 0 && Id <= getSize() && "Invalid subtree node index.");  in getLeftMostDescendant()
527     LeftMostDescendants.resize(getSize());  in setLeftMostDescendants()
528     for (int I = 0; I < getSize(); ++I) {  in setLeftMostDescendants()
544     for (SNodeId I(getSize()); I > 0; --I) {  in computeKeyRoots()
570         size_t(S1.getSize()) + 1);  in ZhangShashaMatcher()
572         size_t(S1.getSize()) + 1);  in ZhangShashaMatcher()
573     for (int I = 0, E = S1.getSize() + 1; I < E; ++I) {  in ZhangShashaMatcher()
574       TreeDist[I] = std::make_unique<double[]>(size_t(S2.getSize()) + 1);  in ZhangShashaMatcher()
575       ForestDist[I] = std::make_unique<double[]>(size_t(S2.getSize()) + 1);  in ZhangShashaMatcher()
587     TreePairs.emplace_back(SNodeId(S1.getSize()), SNodeId(S2.getSize()));  in getMatchingNodes()
862   Mapping M(T1.getSize() + T2.getSize());  in matchTopDown()
982 int SyntaxTree::getSize() const { return TreeImpl->getSize(); }  in getSize()  function in clang::diff::SyntaxTree