|
| | CASolutionState (Orbit p, Orbit s, double MaxDT) |
| | initialize the struct: p is primary orbit, s is secondary More...
|
| |
| double | Clamp_dt (double dt) |
| | Keep time step within reasonable limits as guessed by Update (for the presolver) More...
|
| |
| double | Halley_dt () |
| | Calculate the time step to the next guess of the solution using Halley's method. More...
|
| |
| void | Update (double t, ref int iter, bool dump=false) |
| | recalculate state vectors and derivatives at the specified time, updating the iteration count (really, number of calls to the potentially expensive MA->EA solver) More...
|
| |
| Orbit.CASolutionState.CASolutionState |
( |
Orbit |
p, |
|
|
Orbit |
s, |
|
|
double |
MaxDT |
|
) |
| |
|
inline |
initialize the struct: p is primary orbit, s is secondary
| double Orbit.CASolutionState.Clamp_dt |
( |
double |
dt | ) |
|
|
inline |
Keep time step within reasonable limits as guessed by Update (for the presolver)
| double Orbit.CASolutionState.Halley_dt |
( |
| ) |
|
|
inline |
Calculate the time step to the next guess of the solution using Halley's method.
| void Orbit.CASolutionState.Update |
( |
double |
t, |
|
|
ref int |
iter, |
|
|
bool |
dump = false |
|
) |
| |
|
inline |
recalculate state vectors and derivatives at the specified time, updating the iteration count (really, number of calls to the potentially expensive MA->EA solver)
| double Orbit.CASolutionState.ddrdv |
| double Orbit.CASolutionState.drdv |
| double Orbit.CASolutionState.MaxDT |
| double Orbit.CASolutionState.maxdt |
| Orbit Orbit.CASolutionState.p |
| State Orbit.CASolutionState.pstate |
| double Orbit.CASolutionState.rdv |
| State Orbit.CASolutionState.rstate |
| Orbit Orbit.CASolutionState.s |
| State Orbit.CASolutionState.sstate |
| bool Orbit.CASolutionState.targetAhead |
|
get |
Check if the target (secondary) is ahead
The documentation for this struct was generated from the following file:
- KSP/Assets/Scripts/Orbit Scripts/Orbit.cs
1.8.7