Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 21 - 30 of 137 for speed (0.04 seconds)

  1. docs/erasure/README.md

    MinIO's erasure coded backend uses high speed [HighwayHash](https://github.com/minio/highwayhash) checksums to protect against Bit Rot.
    
    ## How are drives used for Erasure Code?
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 4.2K bytes
    - Click Count (0)
  2. PULL_REQUESTS_ETIQUETTE.md

       - Flag bugs or critical issues for immediate fixes; suggest non-blocking improvements as follow-up issues.
    
    3. **Flow**:
       - Review promptly to avoid blocking progress.
       - Balance quality and speed—minor issues can be addressed later via issues, not PR blocks.
       - If unable to complete the review, tag another reviewer (e.g., `@username please take over`).
    
    4. **Shared Responsibility**:
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun May 25 16:32:03 GMT 2025
    - 4.7K bytes
    - Click Count (0)
  3. android/guava-tests/test/com/google/common/util/concurrent/ThreadFactoryBuilderTest.java

        assertEquals(1, factory1.newThread(monitoredRunnable).getPriority());
      }
    
      public void testThreadFactory() throws InterruptedException {
        String THREAD_NAME = "ludicrous speed";
        int THREAD_PRIORITY = 1;
        boolean THREAD_DAEMON = false;
        ThreadFactory backingThreadFactory =
            new ThreadFactory() {
              @Override
              public Thread newThread(Runnable r) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 11 20:07:52 GMT 2025
    - 7.6K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/collect/ImmutableCollection.java

     *       <i>deeply</i> immutable.
     * </ul>
     *
     * <h4>Performance notes</h4>
     *
     * <ul>
     *   <li>Implementations can be generally assumed to prioritize memory efficiency, then speed of
     *       access, and lastly speed of creation.
     *   <li>The {@code copyOf} methods will sometimes recognize that the actual copy operation is
     *       unnecessary; for example, {@code copyOf(copyOf(anArrayList))} should copy the data only
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 21.4K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/escape/ArrayBasedCharEscaper.java

        }
        this.safeMin = safeMin;
        this.safeMax = safeMax;
      }
    
      /*
       * This is overridden to improve performance. Rough benchmarking shows that this almost doubles
       * the speed when processing strings that do not require any escaping.
       */
      @Override
      public final String escape(String s) {
        checkNotNull(s); // GWT specific check (do not optimize).
        for (int i = 0; i < s.length(); i++) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 6.2K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/escape/ArrayBasedUnicodeEscaper.java

          this.safeMaxChar = (char) min(safeMax, Character.MIN_HIGH_SURROGATE - 1);
        }
      }
    
      /*
       * This is overridden to improve performance. Rough benchmarking shows that this almost doubles
       * the speed when processing strings that do not require any escaping.
       */
      @Override
      public final String escape(String s) {
        checkNotNull(s); // GWT specific check (do not optimize)
        for (int i = 0; i < s.length(); i++) {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Feb 13 15:45:16 GMT 2025
    - 8.5K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/hash/Hashing.java

        hashFunctions[0] = Murmur3_128HashFunction.GOOD_FAST_HASH_128;
        int seed = GOOD_FAST_HASH_SEED;
        for (int i = 1; i < hashFunctionsNeeded; i++) {
          seed += 1500450271; // a prime; shouldn't matter
          hashFunctions[i] = murmur3_128(seed);
        }
        return new ConcatenatedHashFunction(hashFunctions);
      }
    
      /**
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Jul 17 15:26:41 GMT 2025
    - 29.8K bytes
    - Click Count (0)
  8. CONTRIBUTING.md

    #### Accepting multiple changes
    
    If you have multiple changes to accept (and you're sure they ought to be accepted instead of corrected), you can use the `Accept Changes for all Errors` button to speed the process.
    This button will cause a Javascript alert dialog to appear asking you to type a reason for accepting the changes, e.g. "Added new API for Gradle 8.x".
    
    Created: Wed Dec 31 11:36:14 GMT 2025
    - Last Modified: Tue Nov 25 06:57:22 GMT 2025
    - 19K bytes
    - Click Count (0)
  9. ci/official/README.md

    # Recommended: use a local+remote cache.
    #
    #   Bazel will cache your builds in tensorflow/build_output/cache,
    #   and will also try using public build cache results to speed up
    #   your builds. This usually saves a lot of time, especially when
    #   re-running tests. However, note that:
    #
    #    - New environments like new CUDA versions, changes to manylinux,
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Thu Feb 01 03:21:19 GMT 2024
    - 8K bytes
    - Click Count (0)
  10. guava/src/com/google/common/primitives/UnsignedInteger.java

    import java.math.BigInteger;
    import org.jspecify.annotations.Nullable;
    
    /**
     * A wrapper class for unsigned {@code int} values, supporting arithmetic operations.
     *
     * <p>In some cases, when speed is more important than code readability, it may be faster simply to
     * treat primitive {@code int} values as unsigned, using the methods from {@link UnsignedInts}.
     *
     * <p>See the Guava User Guide article on <a
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 8.3K bytes
    - Click Count (0)
Back to Top