View source code
							
							
						
								Display the source code in std/algorithm/searching.d from which this
								page was generated on github.
							
						
							Report a bug
							
						
								If you spot a problem with this page, click here to create a
								Bugzilla issue.
							
						
							
								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.
							
						Template std.algorithm.searching.skipOver
Skip over the initial portion of the first given range (haystack) that matches
any of the additionally given ranges (needles) fully, or
if no second range is given skip over the elements that fulfill pred.
Do nothing if there is no match.
						
				template skipOver(alias pred)
				;
						
					
				Contained Functions
| Name | Description | 
|---|---|
| skipOver | 
Parameters
| Name | Description | 
|---|---|
| pred | The predicate that determines whether elements from each respective
        range match. Defaults to equality "a == b". | 
Example
import stdExample
import stdExample
Variadic skipOver
auto s = "Hello world";
assert(!skipOver(s, "hello", "HellO"));
writeln(s); // "Hello world"
// the range is skipped over the longest matching needle is skipped
assert(skipOver(s, "foo", "hell", "Hello "));
writeln(s); // "world"
Example
import stdExample
Partial instantiation
import stdAuthors
License
					Copyright © 1999-2022 by the D Language Foundation | Page generated by ddox.