Searched refs:newItems (Results 1 – 7 of 7) sorted by relevance
71 int newItems = 0; in main() local86 newItems++; in main()101 newItems = size(file.iterator()); in main()104 …stem.out.println(langScript + "\t" + file.getLocaleID() + "\t" + sameItems + "\t" + newItems + "\t" in main()106 newItemsTotal += newItems; in main()
152 ImmutableItem[] newItems = (ImmutableItem[])new Object[sortedSet.size()];155 newItems[index++] = makeImmutable(item);158 return ArraySortedSet.of(comparator, newItems);
212 public Alternation or2(Pick[] newItems) { in or2() argument213 return or2(1, newItems); in or2()220 public Alternation or2(int itemWeight, Pick[] newItems) { in or2() argument221 int[] itemWeights = new int[newItems.length]; in or2()223 return or2(itemWeights, newItems); // we don't care about perf in or2()226 public Alternation or2(int[] itemWeights, Pick[] newItems) { in or2() argument227 if (newItems.length != itemWeights.length) { in or2()229 "or lengths must be equal: " + newItems.length + " != " + itemWeights.length); in or2()232 addInternal(newItems); in or2()
219 newItems = []222 newItems.append(items[minor] if minor in usedMinors else [0] * len(items[minor]))230 newMinor = len(newItems)231 newItems.append(items[minor])234 data.Item = newItems
174 Builder<T> addItems(Iterable<Item> newItems) { in addItems() argument175 items.addAll(newItems); in addItems()
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()