/external/libxml2/test/automata/ |
H A D | po | 7 t 3 4 items 14 items 18 items
|
/external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
H A D | UniformListItem.java | 26 * Class that represents a contiguous list of uniform items. Each 30 * <p>This class inherits its alignment from its items, bumped up to 31 * {@code 4} if the items have a looser alignment requirement. If 46 private final List<T> items; field in class:UniformListItem 53 * @param items {@code non-null and non-empty;} list of items to represent 55 public UniformListItem(ItemType itemType, List<T> items) { argument 56 super(getAlignment(items), writeSize(items)); 62 this.items 74 getAlignment(List<? extends OffsettedItem> items) argument 93 writeSize(List<? extends OffsettedItem> items) argument [all...] |
H A D | MemberIdsSection.java | 44 if (items().size() > MAX_MEMBERS) { 46 throw new DexException("Too many " + memberType + ": " + items().size() 50 for (Object i : items()) {
|
H A D | UniformItemSection.java | 26 * {@link Item} objects. Each of the items must have the same size in 46 Collection<? extends Item> items = items(); 47 int sz = items.size(); 54 return sz * items.iterator().next().writeSize(); 75 for (Item one : items()) { 86 for (Item one : items()) { 96 * Since all items must be the same size, we can use the size 106 * Alters or picks the order for items in this instance if desired, 107 * so that subsequent calls to {@link #items} wil [all...] |
H A D | AnnotationSetItem.java | 38 * {@code non-null;} set of annotations as individual items in an array. 42 private final AnnotationItem[] items; field in class:AnnotationSetItem 53 this.items = new AnnotationItem[annotations.size()]; 57 items[at] = new AnnotationItem(a); 117 int size = items.length; 120 items[i] = byteData.intern(items[i]); 128 AnnotationItem.sortByTypeIdIndex(items); 135 int size = items.length; 145 AnnotationItem item = items[ [all...] |
/external/elfutils/src/backends/ |
H A D | x86_corenote.c | 32 regs_offset, nregloc, reglocs, nitems, items); 37 size_t *nitems, const Ebl_Core_Item **items) 49 *items = &ioperm_item; 35 ioperm_info(GElf_Word descsz, GElf_Word *regs_offset, size_t *nregloc, const Ebl_Register_Location **reglocs, size_t *nitems, const Ebl_Core_Item **items) argument
|
/external/bison/src/ |
H A D | closure.h | 35 rules could be run and which items could be accepted when those 36 items are the active ones. 44 significant). CLOSURE places there the indices of all items which 47 void closure (item_number *items, size_t n);
|
/external/selinux/libsepol/src/ |
H A D | write.c | 60 size_t items; local 70 items = put_entry(buf, sizeof(uint32_t), 3, fp); 71 if (items != 3) 76 items = put_entry(&bit, sizeof(uint32_t), 1, fp); 77 if (items != 1) 80 items = put_entry(&map, sizeof(uint64_t), 1, fp); 81 if (items != 1) 107 size_t items, items2; local 121 items = 1; /* item 0 is used for the item count */ 123 buf32[items 276 size_t items; local 348 size_t items; local 396 size_t items; local 416 size_t items, items2; local 444 size_t items, items2, len; local 472 size_t items, items2, len; local 499 size_t nel, items; local 543 size_t nel, items; local 566 size_t nel, items, len; local 600 size_t items; local 616 size_t items; local 636 unsigned int items, items2; local 681 uint32_t len, items; local 731 uint32_t items, items2, len; local 784 uint32_t len, items; local 810 size_t items, items2; local 839 size_t items, items2, len; local 864 size_t items, items2, len; local 897 int items; local 947 size_t items, items2, len, len2; local 1040 size_t items, items2, len; local 1102 size_t items, items2, len; local 1180 size_t items, items2, len; local 1243 size_t nel, items, len; local 1342 size_t nel, items, len; local 1449 size_t nel = 0, items, len; local 1496 size_t nel, items; local 1545 size_t items, items2; local 1637 size_t items; local 1678 size_t items; local 1700 size_t items; local 1742 size_t items; local 1876 unsigned int items = 2 + scope->decl_ids_len, i; local 1946 size_t items, items2, len; local [all...] |
/external/boringssl/src/ssl/pqueue/ |
H A D | pqueue.c | 66 pitem *items; member in struct:_pqueue 109 assert(pq->items == NULL); 113 pitem *pqueue_peek(pqueue_s *pq) { return pq->items; } 118 for (curr = pq->items; curr; curr = curr->next) { 128 pitem *item = pq->items; 138 piterator pqueue_iterator(pqueue_s *pq) { return pq->items; } 156 if (pq->items == NULL) { 157 pq->items = item; 161 for (curr = NULL, next = pq->items; next != NULL; 170 pq->items [all...] |
/external/icu/icu4c/source/test/perf/leperf/ |
H A D | letrperf.cpp | 19 long *items = 0; variable 22 long items[ITEM_COUNT]; member in struct:OneObject 30 Long items[ITEM_COUNT]; member in struct:CompObject 36 if(items[i]==2) { 47 if(obj.items[i]==2) { 55 long *items2 = ((OneObject*)ref)->items; 75 long *items2 = ((OneObject*)ref)->items; 77 if(items[i]==2) { 91 long *items2 = ((OneObject*)ref)->items; 98 if(items[ [all...] |
/external/chromium-trace/trace-viewer/third_party/Paste/tests/ |
H A D | test_multidict.py | 14 assert d.items() == [('a', 1)] 18 assert d.items() == [('a', 1), ('b', 2), ('c', 3)] 21 assert d.items() == [('a', 1), ('c', 3), ('b', 4)] 26 assert d.items() == [('a', 1), ('c', 3), ('b', 4), ('b', 5)] 29 assert d.items() == [('a', 1), ('c', 3)] 33 assert d.items() == [('a', 1)] 37 assert d.items() == [('a', 1), ('z', item)] 52 assert d.items() == [('a', 1), ('z', []), ('y', 6), ('x', 'x test'), 83 assert d.items() == [(k('a'), u'a test')] 89 assert d.items() [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | Row.java | 17 protected Object[] items; field in class:Row 38 items = new Object[] {a, b}; 43 items = new Object[] {a, b, c}; 48 items = new Object[] {a, b, c, d}; 53 items = new Object[] {a, b, c, d, e}; 61 return (C0) items[0]; 67 return (C1) items[1]; 73 return (C2) items[2]; 79 return (C3) items[3]; 85 return (C4) items[ [all...] |
/external/deqp/framework/delibs/decpp/ |
H A D | deRandom.cpp | 110 static const int items[] = { 3, 42, 45, 123, 654, -123, -90, 0, 43 }; 130 rnd.choose(DE_ARRAY_BEGIN(items), DE_ARRAY_END(items), &itemsDst[0], numItemsPicked); 139 static const int items[] = { 3, 42, 45, 123, 654, -123, -90, 0, 43 }; 144 DE_TEST_ASSERT(expected[i] == rnd.choose<int>(DE_ARRAY_BEGIN(items), DE_ARRAY_END(items))); 150 static const int items[] = { 3, 42, 45, 123, 654, -123, -90, 0 }; 152 DE_STATIC_ASSERT(DE_LENGTH_OF_ARRAY(items) == DE_LENGTH_OF_ARRAY(weights)); 157 DE_TEST_ASSERT(expected[i] == rnd.chooseWeighted<int>(DE_ARRAY_BEGIN(items), DE_ARRAY_END(items), [all...] |
/external/elfutils/src/libebl/ |
H A D | eblcorenote.c | 44 regs_offset, nregloc, reglocs, nitems, items) 52 const Ebl_Core_Item **items; 55 regs_offset, nregloc, reglocs, nitems, items); 67 *items = table; \
|
/external/guava/guava-tests/benchmark/com/google/common/util/concurrent/ |
H A D | MonitorBasedArrayBlockingQueue.java | 68 /** The queued items */ 69 final E[] items; field in class:MonitorBasedArrayBlockingQueue 70 /** items index for next take, poll or remove */ 72 /** items index for next put, offer, or add. */ 74 /** Number of items in the queue */ 97 return (++i == items.length) ? 0 : i; 105 items[putIndex] = x; 115 final E[] items = this.items; 116 E x = items[takeInde [all...] |
/external/mesa3d/src/mesa/program/ |
H A D | prog_cache.c | 47 struct cache_item **items; member in struct:gl_program_cache 84 struct cache_item **items; local 91 items = (struct cache_item**) malloc(size * sizeof(*items)); 92 memset(items, 0, size * sizeof(*items)); 95 for (c = cache->items[i]; c; c = next) { 97 c->next = items[c->hash % size]; 98 items[c->hash % size] = c; 101 free(cache->items); [all...] |
/external/lldb/source/DataFormatters/ |
H A D | TypeCategory.cpp | 120 TypeCategoryImpl::Clear (FormatCategoryItems items) argument 122 if ( (items & eFormatCategoryItemSummary) == eFormatCategoryItemSummary ) 124 if ( (items & eFormatCategoryItemRegexSummary) == eFormatCategoryItemRegexSummary ) 126 if ( (items & eFormatCategoryItemFilter) == eFormatCategoryItemFilter ) 128 if ( (items & eFormatCategoryItemRegexFilter) == eFormatCategoryItemRegexFilter ) 131 if ( (items & eFormatCategoryItemSynth) == eFormatCategoryItemSynth ) 133 if ( (items & eFormatCategoryItemRegexSynth) == eFormatCategoryItemRegexSynth ) 140 FormatCategoryItems items) 143 if ( (items & eFormatCategoryItemSummary) == eFormatCategoryItemSummary ) 145 if ( (items 139 Delete(ConstString name, FormatCategoryItems items) argument 161 GetCount(FormatCategoryItems items) argument 182 AnyMatches(ConstString type_name, FormatCategoryItems items, bool only_enabled, const char** matching_category, FormatCategoryItems* matching_type) argument [all...] |
/external/linux-tools-perf/src/tools/perf/util/ |
H A D | thread_map.c | 26 int items; local 31 items = scandir(name, &namelist, filter, NULL); 32 if (items <= 0) 35 threads = malloc(sizeof(*threads) + sizeof(pid_t) * items); 37 for (i = 0; i < items; i++) 39 threads->nr = items; 42 for (i=0; i<items; i++) 64 int max_threads = 32, items, i; local 96 items = scandir(path, &namelist, filter, NULL); 97 if (items < 161 int items, total_tasks = 0; local [all...] |
/external/freetype/src/gzip/ |
H A D | zutil.c | 83 voidpf zcalloc (voidpf opaque, unsigned items, unsigned size) argument 86 ulg bsize = (ulg)items*size; 142 voidpf zcalloc (voidpf opaque, unsigned items, unsigned size) argument 145 return _halloc((long)items, size); 160 extern voidp ft_scalloc OF((uInt items, uInt size)); 164 voidpf zcalloc (opaque, items, size) 166 unsigned items; 169 if (opaque) items += size - size; /* make compiler happy */ 170 return (voidpf)ft_scalloc(items, size);
|
/external/llvm/utils/llvm-build/llvmbuild/ |
H A D | componentinfo.py | 25 def parse_items(items, has_dependencies = True): 27 kwargs['name'] = items.get_string('name') 28 kwargs['parent'] = items.get_optional_string('parent') 30 kwargs['dependencies'] = items.get_list('dependencies') 98 def parse(subpath, items): 99 kwargs = ComponentInfo.parse_items(items, has_dependencies = False) 116 def parse_items(items): 117 kwargs = ComponentInfo.parse_items(items) 118 kwargs['library_name'] = items.get_optional_string('library_name') 119 kwargs['required_libraries'] = items [all...] |
/external/fonttools/Lib/fontTools/misc/ |
H A D | textTools.py | 38 items = [] 47 items.append(binary) 50 items.append(binary) 51 items.reverse() 53 return ' '.join(items)
|
/external/fonttools/Tools/fontTools/misc/ |
H A D | textTools.py | 38 items = [] 47 items.append(binary) 50 items.append(binary) 51 items.reverse() 53 return ' '.join(items)
|
/external/harfbuzz_ng/src/ |
H A D | gen-arabic-table.py | 69 for value,short in short_value.items(): 121 print "}; /* Table items: %d; occupancy: %d%% */" % (offset, occupancy) 146 for value,short in short_value.items(): 161 items = fields[5].split (' ') 162 shape, items = items[0][1:-1], tuple (int (x, 16) for x in items[1:]) 168 if len (items) != 1: 170 if len (items) != 2 or items[ [all...] |
/external/jsilver/src/com/google/clearsilver/jsilver/resourceloader/ |
H A D | InMemoryResourceLoader.java | 28 * ResourceLoader that pulls all items from memory. This is particularly useful for small templates 37 private ConcurrentMap<String, String> items = new ConcurrentHashMap<String, String>(); field in class:InMemoryResourceLoader 41 String content = items.get(name); 56 items.put(name, contents); 60 items.remove(name); 64 return items;
|
/external/v8/test/mjsunit/ |
H A D | instanceof.js | 63 var items = [ 1, new Number(42), 73 for (var i = 0; i < items.length; i++) { 74 for (var j = 0; j < items.length; j++) { 76 if (items[i] instanceof items[j]) instanceofs++;
|