RootSearch
このコンテンツはまだ日本語訳がありません。
Defined in: root.rs:326
pub struct RootSearch { pub t_tolerance: f64, pub max_iterations: u32,}How hard to look for a crossing.
Fields
Section titled “Fields”t_tolerance
Section titled “t_tolerance”t_tolerance: f64
Bracket width to stop at, in seconds. The search ends once the interval holding the crossing is this narrow, or once halving it no longer changes the bracket in f64.
max_iterations
Section titled “max_iterations”max_iterations: u32
Cap on bisection iterations, counted per pass. A value that behaves
unlike a continuous function cannot make the search spin: the walk fails
with IntegrationError::RootNotLocalized instead.
A step whose located end brackets a further event is searched again from the step’s start, and each of those passes gets this many iterations: one narrowing does not spend the budget of the next, and a cap chosen for a step’s width keeps holding for the shorter widths that follow.