diff options
| author | Alp Toker <alp@nuanti.com> | 2014-05-15 11:27:39 +0000 |
|---|---|---|
| committer | Alp Toker <alp@nuanti.com> | 2014-05-15 11:27:39 +0000 |
| commit | f03763a44b2f6ab50afa745e8bbae9e3f11d104e (patch) | |
| tree | 89c4ee3d8a2ecdb27fff2e50c17623dd22efbcf2 /libcxx/src/hash.cpp | |
| parent | 0f9355b3b0d89d164c5dfbca8cc2fc7bd6a75648 (diff) | |
| download | bcm5719-llvm-f03763a44b2f6ab50afa745e8bbae9e3f11d104e.tar.gz bcm5719-llvm-f03763a44b2f6ab50afa745e8bbae9e3f11d104e.zip | |
Fix typos
llvm-svn: 208869
Diffstat (limited to 'libcxx/src/hash.cpp')
| -rw-r--r-- | libcxx/src/hash.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/libcxx/src/hash.cpp b/libcxx/src/hash.cpp index 388ab2ebe17..dc90f789c6b 100644 --- a/libcxx/src/hash.cpp +++ b/libcxx/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. // |
