public void testAsMapGetImplementsSortedSet() { for (K key : multimap().keySet()) { SortedSet<V> valueSet = (SortedSet<V>) multimap().asMap().get(key); assertEquals(multimap().valueComparator(), valueSet.comparator()); } }
@MapFeature.Require(SUPPORTS_REMOVE) public void testAsMapRemoveImplementsSortedSet() { List<K> keys = new ArrayList<K>(multimap().keySet()); for (K key : keys) { resetCollection(); SortedSet<V> valueSet = (SortedSet<V>) multimap().asMap().remove(key); assertEquals(multimap().valueComparator(), valueSet.comparator()); } } }
private void invokeDelayedOperations(long currentWorldTime) { List<EntityRef> operationsToInvoke = new LinkedList<>(); Iterator<Long> scheduledOperationsIterator = delayedOperationsSortedByTime.keySet().iterator(); long processedTime; while (scheduledOperationsIterator.hasNext()) { processedTime = scheduledOperationsIterator.next(); if (processedTime > currentWorldTime) { break; } operationsToInvoke.addAll(delayedOperationsSortedByTime.get(processedTime)); scheduledOperationsIterator.remove(); } operationsToInvoke.stream().filter(EntityRef::exists).forEach(delayedEntity -> { final DelayedActionComponent delayedActions = delayedEntity.getComponent(DelayedActionComponent.class); // If there is a DelayedActionComponent, proceed. Else report an error to the log. if (delayedActions != null) { final Set<String> actionIds = delayedActions.removeActionsUpTo(currentWorldTime); saveOrRemoveComponent(delayedEntity, delayedActions); if (!delayedActions.isEmpty()) { delayedOperationsSortedByTime.put(delayedActions.getLowestWakeUp(), delayedEntity); } for (String actionId : actionIds) { delayedEntity.send(new DelayedActionTriggeredEvent(actionId)); } } else { logger.error("ERROR: This entity is missing a DelayedActionComponent: {}. " + "So skipping delayed actions for this entity.", delayedEntity); } }); }
private void invokePeriodicOperations(long currentWorldTime) { List<EntityRef> operationsToInvoke = new LinkedList<>(); Iterator<Long> scheduledOperationsIterator = periodicOperationsSortedByTime.keySet().iterator(); long processedTime; while (scheduledOperationsIterator.hasNext()) { processedTime = scheduledOperationsIterator.next(); if (processedTime > currentWorldTime) { break; } operationsToInvoke.addAll(periodicOperationsSortedByTime.get(processedTime)); scheduledOperationsIterator.remove(); } operationsToInvoke.stream().filter(EntityRef::exists).forEach(periodicEntity -> { final PeriodicActionComponent periodicActionComponent = periodicEntity.getComponent(PeriodicActionComponent.class); // If there is a PeriodicActionComponent, proceed. Else report an error to the log. if (periodicActionComponent != null) { final Set<String> actionIds = periodicActionComponent.getTriggeredActionsAndReschedule(currentWorldTime); saveOrRemoveComponent(periodicEntity, periodicActionComponent); if (!periodicActionComponent.isEmpty()) { periodicOperationsSortedByTime.put(periodicActionComponent.getLowestWakeUp(), periodicEntity); } for (String actionId : actionIds) { periodicEntity.send(new PeriodicActionTriggeredEvent(actionId)); } } else { logger.error("ERROR: This entity is missing a DelayedActionComponent: {}. " + "So skipping delayed actions for this entity", periodicEntity); } }); }
for (String key : sortedApi.keySet()) { System.out.println("## " + key + "\n"); for (String value : sortedApi.get(key)) {
private void internalAdd(int idx, final Document document) { for (String field : document.getFieldNames()) { Iterator<AToken> tokens = parser.parseDocumentField(field, document.getField(field)); SortedSetMultimap<String, Integer> termPositions = TreeMultimap.create(); int tokenCount = 0; while (tokens.hasNext()) { tokenCount++; AToken token = tokens.next(); termPositions.put(token.getText(), token.getPosition()); } for (String term : termPositions.keySet()) { Key key = new Key(field, term); SortedSet<Integer> positionsSet = termPositions.get(term); int[] positions = new int[positionsSet.size()]; int p = 0; for (Integer i : positionsSet) { positions[p++] = i; } DocTermMatchList original = invertedIndex.putIfAbsent(key, new DocTermMatchList(idx, positions, tokenCount)); if (original != null) { original.add(idx, positions, tokenCount); } } } }
@Override public String prettyPrint() { StringBuilder sb = new StringBuilder("Results for BGP ASN use\n"); if (_asns != null) { for (Long asn : _asns.keySet()) { sb.append(" " + asn + "\n"); for (String node : _asns.get(asn)) { sb.append(" " + node + "\n"); } } } return sb.toString(); } }
public void updateRelInMap( SortedSetMultimap<RelNode, CorrelationId> mapRefRelToCorVar) { for (RelNode rel : Lists.newArrayList(mapRefRelToCorVar.keySet())) { if (oldToNewRelMap.containsKey(rel)) { SortedSet<CorrelationId> corVarSet = mapRefRelToCorVar.removeAll(rel); mapRefRelToCorVar.putAll(oldToNewRelMap.get(rel), corVarSet); } } }
public void updateRelInMap( SortedSetMultimap<RelNode, CorrelationId> mapRefRelToCorVar) { for (RelNode rel : Lists.newArrayList(mapRefRelToCorVar.keySet())) { if (oldToNewRelMap.containsKey(rel)) { SortedSet<CorrelationId> corVarSet = mapRefRelToCorVar.removeAll(rel); mapRefRelToCorVar.putAll(oldToNewRelMap.get(rel), corVarSet); } } }
public void updateRelInMap( SortedSetMultimap<RelNode, Correlation> mapRefRelToCorVar) { for (RelNode rel : Lists.newArrayList(mapRefRelToCorVar.keySet())) { if (oldToNewRelMap.containsKey(rel)) { SortedSet<Correlation> corVarSet = mapRefRelToCorVar.removeAll(rel); mapRefRelToCorVar.putAll(oldToNewRelMap.get(rel), corVarSet); } } }
public void testAsMapGetImplementsSortedSet() { for (K key : multimap().keySet()) { SortedSet<V> valueSet = (SortedSet<V>) multimap().asMap().get(key); assertEquals(multimap().valueComparator(), valueSet.comparator()); } }
@MapFeature.Require(SUPPORTS_REMOVE) public void testAsMapRemoveImplementsSortedSet() { List<K> keys = new ArrayList<K>(multimap().keySet()); for (K key : keys) { resetCollection(); SortedSet<V> valueSet = (SortedSet<V>) multimap().asMap().remove(key); assertEquals(multimap().valueComparator(), valueSet.comparator()); } } }
public void testAsMapGetImplementsSortedSet() { for (K key : multimap().keySet()) { SortedSet<V> valueSet = (SortedSet<V>) multimap().asMap().get(key); assertEquals(multimap().valueComparator(), valueSet.comparator()); } }
private Multimap<PortalCollection, String> getLicenses(Long organisationId) { SortedSetMultimap<Collection, ReadableInterval> intervals = licenseCache.getAvailableIntervals(organisationId); ListMultimap<PortalCollection, String> licenseInformation = ArrayListMultimap.create(); for (Collection key : intervals.keySet()) { SortedSet<ReadableInterval> collectionIntervals = intervals.get(key); List<String> values = convertIntervals(collectionIntervals); licenseInformation.putAll(toPortalCollection(key), values); } return licenseInformation; }
@MapFeature.Require(SUPPORTS_REMOVE) public void testAsMapRemoveImplementsSortedSet() { List<K> keys = new ArrayList<K>(multimap().keySet()); for (K key : keys) { resetCollection(); SortedSet<V> valueSet = (SortedSet<V>) multimap().asMap().remove(key); assertEquals(multimap().valueComparator(), valueSet.comparator()); } } }
Sets.union(featuresByBucket.keySet(), treesByBucket.keySet())); for (Integer bucket : Sets.difference(featuresByBucket.keySet(), buckets.keySet())) { SortedSet<Node> refs = featuresByBucket.get(bucket); count += refs.size(); for (Integer bucket : Sets.difference(treesByBucket.keySet(), buckets.keySet())) { SortedSet<Node> refs = treesByBucket.get(bucket); count += aggregateSize(refs); Sets.union(featuresByBucket.keySet(), treesByBucket.keySet())); for (Integer bucket : commonBuckets) {
for (Long asn : asns.keySet()) { if (asns.get(asn).size() >= question.getMinCount()) { answerElement.getAsns().putAll(asn, asns.get(asn));