# performance

2009-09-14

Currently, (range 10) takes almost 3000 steps. No wonder that (range 20) takes
over half a second, and (range 1000) takes 13.5s!

Also, (length x), where x is a list of 1000 elements, takes 1.3s. >.<

First culprit is <=, which is written in pure Liquid, and uses OR. Let's make
these comparison functions builtins... OR is horribly inefficient.

(later)

(range 10) now takes 403 steps, with <= built-in. A great improvement. :-)

(range 1000) is much faster now, although it still takes 1.6s.

(length x) still takes 1.3s. Why so slow? There's 40,000 steps... so about 40
for each item?
How can we make it faster?