def search_choice

bend-collections@1.0.0.0 · src/containers/internal/intrusive_list.bend:182

import Base
import bend-collections@1.0.0.0/src/containers/types/intrusive_doubly_linked_list.bend as E

182def search_choice(~S: Type, ~N: Data, ~next: S -> N -> S & Maybe<&2, N>, s: S, +node: N, +hit: Bool) -> S & E.Search<N>:
183  match hit:
184    case True{}: (s, E.Found{node})
185    case False{}: search_next(~S, ~N, ~next, s, node)