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 that matches the second range, or if no second range is given skip over the elements that fullfil pred. Do nothing if there is no match.
						
				template skipOver(alias pred)
				;
						
					
				Contained Functions
| Name | Description | 
|---|---|
| skipOver | r1 = The forward range to
        move forward.
    r2 = The input range
        representing the initial segment of r1to skip over.
    e = The element to match. | 
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
Partial instantiation
import stdAuthors
License
					Copyright © 1999-2018 by the D Language Foundation | Page generated by ddox.