void updateOnBufferChange() { if (aggBufMap.size() > aggregateBufferSizeLimit) { aggBufMap.pollLastEntry(); Preconditions.checkState(aggBufMap.size() == aggregateBufferSizeLimit); } currentLastKey = aggBufMap.lastKey(); }
@Override public synchronized Map.Entry<K,V> pollLastEntry() { Map.Entry<K,V> entry = super.pollLastEntry(); boolean removed = removeFromKeys(entry.getKey()); assert removed; return entry; } @Override
if (keys.size() >= maxSize) { int slot = keys.pollLastEntry().getKey();
void updateOnBufferChange() { if (aggBufMap.size() > aggregateBufferSizeLimit) { aggBufMap.pollLastEntry(); Preconditions.checkState(aggBufMap.size() == aggregateBufferSizeLimit); } currentLastKey = aggBufMap.lastKey(); }
/** * return and remove the largest value stored in this * @return the largest value stored in this */ public int pollLastValue() { Map.Entry<Integer, E> last = rmap.pollLastEntry(); map.remove(last.getValue()); return last.getKey(); }
public void add(Span span) { container.put(span.getDuration(), span); if (container.size() > this.initialCapacity) { container.pollLastEntry(); } }
public static void main (String[] args) throws java.lang.Exception { TreeMap<Integer, String> testTreeMap = new TreeMap<>(); //Populate example map with values testTreeMap.put(1,"Test"); testTreeMap.put(0, "Test0"); testTreeMap.put(6, "Test6"); testTreeMap.put(4, "Test4"); testTreeMap.put(2, "Test2"); testTreeMap.put(3, "Test3"); testTreeMap.put(5, "Test5"); int i = 0; while (i <= 3) { System.out.println("Value is: " + testTreeMap.pollLastEntry()); i++; } System.out.println(testTreeMap); }
TreeMap<Integer, String> map = new TreeMap<Integer, String>(); Scanner input = new Scanner(System.in); System.out.print("Enter the number of students: "); int numStudents = input.nextInt(); for (int i = 0; i < numStudents; i++) { System.out.print("Enter the student's name: "); String Student = input.next(); System.out.print("Enter the student's score: "); int Score = input.nextInt(); map.put(Score, Student); } Map.Entry<Integer, String> entry1 = map.pollLastEntry(); Map.Entry<Integer, String> entry2 = map.pollLastEntry(); System.out.println("Highest score: " + entry1.getKey()); System.out.println("Highest scorer: " + entry1.getValue()); System.out.println("Second highest score: " + entry2.getKey()); System.out.println("Second highest scorer: " + entry2.getValue());
private Map<Long, Double> calculateNDeviationForOneMetric(Map<Long, Double> originalDatapoints, Double tolerance, Long pointNum) { if (pointNum > originalDatapoints.size()) { pointNum = (long) originalDatapoints.size(); } // construct list of values Long count = 0L; List<Double> values = new ArrayList<>(); TreeMap<Long, Double> sortedDatapoints = new TreeMap<>(originalDatapoints); Long lastTimestamp = sortedDatapoints.lastKey(); while (count < pointNum) { Map.Entry<Long, Double> lastEntry = sortedDatapoints.pollLastEntry(); values.add(lastEntry.getValue()); count++; } // calculate the deviation against string list Double dev = calculateDeviation(values, tolerance); Map<Long, Double> deviationDatapoints = new TreeMap<>(); deviationDatapoints.put(lastTimestamp, dev); return deviationDatapoints; }
private Map<Long, Double> calculateNDeviationForOneMetric(Map<Long, Double> originalDatapoints, Double tolerance, Long pointNum) { if (pointNum > originalDatapoints.size()) { pointNum = (long) originalDatapoints.size(); } // construct list of values Long count = 0L; List<Double> values = new ArrayList<>(); TreeMap<Long, Double> sortedDatapoints = new TreeMap<>(originalDatapoints); Long lastTimestamp = sortedDatapoints.lastKey(); while (count < pointNum) { Map.Entry<Long, Double> lastEntry = sortedDatapoints.pollLastEntry(); values.add(lastEntry.getValue()); count++; } // calculate the deviation against string list Double dev = calculateDeviation(values, tolerance); Map<Long, Double> deviationDatapoints = new TreeMap<>(); deviationDatapoints.put(lastTimestamp, dev); return deviationDatapoints; }
@Override public QueryableDruidServer pick( TreeMap<Integer, Set<QueryableDruidServer>> prioritizedServers, DataSegment segment ) { final Map.Entry<Integer, Set<QueryableDruidServer>> highestPriorityServers = prioritizedServers.pollLastEntry(); if (highestPriorityServers == null) { return null; } final Set<QueryableDruidServer> servers = highestPriorityServers.getValue(); final int size = servers.size(); switch (size) { case 0: throw new ISE("[%s] Something hella weird going on here. We should not be here", segment.getIdentifier()); case 1: return highestPriorityServers.getValue().iterator().next(); default: return Collections.min(servers, comparator); } } }
@Override public QueryableDruidServer pick(TreeMap<Integer, Set<QueryableDruidServer>> prioritizedServers, DataSegment segment) { final Map.Entry<Integer, Set<QueryableDruidServer>> highestPriorityServers = prioritizedServers.pollLastEntry(); if (highestPriorityServers == null) { return null; } final Set<QueryableDruidServer> servers = highestPriorityServers.getValue(); final int size = servers.size(); switch (size) { case 0: throw new ISE("[%s] Something hella weird going on here. We should not be here", segment.getIdentifier()); case 1: return highestPriorityServers.getValue().iterator().next(); default: return Iterators.get(servers.iterator(), random.nextInt(size)); } } }
@Override Map.Entry<Comparable, Serializable> removeBiggestKeyValue() { TreeMap<Comparable, Serializable> newMap = duplicateMap(); Map.Entry<Comparable, Serializable> lastEntry = newMap.pollLastEntry(); setEntries(newMap); return lastEntry; }
@Override void mergeWithLeftNode(AbstractNode leftNode, Comparable splitKey) { InnerNode left = (InnerNode) leftNode; // this node does not know how to merge with another kind TreeMap<Comparable, AbstractNode> newMap = duplicateMap(); TreeMap<Comparable, AbstractNode> newLeftSubNodes = left.duplicateMap(); // change the parent of all the left sub-nodes InnerNode uncle = newMap.get(BPlusTree.LAST_KEY).getParent(); for (AbstractNode leftSubNode : newLeftSubNodes.values()) { leftSubNode.setParent(uncle); } // remove the entry for left's LAST_KEY Map.Entry<Comparable, AbstractNode> higherLeftValue = newLeftSubNodes.pollLastEntry(); // add the higher left value associated with the split-key newMap.put(splitKey, higherLeftValue.getValue()); // merge the remaining left sub-nodes newMap.putAll(newLeftSubNodes); setSubNodes(newMap); }
break; Map.Entry lastEntry = indexMap.pollLastEntry(); if (lastEntry.getValue().equals(RESOURCE_PATH)) { String pathValue = path;
break; Map.Entry lastEntry = indexMap.pollLastEntry(); if (lastEntry.getValue().equals(RESOURCE_PATH)) { String pathValue = path;
if (keys.size() >= maxSize) { int slot = keys.pollLastEntry().getKey();
if (keys.size() >= maxSize) { int slot = keys.pollLastEntry().getKey();
while (!compositesToTest.isEmpty()) { Entry<BigInteger, Integer> compositeEntry = compositesToTest.pollLastEntry(); N = compositeEntry.getKey(); int exp = compositeEntry.getValue();
case kinematicWaves: while ( !consumableHoles.isEmpty() && distanceFromFromNode < consumableHoles.lastKey() ) { Map.Entry<Double, Hole> entry = consumableHoles.pollLastEntry() ; distanceFromFromNode -= spacingOfOnePCE * entry.getValue().getSizeInEquivalents() ;