- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 176 for Floor (0.18 sec)
-
tensorflow/compiler/mlir/quantization/stablehlo/cc/calibration/calibration_parameters.h
inline float CalculateLowerBound(const float min_value, const float bin_width) { return std::floor(min_value / bin_width) * bin_width; } // Calculates the bin index of the current value. inline int32_t CalculateBinIndex(const float value, const float lower_bound, const float bin_width) { return std::floor((value - lower_bound) / bin_width); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 01:09:50 UTC 2024 - 3.3K bytes - Viewed (0) -
guava/src/com/google/common/math/LongMath.java
* can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x)) is 6, * then 64 <= x < 128, so floor(log10(x)) is either 1 or 2. */ int y = maxLog10ForLeadingZeros[Long.numberOfLeadingZeros(x)]; /* * y is the higher of the two possible values of floor(log10(x)). If x < 10^y, then we want the
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 44.6K bytes - Viewed (0) -
src/runtime/race/testdata/pool_test.go
// license that can be found in the LICENSE file. package race_test import ( "sync" "testing" "time" ) func TestRacePool(t *testing.T) { // Pool randomly drops the argument on the floor during Put. // Repeat so that at least one iteration gets reuse. for i := 0; i < 10; i++ { c := make(chan int) p := &sync.Pool{New: func() any { return make([]byte, 10) }} x := p.Get().([]byte) x[0] = 1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 13 18:45:54 UTC 2021 - 933 bytes - Viewed (0) -
guava/src/com/google/common/primitives/UnsignedLongs.java
/* * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is * guaranteed to be either exact or one less than the correct value. This follows from fact that * floor(floor(x)/i) == floor(x/i) for any real x and integer i != 0. The proof is not quite * trivial. */ long quotient = ((dividend >>> 1) / divisor) << 1; long rem = dividend - quotient * divisor;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 17.6K bytes - Viewed (0) -
src/math/trig_reduce.go
// is set by y*C being representable as a float64 without error // where y is given by y = floor(x * (4 / Pi)) and C is the leading partial // terms of 4/Pi. Since the leading terms (PI4A and PI4B in sin.go) have 30 // and 32 trailing zero bits, y should have less than 30 significant bits. // // y < 1<<30 -> floor(x*4/Pi) < 1<<30 -> x < (1<<30 - 1) * Pi/4 // // So, conservatively we can take x < 1<<29.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 3.3K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/SafeTreeSet.java
return new SafeTreeSet<>(delegate.descendingSet()); } @Override public E first() { return delegate.first(); } @Override public @Nullable E floor(E e) { return delegate.floor(checkValid(e)); } @Override public SortedSet<E> headSet(E toElement) { return headSet(toElement, false); } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 20 17:00:05 UTC 2024 - 5.8K bytes - Viewed (0) -
src/hash/crc32/crc32_s390x.s
// constant u. The Barret reduction result is the CRC value of R(x) mod // P(x). // // The Barret reduction algorithm is defined as: // // 1. T1(x) = floor( R(x) / x^32 ) GF2MUL u // 2. T2(x) = floor( T1(x) / x^32 ) GF2MUL P(x) // 3. C(x) = R(x) XOR T2(x) mod x^32 // // Note: To compensate the division by x^32, use the vector unpack
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 20 00:49:17 UTC 2021 - 7.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/MathBenchmarking.java
do { result = randomNonNegativeBigInteger(numBits); } while (result.signum() == 0); return result; } /** * Generates a number in [0, 2^numBits) with an exponential distribution. The floor of the log2 of * the result is chosen uniformly at random in [0, numBits), and then the result is chosen in that * range uniformly at random. Zero is treated as having log2 == 0. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 4.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedLongs.java
/* * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is * guaranteed to be either exact or one less than the correct value. This follows from fact that * floor(floor(x)/i) == floor(x/i) for any real x and integer i != 0. The proof is not quite * trivial. */ long quotient = ((dividend >>> 1) / divisor) << 1; long rem = dividend - quotient * divisor;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 17.6K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/SafeTreeSet.java
return new SafeTreeSet<>(delegate.descendingSet()); } @Override public E first() { return delegate.first(); } @Override public @Nullable E floor(E e) { return delegate.floor(checkValid(e)); } @Override public SortedSet<E> headSet(E toElement) { return headSet(toElement, false); } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 20 17:00:05 UTC 2024 - 5.8K bytes - Viewed (0)