Documentation

Cedar.Validation.Linker

This file implements linker that links two partial schemas (RFC 116).

Instances For
    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      Equations
      Instances For
        @[instance_reducible]
        Equations
        • One or more equations did not get rendered due to their size.

        One round of closure, which adds the current ancestors of every member. The result is well-formed when every set in m is.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For

          At most n rounds of closure, stopping as soon as a round changes nothing. Each round looks up ancestors in the previous round's map, so reach doubles and the closure is reached after logarithmically many rounds; the key count closeAncestors passes is a far looser bound.

          Equations
          Instances For
            def Cedar.Validation.closeAncestors {α : Type u_1} [LT α] [DecidableLT α] [DecidableEq α] (parents : Data.Map α (Data.Set α)) :

            Close each set of parents under the parent relation, so it holds all ancestors. The number of keys bounds the rounds needed.

            Equations
            Instances For
              def Cedar.Validation.linkMaps {α : Type u_1} {β : Type (max u_2 u_1)} [LT α] [DecidableLT α] [DecidableEq α] (f : α → β → β → Except LinkError β) (m₁ m₂ : Data.Map α β) :

              Entity names from both first and second are linked. Entity names appearing in only one of them are appended.

              Equations
              • One or more equations did not get rendered due to their size.
              Instances For