Talk:LSL Function Style/Celierra Darling

From Second Life Wiki
< Talk:LSL Function Style
Revision as of 22:51, 23 February 2007 by Gigs Taggart (talk | contribs) (complexity.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Complexity is irrelevant. LSL functions delay seemingly random amounts, and functions you'd think would be CPU intensive like MD5Sum ... aren't. There's so much crap in terms of energy and delay and other random throttling on top of the function that a complexity rating would be meaningless, and potentially lag-inducing. Someone might avoid an n^2 function and implement their own nlogn version in LSL, which would undoutably be very much slower and cause more lag. Built-ins are always better than implementing the algorithm in LSL itself. Gigs Taggart 21:51, 23 February 2007 (PST)