def split_cons

bend-collections-laws-math@1.0.0.0 · src/containers/deque.bend:26

import Base

26# One split traversal; keep the near half, reverse the far half.
27def split_cons(~T: Data, x: T, r: List<&2, T> & List<&2, T>) -> List<&2, T> & List<&2, T>:
28  (keep, moved) = r
29  (Con{x, keep}, moved)