Export MapIterator

go/types/map.go

@@ -202,18 +202,18 @@ func (m Map) Any(cb func(k, v Value) bool) (yep bool) {
 	return
 }
 
-func (m Map) Iterator() *mapIterator {
+func (m Map) Iterator() *MapIterator {
 	return m.IteratorAt(0)
 }
 
-func (m Map) IteratorAt(pos uint64) *mapIterator {
-	return &mapIterator{
+func (m Map) IteratorAt(pos uint64) *MapIterator {
+	return &MapIterator{
 		cursor: newCursorAtIndex(m.orderedSequence, pos),
 	}
 }
 
-func (m Map) IteratorFrom(key Value) *mapIterator {
-	return &mapIterator{
+func (m Map) IteratorFrom(key Value) *MapIterator {
+	return &MapIterator{
 		cursor: newCursorAtValue(m.orderedSequence, key, false, false),
 	}
 }

go/types/map_iterator.go

@@ -4,44 +4,44 @@
 
 package types
 
-// mapIterator can efficiently iterate through a Noms Map.
-type mapIterator struct {
+// MapIterator can efficiently iterate through a Noms Map.
+type MapIterator struct {
 	cursor       *sequenceCursor
 	currentKey   Value
 	currentValue Value
 }
 
-func (mi *mapIterator) Valid() bool {
+func (mi *MapIterator) Valid() bool {
 	return mi.cursor.valid()
 }
 
-func (mi *mapIterator) Entry() (k Value, v Value) {
+func (mi *MapIterator) Entry() (k Value, v Value) {
 	return mi.Key(), mi.Value()
 }
 
-func (mi *mapIterator) Key() Value {
+func (mi *MapIterator) Key() Value {
 	if !mi.cursor.valid() {
 		return nil
 	}
 	return mi.cursor.current().(mapEntry).key
 }
 
-func (mi *mapIterator) Value() Value {
+func (mi *MapIterator) Value() Value {
 	if !mi.cursor.valid() {
 		return nil
 	}
 	return mi.cursor.current().(mapEntry).value
 }
 
-func (mi *mapIterator) Position() uint64 {
+func (mi *MapIterator) Position() uint64 {
 	if !mi.cursor.valid() {
 		return 0
 	}
 	return uint64(mi.cursor.idx)
 }
 
 // Prev returns the previous entry from the Map. If there is no previous entry, Prev() returns nils.
-func (mi *mapIterator) Prev() bool {
+func (mi *MapIterator) Prev() bool {
 	if !mi.cursor.valid() {
 		return false
 	}
@@ -50,7 +50,7 @@ func (mi *mapIterator) Prev() bool {
 
 // Next returns the subsequent entries from the Map, starting with the entry at which the iterator
 // was created. If there are no more entries, Next() returns nils.
-func (mi *mapIterator) Next() bool {
+func (mi *MapIterator) Next() bool {
 	if !mi.cursor.valid() {
 		return false
 	}

go/types/map_iterator_test.go

@@ -54,7 +54,7 @@ func TestMapIterator(t *testing.T) {
 
 	for i, t := range tc {
 		lbl := fmt.Sprintf("test case %d", i)
-		var it *mapIterator
+		var it *MapIterator
 		if t.iter {
 			it = m.Iterator()
 		} else if t.iterFrom != "" {