EventSlopeFilter.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.  */

  18. package org.orekit.propagation.events;

  20. import java.util.Arrays;

  22. import org.orekit.propagation.SpacecraftState;
  23. import org.orekit.propagation.events.handlers.EventHandler;
  24. import org.orekit.time.AbsoluteDate;

  26. /** Wrapper used to detect only increasing or decreasing events.
  27.  *
  28.  * <p>This class is heavily based on the class EventFilter from the
  29.  * Hipparchus library. The changes performed consist in replacing
  30.  * raw types (double and double arrays) with space dynamics types
  31.  * ({@link AbsoluteDate}, {@link SpacecraftState}).</p>
  32.  *
  33.  * <p>General {@link EventDetector events} are defined implicitly
  34.  * by a {@link EventDetector#g(SpacecraftState) g function} crossing
  35.  * zero. This function needs to be continuous in the event neighborhood,
  36.  * and its sign must remain consistent between events. This implies that
  37.  * during an orbit propagation, events triggered are alternately events
  38.  * for which the function increases from negative to positive values,
  39.  * and events for which the function decreases from positive to
  40.  * negative values.
  41.  * </p>
  42.  *
  43.  * <p>Sometimes, users are only interested in one type of event (say
  44.  * increasing events for example) and not in the other type. In these
  45.  * cases, looking precisely for all events location and triggering
  46.  * events that will later be ignored is a waste of computing time.</p>
  47.  *
  48.  * <p>Users can wrap a regular {@link EventDetector event detector} in
  49.  * an instance of this class and provide this wrapping instance to
  50.  * a {@link org.orekit.propagation.Propagator}
  51.  * in order to avoid wasting time looking for uninteresting events.
  52.  * The wrapper will intercept the calls to the {@link
  53.  * EventDetector#g(SpacecraftState) g function} and to the {@link
  54.  * EventDetector#eventOccurred(SpacecraftState, boolean)
  55.  * eventOccurred} method in order to ignore uninteresting events. The
  56.  * wrapped regular {@link EventDetector event detector} will then see only
  57.  * the interesting events, i.e. either only {@code increasing} events or
  58.  * only {@code decreasing} events. The number of calls to the {@link
  59.  * EventDetector#g(SpacecraftState) g function} will also be reduced.</p>
  60.  * @see EventEnablingPredicateFilter
  61.  */

  63. public class EventSlopeFilter<T extends EventDetector> extends AbstractDetector<EventSlopeFilter<T>> {

  65.     /** Serializable UID. */
  66.     private static final long serialVersionUID = 20130409L;

  68.     /** Number of past transformers updates stored. */
  69.     private static final int HISTORY_SIZE = 100;

  71.     /** Wrapped event detector. */
  72.     private final T rawDetector;

  74.     /** Filter to use. */
  75.     private final FilterType filter;

  77.     /** Transformers of the g function. */
  78.     private final Transformer[] transformers;

  80.     /** Update time of the transformers. */
  81.     private final AbsoluteDate[] updates;

  83.     /** Indicator for forward integration. */
  84.     private boolean forward;

  86.     /** Extreme time encountered so far. */
  87.     private AbsoluteDate extremeT;

  89.     /** Wrap an {@link EventDetector event detector}.
  90.      * @param rawDetector event detector to wrap
  91.      * @param filter filter to use
  92.      */
  93.     public EventSlopeFilter(final T rawDetector, final FilterType filter) {
  94.         this(rawDetector.getMaxCheckInterval(), rawDetector.getThreshold(),
  95.              rawDetector.getMaxIterationCount(), new LocalHandler<T>(),
  96.              rawDetector, filter);
  97.     }

  99.     /** Private constructor with full parameters.
  100.      * <p>
  101.      * This constructor is private as users are expected to use the builder
  102.      * API with the various {@code withXxx()} methods to set up the instance
  103.      * in a readable manner without using a huge amount of parameters.
  104.      * </p>
  105.      * @param maxCheck maximum checking interval (s)
  106.      * @param threshold convergence threshold (s)
  107.      * @param maxIter maximum number of iterations in the event time search
  108.      * @param handler event handler to call at event occurrences
  109.      * @param rawDetector event detector to wrap
  110.      * @param filter filter to use
  111.      * @since 6.1
  112.      */
  113.     private EventSlopeFilter(final double maxCheck, final double threshold,
  114.                              final int maxIter, final EventHandler<? super EventSlopeFilter<T>> handler,
  115.                              final T rawDetector, final FilterType filter) {
  116.         super(maxCheck, threshold, maxIter, handler);
  117.         this.rawDetector  = rawDetector;
  118.         this.filter       = filter;
  119.         this.transformers = new Transformer[HISTORY_SIZE];
  120.         this.updates      = new AbsoluteDate[HISTORY_SIZE];
  121.     }

  123.     /** {@inheritDoc} */
  124.     @Override
  125.     protected EventSlopeFilter<T> create(final double newMaxCheck, final double newThreshold,
  126.                                          final int newMaxIter, final EventHandler<? super EventSlopeFilter<T>> newHandler) {
  127.         return new EventSlopeFilter<T>(newMaxCheck, newThreshold, newMaxIter, newHandler, rawDetector, filter);
  128.     }

  130.     /**  {@inheritDoc} */
  131.     public void init(final SpacecraftState s0,
  132.                      final AbsoluteDate t) {
  133.         super.init(s0, t);

  135.         // delegate to raw detector
  136.         rawDetector.init(s0, t);

  138.         // initialize events triggering logic
  139.         forward  = t.compareTo(s0.getDate()) >= 0;
  140.         extremeT = forward ? AbsoluteDate.PAST_INFINITY : AbsoluteDate.FUTURE_INFINITY;
  141.         Arrays.fill(transformers, Transformer.UNINITIALIZED);
  142.         Arrays.fill(updates, extremeT);

  144.     }

  146.     /**  {@inheritDoc} */
  147.     public double g(final SpacecraftState s) {

  149.         final double rawG = rawDetector.g(s);

  151.         // search which transformer should be applied to g
  152.         if (forward) {
  153.             final int last = transformers.length - 1;
  154.             if (extremeT.compareTo(s.getDate()) < 0) {
  155.                 // we are at the forward end of the history

  157.                 // check if a new rough root has been crossed
  158.                 final Transformer previous = transformers[last];
  159.                 final Transformer next     = filter.selectTransformer(previous, rawG, forward);
  160.                 if (next != previous) {
  161.                     // there is a root somewhere between extremeT and t.
  162.                     // the new transformer is valid for t (this is how we have just computed
  163.                     // it above), but it is in fact valid on both sides of the root, so
  164.                     // it was already valid before t and even up to previous time. We store
  165.                     // the switch at extremeT for safety, to ensure the previous transformer
  166.                     // is not applied too close of the root
  167.                     System.arraycopy(updates,      1, updates,      0, last);
  168.                     System.arraycopy(transformers, 1, transformers, 0, last);
  169.                     updates[last]      = extremeT;
  170.                     transformers[last] = next;
  171.                 }

  173.                 extremeT = s.getDate();

  175.                 // apply the transform
  176.                 return next.transformed(rawG);

  178.             } else {
  179.                 // we are in the middle of the history

  181.                 // select the transformer
  182.                 for (int i = last; i > 0; --i) {
  183.                     if (updates[i].compareTo(s.getDate()) <= 0) {
  184.                         // apply the transform
  185.                         return transformers[i].transformed(rawG);
  186.                     }
  187.                 }

  189.                 return transformers[0].transformed(rawG);

  191.             }
  192.         } else {
  193.             if (s.getDate().compareTo(extremeT) < 0) {
  194.                 // we are at the backward end of the history

  196.                 // check if a new rough root has been crossed
  197.                 final Transformer previous = transformers[0];
  198.                 final Transformer next     = filter.selectTransformer(previous, rawG, forward);
  199.                 if (next != previous) {
  200.                     // there is a root somewhere between extremeT and t.
  201.                     // the new transformer is valid for t (this is how we have just computed
  202.                     // it above), but it is in fact valid on both sides of the root, so
  203.                     // it was already valid before t and even up to previous time. We store
  204.                     // the switch at extremeT for safety, to ensure the previous transformer
  205.                     // is not applied too close of the root
  206.                     System.arraycopy(updates,      0, updates,      1, updates.length - 1);
  207.                     System.arraycopy(transformers, 0, transformers, 1, transformers.length - 1);
  208.                     updates[0]      = extremeT;
  209.                     transformers[0] = next;
  210.                 }

  212.                 extremeT = s.getDate();

  214.                 // apply the transform
  215.                 return next.transformed(rawG);

  217.             } else {
  218.                 // we are in the middle of the history

  220.                 // select the transformer
  221.                 for (int i = 0; i < updates.length - 1; ++i) {
  222.                     if (s.getDate().compareTo(updates[i]) <= 0) {
  223.                         // apply the transform
  224.                         return transformers[i].transformed(rawG);
  225.                     }
  226.                 }

  228.                 return transformers[updates.length - 1].transformed(rawG);

  230.             }
  231.         }

  233.     }

  235.     /** Local handler. */
  236.     private static class LocalHandler<T extends EventDetector> implements EventHandler<EventSlopeFilter<T>> {

  238.         /** {@inheritDoc} */
  239.         public Action eventOccurred(final SpacecraftState s, final EventSlopeFilter<T> ef, final boolean increasing) {
  240.             return ef.rawDetector.eventOccurred(s, ef.filter.getTriggeredIncreasing());
  241.         }

  243.         /** {@inheritDoc} */
  244.         @Override
  245.         public SpacecraftState resetState(final EventSlopeFilter<T> ef, final SpacecraftState oldState) {
  246.             return ef.rawDetector.resetState(oldState);
  247.         }

  249.     }

  251. }
Created with JaCoCo 0.8.2.201808211720