Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 190 for spice (0.06 seconds)

  1. 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.
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Nov 14 19:01:17 GMT 2025
    - 16.5K bytes
    - Click Count (0)
  2. src/bytes/bytes.go

    // It splits the slice s around each instance of one or more consecutive white space
    // characters, as defined by [unicode.IsSpace], returning a slice of subslices of s or an
    // empty slice if s contains only white space. Every element of the returned slice is
    // non-empty. Unlike [Split], leading and trailing runs of white space characters
    // are discarded.
    func Fields(s []byte) [][]byte {
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Sep 16 16:42:15 GMT 2025
    - 35.5K bytes
    - Click Count (0)
  3. src/bytes/bytes_test.go

    	return predicate{
    		func(r rune) bool {
    			return !p.f(r)
    		},
    		"not " + p.name,
    	}
    }
    
    var trimFuncTests = []TrimFuncTest{
    	{isSpace, space + " hello " + space,
    		[]byte("hello"),
    		[]byte("hello " + space),
    		[]byte(space + " hello")},
    	{isDigit, "\u0e50\u0e5212hello34\u0e50\u0e51",
    		[]byte("hello"),
    		[]byte("hello34\u0e50\u0e51"),
    		[]byte("\u0e50\u0e5212hello")},
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Dec 23 23:54:14 GMT 2025
    - 62.9K bytes
    - Click Count (0)
  4. src/archive/tar/strconv.go

    }
    
    // parsePAXRecord parses the input PAX record string into a key-value pair.
    // If parsing is successful, it will slice off the currently read record and
    // return the remainder as r.
    func parsePAXRecord(s string) (k, v, r string, err error) {
    	// The size field ends at the first space.
    	nStr, rest, ok := strings.Cut(s, " ")
    	if !ok {
    		return "", "", s, ErrHeader
    	}
    
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Mon Sep 08 17:08:20 GMT 2025
    - 9.1K bytes
    - Click Count (0)
  5. internal/ringbuffer/ring_buffer.go

    	return &RingBuffer{
    		buf:  b,
    		size: len(b),
    	}
    }
    
    // SetBlocking sets the blocking mode of the ring buffer.
    // If block is true, Read and Write will block when there is no data to read or no space to write.
    // If block is false, Read and Write will return ErrIsEmpty or ErrIsFull immediately.
    // By default, the ring buffer is not blocking.
    // This setting should be called before any Read or Write operation or after a Reset.
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 13.3K bytes
    - Click Count (0)
  6. cmd/signature-v4-parser.go

    	if signFields[0] != "Signature" {
    		return "", ErrMissingSignTag
    	}
    	if signFields[1] == "" {
    		return "", ErrMissingFields
    	}
    	signature := signFields[1]
    	return signature, ErrNone
    }
    
    // Parse slice of signed headers from signed headers tag.
    func parseSignedHeader(signedHdrElement string) ([]string, APIErrorCode) {
    	signedHdrFields := strings.Split(strings.TrimSpace(signedHdrElement), "=")
    	if len(signedHdrFields) != 2 {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Oct 10 18:57:35 GMT 2025
    - 9.4K bytes
    - Click Count (0)
  7. 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>
    
    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)
  8. 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"}},
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Fri Sep 12 04:33:27 GMT 2025
    - 16.3K bytes
    - Click Count (0)
  9. 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.
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 11.7K bytes
    - Click Count (0)
  10. 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.
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed Sep 03 14:04:47 GMT 2025
    - 3.6K bytes
    - Click Count (0)
Back to Top