| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/ |
| TestDotTreeGenerator.cs | 59 @"digraph {" + newline
|
| /external/chromium_org/tools/gyp/tools/ |
| graphviz.py | 53 print 'digraph D {'
|
| /external/chromium_org/tools/ |
| gyp-explain.py | 68 print 'strict digraph {'
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| DotTreeGenerator.cs | 61 "digraph {",
83 * digraph {
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Utility/Antlr.Utility.Tree/ |
| DOTTreeGenerator.cs | 59 "digraph {",
81 * digraph {
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| DotTreeGenerator.cs | 61 "digraph {",
83 * digraph {
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| DOTTreeGenerator.java | 57 "digraph {\n\n" +
107 * digraph {
|
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| dottreegen.py | 53 "digraph {\n" +
179 digraph {
|
| /dalvik/dx/src/com/android/dx/command/dump/ |
| DotDumper.java | 127 System.out.println("digraph " + name + "{");
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| dot.rb | 72 | digraph {
|
| /external/bison/src/ |
| graphviz.c | 53 "digraph %s\n"
|
| relation.c | 48 | digraph & traverse. |
|
| /external/chromium_org/components/browser_context_keyed_service/ |
| dependency_graph.cc | 126 std::string result("digraph {\n");
|
| /external/clang/include/clang/Basic/ |
| TokenKinds.h | 62 /// digraph). For the actual spelling of a given Token, use
|
| /external/clang/lib/AST/ |
| InheritViz.cpp | 47 Out << "digraph \"" << DOT::EscapeString(Type.getAsString()) << "\" {\n";
|
| /external/clang/lib/Frontend/ |
| DependencyGraph.cpp | 111 OS << "digraph \"dependencies\" {\n";
|
| /external/libvpx/libvpx/examples/includes/geshi/geshi/ |
| dot.php | 63 'node', 'graph', 'digraph', 'strict', 'edge', 'subgraph'
|
| /external/llvm/lib/CodeGen/ |
| EdgeBundles.cpp | 83 O << "digraph {\n";
|
| /external/openfst/src/include/fst/script/ |
| draw-impl.h | 73 PrintString("digraph FST {\n");
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/ |
| suggest.cpp | 357 // Finish digraph handling if the node is in the middle of a digraph expansion.
508 // Process the node codepoint as a digraph. This means that composite glyphs like the German
510 // the normal non-digraph traversal, so both "uber" and "ueber" can be corrected to "[u-umlaut]ber".
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| regex_nfa.tcc | 107 __ostr << "digraph _Nfa {\n"
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| regex_nfa.tcc | 107 __ostr << "digraph _Nfa {\n"
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| regex_nfa.tcc | 107 __ostr << "digraph _Nfa {\n"
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| regex_nfa.tcc | 107 __ostr << "digraph _Nfa {\n"
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| regex_nfa.tcc | 107 __ostr << "digraph _Nfa {\n"
|
