View source code Display the source code in std/algorithm/searching.d from which this page was generated on github. Improve this page Quickly fork, edit online, and submit a pull request for this page. Requires a signed-in GitHub account. This works well for small changes. If you'd like to make larger changes you may want to consider using local clone. Page wiki View or edit the community-maintained wiki page associated with this page.

std.algorithm.searching.boyer_moore_finder - multiple declarations

Function boyerMooreFinder

Sets up Boyer-Moore matching for use with find below. By default, elements are compared for equality.

BoyerMooreFinder allocates GC memory.

Prototype

BoyerMooreFinder!(binaryFun!pred,Range) boyerMooreFinder(alias pred, Range)(
  Range needle
)
if (isRandomAccessRange!Range || isSomeString!Range);

Parameters

NameDescription
pred Predicate used to compare elements.
needle A random-access range with length and slicing.

Returns

An instance of BoyerMooreFinder that can be used with find() to invoke the Boyer-Moore matching algorithm for finding of needle in a given haystack.

Struct BoyerMooreFinder

Sets up Boyer-Moore matching for use with find below. By default, elements are compared for equality.

BoyerMooreFinder allocates GC memory.

Parameters

NameDescription
pred Predicate used to compare elements.
needle A random-access range with length and slicing.

Returns

An instance of BoyerMooreFinder that can be used with find() to invoke the Boyer-Moore matching algorithm for finding of needle in a given haystack.

Authors

Andrei Alexandrescu

License

Boost License 1.0.

Comments