OptionalboundGiven the root's bone-local rotation at a swivel on one bend branch,
degrees, and that branch's poser, a certified lower bound of the exact
deviation of every candidate at a swivel from low to high degrees;
omitted, every step is scored. The cold sweep then scores only the steps
the bound cannot place behind a legal candidate (hingedSwivelBounded),
with the full sweep's choice: under a tie by the deviation's bucket, and after the minimum certificate's test of the sweep's first candidate.
OptionalclosedGiven a branch's poser, every swivel on it, degrees, at which a requested
term that only isolated swivels can meet is met (immobileAxisSwivels),
in closed form; null or none when the analysis does not apply. A cold fit
with no tie or minimum scores those candidates alone and returns the
best when it is legal and met accepts it; otherwise the pole start and
the sweep decide as without it.
OptionaldirectWhether the score is the start's own term alone, so an unrefused start is the answer.
Effector's rest offset from the mid joint, in the mid bone's frame.
OptionalexcludedGiven the root's bone-local rotation at a swivel on one bend branch,
degrees, a test of whether every swivel from low to high degrees is
certain to score a positive overshoot (boxExcludedSwivels); omitted,
every step is scored. Only a certainty may be returned: the returned pose
is then the one the full sweep gives.
The factory and returned predicate run synchronously during this solve;
exceptions propagate and neither is retained after return. They must not
mutate rotations supplied by upper.
The mid joint's flexion axis in the mid bone's frame; any length.
OptionalincumbentA seed the caller holds for a cold fit, a branch and swivel it chose
for a nearby target: never the answer by itself, only a legal
candidate whose exact deviation starts the bounded sweep's stop
(hingedSwivelBounded), which keeps it only where the sweep's choice
is legal and no worse than it; read only with bound, never with
near.
OptionalmetWhether a pole-started result meets every requested term; absent, legality alone decides.
Mid bone's rest offset from the chain root, in the root's bone frame.
Mid bone's rest rotation relative to the chain root.
OptionalminimumCertified global lower bounds of every actual score in this solve; omission keeps the complete search. With no second key, only the original first coarse candidate may stop early after both keys equal these bounds exactly. The score and all raw inputs must already be admitted; this is a mathematical certificate, not a reach or convergence tolerance.
OptionalnearThe seed of a fit of a nearby target to continue (IAutoMovieSwivelNear):
its branch, or the last branch when the target has fewer (two branches
meet at the span's ends), and its swivel refined within one step either
way to its tolerance, with no sweep; omitted, every swivel is swept.
OptionalnearestGiven a branch's poser and a swivel, degrees, the swivel nearest it at
which a requested term met over intervals of swivels can be met, in
closed form (distalEndSwivelNearest): the given swivel itself where it
is admissible; null where the analysis does not apply or nothing is
admissible. A continued fit centres its search there (hingedSwivelNear).
OptionalpoleGiven a branch's poser, the closed-form start swivel, degrees: the pole
(mid joint toward the hint) or a term's own minimiser; null when none.
A cold fit with no tie or minimum searches from it (hingedSwivelPole)
and returns a legal result that met accepts; otherwise the sweep decides.
OptionalpreparedExact source/target geometry of this same unchanged chain, point and hinge range.
OptionalrangeThe mid joint's legal rotation about hinge, radians, min <= max and no wider than a full turn; every hinge angle is legal when absent.
Upper rig rotation about hinge, radians; caller ensures min <= max <= min + 2*pi.
Lower rig rotation about hinge, radians.
Score one candidate's bone-local root and mid rotations: overshoot is
the total ROM overshoot in degrees, compared first, and deviation the
effort tie-break, compared second. The caller owns the decomposition
convention and the rig's constraints. With exact, deviation is a
lower bound of the tie-break and exact gives it exactly: a caller
whose tie-break ends in a costly non-negative term passes the rest as
the bound, and the term is computed only for a comparison the bound
cannot decide. With tie, tiebreak is a second key: two deviations
in one bucket of width tie are one, and the lesser tiebreak decides
(task priority, Siciliano and Slotine 1991: the second objective only
among the first's optima), so exact need then be right only to its
bucket. The score and its lazy readers describe the same unchanged
objective throughout this synchronous solve. The candidate's swivel,
degrees, and its branch's poser are passed for a caller that reads them.
World target the effector should land on.
OptionaltieThe positive width of the buckets two deviations are one in, the unit of
deviation, for a score with a second key (tiebreak); omitted, deviations
are compared exactly and tiebreak is not read.
OptionalunmetGiven a branch's poser, whether it is certain that no candidate on the
branch passes met (a certified lower bound of the requested term's
miss above its tolerance at every swivel). Where every branch is so
certified, a cold fit skips the pole start, whose result met would
refuse, and the sweep decides at once; omitted, nothing is certified.
Chain-root bone (the shoulder or the hip) resolved under the rig's rest FK.
The solver's props: the interface chain and target with the engine's certificates and prepared geometry.