Add methods from new files

Author: umpc

keys.go

@@ -0,0 +1,22 @@
+package sortedmap
+
+func (sm *SortedMap) keys(lowerBound, upperBound interface{}) ([]interface{}, bool) {
+	idxBounds := sm.boundsIdxSearch(lowerBound, upperBound)
+	if idxBounds == nil {
+		return nil, false
+	}
+	return sm.sorted[idxBounds[0]:idxBounds[1] + 1], true
+}
+
+// Keys returns a slice containing sorted keys.
+// The returned slice is valid until the next modification to the SortedMap structure.
+func (sm *SortedMap) Keys() []interface{} {
+	keys, _ := sm.keys(nil, nil)
+	return keys
+}
+
+// Keys returns a slice containing sorted keys.
+// The returned slice is valid until the next modification to the SortedMap structure.
+func (sm *SortedMap) BoundedKeys(lowerBound, upperBound interface{}) ([]interface{}, bool) {
+	return sm.keys(lowerBound, upperBound)
+}

keys_test.go

@@ -0,0 +1,45 @@
+package sortedmap
+
+import (
+	"testing"
+	"time"
+)
+
+func TestKeys(t *testing.T) {
+	sm, _, err := newSortedMapFromRandRecords(300)
+	if err != nil {
+		t.Fatal(err)
+	}
+	i := 0
+	keys := sm.Keys()
+	for _, key := range keys {
+		if key == nil {
+			t.Fatal("Key's value is nil.")
+		}
+		i++
+	}
+	if i == 0 {
+		t.Fatal("The returned slice was empty.")
+	}
+}
+
+func TestBoundedKeys(t *testing.T) {
+	sm, _, err := newSortedMapFromRandRecords(300)
+	if err != nil {
+		t.Fatal(err)
+	}
+	i := 0
+	keys, ok := sm.BoundedKeys(time.Time{}, time.Now())
+	if !ok {
+		t.Fatal("No values fall between or are equal to the given bounds.")
+	}
+	for _, key := range keys {
+		if key == nil {
+			t.Fatal("Key's value is nil.")
+		}
+		i++
+	}
+	if i == 0 {
+		t.Fatal("The returned slice was empty.")
+	}
+}

map.go

@@ -0,0 +1,9 @@
+package sortedmap
+
+// Map returns a map containing keys mapped to values.
+// The returned map is valid until the next modification to the SortedMap structure.
+// The map can be used with ether the Keys or BoundedKeys methods to select a range of items
+// and iterate over them using a slice for-range loop, rather than a channel for-range loop.
+func (sm *SortedMap) Map() map[interface{}]interface{} {
+	return sm.idx
+}

map_test.go

@@ -0,0 +1,21 @@
+package sortedmap
+
+import "testing"
+
+func TestMap(t *testing.T) {
+	sm, _, err := newSortedMapFromRandRecords(300)
+	if err != nil {
+		t.Fatal(err)
+	}
+	i := 0
+	m := sm.Map()
+	for _, val := range m {
+		if val == nil {
+			t.Fatal("Map key's value is nil.")
+		}
+		i++
+	}
+	if i == 0 {
+		t.Fatal("The returned map was empty.")
+	}
+}