FieldEventState.java

  1. /*
  2.  * Licensed to the Apache Software Foundation (ASF) under one or more
  3.  * contributor license agreements.  See the NOTICE file distributed with
  4.  * this work for additional information regarding copyright ownership.
  5.  * The ASF licenses this file to You under the Apache License, Version 2.0
  6.  * (the "License"); you may not use this file except in compliance with
  7.  * the License.  You may obtain a copy of the License at
  8.  *
  9.  *      http://www.apache.org/licenses/LICENSE-2.0
  10.  *
  11.  * Unless required by applicable law or agreed to in writing, software
  12.  * distributed under the License is distributed on an "AS IS" BASIS,
  13.  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  14.  * See the License for the specific language governing permissions and
  15.  * limitations under the License.
  16.  */
  17. package org.orekit.propagation.events;

  19. import org.hipparchus.Field;
  20. import org.hipparchus.RealFieldElement;
  21. import org.hipparchus.analysis.UnivariateFunction;
  22. import org.hipparchus.analysis.solvers.BracketedUnivariateSolver;
  23. import org.hipparchus.analysis.solvers.BracketedUnivariateSolver.Interval;
  24. import org.hipparchus.analysis.solvers.BracketingNthOrderBrentSolver;
  25. import org.hipparchus.exception.MathRuntimeException;
  26. import org.hipparchus.ode.events.Action;
  27. import org.hipparchus.util.FastMath;
  28. import org.hipparchus.util.Precision;
  29. import org.orekit.errors.OrekitInternalError;
  30. import org.orekit.propagation.FieldSpacecraftState;
  31. import org.orekit.propagation.sampling.FieldOrekitStepInterpolator;
  32. import org.orekit.time.FieldAbsoluteDate;

  34. /** This class handles the state for one {@link FieldEventDetector
  35.  * event detector} during integration steps.
  36.  *
  37.  * <p>This class is heavily based on the class with the same name from the
  38.  * Hipparchus library. The changes performed consist in replacing
  39.  * raw types (double and double arrays) with space dynamics types
  40.  * ({@link FieldAbsoluteDate}, {@link FieldSpacecraftState}).</p>
  41.  * <p>Each time the propagator proposes a step, the event detector
  42.  * should be checked. This class handles the state of one detector
  43.  * during one propagation step, with references to the state at the
  44.  * end of the preceding step. This information is used to determine if
  45.  * the detector should trigger an event or not during the proposed
  46.  * step (and hence the step should be reduced to ensure the event
  47.  * occurs at a bound rather than inside the step).</p>
  48.  * @author Luc Maisonobe
  49.  * @param <D> class type for the generic version
  50.  */
  51. public class FieldEventState<D extends FieldEventDetector<T>, T extends RealFieldElement<T>> {

  53.     /** Event detector. */
  54.     private D detector;

  56.     /** Time of the previous call to g. */
  57.     private FieldAbsoluteDate<T> lastT;

  59.     /** Value from the previous call to g. */
  60.     private T lastG;

  62.     /** Time at the beginning of the step. */
  63.     private FieldAbsoluteDate<T> t0;

  65.     /** Value of the event detector at the beginning of the step. */
  66.     private T g0;

  68.     /** Simulated sign of g0 (we cheat when crossing events). */
  69.     private boolean g0Positive;

  71.     /** Indicator of event expected during the step. */
  72.     private boolean pendingEvent;

  74.     /** Occurrence time of the pending event. */
  75.     private FieldAbsoluteDate<T> pendingEventTime;

  77.     /**
  78.      * Time to stop propagation if the event is a stop event. Used to enable stopping at
  79.      * an event and then restarting after that event.
  80.      */
  81.     private FieldAbsoluteDate<T> stopTime;

  83.     /** Time after the current event. */
  84.     private FieldAbsoluteDate<T> afterEvent;

  86.     /** Value of the g function after the current event. */
  87.     private T afterG;

  89.     /** The earliest time considered for events. */
  90.     private FieldAbsoluteDate<T> earliestTimeConsidered;

  92.     /** Integration direction. */
  93.     private boolean forward;

  95.     /** Variation direction around pending event.
  96.      *  (this is considered with respect to the integration direction)
  97.      */
  98.     private boolean increasing;

  100.     /** Simple constructor.
  101.      * @param detector monitored event detector
  102.      */
  103.     public FieldEventState(final D detector) {

  105.         this.detector = detector;

  107.         // some dummy values ...
  108.         final Field<T> field   = detector.getMaxCheckInterval().getField();
  109.         final T nan            = field.getZero().add(Double.NaN);
  110.         lastT                  = FieldAbsoluteDate.getPastInfinity(field);
  111.         lastG                  = nan;
  112.         t0                     = null;
  113.         g0                     = nan;
  114.         g0Positive             = true;
  115.         pendingEvent           = false;
  116.         pendingEventTime       = null;
  117.         stopTime               = null;
  118.         increasing             = true;
  119.         earliestTimeConsidered = null;
  120.         afterEvent             = null;
  121.         afterG                 = nan;

  123.     }

  125.     /** Get the underlying event detector.
  126.      * @return underlying event detector
  127.      */
  128.     public D getEventDetector() {
  129.         return detector;
  130.     }

  132.     /** Initialize event handler at the start of a propagation.
  133.      * <p>
  134.      * This method is called once at the start of the propagation. It
  135.      * may be used by the event handler to initialize some internal data
  136.      * if needed.
  137.      * </p>
  138.      * @param s0 initial state
  139.      * @param t target time for the integration
  140.      *
  141.      */
  142.     public void init(final FieldSpacecraftState<T> s0,
  143.                      final FieldAbsoluteDate<T> t) {
  144.         detector.init(s0, t);
  145.         final Field<T> field = detector.getMaxCheckInterval().getField();
  146.         lastT = FieldAbsoluteDate.getPastInfinity(field);
  147.         lastG = field.getZero().add(Double.NaN);
  148.     }

  150.     /** Compute the value of the switching function.
  151.      * This function must be continuous (at least in its roots neighborhood),
  152.      * as the integrator will need to find its roots to locate the events.
  153.      * @param s the current state information: date, kinematics, attitude
  154.      * @return value of the switching function
  155.      */
  156.     private T g(final FieldSpacecraftState<T> s) {
  157.         if (!s.getDate().equals(lastT)) {
  158.             lastT = s.getDate();
  159.             lastG = detector.g(s);
  160.         }
  161.         return lastG;
  162.     }

  164.     /** Reinitialize the beginning of the step.
  165.      * @param interpolator interpolator valid for the current step
  166.      */
  167.     public void reinitializeBegin(final FieldOrekitStepInterpolator<T> interpolator) {
  168.         forward = interpolator.isForward();
  169.         final FieldSpacecraftState<T> s0 = interpolator.getPreviousState();
  170.         this.t0 = s0.getDate();
  171.         g0 = g(s0);
  172.         while (g0.getReal() == 0) {
  173.             // extremely rare case: there is a zero EXACTLY at interval start
  174.             // we will use the sign slightly after step beginning to force ignoring this zero
  175.             // try moving forward by half a convergence interval
  176.             final T dt = detector.getThreshold().multiply(forward ? 0.5 : -0.5);
  177.             FieldAbsoluteDate<T> startDate = t0.shiftedBy(dt);
  178.             // if convergence is too small move an ulp
  179.             if (t0.equals(startDate)) {
  180.                 startDate = nextAfter(startDate);
  181.             }
  182.             t0 = startDate;
  183.             g0 = g(interpolator.getInterpolatedState(t0));
  184.         }
  185.         g0Positive = g0.getReal() > 0;
  186.         // "last" event was increasing
  187.         increasing = g0Positive;
  188.     }

  190.     /** Evaluate the impact of the proposed step on the event detector.
  191.      * @param interpolator step interpolator for the proposed step
  192.      * @return true if the event detector triggers an event before
  193.      * the end of the proposed step (this implies the step should be
  194.      * rejected)
  195.      * @exception MathRuntimeException if an event cannot be located
  196.      */
  197.     public boolean evaluateStep(final FieldOrekitStepInterpolator<T> interpolator)
  198.         throws MathRuntimeException {
  199.         forward = interpolator.isForward();
  200.         final FieldSpacecraftState<T> s1 = interpolator.getCurrentState();
  201.         final FieldAbsoluteDate<T> t1 = s1.getDate();
  202.         final T dt = t1.durationFrom(t0);
  203.         if (FastMath.abs(dt.getReal()) < detector.getThreshold().getReal()) {
  204.             // we cannot do anything on such a small step, don't trigger any events
  205.             return false;
  206.         }
  207.         // number of points to check in the current step
  208.         final int n = FastMath.max(1, (int) FastMath.ceil(FastMath.abs(dt.getReal()) / detector.getMaxCheckInterval().getReal()));
  209.         final T h = dt.divide(n);


  212.         FieldAbsoluteDate<T> ta = t0;
  213.         T ga = g0;
  214.         for (int i = 0; i < n; ++i) {

  216.             // evaluate handler value at the end of the substep
  217.             final FieldAbsoluteDate<T> tb = (i == n - 1) ? t1 : t0.shiftedBy(h.multiply(i + 1));
  218.             final T gb = g(interpolator.getInterpolatedState(tb));

  220.             // check events occurrence
  221.             if (gb.getReal() == 0.0 || (g0Positive ^ (gb.getReal() > 0))) {
  222.                 // there is a sign change: an event is expected during this step
  223.                 if (findRoot(interpolator, ta, ga, tb, gb)) {
  224.                     return true;
  225.                 }
  226.             } else {
  227.                 // no sign change: there is no event for now
  228.                 ta = tb;
  229.                 ga = gb;
  230.             }
  231.         }

  233.         // no event during the whole step
  234.         pendingEvent     = false;
  235.         pendingEventTime = null;
  236.         return false;

  238.     }

  240.     /**
  241.      * Find a root in a bracketing interval.
  242.      *
  243.      * <p> When calling this method one of the following must be true. Either ga == 0, gb
  244.      * == 0, (ga < 0  and gb > 0), or (ga > 0 and gb < 0).
  245.      *
  246.      * @param interpolator that covers the interval.
  247.      * @param ta           earliest possible time for root.
  248.      * @param ga           g(ta).
  249.      * @param tb           latest possible time for root.
  250.      * @param gb           g(tb).
  251.      * @return if a zero crossing was found.
  252.      */
  253.     private boolean findRoot(final FieldOrekitStepInterpolator<T> interpolator,
  254.                              final FieldAbsoluteDate<T> ta, final T ga,
  255.                              final FieldAbsoluteDate<T> tb, final T gb) {

  257.         final T zero = ga.getField().getZero();

  259.         // check there appears to be a root in [ta, tb]
  260.         check(ga.getReal() == 0.0 || gb.getReal() == 0.0 || (ga.getReal() > 0.0 && gb.getReal() < 0.0) || (ga.getReal() < 0.0 && gb.getReal() > 0.0));
  261.         final T convergence = detector.getThreshold();
  262.         final int maxIterationCount = detector.getMaxIterationCount();
  263.         final BracketedUnivariateSolver<UnivariateFunction> solver =
  264.                 new BracketingNthOrderBrentSolver(0, convergence.getReal(), 0, 5);

  266.         // event time, just at or before the actual root.
  267.         FieldAbsoluteDate<T> beforeRootT = null;
  268.         T beforeRootG = zero.add(Double.NaN);
  269.         // time on the other side of the root.
  270.         // Initialized the the loop below executes once.
  271.         FieldAbsoluteDate<T> afterRootT = ta;
  272.         T afterRootG = zero;

  274.         // check for some conditions that the root finders don't like
  275.         // these conditions cannot not happen in the loop below
  276.         // the ga == 0.0 case is handled by the loop below
  277.         if (ta.equals(tb)) {
  278.             // both non-zero but times are the same. Probably due to reset state
  279.             beforeRootT = ta;
  280.             beforeRootG = ga;
  281.             afterRootT = shiftedBy(beforeRootT, convergence);
  282.             afterRootG = g(interpolator.getInterpolatedState(afterRootT));
  283.         } else if (ga.getReal() != 0.0 && gb.getReal() == 0.0) {
  284.             // hard: ga != 0.0 and gb == 0.0
  285.             // look past gb by up to convergence to find next sign
  286.             // throw an exception if g(t) = 0.0 in [tb, tb + convergence]
  287.             beforeRootT = tb;
  288.             beforeRootG = gb;
  289.             afterRootT = shiftedBy(beforeRootT, convergence);
  290.             afterRootG = g(interpolator.getInterpolatedState(afterRootT));
  291.         } else if (ga.getReal() != 0.0) {
  292.             final T newGa = g(interpolator.getInterpolatedState(ta));
  293.             if (ga.getReal() > 0 != newGa.getReal() > 0) {
  294.                 // both non-zero, step sign change at ta, possibly due to reset state
  295.                 beforeRootT = ta;
  296.                 beforeRootG = newGa;
  297.                 afterRootT = minTime(shiftedBy(beforeRootT, convergence), tb);
  298.                 afterRootG = g(interpolator.getInterpolatedState(afterRootT));
  299.             }
  300.         }
  301.         // loop to skip through "fake" roots, i.e. where g(t) = g'(t) = 0.0
  302.         // executed once if we didn't hit a special case above
  303.         FieldAbsoluteDate<T> loopT = ta;
  304.         T loopG = ga;
  305.         while ((afterRootG.getReal() == 0.0 || afterRootG.getReal() > 0.0 == g0Positive) &&
  306.                 strictlyAfter(afterRootT, tb)) {
  307.             if (loopG.getReal() == 0.0) {
  308.                 // ga == 0.0 and gb may or may not be 0.0
  309.                 // handle the root at ta first
  310.                 beforeRootT = loopT;
  311.                 beforeRootG = loopG;
  312.                 afterRootT = minTime(shiftedBy(beforeRootT, convergence), tb);
  313.                 afterRootG = g(interpolator.getInterpolatedState(afterRootT));
  314.             } else {
  315.                 // both non-zero, the usual case, use a root finder.
  316.                 // time zero for evaluating the function f. Needs to be final
  317.                 final FieldAbsoluteDate<T> fT0 = loopT;
  318.                 final UnivariateFunction f = dt -> {
  319.                     return g(interpolator.getInterpolatedState(fT0.shiftedBy(dt))).getReal();
  320.                 };
  321.                 // tb as a double for use in f
  322.                 final T tbDouble = tb.durationFrom(fT0);
  323.                 if (forward) {
  324.                     final Interval interval =
  325.                             solver.solveInterval(maxIterationCount, f, 0, tbDouble.getReal());
  326.                     beforeRootT = fT0.shiftedBy(interval.getLeftAbscissa());
  327.                     beforeRootG = zero.add(interval.getLeftValue());
  328.                     afterRootT = fT0.shiftedBy(interval.getRightAbscissa());
  329.                     afterRootG = zero.add(interval.getRightValue());
  330.                 } else {
  331.                     final Interval interval =
  332.                             solver.solveInterval(maxIterationCount, f, tbDouble.getReal(), 0);
  333.                     beforeRootT = fT0.shiftedBy(interval.getRightAbscissa());
  334.                     beforeRootG = zero.add(interval.getRightValue());
  335.                     afterRootT = fT0.shiftedBy(interval.getLeftAbscissa());
  336.                     afterRootG = zero.add(interval.getLeftValue());
  337.                 }
  338.             }
  339.             // tolerance is set to less than 1 ulp
  340.             // assume tolerance is 1 ulp
  341.             if (beforeRootT.equals(afterRootT)) {
  342.                 afterRootT = nextAfter(afterRootT);
  343.                 afterRootG = g(interpolator.getInterpolatedState(afterRootT));
  344.             }
  345.             // check loop is making some progress
  346.             check((forward && afterRootT.compareTo(beforeRootT) > 0) ||
  347.                   (!forward && afterRootT.compareTo(beforeRootT) < 0));
  348.             // setup next iteration
  349.             loopT = afterRootT;
  350.             loopG = afterRootG;
  351.         }

  353.         // figure out the result of root finding, and return accordingly
  354.         if (afterRootG.getReal() == 0.0 || afterRootG.getReal() > 0.0 == g0Positive) {
  355.             // loop gave up and didn't find any crossing within this step
  356.             return false;
  357.         } else {
  358.             // real crossing
  359.             check(beforeRootT != null && !Double.isNaN(beforeRootG.getReal()));
  360.             // variation direction, with respect to the integration direction
  361.             increasing = !g0Positive;
  362.             pendingEventTime = beforeRootT;
  363.             stopTime = beforeRootG.getReal() == 0.0 ? beforeRootT : afterRootT;
  364.             pendingEvent = true;
  365.             afterEvent = afterRootT;
  366.             afterG = afterRootG;

  368.             // check increasing set correctly
  369.             check(afterG.getReal() > 0 == increasing);
  370.             check(increasing == gb.getReal() >= ga.getReal());

  372.             return true;
  373.         }

  375.     }

  377.     /**
  378.      * Get the next number after the given number in the current propagation direction.
  379.      *
  380.      * @param t input time
  381.      * @return t +/- 1 ulp depending on the direction.
  382.      */
  383.     private FieldAbsoluteDate<T> nextAfter(final FieldAbsoluteDate<T> t) {
  384.         return t.shiftedBy(forward ? +Precision.EPSILON : -Precision.EPSILON);
  385.     }


  388.     /** Get the occurrence time of the event triggered in the current
  389.      * step.
  390.      * @return occurrence time of the event triggered in the current
  391.      * step.
  392.      */
  393.     public FieldAbsoluteDate<T> getEventDate() {
  394.         return pendingEventTime;
  395.     }

  397.     /**
  398.      * Try to accept the current history up to the given time.
  399.      *
  400.      * <p> It is not necessary to call this method before calling {@link
  401.      * #doEvent(FieldSpacecraftState)} with the same state. It is necessary to call this
  402.      * method before you call {@link #doEvent(FieldSpacecraftState)} on some other event
  403.      * detector.
  404.      *
  405.      * @param state        to try to accept.
  406.      * @param interpolator to use to find the new root, if any.
  407.      * @return if the event detector has an event it has not detected before that is on or
  408.      * before the same time as {@code state}. In other words {@code false} means continue
  409.      * on while {@code true} means stop and handle my event first.
  410.      */
  411.     public boolean tryAdvance(final FieldSpacecraftState<T> state,
  412.                               final FieldOrekitStepInterpolator<T> interpolator) {
  413.         final FieldAbsoluteDate<T> t = state.getDate();
  414.         // check this is only called before a pending event.
  415.         check(!pendingEvent || !strictlyAfter(pendingEventTime, t));

  417.         final boolean meFirst;

  419.         if (strictlyAfter(t, earliestTimeConsidered)) {
  420.             // just found an event and we know the next time we want to search again
  421.             meFirst = false;
  422.         } else {
  423.             // check g function to see if there is a new event
  424.             final T g = g(state);
  425.             final boolean positive = g.getReal() > 0;

  427.             if (positive == g0Positive) {
  428.                 // g function has expected sign
  429.                 g0 = g; // g0Positive is the same
  430.                 meFirst = false;
  431.             } else {
  432.                 // found a root we didn't expect -> find precise location
  433.                 final FieldAbsoluteDate<T> oldPendingEventTime = pendingEventTime;
  434.                 final boolean foundRoot = findRoot(interpolator, t0, g0, t, g);
  435.                 // make sure the new root is not the same as the old root, if one exists
  436.                 meFirst = foundRoot && !pendingEventTime.equals(oldPendingEventTime);
  437.             }
  438.         }

  440.         if (!meFirst) {
  441.             // advance t0 to the current time so we can't find events that occur before t
  442.             t0 = t;
  443.         }

  445.         return meFirst;
  446.     }

  448.     /**
  449.      * Notify the user's listener of the event. The event occurs wholly within this method
  450.      * call including a call to {@link FieldEventDetector#resetState(FieldSpacecraftState)}
  451.      * if necessary.
  452.      *
  453.      * @param state the state at the time of the event. This must be at the same time as
  454.      *              the current value of {@link #getEventDate()}.
  455.      * @return the user's requested action and the new state if the action is {@link
  456.      * Action#RESET_STATE}. Otherwise
  457.      * the new state is {@code state}. The stop time indicates what time propagation should
  458.      * stop if the action is {@link Action#STOP}.
  459.      * This guarantees the integration will stop on or after the root, so that integration
  460.      * may be restarted safely.
  461.      */
  462.     public EventOccurrence<T> doEvent(final FieldSpacecraftState<T> state) {
  463.         // check event is pending and is at the same time
  464.         check(pendingEvent);
  465.         check(state.getDate().equals(this.pendingEventTime));

  467.         final Action action = detector.eventOccurred(state, increasing == forward);
  468.         final FieldSpacecraftState<T> newState;
  469.         if (action == Action.RESET_STATE) {
  470.             newState = detector.resetState(state);
  471.         } else {
  472.             newState = state;
  473.         }
  474.         // clear pending event
  475.         pendingEvent     = false;
  476.         pendingEventTime = null;
  477.         // setup for next search
  478.         earliestTimeConsidered = afterEvent;
  479.         t0 = afterEvent;
  480.         g0 = afterG;
  481.         g0Positive = increasing;
  482.         // check g0Positive set correctly
  483.         check(g0.getReal() == 0.0 || g0Positive == (g0.getReal() > 0));
  484.         return new EventOccurrence<T>(action, newState, stopTime);
  485.     }

  487.     /**
  488.      * Shift a time value along the current integration direction: {@link #forward}.
  489.      *
  490.      * @param t     the time to shift.
  491.      * @param delta the amount to shift.
  492.      * @return t + delta if forward, else t - delta. If the result has to be rounded it
  493.      * will be rounded to be before the true value of t + delta.
  494.      */
  495.     private FieldAbsoluteDate<T> shiftedBy(final FieldAbsoluteDate<T> t, final T delta) {
  496.         if (forward) {
  497.             final FieldAbsoluteDate<T> ret = t.shiftedBy(delta);
  498.             if (ret.durationFrom(t).getReal() > delta.getReal()) {
  499.                 return ret.shiftedBy(-Precision.EPSILON);
  500.             } else {
  501.                 return ret;
  502.             }
  503.         } else {
  504.             final FieldAbsoluteDate<T> ret = t.shiftedBy(delta.negate());
  505.             if (t.durationFrom(ret).getReal() > delta.getReal()) {
  506.                 return ret.shiftedBy(+Precision.EPSILON);
  507.             } else {
  508.                 return ret;
  509.             }
  510.         }
  511.     }

  513.     /**
  514.      * Get the time that happens first along the current propagation direction: {@link
  515.      * #forward}.
  516.      *
  517.      * @param a first time
  518.      * @param b second time
  519.      * @return min(a, b) if forward, else max (a, b)
  520.      */
  521.     private FieldAbsoluteDate<T> minTime(final FieldAbsoluteDate<T> a, final FieldAbsoluteDate<T> b) {
  522.         return (forward ^ (a.compareTo(b) > 0)) ? a : b;
  523.     }

  525.     /**
  526.      * Check the ordering of two times.
  527.      *
  528.      * @param t1 the first time.
  529.      * @param t2 the second time.
  530.      * @return true if {@code t2} is strictly after {@code t1} in the propagation
  531.      * direction.
  532.      */
  533.     private boolean strictlyAfter(final FieldAbsoluteDate<T> t1, final FieldAbsoluteDate<T> t2) {
  534.         if (t1 == null || t2 == null) {
  535.             return false;
  536.         } else {
  537.             return forward ? t1.compareTo(t2) < 0 : t2.compareTo(t1) < 0;
  538.         }
  539.     }

  541.     /**
  542.      * Same as keyword assert, but throw a {@link MathRuntimeException}.
  543.      *
  544.      * @param condition to check
  545.      * @throws MathRuntimeException if {@code condition} is false.
  546.      */
  547.     private void check(final boolean condition) throws MathRuntimeException {
  548.         if (!condition) {
  549.             throw new OrekitInternalError(null);
  550.         }
  551.     }

  553.     /**
  554.      * Class to hold the data related to an event occurrence that is needed to decide how
  555.      * to modify integration.
  556.      */
  557.     public static class EventOccurrence<T extends RealFieldElement<T>> {

  559.         /** User requested action. */
  560.         private final Action action;
  561.         /** New state for a reset action. */
  562.         private final FieldSpacecraftState<T> newState;
  563.         /** The time to stop propagation if the action is a stop event. */
  564.         private final FieldAbsoluteDate<T> stopDate;

  566.         /**
  567.          * Create a new occurrence of an event.
  568.          *
  569.          * @param action   the user requested action.
  570.          * @param newState for a reset event. Should be the current state unless the
  571.          *                 action is {@link Action#RESET_STATE}.
  572.          * @param stopDate to stop propagation if the action is {@link Action#STOP}. Used
  573.          *                 to move the stop time to just after the root.
  574.          */
  575.         EventOccurrence(final Action action,
  576.                         final FieldSpacecraftState<T> newState,
  577.                         final FieldAbsoluteDate<T> stopDate) {
  578.             this.action = action;
  579.             this.newState = newState;
  580.             this.stopDate = stopDate;
  581.         }

  583.         /**
  584.          * Get the user requested action.
  585.          *
  586.          * @return the action.
  587.          */
  588.         public Action getAction() {
  589.             return action;
  590.         }

  592.         /**
  593.          * Get the new state for a reset action.
  594.          *
  595.          * @return the new state.
  596.          */
  597.         public FieldSpacecraftState<T> getNewState() {
  598.             return newState;
  599.         }

  601.         /**
  602.          * Get the new time for a stop action.
  603.          *
  604.          * @return when to stop propagation.
  605.          */
  606.         public FieldAbsoluteDate<T> getStopDate() {
  607.             return stopDate;
  608.         }

  610.     }

  612.     /**Get PendingEvent.
  613.      * @return if there is a pending event or not
  614.      * */

  616.     public boolean getPendingEvent() {
  617.         return pendingEvent;
  618.     }

  620. }
Created with JaCoCo 0.8.6.202009150832