- Sort Score
- Result 10 results
- Languages All
Results 121 - 130 of 9,026 for gives (0.05 sec)
-
src/internal/fuzz/mutator.go
} func (m *mutator) randByteOrder() binary.ByteOrder { if m.r.bool() { return binary.LittleEndian } return binary.BigEndian } // chooseLen chooses length of range mutation in range [1,n]. It gives // preference to shorter ranges. func (m *mutator) chooseLen(n int) int { switch x := m.rand(100); { case x < 90: return m.rand(min(8, n)) + 1 case x < 99: return m.rand(min(32, n)) + 1 default:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 18 20:01:34 UTC 2023 - 6.6K bytes - Viewed (0) -
src/runtime/mem.go
// fault, may give back unexpected zeroes, etc.). // 4) Ready - may be accessed safely. // // This set of states is more than is strictly necessary to support all the // currently supported platforms. One could get by with just None, Reserved, and // Ready. However, the Prepared state gives us flexibility for performance
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 19:05:10 UTC 2023 - 6.7K bytes - Viewed (0) -
src/regexp/exec.go
// on runq and appending new threads to nextq. // The step processes the rune c (which may be endOfText), // which starts at position pos and ends at nextPos. // nextCond gives the setting for the empty-width flags after c. func (m *machine) step(runq, nextq *queue, pos, nextPos int, c rune, nextCond *lazyFlag) { longest := m.re.longest for j := 0; j < len(runq.dense); j++ { d := &runq.dense[j]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Jun 04 20:10:54 UTC 2022 - 12.3K bytes - Viewed (0) -
src/internal/profile/proto.go
// // A protocol message must implement the message interface: // decoder() []decoder // encode(*buffer) // // The decode method returns a slice indexed by field number that gives the // function to decode that field. // The encode method encodes its receiver into the given buffer. // // The two methods are simple enough to be implemented by hand rather than // by using a protocol compiler. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 17 16:20:57 UTC 2022 - 6.8K bytes - Viewed (0) -
staging/src/k8s.io/apiextensions-apiserver/pkg/apiserver/schema/defaulting/validation.go
if insideMeta { obj, _, err := f(runtime.DeepCopyJSONValue(s.Default.Object)) if err != nil { // this should never happen. f(s.Default.Object) only gives an error if f is the // root object func, but the default value is not a map. But then we wouldn't be // in this case. return nil, fmt.Errorf("failed to validate default value inside metadata: %v", err), remainingCost
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Nov 03 22:34:13 UTC 2023 - 8.3K bytes - Viewed (0) -
pkg/queue/delay.go
// // GOMAXPROCS determines how many goroutines can run in parallel, // which makes it the best choice as the channel capacity, return n }() // NewDelayed gives a Delayed queue with maximum concurrency specified by workers. func NewDelayed(opts ...DelayQueueOption) Delayed { q := &delayQueue{ workers: 1, queue: &pq{}, execute: make(chan *delayTask, workerChanBuf),
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Jul 20 06:27:31 UTC 2023 - 6.7K bytes - Viewed (0) -
prow/lib.sh
kind: Config preferences: {} users: - name: ${CLUSTER_NAME} user: token: ${TOKEN} EOF } # gives a copy of a given topology JSON editing the given key on the entry with the given cluster name function set_topology_value() { local JSON="$1" local CLUSTER_NAME="$2" local KEY="$3" local VALUE="$4"
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu May 09 12:26:52 UTC 2024 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LinearTransformation.java
* itself. In all other cases, the inverse is a transformation such that applying both the * original transformation and its inverse to a value gives you the original value give-or-take * numerical errors. Calling this method multiple times on the same instance will always return * the same instance. Calling this method on the result of calling this method on an instance will
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 9.6K bytes - Viewed (0) -
guava/src/com/google/common/math/LinearTransformation.java
* itself. In all other cases, the inverse is a transformation such that applying both the * original transformation and its inverse to a value gives you the original value give-or-take * numerical errors. Calling this method multiple times on the same instance will always return * the same instance. Calling this method on the result of calling this method on an instance will
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 9.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ConcurrentHashMultiset.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 20.9K bytes - Viewed (0)