arnaucube/arbo
1
1
Fork 0
mirror of https://github.com/arnaucube/arbo.git synced 2026-01-08 15:01:29 +01:00
Code Issues Projects Releases Wiki Activity

Replace naive AddBatch by optimized AddBatch

Browse Source 
- Replace naive AddBatch by optimized AddBatch
- Add blake2b hash support
- Expose needed methods for external usage (ReadLeafValue,
ReadIntermediateChilds)
- Return 'value' in GenProof
This commit is contained in:
arnaucube
2021-05-08 15:24:08 +02:00
parent 0eda440d93
commit 6dcbbdf4a5
9 changed files with 99 additions and 68 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
addbatch_test.go
View File

@@ -75,7 +75,7 @@ func TestAddBatchCaseA(t *testing.T) {
values = append(values, v)
}
start = time.Now()
indexes, err := tree2.AddBatchOpt(keys, values)
indexes, err := tree2.AddBatch(keys, values)
c.Assert(err, qt.IsNil)
time2 := time.Since(start)
debugTime("CASE A, AddBatch", time1, time2)
@@ -113,7 +113,7 @@ func TestAddBatchCaseANotPowerOf2(t *testing.T) {
keys = append(keys, k)
values = append(values, v)
}
indexes, err := tree2.AddBatchOpt(keys, values)
indexes, err := tree2.AddBatch(keys, values)
c.Assert(err, qt.IsNil)
c.Check(len(indexes), qt.Equals, 0)
@@ -148,7 +148,7 @@ func TestAddBatchCaseB(t *testing.T) {
values = append(values, v)
}
start = time.Now()
indexes, err := tree2.AddBatchOpt(keys, values)
indexes, err := tree2.AddBatch(keys, values)
c.Assert(err, qt.IsNil)
time2 := time.Since(start)
debugTime("CASE B, AddBatch", time1, time2)
@@ -182,7 +182,7 @@ func TestAddBatchCaseBRepeatedLeafs(t *testing.T) {
keys = append(keys, k)
values = append(values, v)
}
indexes, err := tree2.AddBatchOpt(keys, values)
indexes, err := tree2.AddBatch(keys, values)
c.Assert(err, qt.IsNil)
c.Check(len(indexes), qt.Equals, initialNLeafs)
@@ -368,7 +368,7 @@ func TestAddBatchCaseC(t *testing.T) {
values = append(values, v)
}
start = time.Now()
indexes, err := tree2.AddBatchOpt(keys, values)
indexes, err := tree2.AddBatch(keys, values)
c.Assert(err, qt.IsNil)
time2 := time.Since(start)
debugTime("CASE C, AddBatch", time1, time2)
@@ -405,7 +405,7 @@ func TestAddBatchCaseD(t *testing.T) {
values = append(values, v)
}
start = time.Now()
indexes, err := tree2.AddBatchOpt(keys, values)
indexes, err := tree2.AddBatch(keys, values)
c.Assert(err, qt.IsNil)
time2 := time.Since(start)
debugTime("CASE D, AddBatch", time1, time2)
@@ -462,7 +462,7 @@ func TestAddBatchCaseE(t *testing.T) {
values = append(values, v)
}
start = time.Now()
indexes, err := tree2.AddBatchOpt(keys, values)
indexes, err := tree2.AddBatch(keys, values)
c.Assert(err, qt.IsNil)
time2 := time.Since(start)
debugTime("CASE E, AddBatch", time1, time2)