- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 2,097 for nprend (0.21 sec)
-
guava/src/com/google/common/io/CharStreams.java
checkNotNull(from); checkNotNull(to); char[] buf = new char[DEFAULT_BUF_SIZE]; int nRead; long total = 0; while ((nRead = from.read(buf)) != -1) { to.append(buf, 0, nRead); total += nRead; } return total; } /** * Copies all characters between the {@link Reader} and {@link Writer} objects. Does not close or
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 17 14:35:11 UTC 2023 - 10.9K bytes - Viewed (0) -
src/cmd/fix/typecheck.go
i := 0 // current type being scanned is s[i:j]. nparen := 0 for j := 0; j < len(s); j++ { switch s[j] { case ' ': if i == j { i++ } case '(': nparen++ case ')': nparen-- if nparen < 0 { // probably can't happen return nil } case ',': if nparen == 0 { if i < j { out = append(out, s[i:j]) } i = j + 1 } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 16 22:02:42 UTC 2022 - 20.1K bytes - Viewed (0) -
src/vendor/golang.org/x/net/idna/idna10.0.0.go
err = runeError(r) } continue case mapped, deviation: b = append(b, s[k:start]...) b = info(v).appendMapping(b, s[start:i]) case ignored: b = append(b, s[k:start]...) // drop the rune case unknown: b = append(b, s[k:start]...) b = append(b, "\ufffd"...) } k = i } if k == 0 { // No changes so far.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 20.9K bytes - Viewed (0) -
src/vendor/golang.org/x/net/idna/idna9.0.0.go
continue case mapped, deviation: b = append(b, s[k:start]...) b = info(v).appendMapping(b, s[start:i]) case ignored: b = append(b, s[k:start]...) // drop the rune case unknown: b = append(b, s[k:start]...) b = append(b, "\ufffd"...) } k = i } if k == 0 { // No changes so far. s = norm.NFC.String(s) } else { b = append(b, s[k:]...)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 19.2K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/server/options/server_run_options.go
errors := []error{} if s.LivezGracePeriod < 0 { errors = append(errors, fmt.Errorf("--livez-grace-period can not be a negative value")) } if s.MaxRequestsInFlight < 0 { errors = append(errors, fmt.Errorf("--max-requests-inflight can not be negative value")) } if s.MaxMutatingRequestsInFlight < 0 { errors = append(errors, fmt.Errorf("--max-mutating-requests-inflight can not be negative value")) }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 24 21:53:51 UTC 2023 - 15.4K bytes - Viewed (0) -
cmd/erasure.go
healing++ if inclHealing { healingDisks = append(healingDisks, disks[i]) healingInfos = append(healingInfos, infos[i]) } continue } if !info.Scanning { newDisks = append(newDisks, disks[i]) newInfos = append(newInfos, infos[i]) } else { scanningDisks = append(scanningDisks, disks[i]) scanningInfos = append(scanningInfos, infos[i]) } }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 16K bytes - Viewed (0) -
cmd/endpoint-ellipses.go
// Figure out largest value of total_drives_in_erasure_set which results // in least number of total_drives/total_drives_erasure_set ratio. prevD := divisibleSize / setCounts[0] for _, cnt := range setCounts { if divisibleSize%cnt == 0 { d := divisibleSize / cnt if d <= prevD { prevD = d setSize = cnt } } } return setSize } // possibleSetCountsWithSymmetry returns symmetrical setCounts based on the
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 14.7K bytes - Viewed (0) -
src/text/template/parse/node.go
Pos tr *Tree Nodes []Node // The element nodes in lexical order. } func (t *Tree) newList(pos Pos) *ListNode { return &ListNode{tr: t, NodeType: NodeList, Pos: pos} } func (l *ListNode) append(n Node) { l.Nodes = append(l.Nodes, n) } func (l *ListNode) tree() *Tree { return l.tr } func (l *ListNode) String() string { var sb strings.Builder l.writeTo(&sb) return sb.String() }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:57:51 UTC 2024 - 24.2K bytes - Viewed (0) -
pkg/scheduler/framework/preemption/preemption_test.go
registeredPlugins := append([]tf.RegisterPluginFunc{ tf.RegisterQueueSortPlugin(queuesort.Name, queuesort.New)}, tf.RegisterBindPlugin(defaultbinder.Name, defaultbinder.New), ) var objs []runtime.Object for _, p := range append(tt.testPods, tt.initPods...) { objs = append(objs, p) } for _, n := range tt.nodes { objs = append(objs, n) }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 31 15:52:16 UTC 2024 - 18.7K bytes - Viewed (0) -
pkg/kubelet/cm/cpumanager/topology_hints_test.go
pod := v1.Pod{} pod.UID = types.UID(p) for c := range tc.assignments[p] { container := v1.Container{} container.Name = c pod.Spec.Containers = append(pod.Spec.Containers, container) } activePods = append(activePods, &pod) } m := manager{ policy: &staticPolicy{ topology: topology, }, state: &mockState{ assignments: tc.assignments,
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Apr 24 18:25:29 UTC 2024 - 19K bytes - Viewed (0)