Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 118 for Hasher (0.04 sec)

  1. guava/src/com/google/common/hash/AbstractByteHasher.java

      protected void update(byte[] b) {
        update(b, 0, b.length);
      }
    
      /** Updates this hasher with {@code len} bytes starting at {@code off} in the given buffer. */
      protected void update(byte[] b, int off, int len) {
        for (int i = off; i < off + len; i++) {
          update(b[i]);
        }
      }
    
      /** Updates this hasher with bytes from the given buffer. */
      protected void update(ByteBuffer b) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 12:40:17 UTC 2025
    - 3.9K bytes
    - Viewed (0)
  2. guava-tests/test/com/google/common/hash/HashTestUtils.java

        Random random2 = new Random(2L);
        Hasher hasher1 = hashFunction.newHasher();
        Hasher hasher2 = hashFunction.newHasher();
        for (int i = 0; i < numActions; i++) {
          RandomHasherAction.pickAtRandom(random1).performAction(random1, ImmutableSet.of(hasher1));
          RandomHasherAction.pickAtRandom(random2).performAction(random2, ImmutableSet.of(hasher2));
        }
    
        Assert.assertEquals(expected1, hasher1.hash());
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 25.6K bytes
    - Viewed (0)
  3. guava/src/com/google/common/hash/Hashing.java

                function.bits(),
                function);
          }
        }
    
        @Override
        HashCode makeHash(Hasher[] hashers) {
          byte[] bytes = new byte[bits() / 8];
          int i = 0;
          for (Hasher hasher : hashers) {
            HashCode newHash = hasher.hash();
            i += newHash.writeBytesTo(bytes, i, newHash.bits() / 8);
          }
          return HashCode.fromBytesNoCopy(bytes);
        }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 22:06:57 UTC 2025
    - 31.1K bytes
    - Viewed (0)
  4. cmd/utils.go

    	if err != nil {
    		return false
    	}
    	if cs == nil || !cs.Type.IsSet() {
    		return false
    	}
    	if cs.Valid() && !cs.Type.Trailing() {
    		r.Body = hash.NewChecker(r.Body, cs.Type.Hasher(), cs.Raw, r.ContentLength)
    	}
    	return true
    }
    
    // http://docs.aws.amazon.com/AmazonS3/latest/dev/UploadingObjects.html
    const (
    	// Maximum object size per PUT request is 5TB.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 33K bytes
    - Viewed (0)
  5. docs/en/docs/async.md

    This is "synchronous" work, you are "synchronized" with the cashier/cook 👨‍🍳. You have to wait 🕙 and be there at the exact moment that the cashier/cook 👨‍🍳 finishes the burgers and gives them to you, or otherwise, someone else might take them.
    
    <img src="/img/async/parallel-burgers/parallel-burgers-04.png" class="illustration">
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:56:21 UTC 2025
    - 24K bytes
    - Viewed (0)
  6. ci/official/utilities/code_check_full.bats

    # the dependencies of that target which include a license notice file are then
    # included when generating that license. Necessary because the license targets
    # in TensorFlow are manually enumerated rather than generated automatically.
    do_external_licenses_check(){
      BUILD_TARGET="$1"
      LICENSES_TARGET="$2"
    
      # grep patterns for targets which are allowed to be missing from the licenses
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Wed Aug 06 20:43:08 UTC 2025
    - 13.4K bytes
    - Viewed (0)
  7. guava/src/com/google/common/math/LongMath.java

       *
       * <p>This differs from {@code Long.bitCount(x) == 1}, because {@code
       * Long.bitCount(Long.MIN_VALUE) == 1}, but {@link Long#MIN_VALUE} is not a power of two.
       */
      // Whenever both tests are cheap and functional, it's faster to use &, | instead of &&, ||
      @SuppressWarnings("ShortCircuitBoolean")
      public static boolean isPowerOfTwo(long x) {
        return x > 0 & (x & (x - 1)) == 0;
      }
    
      /**
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 29 16:20:07 UTC 2025
    - 46.8K bytes
    - Viewed (0)
  8. docs/orchestration/README.md

    compute environment. A cloud-native application is portable and resilient by design, and can scale horizontally by simply replicating. Modern orchestration platforms like Kubernetes, DC/OS make replicating and managing containers in huge clusters easier than ever.
    
    While containers provide isolated application execution environment, orchestration platforms allow seamless scaling by helping replicate and manage containers. MinIO extends this by adding isolated storage environment for each...
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 2.2K bytes
    - Viewed (0)
  9. .github/workflows/contributor-pr.yml

    name: Contributor CI Build
    
    on:
      push:
        branches:
          - master
      pull_request:
        branches:
          - master
    
    concurrency:
      # On master/release, we don't want any jobs cancelled so the sha is used to name the group
      group: ${{ (github.ref == 'refs/heads/master' || github.ref == 'refs/heads/release' ) && format('contributor-pr-base-{0}', github.sha) || format('contributor-pr-{0}', github.ref) }}
      cancel-in-progress: false
    
    env:
    Registered: Wed Sep 10 11:36:15 UTC 2025
    - Last Modified: Thu Sep 04 22:13:34 UTC 2025
    - 4.1K bytes
    - Viewed (0)
  10. docs/sts/README.md

    ### Prerequisites
    
    - [Configuring keycloak](https://github.com/minio/minio/blob/master/docs/sts/keycloak.md) or [Configuring Casdoor](https://github.com/minio/minio/blob/master/docs/sts/casdoor.md)
    - [Configuring etcd](https://github.com/minio/minio/blob/master/docs/sts/etcd.md)
    
    ### Setup MinIO with Identity Provider
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 7.8K bytes
    - Viewed (0)
Back to top