- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 210 for rounds (0.09 sec)
-
guava/src/com/google/common/collect/TreeRangeMap.java
public void remove(Range<K> rangeToRemove) { if (rangeToRemove.isEmpty()) { return; } /* * The comments for this method will use [ ] to indicate the bounds of rangeToRemove and ( ) to * indicate the bounds of ranges in the range map. */ Entry<Cut<K>, RangeMapEntry<K, V>> mapEntryBelowToTruncate = entriesByLowerBound.lowerEntry(rangeToRemove.lowerBound);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 04 14:31:50 UTC 2024 - 25.7K bytes - Viewed (0) -
src/runtime/map_fast32.go
insertb = h.newoverflow(t, b) inserti = 0 // not necessary, but avoids needlessly spilling inserti } insertb.tophash[inserti&(abi.MapBucketCount-1)] = tophash(hash) // mask inserti to avoid bounds checks insertk = add(unsafe.Pointer(insertb), dataOffset+inserti*4) // store new key at insert position *(*uint32)(insertk) = key h.count++ done:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 13.9K bytes - Viewed (0) -
tensorflow/compiler/aot/codegen_test_h.golden
// // T& argN(...dim indices...) // Returns a reference to the value of type T for positional argument N, // with dim indices specifying which value. No bounds checking is performed // on dim indices. void set_arg0_data(const void* data) { set_arg_data(0, data); } float* arg0_data() { return static_cast<float*>(arg_data(0)); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu May 02 01:20:01 UTC 2024 - 16.6K bytes - Viewed (0) -
pkg/kube/inject/testdata/inputs/proxy-override-runas.yaml.34.mesh.gen.yaml
Jonh Wendell <******@****.***> 1715709579 -0400
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue May 14 17:59:39 UTC 2024 - 191 bytes - Viewed (0) -
pkg/kube/inject/testdata/inputs/proxy-override-runas.yaml.34.values.gen.yaml
Jonh Wendell <******@****.***> 1715709579 -0400
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue May 14 17:59:39 UTC 2024 - 2.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/common/ir/UniformSupport.h
const float real_value = expressed_value.convertToFloat(); const double scaled = real_value / scale_double_ + zero_point_double_; // Round to nearest integer with halfway cases rounded away from zero. const double scaled_rounded = std::round(scaled); const double clamped = std::min(std::max(scaled_rounded, clamp_min_double_), clamp_max_double_);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 08 02:10:16 UTC 2024 - 9.8K bytes - Viewed (0) -
pkg/kube/inject/testdata/inputs/proxy-override-runas.yaml.34.template.gen.yaml
Nicole LiHui <******@****.***> 1717379705 +0800
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Jun 03 01:55:05 UTC 2024 - 75.9K bytes - Viewed (0) -
src/internal/reflectlite/export_test.go
return StructFieldType(tt, i) } // Field returns the i'th struct field. func StructFieldType(t *structType, i int) Type { if i < 0 || i >= len(t.Fields) { panic("reflect: Field index out of bounds") } p := &t.Fields[i] return toType(p.Typ) } // Zero returns a Value representing the zero value for the specified type. // The result is different from the zero value of the Value struct,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 07 17:01:54 UTC 2024 - 3K bytes - Viewed (0) -
src/go/token/position.go
default: return offset } // only generate this code if needed if debug { panic(fmt.Sprintf("offset %d out of bounds [%d, %d] (position %d out of bounds [%d, %d])", 0 /* for symmetry */, offset, f.size, f.base+offset, f.base, f.base+f.size)) } return 0 } // Pos returns the Pos value for the given file offset. // // If offset is negative, the result is the file's start
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 19.7K bytes - Viewed (0) -
src/crypto/internal/mlkem768/mlkem768.go
// Since the remainder is in the range [0, 2q), not [0, q), we need to // portion it into three spans for rounding. // // [ 0, q/2 ) -> round to 0 // [ q/2, q + q/2 ) -> round to 1 // [ q + q/2, 2q ) -> round to 2 // // We can convert that to the following logic: add 1 if remainder > q/2, // then add 1 again if remainder > q + q/2. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 28.4K bytes - Viewed (0)