Tag Archives: algorithm

The Treatment of Booleans in LSL

Booleans are people too! Well, George Boole was, anyway, and he is the one credited with and named for the mathematical operations performed on variables defined to carry one of only two states: true or false. Or on and off. Or zero and not-zero. Call those two states what you will. And always capitalize the […]

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 […]

Template for Agent Detection in Events

There are three questions concerning the nature of events which a scripter should answer to code the event properly: How is the capture of the event set up or requested? Exactly how is the event triggered? What information is available to the scripter when the event is triggered? Well I don’t know about you, but […]