v0.0.644 exerr.DeregisterListener

dataext/orderedMap.go

@@ -6,15 +6,28 @@ import (
 )
 
 // OrderedMap is like a normal map[TKey, TVal] - but its elements stay in order
+// NOT THREADSAFE !!!
 type OrderedMap[TKey comparable, TVal any] struct {
 	m map[TKey]*TVal
 	a []TKey
 }
 
-func NewOrderedMap[TKey comparable, TVal any](cap int) *OrderedMap[TKey, TVal] {
+func NewOrderedMap[TKey comparable, TVal any](caps ...int) *OrderedMap[TKey, TVal] {
+	if len(caps) == 0 {
+		return &OrderedMap[TKey, TVal]{
+			m: make(map[TKey]*TVal),
+			a: make([]TKey, 0),
+		}
+	}
+
+	omcap := 0
+	for _, v := range caps {
+		omcap += v
+	}
+
 	return &OrderedMap[TKey, TVal]{
-		m: make(map[TKey]*TVal, cap),
-		a: make([]TKey, 0, cap),
+		m: make(map[TKey]*TVal, omcap),
+		a: make([]TKey, 0, omcap),
 	}
 }
 
@@ -85,7 +98,17 @@ func (o *OrderedMap[TKey, TVal]) Remove(key TKey) bool {
 	return false
 }
 
-func (o *OrderedMap[TKey, TVal]) Iterate() iter.Seq[TVal] {
+func (o *OrderedMap[TKey, TVal]) Iterate() iter.Seq2[TKey, TVal] {
+	return func(yield func(TKey, TVal) bool) {
+		for _, v := range o.a {
+			if !yield(v, *o.m[v]) {
+				return
+			}
+		}
+	}
+}
+
+func (o *OrderedMap[TKey, TVal]) IterateValues() iter.Seq[TVal] {
 	return func(yield func(TVal) bool) {
 		for _, v := range o.a {
 			if !yield(*o.m[v]) {

dataext/orderedMap_test.go

@@ -15,6 +15,22 @@ func TestOrderedMapNew(t *testing.T) {
 	tst.AssertArrayEqual(t, m.Array(), []int{})
 }
 
+func TestOrderedMapNewNoCap(t *testing.T) {
+	m := NewOrderedMap[string, int]()
+
+	tst.AssertEqual(t, m.Size(), 0)
+	tst.AssertArrayEqual(t, m.Keys(), []string{})
+	tst.AssertArrayEqual(t, m.Array(), []int{})
+}
+
+func TestOrderedMapNewWIthCap(t *testing.T) {
+	m := NewOrderedMap[string, int](4)
+
+	tst.AssertEqual(t, m.Size(), 0)
+	tst.AssertArrayEqual(t, m.Keys(), []string{})
+	tst.AssertArrayEqual(t, m.Array(), []int{})
+}
+
 func TestOrderedMapAddAndGet(t *testing.T) {
 	m := NewOrderedMap[string, int](0)
 
@@ -238,7 +254,7 @@ func TestOrderedMapIterate(t *testing.T) {
 	m.Add("c", 3)
 
 	got := make([]int, 0)
-	for v := range m.Iterate() {
+	for v := range m.IterateValues() {
 		got = append(got, v)
 	}
 
@@ -252,7 +268,7 @@ func TestOrderedMapIterateBreak(t *testing.T) {
 	m.Add("c", 3)
 
 	got := make([]int, 0)
-	for v := range m.Iterate() {
+	for v := range m.IterateValues() {
 		got = append(got, v)
 		if v == 2 {
 			break
@@ -262,6 +278,61 @@ func TestOrderedMapIterateBreak(t *testing.T) {
 	tst.AssertArrayEqual(t, got, []int{1, 2})
 }
 
+func TestOrderedMapIterateSeq2(t *testing.T) {
+	m := NewOrderedMap[string, int](0)
+	m.Add("a", 1)
+	m.Add("b", 2)
+	m.Add("c", 3)
+
+	gotKeys := make([]string, 0)
+	gotVals := make([]int, 0)
+	for k, v := range m.Iterate() {
+		gotKeys = append(gotKeys, k)
+		gotVals = append(gotVals, v)
+	}
+
+	tst.AssertArrayEqual(t, gotKeys, []string{"a", "b", "c"})
+	tst.AssertArrayEqual(t, gotVals, []int{1, 2, 3})
+}
+
+func TestOrderedMapIterateSeq2Break(t *testing.T) {
+	m := NewOrderedMap[string, int](0)
+	m.Add("a", 1)
+	m.Add("b", 2)
+	m.Add("c", 3)
+
+	gotKeys := make([]string, 0)
+	gotVals := make([]int, 0)
+	for k, v := range m.Iterate() {
+		gotKeys = append(gotKeys, k)
+		gotVals = append(gotVals, v)
+		if k == "b" {
+			break
+		}
+	}
+
+	tst.AssertArrayEqual(t, gotKeys, []string{"a", "b"})
+	tst.AssertArrayEqual(t, gotVals, []int{1, 2})
+}
+
+func TestOrderedMapIterateSeq2AfterReorder(t *testing.T) {
+	m := NewOrderedMap[string, int](0)
+	m.Add("a", 1)
+	m.Add("b", 2)
+	m.Add("c", 3)
+	m.Add("a", 10) // moves "a" to end with new value
+
+	gotKeys := make([]string, 0)
+	gotVals := make([]int, 0)
+	for k, v := range m.Iterate() {
+		gotKeys = append(gotKeys, k)
+		gotVals = append(gotVals, v)
+	}
+
+	tst.AssertArrayEqual(t, gotKeys, []string{"b", "c", "a"})
+	tst.AssertArrayEqual(t, gotVals, []int{2, 3, 10})
+}
+
 func TestOrderedMapIterateKeys(t *testing.T) {
 	m := NewOrderedMap[string, int](0)
 	m.Add("a", 1)