forked from gitea/gitea
1
0
Fork 0
gitea/vendor/code.gitea.io/git/tree.go

87 lines
1.7 KiB
Go
Raw Normal View History

2016-11-04 06:16:01 +08:00
// Copyright 2015 The Gogs Authors. All rights reserved.
// Use of this source code is governed by a MIT-style
// license that can be found in the LICENSE file.
package git
import (
"strings"
)
// Tree represents a flat directory listing.
type Tree struct {
2016-12-22 17:30:52 +08:00
ID SHA1
2016-11-04 06:16:01 +08:00
repo *Repository
// parent tree
ptree *Tree
entries Entries
entriesParsed bool
}
2016-12-22 17:30:52 +08:00
// NewTree create a new tree according the repository and commit id
func NewTree(repo *Repository, id SHA1) *Tree {
2016-11-04 06:16:01 +08:00
return &Tree{
ID: id,
repo: repo,
}
}
2016-12-22 17:30:52 +08:00
// SubTree get a sub tree by the sub dir path
2016-11-04 06:16:01 +08:00
func (t *Tree) SubTree(rpath string) (*Tree, error) {
if len(rpath) == 0 {
return t, nil
}
paths := strings.Split(rpath, "/")
var (
err error
g = t
p = t
te *TreeEntry
)
for _, name := range paths {
te, err = p.GetTreeEntryByPath(name)
if err != nil {
return nil, err
}
g, err = t.repo.getTree(te.ID)
if err != nil {
return nil, err
}
g.ptree = p
p = g
}
return g, nil
}
// ListEntries returns all entries of current tree.
func (t *Tree) ListEntries() (Entries, error) {
if t.entriesParsed {
return t.entries, nil
}
stdout, err := NewCommand("ls-tree", t.ID.String()).RunInDirBytes(t.repo.Path)
if err != nil {
return nil, err
}
2018-02-11 02:19:26 +08:00
t.entries, err = parseTreeEntries(stdout, t)
2016-11-04 06:16:01 +08:00
return t.entries, err
}
// ListEntriesRecursive returns all entries of current tree recursively including all subtrees
func (t *Tree) ListEntriesRecursive() (Entries, error) {
if t.entriesParsed {
return t.entries, nil
}
stdout, err := NewCommand("ls-tree", "-t", "-r", t.ID.String()).RunInDirBytes(t.repo.Path)
if err != nil {
return nil, err
}
t.entries, err = parseTreeEntries(stdout, t)
return t.entries, err
}