Queue.pop.rot: def of bend-lawful-stdlib@0.1.0.0
Import: import bend-lawful-stdlib@0.1.0.0/src/queue.bend as Queue
Lines 32-38 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=32&end_line=38

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

# front is empty; f is the reversed rear
def pop.rot(-A: Data, f: List<&2, A>) -> List.Step<&1, A, Queue<A>>:
  match f:
    case Nil{}:
      List.Stop{}
    case h <> t:
      List.Next{h, Queue{t, Nil{}}}

Uses (3):
  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