Queue.pop.model: def of bend-lawful-stdlib@0.1.0.0
Import: import bend-lawful-stdlib@0.1.0.0/src/queue.bend as Queue
Lines 47-53 of bend-lawful-stdlib@0.1.0.0/src/queue.bend: https://jend.leeeet.dev/read.txt?path=bend-lawful-stdlib@0.1.0.0/src/queue.bend&start_line=47&end_line=53

import Base
import bend-lawful-stdlib@0.1.0.0/src/list.bend as List

# pop's result with the remaining queue replaced by its model
def pop.model(-A: Data, s: List.Step<&1, A, Queue<A>>) -> List.Step<&2, A, List<&2, A>>:
  match s:
    case List.Stop{}:
      List.Stop{}
    case List.Next{x, q}:
      List.Next{x, model(A, q)}

Uses (4):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/list.bend&name=Step
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/queue.bend&name=Queue
  https://jend.leeeet.dev/definition.txt?path=bend-lawful-stdlib@0.1.0.0/src/queue.bend&name=model