| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/ |
| dfa.st | 0 digraph NFA {
|
| nfa.st | 0 digraph NFA {
|
| dot.stg | 34 digraph NFA {
43 digraph NFA {
|
| /packages/inputmethods/LatinIME/native/jni/src/ |
| digraph_utils.cpp | 43 // Returns the digraph type associated with the given dictionary.
56 // Returns the size of the digraph array, or 0 if none exist.
63 // Returns the digraph codepoint for the given composite glyph codepoint and digraph codepoint index
64 // (which specifies the first or second codepoint in the digraph).
70 const DigraphUtils::digraph_t *const digraph = member in class:latinime::DigraphUtils
72 if (!digraph) {
76 return digraph->first;
78 return digraph->second;
84 // Retrieves the set of all digraphs associated with the given digraph type
107 const DigraphUtils::digraph_t *const digraph = getDigraphForDigraphTypeAndCodePoint( member in class:latinime::DigraphUtils
[all...] |
| unigram_dictionary.cpp | 51 // Return the replacement code point for a digraph, or 0 if none.
55 // There can't be a digraph if we don't have at least 2 characters to examine
58 // Search for the first char of some digraph
67 // It's an interesting digraph if the second char matches too.
101 // Found a digraph. We will try both spellings. eg. the word is "pruefen"
103 // Copy the word up to the first char of the digraph, including proximity chars,
106 // digraph.
109 // Make i the index of the second char of the digraph for simplicity. Forgetting
120 // Copy the second char of the digraph in place, then continue processing on
[all...] |
| /external/bison/doc/figs/ |
| example-shift.dot | 0 digraph "shift.y"
|
| example-reduce.dot | 0 digraph "reduce.y"
|
| example.dot | 5 digraph "/tmp/fo.y"
|
| /external/clang/test/Parser/ |
| cxx-casting.cpp | 44 (void)const_cast<::c>(&x); // expected-error{{found '<::' after a const_cast which forms the digraph '<:' (aka '[') and a ':', did you mean '< ::'?}}
45 (void)dynamic_cast<::a>(b); // expected-error{{found '<::' after a dynamic_cast which forms the digraph '<:' (aka '[') and a ':', did you mean '< ::'?}}
46 (void)reinterpret_cast<::c>(x); // expected-error{{found '<::' after a reinterpret_cast which forms the digraph '<:' (aka '[') and a ':', did you mean '< ::'?}}
47 (void)static_cast<::c>(&x); // expected-error{{found '<::' after a static_cast which forms the digraph '<:' (aka '[') and a ':', did you mean '< ::'?}}
49 // Do not do digraph correction.
67 test1::A LCC B> e; // expected-error{{found '<::' after a template name which forms the digraph '<:' (aka '[') and a ':', did you mean '< ::'?}}
68 (void)static_cast LCC c>(&x); // expected-error{{found '<::' after a static_cast which forms the digraph '<:' (aka '[') and a ':', did you mean '< ::'?}}
77 ::D<::F> A1; // expected-error{{found '<::' after a template name which forms the digraph '<:' (aka '[') and a ':', did you mean '< ::'?}}
78 D<::F> A2; // expected-error{{found '<::' after a template name which forms the digraph '<:' (aka '[') and a ':', did you mean '< ::'?}}
79 ::E<::F>(); // expected-error{{found '<::' after a template name which forms the digraph '<:' (aka '[') and a ':', did you mean '< ::'?}
[all...] |
| /external/valgrind/main/docs/internals/ |
| tm-mutexstates.dot | 0 digraph mutex_states {
|
| tm-threadstates.dot | 0 digraph thread_states {
|
| /external/antlr/antlr-3.4/runtime/Python/unittests/ |
| testdottreegen.py | 31 "digraph {\n" +
47 digraph {
|
| /external/clang/test/SemaTemplate/ |
| temp_arg_template.cpp | 33 // Evil digraph '<:' is parsed as '[', expect error.
34 A<::N::Z> *a10; // expected-error{{found '<::' after a template name which forms the digraph '<:' (aka '[') and a ':', did you mean '< ::'?}}
36 // Do not do a digraph correction here.
|
| /build/tools/ |
| filter-product-graph.py | 58 print "digraph {"
|
| /external/clang/bindings/python/examples/cindex/ |
| cindex-includes.py | 43 out.write("digraph G {\n")
|
| /external/llvm/include/llvm/Support/ |
| GraphWriter.h | 117 O << "digraph \"" << DOT::EscapeString(Title) << "\" {\n";
119 O << "digraph \"" << DOT::EscapeString(GraphName) << "\" {\n";
121 O << "digraph unnamed {\n";
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/ |
| TestDotTreeGenerator.cs | 59 @"digraph {" + newline
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/ |
| suggest.cpp | 266 // Finish digraph handling if the node is in the middle of a digraph expansion.
415 // Process the node codepoint as a digraph. This means that composite glyphs like the German
417 // the normal non-digraph traversal, so both "uber" and "ueber" can be corrected to "[u-umlaut]ber".
|
| /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 {
|
