HomeSort by relevance Sort by last modified time
    Searched defs:DFS (Results 1 - 25 of 27) sorted by null

1 2

  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
Graph.java 70 /** DFS-based topological sort. A valid sort is the reverse of
91 DFS(n, visited, sorted);
96 public void DFS(Node n, Set<Node> visited, ArrayList<Object> sorted) {
102 DFS(target, visited, sorted);
  /external/clang/test/CodeGenCXX/
strict-vtable-pointers.cpp 74 DynamicFromStatic DFS;
75 DFS.bar();
  /external/llvm/include/llvm/Analysis/
LoopIterator.h 50 /// preorder visited by DFS. It's postorder number is initially zero and set
63 /// Traverse the loop blocks and store the DFS result.
71 assert(isComplete() && "bad loop DFS");
78 assert(isComplete() && "bad loop DFS");
95 assert(I != PostNumbers.end() && "block not visited by DFS");
96 assert(I->second && "block not finished by DFS");
128 LoopBlocksDFS &DFS;
133 DFS(Storage), LI(LInfo) {}
137 /// finishPostorder to record the DFS result.
139 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing")
    [all...]
  /external/pdfium/core/src/fxcodec/jbig2/
JBig2_TrdProc.cpp 20 int32_t DT, DFS, CURS;
52 if (pHuffmanDecoder->decodeAValue(SBHUFFFS, &DFS) != 0)
55 FIRSTS = FIRSTS + DFS;
220 int32_t DT, DFS, CURS;
273 IAFS->decode(pArithDecoder, &DFS);
274 FIRSTS = FIRSTS + DFS;
  /external/clang/lib/StaticAnalyzer/Core/
CoreEngine.cpp 44 class DFS : public WorkList {
105 WorkList *WorkList::makeDFS() { return new DFS(); }
  /external/antlr/antlr-3.4/runtime/C/src/
antlr3collections.c     [all...]