Searched refs:Traverse (Results 1 – 25 of 86) sorted by relevance
1234
351 decltype(&RecursiveASTVisitor::Traverse##NAME), \352 decltype(&Derived::Traverse##NAME)>::value \355 decltype(&RecursiveASTVisitor::Traverse##NAME), \356 decltype(&Derived::Traverse##NAME)>::value, \358 .Traverse##NAME(static_cast<CLASS *>(VAR), QUEUE) \359 : getDerived().Traverse##NAME(static_cast<CLASS *>(VAR)))374 bool Traverse##CLASS(CLASS *S, DataRecursionQueue *Queue = nullptr);395 #define TYPE(CLASS, BASE) bool Traverse##CLASS##Type(CLASS##Type *T);416 #define TYPELOC(CLASS, BASE) bool Traverse##CLASS##TypeLoc(CLASS##TypeLoc TL);449 #define DECL(CLASS, BASE) bool Traverse##CLASS##Decl(CLASS##Decl *D);[all …]
38 descrip = 'Traverse peers up to this level (4 is a reasonable number)';
6 * Copyright 2019-2021 Traverse Technologies19 model = "Traverse Ten64";
45 Traverse a chain looking for digest BIOs:
200 0x40 - Traverse left trie.237 0x20 - Traverse middle trie. (Read a new command byte241 0x10 - Traverse right trie. (Read a new command byte and
284 std::function<void(NodeId)> Traverse = [&](NodeId Id) { in getSubtreePostorder() local287 Traverse(Child); in getSubtreePostorder()290 Traverse(Root); in getSubtreePostorder()
55 /* Traverse the linker tree to find the spot where the stub goes. */
82 /* Traverse the linker tree to find the spot where the stub goes. */
68 /* Traverse the linker tree to find the spot where the stub goes. */
50 /* Traverse the linker tree to find the spot where the stub goes. */
77 /* Traverse the linker tree to find the spot where the stub goes. */
101 /* Traverse the linker tree to find the spot where the stub goes. */
176 /* Traverse the linker tree to find the spot where the stub goes. */
255 bool Traverse##N(N *S) { \256 Base::Traverse##N(S); \
33 231:Michigan (USA):Muskegon, Traverse City:MI