DynamicArray.cons_some: def of bend-collections@1.0.0.0
Import: import bend-collections@1.0.0.0/src/containers/dynamic_array.bend as DynamicArray
Lines 193-202 of bend-collections@1.0.0.0/src/containers/dynamic_array.bend: https://jend.leeeet.dev/read.txt?path=bend-collections@1.0.0.0/src/containers/dynamic_array.bend&start_line=193&end_line=202

import Base

# to_list walks the occupied slots BY INDEX, newest first, and conses them:
# the walk gives the array back, so nothing is cloned, and a `Base.Array` is
# never matched structurally (that destroys the flat representation, see
# docs/VALIDATION.md).
def cons_some(-T: Data, x: Maybe<&2, T>, acc: List<&2, T>) -> List<&2, T>:
  match x:
    case None{}:
      acc
    case Some{v}:
      Con{v, acc}

Uses (2):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe