- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 152 for haverace (0.24 sec)
-
android/guava/src/com/google/common/graph/StandardNetwork.java
// We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory. final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed /** Constructs a graph with the properties specified in {@code builder}. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 6.9K bytes - Viewed (0) -
guava/src/com/google/common/graph/StandardNetwork.java
// We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory. final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed /** Constructs a graph with the properties specified in {@code builder}. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 6.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ArrayListMultimap.java
* MultimapBuilder.hashKeys(expectedKeys).arrayListValues(expectedValuesPerKey).build()}. * * @param expectedKeys the expected number of distinct keys * @param expectedValuesPerKey the expected average number of values per key * @throws IllegalArgumentException if {@code expectedKeys} or {@code expectedValuesPerKey} is * negative */ public static <K extends @Nullable Object, V extends @Nullable Object>
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 6.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/update_control_dependencies.cc
namespace mlir { namespace tf_executor { namespace { // Comparator for `OpsInReverseProgramOrder`. struct IsAfterInBlock { bool operator()(Operation* op, Operation* other_op) const { // This function has an average complexity of O(1). return other_op->isBeforeInBlock(op); } }; #define GEN_PASS_DEF_EXECUTORUPDATECONTROLDEPENDENCIESPASS #include "tensorflow/compiler/mlir/tensorflow/transforms/tf_passes.h.inc"
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jan 30 07:53:51 UTC 2024 - 8.4K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* you would expect. * * <p>If required to do a weighted average between an infinity and a finite value, or between an * infinite value and itself, the infinite value is returned. If required to do a weighted average * between {@link Double#NEGATIVE_INFINITY NEGATIVE_INFINITY} and {@link Double#POSITIVE_INFINITY
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0) -
guava/src/com/google/common/math/Quantiles.java
* you would expect. * * <p>If required to do a weighted average between an infinity and a finite value, or between an * infinite value and itself, the infinite value is returned. If required to do a weighted average * between {@link Double#NEGATIVE_INFINITY NEGATIVE_INFINITY} and {@link Double#POSITIVE_INFINITY
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0) -
src/runtime/stack.go
// https://docs.google.com/document/d/1YDlGIdVTPnmUiTAavlZxBI1d9pwGQgZT7IKFKlIXohQ/edit?usp=sharing // The basic algorithm is to track the average size of stacks // and start goroutines with stack equal to that average size. // Starting at the average size uses at most 2x the space that // an ideal algorithm would have used. // This is just a heuristic to avoid excessive stack growth work
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 41.1K bytes - Viewed (0) -
cmd/metrics-v2.go
Name: avgLinkLatency, Help: "Average replication link latency in milliseconds", Type: gaugeMetric, } } func getClusterReplAvgQueuedOperationsMD() MetricDescription { return MetricDescription{ Namespace: nodeMetricNamespace, Subsystem: replicationSubsystem, Name: avgInQueueCount, Help: "Average number of objects queued for replication since server uptime",
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Jun 13 22:26:54 UTC 2024 - 131.9K bytes - Viewed (0) -
testing/internal-performance-testing/src/main/groovy/org/gradle/performance/results/report/TestPageGenerator.java
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 14K bytes - Viewed (0) -
src/sync/pool_test.go
} // Get pause time stats. slices.Sort(pauses) var total uint64 for _, ns := range pauses { total += ns } // ns/op for this benchmark is average STW time. b.ReportMetric(float64(total)/float64(b.N), "ns/op") b.ReportMetric(float64(pauses[len(pauses)*95/100]), "p95-ns/STW") b.ReportMetric(float64(pauses[len(pauses)*50/100]), "p50-ns/STW") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 8K bytes - Viewed (0)