- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 102 for Odivide (5.98 sec)
-
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
// Avoid delegating to this(long[]), since AtomicLongArray(long[]) will clone its input and // thus double memory usage. this.data = new AtomicLongArray(Ints.checkedCast(LongMath.divide(bits, 64, RoundingMode.CEILING))); this.bitCount = LongAddables.create(); } // Used by serialization LockFreeBitArray(long[] data) { checkArgument(data.length > 0, "data length is zero!");
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 10.7K bytes - Viewed (0) -
tensorflow/c/eager/parallel_device/parallel_device_lib.cc
std::vector<TFE_TensorHandle*> device_inputs; device_inputs.reserve(inputs.size()); for (int input_index = 0; input_index < inputs.size(); ++input_index) { // Parallel tensors are divided between operations by device. device_inputs.push_back(inputs[input_index]->tensor(device_index)); } device_thread->StartExecute( context, operation_name, std::move(device_inputs), attributes,
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Fri Feb 09 07:47:20 GMT 2024 - 25.4K bytes - Viewed (1) -
android/guava/src/com/google/common/primitives/UnsignedInts.java
* * @param dividend the dividend (numerator) * @param divisor the divisor (denominator) * @throws ArithmeticException if divisor is 0 */ public static int divide(int dividend, int divisor) { return (int) (toLong(dividend) / toLong(divisor)); } /** * Returns dividend % divisor, where the dividend and divisor are treated as unsigned 32-bit * quantities.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 13.4K bytes - Viewed (0) -
internal/s3select/sql/aggregation.go
return FromInt(e.aggregate.runningCount), nil case aggFnAvg: if e.aggregate.runningCount == 0 { // No rows were seen by AVG. return FromNull(), nil } err := e.aggregate.runningSum.arithOp(opDivide, FromInt(e.aggregate.runningCount)) return e.aggregate.runningSum, err case aggFnMin: if !e.aggregate.seen { // No rows were seen by MIN return FromNull(), nil }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sat Dec 23 07:19:11 GMT 2023 - 7.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
public void testBitSize() { double fpp = 0.03; for (int i = 1; i < 10000; i++) { long numBits = BloomFilter.optimalNumOfBits(i, fpp); int arraySize = Ints.checkedCast(LongMath.divide(numBits, 64, RoundingMode.CEILING)); assertEquals( arraySize * Long.SIZE, BloomFilter.create(Funnels.unencodedCharsFunnel(), i, fpp).bitSize()); } }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0) -
internal/ioutil/ioutil.go
return false } return fi1.Size() == fi2.Size() } // DirectioAlignSize - DirectIO alignment needs to be 4K. Defined here as // directio.AlignSize is defined as 0 in MacOS causing divide by 0 error. const DirectioAlignSize = 4096 // CopyAligned - copies from reader to writer using the aligned input // buffer, it is expected that input buffer is page aligned to
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 19 11:26:59 GMT 2024 - 10.3K bytes - Viewed (0) -
README.md
- **Operator** - The component provides user friendly options to operate the Istio service mesh. ## Repositories The Istio project is divided across a few GitHub repositories: - [istio/api](https://github.com/istio/api). This repository defines component-level APIs and common configuration formats for the Istio platform.
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Fri Jan 26 15:28:59 GMT 2024 - 6.6K bytes - Viewed (0) -
internal/hash/checksum.go
crc := c.Raw if len(crc) != c.Type.RawByteLen() { return b } b = append(b, tmp[:n]...) b = append(b, crc...) if c.Type.Is(ChecksumMultipart) { var checksums int // Ensure we don't divide by 0: if c.Type.RawByteLen() == 0 || len(parts)%c.Type.RawByteLen() != 0 { hashLogIf(context.Background(), fmt.Errorf("internal error: Unexpected checksum length: %d, each checksum %d", len(parts), c.Type.RawByteLen()))
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 11.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
// non-negative int, we can do long-arithmetic on index * (dataset.length - 1) / scale to get // a rounded ratio and a remainder which can be expressed as ints, without risk of overflow: int quotient = (int) LongMath.divide(numerator, scale, RoundingMode.DOWN); int remainder = (int) (numerator - (long) quotient * scale); selectInPlace(quotient, dataset, 0, dataset.length - 1); if (remainder == 0) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
cmd/endpoint-ellipses.go
return ep, nil } // GetAllSets - parses all ellipses input arguments, expands them into // corresponding list of endpoints chunked evenly in accordance with a // specific set size. // For example: {1...64} is divided into 4 sets each of size 16. // This applies to even distributed setup syntax as well. func GetAllSets(setDriveCount uint64, args ...string) ([][]string, error) { var setArgs [][]string if !ellipses.HasEllipses(args...) {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 03 15:54:03 GMT 2024 - 14.7K bytes - Viewed (0)