Searched refs:newItems (Results 1 – 8 of 8) sorted by relevance
70 int newItems = 0; in main() local85 newItems++; in main()100 newItems = size(file.iterator()); in main()103 …stem.out.println(langScript + "\t" + file.getLocaleID() + "\t" + sameItems + "\t" + newItems + "\t" in main()105 newItemsTotal += newItems; in main()
483 newItems = []495 newItems.append(value)500 return newItems507 newItems = []522 newItems.append(value)529 return newItems
209 public Alternation or2(Pick[] newItems) { in or2() argument210 return or2(1, newItems); in or2()217 public Alternation or2(int itemWeight, Pick[] newItems) { in or2() argument218 int[] itemWeights = new int[newItems.length]; in or2()220 return or2(itemWeights, newItems); // we don't care about perf in or2()223 public Alternation or2(int[] itemWeights, Pick[] newItems) { in or2() argument224 if (newItems.length != itemWeights.length) { in or2()226 "or lengths must be equal: " + newItems.length + " != " + itemWeights.length); in or2()229 addInternal(newItems); in or2()
152 ImmutableItem[] newItems = (ImmutableItem[])new Object[sortedSet.size()];155 newItems[index++] = makeImmutable(item);158 return ArraySortedSet.of(comparator, newItems);
148 Builder<T> addItems(Iterable<Item> newItems) {149 items.addAll(newItems);
219 newItems = []221 newMinor = len(newItems)222 newItems.append(items[minor])225 data.Item = newItems
553 oldItems, newItems: TItemArray;562 SetLength(newItems, NewCapPow2);563 FItems := newItems;
1289 Item *newItems = (Item*)uprv_malloc(max * sizeof(items[0])); in setItemCapacity() local1291 if(newItems == NULL) { in setItemCapacity()1297 uprv_memcpy(newItems, items, (size_t)itemCount*sizeof(items[0])); in setItemCapacity()1300 items = newItems; in setItemCapacity()