Browse Source

spelling: minimize

Josh Soref 7 years ago
parent
commit
1e8fc76813

+ 2 - 2
doc/design/resolver/01-scaling-across-cores

@@ -66,9 +66,9 @@ Legend
 Goals
 Goals
 -----
 -----
  * Run the CPU intensive tasks in multiple threads to allow concurrency.
  * Run the CPU intensive tasks in multiple threads to allow concurrency.
- * Minimise waiting for locks.
+ * Minimize waiting for locks.
  * Don't require too much memory.
  * Don't require too much memory.
- * Minimise the number of upstream queries (both because they are slow and
+ * Minimize the number of upstream queries (both because they are slow and
    expensive and also because we don't want to eat too much bandwidth and spam
    expensive and also because we don't want to eat too much bandwidth and spam
    the authoritative servers).
    the authoritative servers).
  * Design simple enough so it can be implemented.
  * Design simple enough so it can be implemented.

+ 1 - 1
src/bin/sockcreator/README

@@ -11,7 +11,7 @@ ports lower than 1024. So we will have a separate process that keeps the
 rights, while the rest drops them for security reasons.
 rights, while the rest drops them for security reasons.
 
 
 This process is the socket creator. Its goal is to be as simple as possible
 This process is the socket creator. Its goal is to be as simple as possible
-and to contain as little code as possible to minimise the amount of code
+and to contain as little code as possible to minimize the amount of code
 running with higher privileges (to minimize the number of bugs and make
 running with higher privileges (to minimize the number of bugs and make
 checking/auditing it easier). It uses low-level OS API instead of some
 checking/auditing it easier). It uses low-level OS API instead of some
 fancy library for that reason. It has only fixed-length reads so there's no
 fancy library for that reason. It has only fixed-length reads so there's no

+ 1 - 1
src/lib/asiodns/io_fetch.cc

@@ -297,7 +297,7 @@ IOFetch::operator()(boost::system::error_code ec, size_t length) {
             // So... we need to loop until we have at least two bytes, then store
             // So... we need to loop until we have at least two bytes, then store
             // the expected amount of data.  Then we need to loop until we have
             // the expected amount of data.  Then we need to loop until we have
             // received all the data before copying it back to the user's buffer.
             // received all the data before copying it back to the user's buffer.
-            // And we want to minimise the amount of copying...
+            // And we want to minimize the amount of copying...
     
     
             data_->origin = ASIODNS_READ_DATA;
             data_->origin = ASIODNS_READ_DATA;
             data_->cumulative = 0;          // No data yet received
             data_->cumulative = 0;          // No data yet received