mirrors/phobos
1
0
Fork 0
mirror of https://github.com/dlang/phobos.git synced 2025-05-06 19:16:13 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions

Properly document BoyerMooreFinder

Browse source 
Before it was ditto-ing the find(haystack, needles) docs which return a
tuple instead.
Move boyerMooreFinder above the struct so ddoc finds a parameter name.
Remove note about bug 4759, which is now resolved.
This commit is contained in:
Nick Treleaven 2014-12-01 17:26:37 +00:00
parent 038d2f1054
commit a2450fd1a5
1 changed files with 35 additions and 13 deletions
Download patch file Download diff file Expand all files Collapse all files

48
std/algorithm.d
View file

@ -5302,7 +5302,7 @@ until either $(D pred(haystack.front)), or $(D
haystack.empty). Performs $(BIGOH haystack.length) evaluations of $(D haystack.empty). Performs $(BIGOH haystack.length) evaluations of $(D
pred). pred).
To find the last element of a bidirectional $(D haystack) satisfying To _find the last element of a bidirectional $(D haystack) satisfying
$(D pred), call $(D find!(pred)(retro(haystack))). See $(XREF $(D pred), call $(D find!(pred)(retro(haystack))). See $(XREF
range, retro). range, retro).
@ -5706,8 +5706,6 @@ Finds two or more $(D needles) into a $(D haystack). The predicate $(D
pred) is used throughout to compare elements. By default, elements are pred) is used throughout to compare elements. By default, elements are
compared for equality. compared for equality.
$(D BoyerMooreFinder) allocates GC memory.
Params: Params:
haystack = The target of the search. Must be an $(GLOSSARY input haystack = The target of the search. Must be an $(GLOSSARY input
@ -5851,6 +5849,23 @@ if (Ranges.length > 1 && is(typeof(startsWith!pred(haystack, needles))))
} }
} }
/**
* Sets up Boyer-Moore matching for use with $(D find) below.
* By default, elements are compared for equality.
*
* $(D BoyerMooreFinder) allocates GC memory.
*
* Params:
* pred = Predicate used to compare elements.
* needle = A random-access range with length and slicing.
*/
BoyerMooreFinder!(binaryFun!(pred), Range) boyerMooreFinder
(alias pred = "a == b", Range)
(Range needle) if (isRandomAccessRange!(Range) || isSomeString!Range)
{
return typeof(return)(needle);
}
/// Ditto /// Ditto
struct BoyerMooreFinder(alias pred, Range) struct BoyerMooreFinder(alias pred, Range)
{ {
@ -5945,15 +5960,18 @@ public:
alias opDollar = length; alias opDollar = length;
} }
/// Ditto /**
BoyerMooreFinder!(binaryFun!(pred), Range) boyerMooreFinder * Finds $(D needle) in $(D haystack) efficiently using the
(alias pred = "a == b", Range) * $(LUCKY Boyer-Moore) method.
(Range needle) if (isRandomAccessRange!(Range) || isSomeString!Range) *
{ * Params:
return typeof(return)(needle); * haystack = A random-access range with length and slicing.
} * needle = A $(LREF BoyerMooreFinder).
*
// Oddly this is not disabled by bug 4759 * Returns:
* $(D haystack) advanced such that $(D needle) is a prefix of it (if no
* such position exists, returns $(D haystack) advanced to termination).
*/
Range1 find(Range1, alias pred, Range2)( Range1 find(Range1, alias pred, Range2)(
Range1 haystack, BoyerMooreFinder!(pred, Range2) needle) Range1 haystack, BoyerMooreFinder!(pred, Range2) needle)
{ {
@ -5972,10 +5990,14 @@ Range1 find(Range1, alias pred, Range2)(
auto p = find(h, boyerMooreFinder(n)); auto p = find(h, boyerMooreFinder(n));
assert(!p.empty); assert(!p.empty);
} }
}
///
@safe unittest
{
int[] a = [ -1, 0, 1, 2, 3, 4, 5 ]; int[] a = [ -1, 0, 1, 2, 3, 4, 5 ];
int[] b = [ 1, 2, 3 ]; int[] b = [ 1, 2, 3 ];
//writeln(find(a, boyerMooreFinder(b)));
assert(find(a, boyerMooreFinder(b)) == [ 1, 2, 3, 4, 5 ]); assert(find(a, boyerMooreFinder(b)) == [ 1, 2, 3, 4, 5 ]);
assert(find(b, boyerMooreFinder(a)).empty); assert(find(b, boyerMooreFinder(a)).empty);
} }