QueuePolicy.admit.inputs: def of mylsm-lsm-store@0.6.0.1
Import: import mylsm-lsm-store@0.6.0.1/src/coordinator/QueuePolicy.bend as QueuePolicy
Lines 40-54 of mylsm-lsm-store@0.6.0.1/src/coordinator/QueuePolicy.bend: https://jend.leeeet.dev/read.txt?path=mylsm-lsm-store@0.6.0.1/src/coordinator/QueuePolicy.bend&start_line=40&end_line=54

import Base

def admit.inputs(
  count: Nat,
  queued_pair: Nat & Nat,
  request_pair: Nat & Nat,
  max_queue_bytes: Nat,
  within_request_limit: Bool,
  within_count: Bool
) -> Decision:
  match queued_pair:
    case (queued_check, queued_output):
      match request_pair:
        case (request_check, request_output):
          admit.decision(count, within_request_limit, within_count,
            admit.total.pair(Nat.add(queued_check, request_check),
              Nat.add(queued_output, request_output), max_queue_bytes))

Uses (8):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.add
  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=mylsm-lsm-store@0.6.0.1/src/coordinator/QueuePolicy.bend&name=Decision
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/coordinator/QueuePolicy.bend&name=admit.decision
  https://jend.leeeet.dev/definition.txt?path=mylsm-lsm-store@0.6.0.1/src/coordinator/QueuePolicy.bend&name=admit.total.pair