Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 91 - 100 of 205 for AsSlice (0.04 seconds)

  1. src/bufio/bufio.go

    		b.w = 0
    		n, b.err = b.rd.Read(b.buf)
    		if n < 0 {
    			panic(errNegativeRead)
    		}
    		if n == 0 {
    			return 0, b.readErr()
    		}
    		b.w += n
    	}
    
    	// copy as much as we can
    	// Note: if the slice panics here, it is probably because
    	// the underlying reader returned a bad count. See issue 49795.
    	n = copy(p, b.buf[b.r:b.w])
    	b.r += n
    	b.lastByte = int(b.buf[b.r-1])
    	b.lastRuneSize = -1
    	return n, nil
    }
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Feb 06 17:28:40 GMT 2026
    - 22K bytes
    - Click Count (0)
  2. cmd/config.go

    			configHistory = append(configHistory, cfgEntry)
    			count--
    			if count == 0 {
    				break
    			}
    		}
    		if !res.IsTruncated {
    			// We are done here
    			break
    		}
    		marker = res.NextMarker
    	}
    	sort.Slice(configHistory, func(i, j int) bool {
    		return configHistory[i].CreateTime.Before(configHistory[j].CreateTime)
    	})
    	return configHistory, nil
    }
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 5.9K bytes
    - Click Count (0)
  3. cmd/data-usage-utils.go

    	for tier, stats := range ts {
    		infos = append(infos, madmin.TierInfo{
    			Name:  tier,
    			Type:  globalTierConfigMgr.TierType(tier),
    			Stats: stats,
    		})
    	}
    
    	sort.Slice(infos, func(i, j int) bool {
    		if infos[i].Type == "internal" {
    			return true
    		}
    		if infos[j].Type == "internal" {
    			return false
    		}
    		return infos[i].Name < infos[j].Name
    	})
    	return infos
    }
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Mar 10 09:15:15 GMT 2024
    - 6.4K bytes
    - Click Count (0)
  4. src/cmd/cgo/doc.go

    passing a pointer to a field in a struct, the Go memory in question is
    the memory occupied by the field, not the entire struct. When passing a
    pointer to an element in an array or slice, the Go memory in question is
    the entire array or the entire backing array of the slice.
    
    C code may keep a copy of a Go pointer only as long as the memory it
    points to is pinned.
    
    C code may not keep a copy of a Go pointer after the call returns,
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Mon Dec 08 22:37:14 GMT 2025
    - 43.9K bytes
    - Click Count (0)
  5. cmd/xl-storage-format-utils_test.go

    				return false
    			}
    		}
    		return true
    	}
    	if !chkNumVersions(fivs.Versions) {
    		t.Fatalf("Expected all versions to have the same NumVersions")
    	}
    
    	sort.Slice(versions, func(i, j int) bool {
    		if versions[i].IsLatest {
    			return true
    		}
    		if versions[j].IsLatest {
    			return false
    		}
    		return versions[i].ModTime.After(versions[j].ModTime)
    	})
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 7.1K bytes
    - Click Count (0)
  6. src/cmd/asm/internal/lex/lex_test.go

    			"B",
    		),
    		"THIS.\n",
    	},
    	{
    		"nested #define with args",
    		lines(
    			"#define A #define B(x) x",
    			"A",
    			"B(THIS)",
    		),
    		"THIS.\n",
    	},
    	/* This one fails. See comment in Slice.Col.
    	{
    		"nested #define with args",
    		lines(
    			"#define A #define B (x) x",
    			"A",
    			"B(THIS)",
    		),
    		"x.\n",
    	},
    	*/
    }
    
    func TestLex(t *testing.T) {
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Aug 29 07:48:38 GMT 2023
    - 5.8K bytes
    - Click Count (0)
  7. cmd/erasure-healing-common_test.go

    func TestCommonTime(t *testing.T) {
    	// List of test cases for common modTime.
    	testCases := []struct {
    		times  []time.Time
    		time   time.Time
    		quorum int
    	}{
    		{
    			// 1. Tests common times when slice has varying time elements.
    			[]time.Time{
    				time.Unix(0, 1).UTC(),
    				time.Unix(0, 2).UTC(),
    				time.Unix(0, 3).UTC(),
    				time.Unix(0, 3).UTC(),
    				time.Unix(0, 2).UTC(),
    				time.Unix(0, 3).UTC(),
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 22.4K bytes
    - Click Count (0)
  8. cmd/notification.go

    // returns the slice of errors from all function calls.
    func (g *NotificationGroup) Wait() []NotificationPeerErr {
    	g.workers.Wait()
    	return g.errs
    }
    
    // Go calls the given function in a new goroutine.
    //
    // The first call to return a non-nil error will be
    // collected in errs slice and returned by Wait().
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 46K bytes
    - Click Count (0)
  9. android/guava-tests/test/com/google/common/io/FileBackedOutputStreamTest.java

        int chunk2 = dataSize - chunk1;
    
        // Write just enough to not trip the threshold
        if (chunk1 > 0) {
          write(out, data, 0, chunk1, singleByte);
          assertTrue(ByteSource.wrap(data).slice(0, chunk1).contentEquals(source));
        }
        File file = out.getFile();
        assertThat(file).isNull();
    
        // Write data to go over the threshold
        if (chunk2 > 0) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 04:04:26 GMT 2026
    - 8K bytes
    - Click Count (0)
  10. cmd/streaming-v4-unsigned.go

    		n = copy(buf, cr.buffer[cr.offset:])
    		if n == len(buf) {
    			cr.offset += n
    			return n, nil
    		}
    		cr.offset = 0
    		buf = buf[n:]
    	}
    	// mustRead reads from input and compares against provided slice.
    	mustRead := func(b ...byte) error {
    		for _, want := range b {
    			got, err := cr.reader.ReadByte()
    			if err == io.EOF {
    				return io.ErrUnexpectedEOF
    			}
    			if got != want {
    				if cr.debug {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Thu Apr 03 14:55:52 GMT 2025
    - 6.3K bytes
    - Click Count (0)
Back to Top