-
Notifications
You must be signed in to change notification settings - Fork 187
Expand file tree
/
Copy pathtree.go
More file actions
271 lines (232 loc) · 5.4 KB
/
Copy pathtree.go
File metadata and controls
271 lines (232 loc) · 5.4 KB
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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
/*
* Warp (C) 2019-2026 MinIO, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package iceberg
import (
"fmt"
)
type TreeConfig struct {
NamespaceWidth int
NamespaceDepth int
TablesPerNS int
ViewsPerNS int
ColumnsPerTable int
ColumnsPerView int
PropertiesPerNS int
PropertiesPerTbl int
PropertiesPerVw int
BaseLocation string
CatalogName string
}
type Tree struct {
cfg TreeConfig
}
func NewTree(cfg TreeConfig) *Tree {
return &Tree{cfg: cfg}
}
func (t *Tree) TotalNamespaces() int {
if t.cfg.NamespaceWidth == 1 {
return t.cfg.NamespaceDepth
}
n := 1
for i := 0; i < t.cfg.NamespaceDepth; i++ {
n *= t.cfg.NamespaceWidth
}
return (n - 1) / (t.cfg.NamespaceWidth - 1)
}
func (t *Tree) LeafNamespaces() int {
n := 1
for i := 0; i < t.cfg.NamespaceDepth-1; i++ {
n *= t.cfg.NamespaceWidth
}
return n
}
func (t *Tree) TotalTables() int {
return t.LeafNamespaces() * t.cfg.TablesPerNS
}
func (t *Tree) TotalViews() int {
return t.LeafNamespaces() * t.cfg.ViewsPerNS
}
func (t *Tree) DepthOf(ordinal int) int {
if t.cfg.NamespaceWidth == 1 {
return ordinal
}
depth := 0
size := 1
total := 0
for total+size <= ordinal {
total += size
size *= t.cfg.NamespaceWidth
depth++
}
return depth
}
func (t *Tree) PathToRoot(ordinal int) []string {
// Build hierarchical path from root to this node
var path []int
current := ordinal
for current >= 0 {
path = append([]int{current}, path...)
current = t.parentOf(current)
}
result := make([]string, len(path))
for i, ord := range path {
result[i] = t.namespaceName(ord)
}
return result
}
func (t *Tree) parentOf(ordinal int) int {
if ordinal == 0 {
return -1
}
if t.cfg.NamespaceWidth == 1 {
return ordinal - 1
}
return (ordinal - 1) / t.cfg.NamespaceWidth
}
func (t *Tree) ChildrenOf(ordinal int) []int {
if t.DepthOf(ordinal) >= t.cfg.NamespaceDepth-1 {
return nil
}
if t.cfg.NamespaceWidth == 1 {
return []int{ordinal + 1}
}
first := ordinal*t.cfg.NamespaceWidth + 1
children := make([]int, t.cfg.NamespaceWidth)
for i := 0; i < t.cfg.NamespaceWidth; i++ {
children[i] = first + i
}
return children
}
func (t *Tree) IsLeaf(ordinal int) bool {
return t.DepthOf(ordinal) == t.cfg.NamespaceDepth-1
}
func (t *Tree) LeafOrdinals() []int {
total := t.TotalNamespaces()
leafCount := t.LeafNamespaces()
start := total - leafCount
ordinals := make([]int, leafCount)
for i := 0; i < leafCount; i++ {
ordinals[i] = start + i
}
return ordinals
}
func (t *Tree) namespaceName(ordinal int) string {
// MinIO S3 Tables doesn't allow underscores in namespace names
return fmt.Sprintf("ns%d", ordinal)
}
func (t *Tree) TableName(index int) string {
return fmt.Sprintf("t%d", index)
}
func (t *Tree) ViewName(index int) string {
return fmt.Sprintf("v%d", index)
}
func (t *Tree) TableLocation(namespace []string, tableName string) string {
path := t.cfg.BaseLocation + "/" + t.cfg.CatalogName
for _, ns := range namespace {
path += "/" + ns
}
return path + "/" + tableName
}
func (t *Tree) Config() TreeConfig {
return t.cfg
}
type NamespaceInfo struct {
Ordinal int
Path []string
IsLeaf bool
TableIdxs []int
ViewIdxs []int
}
func (t *Tree) AllNamespaces() []NamespaceInfo {
total := t.TotalNamespaces()
result := make([]NamespaceInfo, total)
tableIdx := 0
viewIdx := 0
for i := 0; i < total; i++ {
info := NamespaceInfo{
Ordinal: i,
Path: t.PathToRoot(i),
IsLeaf: t.IsLeaf(i),
}
if info.IsLeaf {
info.TableIdxs = make([]int, t.cfg.TablesPerNS)
for j := 0; j < t.cfg.TablesPerNS; j++ {
info.TableIdxs[j] = tableIdx
tableIdx++
}
info.ViewIdxs = make([]int, t.cfg.ViewsPerNS)
for j := 0; j < t.cfg.ViewsPerNS; j++ {
info.ViewIdxs[j] = viewIdx
viewIdx++
}
}
result[i] = info
}
return result
}
type TableInfo struct {
Index int
Name string
Namespace []string
Location string
}
func (t *Tree) AllTables() []TableInfo {
var tables []TableInfo
tableIdx := 0
for _, ns := range t.AllNamespaces() {
if !ns.IsLeaf {
continue
}
for i := 0; i < t.cfg.TablesPerNS; i++ {
name := t.TableName(tableIdx)
tables = append(tables, TableInfo{
Index: tableIdx,
Name: name,
Namespace: ns.Path,
Location: t.TableLocation(ns.Path, name),
})
tableIdx++
}
}
return tables
}
type ViewInfo struct {
Index int
Name string
Namespace []string
Location string
}
func (t *Tree) AllViews() []ViewInfo {
var views []ViewInfo
viewIdx := 0
for _, ns := range t.AllNamespaces() {
if !ns.IsLeaf {
continue
}
for i := 0; i < t.cfg.ViewsPerNS; i++ {
name := t.ViewName(viewIdx)
views = append(views, ViewInfo{
Index: viewIdx,
Name: name,
Namespace: ns.Path,
Location: t.TableLocation(ns.Path, name),
})
viewIdx++
}
}
return views
}