Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 158 for slice (0.12 sec)

  1. tests/associations_has_many_test.go

    		&Pet{Name: "pet-slice-append-1"},
    		[]*Pet{{Name: "pet-slice-append-2-1"}, {Name: "pet-slice-append-2-2"}},
    		&Pet{Name: "pet-slice-append-3"},
    	)
    
    	AssertAssociationCount(t, users, "Pets", 10, "After Append")
    
    	// Replace -> same as append
    	DB.Model(&users).Association("Pets").Replace(
    		[]*Pet{{Name: "pet-slice-replace-1-1"}, {Name: "pet-slice-replace-1-2"}},
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Fri Sep 12 04:33:27 UTC 2025
    - 16.3K bytes
    - Viewed (0)
  2. src/bytes/bytes.go

    }
    
    // Compare returns an integer comparing two byte slices lexicographically.
    // The result will be 0 if a == b, -1 if a < b, and +1 if a > b.
    // A nil argument is equivalent to an empty slice.
    func Compare(a, b []byte) int {
    	return bytealg.Compare(a, b)
    }
    
    // explode splits s into a slice of UTF-8 sequences, one per Unicode code point (still slices of bytes),
    // up to a maximum of n byte slices. Invalid UTF-8 sequences are chopped into individual bytes.
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Tue Sep 16 16:42:15 UTC 2025
    - 35.5K bytes
    - Viewed (0)
  3. cmd/erasure-metadata-utils.go

    }
    
    // shuffleCheckParts - shuffle CheckParts slice depending on the
    // erasure distribution.
    func shuffleCheckParts(parts []int, distribution []int) []int {
    	return shuffleWithDist[int](parts, distribution)
    }
    
    // shuffleDisks - shuffle input disks slice depending on the
    // erasure distribution. Return shuffled slice of disks with
    // their expected distribution.
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 11.7K bytes
    - Viewed (0)
  4. src/test/java/jcifs/EncodableTest.java

    class EncodableTest {
    
        // Generates a few representative slices and destination indices.
        static Stream<Arguments> byteEncodableArgs() {
            return Stream.of(
                    // srcLen, off, len, dstIndex
                    Arguments.of(makeSeq(8), 0, 8, 0), // full copy at index 0
                    Arguments.of(makeSeq(10), 2, 5, 3), // middle slice, non-zero dst index
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 4.6K bytes
    - Viewed (0)
  5. src/bytes/buffer.go

    // Bytes returns a slice of length b.Len() holding the unread portion of the buffer.
    // The slice is valid for use only until the next buffer modification (that is,
    // only until the next call to a method like [Buffer.Read], [Buffer.Write], [Buffer.Reset], or [Buffer.Truncate]).
    // The slice aliases the buffer content at least until the next buffer modification,
    // so immediate changes to the slice will affect the result of future reads.
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Fri Nov 14 19:01:17 UTC 2025
    - 16.5K bytes
    - Viewed (0)
  6. doc/go_spec.html

    The <i>capacity</i> is a measure of that extent: it is the sum of
    the length of the slice and the length of the array beyond the slice;
    a slice of length up to that capacity can be created by
    <a href="#Slice_expressions"><i>slicing</i></a> a new one from the original slice.
    The capacity of a slice <code>a</code> can be discovered using the
    built-in function <a href="#Length_and_capacity"><code>cap(a)</code></a>.
    </p>
    
    <p>
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Tue Dec 02 23:07:19 UTC 2025
    - 286.5K bytes
    - Viewed (1)
  7. src/bytes/iter.go

    // but without constructing a new slice containing the subslices.
    // It returns a single-use iterator.
    func SplitSeq(s, sep []byte) iter.Seq[[]byte] {
    	return splitSeq(s, sep, 0)
    }
    
    // SplitAfterSeq returns an iterator over subslices of s split after each instance of sep.
    // The iterator yields the same subslices that would be returned by [SplitAfter](s, sep),
    // but without constructing a new slice containing the subslices.
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 3.6K bytes
    - Viewed (0)
  8. docs/en/docs/js/custom.js

                                console.error("Custom prompt found but no end delimiter", line)
                            }
                            const prompt = line.slice(0, promptStart).replace(customPromptLiteralStart, "")
                            let value = line.slice(promptStart + promptLiteralStart.length);
                            useLines.push({
                                type: "input",
                                value: value,
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Mon Sep 22 15:11:52 UTC 2025
    - 6.3K bytes
    - Viewed (2)
  9. association.go

    		} else if rv.IsValid() {
    			results = append(results, rv.Interface())
    		}
    	}
    
    	// Process each argument; if an argument is a slice/array, expand its elements
    	for _, value := range values {
    		rv := reflect.ValueOf(value)
    		if rv.Kind() == reflect.Slice || rv.Kind() == reflect.Array {
    			for i := 0; i < rv.Len(); i++ {
    				appendToResult(rv.Index(i))
    			}
    		} else {
    			appendToResult(rv)
    		}
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Sun Oct 26 12:09:12 UTC 2025
    - 23.6K bytes
    - Viewed (0)
  10. internal/grid/types.go

    // When sent as a parameter, the caller gives up ownership of the byte slice.
    // When returned as response, the handler also gives up ownership of the byte slice.
    func NewBytesWith(b []byte) *Bytes {
    	bb := Bytes(b)
    	return &bb
    }
    
    // NewBytesWithCopyOf returns a new byte slice with a copy of the provided content.
    func NewBytesWithCopyOf(b []byte) *Bytes {
    	if b == nil {
    		bb := Bytes(nil)
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 15.5K bytes
    - Viewed (0)
Back to top