Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 8 of 8 for concatenating (0.13 seconds)

  1. cmd/erasure-multipart.go

    	}
    	return errors.New(part.Error)
    }
    
    // CompleteMultipartUpload - completes an ongoing multipart
    // transaction after receiving all the parts indicated by the client.
    // Returns an md5sum calculated by concatenating all the individual
    // md5sums of all the parts.
    //
    // Implements S3 compatible Complete multipart API.
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Oct 24 04:05:31 GMT 2025
    - 47.1K bytes
    - Click Count (0)
  2. doc/go_spec.html

    </pre>
    
    <h4 id="String_concatenation">String concatenation</h4>
    
    <p>
    Strings can be concatenated using the <code>+</code> operator
    or the <code>+=</code> assignment operator:
    </p>
    
    <pre>
    s := "hi" + string(c)
    s += " and good bye"
    </pre>
    
    <p>
    String addition creates a new string by concatenating the operands.
    </p>
    
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Dec 02 23:07:19 GMT 2025
    - 286.5K bytes
    - Click Count (1)
  3. cmd/dummy-data-generator_test.go

    type DummyDataGen struct {
    	b           []byte
    	idx, length int64
    }
    
    // NewDummyDataGen returns a ReadSeeker over the first `totalLength`
    // bytes from the infinite stream consisting of repeated
    // concatenations of `alphabets`.
    //
    // The skipOffset (generally = 0) can be used to skip a given number
    // of bytes from the beginning of the infinite stream. This is useful
    // to compare such streams of bytes that may be split up, because:
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 4.8K bytes
    - Click Count (0)
  4. guava/src/com/google/common/collect/Iterators.java

         * is the only one in use, but if we encounter nested concatenations, we start a deque of
         * meta-iterators rather than letting the nesting get arbitrarily deep.  This keeps each
         * operation O(1).
         */
    
        private @Nullable Iterator<? extends Iterator<? extends T>> topMetaIterator;
    
        // Only becomes nonnull if we encounter nested concatenations.
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Sep 16 12:42:11 GMT 2025
    - 51.4K bytes
    - Click Count (0)
  5. cmd/iam.go

    // AssumeRoleWithCertificate case, the "virtual" parent user is the value of the
    // `Subject.CommonName` field. For the OIDC (without RoleARN) case the "virtual"
    // parent is derived as a concatenation of the `sub` and `iss` fields. The
    // policies applicable to the STS credential are associated with this "virtual"
    // parent.
    //
    // When a policyName is given to this function, the policy association is
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Wed Oct 15 17:00:45 GMT 2025
    - 76.5K bytes
    - Click Count (0)
  6. RELEASE.md

            decorator.
        *   Added a `tf.keras.layers.experimental.preprocessing.HashedCrossing`
            layer which applies the hashing trick to the concatenation of crossed
            scalar inputs. This provides a stateless way to try adding feature
            crosses of integer or string data to a model.
        *   Removed `keras.layers.experimental.preprocessing.CategoryCrossing`.
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  7. lib/fips140/v1.0.0-c2097c7c.zip

    keyLength || int64(numBlocks) > maxBlocks { return nil, errors.New("pbkdf2: keyLength too long") } var buf [4]byte dk := make([]byte, 0, numBlocks*hashLen) U := make([]byte, hashLen) for block := 1; block <= numBlocks; block++ { // N.B.: || means concatenation, ^ means XOR // for each block T_i = U_1 ^ U_2 ^ ... ^ U_iter // U_1 = PRF(password, salt || uint(i)) prf.Reset() prf.Write(salt) buf[0] = byte(block >> 24) buf[1] = byte(block >> 16) buf[2] = byte(block >> 8) buf[3] = byte(block) prf.Write(buf[:4])...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  8. lib/fips140/v1.1.0-rc1.zip

    keyLength || int64(numBlocks) > maxBlocks { return nil, errors.New("pbkdf2: keyLength too long") } var buf [4]byte dk := make([]byte, 0, numBlocks*hashLen) U := make([]byte, hashLen) for block := 1; block <= numBlocks; block++ { // N.B.: || means concatenation, ^ means XOR // for each block T_i = U_1 ^ U_2 ^ ... ^ U_iter // U_1 = PRF(password, salt || uint(i)) prf.Reset() prf.Write(salt) buf[0] = byte(block >> 24) buf[1] = byte(block >> 16) buf[2] = byte(block >> 8) buf[3] = byte(block) prf.Write(buf[:4])...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top