-
Notifications
You must be signed in to change notification settings - Fork 2
/
tree.go
135 lines (109 loc) · 2.46 KB
/
tree.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
package main
import (
"fmt"
"os"
"path/filepath"
"regexp"
"strings"
)
type Tree struct {
Root *Node
MaxDepth int
directoryCount int
fileCount int
}
func NewTree(directory string, maxDepth int) *Tree {
year, month, day := GetYMD(directory)
dirPath, err := filepath.Abs(directory)
if err != nil {
panic(err)
}
return &Tree{
Root: NewNode(dirPath, year, month, day),
MaxDepth: maxDepth,
directoryCount: 0,
fileCount: 0,
}
}
func (t *Tree) Build() error {
file, err := os.Open(t.Root.FileName)
if err != nil {
return err
}
var regularExpression *regexp.Regexp
if filterPattern != "" {
regularExpression, err = regexp.Compile(filterPattern)
if err != nil {
return groupbyError("Invalid regular expression specified in -e/-pattern")
}
}
files, err := file.Readdir(-1)
if err != nil {
return err
}
if files == nil {
return groupbyError("Directory is empty or cannot be read")
}
for _, f := range files {
if regularExpression != nil && !regularExpression.MatchString(f.Name()) {
continue
}
if ignoreDirectories && f.IsDir() {
continue
} else {
t.AddEntry(f)
}
}
return nil
}
func (t *Tree) AddEntry(file os.FileInfo) {
if strings.HasPrefix(file.Name(), ".") && !includeHidden {
return
}
if file.IsDir() {
t.directoryCount++
} else {
t.fileCount++
}
year, month, day := GetFileInfoYMD(file)
var node = NewNode(file.Name(), year, month, day)
yearStr, monthStr, dayStr := fmt.Sprintf("%d", year), fmt.Sprintf("%d", month), fmt.Sprintf("%d", day)
var yearNode = t.Root.Search(yearStr)
// year node
if yearNode == nil {
yearNode = NewNode(yearStr, year, month, day)
t.Root.AddChild(yearNode)
}
if t.MaxDepth == 1 {
yearNode.AddChild(node)
}
if t.MaxDepth >= 2 {
// month node
var monthNode = yearNode.Search(monthStr)
if monthNode == nil {
monthNode = NewNode(monthStr, year, month, day)
yearNode.AddChild(monthNode)
}
if t.MaxDepth == 3 {
var dayNode = monthNode.Search(dayStr)
if dayNode == nil {
dayNode = NewNode(dayStr, year, month, day)
monthNode.AddChild(dayNode)
}
dayNode.AddChild(node)
} else {
monthNode.AddChild(node)
}
}
}
func (t *Tree) Visit(visitor NodeVisitor) {
t.Root.Visit(visitor, 0)
}
// Directories returns number of directories in the tree
func (t *Tree) Directories() int {
return t.directoryCount
}
// Files returns number of files in the tree
func (t *Tree) Files() int {
return t.fileCount
}