src/server/pkg/hashtree/db.go
func (d *ChildCursor) Next() ([]byte, []byte) {
	if d.k == nil {
		return nil, nil
	}
	k, v := d.c.Seek(append(d.k, 1))
	if !bytes.HasPrefix(k, d.dir) {
		k, v = nil, nil
	}
	d.k, d.v = k, v
	return k, v
}
func (d *ChildCursor) Next() ([]byte, []byte) {
	if d.k == nil {
		return nil, nil
	}
	k, v := d.c.Seek(append(d.k, 1))
	if !bytes.HasPrefix(k, d.dir) {
		k, v = nil, nil
	}
	d.k, d.v = k, v
	return k, v
}
func ( d * ChildCursor ) Next ( ) ( [ ] byte , [ ] byte ) { if d . k == nil { return nil , nil } k , v := d . c . Seek ( append ( d . k , 1 ) ) if ! bytes . HasPrefix ( k , d . dir ) { k , v = nil , nil } d . k , d . v = k , v return k , v }
// Next gets the next key, value pair.
Next gets the next key value pair .