|
|
@@ -27,7 +27,7 @@ import (
|
|
|
/*
|
|
|
The main idea of a pyramid chunker is to process the input data without knowing the entire size apriori.
|
|
|
For this to be achieved, the chunker tree is built from the ground up until the data is exhausted.
|
|
|
- This opens up new aveneus such as easy append and other sort of modifications to the tree therby avoiding
|
|
|
+ This opens up new aveneus such as easy append and other sort of modifications to the tree thereby avoiding
|
|
|
duplication of data chunks.
|
|
|
|
|
|
|
|
|
@@ -451,7 +451,7 @@ func (self *PyramidChunker) prepareChunks(isAppend bool, chunkLevel [][]*TreeEnt
|
|
|
}
|
|
|
}
|
|
|
|
|
|
- // Data ended in chunk boundry.. just signal to start bulding tree
|
|
|
+ // Data ended in chunk boundary.. just signal to start bulding tree
|
|
|
if n == 0 {
|
|
|
self.buildTree(isAppend, chunkLevel, parent, chunkWG, jobC, quitC, true, rootKey)
|
|
|
break
|