tree 55abc944595940cd4357bcb667941be46d4aa312
parent c16ee438a2a57e9c2c78f3862e7b52d20ee1ffc4
author David Morgan <davidmorgan@google.com> 1580481984 +0100
committer David Morgan <davidmorgan@google.com> 1580724941 +0100

Fix performance issues due to list.removeAt(0), which makes parsing O(n^2).

Add a test that checks that parse time does not increase more than 30x when input size grows from 10k to 100k. The current increase is about x2, so this is a very loose check that should be reliably green. It will only trigger if we hit O(n^2) behaviour again.