Daily Archives Monday, August 2009

Concerning List Traversal With Node Deletion

Lists are funny things in LSL; their basic functions are not implemented as efficiently as they should have been. Furthermore, the very nature of call-by-value requires that lists be copied in their entirety as function parameters. Under the old interpreter, this often resulted in stack-heap errors for long lists. Luckily things are a bit better […]