- Sort Score
- Result 10 results
- Languages All
Results 21 - 29 of 29 for doGenerate (0.18 sec)
-
src/internal/types/testdata/examples/types.go
return P{1, 2, 3} } func _[P interface{ ~[]E }, E interface{ map[string]P } ]() P { x := P{} return P{{}} return P{E{}} return P{E{"foo": x}} return P{{"foo": x}, {}} } // This is a degenerate case with a singleton type set, but we can create // composite literals even if the core type is a defined type. type MyInts []int func _[P MyInts]() P { return P{}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 24 23:16:04 UTC 2023 - 8.4K bytes - Viewed (0) -
src/cmd/compile/internal/liveness/intervals.go
} pv.cur = pv.sel() return pv.cur } // sel is a helper function used by 'init' and 'nxt' above; it selects // the earlier of the two intervals at the current positions within i1 // and i2, or a degenerate (pairIndex -1) intWithIdx if we have no // more intervals to visit. func (pv *pairVisitor) sel() intWithIdx { var c1, c2 intWithIdx if pv.i1pos >= len(pv.i1) { c1.pairIndex = -1 } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 29 21:55:27 UTC 2024 - 10K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/SetsTest.java
} } public void testCartesianProduct_hashCode() { // Run through the same cartesian products we tested above Set<List<Integer>> degenerate = Sets.cartesianProduct(); checkHashCode(degenerate); checkHashCode(Sets.cartesianProduct(set(1, 2))); int num = Integer.MAX_VALUE / 3 * 2; // tickle overflow-related problems
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 15:27:58 UTC 2024 - 47.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SetsTest.java
} } public void testCartesianProduct_hashCode() { // Run through the same cartesian products we tested above Set<List<Integer>> degenerate = Sets.cartesianProduct(); checkHashCode(degenerate); checkHashCode(Sets.cartesianProduct(set(1, 2))); int num = Integer.MAX_VALUE / 3 * 2; // tickle overflow-related problems
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 15:27:58 UTC 2024 - 49.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/block.go
// // b.Succs = [{c,3}, {d,1}] // c.Preds = [?, ?, ?, {b,0}] // d.Preds = [?, {b,1}, ?] // // These indexes allow us to edit the CFG in constant time. // In addition, it informs phi ops in degenerate cases like: // // b: // if k then c else c // c: // v = Phi(x, y) // // Then the indexes tell you whether x is chosen from // the if or else branch from b. // // b.Succs = [{c,0},{c,1}]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 12.2K bytes - Viewed (0) -
src/sort/sort_test.go
maxcmp := size * lg(size) * 4 // the factor 4 was found by trial and error d := newAdversaryTestingData(t, size, maxcmp) Sort(d) // This should degenerate to heapsort. // Check data is fully populated and sorted. for i, v := range d.data { if v != i { t.Fatalf("adversary data not fully sorted") } } } func TestStableInts(t *testing.T) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 19:41:04 UTC 2024 - 16.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/cluster_ops_by_policy.cc
cluster.operations.emplace_back(op); } llvm::SmallVector<Cluster> clusters; for (auto &kv : root_clusters) { Cluster &cluster = kv.getSecond(); // Skip degenerate clusters formed by a single basic block argument. if (!cluster.operations.empty()) clusters.emplace_back(std::move(cluster)); } LLVM_DEBUG(llvm::dbgs() << "Found " << clusters.size() << " clusters\n");
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 27.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug.go
if !isNamedRegParam(inp) { // will be sorted out elsewhere continue } sl := rval.Slots[pidx] n := rval.Vars[pidx] if afterPrologVal == ID(-1) { // This can happen for degenerate functions with infinite // loops such as that in issue 45948. In such cases, leave // the var/slot set up for the param, but don't try to // emit a location list. if loggingEnabled {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/prove.go
// from entry to b passes through p and p.Succs[0]. We care that // no path from entry to b passes through p.Succs[1]. If p.Succs[0] // has one predecessor then (apart from the degenerate case), // there is no path from entry that can reach b through p.Succs[1]. // TODO: how about p->yes->b->yes, i.e. a loop in yes. if sdom.IsAncestorEq(p.Succs[0].b, b) && len(p.Succs[0].b.Preds) == 1 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:30:21 UTC 2024 - 48.9K bytes - Viewed (0)