Skip to content
  1. Apr 23, 2012
  2. Apr 22, 2012
  3. Mar 11, 2012
  4. Mar 04, 2012
  5. Feb 24, 2012
  6. Feb 21, 2012
  7. Feb 15, 2012
  8. Nov 06, 2011
  9. Oct 17, 2011
  10. Oct 15, 2011
    • Benjamin Kramer's avatar
      Add a bad char heuristic to StringRef::find. · 4d681d7d
      Benjamin Kramer authored
      Based on Horspool's simplified version of Boyer-Moore. We use a constant-sized table of
      uint8_ts to keep cache thrashing low, needles bigger than 255 bytes are uncommon anyways.
      
      The worst case is still O(n*m) but we do a lot better on the average case now.
      
      llvm-svn: 142061
      4d681d7d
  11. Sep 30, 2011
  12. Apr 28, 2011
  13. Apr 15, 2011
  14. Dec 07, 2010
  15. Dec 01, 2010
  16. Nov 26, 2010
  17. Nov 07, 2010
  18. Oct 20, 2010
  19. Aug 26, 2010
  20. Aug 23, 2010
  21. May 26, 2010
  22. Feb 28, 2010
  23. Jan 07, 2010
  24. Dec 31, 2009
  25. Dec 30, 2009
  26. Nov 19, 2009
  27. Nov 12, 2009
  28. Nov 11, 2009
  29. Nov 06, 2009
  30. Sep 22, 2009
  31. Sep 21, 2009
  32. Sep 20, 2009
  33. Sep 19, 2009
  34. Sep 17, 2009
  35. Sep 14, 2009
Loading