Require comparable interface instead of constraints.Ordered for map k…

…eys (#29)
elliotchance · Sep 3, 2022 · ef17579 · ef17579
1 parent ebace64
commit ef17579
Show file tree

Hide file tree

Showing 2 changed files with 5 additions and 7 deletions.
diff --git a/v2/element.go b/v2/element.go
@@ -2,17 +2,16 @@ package orderedmap
 
 import (
 	"container/list"
-	"golang.org/x/exp/constraints"
 )
 
-type Element[K constraints.Ordered, V any] struct {
+type Element[K comparable, V any] struct {
 	Key   K
 	Value V
 
 	element *list.Element
 }
 
-func newElement[K constraints.Ordered, V any](e *list.Element) *Element[K, V] {
+func newElement[K comparable, V any](e *list.Element) *Element[K, V] {
 	if e == nil {
 		return nil
 	}

diff --git a/v2/orderedmap.go b/v2/orderedmap.go
@@ -2,20 +2,19 @@ package orderedmap
 
 import (
 	"container/list"
-	"golang.org/x/exp/constraints"
 )
 
-type orderedMapElement[K constraints.Ordered, V any] struct {
+type orderedMapElement[K comparable, V any] struct {
 	key   K
 	value V
 }
 
-type OrderedMap[K constraints.Ordered, V any] struct {
+type OrderedMap[K comparable, V any] struct {
 	kv map[K]*list.Element
 	ll *list.List
 }
 
-func NewOrderedMap[K constraints.Ordered, V any]() *OrderedMap[K, V] {
+func NewOrderedMap[K comparable, V any]() *OrderedMap[K, V] {
 	return &OrderedMap[K, V]{
 		kv: make(map[K]*list.Element),
 		ll: list.New(),