spelling: minimize

diff --git a/doc/design/resolver/01-scaling-across-cores b/doc/design/resolver/01-scaling-across-cores
index dbd962f4c71dfe40b75601b77699f2e580d88d6f..56b8dcf605e1adb2d6bc48a2d7f7880daa04b237 100644 (file)
--- a/doc/design/resolver/01-scaling-across-cores
+++ b/doc/design/resolver/01-scaling-across-cores
@@ -66,9 +66,9 @@ Legend
 Goals
 -----
  * 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.
- * 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
    the authoritative servers).
  * Design simple enough so it can be implemented.

diff --git a/src/bin/sockcreator/README b/src/bin/sockcreator/README
index cc9f3bc9ecf5def40cd936120ae7c026e2a024b7..122cc412e2449d9db98f155b466e5af992d8e77e 100644 (file)
--- a/src/bin/sockcreator/README
+++ b/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.
 
 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
 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

diff --git a/src/lib/asiodns/io_fetch.cc b/src/lib/asiodns/io_fetch.cc
index ecedd17e0a4d7a3e135a495ad8b67979b7bd9943..fcc8d52bce419d31b9dad0467c35bf1403598cf0 100644 (file)
--- a/src/lib/asiodns/io_fetch.cc
+++ b/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
             // 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.
-            // And we want to minimise the amount of copying...
+            // And we want to minimize the amount of copying...
     
             data_->origin = ASIODNS_READ_DATA;
             data_->cumulative = 0;          // No data yet received