bend-kit-scheduler

Releases (5)

• 0.4.1.0 indexed
• 0.4.0.0 unindexed
• 0.3.0.0 unindexed
• 0.2.0.0 unindexed
• 0.1.0.0 unindexed

Definitions (126)

queue_proof.bend

• def requeue_ordered.found
• def requeue_counter.found

recurrence.bend

• type Missed
• type Cadence
• type Plan
• def replay
• def next
• def ticksGenerate only the bounded replay prefix, never the skipped remainder.
• def limit
• def rateA tick equal to completion is overdue.
• def positive
• def planNone is an explicit invalid-zero-period result, not a zero cadence.

recurrence_laws.bend

• law invalid_zero
• law fixed_delay
• law fixed_rate_skipThese equations specify named policies, phase anchoring, and exact replay prefix.
• law fixed_rate_catch_up
• law replay_bounded
• law future_deadlineEvery positive planner branch returns a deadline strictly beyond completion.
• law last_dueThe last skipped/replayed rate tick is not in the future (when the previous scheduled tick has completed).
• law no_wrappingAddition is monotone on arbitrary Nat: deadlines never wrap below their origin.
• law replay_tick_dueFor any one-based index in the exact replay prefix, its anchored tick is due.
• law accepted_positiveExposed validation entry point is connected to the planner used by safety laws.

recurrence_proof.bend

• def ticks_length
• def quotient_future
• def fixed_rate_future
• def due_tick