- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 552 for recursion (0.17 sec)
-
src/slices/zsortanyfunc.go
// // symMerge assumes non-degenerate arguments: a < m && m < b. // Having the caller check this condition eliminates many leaf recursion calls, // which improves performance. func symMergeCmpFunc[E any](data []E, a, m, b int, cmp func(a, b E) int) { // Avoid unnecessary recursions of symMerge // by direct insertion of data[a] into data[m:b] // if data[a:m] only contains one element. if m-a == 1 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 23 23:33:29 UTC 2023 - 12.8K bytes - Viewed (0) -
test/nosplit.go
start 0 call big big 10000 # But not if the frame is nosplit. start 0 call big big 10000 nosplit REJECT # Recursion is okay. start 0 call start # Recursive nosplit runs out of space. start 0 nosplit call start REJECT # Non-trivial recursion runs out of space. start 0 call f1 f1 0 nosplit call f2 f2 0 nosplit call f1 REJECT # Same but cycle starts below nosplit entry.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:25 UTC 2023 - 11.3K bytes - Viewed (0) -
src/slices/zsortordered.go
// // symMerge assumes non-degenerate arguments: a < m && m < b. // Having the caller check this condition eliminates many leaf recursion calls, // which improves performance. func symMergeOrdered[E cmp.Ordered](data []E, a, m, b int) { // Avoid unnecessary recursions of symMerge // by direct insertion of data[a] into data[m:b] // if data[a:m] only contains one element. if m-a == 1 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 23 23:33:29 UTC 2023 - 12.4K bytes - Viewed (0) -
src/index/suffixarray/sais2.go
// (from text_64), and saTmp will typically be much larger, so we'll use saTmp. // When deeper recursions come back to recurse_64, now oldTmp is // the saTmp from the top-most recursion, it is typically larger than // the current saTmp (because the current sa gets smaller and smaller // as the recursion gets deeper), and we keep reusing that top-most // large saTmp instead of the offered smaller ones. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 52.3K bytes - Viewed (0) -
src/cmd/compile/internal/types2/typeset.go
} // An infinitely expanding interface (due to a cycle) is detected // elsewhere (Checker.validType), so here we simply assume we only // have valid interfaces. Mark the interface as complete to avoid // infinite recursion if the validType check occurs later for some // reason. ityp.tset = &_TypeSet{terms: allTermlist} // TODO(gri) is this sufficient? var unionSets map[*Union]*_TypeSet if check != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 13.6K bytes - Viewed (0) -
src/debug/dwarf/type.go
} addressSize := r.AddressSize() if e == nil || e.Offset != off { return nil, DecodeError{name, off, "no type at offset"} } // If this is the root of the recursion, prepare to resolve // typedef sizes and perform other fixups once the recursion is // done. This must be done after the type graph is constructed // because it may need to resolve cycles in a different order than // readType encounters them.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 18 19:33:30 UTC 2023 - 21.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/analysis/resource_value_typed_analyzer.cc
// written". Do this recursively across the chain of regions via call or // control flow ops. // TODO(ashwinm): Move to iterative traversal. LogicalResult ResourceAnalyzer::AnalyzeRegion(Region& region) { // Avoid infinite recursion. if (!discovered_.insert(®ion).second) { return success(); } region.walk([&](Operation* op) { if (isa<TF::ReadVariableOp, func::ReturnOp, YieldOp>(op)) { return; }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 15 09:04:13 UTC 2024 - 8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/constant_fold_utils.cc
// attribute of the MLIR op. The assigned device might be remote, not // available during compilation or compilation only device for on demand // execution which may create a recursion if used for constant folding. std::string host_cpu = tensorflow::DeviceNameUtils::FullName( /*job=*/"localhost", /*replica=*/0, /*task=*/0, /*type=*/"CPU", /*id=*/0);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 7.3K bytes - Viewed (0) -
staging/src/k8s.io/apiextensions-apiserver/pkg/controller/openapi/v2/conversion_test.go
f.NumElements(0, max(0, maxDepth-depth)) } updateFuzzer(depth) enter := func(o interface{}, recursive bool, c fuzz.Continue) { if recursive { depth++ updateFuzzer(depth) } invisible++ c.FuzzNoCustom(o) invisible-- } leave := func(recursive bool) { if recursive { depth-- updateFuzzer(depth) } } f.Funcs( func(ref *spec.Ref, c fuzz.Continue) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Jun 02 14:34:26 UTC 2023 - 23.2K bytes - Viewed (0) -
src/go/types/typeset.go
} // An infinitely expanding interface (due to a cycle) is detected // elsewhere (Checker.validType), so here we simply assume we only // have valid interfaces. Mark the interface as complete to avoid // infinite recursion if the validType check occurs later for some // reason. ityp.tset = &_TypeSet{terms: allTermlist} // TODO(gri) is this sufficient? var unionSets map[*Union]*_TypeSet if check != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 13.7K bytes - Viewed (0)