[MATCH-89] perf 3x slower for ragged rows Created: 27/Oct/13 Updated: 28/Oct/13
|Reporter:||kovas boguta||Assignee:||David Nolen|
In both cases, match should fail immediately on seeing the first element.
|Comment by David Nolen [ 27/Oct/13 8:24 PM ]|
Ragged rows are hard to optimize. We used to try and intelligently group patterns - but this "optimization" created an incredible number of edgecase bugs. So until I or someone else can come up with a sound way to do this, going to continue to punt on this.
|Comment by kovas boguta [ 28/Oct/13 6:03 PM ]|
Can you point commit where that optimization existed? Just want to get a sense of what code path are affected.
|Comment by David Nolen [ 28/Oct/13 9:08 PM ]|
If you look at the repo tree around the first 0.2.0 alpha you'll see it, however the optimization was not global - it was a specific thing for each type of pattern. Again, I'm not particularly inclined to revisit this myself, but if you have a clever idea how it can be done without the previous problems I'm all for it.