| /external/srec/srec/Vocabulary/src/ |
| D | Vocabulary.c | 111 static ESR_ReturnCode getTable(ESR_Locale locale, const LCHAR* m[]) in getTable() argument
114 for(i = 0; i< CH_MAX; i++) m[i] = ""; in getTable()
121 m['}']="um"; m['?']="OW"; m['~']="un"; m['@']="uh"; m['A']="EY"; in getTable()
122 m['C']="ch"; m['D']="dh"; m['E']="EE"; m['I']="AY"; m['J']="jnk"; in getTable()
123 m['L']="ul"; m['N']="ng"; m['O']="OH"; m['P']="ur"; m['S']="sh"; in getTable()
124 m['T']="th"; m['U']="OOH"; m['V']="UR"; m['Z']="zh"; m[']']="oh"; in getTable()
125 m['^']="ENV"; m['#']="sil"; m['a']="AA"; m['b']="b"; m['c']="eh"; in getTable()
126 m['d']="d"; m['e']="EH"; m['f']="f"; m[')']="AH"; m['g']="g"; in getTable()
127 m['h']="h"; m['i']="IH"; m['j']="j"; m[',']="AE"; m['k']="k"; in getTable()
128 m['l']="l"; m['m']="m"; m['/']="ee"; m['n']="n"; m['o']="AW"; in getTable()
[all …]
|
| /external/chromium_org/third_party/mesa/src/src/glsl/builtins/glsl/ |
| D | inverse.glsl | 24 mat2 inverse(mat2 m)
27 adj[0][0] = m[1][1];
28 adj[0][1] = -m[0][1];
29 adj[1][0] = -m[1][0];
30 adj[1][1] = m[0][0];
31 float det = m[0][0] * m[1][1] - m[1][0] * m[0][1];
35 mat3 inverse(mat3 m)
38 adj[0][0] = + (m[1][1] * m[2][2] - m[2][1] * m[1][2]);
39 adj[1][0] = - (m[1][0] * m[2][2] - m[2][0] * m[1][2]);
40 adj[2][0] = + (m[1][0] * m[2][1] - m[2][0] * m[1][1]);
[all …]
|
| /external/mesa3d/src/glsl/builtins/glsl/ |
| D | inverse.glsl | 24 mat2 inverse(mat2 m)
27 adj[0][0] = m[1][1];
28 adj[0][1] = -m[0][1];
29 adj[1][0] = -m[1][0];
30 adj[1][1] = m[0][0];
31 float det = m[0][0] * m[1][1] - m[1][0] * m[0][1];
35 mat3 inverse(mat3 m)
38 adj[0][0] = + (m[1][1] * m[2][2] - m[2][1] * m[1][2]);
39 adj[1][0] = - (m[1][0] * m[2][2] - m[2][0] * m[1][2]);
40 adj[2][0] = + (m[1][0] * m[2][1] - m[2][0] * m[1][1]);
[all …]
|
| /external/libcxx/test/re/re.alg/re.alg.match/ |
| D | ecma.pass.cpp | 27 std::cmatch m; in main() local
29 assert(std::regex_match(s, m, std::regex("a"))); in main()
30 assert(m.size() == 1); in main()
31 assert(!m.empty()); in main()
32 assert(!m.prefix().matched); in main()
33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
[all …]
|
| D | extended.pass.cpp | 27 std::cmatch m; in main() local
29 assert(std::regex_match(s, m, std::regex("a", std::regex_constants::extended))); in main()
30 assert(m.size() == 1); in main()
31 assert(!m.empty()); in main()
32 assert(!m.prefix().matched); in main()
33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
[all …]
|
| D | basic.pass.cpp | 27 std::cmatch m; in main() local
28 assert(!std::regex_match("a", m, std::regex())); in main()
29 assert(m.size() == 0); in main()
30 assert(m.empty()); in main()
33 std::cmatch m; in main() local
35 assert(std::regex_match(s, m, std::regex("a", std::regex_constants::basic))); in main()
36 assert(m.size() == 1); in main()
37 assert(!m.empty()); in main()
38 assert(!m.prefix().matched); in main()
39 assert(m.prefix().first == s); in main()
[all …]
|
| /external/libcxx/test/re/re.alg/re.alg.search/ |
| D | basic.pass.cpp | 27 std::cmatch m; in main() local
28 assert(!std::regex_search("a", m, std::regex())); in main()
29 assert(m.size() == 0); in main()
30 assert(m.empty()); in main()
33 std::cmatch m; in main() local
35 assert(std::regex_search(s, m, std::regex("a", std::regex_constants::basic))); in main()
36 assert(m.size() == 1); in main()
37 assert(!m.empty()); in main()
38 assert(!m.prefix().matched); in main()
39 assert(m.prefix().first == s); in main()
[all …]
|
| D | ecma.pass.cpp | 27 std::cmatch m; in main() local
29 assert(std::regex_search(s, m, std::regex("a"))); in main()
30 assert(m.size() == 1); in main()
31 assert(!m.empty()); in main()
32 assert(!m.prefix().matched); in main()
33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
[all …]
|
| D | awk.pass.cpp | 27 std::cmatch m; in main() local
29 assert(std::regex_search(s, m, std::regex("a", std::regex_constants::awk))); in main()
30 assert(m.size() == 1); in main()
31 assert(!m.empty()); in main()
32 assert(!m.prefix().matched); in main()
33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
[all …]
|
| D | extended.pass.cpp | 27 std::cmatch m; in main() local
29 assert(std::regex_search(s, m, std::regex("a", std::regex_constants::extended))); in main()
30 assert(m.size() == 1); in main()
31 assert(!m.empty()); in main()
32 assert(!m.prefix().matched); in main()
33 assert(m.prefix().first == s); in main()
34 assert(m.prefix().second == m[0].first); in main()
35 assert(!m.suffix().matched); in main()
36 assert(m.suffix().first == m[0].second); in main()
37 assert(m.suffix().second == s+1); in main()
[all …]
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| D | filelist.objc | 1 ANTLRBaseMapElement.m
2 ANTLRBaseRecognizer.m
3 ANTLRBaseStack.m
4 ANTLRBaseTree.m
5 ANTLRBaseTreeAdaptor.m
6 ANTLRBitSet.m
7 ANTLRBufferedTokenStream.m
8 ANTLRBufferedTreeNodeStream.m
10 ANTLRCharStreamState.m
11 ANTLRCommonErrorNode.m
[all …]
|
| /external/libcxx/test/containers/associative/set/ |
| D | lower_bound.pass.cpp | 41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.lower_bound(5); in main()
43 assert(r == m.begin()); in main()
44 r = m.lower_bound(7); in main()
45 assert(r == next(m.begin())); in main()
46 r = m.lower_bound(9); in main()
47 assert(r == next(m.begin(), 2)); in main()
48 r = m.lower_bound(11); in main()
49 assert(r == next(m.begin(), 3)); in main()
50 r = m.lower_bound(13); in main()
[all …]
|
| D | upper_bound.pass.cpp | 41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.upper_bound(5); in main()
43 assert(r == next(m.begin(), 1)); in main()
44 r = m.upper_bound(7); in main()
45 assert(r == next(m.begin(), 2)); in main()
46 r = m.upper_bound(9); in main()
47 assert(r == next(m.begin(), 3)); in main()
48 r = m.upper_bound(11); in main()
49 assert(r == next(m.begin(), 4)); in main()
50 r = m.upper_bound(13); in main()
[all …]
|
| D | erase_iter.pass.cpp | 38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
39 assert(m.size() == 8); in main()
40 I i = m.erase(next(m.cbegin(), 3)); in main()
41 assert(m.size() == 7); in main()
42 assert(i == next(m.begin(), 3)); in main()
43 assert(*next(m.begin(), 0) == 1); in main()
44 assert(*next(m.begin(), 1) == 2); in main()
45 assert(*next(m.begin(), 2) == 3); in main()
46 assert(*next(m.begin(), 3) == 5); in main()
47 assert(*next(m.begin(), 4) == 6); in main()
[all …]
|
| D | equal_range.pass.cpp | 41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.equal_range(5); in main()
43 assert(r.first == next(m.begin(), 0)); in main()
44 assert(r.second == next(m.begin(), 1)); in main()
45 r = m.equal_range(7); in main()
46 assert(r.first == next(m.begin(), 1)); in main()
47 assert(r.second == next(m.begin(), 2)); in main()
48 r = m.equal_range(9); in main()
49 assert(r.first == next(m.begin(), 2)); in main()
50 assert(r.second == next(m.begin(), 3)); in main()
[all …]
|
| D | erase_iter_iter.pass.cpp | 38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
39 assert(m.size() == 8); in main()
40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); in main()
41 assert(m.size() == 8); in main()
42 assert(i == next(m.begin(), 5)); in main()
43 assert(*next(m.begin(), 0) == 1); in main()
44 assert(*next(m.begin(), 1) == 2); in main()
45 assert(*next(m.begin(), 2) == 3); in main()
46 assert(*next(m.begin(), 3) == 4); in main()
47 assert(*next(m.begin(), 4) == 5); in main()
[all …]
|
| /external/libcxx/test/containers/associative/map/map.ops/ |
| D | lower_bound.pass.cpp | 41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.lower_bound(5); in main()
43 assert(r == m.begin()); in main()
44 r = m.lower_bound(7); in main()
45 assert(r == next(m.begin())); in main()
46 r = m.lower_bound(9); in main()
47 assert(r == next(m.begin(), 2)); in main()
48 r = m.lower_bound(11); in main()
49 assert(r == next(m.begin(), 3)); in main()
50 r = m.lower_bound(13); in main()
[all …]
|
| D | upper_bound.pass.cpp | 41 M m(ar, ar+sizeof(ar)/sizeof(ar[0])); in main() local
42 R r = m.upper_bound(5); in main()
43 assert(r == next(m.begin(), 1)); in main()
44 r = m.upper_bound(7); in main()
45 assert(r == next(m.begin(), 2)); in main()
46 r = m.upper_bound(9); in main()
47 assert(r == next(m.begin(), 3)); in main()
48 r = m.upper_bound(11); in main()
49 assert(r == next(m.begin(), 4)); in main()
50 r = m.upper_bound(13); in main()
[all …]
|
| /external/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| D | erase_iter.pass.cpp | 39 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
40 assert(m.size() == 9); in main()
41 I i = m.erase(next(m.cbegin(), 3)); in main()
42 assert(m.size() == 8); in main()
43 assert(i == next(m.begin(), 3)); in main()
44 assert(m.begin()->first == 1); in main()
45 assert(m.begin()->second == 1); in main()
46 assert(next(m.begin())->first == 1); in main()
47 assert(next(m.begin())->second == 1.5); in main()
48 assert(next(m.begin(), 2)->first == 1); in main()
[all …]
|
| /external/chromium_org/v8/test/cctest/compiler/ |
| D | test-run-machops.cc | 27 RawMachineAssemblerTester<int32_t> m; in TEST() local
28 Node* add = m.Int32Add(m.Int32Constant(0), m.Int32Constant(1)); in TEST()
29 m.Return(add); in TEST()
30 CHECK_EQ(1, m.Call()); in TEST()
34 static Node* Int32Input(RawMachineAssemblerTester<int32_t>* m, int index) { in Int32Input() argument
37 return m->Parameter(0); in Int32Input()
39 return m->Parameter(1); in Int32Input()
41 return m->Int32Constant(0); in Int32Input()
43 return m->Int32Constant(1); in Int32Input()
45 return m->Int32Constant(-1); in Int32Input()
[all …]
|
| /external/libcxx/test/containers/associative/multiset/ |
| D | erase_iter.pass.cpp | 38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
39 assert(m.size() == 8); in main()
40 I i = m.erase(next(m.cbegin(), 3)); in main()
41 assert(m.size() == 7); in main()
42 assert(i == next(m.begin(), 3)); in main()
43 assert(*next(m.begin(), 0) == 1); in main()
44 assert(*next(m.begin(), 1) == 2); in main()
45 assert(*next(m.begin(), 2) == 3); in main()
46 assert(*next(m.begin(), 3) == 5); in main()
47 assert(*next(m.begin(), 4) == 6); in main()
[all …]
|
| /external/libcxx/test/localization/locale.categories/category.ctype/locale.ctype.byname/ |
| D | is_many.pass.cpp | 33 std::vector<F::mask> m(in.size()); in main() local
34 const wchar_t* h = f.is(in.data(), in.data() + in.size(), m.data()); in main()
38 assert(!(m[0] & F::space)); in main()
39 assert( (m[0] & F::print)); in main()
40 assert(!(m[0] & F::cntrl)); in main()
41 assert( (m[0] & F::upper)); in main()
42 assert(!(m[0] & F::lower)); in main()
43 assert( (m[0] & F::alpha)); in main()
44 assert(!(m[0] & F::digit)); in main()
45 assert(!(m[0] & F::punct)); in main()
[all …]
|
| /external/libcxx/test/containers/associative/map/map.modifiers/ |
| D | erase_iter.pass.cpp | 38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
39 assert(m.size() == 8); in main()
40 I i = m.erase(next(m.cbegin(), 3)); in main()
41 assert(m.size() == 7); in main()
42 assert(i == next(m.begin(), 3)); in main()
43 assert(m.begin()->first == 1); in main()
44 assert(m.begin()->second == 1.5); in main()
45 assert(next(m.begin())->first == 2); in main()
46 assert(next(m.begin())->second == 2.5); in main()
47 assert(next(m.begin(), 2)->first == 3); in main()
[all …]
|
| /external/chromium_org/v8/src/compiler/ |
| D | machine-operator-reducer.cc | 50 Int32BinopMatcher m(node); in Reduce() local
51 if (m.right().Is(0)) return Replace(m.right().node()); // x & 0 => 0 in Reduce()
52 if (m.right().Is(-1)) return Replace(m.left().node()); // x & -1 => x in Reduce()
53 if (m.IsFoldable()) { // K & K => K in Reduce()
54 return ReplaceInt32(m.left().Value() & m.right().Value()); in Reduce()
56 if (m.LeftEqualsRight()) return Replace(m.left().node()); // x & x => x in Reduce()
60 Int32BinopMatcher m(node); in Reduce() local
61 if (m.right().Is(0)) return Replace(m.left().node()); // x | 0 => x in Reduce()
62 if (m.right().Is(-1)) return Replace(m.right().node()); // x | -1 => -1 in Reduce()
63 if (m.IsFoldable()) { // K | K => K in Reduce()
[all …]
|
| /external/icu/icu4c/source/data/curr/ |
| D | ksf.txt | 16 "mɔni mǝ á bǝlɔŋ bǝ kaksa bɛ táatáaŋzǝn",
20 "mɔni mǝ á angóla",
24 "mɔni mǝ á ɔstralí",
28 "mɔni mǝ á barǝ́n",
32 "mɔni mǝ á burundí",
36 "mɔni mǝ á botswana",
40 "mɔni mǝ á kanada",
44 "mɔni mǝ á kɔngó",
48 "mɔni mǝ á swís",
52 "mɔni mǝ á cín",
[all …]
|