From 5913aee5004ff5b32c7926dda3af1f946d203f33 Mon Sep 17 00:00:00 2001
From: Máximo Cuadros <mcuadros@gmail.com>
Date: Thu, 22 Sep 2016 23:41:48 +0200
Subject: test coverage improved, Remote.Refs and Repository.Refs returns
 error, TreeWalker -> TreeIter

---
 tree_walker.go | 113 ---------------------------------------------------------
 1 file changed, 113 deletions(-)
 delete mode 100644 tree_walker.go

(limited to 'tree_walker.go')

diff --git a/tree_walker.go b/tree_walker.go
deleted file mode 100644
index cbd81c4..0000000
--- a/tree_walker.go
+++ /dev/null
@@ -1,113 +0,0 @@
-package git
-
-import (
-	"io"
-	"path"
-)
-
-const (
-	startingStackSize = 8
-)
-
-const submoduleMode = 0160000
-const directoryMode = 0040000
-
-// TreeWalker provides a means of walking through all of the entries in a Tree.
-type TreeWalker struct {
-	stack []treeEntryIter
-	base  string
-
-	r *Repository
-	t *Tree
-}
-
-// NewTreeWalker returns a new TreeWalker for the given repository and tree.
-//
-// It is the caller's responsibility to call Close() when finished with the
-// tree walker.
-func NewTreeWalker(r *Repository, t *Tree) *TreeWalker {
-	w := TreeWalker{
-		stack: make([]treeEntryIter, 0, startingStackSize),
-		base:  "",
-		r:     r,
-		t:     t,
-	}
-	w.stack = append(w.stack, treeEntryIter{t, 0})
-	return &w
-}
-
-// Next returns the next object from the tree. Objects are returned in order
-// and subtrees are included. After the last object has been returned further
-// calls to Next() will return io.EOF.
-//
-// In the current implementation any objects which cannot be found in the
-// underlying repository will be skipped automatically. It is possible that this
-// may change in future versions.
-func (w *TreeWalker) Next() (name string, entry TreeEntry, err error) {
-	var obj Object
-	for {
-		current := len(w.stack) - 1
-		if current < 0 {
-			// Nothing left on the stack so we're finished
-			err = io.EOF
-			return
-		}
-
-		if current > maxTreeDepth {
-			// We're probably following bad data or some self-referencing tree
-			err = ErrMaxTreeDepth
-			return
-		}
-
-		entry, err = w.stack[current].Next()
-		if err == io.EOF {
-			// Finished with the current tree, move back up to the parent
-			w.stack = w.stack[:current]
-			w.base, _ = path.Split(w.base)
-			w.base = path.Clean(w.base) // Remove trailing slash
-			continue
-		}
-
-		if err != nil {
-			return
-		}
-
-		if entry.Mode == submoduleMode {
-			err = nil
-			continue
-		}
-
-		if entry.Mode.IsDir() {
-			obj, err = w.r.Tree(entry.Hash)
-		}
-
-		name = path.Join(w.base, entry.Name)
-
-		if err != nil {
-			return
-		}
-
-		break
-	}
-
-	if t, ok := obj.(*Tree); ok {
-		w.stack = append(w.stack, treeEntryIter{t, 0})
-		w.base = path.Join(w.base, entry.Name)
-	}
-
-	return
-}
-
-// Tree returns the tree that the tree walker most recently operated on.
-func (w *TreeWalker) Tree() *Tree {
-	current := len(w.stack) - 1
-	if current < 0 {
-		return nil
-	}
-	return w.stack[current].t
-}
-
-// Close releases any resources used by the TreeWalker.
-func (w *TreeWalker) Close() {
-	w.stack = nil
-}
-- 
cgit