Lines Matching defs:it
49 // result. It consists of an ID of the MatcherInterface (for
55 // For \c QualType and \c TypeLoc it is possible to implement
107 // - Traverse(node) calls BaseTraverse(node) when it needs
131 // It's OK to always overwrite the bound nodes, as if there was
359 // It is wrong to assume that the relation is a chain. A correct
502 /// If there was a bucket already set, it will finish the timing for that
543 auto it = MatcherFiltersMap.find(Kind);
545 it != MatcherFiltersMap.end() ? it->second : getFilterForKind(Kind);
737 /// kind (and derived kinds) so it is a waste to try every matcher on every
792 // Now it can still be that we have an alias template.
806 for (const auto &It : Declaration->bases()) {
807 const Type *TypeNode = It.getType().getTypePtr();
871 // We only match the nested name specifier here (as opposed to traversing it)
