- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 12 for nondeterministic (0.25 sec)
-
src/sort/sort_test.go
func (t *nonDeterministicTestingData) Less(i, j int) bool { if i < 0 || j < 0 || i >= t.Len() || j >= t.Len() { panic("nondeterministic comparison out of bounds") } return t.r.Float32() < 0.5 } func (t *nonDeterministicTestingData) Swap(i, j int) { if i < 0 || j < 0 || i >= t.Len() || j >= t.Len() { panic("nondeterministic comparison out of bounds") } } func TestNonDeterministicComparison(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) -
pilot/pkg/config/kube/ingress/controller.go
func sortIngressByCreationTime(ingr []*knetworking.Ingress) []*knetworking.Ingress { sort.Slice(ingr, func(i, j int) bool { // If creation time is the same, then behavior is nondeterministic. In this case, we can // pick an arbitrary but consistent ordering based on name and namespace, which is unique. // CreationTimestamp is stored in seconds, so this is not uncommon.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon May 06 03:53:05 UTC 2024 - 11.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/stackalloc.go
} else { s.names = make([]LocalSlot, n) } names := s.names empty := LocalSlot{} for _, name := range f.Names { // Note: not "range f.NamedValues" above, because // that would be nondeterministic. for _, v := range f.NamedValues[*name] { if v.Op == OpArgIntReg || v.Op == OpArgFloatReg { aux := v.Aux.(*AuxNameOffset) // Never let an arg be bound to a differently named thing.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 29 21:29:41 UTC 2024 - 12.6K bytes - Viewed (0) -
pilot/pkg/model/config.go
func sortByCreationComparator(configs []config.Config) func(i, j int) bool { return func(i, j int) bool { // If creation time is the same, then behavior is nondeterministic. In this case, we can // pick an arbitrary but consistent ordering based on name and namespace, which is unique. // CreationTimestamp is stored in seconds, so this is not uncommon.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Feb 28 08:51:03 UTC 2024 - 13.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/Streams.java
* href="http://gee.cs.oswego.edu/dl/html/StreamParallelGuidance.html">efficiently splittable</a> * streams. * * <p>If the stream has nondeterministic order, this has equivalent semantics to {@link * Stream#findAny} (which you might as well use). * * @see Stream#findFirst() * @throws NullPointerException if the last element of the stream is null */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 36.5K bytes - Viewed (0) -
src/cmd/go/internal/modget/get.go
}) } return versionOk } r.loadPackages(ctx, []string{"all"}, findPackage) // Since we built up the candidate lists concurrently, they may be in a // nondeterministic order. We want 'go get' to be fully deterministic, // including in which errors it chooses to report, so sort the candidates // into a deterministic-but-arbitrary order. for _, q := range r.patternAllQueries {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 18:26:32 UTC 2024 - 66.5K bytes - Viewed (0) -
pilot/pkg/model/push_context.go
slices.SortStableFunc(services, func(a, b *Service) int { if r := a.CreationTime.Compare(b.CreationTime); r != 0 { return r } // If creation time is the same, then behavior is nondeterministic. In this case, we can // pick an arbitrary but consistent ordering based on name and namespace, which is unique. // CreationTimestamp is stored in seconds, so this is not uncommon.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed May 15 09:02:11 UTC 2024 - 91.8K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/mod/modfile/rule.go
} else { r.markRemoved() } delete(need, r.Mod.Path) } // Add new entries in the last block of the file for any paths that weren't // already present. // // This step is nondeterministic, but the final result will be deterministic // because we will sort the block. for path, e := range need { f.AddNewRequire(path, e.version, e.indirect) } f.SortBlocks() }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 18:34:56 UTC 2024 - 46.5K bytes - Viewed (0) -
src/cmd/link/link_test.go
if k == -1 { t.Fatalf("no newline after host link, output:\n%s", out) } out = out[:k] // filter out output file name, which is passed by the go // command and is nondeterministic. fs := bytes.Fields(out) for i, f := range fs { if bytes.Equal(f, []byte(`"-o"`)) && i+1 < len(fs) { fs[i+1] = []byte("a.out") break } } out = bytes.Join(fs, []byte{' '})
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 24 20:26:02 UTC 2024 - 43.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_generated_ops.td
If `indices` contains duplicates, the associated `updates` are accumulated (summed) into the output tensor. **WARNING**: For floating-point data types, the output may be nondeterministic. This is because the order in which the updates are applied is nondeterministic and when floating-point numbers are added in different orders the resulting numerical approximation error can be slightly different. However, the output
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 23:24:08 UTC 2024 - 793K bytes - Viewed (0)