- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 176 for Floor (0.17 sec)
-
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 - 9.2K bytes - Viewed (0) -
src/math/gamma.go
case isNegInt(x) || IsInf(x, -1) || IsNaN(x): return NaN() case IsInf(x, 1): return Inf(1) case x == 0: if Signbit(x) { return Inf(-1) } return Inf(1) } q := Abs(x) p := Floor(q) if q > 33 { if x >= 0 { y1, y2 := stirling(x) return y1 * y2 } // Note: x is negative but (checked above) not a negative integer,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 5.5K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/shufflesharding/shufflesharding_test.go
permutations := ff(test.handSize, test.handSize) allCoordinateCount := fallingFactorial / permutations nff := float64(test.hashMax) / float64(fallingFactorial) minCount := permutations * int(math.Floor(nff)) maxCount := permutations * int(math.Ceil(nff)) aHand := make([]int, test.handSize) for i := 0; i < test.hashMax; i++ { aHand = dealer.DealIntoHand(uint64(i), aHand) sort.IntSlice(aHand).Sort()
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Jan 25 06:44:08 UTC 2021 - 6.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/WasmOps.go
{name: "F32Ceil", asm: "F32Ceil", argLength: 1, reg: fp32_11, typ: "Float32"}, // ceil(arg0) {name: "F32Floor", asm: "F32Floor", argLength: 1, reg: fp32_11, typ: "Float32"}, // floor(arg0) {name: "F32Nearest", asm: "F32Nearest", argLength: 1, reg: fp32_11, typ: "Float32"}, // round(arg0) {name: "F32Abs", asm: "F32Abs", argLength: 1, reg: fp32_11, typ: "Float32"}, // abs(arg0)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 24 00:21:13 UTC 2023 - 17.7K bytes - Viewed (0) -
src/math/rand/v2/rand.go
// In general (x*n)/2⁶⁴ = k for x*n in [k*2⁶⁴,(k+1)*2⁶⁴). // There are either floor(2⁶⁴/n) or ceil(2⁶⁴/n) possible products // in that range, depending on k. // But suppose we reject the sample and try again when // x*n is in [k*2⁶⁴, k*2⁶⁴+(2⁶⁴%n)), meaning rejecting fewer than n possible // outcomes out of the 2⁶⁴. // Now there are exactly floor(2⁶⁴/n) possible ways to produce // each output value k, so we've restored uniformity.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 02:25:49 UTC 2024 - 12.8K bytes - Viewed (0) -
test/codegen/math.go
sink64[0] = math.Ceil(x) // amd64/v2:-".*x86HasSSE41" amd64/v3:-".*x86HasSSE41" // amd64:"ROUNDSD\t[$]1" // s390x:"FIDBR\t[$]7" // arm64:"FRINTMD" // ppc64x:"FRIM" // wasm:"F64Floor" sink64[1] = math.Floor(x) // s390x:"FIDBR\t[$]1" // arm64:"FRINTAD" // ppc64x:"FRIN" sink64[2] = math.Round(x) // amd64/v2:-".*x86HasSSE41" amd64/v3:-".*x86HasSSE41" // amd64:"ROUNDSD\t[$]3" // s390x:"FIDBR\t[$]5"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 15:24:29 UTC 2024 - 6.2K bytes - Viewed (0) -
src/cmd/cover/html.go
dst := bufio.NewWriter(w) for i := range src { for len(boundaries) > 0 && boundaries[0].Offset == i { b := boundaries[0] if b.Start { n := 0 if b.Count > 0 { n = int(math.Floor(b.Norm*9)) + 1 } fmt.Fprintf(dst, `<span class="cov%v" title="%v">`, n, b.Count) } else { dst.WriteString("</span>") } boundaries = boundaries[1:] } switch b := src[i]; b {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 08 14:33:36 UTC 2022 - 6.8K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleMath.java
throw new ArithmeticException("input is infinite or NaN"); } switch (mode) { case UNNECESSARY: checkRoundingUnnecessary(isMathematicalInteger(x)); return x; case FLOOR: if (x >= 0.0 || isMathematicalInteger(x)) { return x; } else { return (long) x - 1; } case CEILING: if (x <= 0.0 || isMathematicalInteger(x)) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/math/DoubleMath.java
throw new ArithmeticException("input is infinite or NaN"); } switch (mode) { case UNNECESSARY: checkRoundingUnnecessary(isMathematicalInteger(x)); return x; case FLOOR: if (x >= 0.0 || isMathematicalInteger(x)) { return x; } else { return (long) x - 1; } case CEILING: if (x <= 0.0 || isMathematicalInteger(x)) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/stablehlo/tests/composite-lowering.mlir
%9 = mhlo.multiply %7, %8 : tensor<4xf32> %10 = "mhlo.broadcast_in_dim"(%2) <{broadcast_dimensions = dense<> : tensor<0xi64>}> : (tensor<f32>) -> tensor<4xf32> %11 = mhlo.divide %9, %10 : tensor<4xf32> %12 = mhlo.floor %11 : tensor<4xf32> %13 = mhlo.convert %12 : (tensor<4xf32>) -> tensor<4xi32> %14 = "mhlo.broadcast_in_dim"(%1) <{broadcast_dimensions = dense<> : tensor<0xi64>}> : (tensor<i32>) -> tensor<4xi32>
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Jun 06 18:45:51 UTC 2024 - 32.6K bytes - Viewed (0)