On 03/22/2011 10:56 AM, bearophile wrote:
- an ordered (chained, keeps the insertion order) associative array (not hard, no need to re-implement associative arrays);
? How would you do that? (Without requiring lookup for each key on traversal.) I'm really interested, I need it. Have had a look at current AA implementation in hope to tweak it, but too complicated.
Denis -- _________________ vita es estrany spir.wikidot.com