Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for subSlices (0.26 sec)

  1. src/crypto/rand/rand.go

    // On return, n == len(b) if and only if err == nil.
    func Read(b []byte) (n int, err error) {
    	return io.ReadFull(Reader, b)
    }
    
    // batched returns a function that calls f to populate a []byte by chunking it
    // into subslices of, at most, readMax bytes.
    func batched(f func([]byte) error, readMax int) func([]byte) error {
    	return func(out []byte) error {
    		for len(out) > 0 {
    			read := len(out)
    			if read > readMax {
    				read = readMax
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Mar 19 20:02:21 UTC 2024
    - 1.5K bytes
    - Viewed (0)
  2. src/internal/trace/traceviewer/static/trace_viewer_full.html

    this.setPrebuiltSubRows(this.group_,rowsWithHeadings);}};function stripSlice_(slice){if(slice.subSlices!==undefined&&slice.subSlices.length===1){const subSlice=slice.subSlices[0];if(tr.b.math.approximately(subSlice.start,slice.start,1)&&tr.b.math.approximately(subSlice.duration,slice.duration,1)){return subSlice;}}
    return slice;}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Nov 21 20:45:06 UTC 2023
    - 2.5M bytes
    - Viewed (0)
  3. staging/src/k8s.io/apiserver/pkg/storage/value/encrypt/aes/aes_extended_nonce.go

    	if !write { // no need to check cache on write since we always generate a new transformer
    		if transformer := e.cache.get(info, dataCtx); transformer != nil {
    			return transformer, nil
    		}
    
    		// on read, this is a subslice of a much larger slice and we do not want to hold onto that larger slice
    		info = bytes.Clone(info)
    	}
    
    	key, err := e.sha256KDFExpandOnly(info)
    	if err != nil {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Jul 21 19:25:52 UTC 2023
    - 6.8K bytes
    - Viewed (0)
  4. src/runtime/string.go

    	if n == 0 {
    		// Turns out to be a relatively common case.
    		// Consider that you want to parse out data between parens in "foo()bar",
    		// you find the indices and convert the subslice to string.
    		return ""
    	}
    	if raceenabled {
    		racereadrangepc(unsafe.Pointer(ptr),
    			uintptr(n),
    			getcallerpc(),
    			abi.FuncPCABIInternal(slicebytetostring))
    	}
    	if msanenabled {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 01:17:26 UTC 2024
    - 13.4K bytes
    - Viewed (0)
  5. src/bytes/bytes_test.go

    }
    
    var containsTests = []struct {
    	b, subslice []byte
    	want        bool
    }{
    	{[]byte("hello"), []byte("hel"), true},
    	{[]byte("日本語"), []byte("日本"), true},
    	{[]byte("hello"), []byte("Hello, world"), false},
    	{[]byte("東京"), []byte("京東"), false},
    }
    
    func TestContains(t *testing.T) {
    	for _, tt := range containsTests {
    		if got := Contains(tt.b, tt.subslice); got != tt.want {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 03 12:58:37 UTC 2024
    - 56.5K bytes
    - Viewed (0)
  6. src/reflect/type.go

    //
    //go:linkname rtypeOff
    func rtypeOff(section unsafe.Pointer, off int32) *abi.Type {
    	return (*abi.Type)(add(section, uintptr(off), "sizeof(rtype) > 0"))
    }
    
    // typesByString returns the subslice of typelinks() whose elements have
    // the given string representation.
    // It may be empty (no known types with that string) or may have
    // multiple elements (multiple types with that string).
    //
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 29 17:58:53 UTC 2024
    - 85.5K bytes
    - Viewed (0)
  7. RELEASE.md

        *   Allow subslicing Tensors with a single dimension.
        *   Add option to calculate string length in Unicode characters.
        *   Add functionality to SubSlice a tensor.
        *   Add searchsorted (ie lower/upper_bound) op.
        *   Add model explainability to Boosted Trees.
        *   Support negative positions for tf.substr.
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Jun 11 23:24:08 UTC 2024
    - 730.3K bytes
    - Viewed (0)
Back to top