- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 209 for recursion (0.25 sec)
-
src/go/internal/srcimporter/srcimporter_test.go
// verifyInterfaceMethodRecvs verifies that method receiver types // are named if the methods belong to a named interface type. func verifyInterfaceMethodRecvs(t *testing.T, named *types.Named, level int) { // avoid endless recursion in case of an embedding bug that lead to a cycle if level > 10 { t.Errorf("%s: embeds itself", named) return } iface, _ := named.Underlying().(*types.Interface) if iface == nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 12 12:00:02 UTC 2023 - 6.5K bytes - Viewed (0) -
src/cmd/compile/internal/noder/posmap.go
absfn := trimFilename(b0) if b0.IsFileBase() { b1 = src.NewFileBase(fn, absfn) } else { // line directive base p0 := b0.Pos() p0b := p0.Base() if p0b == b0 { panic("infinite recursion in makeSrcPosBase") } p1 := src.MakePos(m.makeSrcPosBase(p0b), p0.Line(), p0.Col()) b1 = src.NewLinePragmaBase(p1, fn, absfn, b0.Line(), b0.Col()) } if m.bases == nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jan 27 03:43:35 UTC 2023 - 1.8K bytes - Viewed (0) -
src/compress/bzip2/huffman.go
} // In this case the recursion doesn't always reduce the length // of codes so we need to ensure termination via another // mechanism. if level == 31 { // Since len(codes) >= 2 the only way that the values // can match at all 32 bits is if they are equal, which // is invalid. This ensures that we never enter // infinite recursion. return 0, StructuralError("equal symbols in Huffman tree")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 15 17:44:37 UTC 2024 - 6.7K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/ctrlflow/ctrlflow.go
func (c *CFGs) buildDecl(fn *types.Func, di *declInfo) { // buildDecl may call itself recursively for the same function, // because cfg.New is passed the callMayReturn method, which // builds the CFG of the callee, leading to recursion. // The buildDecl call tree thus resembles the static call graph. // We mark each node when we start working on it to break cycles. if !di.started { // break cycle di.started = true
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 09 01:28:01 UTC 2023 - 6.6K bytes - Viewed (0) -
pkg/controller/serviceaccount/tokengetter.go
// uses the specified client to retrieve service accounts, pods, secrets and nodes. // The client should NOT authenticate using a service account token // the returned getter will be used to retrieve, or recursion will result.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Oct 30 21:15:10 UTC 2023 - 3K bytes - Viewed (0) -
okhttp-dnsoverhttps/src/main/kotlin/okhttp3/dnsoverhttps/DnsRecordCodec.kt
private val ASCII = Charsets.US_ASCII fun encodeQuery( host: String, type: Int, ): ByteString = Buffer().apply { writeShort(0) // query id writeShort(256) // flags with recursion writeShort(1) // question count writeShort(0) // answerCount writeShort(0) // authorityResourceCount writeShort(0) // additional val nameBuf = Buffer()
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 3.8K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/validate.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 20 21:52:54 UTC 2023 - 3.1K bytes - Viewed (0) -
platforms/ide/tooling-api/src/testFixtures/groovy/org/gradle/integtests/tooling/fixture/ToolingApiModelChecker.groovy
{ it.group }, { it.isPublic() }, [{ it.projectIdentifier }, { a, e -> checkProjectIdentifier(a, e) }], { it.project.path }, // only check path to avoid infinite recursion ]) } static void checkGradleProject(actual, expected) { assert expected instanceof GradleProject assert actual instanceof GradleProject
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Dec 15 10:26:50 UTC 2023 - 5.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/guarantee_all_funcs_one_use.cc
namespace { // Check that there is no recursion in the module's call graph. LogicalResult CheckNoRecursion(ModuleOp module, CallGraph &call_graph) { for (llvm::scc_iterator<const CallGraph *> scci = llvm::scc_begin<const CallGraph *>(&call_graph); !scci.isAtEnd(); ++scci) { if (scci.hasCycle()) { auto err = module.emitError() << "A recursive call graph cannot be transformed to "
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Oct 05 23:50:19 UTC 2022 - 4.8K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/SortedMapTestSuiteBuilder.java
? SortedSetTestSuiteBuilder.using((TestSortedSetGenerator<K>) keySetGenerator) : SetTestSuiteBuilder.using(keySetGenerator); } /** * To avoid infinite recursion, test suites with these marker features won't have derived suites * created for them. */ enum NoRecurse implements Feature<@Nullable Void> { SUBMAP, DESCENDING; @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 26 19:46:10 UTC 2024 - 5K bytes - Viewed (0)