This repository was archived by the owner on Feb 14, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtranform.go
57 lines (40 loc) · 1.44 KB
/
tranform.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
package boltdbtoipldhamt
import (
"log"
hamtcontainer "github.com/simplecoincom/go-ipld-adl-hamt-container"
)
func BuildNode(treeNode *TreeNode) error {
hamtContainer := treeNode.Data.(*hamtcontainer.HAMTContainer)
if treeNode.Parent == nil {
log.Printf("root node %p %s level %d children %+v\n", treeNode, hamtContainer.Key(), treeNode.Level, treeNode.Children)
for _, nestedTreeNode := range treeNode.Children {
nestedHAMTContainer := nestedTreeNode.Data.(*hamtcontainer.HAMTContainer)
if err := nestedHAMTContainer.MustBuild(); err != nil {
return err
}
link, err := nestedHAMTContainer.GetLink()
if err != nil {
return err
}
hamtContainer.Set(nestedHAMTContainer.Key(), link)
}
return hamtContainer.MustBuild()
}
if treeNode.Parent != nil && len(treeNode.Children) > 0 {
log.Printf("node %p %s level %d parent %p children %+v\n", treeNode, hamtContainer.Key(), treeNode.Level, treeNode.Parent, treeNode.Children)
for _, nestedTreeNode := range treeNode.Children {
nestedHAMTContainer := nestedTreeNode.Data.(*hamtcontainer.HAMTContainer)
if err := nestedHAMTContainer.MustBuild(); err != nil {
return err
}
link, err := nestedHAMTContainer.GetLink()
if err != nil {
return err
}
hamtContainer.Set(nestedHAMTContainer.Key(), link)
}
return nil
}
log.Printf("leaf node %s %p level %d parent %p\n", hamtContainer.Key(), treeNode, treeNode.Level, treeNode.Parent)
return nil
}