Pkg.file.sort: def of ezx@1.11.0.0
Import: import ezx@1.11.0.0/src/pkg/pkg.bend as Pkg
Lines 571-581 of ezx@1.11.0.0/src/pkg/pkg.bend: https://jend.leeeet.dev/read.txt?path=ezx@1.11.0.0/src/pkg/pkg.bend&start_line=571&end_line=581

import Base

# a file list in path order. Insertion rather than Base's `List.sort`: that one
# is a fuelled bottom-up merge sort, whose recursion Bend cannot check, so it
# is reported as unsafe and every proof downstream of it inherits the report.
# An insertion sort shrinks its list at every step, so Bend checks it, and a
# package's file set is small enough that the cost is not felt.
def file.sort(fs: List<&2, Item>) -> List<&2, Item>:
  match fs:
    case []:
      []
    case Con{+h, t}:
      file.ins(file.sort(t), h)

Uses (3):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=ezx@1.11.0.0/src/pkg/pkg.bend&name=Item
  https://jend.leeeet.dev/definition.txt?path=ezx@1.11.0.0/src/pkg/pkg.bend&name=file.ins