Re: struct Parrot_Lexicals; ArrayHash

2003-08-21 Thread Leopold Toetsch
Vladimir Lipskiy wrote: The current implementation of find_lex (by_name) is suboptimal. A linear scan over the list of lexical names is performed (s. sub.c:lexicals_get_position()). A better way would be to provide a list of lexicals plus a name hash, where hash values are indices into the list.

Re: struct Parrot_Lexicals; ArrayHash

2003-08-14 Thread Vladimir Lipskiy
The current implementation of find_lex (by_name) is suboptimal. A linear scan over the list of lexical names is performed (s. sub.c:lexicals_get_position()). A better way would be to provide a list of lexicals plus a name hash, where hash values are indices into the list. What would be a

struct Parrot_Lexicals; ArrayHash

2003-08-14 Thread Leopold Toetsch
The current implementation of find_lex (by_name) is suboptimal. A linear scan over the list of lexical names is performed (s. sub.c:lexicals_get_position()). A better way would be to provide a list of lexicals plus a name hash, where hash values are indices into the list. As such a

Re: struct Parrot_Lexicals; ArrayHash

2003-08-10 Thread Matt Fowles
Leo~ Why not just use a hash and ditch the array then? Matt Leopold Toetsch wrote: The current implementation of find_lex (by_name) is suboptimal. A linear scan over the list of lexical names is performed (s. sub.c:lexicals_get_position()). A better way would be to provide a list of lexicals

Re: struct Parrot_Lexicals; ArrayHash

2003-08-09 Thread Leopold Toetsch
Matt Fowles [EMAIL PROTECTED] wrote: Leo~ Why not just use a hash and ditch the array then? Because $HL may emit code to access lexicals by numeric index. Matt leo