444445446447448449450451452453454
public void value(T key, Counter value) { for (int i = 0; i < value.getCount(); i++) { objectIntProcedure.value(key, index.getCount()); index.increment(); } } }); }
13001301130213031304130513061307130813091310
@Override public boolean add(T item) { Counter counter = this.items.getIfAbsentPut(item, NEW_COUNTER_BLOCK); counter.increment(); this.size++; return true; } public TreeBag<T> with(T element1, T element2, T element3)
7172737475767778798081
Iterate.forEach(iterable, new Procedure<E>() { public void value(E object) { objectIntProcedure.value(object, index.getCount()); index.increment(); } }); } }); }
11151116111711181119112011211122112311241125
{ public void value(T each, P parm) { if (predicate.accept(each, parm)) { count.increment(); } } }, parameter); return count.getCount(); }
10731074107510761077107810791080108110821083
{ public void value(K each, P parm) { if (predicate.accept(each, parm)) { count.increment(); } } }, parameter); return count.getCount(); }
346347348349350351352353354355356
public void value(T key, int count) { for (int i = 0; i < count; i++) { objectIntProcedure.value(key, index.getCount()); index.increment(); } } }); }