[Python-checkins] peps: Fix typos

[christian.heimes]

http://hg.python.org/peps/rev/3269132cacf3
changeset:   5166:3269132cacf3
parent:      5161:cc863d6be5b2
user:        Christian Heimes <christian at cheimes.de>
date:        Thu Oct 03 22:07:30 2013 +0200
summary:
  Fix typos
unify use of hyphens in '32-bit', '64-bit' and '128-bit

files:
  pep-0456.txt |  26 +++++++++++++-------------
  1 files changed, 13 insertions(+), 13 deletions(-)


diff --git a/pep-0456.txt b/pep-0456.txt
--- a/pep-0456.txt
+++ b/pep-0456.txt
@@ -93,7 +93,7 @@
 CPython currently uses uses a variant of the Fowler-Noll-Vo hash function
 [fnv]_. The variant is has been modified to reduce the amount and cost of hash
 collisions for common strings. The first character of the string is added
-twice, the first time time with a bit shift of 7. The length of the input
+twice, the first time with a bit shift of 7. The length of the input
 string is XOR-ed to the final value. Both deviations from the original FNV
 algorithm reduce the amount of hash collisions for short strings.
 
@@ -162,8 +162,8 @@
 SipHash
 -------
 
-SipHash [sip]_ is a cryptographic pseudo random function with a 128bit seed and
-64-bit output. It was designed by Jean-Philippe Aumasson and Daniel J.
+SipHash [sip]_ is a cryptographic pseudo random function with a 128-bit seed
+and 64-bit output. It was designed by Jean-Philippe Aumasson and Daniel J.
 Bernstein as a fast and secure keyed hash algorithm. It's used by Ruby, Perl,
 OpenDNS, Rust, Redis, FreeBSD and more. The C reference implementation has
 been released under CC0 license (public domain).
@@ -197,7 +197,7 @@
 MurmurHash [murmur]_ is a family of non-cryptographic keyed hash function
 developed by Austin Appleby. Murmur3 is the latest and fast variant of
 MurmurHash. The C++ reference implementation has been released into public
-domain. It features 32 or 128bit output with a 32-bit seed. (Note: The out
+domain. It features 32- or 128-bit output with a 32-bit seed. (Note: The out
 parameter is a buffer with either 1 or 4 bytes.)
 
 Murmur3's function prototypes are::
@@ -217,7 +217,7 @@
                              uint32_t seed,
                              void *out);
 
-The 128bit variants requires a 64-bit data type and are not compatible with
+The 128-bit variants requires a 64-bit data type and are not compatible with
 pure C89 platforms. The 32-bit variant is fully C89-compatible.
 
 Aumasson, Bernstein and Boßlet have shown [sip]_ [ocert-2012-001]_ that
@@ -231,10 +231,10 @@
 CityHash [city]_ is a family of non-cryptographic hash function developed by
 Geoff Pike and Jyrki Alakuijala for Google. The C++ reference implementation
 has been released under MIT license. The algorithm is partly based on
-MurmurHash and claims to be faster. It supports 64 and 128 bit output with a
-128bit seed as well as 32-bit output without seed.
+MurmurHash and claims to be faster. It supports 64- and 128-bit output with a
+128-bit seed as well as 32-bit output without seed.
 
-The relevant function prototype for 64-bit CityHash with 128bit seed is::
+The relevant function prototype for 64-bit CityHash with 128-bit seed is::
 
     uint64 CityHash64WithSeeds(const char *buf,
                                size_t len,
@@ -274,14 +274,14 @@
 C API additions
 ===============
 
-All C API extension modifications are no part of the stable API.
+All C API extension modifications are not part of the stable API.
 
 hash secret
 -----------
 
 The ``_Py_HashSecret_t`` type of Python 2.6 to 3.3 has two members with either
-32 or 64-bit length each. SipHash requires two 64-bit unsigned integers as keys.
-The typedef will be changed to an union with a guaranteed size of 128bits on
+32- or 64-bit length each. SipHash requires two 64-bit unsigned integers as keys.
+The typedef will be changed to an union with a guaranteed size of 128 bits on
 all architectures. On platforms with a 64-bit data type it will have two
 ``uint64`` members. Because C89 compatible compilers may not have ``uint64``
 the union also has an array of 16 chars.
@@ -503,7 +503,7 @@
 of common keys in dicts of Python classes.
 
 Serhiy Storchaka has shown in [issue16427]_ that a modified FNV
-implementation with 64-bits per cycle is able to process long strings several
+implementation with 64 bits per cycle is able to process long strings several
 times faster than the current FNV implementation.
 
 
@@ -514,7 +514,7 @@
 Benchmark Suite have shown minimal deviations. The summarized total runtime
 of the benchmark is within 1% of the runtime of an unmodified Python 3.4
 binary. The tests were run on an Intel i7-2860QM machine with a 64-bit Linux
-installation. The interpreter was compiled with GCC 4.7 for 64 and 32-bit.
+installation. The interpreter was compiled with GCC 4.7 for 64- and 32-bit.
 
 More benchmarks will be conducted.
 

-- 
Repository URL: http://hg.python.org/peps