- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 263 for recursion (0.24 sec)
-
src/encoding/gob/type.go
// are constructed. This is to retain the order of type id allocation after // a fix made to handle recursive types, which changed the order in // which types are built. Delaying the setting in this way preserves // type ids while allowing recursive types to be described. Structs, // done below, were already handling recursion correctly so they // assign the top-level id before those of the field. at.init(type0, t.Len())
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 02:00:26 UTC 2024 - 27.2K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/copylock/copylock.go
} return nil } // lockPath returns a typePath describing the location of a lock value // contained in typ. If there is no contained lock, it returns nil. // // The seen map is used to short-circuit infinite recursion due to type cycles. func lockPath(tpkg *types.Package, typ types.Type, seen map[types.Type]bool) typePath { if typ == nil || seen[typ] { return nil } if seen == nil { seen = make(map[types.Type]bool) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 9.9K bytes - Viewed (0) -
tensorflow/compiler/aot/tests/tfcompile_test.cc
EXPECT_EQ(fn.var_x(), 107); } TEST(TFCompileTest, VariableSequentialUpdates) { Eigen::ThreadPool tp(1); Eigen::ThreadPoolDevice device(&tp, tp.NumThreads()); // This implements the recursion: // x[0] = 2.0 // x[n+1] = x[n] - 0.1*(x[n-1] + y) VariableSequentialUpdatesComp fn; fn.var_x() = 2; *const_cast<float*>(fn.var_y_data()) = 1; fn.set_thread_pool(&device);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Sep 06 19:12:29 UTC 2023 - 26.4K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/testers/ListSubListTester.java
return getMethod(ListSubListTester.class, "testSubList_subListRemoveAffectsOriginalLargeList"); } /* * TODO: perform all List tests on subList(), but beware infinite recursion */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 21 16:49:06 UTC 2024 - 13.4K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/testers/ListSubListTester.java
return getMethod(ListSubListTester.class, "testSubList_subListRemoveAffectsOriginalLargeList"); } /* * TODO: perform all List tests on subList(), but beware infinite recursion */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 21 16:49:06 UTC 2024 - 13.4K bytes - Viewed (0) -
platforms/core-configuration/configuration-cache/src/integTest/groovy/org/gradle/internal/cc/impl/isolated/IsolatedProjectsToolingApiIdeaProjectIntegrationTest.groovy
[{ it.contentRoots }, { a, e -> checkContentRoot(a, e) }], [{ it.gradleProject }, { a, e -> checkGradleProject(a, e) }], { it.project.languageLevel.level }, // shallow check to avoid infinite recursion { it.compilerOutput.inheritOutputDirs }, { it.compilerOutput.outputDir }, { it.compilerOutput.testOutputDir }, [{ it.dependencies }, { a, e -> checkDependency(a, e) }],
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Sat Jun 08 11:29:25 UTC 2024 - 20.9K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/cgocall/cgocall.go
return info.Types[arg].Type } // typeOKForCgoCall reports whether the type of arg is OK to pass to a // C function using cgo. This is not true for Go types with embedded // pointers. m is used to avoid infinite recursion on recursive types. func typeOKForCgoCall(t types.Type, m map[types.Type]bool) bool { if t == nil || m[t] { return true } m[t] = true switch t := t.Underlying().(type) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 11.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/tensorflow/passes/duplicate_shape_determining_constants.cc
<< ", operand idx: " << curr_operand->getOperandNumber() << ", loc: " << const_op_cloned->getLoc() << "\n"); } else if (IsOutputCompileTimeConstantOrBounded(defining_op)) { // Stop the recursion early when the output of the defining op is // considered compile-time constant from the XLA compiler's perspective. continue; } else if (!defining_op) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Mar 22 05:52:39 UTC 2024 - 17.5K bytes - Viewed (0) -
src/encoding/xml/read.go
case StartElement: consumed := false if sv.IsValid() { // unmarshalPath can call unmarshal, so we need to pass the depth through so that // we can continue to enforce the maximum recursion limit. consumed, err = d.unmarshalPath(tinfo, sv, nil, &t, depth) if err != nil { return err } if !consumed && saveAny.IsValid() { consumed = true
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:04:28 UTC 2023 - 22.4K bytes - Viewed (0) -
analysis/analysis-api-fir/src/org/jetbrains/kotlin/analysis/api/fir/components/KtFirExpressionInfoProvider.kt
* climbing up the syntax tree, passing control back and forth between the * two. * * Whether an expression is used is defined by the context in which it * appears. E.g. a "statement" in a block is considered used if it is the * last expression in that block AND the block itself is used -- a * recursive call to `isUsed`, one level higher in the syntax tree.
Registered: Wed Jun 12 09:53:16 UTC 2024 - Last Modified: Wed Jun 05 16:16:39 UTC 2024 - 17.6K bytes - Viewed (0)