- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 176 for Floor (0.04 sec)
-
android/guava/src/com/google/common/math/DoubleUtils.java
static double bigToDouble(BigInteger x) { // This is an extremely fast implementation of BigInteger.doubleValue(). JDK patch pending. BigInteger absX = x.abs(); int exponent = absX.bitLength() - 1; // exponent == floor(log2(abs(x))) if (exponent < Long.SIZE - 1) { return x.longValue(); } else if (exponent > MAX_EXPONENT) { return x.signum() * POSITIVE_INFINITY; } /*
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 28 15:37:52 UTC 2021 - 5.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/tensorflow/passes/quantized_function_library_tf_drq.mlir
module { // Note: following functions won't handle per-channel quantization for now. func.func private @internal_quantize_i8(%input : tensor<*xf32>, %scale : tensor<*xf32>, %zp : tensor<*xi32>) -> tensor<*xi8> { // Uses tf.floor(x + 0.5) instead of tf.round(x) since tf.round generates // a very expensive pattern. %round_cst = "tf.Const"() {value = dense<0.5> : tensor<f32>} : () -> tensor<f32>
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Mar 03 15:43:38 UTC 2023 - 12.2K bytes - Viewed (0) -
src/time/tick.go
func NewTicker(d Duration) *Ticker { if d <= 0 { panic("non-positive interval for NewTicker") } // Give the channel a 1-element time buffer. // If the client falls behind while reading, we drop ticks // on the floor until the client catches up. c := make(chan Time, 1) t := (*Ticker)(unsafe.Pointer(newTimer(when(d), int64(d), sendTime, c, syncTimer(c)))) t.C = c return t }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:21:30 UTC 2024 - 3.6K bytes - Viewed (0) -
src/math/all_test.go
} } } func TestFloor(t *testing.T) { for i := 0; i < len(vf); i++ { if f := Floor(vf[i]); !alike(floor[i], f) { t.Errorf("Floor(%g) = %g, want %g", vf[i], f, floor[i]) } } for i := 0; i < len(vfceilSC); i++ { if f := Floor(vfceilSC[i]); !alike(ceilSC[i], f) { t.Errorf("Floor(%g) = %g, want %g", vfceilSC[i], f, ceilSC[i]) } } } func TestMax(t *testing.T) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jul 07 17:39:26 UTC 2023 - 86.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
@CheckForNull private AvlNode<E> floor(Comparator<? super E> comparator, @ParametricNullness E e) { int cmp = comparator.compare(e, getElement()); if (cmp > 0) { return (right == null) ? this : MoreObjects.firstNonNull(right.floor(comparator, e), this); } else if (cmp == 0) { return this; } else { return (left == null) ? null : left.floor(comparator, e); } }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 34.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ImmutableSortedSetTest.java
assertThat(set.floor("f")).isNull(); } public void testFloor_elementPresent() { ImmutableSortedSet<String> set = ImmutableSortedSet.copyOf(new String[] {"e", "a", "e", "f", "b", "i", "d", "a", "c", "k"}); assertThat(set.floor("f")).isEqualTo("f"); assertThat(set.floor("j")).isEqualTo("i"); assertThat(set.floor("q")).isEqualTo("k"); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 15:27:58 UTC 2024 - 45.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/lower_tf.td
def LowerTruncateDivOpOnIntTensors : Pat< (TF_TruncateDivOp TF_IntTensor:$lhs, $rhs), (TF_DivOp $lhs, $rhs)>; // Note: truncation could also be implemented as sign(x) * floor(abs(x)) or // (-1 & x) || floor(abs(x)), based on performance benchmarks. def LowerTruncateDivOpOnFloatTensors : Pat< (TF_TruncateDivOp TF_FloatTensor:$lhs, $rhs), (TF_SelectV2Op (TF_LessOp (TF_DivOp:$div $lhs, $rhs),
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 04 13:30:42 UTC 2024 - 24.7K bytes - Viewed (0) -
guava/src/com/google/common/math/DoubleUtils.java
static double bigToDouble(BigInteger x) { // This is an extremely fast implementation of BigInteger.doubleValue(). JDK patch pending. BigInteger absX = x.abs(); int exponent = absX.bitLength() - 1; // exponent == floor(log2(abs(x))) if (exponent < Long.SIZE - 1) { return x.longValue(); } else if (exponent > MAX_EXPONENT) { return x.signum() * POSITIVE_INFINITY; } /*
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 28 15:37:52 UTC 2021 - 5.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/TreeMultiset.java
@CheckForNull private AvlNode<E> floor(Comparator<? super E> comparator, @ParametricNullness E e) { int cmp = comparator.compare(e, getElement()); if (cmp > 0) { return (right == null) ? this : MoreObjects.firstNonNull(right.floor(comparator, e), this); } else if (cmp == 0) { return this; } else { return (left == null) ? null : left.floor(comparator, e); } }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 34.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableSortedSet.java
@CheckForNull public E lower(E element) { int index = headIndex(element, false) - 1; return (index == -1) ? null : elements.get(index); } @Override @CheckForNull public E floor(E element) { int index = headIndex(element, true) - 1; return (index == -1) ? null : elements.get(index); } @Override @CheckForNull public E ceiling(E element) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 9K bytes - Viewed (0)