This repository has been archived by the owner on Jan 17, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 6
/
common_test.go
126 lines (120 loc) · 2.82 KB
/
common_test.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
package dagpb_test
import (
"bytes"
ipld "github.com/ipld/go-ipld-prime"
dagpb "github.com/ipld/go-ipld-prime-proto"
"github.com/jbenet/go-random"
)
var seedSeq int64
func randomBytes(n int64) []byte {
data := new(bytes.Buffer)
random.WritePseudoRandomBytes(n, data, seedSeq)
seedSeq++
return data.Bytes()
}
func makeRawNode(randBytes []byte) (ipld.Node, error) {
raw_nb := dagpb.Type.RawNode.NewBuilder()
err := raw_nb.AssignBytes(randBytes)
if err != nil {
return nil, err
}
return raw_nb.Build(), nil
}
/*
func makeProtoNode(linkedNodes map[string]ipld.Node) (ipld.Node, error) {
dag_ns := dagpb.PBNode__NodeBuilder()
dagpb_mb, err := dagpb_nb.CreateMap()
if err != nil {
return nil, err
}
linksKey, err := dagpb_mb.BuilderForKeys().CreateString("Links")
if err != nil {
return nil, err
}
daglinks_nb := dagpb_mb.BuilderForValue("Links")
daglinks_lb, err := daglinks_nb.CreateList()
if err != nil {
return nil, err
}
i := 0
for name, node := range linkedNodes {
daglink_nb := daglinks_lb.BuilderForValue(i)
daglink_mb, err := daglink_nb.CreateMap()
if err != nil {
return nil, err
}
hashKey, err := daglink_mb.BuilderForKeys().CreateString("Hash")
if err != nil {
return nil, err
}
nameKey, err := daglink_mb.BuilderForKeys().CreateString("Name")
if err != nil {
return nil, err
}
tsizeKey, err := daglink_mb.BuilderForKeys().CreateString("Tsize")
if err != nil {
return nil, err
}
nodeBytes, err := node.AsBytes()
if err != nil {
return nil, err
}
blk := blocks.NewBlock(nodeBytes)
hashNode, err := daglink_mb.BuilderForValue("Hash").CreateLink(cidlink.Link{Cid: blk.Cid()})
if err != nil {
return nil, err
}
err = daglink_mb.Insert(hashKey, hashNode)
if err != nil {
return nil, err
}
tsizeNode, err := daglink_mb.BuilderForValue("Tsize").CreateInt(len(nodeBytes))
if err != nil {
return nil, err
}
err = daglink_mb.Insert(tsizeKey, tsizeNode)
if err != nil {
return nil, err
}
nameNode, err := daglink_mb.BuilderForValue("Name").CreateString(name)
if err != nil {
return nil, err
}
err = daglink_mb.Insert(nameKey, nameNode)
if err != nil {
return nil, err
}
linkNode, err := daglink_mb.Build()
if err != nil {
return nil, err
}
err = daglinks_lb.Append(linkNode)
if err != nil {
return nil, err
}
i++
}
linksNode, err := daglinks_lb.Build()
if err != nil {
return nil, err
}
err = dagpb_mb.Insert(linksKey, linksNode)
if err != nil {
return nil, err
}
dataKey, err := dagpb_mb.BuilderForKeys().CreateString("Data")
if err != nil {
return nil, err
}
randBytes := randomBytes(1000)
dataNode, err := dagpb_mb.BuilderForValue("Data").CreateBytes(randBytes)
if err != nil {
return nil, err
}
err = dagpb_mb.Insert(dataKey, dataNode)
if err != nil {
return nil, err
}
return dagpb_mb.Build()
}
*/