This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: PATCH: TR1 unordered associative containers
- From: Matt Austern <austern at apple dot com>
- To: "R. D. Flowers" <chatta at chatta dot us>
- Cc: libstdc++ <libstdc++ at gcc dot gnu dot org>
- Date: Fri, 18 Feb 2005 10:19:12 -0800
- Subject: Re: PATCH: TR1 unordered associative containers
- References: <1108684087.10228.ezmlm@gcc.gnu.org> <42162CBB.9000408@chatta.us> <2E538846-81D9-11D9-A493-000A95AA5E5E@apple.com>
On Feb 18, 2005, at 10:16 AM, Matt Austern wrote:
On Feb 18, 2005, at 9:58 AM, R. D. Flowers wrote:
If this is supposed to be a list of SOME primes, no problem.
If it is supposed to be a list of ALL primes up to that size, YES a
problem.
It is supposed to be a list of some primes less than 2^32. A list of
all primes up to that size would be too large to be useful; the prime
number theorem says that the list would have something like 190
million entries.
But I suppose I should also mention: I didn't just choose these
particular primes randomly. If you look at the list you'll see that
the ratios of successive entries are roughly constant. Very roughly
for smaller primes, but it gets much nicer as the numbers get larger.
--Matt