diff options
| author | Dimitry Andric <dim@FreeBSD.org> | 2015-01-07 21:08:01 +0000 |
|---|---|---|
| committer | Dimitry Andric <dim@FreeBSD.org> | 2015-01-07 21:08:01 +0000 |
| commit | f857581820d15e410e9945d2fcd5f7163be25a96 (patch) | |
| tree | 41f38760e19d47a9e21d0f64ece2bddaaab8aaf7 /src/hash.cpp | |
| parent | a5b2dbc259e289ea23fe9aebb34eba2c1dc7fefb (diff) | |
| download | src-f857581820d15e410e9945d2fcd5f7163be25a96.tar.gz src-f857581820d15e410e9945d2fcd5f7163be25a96.zip | |
Vendor import of libc++ trunk r224926:vendor/libc++/r224926
Notes
Notes:
svn path=/vendor/libc++/dist/; revision=276792
svn path=/vendor/libc++/r224926/; revision=276793; tag=vendor/libc++/r224926
Diffstat (limited to 'src/hash.cpp')
| -rw-r--r-- | src/hash.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/hash.cpp b/src/hash.cpp index 388ab2ebe175..dc90f789c6b8 100644 --- a/src/hash.cpp +++ b/src/hash.cpp @@ -136,7 +136,7 @@ const unsigned indices[] = // The algorithm creates a list of small primes, plus an open-ended list of // potential primes. All prime numbers are potential prime numbers. However // some potential prime numbers are not prime. In an ideal world, all potential -// prime numbers would be prime. Candiate prime numbers are chosen as the next +// prime numbers would be prime. Candidate prime numbers are chosen as the next // highest potential prime. Then this number is tested for prime by dividing it // by all potential prime numbers less than the sqrt of the candidate. // |