wip

Author: tangrufus

or.go

@@ -49,16 +49,12 @@ func Compact(o Or) Constrainter { // TODO: Test me.
 	ceiling, ceilingOk := maxFloorlessCeiling(o...)
 	floor, floorOk := minCeilinglessFloor(o...)
 
-	if ceilingOk && floorOk {
-		if matchAll(ceiling.ceiling(), floor.floor()) {
-			return NewWildcard()
-		}
-	}
-
 	o = slices.DeleteFunc(o, func(c CeilingFloorConstrainter) bool {
 		return c.ceiling().wildcard() || c.floor().wildcard()
 	})
 
+	// TODO: Find ceiling.
+
 	if floorOk {
 		for i := range o {
 			if o[i].Check(*floor.version) {
@@ -81,35 +77,19 @@ func Compact(o Or) Constrainter { // TODO: Test me.
 				}
 				continue
 			}
-
-			//if floor.Check(*o[i].ceiling().version) {
-			//	floor = o[i].floor()
-			//	continue
-			//}
-
-			//if floor.Check(*o[i].ceiling().version) {
-			//	continue
-			//}
-			//
-			//if floor.compare(o[i].floor()) < 0 {
-			//	continue
-			//}
-			//
-			//if floor.compare(o[i].floor()) > 0 {
-			//	//floor = o[i].floor()
-			//	continue
-			//}
-			//
-			//if o[i].floor().inclusive() {
-			//	floor = o[i].floor()
-			//}
 		}
 
 		o = slices.DeleteFunc(o, func(c CeilingFloorConstrainter) bool {
 			return floor.compare(c.floor()) <= 0
 		})
 	}
 
+	if ceilingOk && floorOk {
+		if matchAll(ceiling, floor) {
+			return NewWildcard()
+		}
+	}
+
 	// important to sort before compacting
 	slices.SortFunc(o, compare)
 	// remove duplicates
@@ -143,6 +123,10 @@ func Compact(o Or) Constrainter { // TODO: Test me.
 		vals = append(vals, ceiling)
 	}
 
+	if len(vals) == 1 {
+		return vals[0]
+	}
+
 	slices.SortFunc(vals, compare)
 	return slices.Clip(vals)
 }