Scheduled Real Trigger
Scheduled Real Trigger is a direct subtype of Timed Real Trigger
aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa aaaaaaaa
with functions Scheduled Real Trigger Functions, keys Scheduled Real Trigger keys and example object SchedRealTrig
TYPE INCLUSION RELATIONSHIPS
AVAILABLE FUNCTIONS
AVAILABLE CREATE FUNCTION KEYS
TYPICAL OBJECTS OF TYPE Scheduled Real Trigger
This type represents a predicate function ƒ that maps a sequence d , x₁ , x₂ , ... , xᵤ consisting of any allowed date d followed by u real variables (i.e. single numbers) x₁ , x₂ , ... , xᵤ into one boolean variable and constructed (see details below) with the help of r predicate functions ƒ₁ , ƒ₂ , ... , ƒᵣ, each of which maps the same u real variables x₁ , x₂ , ... , xᵤ into one boolean variable.
Schematically:
ƒ: (d , x₁, x₂, ... , xᵤ) → (b)
where d is date, b is a boolean and all other variables are numbers.
The predicate functions ƒ₁ , ƒ₂ , ... , ƒᵣ are expected to be objects of which the type is a subtype of Real Trigger
The date d can be any date.
The date d is generally allowed only if it belongs to the set of dates implied by the Schedule object defined through the key Schedule
There exist two cases regarding the specification of that Schedule object defined through the key Schedule
Case 1: The Schedule object is specified.
Then that object implies a sequence of n dates d₁ , d₂ , ... , dₙ, with n not necessarily the same with the number of predicate functions r.
If d ∉ d₁ , d₂ , ... , dₙ, the predicate function ƒ(d , x₁, x₂, ... , xᵤ) returns immediately FALSE without being valuated.
Otherwise, a correspondence is established between the dates d₁ , d₂ , ... , dₙ and the predicate functions ƒ₁ , ƒ₂ , ... , ƒᵣ so that d₁ corresponds to ƒ₁, d₂ to ƒ₂ and so on.
If there exist more dates than predicate functions, i.e. if n > r, all non-paired dates are forced to correspond to the last predicate function ƒᵣ
Formally: If n > r then dᵢ → ƒᵣ for all i > r
If there exist fewer dates than predicate functions, i.e. if n < r, all non-paired predicate functions beyond the ƒₙ are ignored.
Formally: If n < r then ƒᵢ is ignored for all i > n
Case 2: The Schedule object is not specified.
Then the predicate function ƒ(d , x₁, x₂, ... , xᵤ) is always valuated for any given date d
In this trivial case, only one predicate function suffices, which means that only the predicate function ƒ₁ is used and the remaining predicate functions - if any - ƒ₂ , ... , ƒᵣ are ignored.