| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| D | TestNFAConstruction.java | 42 Grammar g = new Grammar( in testA() local
51 checkRule(g, "a", expecting); in testA()
55 Grammar g = new Grammar( in testAB() local
65 checkRule(g, "a", expecting); in testAB()
69 Grammar g = new Grammar( in testAorB() local
88 checkRule(g, "a", expecting); in testAorB()
92 Grammar g = new Grammar( in testRangeOrRange() local
110 checkRule(g, "A", expecting); in testRangeOrRange()
114 Grammar g = new Grammar( in testRange() local
124 checkRule(g, "A", expecting); in testRange()
[all …]
|
| D | TestCharDFAConversion.java | 47 Grammar g = new Grammar( in testSimpleRangeVersusChar() local
50 g.createLookaheadDFAs(); in testSimpleRangeVersusChar()
56 checkDecision(g, 1, expecting, null); in testSimpleRangeVersusChar()
60 Grammar g = new Grammar( in testRangeWithDisjointSet() local
65 g.createLookaheadDFAs(); in testRangeWithDisjointSet()
73 checkDecision(g, 1, expecting, null); in testRangeWithDisjointSet()
77 Grammar g = new Grammar( in testDisjointSetCollidingWithTwoRanges() local
82 g.createLookaheadDFAs(false); in testDisjointSetCollidingWithTwoRanges()
90 checkDecision(g, 1, expecting, null); in testDisjointSetCollidingWithTwoRanges()
94 Grammar g = new Grammar( in testDisjointSetCollidingWithTwoRangesCharsFirst() local
[all …]
|
| D | TestTopologicalSort.java | 39 Graph g = new Graph(); in testFairlyLargeGraph() local
40 g.addEdge("C", "F"); in testFairlyLargeGraph()
41 g.addEdge("C", "G"); in testFairlyLargeGraph()
42 g.addEdge("C", "A"); in testFairlyLargeGraph()
43 g.addEdge("C", "B"); in testFairlyLargeGraph()
44 g.addEdge("A", "D"); in testFairlyLargeGraph()
45 g.addEdge("A", "E"); in testFairlyLargeGraph()
46 g.addEdge("B", "E"); in testFairlyLargeGraph()
47 g.addEdge("D", "E"); in testFairlyLargeGraph()
48 g.addEdge("D", "F"); in testFairlyLargeGraph()
[all …]
|
| D | TestSemanticPredicates.java | 49 Grammar g = new Grammar( in testPredsButSyntaxResolves() local
55 checkDecision(g, 1, expecting, null, null, null, null, null, 0, false); in testPredsButSyntaxResolves()
59 Grammar g = new Grammar( in testLL_1_Pred() local
66 checkDecision(g, 1, expecting, null, null, null, null, null, 0, false); in testLL_1_Pred()
71 Grammar g = new Grammar( in testLL_1_Pred_forced_k_1() local
78 checkDecision(g, 1, expecting, null, null, null, null, null, 0, false); in testLL_1_Pred_forced_k_1()
82 Grammar g = new Grammar( in testLL_2_Pred() local
90 checkDecision(g, 1, expecting, null, null, null, null, null, 0, false); in testLL_2_Pred()
94 Grammar g = new Grammar( in testPredicatedLoop() local
102 checkDecision(g, 1, expecting, null, null, null, null, null, 0, false); in testPredicatedLoop()
[all …]
|
| D | TestASTConstruction.java | 40 Grammar g = new Grammar( in testA() local
45 String found = g.getRule("a").tree.toStringTree(); in testA()
50 Grammar g = new Grammar( in testEmptyAlt() local
55 String found = g.getRule("a").tree.toStringTree(); in testEmptyAlt()
60 Grammar g = new Grammar( in testNakeRulePlusInLexer() local
66 String found = g.getRule("A").tree.toStringTree(); in testNakeRulePlusInLexer()
71 Grammar g = new Grammar( in testRulePlus() local
77 String found = g.getRule("a").tree.toStringTree(); in testRulePlus()
82 Grammar g = new Grammar( in testNakedRulePlus() local
88 String found = g.getRule("a").tree.toStringTree(); in testNakedRulePlus()
[all …]
|
| D | TestDFAConversion.java | 43 Grammar g = new Grammar( in testA() local
49 checkDecision(g, 1, expecting, null, null, null, null, 0); in testA()
53 Grammar g = new Grammar( in testAB_or_AC() local
60 checkDecision(g, 1, expecting, null, null, null, null, 0); in testAB_or_AC()
64 Grammar g = new Grammar( in testAB_or_AC_k2() local
72 checkDecision(g, 1, expecting, null, null, null, null, 0); in testAB_or_AC_k2()
76 Grammar g = new Grammar( in testAB_or_AC_k1() local
87 checkDecision(g, 1, expecting, unreachableAlts, in testAB_or_AC_k1()
92 Grammar g = new Grammar( in testselfRecurseNonDet() local
97 assertNonLLStar(g, altsWithRecursion); in testselfRecurseNonDet()
[all …]
|
| D | TestSymbolDefinitions.java | 46 Grammar g = new Grammar( in testParserSimpleTokens() local
52 checkSymbols(g, rules, tokenNames); in testParserSimpleTokens()
56 Grammar g = new Grammar( in testParserTokensSection() local
66 checkSymbols(g, rules, tokenNames); in testParserTokensSection()
70 Grammar g = new Grammar( in testLexerTokensSection() local
80 checkSymbols(g, rules, tokenNames); in testLexerTokensSection()
84 Grammar g = new Grammar( in testTokensSectionWithAssignmentSection() local
94 checkSymbols(g, rules, tokenNames); in testTokensSectionWithAssignmentSection()
98 Grammar g = new Grammar( in testCombinedGrammarLiterals() local
107 checkSymbols(g, rules, tokenNames); in testCombinedGrammarLiterals()
[all …]
|
| D | TestInterpretedLexing.java | 80 Grammar g = new Grammar( in testSimpleAltCharTest() local
83 final int Atype = g.getTokenType("A"); in testSimpleAltCharTest()
84 Interpreter engine = new Interpreter(g, new ANTLRStringStream("a")); in testSimpleAltCharTest()
85 engine = new Interpreter(g, new ANTLRStringStream("b")); in testSimpleAltCharTest()
88 engine = new Interpreter(g, new ANTLRStringStream("c")); in testSimpleAltCharTest()
94 Grammar g = new Grammar( in testSingleRuleRef() local
98 final int Atype = g.getTokenType("A"); in testSingleRuleRef()
99 Interpreter engine = new Interpreter(g, new ANTLRStringStream("abc")); // should ignore the x in testSingleRuleRef()
105 Grammar g = new Grammar( in testSimpleLoop() local
109 final int INTtype = g.getTokenType("INT"); in testSimpleLoop()
[all …]
|
| D | TestAttributes.java | 55 Grammar g = new Grammar(); in testEscapedLessThanInAction() local
57 CodeGenerator generator = new CodeGenerator(antlr, g, "Java"); in testEscapedLessThanInAction()
75 Grammar g = new Grammar( in testEscaped$InAction() local
82 CodeGenerator generator = new CodeGenerator(antlr, g, "Java"); in testEscaped$InAction()
83 g.setCodeGenerator(generator); in testEscaped$InAction()
98 Grammar g = new Grammar( in testArguments() local
104 CodeGenerator generator = new CodeGenerator(antlr, g, "Java"); in testArguments()
105 g.setCodeGenerator(generator); in testArguments()
123 Grammar g = new Grammar( in testComplicatedArgParsing() local
129 CodeGenerator generator = new CodeGenerator(antlr, g, "Java"); in testComplicatedArgParsing()
[all …]
|
| D | TestCompositeGrammars.java | 45 Grammar g = new Grammar(grammar); in testWildcardStillWorks() local
212 Grammar g = new Grammar(antlr,tmpdir+"/M.g",composite); in testDelegatesSeeSameTokenType2() local
213 composite.setDelegationRoot(g); in testDelegatesSeeSameTokenType2()
214 g.parseAndBuildAST(); in testDelegatesSeeSameTokenType2()
215 g.composite.assignTokenTypes(); in testDelegatesSeeSameTokenType2()
222 realElements(g.composite.tokenIDToTypeMap).toString()); in testDelegatesSeeSameTokenType2()
223 assertEquals(expectedStringLiteralToTypeMap, g.composite.stringLiteralToTypeMap.toString()); in testDelegatesSeeSameTokenType2()
225 realElements(g.composite.typeToTokenList).toString()); in testDelegatesSeeSameTokenType2()
250 Grammar g = new Grammar(antlr,tmpdir+"/M.g",composite); in testCombinedImportsCombined() local
251 composite.setDelegationRoot(g); in testCombinedImportsCombined()
[all …]
|
| D | TestInterpretedParsing.java | 48 Grammar g = new Grammar(); in testSimpleParse() local
49 g.importTokenVocabulary(pg); in testSimpleParse()
50 g.setFileName(Grammar.IGNORE_STRING_IN_GRAMMAR_FILE_NAME +"string"); in testSimpleParse()
51 g.setGrammarContent( in testSimpleParse()
64 Interpreter lexEngine = new Interpreter(g, input); in testSimpleParse()
67 tokens.setTokenTypeChannel(g.getTokenType("WS"), 99); in testSimpleParse()
83 Grammar g = new Grammar(); in testMismatchedTokenError() local
84 g.setFileName(Grammar.IGNORE_STRING_IN_GRAMMAR_FILE_NAME +"string"); in testMismatchedTokenError()
85 g.importTokenVocabulary(pg); in testMismatchedTokenError()
86 g.setGrammarContent( in testMismatchedTokenError()
[all …]
|
| /external/compiler-rt/lib/asan/ |
| D | asan_globals.cc | 28 const Global *g; member
37 void PoisonRedZones(const Global &g) { in PoisonRedZones() argument
38 uptr aligned_size = RoundUpTo(g.size, SHADOW_GRANULARITY); in PoisonRedZones()
39 PoisonShadow(g.beg + aligned_size, g.size_with_redzone - aligned_size, in PoisonRedZones()
41 if (g.size != aligned_size) { in PoisonRedZones()
44 g.beg + RoundDownTo(g.size, SHADOW_GRANULARITY), in PoisonRedZones()
45 g.size % SHADOW_GRANULARITY, in PoisonRedZones()
56 const Global &g = *l->g; in DescribeAddressIfGlobal() local
59 (void*)g.beg, g.size, (char*)g.name); in DescribeAddressIfGlobal()
60 res |= DescribeAddressRelativeToGlobal(addr, size, g); in DescribeAddressIfGlobal()
[all …]
|
| /external/clang/utils/VtableTest/ |
| D | gen.cc | 20 void g(const char *c) { in g() function
24 void g(int i) { in g() function
82 g("struct s"); in gs()
84 g("class s"); in gs()
85 g(s); in gs()
97 g(": "); in gs()
99 g(", "); in gs()
103 g("virtual "); in gs()
115 g("public "); break; in gs()
122 g("private "); break; in gs()
[all …]
|
| /external/chromium-trace/trace-viewer/src/ |
| D | color_scheme.js | 25 {r: 138, g: 113, b: 152}, property
26 {r: 175, g: 112, b: 133}, property
27 {r: 127, g: 135, b: 225}, property
28 {r: 93, g: 81, b: 137}, property
29 {r: 116, g: 143, b: 119}, property
30 {r: 178, g: 214, b: 122}, property
31 {r: 87, g: 109, b: 147}, property
32 {r: 119, g: 155, b: 95}, property
33 {r: 114, g: 180, b: 160}, property
34 {r: 132, g: 85, b: 103}, property
[all …]
|
| /external/v8/test/mjsunit/ |
| D | debug-breakpoints.js | 33 function g() { function
65 bp = Debug.setBreakPoint(g, 0, 0);
70 assertTrue(Debug.showBreakPoints(g).indexOf("[B0]a=1;") > 0);
76 assertTrue(Debug.showBreakPoints(g).indexOf("[B0]") < 0);
79 bp1 = Debug.setBreakPoint(g, 2, 0);
84 assertTrue(Debug.showBreakPoints(g).indexOf("[B0]b=2;") > 0);
85 bp2 = Debug.setBreakPoint(g, 1, 0);
90 assertTrue(Debug.showBreakPoints(g).indexOf("[B0]a=1;") > 0);
91 assertTrue(Debug.showBreakPoints(g).indexOf("[B1]b=2;") > 0);
92 bp3 = Debug.setBreakPoint(g, 3, 0);
[all …]
|
| D | const-declaration.js | 32 function g() { function
37 assertEquals(undefined, g());
41 assertEquals(0, g());
49 function g() { function
56 assertEquals(undefined, g());
60 assertEquals(0, g());
68 function g(s) { function
73 assertEquals(undefined, g("x = 42;"));
77 assertEquals(0, g("x = 46;"));
85 function g(s) { function
[all …]
|
| D | string-replace.js | 43 replaceTest("abc", short, /x/g, "");
47 replaceTest("xaxxcx", short, /b/g, "");
52 replaceTest("[]a[]b[]c[]", short, /x/g, "[]");
56 replaceTest("xax[]xcx", short, /b/g, "[]");
61 replaceTest("[$]a[$]b[$]c[$]", short, /x/g, "[$$]");
65 replaceTest("xax[$]xcx", short, /b/g, "[$$]");
70 replaceTest("[]a[xa]b[xaxb]c[xaxbxc]", short, /x/g, "[$`]");
74 replaceTest("xax[xax]xcx", short, /b/g, "[$`]");
79 replaceTest("[x]a[x]b[x]c[x]", short, /x/g, "[$&]");
83 replaceTest("xax[b]xcx", short, /b/g, "[$&]");
[all …]
|
| D | string-charcodeat.js | 112 var g = generator;
113 var len = g().toString().length;
116 assertTrue(isNaN(g().charCodeAt(-1e19)), 1 + t);
117 assertTrue(isNaN(g().charCodeAt(-0x80000001)), 2 + t);
118 assertTrue(isNaN(g().charCodeAt(-0x80000000)), 3 + t);
119 assertTrue(isNaN(g().charCodeAt(-0x40000000)), 4 + t);
120 assertTrue(isNaN(g().charCodeAt(-1)), 5 + t);
121 assertTrue(isNaN(g().charCodeAt(len)), 6 + t);
122 assertTrue(isNaN(g().charCodeAt(len + 1)), 7 + t);
123 assertTrue(isNaN(g().charCodeAt(0x3fffffff)), 8 + t);
[all …]
|
| /external/jmonkeyengine/engine/src/core/com/jme3/math/ |
| D | ColorRGBA.java | 120 public float g; field in ColorRGBA
136 r = g = b = a = 1.0f; in ColorRGBA()
148 public ColorRGBA(float r, float g, float b, float a) { in ColorRGBA() argument
150 this.g = g; in ColorRGBA()
163 this.g = rgba.g; in ColorRGBA()
178 public ColorRGBA set(float r, float g, float b, float a) { in set() argument
180 this.g = g; in set()
196 g = 0; in set()
201 g = rgba.g; in set()
221 if (g < 0) { in clamp()
[all …]
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | HeuristicSolver.h | 104 Graph &g; variable
120 HeuristicSolverImpl(Graph &g) : g(g), h(*this) {} in HeuristicSolverImpl() argument
125 Graph& getGraph() { return g; } in getGraph()
166 NodeData &n1Data = getSolverNodeData(g.getEdgeNode1(eItr)), in removeSolverEdge()
167 &n2Data = getSolverNodeData(g.getEdgeNode2(eItr)); in removeSolverEdge()
210 for (Graph::AdjEdgeItr aeItr = g.adjEdgesBegin(nItr), in setSolution()
211 aeEnd = g.adjEdgesEnd(nItr); in setSolution()
214 Graph::NodeItr anItr(g.getEdgeOtherNode(eItr, nItr)); in setSolution()
244 const Matrix &eCosts = g.getEdgeCosts(eItr); in applyR1()
245 const Vector &xCosts = g.getNodeCosts(xnItr); in applyR1()
[all …]
|
| /external/icu4c/data/locales/ |
| D | mgo.txt | 15 "[a à b {ch} d e è ə {ə\u0300} f g {gh} i ì j k m n ŋ o ò ɔ {ɔ\u0300} p r s t"
158 dn{"anəg"}
179 dn{"iməg"}
188 dn{"anəg agu nkap"}
206 "iməg ngwə̀t",
207 "iməg fog",
208 "iməg ichiibɔd",
209 "iməg àdùmbə̀ŋ",
210 "iməg ichika",
211 "iməg kud",
[all …]
|
| /external/llvm/lib/Support/ |
| D | regfree.c | 52 struct re_guts *g; in llvm_regfree() local
57 g = preg->re_g; in llvm_regfree()
58 if (g == NULL || g->magic != MAGIC2) /* oops again */ in llvm_regfree()
61 g->magic = 0; /* mark it invalid */ in llvm_regfree()
63 if (g->strip != NULL) in llvm_regfree()
64 free((char *)g->strip); in llvm_regfree()
65 if (g->sets != NULL) in llvm_regfree()
66 free((char *)g->sets); in llvm_regfree()
67 if (g->setbits != NULL) in llvm_regfree()
68 free((char *)g->setbits); in llvm_regfree()
[all …]
|
| /external/harfbuzz_ng/src/ |
| D | hb-set-private.hh | 46 inline void add (hb_codepoint_t g) { in add()
48 value = g; in add()
52 mask ^= (g & mask) ^ value; in add()
62 inline bool may_have (hb_codepoint_t g) const { in may_have()
63 return (g & mask) == value; in may_have()
81 inline void add (hb_codepoint_t g) { in add()
82 mask |= mask_for (g); in add()
95 inline bool may_have (hb_codepoint_t g) const { in may_have()
96 return !!(mask & mask_for (g)); in may_have()
101 …static inline mask_t mask_for (hb_codepoint_t g) { return ((mask_t) 1) << (g & (sizeof (mask_t) * … in mask_for()
[all …]
|
| /external/qemu/distrib/sdl-1.2.15/src/video/ |
| D | SDL_blit.h | 89 #define RGB_FROM_PIXEL(Pixel, fmt, r, g, b) \ argument
92 g = (((Pixel&fmt->Gmask)>>fmt->Gshift)<<fmt->Gloss); \
95 #define RGB_FROM_RGB565(Pixel, r, g, b) \ argument
98 g = (((Pixel&0x07E0)>>5)<<2); \
101 #define RGB_FROM_RGB555(Pixel, r, g, b) \ argument
104 g = (((Pixel&0x03E0)>>5)<<3); \
107 #define RGB_FROM_RGB888(Pixel, r, g, b) \ argument
110 g = ((Pixel&0xFF00)>>8); \
140 #define DISEMBLE_RGB(buf, bpp, fmt, Pixel, r, g, b) \ argument
165 RGB_FROM_PIXEL(Pixel, fmt, r, g, b); \
[all …]
|
| /external/ceres-solver/include/ceres/ |
| D | jet.h | 249 Jet<T, N> g; variable
250 g.a = -f.a;
251 g.v = -f.v;
252 return g;
258 const Jet<T, N>& g) {
260 h.a = f.a + g.a;
261 h.v = f.v + g.v;
286 const Jet<T, N>& g) {
288 h.a = f.a - g.a;
289 h.v = f.v - g.v;
[all …]
|