diff options
| author | Howard Hinnant <hhinnant@apple.com> | 2010-08-22 00:03:27 +0000 |
|---|---|---|
| committer | Howard Hinnant <hhinnant@apple.com> | 2010-08-22 00:03:27 +0000 |
| commit | 940e211c87ceb6e43bf7a2bfd5df9783ad75ae6c (patch) | |
| tree | 43c7c28a8644d312e1618bf0c2a7251f8fb9d2f6 /libcxx/src/hash.cpp | |
| parent | b3371f6f4909a1e2034c69011d0baa1a39b21d48 (diff) | |
| download | bcm5719-llvm-940e211c87ceb6e43bf7a2bfd5df9783ad75ae6c.tar.gz bcm5719-llvm-940e211c87ceb6e43bf7a2bfd5df9783ad75ae6c.zip | |
Fixing whitespace problems
llvm-svn: 111751
Diffstat (limited to 'libcxx/src/hash.cpp')
| -rw-r--r-- | libcxx/src/hash.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/libcxx/src/hash.cpp b/libcxx/src/hash.cpp index 707f5c59f6c..1189894f78b 100644 --- a/libcxx/src/hash.cpp +++ b/libcxx/src/hash.cpp @@ -126,14 +126,14 @@ const unsigned indices[] = // Returns: If n == 0, returns 0. Else returns the lowest prime number that // is greater than or equal to n. -// +// // 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 // 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. -// +// // This implementation defines potential primes as those numbers not divisible // by 2, 3, 5, and 7. Other (common) implementations define potential primes // as those not divisible by 2. A few other implementations define potential |
