06-Nov-2013 00:36, Charles Hixson пишет:
On 11/05/2013 05:34 AM, Dmitry Olshansky wrote:
05-Nov-2013 02:20, Charles Hixson пишет:
On 11/03/2013 01:46 AM, Dmitry Olshansky wrote:
03-Nov-2013 02:37, Charles Hixson пишет:
I'm contemplating an associative array that will eventually grow to be
an
On 11/05/2013 05:34 AM, Dmitry Olshansky wrote:
05-Nov-2013 02:20, Charles Hixson пишет:
On 11/03/2013 01:46 AM, Dmitry Olshansky wrote:
03-Nov-2013 02:37, Charles Hixson пишет:
I'm contemplating an associative array that will eventually grow to be
an estimated 64KB in size, assuming it's
On 11/03/2013 01:46 AM, Dmitry Olshansky wrote:
03-Nov-2013 02:37, Charles Hixson пишет:
I'm contemplating an associative array that will eventually grow to be
an estimated 64KB in size, assuming it's about half full. It would then
be holding around 90,000 entries. Is this reasonable, or
On 11/04/2013 04:22 PM, Froglegs wrote:
why are you obsessing over a 64k hash table... that is tiny..
Probably because I'm an old fogey, and to me 64KB sounds like all the
RAM a computer is likely to have.
--
Charles Hixson
03-Nov-2013 02:37, Charles Hixson пишет:
I'm contemplating an associative array that will eventually grow to be
an estimated 64KB in size, assuming it's about half full. It would then
be holding around 90,000 entries. Is this reasonable, or should I go
with a sorted array, and do binary
I'm contemplating an associative array that will eventually grow to be
an estimated 64KB in size, assuming it's about half full. It would then
be holding around 90,000 entries. Is this reasonable, or should I go
with a sorted array, and do binary searches? I estimate that binary
searches
What are you going to be using the collection for?
On 11/02/2013 04:49 PM, TheFlyingFiddle wrote:
What are you going to be using the collection for?
It's basically a lookup table used for translating external codes
(essentially arbitrary) into id#s used internally. There are LOTS of
id#s that don't correspond to ANY external code, and
On Saturday, 2 November 2013 at 23:58:07 UTC, Charles Hixson
wrote:
On 11/02/2013 04:49 PM, TheFlyingFiddle wrote:
What are you going to be using the collection for?
It's basically a lookup table used for translating external
codes (essentially arbitrary) into id#s used internally. There
On 11/02/2013 05:16 PM, TheFlyingFiddle wrote:
On Saturday, 2 November 2013 at 23:58:07 UTC, Charles Hixson wrote:
On 11/02/2013 04:49 PM, TheFlyingFiddle wrote:
What are you going to be using the collection for?
It's basically a lookup table used for translating external codes
(essentially
If AAs don't have any hidden penalty, like causing the garbage
collector to thrash, then that's the way to go
Any time you insert an item into an AA it might allocate. So it
might cause a garbage collection cycle. I'm unsure what you mean
by causing the garbage collector to trash memory
11 matches
Mail list logo
