- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for Converge (0.19 sec)
-
tensorflow/compiler/jit/deadness_analysis.cc
// where the data-flow lattice has two elements, Symbolic and NonSymbolic with // Symbolic > NonSymbolic. The lattice has height = 2 so two iterations are // sufficient to converge. // // We first do an optimistic analysis and, if it does not converge, we then fall // back to a pessimistic analysis. The optimistic analysis assigns the same // symbolic predicate to all the merge nodes whose preceding enter nodes have
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0) -
pilot/pkg/serviceregistry/serviceregistry_test.go
sort.Strings(expected) if !reflect.DeepEqual(got[cluster], expected) { return fmt.Errorf("wanted %v got %v. All endpoints: %+v", expected, got[cluster], got) } return nil }, retry.Converge(2), retry.Timeout(time.Second*2), retry.Delay(time.Millisecond*10)) } func expectServiceEndpointsFromIndex(t *testing.T, ei *model.EndpointIndex, svc *model.Service, port int, expected []EndpointResponse) { t.Helper()
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu May 23 21:07:03 UTC 2024 - 51.2K bytes - Viewed (0) -
pilot/pkg/serviceregistry/serviceentry/controller_test.go
sortServiceTargets(instances) sortServiceTargets(expected) if err := compare(t, instances, expected); err != nil { return err } return nil }, retry.Converge(2), retry.Timeout(time.Second*5)) } func expectEvents(t testing.TB, ch *xdsfake.Updater, events ...Event) { t.Helper() ch.StrictMatchOrFail(t, events...) }
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed May 29 15:31:09 UTC 2024 - 92.9K bytes - Viewed (0) -
src/cmd/dist/test.go
// so that tests that run commands end up testing what's actually on disk. // If everything is up-to-date, this is a no-op. // We first build the toolchain twice to allow it to converge, // as when we first bootstrap. // See cmdbootstrap for a description of the overall process. // // On the builders, we skip this step: we assume that 'dist test' is
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 16:01:35 UTC 2024 - 50K bytes - Viewed (0) -
src/cmd/go/internal/modload/load.go
// whether importFromModules returns nil for the package. // False-positives are ok: if we have a false-positive here, we'll do an // extra iteration of package loading this time, but we'll still // converge when the root set stops changing. // // In some sense, we can think of this as ‘upgraded the module providing // pkg.path from "none" to a version higher than "none"’.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 14:56:56 UTC 2024 - 84K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug.go
counterTime := int32(1) // Reverse postorder: visit a block after as many as possible of its // predecessors have been visited. po := state.f.Postorder() converged := false // The iteration rule is that by default, run until converged, but // if a particular iteration count is specified, run that many // iterations, no more, no less. A count is specified as the // thousands digit of the location lists debug flag,
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/go/internal/modload/buildlist.go
// version, the caller may need to reload and recompute the package graph. // // To ensure that the loading process eventually converges, the caller should // add any needed roots from the tidy root set (without removing existing untidy // roots) until the set of roots has converged. func tidyPrunedRoots(ctx context.Context, mainModule module.Version, old *Requirements, pkgs []*loadPkg) (*Requirements, error) { var (
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 16:04:44 UTC 2024 - 53.8K bytes - Viewed (0)