- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 710 for cyclic (0.16 sec)
-
src/encoding/json/encode_test.go
// Disable the GC temporarily to prevent encodeState's in Pool being cleaned away during the test. percent := debug.SetGCPercent(-1) defer debug.SetGCPercent(percent) // Trigger an error in Marshal with cyclic data. type Dummy struct { Name string Next *Dummy } dummy := Dummy{Name: "Dummy"} dummy.Next = &dummy if _, err := Marshal(dummy); err == nil { t.Errorf("Marshal error: got nil, want non-nil")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 29.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/internal/passes/tpu_cluster_formation.cc
mlir::InFlightDiagnostic error = strict_clusters ? mlir::emitError(op.getLoc(), "") : mlir::emitWarning(op.getLoc(), ""); error << "Op has cyclic dependency with a compilation cluster:\n"; error << "The cluster depends on\n"; error << op.getName() << "\n" << "which is outside of cluster, but itself depends ";
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu May 02 22:03:30 UTC 2024 - 39.3K bytes - Viewed (0) -
doc/go_mem.html
ahead of the loop in this program: </p> <pre> n := 0 for e := list; e != nil; e = e.next { n++ } i := *p *q = 1 </pre> <p> If <code>list</code> pointed to a cyclic list, then the original program would never access <code>*p</code> or <code>*q</code>, but the rewritten program would. (Moving `*p` ahead would be safe if the compiler can prove `*p` will not panic;
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 15:54:42 UTC 2024 - 26.6K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/configurations/DefaultConfiguration.java
while (src != null) { if (!sources.add(src)) { String cycle = sources.stream().map(Configuration::getName).collect(Collectors.joining(" -> ")) + " -> " + getName(); throw new InvalidUserDataException("Cycle detected in consistent resolution sources: " + cycle); } src = src.getConsistentResolutionSource(); } } @Nullable
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu May 23 17:36:01 UTC 2024 - 85.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/translate/import_model.cc
// inserts it into the MLIR module using builder_. Status ConvertNode(const Node& node); // If the input graph represents a while-loop, the edges pointing from a // "NextIteration" node to a "Merge" node add cyclic dependencies and make the // topological sorting impossible. We need to remove these edges from the // input graph to infer shapes and construct a Function. For each
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 01 11:17:36 UTC 2024 - 183.2K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_cluster_util.cc
continue; } if (!cycles->InsertEdge(edge->src()->id(), edge->dst()->id())) { // This should never happen. All cycles in the graph should contain // a control flow operator. return errors::Internal( "Found cycle in graph without control flow operator during XLA " "compilation: ", DescribeCycle(cycles, *graph, edge->src()->id(), edge->dst()->id())); } }
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/internal/types/testdata/check/init0.go
// initialization cycles package init0 // initialization cycles (we don't know the types) const ( s0 /* ERROR "initialization cycle: s0 refers to itself" */ = s0 x0 /* ERROR "initialization cycle for x0" */ = y0 y0 = x0 a0 = b0 b0 /* ERROR "initialization cycle for b0" */ = c0 c0 = d0 d0 = b0 ) var ( s1 /* ERROR "initialization cycle: s1 refers to itself" */ = s1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 17 19:54:25 UTC 2023 - 2.2K bytes - Viewed (0) -
src/internal/types/testdata/check/init2.go
// license that can be found in the LICENSE file. // initialization cycles package init2 // cycles through functions func f1() int { _ = x1; return 0 } var x1 /* ERROR "initialization cycle" */ = f1 func f2() int { _ = x2; return 0 } var x2 /* ERROR "initialization cycle" */ = f2() // cycles through method expressions type T3 int func (T3) m() int { _ = x3; return 0 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 17 19:54:25 UTC 2023 - 3.6K bytes - Viewed (0) -
testing/performance/src/templates/native-dependents-resources/googleTest/libs/googleTest/1.7.0/include/gtest/gtest.h
void ReportFailureInUnknownLocation(TestPartResult::Type result_type, const std::string& message); } // namespace internal // The friend relationship of some of these classes is cyclic. // If we don't forward declare them the compiler might confuse the classes // in friendship clauses with same named classes on the scope. class Test; class TestCase; class TestInfo; class UnitTest;
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 86.4K bytes - Viewed (0) -
platforms/documentation/docs/src/snippets/native-binaries/google-test/groovy/libs/googleTest/1.7.0/include/gtest/gtest.h
void ReportFailureInUnknownLocation(TestPartResult::Type result_type, const std::string& message); } // namespace internal // The friend relationship of some of these classes is cyclic. // If we don't forward declare them the compiler might confuse the classes // in friendship clauses with same named classes on the scope. class Test; class TestCase; class TestInfo; class UnitTest;
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 86.4K bytes - Viewed (0)