void expectAddFailure(SortedMultiset<E> multiset, Entry<E> entry) { try { multiset.add(entry.getElement(), entry.getCount()); fail("Expected IllegalArgumentException"); } catch (IllegalArgumentException expected) { } try { multiset.add(entry.getElement()); fail("Expected IllegalArgumentException"); } catch (IllegalArgumentException expected) { } try { multiset.addAll(Collections.singletonList(entry.getElement())); fail("Expected IllegalArgumentException"); } catch (IllegalArgumentException expected) { } }
public void add(K k) { totK += k.doubleValue(); distribution.add(k, 1); }
public void add(K k, String sample) { totK += k.doubleValue(); if (distribution.count(k) == 0) { System.out.println(k.doubleValue() + " => " + sample); } distribution.add(k, 1); }
void expectAddFailure(SortedMultiset<E> multiset, Entry<E> entry) { try { multiset.add(entry.getElement(), entry.getCount()); fail("Expected IllegalArgumentException"); } catch (IllegalArgumentException expected) {} try { multiset.add(entry.getElement()); fail("Expected IllegalArgumentException"); } catch (IllegalArgumentException expected) {} try { multiset.addAll(Collections.singletonList(entry.getElement())); fail("Expected IllegalArgumentException"); } catch (IllegalArgumentException expected) {} }
for (int i = 0; i < recordCount; i++) { long t = startTime + (long) ((endTime - startTime) * r.nextDouble()); times.add(t);
void expectAddFailure(SortedMultiset<E> multiset, Entry<E> entry) { try { multiset.add(entry.getElement(), entry.getCount()); fail("Expected IllegalArgumentException"); } catch (IllegalArgumentException expected) { } try { multiset.add(entry.getElement()); fail("Expected IllegalArgumentException"); } catch (IllegalArgumentException expected) { } try { multiset.addAll(Collections.singletonList(entry.getElement())); fail("Expected IllegalArgumentException"); } catch (IllegalArgumentException expected) { } }
public void referenceStructure(StructureType type, String name, StructureUsage usage, int line) { SortedMap<String, SortedMap<StructureUsage, SortedMultiset<Integer>>> byName = _structureReferences.computeIfAbsent(type, k -> new TreeMap<>()); SortedMap<StructureUsage, SortedMultiset<Integer>> byUsage = byName.computeIfAbsent(name, k -> new TreeMap<>()); SortedMultiset<Integer> lines = byUsage.computeIfAbsent(usage, k -> TreeMultiset.create()); lines.add(line); }
protected Revision<L, K, V> insertUnsafe(L locator, K key, V value, long version, Action type) throws IllegalStateException { Preconditions.checkState(mutable, "Cannot modify a block that is not mutable"); Revision<L, K, V> revision = makeRevision(locator, key, value, version, type); revisions.add(revision); filter.put(revision.getLocator()); filter.put(revision.getLocator(), revision.getKey()); filter.put(revision.getLocator(), revision.getKey(), revision.getValue()); // NOTE: The entire revision is added // to the filter so that we can // quickly verify that a revision // DOES NOT exist using // #mightContain(L,K,V) without // seeking atomicSize.addAndGet(revision.size() + 4); return revision; }
public void testSortedMultiset() { assertFreshInstance(new TypeToken<SortedMultiset<String>>() {}); SortedMultiset<String> expected = TreeMultiset.create(); expected.add(new FreshValueGenerator().generate(String.class)); assertValueAndTypeEquals(expected, new FreshValueGenerator().generate(new TypeToken<SortedMultiset<String>>() {})); assertNotInstantiable(new TypeToken<Multiset<EmptyEnum>>() {}); }
Revision<L, K, V> revision = makeRevision(locator, key, value, version, type); revisions.add(revision); filter.put(revision.getLocator()); filter.put(revision.getLocator(), revision.getKey());