Search Options

Results per page
Sort
Preferred Languages
Advance

Results 71 - 80 of 778 for iterations (0.06 sec)

  1. android/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
    - 52K bytes
    - Viewed (0)
  2. android/guava-testlib/src/com/google/common/collect/testing/testers/CollectionForEachTester.java

      public void testForEachKnownOrder() {
        List<E> elements = new ArrayList<>();
        collection.forEach(elements::add);
        List<E> expected = Helpers.copyToList(getOrderedElements());
        assertEquals("Different ordered iteration", expected, elements);
      }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 31 14:51:04 UTC 2024
    - 2.2K bytes
    - Viewed (0)
  3. guava/src/com/google/common/collect/CompactHashSet.java

     * amortized since some operations can trigger a hash table resize.
     *
     * <p>Unlike {@code java.util.HashSet}, iteration is only proportional to the actual {@code size()},
     * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger
     * than {@code size()}. Furthermore, this structure only depends on a fixed number of arrays; {@code
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 24.9K bytes
    - Viewed (0)
  4. guava/src/com/google/common/collect/CompactLinkedHashSet.java

    /**
     * CompactLinkedHashSet is an implementation of a Set, which a predictable iteration order that
     * matches the insertion order. All optional operations (adding and removing) are supported. All
     * elements, including {@code null}, are permitted.
     *
     * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized)
     * constant time operations. Expected in the hashtable sense (depends on the hash function doing a
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 09 00:15:47 UTC 2024
    - 9.7K bytes
    - Viewed (0)
  5. guava/src/com/google/common/graph/AbstractBaseGraph.java

                if (graph.isDirected()) {
                  return Iterators.unmodifiableIterator(
                      Iterators.concat(
                          Iterators.transform(
                              graph.predecessors(node).iterator(),
                              (N predecessor) -> EndpointPair.ordered(predecessor, node)),
                          Iterators.transform(
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Jan 22 17:29:38 UTC 2024
    - 7.2K bytes
    - Viewed (0)
  6. docs/en/docs/how-to/graphql.md

    # GraphQL
    
    As **FastAPI** is based on the **ASGI** standard, it's very easy to integrate any **GraphQL** library also compatible with ASGI.
    
    You can combine normal FastAPI *path operations* with GraphQL on the same application.
    
    /// tip
    
    **GraphQL** solves some very specific use cases.
    
    It has **advantages** and **disadvantages** when compared to common **web APIs**.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 27 22:39:38 UTC 2024
    - 3.3K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/collect/TreeRangeMap.java

                    return endOfData();
                  } else if (entry.getUpperBound().compareTo(subRange.lowerBound) > 0) {
                    // this might not be true e.g. at the start of the iteration
                    return immutableEntry(entry.getKey().intersection(subRange), entry.getValue());
                  }
                }
                return endOfData();
              }
            };
          }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 22.9K bytes
    - Viewed (0)
  8. okhttp/src/main/kotlin/okhttp3/internal/cache/DiskLruCache.kt

       * `ConcurrentModificationException`, but if new entries are added while iterating, those new
       * entries will not be returned by the iterator. If existing entries are removed during iteration,
       * they will be absent (unless they were already returned).
       *
       * If there are I/O problems during iteration, this iterator fails silently. For example, if the
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 34.7K bytes
    - Viewed (0)
  9. docs/tls/README.md

    * [MinIO Network Encryption Overview](https://min.io/docs/minio/linux/operations/network-encryption.html)
    * [Generate Let's Encrypt Certificate](https://min.io/docs/minio/linux/integrations/generate-lets-encrypt-certificate-using-certbot-for-minio.html)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Sep 29 04:28:45 UTC 2022
    - 8.4K bytes
    - Viewed (0)
  10. docs/chroot/README.md

    ## Explore Further
    
    - [MinIO Erasure Code Overview](https://min.io/docs/minio/linux/operations/concepts/erasure-coding.html)
    - [Use `mc` with MinIO Server](https://min.io/docs/minio/linux/reference/minio-mc.html)
    - [Use `aws-cli` with MinIO Server](https://min.io/docs/minio/linux/integrations/aws-cli-with-minio.html)
    - [Use `minio-go` SDK with MinIO Server](https://min.io/docs/minio/linux/developers/go/minio-go.html)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Sep 29 04:28:45 UTC 2022
    - 1.7K bytes
    - Viewed (0)
Back to top