Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 14 for removeMap (0.21 sec)

  1. 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) {
    Registered: Fri Nov 01 20:58:10 UTC 2024
    - Last Modified: Thu Mar 07 01:59:08 UTC 2024
    - 20.6K bytes
    - Viewed (0)
  2. okhttp/src/test/java/okhttp3/internal/concurrent/TaskRunnerTest.kt

            override fun runOnce(): Long {
              log += "run@${taskFaker.nanoTime}"
              if (schedules.isNotEmpty()) {
                redQueue.schedule(this, schedules.removeAt(0))
              }
              return delays.removeAt(0)
            }
          }
        redQueue.schedule(task, 100.µs)
    
        taskFaker.advanceUntil(0.µs)
        assertThat(log).isEmpty()
    
        taskFaker.advanceUntil(100.µs)
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Apr 29 00:33:04 UTC 2024
    - 23K bytes
    - Viewed (0)
  3. 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);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 34.1K bytes
    - Viewed (0)
  4. 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);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 34.1K bytes
    - Viewed (0)
  5. okhttp-tls/src/main/kotlin/okhttp3/tls/internal/der/DerReader.kt

          }
    
          return result
        } finally {
          peekedHeader = null
          limit = pushedLimit
          constructed = pushedConstructed
          if (name != null) path.removeAt(path.size - 1)
        }
      }
    
      /**
       * Execute [block] with a new namespace for type hints. Type hints from the enclosing type are no
       * longer usable by the current type's members.
       */
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 10.5K bytes
    - Viewed (0)
  6. 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() {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 35.9K bytes
    - Viewed (0)
  7. guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java

        takeIndex = inc(takeIndex);
        --count;
        return x;
      }
    
      /**
       * Utility for remove and iterator.remove: Delete item at position i. Call only when occupying
       * monitor.
       */
      void removeAt(int i) {
        final E[] items = this.items;
        // if removing front item, just advance
        if (i == takeIndex) {
          items[takeIndex] = null;
          takeIndex = inc(takeIndex);
        } else {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Apr 19 19:24:36 UTC 2023
    - 22.5K bytes
    - Viewed (0)
  8. 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() {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 35.9K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/collect/TreeMultiset.java

          }
        }
    
        // Removes the maximum node from this subtree to be reused elsewhere
        @CheckForNull
        private AvlNode<E> removeMax(AvlNode<E> node) {
          if (right == null) {
            return left;
          } else {
            right = right.removeMax(node);
            distinctElements--;
            totalCount -= node.elemCount;
            return rebalance();
          }
        }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 34.1K bytes
    - Viewed (0)
  10. okhttp/src/main/kotlin/okhttp3/internal/concurrent/TaskRunner.kt

        }
        for (i in readyQueues.size - 1 downTo 0) {
          val queue = readyQueues[i]
          queue.cancelAllAndDecide()
          if (queue.futureTasks.isEmpty()) {
            readyQueues.removeAt(i)
          }
        }
      }
    
      interface Backend {
        fun nanoTime(): Long
    
        fun coordinatorNotify(taskRunner: TaskRunner)
    
        fun coordinatorWait(
          taskRunner: TaskRunner,
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Apr 29 00:33:04 UTC 2024
    - 10.6K bytes
    - Viewed (0)
Back to top