- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for SetEqual (0.35 sec)
-
src/cmd/compile/internal/ssa/poset_test.go
{Checkpoint, 0, 0}, {SetEqual, 2, 100}, {Ordered, 1, 107}, {Ordered, 100, 6}, // SetEqual with new node {Undo, 0, 0}, {Checkpoint, 0, 0}, {SetEqual, 2, 400}, {SetEqual, 401, 2}, {Equal, 400, 401}, {Ordered, 1, 400}, {Ordered, 400, 6}, {Ordered, 1, 401}, {Ordered, 401, 6}, {Ordered_Fail, 2, 401}, // SetEqual unseen nodes and then connect
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Oct 26 07:52:35 UTC 2019 - 18.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/poset.go
panic("should not call SetOrder with n1==n2") } return po.setOrder(n1, n2, false) } // SetEqual records that n1==n2. Returns false if this is a contradiction // (that is, if it is already recorded that n1<n2 or n2<n1). // Complexity is O(1) if n2 was never seen before, or O(n) otherwise. func (po *poset) SetEqual(n1, n2 *Value) bool { if debugPoset { defer po.CheckIntegrity() } if n1.ID == n2.ID {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 04 17:23:05 UTC 2023 - 37.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/prove.go
ok = order.SetOrder(v, w) case gt: ok = order.SetOrder(w, v) case lt | eq: ok = order.SetOrderOrEqual(v, w) case gt | eq: ok = order.SetOrderOrEqual(w, v) case eq: ok = order.SetEqual(v, w) case lt | gt: ok = order.SetNonEqual(v, w) default: panic("unknown relation") } if !ok { if parent.Func.pass.debug > 2 { parent.Func.Warnl(parent.Pos, "unsat %s %s %s", v, w, r)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:30:21 UTC 2024 - 48.9K bytes - Viewed (0)