- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,104 for iterations (0.15 sec)
-
guava-tests/test/com/google/common/util/concurrent/AtomicLongMapTest.java
assertEquals(ITERATIONS / 2, map.size()); assertEquals(nonZeroKeys, map.asMap().keySet()); } public void testClear() { AtomicLongMap<Object> map = AtomicLongMap.create(); for (int i = 0; i < ITERATIONS; i++) { map.put(new Object(), i); } assertEquals(ITERATIONS, map.size()); map.clear(); assertEquals(0, map.size()); assertTrue(map.isEmpty()); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 13 14:28:25 UTC 2024 - 17.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AtomicLongMapTest.java
assertEquals(ITERATIONS / 2, map.size()); assertEquals(nonZeroKeys, map.asMap().keySet()); } public void testClear() { AtomicLongMap<Object> map = AtomicLongMap.create(); for (int i = 0; i < ITERATIONS; i++) { map.put(new Object(), i); } assertEquals(ITERATIONS, map.size()); map.clear(); assertEquals(0, map.size()); assertTrue(map.isEmpty()); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 13 14:28:25 UTC 2024 - 17.4K bytes - Viewed (0) -
src/testing/benchmark.go
type PB struct { globalN *atomic.Uint64 // shared between all worker goroutines iteration counter grain uint64 // acquire that many iterations from globalN at once cache uint64 // local cache of acquired iterations bN uint64 // total number of iterations to execute (b.N) } // Next reports whether there are more iterations to execute. func (pb *PB) Next() bool { if pb.cache == 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 23.9K bytes - Viewed (0) -
platforms/software/testing-base/src/main/java/org/gradle/api/tasks/testing/logging/TestLogging.java
* from the test method will be logged and events from the test class and lower will be ignored. On the other hand, if a test method is parameterized, then events from the iterations of that test * method will be logged and events from the test method and lower will be ignored. * * @return the minimum granularity of the events to be logged */ int getMinGranularity();
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Sep 18 20:52:40 UTC 2023 - 11.3K bytes - Viewed (0) -
pkg/volume/flexvolume/probe_test.go
basePath = subdirPath } } // Issue multiple events and probe multiple times. func TestProberMultipleEvents(t *testing.T) { const iterations = 5 // Arrange _, fs, watcher, prober := initTestEnvironment(t) for i := 0; i < iterations; i++ { newDriver := fmt.Sprintf("multi-event-driver%d", 1) installDriver(newDriver, fs) driverPath := filepath.Join(pluginDir, newDriver)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Nov 28 11:14:00 UTC 2023 - 10.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/TopKSelector.java
} else if (pivotNewIndex < k) { left = Math.max(pivotNewIndex, left + 1); minThresholdPosition = pivotNewIndex; } else { break; } iterations++; if (iterations >= maxIterations) { @SuppressWarnings("nullness") // safe because we pass sort() a range that contains real Ts T[] castBuffer = (T[]) buffer;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
src/sort/sort.go
Let n = data.Len(). Assume n = 2^k. Plain merge sort performs log(n) = k iterations. On iteration i the algorithm merges 2^(k-i) blocks, each of size 2^i. Thus iteration i of merge sort performs: Calls to Less O(2^(k-i) * 2^i) = O(2^k) = O(2^log(n)) = O(n) Calls to Swap O(2^(k-i) * 2^i * log(2^i)) = O(2^k * i) = O(n*i) In total k = log(n) iterations are performed; so in total: Calls to Less O(log(n) * n)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 28 16:40:32 UTC 2023 - 10.1K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_cluster_util.cc
} size_t old_result_size; int iterations = 0; const int kMaxIterations = 10 * 1000; std::vector<bool> callee_has_ref_nodes_cache; callee_has_ref_nodes_cache.resize(graph.num_node_ids()); auto does_callee_have_ref_nodes = [&](Node* n) -> absl::StatusOr<bool> { if (iterations == 1) { TF_ASSIGN_OR_RETURN( bool callee_has_ref_nodes,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 29 08:39:39 UTC 2024 - 21.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadstore.go
} if addr[v] != node { // This doesn't happen in practice, but catch it just in case. used.Add(node) changed = true } return } iterations := 0 for { if iterations == 4 { // give up return } iterations++ changed := false for _, b := range f.Blocks { for _, v := range b.Values { changed = visit(v) || changed }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 20:07:26 UTC 2024 - 11K bytes - Viewed (0) -
src/testing/quick/quick.go
package quick import ( "flag" "fmt" "math" "math/rand" "reflect" "strings" "time" ) var defaultMaxCount *int = flag.Int("quickchecks", 100, "The default number of iterations for each check") // A Generator can generate random values of its own type. type Generator interface { // Generate returns a random instance of the type on which it is a // method using the size as a size hint.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 08 17:55:47 UTC 2023 - 10.1K bytes - Viewed (0)