- Commit
- d51bb0e45be412f1f36b010f7458d2c392e28f2b
- Parent
- 55d7b8808a7bba08345bcc94b7a462176c182fc9
- Author
- John MacFarlane <jgm@berkeley.edu>
- Date
Optimize S_find_first_nonspace.
We were needlessly redoing things we'd already done.
Now we skip the work if the first nonspace is greater
than the current offset.
This fixes pathological slowdown with deeply nested
lists (#255). For N = 3000, the time goes from over
17s to about 0.7s.
Thanks to @mity for diagnosing the problem.