Search Options

Results per page
Sort
Preferred Languages
Advance

Results 81 - 90 of 778 for iterations (0.12 sec)

  1. guava/src/com/google/common/cache/CacheBuilder.java

     * entries may be counted in {@link Cache#size}, but will never be visible to read or write
     * operations.
     *
     * <p>Certain cache configurations will result in the accrual of periodic maintenance tasks which
     * will be performed during write operations, or during occasional read operations in the absence of
     * writes. The {@link Cache#cleanUp} method of the returned cache will also perform maintenance, but
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 19:07:49 UTC 2024
    - 51.6K bytes
    - Viewed (0)
  2. docs/distributed/README.md

    - [Deploy a Tenant from the MinIO Operator](https://min.io/docs/minio/kubernetes/upstream/operations/install-deploy-manage/deploy-minio-tenant.html)
    
    Install Distributed MinIO on Linux:
    - [Deploy Distributed MinIO on Linux](https://min.io/docs/minio/linux/operations/install-deploy-manage/deploy-minio-multi-node-multi-drive.html#deploy-distributed-minio)
    
    ### 2. Run distributed MinIO
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Jan 18 07:03:17 UTC 2024
    - 8.8K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/collect/CompactLinkedHashMap.java

    /**
     * CompactLinkedHashMap is an implementation of a Map with insertion or LRU iteration order,
     * maintained with a doubly linked list through the entries. All optional operations (put and
     * remove) are supported. Null keys and values are supported.
     *
     * <p>{@code containsKey(k)}, {@code put(k, v)} and {@code remove(k)} are all (expected and
     * amortized) constant time operations. Expected in the hashtable sense (depends on the hash
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Apr 01 16:15:01 UTC 2024
    - 8.5K bytes
    - Viewed (0)
  4. guava/src/com/google/common/hash/LittleEndianByteArray.java

        long result = 0;
        // Due to the way we shift, we can stop iterating once we've run out of data, the rest
        // of the result already being filled with zeros.
    
        // This loop is critical to performance, so please check HashBenchmark if altering it.
        int limit = min(length, 8);
        for (int i = 0; i < limit; i++) {
          // Shift value left while iterating logically through the array.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 9.8K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java

     *   <li>The retrieval operations {@link #peek}, {@link #peekFirst}, {@link #peekLast}, {@link
     *       #element}, and {@link #size} are constant-time.
     *   <li>The enqueuing and dequeuing operations ({@link #offer}, {@link #add}, and all the forms of
     *       {@link #poll} and {@link #remove()}) run in {@code O(log n) time}.
     *   <li>The {@link #remove(Object)} and {@link #contains} operations require linear ({@code O(n)})
     *       time.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 34.1K bytes
    - Viewed (0)
  6. guava/src/com/google/common/collect/CompactLinkedHashMap.java

    /**
     * CompactLinkedHashMap is an implementation of a Map with insertion or LRU iteration order,
     * maintained with a doubly linked list through the entries. All optional operations (put and
     * remove) are supported. Null keys and values are supported.
     *
     * <p>{@code containsKey(k)}, {@code put(k, v)} and {@code remove(k)} are all (expected and
     * amortized) constant time operations. Expected in the hashtable sense (depends on the hash
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Apr 01 16:15:01 UTC 2024
    - 10.2K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/collect/AbstractMapBasedMultiset.java

      abstract ObjectCountHashMap<E> newBackingMap(int distinctElements);
    
      @Override
      public final int count(@CheckForNull Object element) {
        return backingMap.get(element);
      }
    
      // Optional Operations - Modification Operations
    
      /**
       * {@inheritDoc}
       *
       * @throws IllegalArgumentException if the call would result in more than {@link
       *     Integer#MAX_VALUE} occurrences of {@code element} in this multiset.
       */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Mar 06 16:06:58 UTC 2023
    - 8.2K bytes
    - Viewed (0)
  8. android/guava-testlib/src/com/google/common/collect/testing/testers/CollectionIteratorTester.java

        for (E element : collection) { // uses iterator()
          iteratorElements.add(element);
        }
        List<E> expected = copyToList(getOrderedElements());
        assertEquals("Different ordered iteration", expected, iteratorElements);
      }
    
      @CollectionFeature.Require(ALLOWS_NULL_VALUES)
      @CollectionSize.Require(absent = ZERO)
      public void testIterator_nullElement() {
        initCollectionWithNullElement();
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 6K bytes
    - Viewed (0)
  9. guava-testlib/src/com/google/common/collect/testing/testers/CollectionIteratorTester.java

        for (E element : collection) { // uses iterator()
          iteratorElements.add(element);
        }
        List<E> expected = copyToList(getOrderedElements());
        assertEquals("Different ordered iteration", expected, iteratorElements);
      }
    
      @CollectionFeature.Require(ALLOWS_NULL_VALUES)
      @CollectionSize.Require(absent = ZERO)
      public void testIterator_nullElement() {
        initCollectionWithNullElement();
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 6K bytes
    - Viewed (0)
  10. guava/src/com/google/common/collect/MinMaxPriorityQueue.java

     *   <li>The retrieval operations {@link #peek}, {@link #peekFirst}, {@link #peekLast}, {@link
     *       #element}, and {@link #size} are constant-time.
     *   <li>The enqueuing and dequeuing operations ({@link #offer}, {@link #add}, and all the forms of
     *       {@link #poll} and {@link #remove()}) run in {@code O(log n) time}.
     *   <li>The {@link #remove(Object)} and {@link #contains} operations require linear ({@code O(n)})
     *       time.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 34.1K bytes
    - Viewed (0)
Back to top