| /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/ |
| D | LookupList.java | 17 private Lookup[] lookups; field in LookupList
22 lookups = new Lookup[10]; in LookupList()
28 if (lookupCount >= lookups.length) { in addLookup()
29 Lookup[] newLookups = new Lookup[lookups.length + 5]; in addLookup()
31 System.arraycopy(lookups, 0, newLookups, 0, lookups.length); in addLookup()
32 lookups = newLookups; in addLookup()
35 lookups[lookupCount] = lookup; in addLookup()
56 lookups[i].writeLookup(writer); in writeLookupList()
|
| D | CanonGSUBBuilder.java | 320 int[] lookups = new int[2]; in buildLookups() local
345 lookups[0] = lookupList.addLookup(compLookup); in buildLookups()
346 lookups[1] = lookupList.addLookup(dcmpLookup); in buildLookups()
348 return lookups; in buildLookups()
351 public static void addLookups(Feature feature, int[] lookups) in addLookups() argument
353 for (int i = 0; i < lookups.length; i += 1) { in addLookups()
354 feature.addLookup(lookups[i]); in addLookups()
484 int[] lookups = buildLookups(data, lookupList, script); in buildDecompTables() local
488 addLookups(ccmp, lookups); in buildDecompTables()
|
| /external/harfbuzz_ng/src/ |
| D | hb-ot-map.cc | 36 for (unsigned int i = 0; i < lookups[table_index].len; i++) in collect_lookups()
37 hb_set_add (lookups_out, lookups[table_index][i].index); in collect_lookups()
111 hb_ot_map_t::lookup_map_t *lookup = m.lookups[table_index].push (); in add_lookups()
307 if (last_num_lookups < m.lookups[table_index].len) in compile()
309 m.lookups[table_index].qsort (last_num_lookups, m.lookups[table_index].len); in compile()
312 for (unsigned int i = j + 1; i < m.lookups[table_index].len; i++) in compile()
313 if (m.lookups[table_index][i].index != m.lookups[table_index][j].index) in compile()
314 m.lookups[table_index][++j] = m.lookups[table_index][i]; in compile()
317 m.lookups[table_index][j].mask |= m.lookups[table_index][i].mask; in compile()
318 m.lookups[table_index][j].auto_zwnj &= m.lookups[table_index][i].auto_zwnj; in compile()
[all …]
|
| D | hb-ot-map-private.hh | 121 …tage < stages[table_index].len ? stages[table_index][stage].last_lookup : lookups[table_index].len; in get_stage_lookups()
122 *plookups = end == start ? nullptr : &lookups[table_index][start]; in get_stage_lookups()
126 HB_INTERNAL void collect_lookups (unsigned int table_index, hb_set_t *lookups) const;
137 lookups[table_index].finish (); in finish()
151 hb_prealloced_array_t<lookup_map_t, 32> lookups[2]; /* GSUB/GPOS */ member
|
| D | hb-ot-shape-private.hh | 49 inline void collect_lookups (hb_tag_t table_tag, hb_set_t *lookups) const in collect_lookups()
57 map.collect_lookups (table_index, lookups); in collect_lookups()
|
| D | hb-ot-shape.cc | 948 hb_set_t *lookups = hb_set_create (); in hb_ot_shape_glyphs_closure() local
949 hb_ot_shape_plan_collect_lookups (shape_plan, HB_OT_TAG_GSUB, lookups); in hb_ot_shape_glyphs_closure()
955 for (hb_codepoint_t lookup_index = -1; hb_set_next (lookups, &lookup_index);) in hb_ot_shape_glyphs_closure()
960 hb_set_destroy (lookups); in hb_ot_shape_glyphs_closure()
|
| /external/selinux/libselinux/utils/ |
| D | avcstat.c | 30 unsigned long long lookups; member
185 &tmp.lookups, in main()
194 tot.lookups += tmp.lookups; in main()
208 tot.lookups, tot.hits, tot.misses, in main()
211 rel.lookups = tot.lookups - last.lookups; in main()
218 rel.lookups, rel.hits, rel.misses, in main()
|
| /external/guice/core/src/com/google/inject/internal/ |
| D | DeferredLookups.java | 38 private final List<Element> lookups = Lists.newArrayList(); field in DeferredLookups
48 injector.lookups = injector; in initialize()
49 new LookupProcessor(errors).process(injector, lookups); in initialize()
54 lookups.add(lookup); in getProvider()
60 lookups.add(lookup); in getMembersInjector()
|
| D | EncounterImpl.java | 43 private final Lookups lookups; field in EncounterImpl
51 EncounterImpl(Errors errors, Lookups lookups) { in EncounterImpl() argument
53 this.lookups = lookups; in EncounterImpl()
129 return lookups.getProvider(key); in getProvider()
138 return lookups.getMembersInjector(typeLiteral); in getMembersInjector()
|
| /external/autotest/contrib/ |
| D | dhcp_failed_machines.py | 23 lookups = {} variable
33 lookups[d['fixed-address'].replace(';', '')] = hostname
71 return lookups.get(h, h)
|
| /external/skqp/bench/ |
| D | SkGlyphCacheBench.cpp | 29 for (int lookups = 0; lookups < 10; lookups++) { in do_font_stuff() local
|
| /external/clang/include/clang/AST/ |
| D | DeclLookups.h | 71 inline DeclContext::lookups_range DeclContext::lookups() const { in lookups() function
85 return lookups().begin(); in lookups_begin()
89 return lookups().end(); in lookups_end()
|
| /external/skia/bench/ |
| D | SkGlyphCacheBench.cpp | 29 for (int lookups = 0; lookups < 10; lookups++) { in do_font_stuff() local
|
| /external/deqp/doc/testspecs/GLES2/ |
| D | performance.texture.format.txt | 36 Test cases measure performance of 2D and cubemap texture lookups without
38 more texture lookups, each targeting different texture unit. There are
41 Texture lookups use same coordinates and lookup results are multiplied
|
| /external/iptables/extensions/ |
| D | libxt_CT.man | 25 \fIid\fP and only have lookups done in that zone. If \fBmark\fP is used
30 \fIid\fP and only have lookups done in that zone. If \fBmark\fP is used
34 Assign this packet to zone \fIid\fP and only have lookups done in that zone.
|
| /external/tensorflow/tensorflow/contrib/tpu/proto/ |
| D | tpu_embedding_config.proto | 5 // The TPUEmbeddingConfiguration contains specification of TPU Embedding lookups
57 // produced by lookups into this table during model evaluation. For each
|
| /external/python/cpython2/Objects/ |
| D | dictnotes.txt | 14 Usually written once with many lookups.
15 When base classes are used, there are many failed lookups
49 justification for d.setdefault is combining the two lookups into one.
212 1) For example, if membership testing or lookups dominate runtime and memory
265 The idea is to exploit key access patterns by anticipating future lookups
266 based on previous lookups.
|
| /external/python/cpython2/Doc/library/ |
| D | bisect.rst | 76 functions show how to transform them into the standard lookups for sorted
120 The :func:`bisect` function can be useful for numeric table lookups. This
135 all of the previous key lookups).
|
| /external/python/cpython3/Doc/library/ |
| D | bisect.rst | 74 functions show how to transform them into the standard lookups for sorted
118 The :func:`bisect` function can be useful for numeric table lookups. This
133 all of the previous key lookups).
|
| /external/python/cpython3/Objects/ |
| D | dictnotes.txt | 13 Usually written once with many lookups.
14 When base classes are used, there are many failed lookups
48 justification for d.setdefault is combining the two lookups into one.
|
| /external/curl/m4/ |
| D | curl-confopts.m4 | 61 AC_MSG_CHECKING([whether to enable c-ares for DNS lookups])
64 AC_HELP_STRING([--enable-ares@<:@=PATH@:>@],[Enable c-ares for DNS lookups])
65 AC_HELP_STRING([--disable-ares],[Disable c-ares for DNS lookups]),
280 dnl AC_MSG_CHECKING([whether to enable threads for DNS lookups])
283 dnl AC_HELP_STRING([--enable-threads@<:@=PATH@:>@],[Enable threads for DNS lookups])
284 dnl AC_HELP_STRING([--disable-threads],[Disable threads for DNS lookups]),
|
| /external/deqp/doc/testspecs/GLES3/ |
| D | functional.fbo.invalidate.txt | 30 + Texture lookups from partially invalidated texture attachment
|
| /external/python/cpython2/Modules/zlib/ |
| D | algorithm.txt | 108 will be two lookups. If you had a compression method with really long
109 symbols, you could have as many levels of lookups as is efficient. For
185 the symbols, it takes on the average 1.25 lookups per symbol. That's compared
186 to one lookup for the single table, or 1.66 lookups per symbol for the
|
| /external/python/cpython3/Modules/zlib/ |
| D | algorithm.txt | 108 will be two lookups. If you had a compression method with really long
109 symbols, you could have as many levels of lookups as is efficient. For
185 the symbols, it takes on the average 1.25 lookups per symbol. That's compared
186 to one lookup for the single table, or 1.66 lookups per symbol for the
|
| /external/syslinux/com32/lib/zlib/ |
| D | algorithm.txt | 108 will be two lookups. If you had a compression method with really long
109 symbols, you could have as many levels of lookups as is efficient. For
185 the symbols, it takes on the average 1.25 lookups per symbol. That's compared
186 to one lookup for the single table, or 1.66 lookups per symbol for the
|