Search Options

Results per page
Sort
Preferred Languages
Advance

Results 101 - 110 of 1,247 for most (0.98 sec)

  1. guava-testlib/src/com/google/common/testing/ForwardingWrapperTester.java

        }
        if (testsEquals) {
          testEquals(interfaceType, wrapperFunction);
        }
        testToString(interfaceType, wrapperFunction);
      }
    
      /** Returns the most concrete public methods from {@code type}. */
      private static Method[] getMostConcreteMethods(Class<?> type) {
        Method[] methods = type.getMethods();
        for (int i = 0; i < methods.length; i++) {
          try {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 17:27:14 UTC 2025
    - 9.1K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java

            expectedCrc,
            actualCrcHasher);
      }
    
      // From RFC 3720, Section 12.1, the polynomial generator is 0x11EDC6F41.
      // We calculate the constant below by:
      //   1. Omitting the most significant bit (because it's always 1). => 0x1EDC6F41
      //   2. Flipping the bits of the constant so we can process a byte at a time. => 0x82F63B78
      private static final int CRC32C_GENERATOR = 0x1EDC6F41; // 0x11EDC6F41
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 6.6K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/hash/Hashing.java

        checkArgument(iterator.hasNext(), "Must be at least 1 hash code to combine.");
        int bits = iterator.next().bits();
        byte[] resultBytes = new byte[bits / 8];
        for (HashCode hashCode : hashCodes) {
          byte[] nextBytes = hashCode.asBytes();
          checkArgument(
              nextBytes.length == resultBytes.length, "All hashcodes must have the same bit length.");
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Jul 17 15:26:41 UTC 2025
    - 29.8K bytes
    - Viewed (0)
  4. guava/src/com/google/common/cache/CacheLoader.java

       *
       * @param key the non-null key whose value should be loaded
       * @param oldValue the non-null old value corresponding to {@code key}
       * @return the future new value associated with {@code key}; <b>must not be null, must not return
       *     null</b>
       * @throws Exception if unable to reload the result
       * @throws InterruptedException if this method is interrupted. {@code InterruptedException} is
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 9.5K bytes
    - Viewed (0)
  5. docs/features/https.md

            }
          }
    
          /**
           * Returns an input stream containing one or more certificate PEM files. This implementation just
           * embeds the PEM files in Java strings; most applications will instead read this from a resource
           * file that gets bundled with the application.
           */
          private fun trustedCertificatesInputStream(): InputStream {
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sat Dec 24 00:16:30 UTC 2022
    - 10.5K bytes
    - Viewed (0)
  6. android/guava-tests/test/com/google/common/cache/EmptyCachesTest.java

          checkEmpty(entrySet);
          checkEmpty(cache);
        }
      }
    
      /* ---------------- Local utilities -------------- */
    
      /** Most of the tests in this class run against every one of these caches. */
      private Iterable<LoadingCache<Object, Object>> caches() {
        // lots of different ways to configure a LoadingCache
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 11.5K bytes
    - Viewed (0)
  7. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/cache/DiskLruCache.kt

     * and a fixed number of values. Each key must match the regex `[a-z0-9_-]{1,64}`. Values are byte
     * sequences, accessible as streams or files. Each value must be between `0` and `Int.MAX_VALUE`
     * bytes in length.
     *
     * The cache stores its data in a directory on the filesystem. This directory must be exclusive to
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Wed May 28 23:28:25 UTC 2025
    - 34.7K bytes
    - Viewed (0)
  8. guava/src/com/google/common/hash/LittleEndianByteArray.java

       * position + 8. The array must have at least 8 bytes from offset (inclusive).
       *
       * @param input the input bytes
       * @param offset the offset into the array at which to start
       * @return a long of a concatenated 8 bytes
       */
      static long load64(byte[] input, int offset) {
        // We don't want this in production code as this is the most critical part of the loop.
        assert input.length >= offset + 8;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Feb 12 03:49:18 UTC 2025
    - 12.3K bytes
    - Viewed (0)
  9. futures/listenablefuture1/src/com/google/common/util/concurrent/ListenableFuture.java

       * MoreExecutors#directExecutor}. Otherwise, avoid it: See the warnings on the docs for {@code
       * directExecutor}.
       *
       * <p>This is the most general listener interface. For common operations performed using
       * listeners, see {@link Futures}. For a simplified but general listener interface, see {@link
       * Futures#addCallback addCallback()}.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 8K bytes
    - Viewed (0)
  10. guava/src/com/google/common/util/concurrent/ListenableFuture.java

       * MoreExecutors#directExecutor}. Otherwise, avoid it: See the warnings on the docs for {@code
       * directExecutor}.
       *
       * <p>This is the most general listener interface. For common operations performed using
       * listeners, see {@link Futures}. For a simplified but general listener interface, see {@link
       * Futures#addCallback addCallback()}.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 8K bytes
    - Viewed (0)
Back to top