On 03/30/2011 03:31 PM, Steven Schveighoffer wrote:
On Tue, 29 Mar 2011 22:20:05 -0400, Nick Sabalausky wrote:
"spir" wrote in message
news:mailman.2909.1301443345.4748.digitalmars-d-le...@puremagic.com...
On 03/30/2011 01:24 AM, Nick Sabalausky wrote:
My understanding of hash tables is tha
On Tue, 29 Mar 2011 22:20:05 -0400, Nick Sabalausky wrote:
"spir" wrote in message
news:mailman.2909.1301443345.4748.digitalmars-d-le...@puremagic.com...
On 03/30/2011 01:24 AM, Nick Sabalausky wrote:
My understanding of hash tables is that they allocate a fixed size
array
and
map keys to
"spir" wrote in message
news:mailman.2909.1301443345.4748.digitalmars-d-le...@puremagic.com...
> On 03/30/2011 01:24 AM, Nick Sabalausky wrote:
>> My understanding of hash tables is that they allocate a fixed size array
>> and
>> map keys to indicies within the range 0..predefined_length_of_the_
On 03/30/2011 01:24 AM, Nick Sabalausky wrote:
My understanding of hash tables is that they allocate a fixed size array and
map keys to indicies within the range 0..predefined_length_of_the_AA.
So I've been wondering, how many elements do D's built-in AAs have? And
what's the content of each one
My understanding of hash tables is that they allocate a fixed size array and
map keys to indicies within the range 0..predefined_length_of_the_AA.
So I've been wondering, how many elements do D's built-in AAs have? And
what's the content of each one, just a single pointer?
