IntrusiveList.search_choice: def of bend-collections@1.0.0.0
Import: import bend-collections@1.0.0.0/src/containers/internal/intrusive_list.bend as IntrusiveList
Lines 182-185 of bend-collections@1.0.0.0/src/containers/internal/intrusive_list.bend: https://jend.leeeet.dev/read.txt?path=bend-collections@1.0.0.0/src/containers/internal/intrusive_list.bend&start_line=182&end_line=185

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

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

Uses (6):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Sigma
  https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/internal/intrusive_list.bend&name=search_next
  https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/types/intrusive_doubly_linked_list.bend&name=Search