- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 639 for compute (0.05 sec)
-
android/guava-tests/test/com/google/common/math/QuantilesTest.java
* - median with compute taking a double-collection and with computeInPlace; * - quartiles with index and with indexes taking int-varargs, and with compute taking a * double-collection and with computeInPlace; * - scale with index and with indexes taking int-varargs, and with all overloads of compute * taking a double-collection and with computeInPlace;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 29.7K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* * <h3>Examples</h3> * * <p>To compute the median: * * <pre>{@code * double myMedian = median().compute(myDataset); * }</pre> * * where {@link #median()} has been statically imported. * * <p>To compute the 99th percentile: * * <pre>{@code * double myPercentile99 = percentiles().index(99).compute(myDataset); * }</pre> *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0) -
configure.py
print( 'ERROR: TensorFlow only supports small CUDA compute' ' capabilities of sm_30 and higher. Please re-specify the list' ' of compute capabilities excluding version %s.' % ver) all_valid = False if ver < 35: print('WARNING: XLA does not support CUDA compute capabilities '
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Wed Oct 02 22:16:02 UTC 2024 - 48.2K bytes - Viewed (0) -
src/main/java/jcifs/pac/PacLogonInfo.java
} // Compute Resource Group IDs with Resource Domain ID to get SIDs this.resourceGroupSids = new SID[resourceGroups.length]; for ( int i = 0; i < resourceGroups.length; i++ ) { this.resourceGroupSids[ i ] = new SID(resourceDomainId, resourceGroups[ i ].getId()); } // Compute User IDs with Domain ID to get User SIDs
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Sun Jul 01 13:12:10 UTC 2018 - 11.4K bytes - Viewed (0) -
impl/maven-core/src/main/java/org/apache/maven/internal/impl/SisuDiBridgeModule.java
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 10.8K bytes - Viewed (0) -
internal/s3select/sql/evaluate.go
return opVal, opErr } // Need to evaluate the ConditionRHS switch { case e.ConditionRHS.Compare != nil: cmpRight, cmpRErr := e.ConditionRHS.Compare.Operand.evalNode(r, tableAlias) if cmpRErr != nil { return nil, cmpRErr } b, err := opVal.compareOp(strings.ToUpper(e.ConditionRHS.Compare.Operator), cmpRight) return FromBool(b), err case e.ConditionRHS.Between != nil:
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Mon Sep 23 19:35:41 UTC 2024 - 12K bytes - Viewed (0) -
docs/bigdata/README.md
Kubernetes manages stateless Spark and Hive containers elastically on the compute nodes. Spark has native scheduler integration with Kubernetes. Hive, for legacy reasons, uses YARN scheduler on top of Kubernetes.
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Sep 29 04:28:45 UTC 2022 - 14.7K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* computes) correspond to minimum intervals between subsequent requests, for the specified number * of requested permits. * * Here is an example of storedPermitsToWaitTime: If storedPermits == 10.0, and we want 3 permits, * we take them from storedPermits, reducing them to 7.0, and compute the throttling for these as
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Apr 04 09:45:04 UTC 2023 - 19.3K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AtomicLongMap.java
* * @since 21.0 */ @CanIgnoreReturnValue public long updateAndGet(K key, LongUnaryOperator updaterFunction) { checkNotNull(updaterFunction); Long result = map.compute( key, (k, value) -> updaterFunction.applyAsLong((value == null) ? 0L : value.longValue())); return requireNonNull(result); } /**
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
int[] same = new int[hashBits]; int[] diff = new int[hashBits]; // go through trials to compute probability for (int j = 0; j < trials; j++) { int key1 = rand.nextInt(); // flip input bit for key2 int key2 = key1 ^ (1 << i); // compute hash values int hash1 = function.hashInt(key1).asInt(); int hash2 = function.hashInt(key2).asInt();
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Jul 23 14:22:54 UTC 2024 - 25.5K bytes - Viewed (0)