Skip to content
This repository was archived by the owner on Oct 11, 2024. It is now read-only.

Commit e010218

Browse files
committed
Fixups
1 parent 0fbaafa commit e010218

File tree

2 files changed

+7
-7
lines changed

2 files changed

+7
-7
lines changed

core/client/kt/verify_test.go

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -46,7 +46,7 @@ func TestVerifyCommitment(t *testing.T) {
4646
fakeEntryData := validEntryData[:len(validEntryData)-1]
4747

4848
// Create a dummy client verifier.
49-
verifier := New(nil, nil, nil, nil)
49+
verifier := New(0, nil, nil, nil, nil)
5050
for _, tc := range []struct {
5151
userID, appID string
5252
entryData []byte

core/tree/sparse/common_test.go

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -22,15 +22,15 @@ import (
2222

2323
func TestComputeNodeValues(t *testing.T) {
2424
for _, tc := range []struct {
25-
bindex string
26-
leafHash []byte
27-
neighbors []Hash
28-
expected []string
25+
bindex string
26+
leafHash []byte
27+
neighbors []Hash
28+
expectedLen int
2929
}{
30-
{"0100", []byte(""), make([]Hash, 4), []string{"0100", "010", "01", "0", ""}},
30+
{"000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", []byte(""), make([]Hash, 256), 256},
3131
} {
3232
actual := NodeValues(0, coniks.Default, tc.bindex, tc.leafHash, tc.neighbors)
33-
if got, want := len(actual), len(tc.expected); got != want {
33+
if got, want := len(actual), tc.expectedLen; got != want {
3434
t.Errorf("len(%v)=%v, want %v", actual, got, want)
3535
}
3636
}

0 commit comments

Comments
 (0)