forked from coreos/mantle
-
Notifications
You must be signed in to change notification settings - Fork 0
/
tree.go
93 lines (79 loc) · 2.18 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
// Copyright 2016 CoreOS, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package index
import (
"strings"
gs "google.golang.org/api/storage/v1"
"github.com/coreos/mantle/lang/natsort"
"github.com/coreos/mantle/storage"
)
type IndexTree struct {
bucket *storage.Bucket
prefixes map[string]bool
subdirs map[string][]string
objects map[string][]*gs.Object
}
func NewIndexTree(bucket *storage.Bucket, includeEmpty bool) *IndexTree {
t := &IndexTree{
bucket: bucket,
prefixes: make(map[string]bool),
subdirs: make(map[string][]string),
objects: make(map[string][]*gs.Object),
}
for _, prefix := range bucket.Prefixes() {
if includeEmpty {
t.addDir(prefix)
} else {
t.prefixes[prefix] = false // initialize as empty
}
}
indexes := NewIndexSet(bucket)
for _, obj := range bucket.Objects() {
if indexes.NotIndex(obj) {
t.addObj(obj)
}
}
for _, dirs := range t.subdirs {
natsort.Strings(dirs)
}
for _, objs := range t.objects {
storage.SortObjects(objs)
}
return t
}
func (t *IndexTree) addObj(obj *gs.Object) {
prefix := storage.NextPrefix(obj.Name)
t.objects[prefix] = append(t.objects[prefix], obj)
t.addDir(prefix)
}
func (t *IndexTree) addDir(prefix string) {
for !t.prefixes[prefix] {
t.prefixes[prefix] = true // mark as not empty
if prefix == "" {
return
}
parent := storage.NextPrefix(prefix)
t.subdirs[parent] = append(t.subdirs[parent], prefix)
prefix = storage.NextPrefix(prefix)
}
}
func (t *IndexTree) Prefixes(dir string) []string {
prefixes := make([]string, 0, len(t.prefixes))
for prefix := range t.prefixes {
if strings.HasPrefix(prefix, dir) {
prefixes = append(prefixes, prefix)
}
}
return prefixes
}