- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 16 for Floor (0.17 sec)
-
android/guava-tests/test/com/google/common/math/BigIntegerMathTest.java
// Relies on the correctness of sqrt(BigInteger, FLOOR). @GwtIncompatible // TODO public void testSqrtExact() { for (BigInteger x : POSITIVE_BIGINTEGER_CANDIDATES) { BigInteger floor = BigIntegerMath.sqrt(x, FLOOR); // We only expect an exception if x was not a perfect square. boolean isPerfectSquare = floor.pow(2).equals(x); try { assertEquals(floor, BigIntegerMath.sqrt(x, UNNECESSARY));
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 17:58:33 UTC 2024 - 27.8K bytes - Viewed (0) -
cmd/kube-proxy/app/server_linux.go
if config.MaxPerCore != nil && *config.MaxPerCore > 0 { floor := 0 if config.Min != nil { floor = int(*config.Min) } scaled := int(*config.MaxPerCore) * detectNumCPU() if scaled > floor { logger.V(3).Info("GetConntrackMax: using scaled conntrack-max-per-core") return scaled, nil } logger.V(3).Info("GetConntrackMax: using conntrack-min") return floor, nil } return 0, nil }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat Jun 08 13:48:54 UTC 2024 - 18.1K bytes - Viewed (0) -
pkg/kubelet/kuberuntime/kuberuntime_container_linux.go
// `memory.high=floor[(requests.memory + memory throttling factor * (limits.memory or node allocatable memory - requests.memory))/pageSize] * pageSize` // where default value of memory throttling factor is set to 0.9 // More info: https://git.k8s.io/enhancements/keps/sig-node/2570-memory-qos memoryHigh := int64(0) if memoryLimit != 0 { memoryHigh = int64(math.Floor( float64(memoryRequest)+
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed May 29 22:40:29 UTC 2024 - 17.2K 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) -
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) -
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) -
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) -
src/runtime/runtime.go
godebugNewIncNonDefault.Store(p) } // A godebugInc provides access to internal/godebug's IncNonDefault function // for a given GODEBUG setting. // Calls before internal/godebug registers itself are dropped on the floor. type godebugInc struct { name string inc atomic.Pointer[func()] } func (g *godebugInc) IncNonDefault() { inc := g.inc.Load() if inc == nil { newInc := godebugNewIncNonDefault.Load()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:16:47 UTC 2024 - 9.9K bytes - Viewed (0) -
pkg/kubelet/kuberuntime/kuberuntime_container_linux_test.go
memoryNodeAllocatable := resource.MustParse(fakeNodeAllocatableMemory) pod1MemoryHigh := int64(math.Floor( float64(podRequestMemory.Value())+ (float64(pod1LimitMemory.Value())-float64(podRequestMemory.Value()))*float64(m.memoryThrottlingFactor))/float64(pageSize)) * pageSize pod2MemoryHigh := int64(math.Floor( float64(podRequestMemory.Value())+
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed May 29 22:40:29 UTC 2024 - 41K bytes - Viewed (0) -
src/crypto/tls/ticket.go
stateBytes := c.decryptTicket(identity, ticketKeys) if stateBytes == nil { return nil, nil } s, err := ParseSessionState(stateBytes) if err != nil { return nil, nil // drop unparsable tickets on the floor } return s, nil } func (c *Config) decryptTicket(encrypted []byte, ticketKeys []ticketKey) []byte { if len(encrypted) < aes.BlockSize+sha256.Size { return nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 17:23:54 UTC 2024 - 12.6K bytes - Viewed (0)