LAWS.pop_respects_limit: law of bend-kube-runtime@0.2.0.0
Import: import bend-kube-runtime@0.2.0.0/LAWS.bend as LAWS
Lines 154-167 of bend-kube-runtime@0.2.0.0/LAWS.bend: https://jend.leeeet.dev/read.txt?path=bend-kube-runtime@0.2.0.0/LAWS.bend&start_line=154&end_line=167

import Base
import bend-kube-runtime@0.2.0.0/src/queue.bend as Q

# No key starts while every worker slot is taken.
law pop_respects_limit:
  for f: List<&2, String>
  for b: List<&2, String>
  for inq: Map<&2, U32>
  for run: Map<&2, U32>
  for d: Map<&2, U32>
  for g: Map<&2, U32>
  for fl: Map<&2, U32>
  for n: U32
  for mx: U32
  for full: {U32.is_lt(n, mx) == False{} : Bool}
  {Q.Queue.pop(Q.Queue{f, b, inq, run, d, g, fl, n, mx})
    == (Q.Queue{f, b, inq, run, d, g, fl, n, mx}, None{}) : Q.Queue & Maybe<&2, String>}

Uses (14):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Equal.sym
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Map
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Sigma
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=String
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.is_lt
  https://jend.leeeet.dev/definition.txt?path=bend-kube-runtime@0.2.0.0/PROOF.bend&name=Proof.pop_full
  https://jend.leeeet.dev/definition.txt?path=bend-kube-runtime@0.2.0.0/src/queue.bend&name=Queue
  https://jend.leeeet.dev/definition.txt?path=bend-kube-runtime@0.2.0.0/src/queue.bend&name=Queue.pop
  https://jend.leeeet.dev/definition.txt?path=bend-kube-runtime@0.2.0.0/src/queue.bend&name=Queue.pop.go