Re: Builtin sequence operations?
- Posted by Patrick Barnes <mrtrick at gmail.com> Dec 08, 2005
- 546 views
On 12/8/05, christian cuvier <christian.cuvier at insee.fr> wrote: > If sequences are implemented as linked lists, this should be far more > efficient than the current best method, right? I'm pretty sure they're not linked-lists... otherwise it'd be very slow doing random access. (seq[n]) As for creating a function to do this, I don't think it could be made much faster than it currently is - if speed is really important, find a better algorithm. -- MrTrick ----------