Skip to content

Commit

Permalink
Browse files Browse the repository at this point in the history
Removed outdated comment
Slipped through pull request #4362. Since "above" is a different
algorithm the removed comment is misleading. It did make sense in
previous versions of PR #4362.
  • Loading branch information
Andreas Zwinkau authored and qznc committed Jun 2, 2016
1 parent 5529e7a commit 9d77777
Showing 1 changed file with 0 additions and 2 deletions.
2 changes: 0 additions & 2 deletions std/algorithm/searching.d
Expand Up @@ -1841,8 +1841,6 @@ if (isRandomAccessRange!R1 && hasLength!R1 && hasSlicing!R1 && isBidirectionalRa
}
// Found a match with the last element in the needle
auto cand = haystack[scout + 1 - needleLength .. haystack.length];
// This intermediate creation of a slice is why the
// random access variant above is faster.
if (startsWith!pred(cand, needle))
{
// found
Expand Down

0 comments on commit 9d77777

Please sign in to comment.