- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 2,590 for iterations (0.28 sec)
-
android/guava/src/com/google/common/collect/Platform.java
return mapMaker.weakKeys(); } static <E extends Enum<E>> Class<E> getDeclaringClassOrObjectForJ2cl(E e) { return e.getDeclaringClass(); } static int reduceIterationsIfGwt(int iterations) { return iterations; } static int reduceExponentIfGwt(int exponent) { return exponent; } private Platform() {}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 4.9K 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) -
test/chanlinear.go
// take linear time. package main import ( "fmt" "runtime" "time" ) // checkLinear asserts that the running time of f(n) is in O(n). // tries is the initial number of iterations. func checkLinear(typ string, tries int, f func(n int)) { // Depending on the machine and OS, this test might be too fast // to measure with accurate enough granularity. On failure,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:25 UTC 2023 - 2.1K 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) -
platforms/software/dependency-management/src/testFixtures/groovy/org/gradle/resolve/scenarios/VersionRangeResolveTestScenarios.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 10 21:10:11 UTC 2023 - 27.8K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/internal/typeparams/termlist.go
// one iteration. for _, x := range xl { if x != nil { return false } } return true } // isAll reports whether the termlist xl represents the set of all types. func (xl termlist) isAll() bool { // If there's a 𝓤 term, the entire list is 𝓤. // If the termlist is in normal form, this requires at most // one iteration. for _, x := range xl {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 21 21:08:44 UTC 2023 - 3.8K bytes - Viewed (0) -
src/slices/sort_benchmark_test.go
} } cmpFunc := func(a, b *myStruct) int { if n := strings.Compare(a.a, b.a); n != 0 { return n } return cmp.Compare(a.n, b.n) } // Presort the slice so all benchmark iterations are identical. slices.SortFunc(structs, cmpFunc) b.ResetTimer() for i := 0; i < b.N; i++ { // Sort the slice twice because slices.SortFunc modifies the slice in place.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 23:39:07 UTC 2024 - 2.1K bytes - Viewed (0) -
testing/internal-integ-testing/src/main/groovy/org/gradle/integtests/fixtures/ToBeFixedForConfigurationCache.java
*/ String[] bottomSpecs() default {}; /** * Declare regular expressions matching the iteration name. * Defaults to an empty array, meaning this annotation applies to all iterations of the annotated feature. */ String[] iterationMatchers() default {}; String because() default ""; /**
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 2.7K bytes - Viewed (0)