-
Notifications
You must be signed in to change notification settings - Fork 0
/
content.go
52 lines (43 loc) · 1.47 KB
/
content.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
// Copyright 2021 The CortexTheseus Authors
// This file is part of the CortexTheseus library.
//
// The CortexTheseus library is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// The CortexTheseus library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the CortexTheseus library. If not, see <http://www.gnu.org/licenses/>.
// Package core implements the Cortex consensus protocol
package merkletree
type BlockContent struct {
x string
n uint64
hash []byte
}
func (t *BlockContent) cache() []byte {
return t.hash
}
func (t *BlockContent) CalculateHash() ([]byte, error) {
if cache := t.cache(); cache != nil {
return cache, nil
}
h := newHasher()
defer returnHasherToPool(h)
t.hash = h.sum([]byte(t.x))
return t.hash, nil
}
func (t *BlockContent) Equals(other Content) (bool, error) {
return t.x == other.(*BlockContent).x && t.n == other.(*BlockContent).n, nil
}
func NewContent(x string, n uint64) *BlockContent {
return &BlockContent{x: x, n: n}
}
func (t *BlockContent) N() uint64 {
return t.n
}