On Sat, 2004-03-27 at 18:06, Clint Jeffery wrote: > [Steve asserts: ] > > there is no operation that inserts elements anywhere > > else in a list (as you know). So, yes, arbitrary element insertion > > is expensive... > > Actually, after reading one too many Icon/Unicon programs that implemented > their own insert/delete operations into the middle of a list by naive brute > force, I decided even a naive brute force built-in would be better than no > support, and modified insert() and delete() awhile back to support lists.
Neat! I missed that. It'll be nice when someone works out a faster implementation. -- Steve Wampler <[EMAIL PROTECTED]> ------------------------------------------------------- This SF.Net email is sponsored by: IBM Linux Tutorials Free Linux tutorial presented by Daniel Robbins, President and CEO of GenToo technologies. Learn everything from fundamentals to system administration.http://ads.osdn.com/?ad_id=1470&alloc_id=3638&op=click _______________________________________________ Unicon-group mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/unicon-group
