1. 04 May, 2017 1 commit
  2. 24 Apr, 2017 1 commit
  3. 21 Apr, 2017 5 commits
  4. 20 Apr, 2017 1 commit
  5. 18 Apr, 2017 1 commit
  6. 13 Apr, 2017 1 commit
  7. 12 Apr, 2017 2 commits
  8. 11 Apr, 2017 2 commits
  9. 07 Apr, 2017 3 commits
  10. 06 Apr, 2017 1 commit
  11. 05 Apr, 2017 1 commit
  12. 03 Apr, 2017 1 commit
  13. 31 Mar, 2017 2 commits
  14. 27 Mar, 2017 1 commit
    • erikcorry's avatar
      Regexp: Optimize better in presence of lookaround. · 8df7c2a2
      erikcorry authored
      Previously the Boyer-Moore-Horspool optimization gave up in the presence of a
      submatch.  A submatch is where we record the current position so that we can go
      back to it, which is an essential part of the semantics of lookarounds
      (lookaheads and lookbehinds).  This has been the case since
      Boyer-Moore-Horspool was implemented, but it was overly cautious.
      
      * For positive lookahead it is OK to use the patterns inside the lookahead to
        guide the BMS optimization.
      * For positive lookbehind we harmlessly fail to optimize when the patterns
        inside the lookbehind go backwards because TextNode::EatsAtLeast returns 0.
      * For negative lookarounds, the NegativeLookaroundChoiceNode::FillInBMInfo method
        (in jsregexp.h) knows to only look at the following pattern.
      
      This is in response to disappointing lookbehind performance in Atom.
      See https://github.com/atom/find-and-replace/issues/571
      
      R=yangguo@chromium.org
      BUG=
      
      Review-Url: https://codereview.chromium.org/2777583003
      Cr-Commit-Position: refs/heads/master@{#44139}
      8df7c2a2
  15. 22 Mar, 2017 1 commit
  16. 17 Mar, 2017 1 commit
  17. 15 Mar, 2017 1 commit
  18. 09 Mar, 2017 1 commit
  19. 28 Feb, 2017 3 commits
  20. 27 Feb, 2017 1 commit
  21. 23 Feb, 2017 1 commit
  22. 10 Feb, 2017 1 commit
  23. 09 Feb, 2017 1 commit
  24. 27 Jan, 2017 1 commit
  25. 23 Jan, 2017 1 commit
  26. 20 Jan, 2017 4 commits