- Sort Score
- Result 10 results
- Languages All
Results 41 - 46 of 46 for Approximates (0.73 sec)
-
tensorflow/compiler/mlir/lite/schema/schema.fbs
} table RandomOptions { seed: long; seed2: long; } table BucketizeOptions { boundaries: [float]; // The bucket boundaries. } table GeluOptions { approximate: bool; } table DynamicUpdateSliceOptions { } table UnsortedSegmentProdOptions { } table UnsortedSegmentMaxOptions { } table UnsortedSegmentSumOptions { }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 03 18:01:23 UTC 2024 - 41.7K bytes - Viewed (0) -
hack/lib/golang.sh
${goflags:+"${goflags[@]}"} \ -gcflags="${gogcflags}" \ -ldflags="${goldflags}" \ -tags="${gotags:-}" \ -o "${outfile}" \ "${testpkg}" done } # Return approximate physical memory available in gigabytes. kube::golang::get_physmem() { local mem # Linux kernel version >=3.14, in kb if mem=$(grep MemAvailable /proc/meminfo | awk '{ print $2 }'); then
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat Jun 01 16:43:08 UTC 2024 - 32.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java
boolean longWait = TimeUnit.NANOSECONDS.toSeconds(thread.timeSpentBlocked) >= 5; // Count how long it actually took to return; we'll accept any number between the expected delay // and the approximate actual delay, to be robust to variance in thread scheduling. char overWaitNanosFirstDigit = Long.toString( thread.timeSpentBlocked - TimeUnit.MILLISECONDS.toNanos(longWait ? 5000 : 3000))
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 11 16:13:05 UTC 2024 - 46.7K bytes - Viewed (0) -
src/encoding/json/decode.go
// The input can be assumed to be a valid encoding of // a JSON value. UnmarshalJSON must copy the JSON data // if it wishes to retain the data after returning. // // By convention, to approximate the behavior of [Unmarshal] itself, // Unmarshalers implement UnmarshalJSON([]byte("null")) as a no-op. type Unmarshaler interface { UnmarshalJSON([]byte) error }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:18:55 UTC 2024 - 35.3K bytes - Viewed (0) -
src/math/big/natdiv.go
the future we will make it work like the alternative, to avoid a special case in the final iteration. Either way, each step is a 3-by-2-wide-digit division approximated first by a 2-by-1-wide-digit division, just as we did for regular digits in long division. Because the actual answer we want is a 3-by-2-wide-digit division, instead of
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0) -
src/runtime/trace.go
} // stop stops a traceAdvancer and blocks until it exits. func (s *traceAdvancerState) stop() { s.timer.wake() <-s.done close(s.done) s.timer.close() } // traceAdvancePeriod is the approximate period between // new generations. const defaultTraceAdvancePeriod = 1e9 // 1 second. // wakeableSleep manages a wakeable goroutine sleep. // // Users of this type must call init before first use and
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 21:17:41 UTC 2024 - 37.1K bytes - Viewed (0)