| /external/rust/crates/bstr/src/unicode/fsm/ |
| D | grapheme_break_fwd.littleendian.dfa | 1 rust-regex-automata-sparse-dfa������@$������������l�������
11 …�������� �����l�����������h�lh�lh����������h�lh�l�������������h�l…
12 ���������������������h�lh�lh�lh�lh�l�����h�l�����lh������lh������h�l�����lh������h�…
|
| D | grapheme_break_fwd.bigendian.dfa | 1 rust-regex-automata-sparse-dfa������������$@������������l�
11 …�������� �����l������������hl�hl�h����������hl�hl��������������hl…
12 ���������������������hl�hl�hl�hl�hl������hl�����l�h�����l�h������hl�����l�h������h…
|
| /external/python/cpython2/Tools/pybench/ |
| D | Lists.py | 11 l = []
12 append = l.append
23 l[0] = 3
24 l[1] = 4
25 l[2] = 5
26 l[3] = 3
27 l[4] = 4
28 l[5] = 5
30 x = l[0]
31 x = l[1]
[all …]
|
| /external/bc/src/ |
| D | bc_lex.c | 50 bc_lex_identifier(BcLex* l) in bc_lex_identifier() argument
54 const char* buf = l->buf + l->i - 1; in bc_lex_identifier()
71 l->t = BC_LEX_KW_AUTO + (BcLexType) i; in bc_lex_identifier()
75 if (!BC_LEX_KW_POSIX(kw)) bc_lex_verr(l, BC_ERR_POSIX_KW, kw->name); in bc_lex_identifier()
78 l->i += n - 1; in bc_lex_identifier()
86 bc_lex_name(l); in bc_lex_identifier()
90 if (BC_ERR(l->str.len - 1 > 1)) in bc_lex_identifier()
92 bc_lex_verr(l, BC_ERR_POSIX_NAME_LEN, l->str.v); in bc_lex_identifier()
102 bc_lex_string(BcLex* l) in bc_lex_string() argument
110 l->t = BC_LEX_STR; in bc_lex_string()
[all …]
|
| D | lex.c | 46 bc_lex_invalidChar(BcLex* l, char c) in bc_lex_invalidChar() argument
48 l->t = BC_LEX_INVALID; in bc_lex_invalidChar()
49 bc_lex_verr(l, BC_ERR_PARSE_CHAR, c); in bc_lex_invalidChar()
53 bc_lex_lineComment(BcLex* l) in bc_lex_lineComment() argument
55 l->t = BC_LEX_WHITESPACE; in bc_lex_lineComment()
56 while (l->i < l->len && l->buf[l->i] != '\n') in bc_lex_lineComment()
58 l->i += 1; in bc_lex_lineComment()
63 bc_lex_comment(BcLex* l) in bc_lex_comment() argument
70 l->i += 1; in bc_lex_comment()
71 l->t = BC_LEX_WHITESPACE; in bc_lex_comment()
[all …]
|
| D | dc_lex.c | 44 dc_lex_negCommand(BcLex* l) in dc_lex_negCommand() argument
46 char c = l->buf[l->i]; in dc_lex_negCommand()
56 dc_lex_register(BcLex* l) in dc_lex_register() argument
59 if (DC_X && isspace(l->buf[l->i - 1])) in dc_lex_register()
64 bc_lex_whitespace(l); in dc_lex_register()
65 c = l->buf[l->i]; in dc_lex_register()
70 bc_lex_verr(l, BC_ERR_PARSE_CHAR, c); in dc_lex_register()
74 l->i += 1; in dc_lex_register()
75 bc_lex_name(l); in dc_lex_register()
81 if (BC_ERR(l->buf[l->i - 1] == '\n')) in dc_lex_register()
[all …]
|
| /external/brotli/c/enc/ |
| D | static_dict.c | 86 const size_t l = w.len & 0x1F; in BrotliFindAllStaticDictionaryMatches() local
87 const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l]; in BrotliFindAllStaticDictionaryMatches()
90 w.len = (uint8_t)l; in BrotliFindAllStaticDictionaryMatches()
93 DictMatchLength(dictionary->words, data, id, l, max_length); in BrotliFindAllStaticDictionaryMatches()
99 if (matchlen == l) { in BrotliFindAllStaticDictionaryMatches()
100 AddMatch(id, l, l, matches); in BrotliFindAllStaticDictionaryMatches()
105 if (matchlen >= l - 1) { in BrotliFindAllStaticDictionaryMatches()
106 AddMatch(id + 12 * n, l - 1, l, matches); in BrotliFindAllStaticDictionaryMatches()
107 if (l + 2 < max_length && in BrotliFindAllStaticDictionaryMatches()
108 data[l - 1] == 'i' && data[l] == 'n' && data[l + 1] == 'g' && in BrotliFindAllStaticDictionaryMatches()
[all …]
|
| /external/cronet/third_party/brotli/enc/ |
| D | static_dict.c | 84 size_t l = 0; in BrotliFindAllStaticDictionaryMatchesFor() local
85 while (node && l < max_length) { in BrotliFindAllStaticDictionaryMatchesFor()
87 if (l >= min_length && node->len_) { in BrotliFindAllStaticDictionaryMatchesFor()
88 AddMatch(node->idx_, l, node->len_, matches); in BrotliFindAllStaticDictionaryMatchesFor()
91 c = data[l++]; in BrotliFindAllStaticDictionaryMatchesFor()
101 const size_t l = w.len & 0x1F; in BrotliFindAllStaticDictionaryMatchesFor() local
102 const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l]; in BrotliFindAllStaticDictionaryMatchesFor()
105 w.len = (uint8_t)l; in BrotliFindAllStaticDictionaryMatchesFor()
108 DictMatchLength(dictionary->words, data, id, l, max_length); in BrotliFindAllStaticDictionaryMatchesFor()
114 if (matchlen == l) { in BrotliFindAllStaticDictionaryMatchesFor()
[all …]
|
| /external/mesa3d/src/panfrost/util/ |
| D | lcra.c | 46 struct lcra_state *l = calloc(1, sizeof(*l)); in lcra_alloc_equations() local
48 l->node_count = node_count; in lcra_alloc_equations()
49 l->class_count = class_count; in lcra_alloc_equations()
51 l->alignment = calloc(sizeof(l->alignment[0]), node_count); in lcra_alloc_equations()
52 l->linear = calloc(sizeof(l->linear[0]), node_count * node_count); in lcra_alloc_equations()
53 l->modulus = calloc(sizeof(l->modulus[0]), node_count); in lcra_alloc_equations()
54 l->class = calloc(sizeof(l->class[0]), node_count); in lcra_alloc_equations()
55 l->class_start = calloc(sizeof(l->class_start[0]), class_count); in lcra_alloc_equations()
56 l->class_disjoint = calloc(sizeof(l->class_disjoint[0]), class_count * class_count); in lcra_alloc_equations()
57 l->class_size = calloc(sizeof(l->class_size[0]), class_count); in lcra_alloc_equations()
[all …]
|
| /external/cronet/net/data/parse_certificate_unittest/ |
| D | cert_version3.pem | 5 0:d=0 hl=4 l=1367 cons: SEQUENCE
6 4:d=1 hl=4 l=1087 cons: SEQUENCE
7 8:d=2 hl=2 l= 3 cons: cont [ 0 ]
8 10:d=3 hl=2 l= 1 prim: INTEGER :02
9 13:d=2 hl=2 l= 7 prim: INTEGER :2B63A42A705076
10 22:d=2 hl=2 l= 13 cons: SEQUENCE
11 24:d=3 hl=2 l= 9 prim: OBJECT :sha1WithRSAEncryption
12 35:d=3 hl=2 l= 0 prim: NULL
13 37:d=2 hl=3 l= 202 cons: SEQUENCE
14 40:d=3 hl=2 l= 11 cons: SET
[all …]
|
| D | tbs_v3_real.pem | 5 0:d=0 hl=4 l=1087 cons: SEQUENCE
6 4:d=1 hl=2 l= 3 cons: cont [ 0 ]
7 6:d=2 hl=2 l= 1 prim: INTEGER :02
8 9:d=1 hl=2 l= 7 prim: INTEGER :2B63A42A705076
9 18:d=1 hl=2 l= 13 cons: SEQUENCE
10 20:d=2 hl=2 l= 9 prim: OBJECT :sha1WithRSAEncryption
11 31:d=2 hl=2 l= 0 prim: NULL
12 33:d=1 hl=3 l= 202 cons: SEQUENCE
13 36:d=2 hl=2 l= 11 cons: SET
14 38:d=3 hl=2 l= 9 cons: SEQUENCE
[all …]
|
| D | tbs_validity_relaxed.pem | 5 0:d=0 hl=4 l=1276 cons: SEQUENCE
6 4:d=1 hl=2 l= 3 cons: cont [ 0 ]
7 6:d=2 hl=2 l= 1 prim: INTEGER :02
8 9:d=1 hl=2 l= 3 prim: INTEGER :2821D5
9 14:d=1 hl=2 l= 13 cons: SEQUENCE
10 16:d=2 hl=2 l= 9 prim: OBJECT :sha1WithRSAEncryption
11 27:d=2 hl=2 l= 0 prim: NULL
12 29:d=1 hl=3 l= 220 cons: SEQUENCE
13 32:d=2 hl=2 l= 11 cons: SET
14 34:d=3 hl=2 l= 9 cons: SEQUENCE
[all …]
|
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| D | sanitizer_list_test.cc | 26 static void SetList(List *l, ListItem *x = 0, in SetList() argument
28 l->clear(); in SetList()
29 if (x) l->push_back(x); in SetList()
30 if (y) l->push_back(y); in SetList()
31 if (z) l->push_back(z); in SetList()
34 static void CheckList(List *l, ListItem *i1, ListItem *i2 = 0, ListItem *i3 = 0, in CheckList() argument
37 CHECK_EQ(l->front(), i1); in CheckList()
38 l->pop_front(); in CheckList()
41 CHECK_EQ(l->front(), i2); in CheckList()
42 l->pop_front(); in CheckList()
[all …]
|
| /external/cronet/third_party/libxml/src/ |
| D | list.c | 59 xmlLinkDeallocator(xmlListPtr l, xmlLinkPtr lk) in xmlLinkDeallocator() argument
63 if(l->linkDeallocator) in xmlLinkDeallocator()
64 l->linkDeallocator(lk); in xmlLinkDeallocator()
98 xmlListLowerSearch(xmlListPtr l, void *data) in xmlListLowerSearch() argument
102 if (l == NULL) in xmlListLowerSearch()
104 … for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next); in xmlListLowerSearch()
118 xmlListHigherSearch(xmlListPtr l, void *data) in xmlListHigherSearch() argument
122 if (l == NULL) in xmlListHigherSearch()
124 … for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev); in xmlListHigherSearch()
138 xmlListLinkSearch(xmlListPtr l, void *data) in xmlListLinkSearch() argument
[all …]
|
| /external/libxml2/ |
| D | list.c | 59 xmlLinkDeallocator(xmlListPtr l, xmlLinkPtr lk) in xmlLinkDeallocator() argument
63 if(l->linkDeallocator) in xmlLinkDeallocator()
64 l->linkDeallocator(lk); in xmlLinkDeallocator()
98 xmlListLowerSearch(xmlListPtr l, void *data) in xmlListLowerSearch() argument
102 if (l == NULL) in xmlListLowerSearch()
104 … for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next); in xmlListLowerSearch()
118 xmlListHigherSearch(xmlListPtr l, void *data) in xmlListHigherSearch() argument
122 if (l == NULL) in xmlListHigherSearch()
124 … for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev); in xmlListHigherSearch()
138 xmlListLinkSearch(xmlListPtr l, void *data) in xmlListLinkSearch() argument
[all …]
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/ |
| D | TestUnicodeKnownIssues.java | 29 List<String> l = printToList(uki); in TestBasic() local
30 assertNotNull("no list", l); in TestBasic()
31 assertEquals("message count Of Three", 3, l.size()); in TestBasic()
32 assertTrue(l.get(0) + "#0 says Known Issues", l.get(0).contains("Known Issues")); in TestBasic()
33 assertTrue(l.get(1) + "#1 has atlassian URL", l.get(1).contains("browse/ICU-21756")); in TestBasic()
34 assertTrue(l.get(2) + "#2 says a/b/c", l.get(2).contains("a/b/c")); in TestBasic()
43 List<String> l = printToList(uki); in TestNotCurtailed() local
44 assertNotNull("no list", l); in TestNotCurtailed()
45 assertEquals("message count Of 5", 5, l.size()); in TestNotCurtailed()
46 assertTrue(l.get(0) + "#0 says Known Issues", l.get(0).contains("Known Issues")); in TestNotCurtailed()
[all …]
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/ |
| D | TestUnicodeKnownIssues.java | 26 List<String> l = printToList(uki); in TestBasic() local
27 assertNotNull("no list", l); in TestBasic()
28 assertEquals("message count Of Three", 3, l.size()); in TestBasic()
29 assertTrue(l.get(0) + "#0 says Known Issues", l.get(0).contains("Known Issues")); in TestBasic()
30 assertTrue(l.get(1) + "#1 has atlassian URL", l.get(1).contains("browse/ICU-21756")); in TestBasic()
31 assertTrue(l.get(2) + "#2 says a/b/c", l.get(2).contains("a/b/c")); in TestBasic()
40 List<String> l = printToList(uki); in TestNotCurtailed() local
41 assertNotNull("no list", l); in TestNotCurtailed()
42 assertEquals("message count Of 5", 5, l.size()); in TestNotCurtailed()
43 assertTrue(l.get(0) + "#0 says Known Issues", l.get(0).contains("Known Issues")); in TestNotCurtailed()
[all …]
|
| /external/cronet/net/data/name_constraints_unittest/ |
| D | directoryname_and_dnsname_and_ipaddress.pem | 1 0:d=0 hl=4 l= 653 cons: SEQUENCE
2 4:d=1 hl=4 l= 422 cons: cont [ 0 ]
3 8:d=2 hl=2 l= 17 cons: SEQUENCE
4 10:d=3 hl=2 l= 15 cons: cont [ 4 ]
5 12:d=4 hl=2 l= 13 cons: SEQUENCE
6 14:d=5 hl=2 l= 11 cons: SET
7 16:d=6 hl=2 l= 9 cons: SEQUENCE
8 18:d=7 hl=2 l= 3 prim: OBJECT :countryName
9 23:d=7 hl=2 l= 2 prim: PRINTABLESTRING :US
10 27:d=2 hl=2 l= 62 cons: SEQUENCE
[all …]
|
| D | directoryname_and_dnsname.pem | 1 0:d=0 hl=4 l= 413 cons: SEQUENCE
2 4:d=1 hl=4 l= 278 cons: cont [ 0 ]
3 8:d=2 hl=2 l= 17 cons: SEQUENCE
4 10:d=3 hl=2 l= 15 cons: cont [ 4 ]
5 12:d=4 hl=2 l= 13 cons: SEQUENCE
6 14:d=5 hl=2 l= 11 cons: SET
7 16:d=6 hl=2 l= 9 cons: SEQUENCE
8 18:d=7 hl=2 l= 3 prim: OBJECT :countryName
9 23:d=7 hl=2 l= 2 prim: PRINTABLESTRING :US
10 27:d=2 hl=2 l= 62 cons: SEQUENCE
[all …]
|
| /external/exoplayer/tree_15dc86382f17a24a3e881e52e31a810c1ea44b49/testdata/src/test/assets/media/ts/ |
| D | sample_eac3.ts | 2 …l����l� EAC3���0Z������������������������������������������������������������������������������…
|
| /external/exoplayer/tree_8e57d3715f9092d5ec54ebe2e538f34bfcc34479/testdata/src/test/assets/media/ts/ |
| D | sample_eac3.ts | 2 …l����l� EAC3���0Z������������������������������������������������������������������������������…
|
| /external/libcxx/test/std/containers/sequences/list/list.capacity/ |
| D | resize_size.pass.cpp | 22 std::list<int> l(5, 2); in main() local
23 l.resize(2); in main()
24 assert(l.size() == 2); in main()
25 assert(std::distance(l.begin(), l.end()) == 2); in main()
26 assert(l == std::list<int>(2, 2)); in main()
29 std::list<int> l(5, 2); in main() local
30 l.resize(10); in main()
31 assert(l.size() == 10); in main()
32 assert(std::distance(l.begin(), l.end()) == 10); in main()
33 assert(l.front() == 2); in main()
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/containers/sequences/list/list.capacity/ |
| D | resize_size.pass.cpp | 22 std::list<int> l(5, 2); in main() local
23 l.resize(2); in main()
24 assert(l.size() == 2); in main()
25 assert(std::distance(l.begin(), l.end()) == 2); in main()
26 assert(l == std::list<int>(2, 2)); in main()
29 std::list<int> l(5, 2); in main() local
30 l.resize(10); in main()
31 assert(l.size() == 10); in main()
32 assert(std::distance(l.begin(), l.end()) == 10); in main()
33 assert(l.front() == 2); in main()
[all …]
|
| /external/swiftshader/tests/regres/cov/ |
| D | span_test.go | 25 l := cov.SpanList{}
26 l.Add(span(3, 1, 3, 5))
27 checkSpanList(t, l, span(3, 1, 3, 5))
29 l.Add(span(4, 1, 4, 5))
30 checkSpanList(t, l, span(3, 1, 3, 5), span(4, 1, 4, 5))
32 l.Add(span(2, 1, 2, 5))
33 checkSpanList(t, l, span(2, 1, 2, 5), span(3, 1, 3, 5), span(4, 1, 4, 5))
37 l := cov.SpanList{span(1, 1, 1, 5), span(5, 4, 5, 7), span(9, 1, 9, 5)}
40 l.Add(span(5, 1, 5, 5))
41 checkSpanList(t, l, span(1, 1, 1, 5), span(5, 1, 5, 7), span(9, 1, 9, 5))
[all …]
|
| /external/rust/crates/serde/src/ |
| D | macros.rs | 125 ($func:ident<$l:tt, $v:ident>($($arg:ident : $ty:ty),*)) => {
129 $v: $crate::de::Visitor<$l>,
142 (bool<$l:tt, $v:ident>) => {
143 forward_to_deserialize_any_method!{deserialize_bool<$l, $v>()}
145 (i8<$l:tt, $v:ident>) => {
146 forward_to_deserialize_any_method!{deserialize_i8<$l, $v>()}
148 (i16<$l:tt, $v:ident>) => {
149 forward_to_deserialize_any_method!{deserialize_i16<$l, $v>()}
151 (i32<$l:tt, $v:ident>) => {
152 forward_to_deserialize_any_method!{deserialize_i32<$l, $v>()}
[all …]
|