roysc/plugeth
1
0
Fork 0
forked from cerc-io/plugeth
Code Pull Requests Activity

bmt: fix comment typos (#16461)

Browse Source
This commit is contained in:
DoubleWoodH 2018-04-09 18:38:01 +08:00 committed by Felix Lange
parent 3ebcf92b42
commit 8de655ef3a
1 changed files with 4 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
bmt/bmt.go
View File

@ -75,7 +75,7 @@ type Hasher struct {
blocksize int // segment size (size of hash) also for hash.Hash blocksize int // segment size (size of hash) also for hash.Hash
count int // segment count count int // segment count
size int // for hash.Hash same as hashsize size int // for hash.Hash same as hashsize
cur int // cursor position for righmost currently open chunk cur int // cursor position for rightmost currently open chunk
segment []byte // the rightmost open segment (not complete) segment []byte // the rightmost open segment (not complete)
depth int // index of last level depth int // index of last level
result chan []byte // result channel result chan []byte // result channel
@ -149,7 +149,7 @@ func NewTreePool(hasher BaseHasher, segmentCount, capacity int) *TreePool {
} }
} }
// Drain drains the pool uptil it has no more than n resources // Drain drains the pool until it has no more than n resources
func (self *TreePool) Drain(n int) { func (self *TreePool) Drain(n int) {
self.lock.Lock() self.lock.Lock()
defer self.lock.Unlock() defer self.lock.Unlock()
@ -412,11 +412,10 @@ func (self *Hasher) Reset() {
// ResetWithLength needs to be called before writing to the hasher // ResetWithLength needs to be called before writing to the hasher
// the argument is supposed to be the byte slice binary representation of // the argument is supposed to be the byte slice binary representation of
// the legth of the data subsumed under the hash // the length of the data subsumed under the hash
func (self *Hasher) ResetWithLength(l []byte) { func (self *Hasher) ResetWithLength(l []byte) {
self.Reset() self.Reset()
self.blockLength = l self.blockLength = l
} }
// Release gives back the Tree to the pool whereby it unlocks // Release gives back the Tree to the pool whereby it unlocks
@ -531,7 +530,7 @@ func (self *Hasher) finalise(n *Node, i int) (d int) {
for { for {
// when the final segment's path is going via left segments // when the final segment's path is going via left segments
// the incoming data is pushed to the parent upon pulling the left // the incoming data is pushed to the parent upon pulling the left
// we do not need toogle the state since this condition is // we do not need toggle the state since this condition is
// detectable // detectable
n.unbalanced = isLeft n.unbalanced = isLeft
n.right = nil n.right = nil