aboutsummaryrefslogtreecommitdiffstats
path: root/swarm
diff options
context:
space:
mode:
authorWenbiao Zheng <delweng@gmail.com>2018-08-27 16:49:29 +0800
committerPéter Szilágyi <peterke@gmail.com>2018-08-27 16:49:29 +0800
commitd1aa605f1e8639769cdd75bcec3064c29a62b34a (patch)
tree84d7aba82d7365ca736afa52b66ef100d117afca /swarm
parent70398d300d4da97c89f96f5c9629caa327de5c39 (diff)
downloaddexon-d1aa605f1e8639769cdd75bcec3064c29a62b34a.tar.gz
dexon-d1aa605f1e8639769cdd75bcec3064c29a62b34a.tar.zst
dexon-d1aa605f1e8639769cdd75bcec3064c29a62b34a.zip
all: remove the duplicate 'the' in annotations (#17509)
Diffstat (limited to 'swarm')
-rw-r--r--swarm/api/api.go2
-rw-r--r--swarm/network/README.md2
-rw-r--r--swarm/network/stream/intervals/intervals.go2
-rw-r--r--swarm/network/stream/snapshot_sync_test.go2
4 files changed, 4 insertions, 4 deletions
diff --git a/swarm/api/api.go b/swarm/api/api.go
index adf469cfa..0d08eeea8 100644
--- a/swarm/api/api.go
+++ b/swarm/api/api.go
@@ -153,7 +153,7 @@ func NewMultiResolver(opts ...MultiResolverOption) (m *MultiResolver) {
// Resolve resolves address by choosing a Resolver by TLD.
// If there are more default Resolvers, or for a specific TLD,
-// the Hash from the the first one which does not return error
+// the Hash from the first one which does not return error
// will be returned.
func (m *MultiResolver) Resolve(addr string) (h common.Hash, err error) {
rs, err := m.getResolveValidator(addr)
diff --git a/swarm/network/README.md b/swarm/network/README.md
index ad429b38b..e9c9d30d0 100644
--- a/swarm/network/README.md
+++ b/swarm/network/README.md
@@ -133,7 +133,7 @@ As part of the deletion protocol then, hashes of insured chunks to be removed ar
Downstream peer on the other hand needs to make sure that they can only be finger pointed about a chunk they did receive and store.
For this the check of a state should be exhaustive. If historical syncing finishes on one state, all hashes before are covered, no
surprises. In other words historical syncing this process is self verifying. With session syncing however, it is not enough to check going back covering the range from old offset to new. Continuity (i.e., that the new state is extension of the old) needs to be verified: after downstream peer reads the range into a buffer, it appends the buffer the last known state at the last known offset and verifies the resulting hash matches
-the latest state. Past intervals of historical syncing are checked via the the session root.
+the latest state. Past intervals of historical syncing are checked via the session root.
Upstream peer signs the states, downstream peers can use as handover proofs.
Downstream peers sign off on a state together with an initial offset.
diff --git a/swarm/network/stream/intervals/intervals.go b/swarm/network/stream/intervals/intervals.go
index 5fd820da8..562c3df9a 100644
--- a/swarm/network/stream/intervals/intervals.go
+++ b/swarm/network/stream/intervals/intervals.go
@@ -101,7 +101,7 @@ func (i *Intervals) add(start, end uint64) {
}
}
-// Merge adds all the intervals from the the m Interval to current one.
+// Merge adds all the intervals from the m Interval to current one.
func (i *Intervals) Merge(m *Intervals) {
m.mu.RLock()
defer m.mu.RUnlock()
diff --git a/swarm/network/stream/snapshot_sync_test.go b/swarm/network/stream/snapshot_sync_test.go
index 6acab50af..4e1ab09fc 100644
--- a/swarm/network/stream/snapshot_sync_test.go
+++ b/swarm/network/stream/snapshot_sync_test.go
@@ -182,7 +182,7 @@ func testSyncingViaGlobalSync(t *testing.T, chunkCount int, nodeCount int) {
conf.addrToIDMap[string(a)] = n
}
- //get the the node at that index
+ //get the node at that index
//this is the node selected for upload
node := sim.RandomUpNode()
item, ok := sim.NodeItem(node.ID, bucketKeyStore)