At 9:48 PM +0100 4/17/02, Dave Mitchell wrote:
>On Wed, Apr 17, 2002 at 04:34:12PM -0400, Simon Glover wrote:
>>
>> On Wed, 17 Apr 2002, Brent Dax wrote:
>>
>> > Dan Sugalski:
>> > # Okay, here are the milestones. Each is worth a point release. If we
>> > # manage to take them in this order, great. :)
>> >
>> > Rough dependency tree:
>> >
>> > Arrays
>> > Regular expressions (backreference storage)
>> > Parser (probably)
>> > Lexicals (probably, though could be a hash instead)
>>
>> I thought lexicals were going to live in a symbol table now? In which
>> case, they're definitely going to depend on implementing hashes first.
>
>The first does not necessarily imply the second.
True, but in this case it does. Symbol tables are hashes, as are the
lexical scratchpads. (Hashes you can look up by integer index, mind,
but hashes nonetheless)
--
Dan
--------------------------------------"it's like this"-------------------
Dan Sugalski even samurai
[EMAIL PROTECTED] have teddy bears and even
teddy bears get drunk
