RecurrenceLaws.accepted_positive: law of bend-kit-scheduler@0.4.1.0
Import: import bend-kit-scheduler@0.4.1.0/recurrence_laws.bend as RecurrenceLaws
Lines 83-90 of bend-kit-scheduler@0.4.1.0/recurrence_laws.bend: https://jend.leeeet.dev/read.txt?path=bend-kit-scheduler@0.4.1.0/recurrence_laws.bend&start_line=83&end_line=90

import Base
import bend-kit-scheduler@0.4.1.0/recurrence.bend as R

# Exposed validation entry point is connected to the planner used by safety laws.
law accepted_positive:
  for +previous: Nat
  for +completion: Nat
  for +p: Nat
  for +cadence: R.Cadence
  {R.plan(previous, completion, 1n+p, cadence) ==
    Some{R.positive(cadence, previous, completion, 1n+p)} : Maybe<&2, R.Plan>}

Uses (6):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=bend-kit-scheduler@0.4.1.0/recurrence.bend&name=Cadence
  https://jend.leeeet.dev/definition.txt?path=bend-kit-scheduler@0.4.1.0/recurrence.bend&name=Plan
  https://jend.leeeet.dev/definition.txt?path=bend-kit-scheduler@0.4.1.0/recurrence.bend&name=plan
  https://jend.leeeet.dev/definition.txt?path=bend-kit-scheduler@0.4.1.0/recurrence.bend&name=positive