Organizes geometries over arbitrary defined time steps. More...

Organizes geometries over arbitrary defined time steps.

Manages the geometries of a data object for each time step.

Organizes geometries over proportional time steps.

For this TimeGeometry implementation it is assumed that the durations of the time steps are arbitrary and may differ. The geometries of the time steps are independent, and not linked to each other. Since the timeBounds of the geometries are different for each time step it is not possible to set the same geometry to different time steps. Instead copies should be used.

Remarks: The lower time bound of a succeeding time step may not be smaller or equal to the lower time bound of its predecessor. Thus the list of time points is always sorted by its lower time bounds.; For the conversion between time step and time point the following assumption is used.:
time step -> time point: time point is the lower time bound of the geometry indicated by step.
time point -> time step: associated time step is last step which lower time bound is smaller or equal then the time point.

For this TimeGeometry implementation it is assumed that the durations of the time steps are equidistant, e.g. the durations of the time steps in one ProportionalTimeGeometry are the same. The geometries of the time steps are independent, and not linked to each other. Since the timeBounds of the geometries are different for each time step it is not possible to set the same geometry to different time steps. Instead copies should be used.

This class is an abstract class. The concrete implementation depends on the way the different time steps are managed.

The time is defined either by a time step or a time point. Time steps are non-negativ integers starting from 0. A time point is is a ScalarType value which gives the passed time since start in ms. Be aware that the starting point is not fixed so it is possible that the same time point defines two different time depending on the start time of the used time geometry.