Function TestMerkleTree

lib/util_test.go:103–191

(t *testing.T)

}

func TestMerkleTree(t *testing.T) {
	tests := []struct {
		name         string
		detail       string
		items        [][]byte
		expectedRoot []byte
		expectedTree [][]byte
	}{
		{
			name:         "empty input",
			detail:       "there are no items",
			items:        nil,
			expectedRoot: []byte{},
			expectedTree: [][]byte{},
		},
		{
			name:         "one item",
			detail:       "there's one entry in the tree",
			items:        [][]byte{[]byte("a")},
			expectedRoot: crypto.Hash([]byte("a")),
			expectedTree: [][]byte{
				crypto.Hash([]byte("a")),
			},
		},
		{
			name:   "multi-item",
			detail: "there are multiple items added",
			items: [][]byte{
				[]byte("a"),
				[]byte("b"),
				[]byte("c"),
				[]byte("d"),
			},
			expectedTree: [][]byte{
				crypto.Hash([]byte("a")),
				crypto.Hash([]byte("b")),
				crypto.Hash([]byte("c")),
				crypto.Hash([]byte("d")),
				crypto.Hash(append(crypto.Hash([]byte("a")), crypto.Hash([]byte("b"))...)),
				crypto.Hash(append(crypto.Hash([]byte("c")), crypto.Hash([]byte("d"))...)),
				crypto.Hash(append(
					crypto.Hash(append(crypto.Hash([]byte("a")), crypto.Hash([]byte("b"))...)),
					crypto.Hash(append(crypto.Hash([]byte("c")), crypto.Hash([]byte("d"))...))...,
				)),
			},
			expectedRoot: crypto.Hash(
				append(
					crypto.Hash(append(crypto.Hash([]byte("a")), crypto.Hash([]byte("b"))...)),
					crypto.Hash(append(crypto.Hash([]byte("c")), crypto.Hash([]byte("d"))...))...,
				),
			),
		},
		{
			name:   "'non power of two' multi-item",
			detail: "there are multiple items, but not enough for a perfect po2 tree",
			items: [][]byte{
				[]byte("a"),
				[]byte("b"),