Search Results


std.​algorithm.​searching

This is a submodule of std.algorithm. It contains generic searching algorithms.


std.​algorithm.​std.​algorithm.​searching

std.​string.​std.​algorithm.​searching

std.​algorithm.​searching.​all

Checks if _all of the elements verify pred.


std.​algorithm.​searching.​balancedParens

Checks whether r has "balanced parentheses", i.e. all instances of lPar are closed by corresponding instances of rPar. The parameter maxNestingLevel controls the nesting level allowed. The most common uses are the default or 0. In the latter case, no nesting is allowed.


std.​algorithm.​searching.​BoyerMooreFinder.​beFound

std.​algorithm.​searching.​any.​any

Returns true if and only if _any value v found in the input range range satisfies the predicate pred. Performs (at most) O(range.length) evaluations of pred.


std.​algorithm.​searching.​BoyerMooreFinder.​length
Suggestion Box / Bug Report