Use new compare functions

Author: ancientlore

map.go

@@ -31,14 +31,7 @@ func NewMapOrdered[K cmp.Ordered, V any]() *Map[K, V] {
 	return &Map[K, V]{
 		t: Tree[Pair[K, V]]{
 			compare: func(v1, v2 Pair[K, V]) int {
-				switch {
-				case v1.Key < v2.Key:
-					return -1
-				case v1.Key == v2.Key:
-					return 0
-				default:
-					return 1
-				}
+				return cmp.Compare(v1.Key, v2.Key)
 			},
 		},
 	}

tree.go

@@ -68,16 +68,7 @@ func New[T any](c func(T, T) int, flags byte) *Tree[T] {
 // NewOrdered returns an initialized tree using ordered types.
 func NewOrdered[T cmp.Ordered](flags byte) *Tree[T] {
 	return &Tree[T]{
-		compare: func(v1, v2 T) int {
-			switch {
-			case v1 < v2:
-				return -1
-			case v1 == v2:
-				return 0
-			default:
-				return 1
-			}
-		},
+		compare:   cmp.Compare[T],
 		treeFlags: flags,
 	}
 }