1. 11 May, 2017 2 commits
  2. 09 May, 2017 5 commits
  3. 08 May, 2017 6 commits
  4. 07 May, 2017 3 commits
  5. 05 May, 2017 8 commits
  6. 04 May, 2017 2 commits
  7. 03 May, 2017 1 commit
  8. 02 May, 2017 1 commit
  9. 01 May, 2017 10 commits
  10. 30 Apr, 2017 2 commits
    • Benno Schulenberg's avatar
      tweaks: check for an empty needle in a central place · c42d6d37
      Benno Schulenberg authored
      Searching for an empty string should be impossible, it should never
      happen, but it is bit too hard to verify this at the moment.
      c42d6d37
    • Benno Schulenberg's avatar
      tweaks: remove a superfluous strlen() call from the reverse searches · 1a79b3d5
      Benno Schulenberg authored
      If the length of the haystack is smaller than the length of the needle,
      this means that also the length of the tail will be smaller -- because
      pointer will be bigger than or equal to haystack -- so the pointer gets
      readjusted to be a needle length before the end of the haystack, which
      means that it ends up /before/ the haystack: thus the while loop will
      never run.
      
      On average, this saves some 200 nanoseconds per line.
      1a79b3d5