public interface Arrivals
ArrivalsHeadwayGenerator. Arrivals are defined as a piece-wise linear frequency over
 time.
 
 Copyright (c) 2013-2017 Delft University of Technology, PO Box 5, 2600 AA, Delft, the Netherlands. All rights reserved. 
 BSD-style license. See OpenTrafficSim License.
 
| Modifier and Type | Method and Description | 
|---|---|
org.djunits.value.vdouble.scalar.Frequency | 
getFrequency(org.djunits.value.vdouble.scalar.Time time,
            boolean sliceStart)
Returns the demand at given time, which may be the sum of child objects. 
 | 
org.djunits.value.vdouble.scalar.Time | 
nextTimeSlice(org.djunits.value.vdouble.scalar.Time time)
Returns the start time of the next time slice after the given time or  
null if no such slice exists. | 
org.djunits.value.vdouble.scalar.Frequency getFrequency(org.djunits.value.vdouble.scalar.Time time,
                                                        boolean sliceStart)
sliceStart is used to resolve
 the value at a time slice boundary in case of a stepwise (discontinuous) demand pattern. If sliceStart = true and
 time is a slice boundary, the demand value for after the slice boundary should be returned. In that case,
 the caller is processing a time slice after time, hence it's the slice start. If sliceStart = false the
 demand value of before the slice boundary should be returned. For continuous demand patterns, sliceStart can be
 ignored.time - Time; simulation timesliceStart - boolean; whether the time is at the start of an arbitrary time sliceorg.djunits.value.vdouble.scalar.Time nextTimeSlice(org.djunits.value.vdouble.scalar.Time time)
null if no such slice exists. The next time
 slice starts as soon as the current slice ends, where each slice has it's own linear (or constant) demand. Thus, any
 change of slope in the demand pattern initiates a new slice. If time is equal to a time slice boundary, the next
 value should be returned.time - Time; time after which the first slice start time is requestednull if no such slice existsCopyright © 2014–2018 Delft University of Technology. All rights reserved.