IntrusiveDoublyLinkedList.count: def of bend-collections@1.0.0.0
Import: import bend-collections@1.0.0.0/src/containers/intrusive_doubly_linked_list.bend as IntrusiveDoublyLinkedList
Lines 77-79 of bend-collections@1.0.0.0/src/containers/intrusive_doubly_linked_list.bend: https://jend.leeeet.dev/read.txt?path=bend-collections@1.0.0.0/src/containers/intrusive_doubly_linked_list.bend&start_line=77&end_line=79

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

# Count matching values; read next after each predicate. O(n).
def count(~S: Type, ~N: Data, ~V: Data, ~C: Data, ~H: Data, ~get_head: S -> H -> S & Maybe<&2, N>, ~next: S -> N -> S & Maybe<&2, N>, ~value: S -> N -> S & V, ~pred: S -> C -> V -> S & Bool, +fuel: Nat, s: S, +h: H, +c: C) -> S & Result<&2, &1, E.Error, Nat>:
  Impl.count(~S, ~N, ~V, ~C, ~H, ~get_head, ~next, ~value, ~pred, fuel, s, h, c)

Uses (7):
  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=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Result
  https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/internal/intrusive_list.bend&name=count
  https://jend.leeeet.dev/definition.txt?path=bend-collections@1.0.0.0/src/containers/types/intrusive_doubly_linked_list.bend&name=Error