- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for removeMax (0.27 sec)
-
android/guava/src/com/google/common/collect/TreeMultiset.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* visit elements during a traversal once and only once. */ @VisibleForTesting @CanIgnoreReturnValue @CheckForNull MoveDesc<E> removeAt(int index) { checkPositionIndex(index, size); modCount++; size--; if (size == index) { queue[size] = null; return null; } E actualLastElement = elementData(size);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
if (value == 8) { iter.remove(); } } assertIntact(q); assertThat(result).containsExactly(1, 15, 13, 8, 14); } /** * This tests a special case of the removeAt() call. Moving an element sideways on the heap could * break the invariants. Sometimes we need to bubble an element up instead of trickling down. See * implementation. */ public void testInvalidatingRemove() {
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) -
src/main/java/org/codelibs/core/collection/ArrayMap.java
* インデックスで指定された位置のエントリを削除します。 * * @param index * インデックス * @return インデックスで指定された位置にあったエントリの値 */ public V removeAt(final int index) { final Entry<K, V> e = removeList(index); final V value = e.value; removeMap(e.key); e.clear(); return value; } @Override public void putAll(final Map<? extends K, ? extends V> map) {
Java - Registered: Fri May 03 20:58:11 GMT 2024 - Last Modified: Thu Mar 07 01:59:08 GMT 2024 - 20.6K bytes - Viewed (1) -
android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
if (value == 8) { iter.remove(); } } assertIntact(q); assertThat(result).containsExactly(1, 15, 13, 8, 14); } /** * This tests a special case of the removeAt() call. Moving an element sideways on the heap could * break the invariants. Sometimes we need to bubble an element up instead of trickling down. See * implementation. */ public void testInvalidatingRemove() {
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)