diff options
| author | ferhat elmas <elmas.ferhat@gmail.com> | 2017-10-30 08:23:23 +0800 |
|---|---|---|
| committer | ferhat elmas <elmas.ferhat@gmail.com> | 2017-10-30 08:23:23 +0800 |
| commit | 07e8c177e7f1cceadc70709946aa24777b4bf2af (patch) | |
| tree | 2cee788573cf551cb432c387f6be9412744ad853 /swarm/storage | |
| parent | 8d434f6a6f18c5172db9a8216d61cd50b746c964 (diff) | |
| download | dexon-07e8c177e7f1cceadc70709946aa24777b4bf2af.tar.gz dexon-07e8c177e7f1cceadc70709946aa24777b4bf2af.tar.zst dexon-07e8c177e7f1cceadc70709946aa24777b4bf2af.zip | |
core, swarm: typo fixes
Diffstat (limited to 'swarm/storage')
| -rw-r--r-- | swarm/storage/pyramid.go | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/swarm/storage/pyramid.go b/swarm/storage/pyramid.go index e3be2a987..631ab52b8 100644 --- a/swarm/storage/pyramid.go +++ b/swarm/storage/pyramid.go @@ -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 |