On 31/03/2008, Ian Young <[EMAIL PROTECTED]> wrote: > [...] > > I did a couple informal benchmarks when I preparing for > a short talk I gave at my school. The slides are at > <http://vim-soc-regexp.googlecode.com/files/ThursExtra.odp>, > and near the end are some graphs with the data > I collected. Short version: the pathological cases > mirror Russ Cox's results pretty closely. The > non-pathological cases tend to be a bit slower with the > new engine than the old, but we're talking differences of > a few nanoseconds in most cases. A few cases had more > substantial differences (in the order of hundreds of > nanoseconds), which is the reason I believe some work > should go into optimizing before we incorporate the new > engine into a release.
Do you know why the new engine is slower than the old one in these cases? Are your benchmarks for matching only, or do they include the compilation phase? Also doesn't the old engine use something like Boyer-Moore on string literals in the regexp to home in quickly on a potential match? Could you make use of that code too? --Antony --~--~---------~--~----~------------~-------~--~----~ You received this message from the "vim_dev" maillist. For more information, visit http://www.vim.org/maillist.php -~----------~----~----~----~------~----~------~--~---
