improve small map

smap/smap.go

@@ -15,24 +15,42 @@ func NewSmap() *List {
 	}
 }
 
+func (l *List) Set(k, v string) {
+	found := false
+	for i := range l.list {
+		if l.list[i].key == k {
+			l.list[i].val = v
+			found = true
+			break
+		}
+	}
+	if !found {
+		l.list = append(l.list, Map{k, v})
+	}
+}
+
+/*
 func (l *List) Set(k, v string) {
 	kv := Map{k, v}
 	if len(l.list) < 1 {
-
 		l.list = append(l.list, kv)
 		return
 	}
+
 	for i := 0; i < len(l.list); i++ {
 		if l.list[i].key == k {
 			l.list[i].val = v
+			break
 		} else if l.list[i].key == "" {
 			l.list[i].val = v
+			break
 		} else {
 			l.list = append(l.list, kv)
 			break
 		}
 	}
 }
+*/
 
 func (l *List) Get(k string) string {
 

smap/smap_test.go

@@ -31,17 +31,24 @@ func Test_Get(t *testing.T) {
 func Test_Len(t *testing.T) {
 	if smap.Len() != len(cases) {
 		t.Errorf("have %d, want %d", smap.Len(), len(cases))
+		//	t.Error(smap.list, cases)
 	}
 }
 
-func Test_Update(t *testing.T) {
+func Test_Set2(t *testing.T) {
 	hello := "hello_hello"
 	smap.Set("hi0", hello)
 	if smap.Get("hi0") != hello {
 		t.Errorf("have %s, want %s", smap.Get("hi"), hello)
 	}
 }
 
+func Test_Len2(t *testing.T) {
+	if smap.Len() != len(cases) {
+		//t.Errorf("have %d, want %d", smap.Len(), len(cases))
+		t.Error("\n", smap.list, "\n", cases)
+	}
+}
 func BenchmarkMap(t *testing.B) {
 
 	// keys := NewSmap()