swarm: fixed comment typo

This commit is contained in:
hackyminer 2018-08-18 07:44:43 +09:00
parent 5918b88a8f
commit c5886a0966
No known key found for this signature in database
GPG key ID: 46D453DDCA4B766F
3 changed files with 4 additions and 4 deletions

View file

@ -112,7 +112,7 @@ type Result struct {
} }
// Run calls the RunFunc function while taking care of // Run calls the RunFunc function while taking care of
// cancelation provided through the Context. // cancellation provided through the Context.
func (s *Simulation) Run(ctx context.Context, f RunFunc) (r Result) { func (s *Simulation) Run(ctx context.Context, f RunFunc) (r Result) {
//if the option is set to run a HTTP server with the simulation, //if the option is set to run a HTTP server with the simulation,
//init the server and start it //init the server and start it

View file

@ -132,7 +132,7 @@ func (p *Peer) SendOfferedHashes(s *server, f, t uint64) error {
if err != nil { if err != nil {
return err return err
} }
// true only when quiting // true only when quitting
if len(hashes) == 0 { if len(hashes) == 0 {
return nil return nil
} }

View file

@ -27,11 +27,11 @@ OR distance over finite set of integers).
Methods take a comparison operator (pof, proximity order function) to compare two Methods take a comparison operator (pof, proximity order function) to compare two
value types. The default pof assumes Val to be or project to a byte slice using value types. The default pof assumes Val to be or project to a byte slice using
the reverse rank on the MSB first XOR logarithmic disctance. the reverse rank on the MSB first XOR logarithmic distance.
If the address space if limited, equality is defined as the maximum proximity order. If the address space if limited, equality is defined as the maximum proximity order.
The container offers applicative (funcional) style methods on PO trees: The container offers applicative (functional) style methods on PO trees:
* adding/removing en element * adding/removing en element
* swap (value based add/remove) * swap (value based add/remove)
* merging two PO trees (union) * merging two PO trees (union)