diff options
| author | John MacFarlane <jgm@berkeley.edu> | 2018-04-14 21:39:53 -0700 |
|---|---|---|
| committer | John MacFarlane <jgm@berkeley.edu> | 2018-04-14 21:41:59 -0700 |
| commit | d51bb0e45be412f1f36b010f7458d2c392e28f2b (patch) | |
| tree | 13917a58cf4e4ccc8e2c114da54f7ef4c7e29b41 /bench/samples/block-bq-nested.md | |
| parent | 55d7b8808a7bba08345bcc94b7a462176c182fc9 (diff) | |
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.
Diffstat (limited to 'bench/samples/block-bq-nested.md')
0 files changed, 0 insertions, 0 deletions