Cross Reference: /src/external/apache2/llvm/dist/clang/lib/Tooling/ASTDiff/ASTDiff.cpp

Lines Matching defs:int
136   std::vector<int> PostorderIds;
139   int getSize() const { return Nodes.size(); }
148   int getNumberOfDescendants(NodeId Id) const;
150   int findPositionInParent(NodeId Id, bool Shifted = false) const;
191   int Id = 0, Depth = 0;
307   int PostorderId = 0;
331 int SyntaxTree::Impl::getNumberOfDescendants(NodeId Id) const {
339 int SyntaxTree::Impl::findPositionInParent(NodeId Id, bool Shifted) const {
344   int Position = 0;
475   int Id = 0;
477   explicit SNodeId(int Id) : Id(Id) {}
480   operator int() const { return Id; }
483   SNodeId operator+(int Other) const { return SNodeId(Id + Other); }
500     int NumLeaves = setLeftMostDescendants();
503   int getSize() const { return RootIds.size(); }
525   int setLeftMostDescendants() {
526     int NumLeaves = 0;
528     for (int I = 0; I < getSize(); ++I) {
540   void computeKeyRoots(int Leaves) {
542     std::unordered_set<int> Visited;
543     int K = Leaves - 1;
573     for (int I = 0, E = S1.getSize() + 1; I < E; ++I) {
733     int Max = peekMax();
745   int peekMax() const {
799   int CommonDescendants = 0;
804     CommonDescendants += int(Dst.isValid() && T2.isInSubtree(Dst, Id2));
867   int Max1, Max2;
886           for (int I = 0, E = T1.getNumberOfDescendants(Id1); I < E; ++I)
982 int SyntaxTree::getSize() const { return TreeImpl->getSize(); }
989 int SyntaxTree::findPositionInParent(NodeId Id) const {
OpenGrok
