1. 06 Jun, 2013 1 commit
  2. 11 Jun, 2012 1 commit
  3. 06 Jun, 2012 1 commit
  4. 22 May, 2012 1 commit
  5. 30 Mar, 2012 2 commits
  6. 03 Oct, 2011 2 commits
  7. 11 May, 2011 1 commit
  8. 12 Jan, 2011 1 commit
  9. 19 Oct, 2010 3 commits
  10. 30 Sep, 2010 1 commit
  11. 28 Sep, 2010 2 commits
  12. 26 Apr, 2010 2 commits
  13. 07 Jan, 2010 1 commit
  14. 14 Aug, 2009 1 commit
  15. 25 May, 2009 1 commit
  16. 26 Jan, 2009 1 commit
  17. 23 Jan, 2009 2 commits
  18. 19 Jan, 2009 1 commit
  19. 14 Jan, 2009 1 commit
  20. 12 Jan, 2009 1 commit
  21. 08 Jan, 2009 1 commit
  22. 02 Jan, 2009 1 commit
  23. 19 Dec, 2008 1 commit
  24. 08 Dec, 2008 1 commit
    • erik.corry@gmail.com's avatar
      Irregexp: · ba09ec5e
      erik.corry@gmail.com authored
      * Facility for generating a node several ways.  This allows
        code to be generated for a node knowing where it is trying
        to match relative to the 'current position' and it allows
        code to be generated that knows where to backtrack to.  Both
        allow dramatic reductions in the amount of popping and pushing
        on the stack and the number of indirect jumps.
      * Generate special backtracking for greedy quantifiers on
        constant-length atoms.  This allows .* to run in constant
        space relative to input string size.
      * When we are checking a long sequence of characters or character
        classes in the input then we do them right to left and only the
        first (rightmost) needs to check for end-of-string.
      * Record the pattern in the profile instead of just <CompiledRegExp>
      * Nodes no longer contain an on_failure_ node.  This was only used
        for lookaheads and they are now handled with a choice node instead.
      Review URL: http://codereview.chromium.org/12900
      
      git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@930 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
      ba09ec5e
  25. 01 Dec, 2008 1 commit
  26. 28 Nov, 2008 2 commits
  27. 27 Nov, 2008 1 commit