The lower time bound of a search window.
The upper time bound of a search window.
Optionaloptions: SearchOptionsOptions that can tune the behavior of the search. Most callers can omit this argument.
If the search is successful, returns the date and time of the solution.
If the search fails, returns null.
Finds the time when a function ascends through zero.
Search for next time t (such that t is between
t1andt2) thatfunc(t)crosses from a negative value to a non-negative value. The given function must have "smooth" behavior over the entire inclusive range [t1,t2], meaning that it behaves like a continuous differentiable function. It is not required thatt1<t2;t1>t2allows searching backward in time. Note:t1andt2must be chosen such that there is no possibility of more than one zero-crossing (ascending or descending), or it is possible that the "wrong" event will be found (i.e. not the first event after t1) or even that the function will returnnull, indicating that no event was found.