- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for skipName (0.17 sec)
-
guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
} /** * This tests a special case where removeAt has to trickle an element first down one level from a * min to a max level, then up one level above the index of the removed element. It also tests * that skipMe in the iterator plays nicely with forgetMeNot. */ public void testIteratorInvalidatingIteratorRemove2() { MinMaxPriorityQueue<Integer> mmHeap = MinMaxPriorityQueue.create(); mmHeap.addAll(
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
if (forgetMeNot == null || skipMe == null) { forgetMeNot = new ArrayDeque<>(); skipMe = new ArrayList<>(3); } if (!foundAndRemovedExactReference(skipMe, moved.toTrickle)) { forgetMeNot.add(moved.toTrickle); } if (!foundAndRemovedExactReference(forgetMeNot, moved.replaced)) { skipMe.add(moved.replaced); } }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
} /** * This tests a special case where removeAt has to trickle an element first down one level from a * min to a max level, then up one level above the index of the removed element. It also tests * that skipMe in the iterator plays nicely with forgetMeNot. */ public void testIteratorInvalidatingIteratorRemove2() { MinMaxPriorityQueue<Integer> mmHeap = MinMaxPriorityQueue.create(); mmHeap.addAll(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0)