Search Options

Results per page
Sort
Preferred Languages
Advance

Results 111 - 120 of 249 for pcount (0.13 sec)

  1. src/net/http/transport.go

    	pconns := t.idleConn[key]
    	var removed bool
    	switch len(pconns) {
    	case 0:
    		// Nothing
    	case 1:
    		if pconns[0] == pconn {
    			delete(t.idleConn, key)
    			removed = true
    		}
    	default:
    		for i, v := range pconns {
    			if v != pconn {
    				continue
    			}
    			// Slide down, keeping most recently-used
    			// conns at the end.
    			copy(pconns[i:], pconns[i+1:])
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Jun 06 21:59:21 UTC 2024
    - 91K bytes
    - Viewed (0)
  2. pkg/controller/disruption/disruption_test.go

    	add(t, dc.podStore, pod)
    	dc.sync(ctx, pdbName)
    	ps.VerifyPdbStatus(t, pdbName, 0, 1, 3, 1, map[string]metav1.Time{})
    }
    
    // Verify that available/expected counts go up as we add pods, then verify that
    // available count goes down when we make a pod unavailable.
    func TestUnavailable(t *testing.T) {
    	_, ctx := ktesting.NewTestContext(t)
    	dc, ps := newFakeDisruptionController(ctx)
    
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sat May 04 18:33:12 UTC 2024
    - 50K bytes
    - Viewed (0)
  3. tensorflow/compiler/mlir/quantization/tensorflow/passes/quantize_composite_functions.cc

              absl::StrSplit(element_str, ':');
          if (key_and_value_pair.size() != 2) {
            float_func.emitError("The attr_map attribute is malformed");
            return failure();
          }
          if (identifier_to_attr.count(
                  llvm::StringRef(std::string(key_and_value_pair[1]))) == 0) {
            float_func.emitWarning(absl::StrCat("Using the default value for the '",
                                                key_and_value_pair[0],
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Apr 25 16:01:03 UTC 2024
    - 54.5K bytes
    - Viewed (0)
  4. src/net/http/fs_test.go

    func (f *fakeFile) Readdir(count int) ([]fs.FileInfo, error) {
    	if !f.fi.dir {
    		return nil, fs.ErrInvalid
    	}
    	var fis []fs.FileInfo
    
    	limit := f.entpos + count
    	if count <= 0 || limit > len(f.fi.ents) {
    		limit = len(f.fi.ents)
    	}
    	for ; f.entpos < limit; f.entpos++ {
    		fis = append(fis, f.fi.ents[f.entpos])
    	}
    
    	if len(fis) == 0 && count > 0 {
    		return fis, io.EOF
    	} else {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 23:39:44 UTC 2024
    - 49.9K bytes
    - Viewed (0)
  5. pkg/kubelet/stats/cri_stats_provider_test.go

    func TestCRIListPodStats(t *testing.T) {
    	ctx := context.Background()
    	var (
    		imageFsMountpoint = "/test/mount/point"
    		unknownMountpoint = "/unknown/mount/point"
    		imageFsInfo       = getTestFsInfo(2000)
    		rootFsInfo        = getTestFsInfo(1000)
    
    		sandbox0           = makeFakePodSandbox("sandbox0-name", "sandbox0-uid", "sandbox0-ns", false)
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Thu Apr 25 14:24:16 UTC 2024
    - 54.5K bytes
    - Viewed (0)
  6. pkg/kubelet/cm/devicemanager/manager_test.go

    	})
    	topology := []cadvisorapi.Node{
    		{Id: 0},
    	}
    	testCases := []struct {
    		description string
    		count       int
    		devices     []pluginapi.Device
    		testfunc    func(manager *wrappedManagerImpl)
    	}{
    		{
    			description: "GetTopologyHints data race when update device",
    			count:       10,
    			devices:     devs,
    			testfunc: func(manager *wrappedManagerImpl) {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Tue Jun 04 06:25:43 UTC 2024
    - 65K bytes
    - Viewed (0)
  7. src/go/types/expr.go

    	var yval constant.Value
    	if y.mode == constant_ {
    		// Provide a good error message for negative shift counts.
    		yval = constant.ToInt(y.val) // consider -1, 1.0, but not -1.1
    		if yval.Kind() == constant.Int && constant.Sign(yval) < 0 {
    			check.errorf(y, InvalidShiftCount, invalidOp+"negative shift count %s", y)
    			x.mode = invalid
    			return
    		}
    
    		if isUntyped(y.typ) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 29 02:09:54 UTC 2024
    - 49.7K bytes
    - Viewed (0)
  8. src/fmt/fmt_test.go

    	switch {
    	case testing.Short():
    		t.Skip("skipping malloc count in short mode")
    	case runtime.GOMAXPROCS(0) > 1:
    		t.Skip("skipping; GOMAXPROCS>1")
    	case race.Enabled:
    		t.Skip("skipping malloc count under race detector")
    	}
    	for _, mt := range mallocTest {
    		mallocs := testing.AllocsPerRun(100, mt.fn)
    		if got, max := mallocs, float64(mt.count); got > max {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 04 17:31:55 UTC 2024
    - 58.6K bytes
    - Viewed (0)
  9. src/cmd/link/internal/ld/elf.go

    		nfile++
    
    		// header
    		s.AddUint16(ctxt.Arch, 1) // table version
    		j := 0
    		for x := l.aux; x != nil; x = x.next {
    			j++
    		}
    		s.AddUint16(ctxt.Arch, uint16(j))                        // aux count
    		s.AddUint32(ctxt.Arch, uint32(dynstr.Addstring(l.file))) // file string offset
    		s.AddUint32(ctxt.Arch, 16)                               // offset from header to first aux
    		if l.next != nil {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Apr 22 13:29:54 UTC 2024
    - 63.6K bytes
    - Viewed (0)
  10. src/go/types/api_test.go

    			}()
    		}
    		wg.Wait()
    
    		if counts[0] != counts[1] {
    			t.Errorf("mismatching method counts for %s: %d vs %d", inst, counts[0], counts[1])
    			continue
    		}
    		for i := 0; i < counts[0]; i++ {
    			if m0, m1 := methods[0][i], methods[1][i]; m0 != m1 {
    				t.Errorf("mismatching methods for %s: %s vs %s", inst, m0, m1)
    			}
    		}
    	}
    }
    
    func TestInstantiateErrors(t *testing.T) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 01:00:11 UTC 2024
    - 94.2K bytes
    - Viewed (0)
Back to top