Search Options

Results per page
Sort
Preferred Languages
Advance

Results 201 - 210 of 313 for _loop_ (0.1 sec)

  1. cmd/encryption-v1.go

    			partStart = i
    			break
    		}
    		cumulativeSum += size
    		encPartSize, _ := sio.EncryptedSize(uint64(size))
    		encCumulativeSum += int64(encPartSize)
    	}
    	// partStart is always found in the loop above,
    	// because off is validated.
    
    	sseDAREEncPackageBlockSize := int64(SSEDAREPackageBlockSize + SSEDAREPackageMetaSize)
    	startPkgNum := (off - cumulativeSum) / SSEDAREPackageBlockSize
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sun Oct 13 13:06:08 UTC 2024
    - 37.2K bytes
    - Viewed (0)
  2. guava/src/com/google/common/collect/CompactHashSet.java

          CompactHashing.tableSet(newTable, targetHash & newMask, targetEntryIndex + 1);
        }
    
        Object oldTable = requireTable();
        int[] entries = requireEntries();
    
        // Loop over current hashtable
        for (int oldTableIndex = 0; oldTableIndex <= oldMask; oldTableIndex++) {
          int oldNext = CompactHashing.tableGet(oldTable, oldTableIndex);
          while (oldNext != UNSET) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 24.9K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/hash/HashTestUtils.java

       * bit(i) can alter output bit(j).
       */
      static void checkNoFunnels(HashFunction function) {
        Random rand = new Random(0);
        int keyBits = 32;
        int hashBits = function.bits();
    
        // output loop tests input bit
        for (int i = 0; i < keyBits; i++) {
          int same = 0x0; // bitset for output bits with same values
          int diff = 0x0; // bitset for output bits with different values
          int count = 0;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 23 14:22:54 UTC 2024
    - 25.5K bytes
    - Viewed (0)
  4. src/bytes/bytes.go

    			// ~1.5-3x faster than Rabin-Karp since n is small.
    			c0 := b[last]
    			c1 := b[last-1] // There are at least 2 chars to match
    		loop:
    			for ; i < len(s); i++ {
    				if s[i] == c0 && s[i-1] == c1 {
    					for k := 2; k < n; k++ {
    						if s[i-k] != b[last-k] {
    							continue loop
    						}
    					}
    					return i - last
    				}
    			}
    		}
    		return -1
    	}
    }
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Sep 03 20:55:15 UTC 2024
    - 35.6K bytes
    - Viewed (0)
  5. src/main/java/jcifs/smb1/smb1/SmbTransport.java

                if ((b = in.read()) == -1) return null;
                sbuf[35] = (byte)b;
            }
    
            key.mid = Encdec.dec_uint16le( sbuf, 34 ) & 0xFFFF;
    
            /* Unless key returned is null or invalid Transport.loop() always
             * calls doRecv() after and no one else but the transport thread
             * should call doRecv(). Therefore it is ok to expect that the data
             * in sbuf will be preserved for copying into BUF in doRecv().
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Fri Mar 22 21:10:40 UTC 2019
    - 31.2K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/collect/FluentIterable.java

       * fluent iterable. The iterator's {@code hasNext()} method returns {@code true} until this fluent
       * iterable is empty.
       *
       * <p><b>Warning:</b> Typical uses of the resulting iterator may produce an infinite loop. You
       * should use an explicit {@code break} or be certain that you will eventually remove all the
       * elements.
       *
       * <p><b>{@code Stream} equivalent:</b> if the source iterable has only a single element {@code
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Sep 24 13:42:31 UTC 2024
    - 35.7K bytes
    - Viewed (0)
  7. src/cmd/asm/internal/arch/arch.go

    	case "s390x":
    		return archS390x()
    	case "wasm":
    		return archWasm()
    	}
    	return nil
    }
    
    func jumpX86(word string) bool {
    	return word[0] == 'J' || word == "CALL" || strings.HasPrefix(word, "LOOP") || word == "XBEGIN"
    }
    
    func jumpRISCV(word string) bool {
    	switch word {
    	case "BEQ", "BEQZ", "BGE", "BGEU", "BGEZ", "BGT", "BGTU", "BGTZ", "BLE", "BLEU", "BLEZ",
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Oct 24 12:32:56 UTC 2024
    - 21.5K bytes
    - Viewed (0)
  8. helm-releases/minio-3.5.4.tgz

    event of a failed command. {{- if .Values.configPathmc }} MC_CONFIG_DIR="{{ .Values.configPathmc }}" MC="/usr/bin/mc --insecure --config-dir ${MC_CONFIG_DIR}" {{- else }} MC="/usr/bin/mc --insecure" {{- end }} # connectToMinio # Use a check-sleep-check loop to wait for MinIO service to be available connectToMinio() { SCHEME=$1 ATTEMPTS=0 ; LIMIT=29 ; # Allow 30 attempts set -e ; # fail if we can't read the keys. ACCESS=$(cat /config/rootUser) ; SECRET=$(cat /config/rootPassword) ; set +e ; # The connections...
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Feb 14 06:04:53 UTC 2022
    - 17.2K bytes
    - Viewed (0)
  9. helm-releases/minio-3.5.5.tgz

    event of a failed command. {{- if .Values.configPathmc }} MC_CONFIG_DIR="{{ .Values.configPathmc }}" MC="/usr/bin/mc --insecure --config-dir ${MC_CONFIG_DIR}" {{- else }} MC="/usr/bin/mc --insecure" {{- end }} # connectToMinio # Use a check-sleep-check loop to wait for MinIO service to be available connectToMinio() { SCHEME=$1 ATTEMPTS=0 ; LIMIT=29 ; # Allow 30 attempts set -e ; # fail if we can't read the keys. ACCESS=$(cat /config/rootUser) ; SECRET=$(cat /config/rootPassword) ; set +e ; # The connections...
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Feb 16 19:44:53 UTC 2022
    - 17.2K bytes
    - Viewed (0)
  10. helm-releases/minio-1.0.2.tgz

    event of a failed command. {{- if .Values.configPathmc }} MC_CONFIG_DIR="{{ .Values.configPathmc }}" MC="/usr/bin/mc --insecure --config-dir ${MC_CONFIG_DIR}" {{- else }} MC="/usr/bin/mc --insecure" {{- end }} # connectToMinio # Use a check-sleep-check loop to wait for Minio service to be available connectToMinio() { SCHEME=$1 ATTEMPTS=0 ; LIMIT=29 ; # Allow 30 attempts set -e ; # fail if we can't read the keys. ACCESS=$(cat /config/rootUser) ; SECRET=$(cat /config/rootPassword) ; set +e ; # The connections...
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Aug 24 18:58:05 UTC 2021
    - 13.6K bytes
    - Viewed (0)
Back to top