src/containers/internal/intrusive_list.bend checks

raw source on the hub · import 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/internal/intrusive_list.bend as Intrusive_list

Generated by tools/generators/intrusive_list.py; edit that source.

2 imports

import Base
import ../types/intrusive_doubly_linked_list.bend as E

Templates

template next source · line 29 · raw

@-S:Type -> @-N:Data -> @-next_of:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @s:S -> @+node:N -> Pair(S, Maybe<&2, N>)

template prev source · line 34 · raw

@-S:Type -> @-N:Data -> @-prev_of:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @s:S -> @+node:N -> Pair(S, Maybe<&2, N>)

template value source · line 39 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-value_of:(@_:S -> @_:N -> Pair(S, V)) -> @s:S -> @+node:N -> Pair(S, V)

template get_head source · line 44 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @s:S -> @+h:H -> Pair(S, Maybe<&2, N>)

template write_next source · line 47 · raw

@-S:Type -> @-N:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @s:S -> @+at:Maybe<&2, N> -> @+node:Maybe<&2, N> -> S

template write_prev source · line 52 · raw

@-S:Type -> @-N:Data -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @s:S -> @+at:Maybe<&2, N> -> @+node:Maybe<&2, N> -> S

template remove_left source · line 57 · raw

@-S:Type -> @-N:Data -> @-I:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @s:S -> @+i:I -> @+node:N -> @+before:Maybe<&2, N> -> @+after:Maybe<&2, N> -> S

template remove_3 source · line 64 · raw

@-S:Type -> @-N:Data -> @-I:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @+i:I -> @+node:N -> @+after:Maybe<&2, N> -> @+before:Maybe<&2, N> -> @s:S -> S

template remove_2 source · line 67 · raw

@-S:Type -> @-N:Data -> @-I:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @+i:I -> @+node:N -> @+after:Maybe<&2, N> -> @r:Pair(S, Maybe<&2, N>) -> S

template remove_1 source · line 71 · raw

@-S:Type -> @-N:Data -> @-I:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @+i:I -> @+node:N -> @r:Pair(S, Maybe<&2, N>) -> S

template remove source · line 78 · raw

@-S:Type -> @-N:Data -> @-I:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @s:S -> @+i:I -> @+node:N -> S

template prepend_as_3 source · line 81 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-I:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head_nonempty:(@_:S -> @_:I -> @_:N -> S) -> @+i:I -> @+node:N -> @s:S -> S

template prepend_as_2 source · line 84 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-I:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head_nonempty:(@_:S -> @_:I -> @_:N -> S) -> @+i:I -> @+node:N -> @+head:Maybe<&2, N> -> @s:S -> S

template prepend_as_1 source · line 87 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-I:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head_nonempty:(@_:S -> @_:I -> @_:N -> S) -> @+i:I -> @+node:N -> @r:Pair(S, Maybe<&2, N>) -> S

template prepend_as source · line 94 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-I:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head_nonempty:(@_:S -> @_:I -> @_:N -> S) -> @s:S -> @+h:H -> @+i:I -> @+node:N -> S

template prepend source · line 99 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head_nonempty:(@_:S -> @_:H -> @_:N -> S) -> @s:S -> @+h:H -> @+node:N -> S

template empty_result source · line 102 · raw

@-S:Type -> @-N:Data -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Bool)

template nonempty_result source · line 106 · raw

@-S:Type -> @-N:Data -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Bool)

template is_empty source · line 112 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @s:S -> @+h:H -> Pair(S, Bool)

template non_empty source · line 117 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @s:S -> @+h:H -> Pair(S, Bool)

template two_head source · line 120 · raw

@-S:Type -> @-N:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @s:S -> @+head:Maybe<&2, N> -> Pair(S, Bool)

template at_least_two_1 source · line 125 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Bool)

template at_least_two source · line 131 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @s:S -> @+h:H -> Pair(S, Bool)

template fold_step_3 source · line 136 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-A:Type -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:A -> @_:V -> Pair(S, A)) -> @+after:Maybe<&2, N> -> @r:Pair(S, A) -> Pair(S, Pair(Maybe<&2, N>, A))

template fold_step_2 source · line 140 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-A:Type -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:A -> @_:V -> Pair(S, A)) -> @+c:C -> @acc:A -> @+after:Maybe<&2, N> -> @r:Pair(S, V) -> Pair(S, Pair(Maybe<&2, N>, A))

template fold_step_1 source · line 144 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-A:Type -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:A -> @_:V -> Pair(S, A)) -> @+node:N -> @+c:C -> @acc:A -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Pair(Maybe<&2, N>, A))

template fold_step source · line 148 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-A:Type -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:A -> @_:V -> Pair(S, A)) -> @s:S -> @+node:N -> @+c:C -> @acc:A -> Pair(S, Pair(Maybe<&2, N>, A))

template fold_loop source · line 151 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-A:Type -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:A -> @_:V -> Pair(S, A)) -> @+fuel:Nat -> @+c:C -> @r:Pair(S, Pair(Maybe<&2, N>, A)) -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, A>)

template fold_left_1 source · line 158 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-A:Type -> @-C:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:A -> @_:V -> Pair(S, A)) -> @+fuel:Nat -> @+c:C -> @acc:A -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, A>)

template fold_left source · line 164 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-A:Type -> @-C:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:A -> @_:V -> Pair(S, A)) -> @+fuel:Nat -> @s:S -> @+h:H -> @+c:C -> @acc:A -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, A>)

template visit_fold source · line 167 · raw

@-S:Type -> @-V:Data -> @-C:Data -> @-fn:(@_:S -> @_:C -> @_:V -> S) -> @s:S -> @+c:C -> @unit:Unit -> @+v:V -> Pair(S, Unit)

template foreach source · line 172 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:V -> S) -> @+fuel:Nat -> @s:S -> @+h:H -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template search_next_1 source · line 175 · raw

@-S:Type -> @-N:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Search<N>)

template search_next source · line 179 · raw

@-S:Type -> @-N:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @s:S -> @+node:N -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Search<N>)

template search_choice source · line 182 · raw

@-S:Type -> @-N:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @s:S -> @+node:N -> @+hit:Bool -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Search<N>)

template search_step_2 source · line 187 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @+node:N -> @r:Pair(S, Bool) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Search<N>)

template search_step_1 source · line 191 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @+node:N -> @+c:C -> @r:Pair(S, V) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Search<N>)

template search_step source · line 195 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @s:S -> @+node:N -> @+c:C -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Search<N>)

template search_loop source · line 198 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @+fuel:Nat -> @+c:C -> @r:Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Search<N>) -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Maybe<&2, N>>)

template find_1 source · line 206 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @+fuel:Nat -> @+c:C -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Maybe<&2, N>>)

template find source · line 212 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @+fuel:Nat -> @s:S -> @+h:H -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Maybe<&2, N>>)

template find_some_this source · line 217 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @+fuel:Nat -> @s:S -> @+h:H -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Maybe<&2, N>>)

template search_bool source · line 220 · raw

@-S:Type -> @-N:Data -> @+negate:Bool -> @r:Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Maybe<&2, N>>) -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Bool>)

template exists source · line 228 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @+fuel:Nat -> @s:S -> @+h:H -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Bool>)

template negated_result source · line 231 · raw

@-S:Type -> @r:Pair(S, Bool) -> Pair(S, Bool)

template negated_pred source · line 235 · raw

@-S:Type -> @-V:Data -> @-C:Data -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @s:S -> @+c:C -> @+v:V -> Pair(S, Bool)

template forall source · line 240 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @+fuel:Nat -> @s:S -> @+h:H -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Bool>)

template count_pick source · line 243 · raw

@-S:Type -> @+count:Nat -> @r:Pair(S, Bool) -> Pair(S, Nat)

template count_step_3 source · line 248 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @+acc:Nat -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Pair(Maybe<&2, N>, Nat))

template count_step_2 source · line 252 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @+node:N -> @r:Pair(S, Nat) -> Pair(S, Pair(Maybe<&2, N>, Nat))

template count_step_1 source · line 256 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @+node:N -> @+c:C -> @+acc:Nat -> @r:Pair(S, V) -> Pair(S, Pair(Maybe<&2, N>, Nat))

template count_step source · line 260 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @s:S -> @+node:N -> @+c:C -> @+acc:Nat -> Pair(S, Pair(Maybe<&2, N>, Nat))

template count_loop source · line 263 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @+fuel:Nat -> @+c:C -> @r:Pair(S, Pair(Maybe<&2, N>, Nat)) -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Nat>)

template count_1 source · line 270 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @+fuel:Nat -> @+c:C -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Nat>)

template count source · line 276 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @+fuel:Nat -> @s:S -> @+h:H -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Nat>)

template node_value source · line 279 · raw

@-S:Type -> @-N:Data -> @s:S -> @+n:N -> Pair(S, N)

template count_node source · line 282 · raw

@-S:Type -> @-N:Data -> @s:S -> @c:Unit -> @+acc:Nat -> @+node:N -> Pair(S, Nat)

template length source · line 287 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @+fuel:Nat -> @s:S -> @+h:H -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Nat>)

template converted_pred_result source · line 290 · raw

@-S:Type -> @-V:Data -> @-D:Data -> @-C:Data -> @-convert:(@_:S -> @_:V -> Pair(S, Maybe<&2, D>)) -> @-pred:(@_:S -> @_:C -> @_:D -> Pair(S, Bool)) -> @+c:C -> @r:Pair(S, Maybe<&2, D>) -> Pair(S, Bool)

template converted_pred source · line 295 · raw

@-S:Type -> @-V:Data -> @-D:Data -> @-C:Data -> @-convert:(@_:S -> @_:V -> Pair(S, Maybe<&2, D>)) -> @-pred:(@_:S -> @_:C -> @_:D -> Pair(S, Bool)) -> @s:S -> @+c:C -> @+v:V -> Pair(S, Bool)

template find_convert source · line 300 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-D:Data -> @-C:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-convert:(@_:S -> @_:V -> Pair(S, Maybe<&2, D>)) -> @-pred:(@_:S -> @_:C -> @_:D -> Pair(S, Bool)) -> @+fuel:Nat -> @s:S -> @+h:H -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Maybe<&2, N>>)

template equal_value source · line 303 · raw

@-S:Type -> @-V:Data -> @-eq:(@_:V -> @_:V -> Bool) -> @s:S -> @+wanted:V -> @+v:V -> Pair(S, Bool)

template find_value source · line 308 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-eq:(@_:V -> @_:V -> Bool) -> @+fuel:Nat -> @s:S -> @+h:H -> @+wanted:V -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Maybe<&2, N>>)

template equal_converted_value source · line 311 · raw

@-S:Type -> @-V:Data -> @-eq:(@_:V -> @_:V -> Bool) -> @s:S -> @+wanted:V -> @+v:V -> Pair(S, Bool)

template find_value_convert source · line 316 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-D:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-convert:(@_:S -> @_:V -> Pair(S, Maybe<&2, D>)) -> @-eq:(@_:D -> @_:D -> Bool) -> @+fuel:Nat -> @s:S -> @+h:H -> @+wanted:D -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Maybe<&2, N>>)

template clear_step_3 source · line 319 · raw

@-S:Type -> @-N:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+after:Maybe<&2, N> -> @s:S -> Pair(S, Maybe<&2, N>)

template clear_step_2 source · line 322 · raw

@-S:Type -> @-N:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+node:N -> @+c:C -> @+after:Maybe<&2, N> -> @s:S -> Pair(S, Maybe<&2, N>)

template clear_step_1 source · line 325 · raw

@-S:Type -> @-N:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+node:N -> @+c:C -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Maybe<&2, N>)

template clear_step source · line 329 · raw

@-S:Type -> @-N:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @s:S -> @+node:N -> @+c:C -> Pair(S, Maybe<&2, N>)

template clear_loop source · line 332 · raw

@-S:Type -> @-N:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+fuel:Nat -> @+head:N -> @+c:C -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template clear_head source · line 340 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+fuel:Nat -> @s:S -> @+h:H -> @+i:I -> @+c:C -> @+head:Maybe<&2, N> -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template chain_fits source · line 347 · raw

@-S:Type -> @-N:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @+fuel:Nat -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Bool)

template clear_checked source · line 354 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+fuel:Nat -> @+h:H -> @+i:I -> @+c:C -> @+head:Maybe<&2, N> -> @r:Pair(S, Bool) -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template clear_list_as_1 source · line 360 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+fuel:Nat -> @+h:H -> @+i:I -> @+c:C -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template clear_list_as source · line 367 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+fuel:Nat -> @s:S -> @+h:H -> @+i:I -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template clear_list source · line 372 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:H -> @_:Maybe<&2, N> -> S) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+fuel:Nat -> @s:S -> @+h:H -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template ignore_removed source · line 375 · raw

@-S:Type -> @-C:Data -> @-N:Data -> @s:S -> @+c:C -> @+node:N -> S

template clear_list_with_pool_as source · line 381 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+fuel:Nat -> @s:S -> @+h:H -> @+i:I -> @+pool:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template clear_list_with_pool source · line 386 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:H -> @_:Maybe<&2, N> -> S) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+fuel:Nat -> @s:S -> @+h:H -> @+pool:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template unlink_nonhead_links source · line 391 · raw

@-S:Type -> @-N:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @s:S -> @+node:N -> @+before:Maybe<&2, N> -> @+after:Maybe<&2, N> -> Pair(S, Bool)

template unlink_nonhead_2 source · line 397 · raw

@-S:Type -> @-N:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @+node:N -> @+after:Maybe<&2, N> -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Bool)

template unlink_nonhead_1 source · line 401 · raw

@-S:Type -> @-N:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @+node:N -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Bool)

template unlink_nonhead source · line 405 · raw

@-S:Type -> @-N:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @s:S -> @+node:N -> Pair(S, Bool)

template filter_prefix_result source · line 408 · raw

@-S:Type -> @-N:Data -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Filter<N>)

template filter_tail_result source · line 412 · raw

@-S:Type -> @-N:Data -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Filter<N>)

template filter_kept_head source · line 416 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Filter<N>)

template filter_drop_head source · line 421 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+h:H -> @+i:I -> @+c:C -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Filter<N>)

template filter_prefix_choice source · line 427 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+h:H -> @+i:I -> @+c:C -> @r:Pair(S, Bool) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Filter<N>)

template filter_prefix_step_1 source · line 434 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+h:H -> @+i:I -> @+c:C -> @r:Pair(S, V) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Filter<N>)

template filter_prefix_step source · line 438 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @s:S -> @+h:H -> @+i:I -> @+c:C -> @+node:N -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Filter<N>)

template filter_tail_removed source · line 441 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+c:C -> @+node:N -> @+after:Maybe<&2, N> -> @r:Pair(S, Bool) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Filter<N>)

template filter_tail_choice source · line 446 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+c:C -> @+node:N -> @+after:Maybe<&2, N> -> @r:Pair(S, Bool) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Filter<N>)

template filter_tail_step_2 source · line 452 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+c:C -> @+node:N -> @+after:Maybe<&2, N> -> @r:Pair(S, V) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Filter<N>)

template filter_tail_step_1 source · line 456 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+c:C -> @+node:N -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Filter<N>)

template filter_tail_step source · line 460 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @s:S -> @+c:C -> @+node:N -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Filter<N>)

template filter_loop source · line 463 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+fuel:Nat -> @+h:H -> @+i:I -> @+c:C -> @r:Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Filter<N>) -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template foreach_remove_filter_as source · line 478 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+fuel:Nat -> @s:S -> @+h:H -> @+i:I -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template foreach_remove_filter source · line 483 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-H:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:H -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-pred:(@_:S -> @_:C -> @_:V -> Pair(S, Bool)) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+fuel:Nat -> @s:S -> @+h:H -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template foreach_remove_convert_filter_as source · line 488 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-D:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-convert:(@_:S -> @_:V -> Pair(S, Maybe<&2, D>)) -> @-pred:(@_:S -> @_:C -> @_:D -> Pair(S, Bool)) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+fuel:Nat -> @s:S -> @+h:H -> @+i:I -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template foreach_remove_convert_filter source · line 493 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-D:Data -> @-H:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:H -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-convert:(@_:S -> @_:V -> Pair(S, Maybe<&2, D>)) -> @-pred:(@_:S -> @_:C -> @_:D -> Pair(S, Bool)) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+fuel:Nat -> @s:S -> @+h:H -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template visit_true source · line 496 · raw

@-S:Type -> @-D:Data -> @-C:Data -> @-fn:(@_:S -> @_:C -> @_:D -> S) -> @s:S -> @+c:C -> @+v:D -> Pair(S, Bool)

template foreach_remove_convert_as source · line 501 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-D:Data -> @-H:Data -> @-I:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:I -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-convert:(@_:S -> @_:V -> Pair(S, Maybe<&2, D>)) -> @-fn:(@_:S -> @_:C -> @_:D -> S) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+fuel:Nat -> @s:S -> @+h:H -> @+i:I -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template foreach_remove_convert source · line 506 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-D:Data -> @-H:Data -> @-C:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_head:(@_:S -> @_:H -> @_:Maybe<&2, N> -> S) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-convert:(@_:S -> @_:V -> Pair(S, Maybe<&2, D>)) -> @-fn:(@_:S -> @_:C -> @_:D -> S) -> @-post_remove:(@_:S -> @_:C -> @_:N -> S) -> @+fuel:Nat -> @s:S -> @+h:H -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Unit>)

template last_fold source · line 509 · raw

@-S:Type -> @-N:Data -> @s:S -> @c:Unit -> @+acc:Maybe<&2, N> -> @+node:N -> Pair(S, Maybe<&2, N>)

template last source · line 512 · raw

@-S:Type -> @-N:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @+fuel:Nat -> @s:S -> @+h:H -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Maybe<&2, N>>)

template mapped_cons source · line 515 · raw

@-T:Type -> @m:Maybe<&1, T> -> @xs:List<&1, T> -> List<&1, T>

template map_step_4 source · line 520 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-T:Type -> @-C:Data -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:V -> Pair(S, Maybe<&1, T>)) -> @xs:List<&1, T> -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Pair(Maybe<&2, N>, List<&1, T>))

template map_step_3 source · line 524 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-T:Type -> @-C:Data -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:V -> Pair(S, Maybe<&1, T>)) -> @+node:N -> @s:S -> @xs:List<&1, T> -> Pair(S, Pair(Maybe<&2, N>, List<&1, T>))

template map_step_2 source · line 527 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-T:Type -> @-C:Data -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:V -> Pair(S, Maybe<&1, T>)) -> @+node:N -> @xs:List<&1, T> -> @r:Pair(S, Maybe<&1, T>) -> Pair(S, Pair(Maybe<&2, N>, List<&1, T>))

template map_step_1 source · line 531 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-T:Type -> @-C:Data -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:V -> Pair(S, Maybe<&1, T>)) -> @+c:C -> @+node:N -> @xs:List<&1, T> -> @r:Pair(S, V) -> Pair(S, Pair(Maybe<&2, N>, List<&1, T>))

template map_step source · line 535 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-T:Type -> @-C:Data -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:V -> Pair(S, Maybe<&1, T>)) -> @s:S -> @+c:C -> @+node:N -> @xs:List<&1, T> -> Pair(S, Pair(Maybe<&2, N>, List<&1, T>))

template map_loop source · line 538 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-T:Type -> @-C:Data -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:V -> Pair(S, Maybe<&1, T>)) -> @+fuel:Nat -> @+c:C -> @r:Pair(S, Pair(Maybe<&2, N>, List<&1, T>)) -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, List<&1, T>>)

template map_last source · line 545 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-T:Type -> @-C:Data -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:V -> Pair(S, Maybe<&1, T>)) -> @+fuel:Nat -> @+c:C -> @r:Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, Maybe<&2, N>>) -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, List<&1, T>>)

template flat_map_to_list source · line 554 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-T:Type -> @-C:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:V -> Pair(S, Maybe<&1, T>)) -> @+fuel:Nat -> @s:S -> @+h:H -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, List<&1, T>>)

template map_some_result source · line 557 · raw

@-S:Type -> @-T:Type -> @r:Pair(S, T) -> Pair(S, Maybe<&1, T>)

template map_to_list source · line 563 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-T:Type -> @-C:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @-fn:(@_:S -> @_:C -> @_:V -> Pair(S, T)) -> @+fuel:Nat -> @s:S -> @+h:H -> @+c:C -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, List<&1, T>>)

template to_list source · line 568 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-H:Data -> @-get_head:(@_:S -> @_:H -> Pair(S, Maybe<&2, N>)) -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-prev:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-value:(@_:S -> @_:N -> Pair(S, V)) -> @+fuel:Nat -> @s:S -> @+h:H -> Pair(S, Result<&2, &1, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Error, List<&1, V>>)

template append_node source · line 571 · raw

@-S:Type -> @-N:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @s:S -> @+head:Maybe<&2, N> -> @+tail:Maybe<&2, N> -> @+node:N -> Pair(S, Pair(Maybe<&2, N>, Maybe<&2, N>))

template build_step_1 source · line 577 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-make:(@_:S -> @_:C -> @_:V -> Pair(S, N)) -> @+head:Maybe<&2, N> -> @+tail:Maybe<&2, N> -> @r:Pair(S, N) -> Pair(S, Pair(Maybe<&2, N>, Maybe<&2, N>))

template build_step source · line 581 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-make:(@_:S -> @_:C -> @_:V -> Pair(S, N)) -> @s:S -> @+c:C -> @+head:Maybe<&2, N> -> @+tail:Maybe<&2, N> -> @+v:V -> Pair(S, Pair(Maybe<&2, N>, Maybe<&2, N>))

template build_loop source · line 584 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-make:(@_:S -> @_:C -> @_:V -> Pair(S, N)) -> @+xs:List<&2, V> -> @+c:C -> @r:Pair(S, Pair(Maybe<&2, N>, Maybe<&2, N>)) -> Pair(S, Maybe<&2, N>)

template from_values source · line 593 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-make:(@_:S -> @_:C -> @_:V -> Pair(S, N)) -> @s:S -> @+xs:List<&2, V> -> @+c:C -> Pair(S, Maybe<&2, N>)

template from_nodes source · line 598 · raw

@-S:Type -> @-N:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @s:S -> @+xs:List<&2, N> -> Pair(S, Maybe<&2, N>)

template mapped_factory_1 source · line 601 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-D:Data -> @-C:Data -> @-convert:(@_:S -> @_:C -> @_:V -> Pair(S, D)) -> @-make:(@_:S -> @_:C -> @_:D -> Pair(S, N)) -> @+c:C -> @r:Pair(S, D) -> Pair(S, N)

template mapped_factory source · line 605 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-D:Data -> @-C:Data -> @-convert:(@_:S -> @_:C -> @_:V -> Pair(S, D)) -> @-make:(@_:S -> @_:C -> @_:D -> Pair(S, N)) -> @s:S -> @+c:C -> @+v:V -> Pair(S, N)

template map_from_values source · line 610 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-D:Data -> @-C:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-convert:(@_:S -> @_:C -> @_:V -> Pair(S, D)) -> @-make:(@_:S -> @_:C -> @_:D -> Pair(S, N)) -> @s:S -> @+xs:List<&2, V> -> @+c:C -> Pair(S, Maybe<&2, N>)

template map_from_nodes source · line 615 · raw

@-S:Type -> @-N:Data -> @-V:Data -> @-C:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-set_prev:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-make:(@_:S -> @_:C -> @_:V -> Pair(S, N)) -> @s:S -> @+xs:List<&2, V> -> @+c:C -> Pair(S, Maybe<&2, N>)

template pool_free source · line 620 · raw

@-S:Type -> @-N:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @s:S -> @pool:0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N> -> @+node:N -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N>)

template pool_take_1 source · line 624 · raw

@-S:Type -> @-N:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-make:(@_:S -> @_:C -> Pair(S, N)) -> @+node:N -> @+count:Nat -> @r:Pair(S, Maybe<&2, N>) -> Pair(S, Pair(0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N>, N))

template pool_take source · line 628 · raw

@-S:Type -> @-N:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-make:(@_:S -> @_:C -> Pair(S, N)) -> @s:S -> @+node:N -> @+count:Nat -> Pair(S, Pair(0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N>, N))

template pool_fresh_1 source · line 631 · raw

@-S:Type -> @-N:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-make:(@_:S -> @_:C -> Pair(S, N)) -> @r:Pair(S, N) -> Pair(S, Pair(0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N>, N))

template pool_fresh source · line 635 · raw

@-S:Type -> @-N:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-make:(@_:S -> @_:C -> Pair(S, N)) -> @s:S -> @+c:C -> Pair(S, Pair(0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N>, N))

template pool_next source · line 640 · raw

@-S:Type -> @-N:Data -> @-C:Data -> @-next:(@_:S -> @_:N -> Pair(S, Maybe<&2, N>)) -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-make:(@_:S -> @_:C -> Pair(S, N)) -> @s:S -> @pool:0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N> -> @+c:C -> Pair(S, Pair(0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N>, N))

template pool_grow_step_1 source · line 645 · raw

@-S:Type -> @-N:Data -> @-C:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-make:(@_:S -> @_:C -> Pair(S, N)) -> @pool:0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N> -> @r:Pair(S, N) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N>)

template pool_grow_step source · line 649 · raw

@-S:Type -> @-N:Data -> @-C:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-make:(@_:S -> @_:C -> Pair(S, N)) -> @s:S -> @pool:0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N> -> @+c:C -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N>)

template pool_grow source · line 652 · raw

@-S:Type -> @-N:Data -> @-C:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-make:(@_:S -> @_:C -> Pair(S, N)) -> @+size:Nat -> @+c:C -> @r:Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N>) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N>)

template pool_new_1 source · line 658 · raw

@-S:Type -> @-N:Data -> @-C:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-make:(@_:S -> @_:C -> Pair(S, N)) -> @+size:Nat -> @+c:C -> @r:Pair(S, N) -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N>)

template pool_new source · line 664 · raw

@-S:Type -> @-N:Data -> @-C:Data -> @-set_next:(@_:S -> @_:N -> @_:Maybe<&2, N> -> S) -> @-make:(@_:S -> @_:C -> Pair(S, N)) -> @+size:Nat -> @s:S -> @+c:C -> Pair(S, 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.Pool<N>)

template new_node source · line 669 · raw

@-N:Data -> @-V:Data -> @+v:V -> 0xd9a2fae439ac7ff9e21e0853948f94fe/src/containers/types/intrusive_doubly_linked_list.DefaultNode<N, V>