On Fri, 2002-08-02 at 10:43, Jerome Vouillon wrote: > Sure, you need a hash. But this can be a statically allocated hash, > mapping variable names to indices.
Could two parallel arrays work? One stores the lexicals (accessed by index) and the other stores the names of the lexicals. Then to access a lexical by name involves a sequential search through the (probably not large) array of names, to get the index, then the index is used to get the lexical from the other array. Or would that make access by name too slow? -- Jonathan Sillito
