Module Direct

val iter : t -> envelope:((t, Envelope.t) Fieldslib.Field.t -> t -> Envelope.t -> unit) -> next_hop_choices:((t, Address.t list) Fieldslib.Field.t -> t -> Address.t list -> unit) -> retry_intervals:((t, Core.Std.Time.Span.t list) Fieldslib.Field.t -> t -> Core.Std.Time.Span.t list -> unit) -> unit

val fold : t -> init:'acc__0 -> envelope:('acc__0 -> (t, Envelope.t) Fieldslib.Field.t -> t -> Envelope.t -> 'acc__1) -> next_hop_choices:('acc__1 -> (t, Address.t list) Fieldslib.Field.t -> t -> Address.t list -> 'acc__2) -> retry_intervals:('acc__2 -> (t, Core.Std.Time.Span.t list) Fieldslib.Field.t -> t -> Core.Std.Time.Span.t list -> 'acc__3) -> 'acc__3

val for_all : t -> envelope:((t, Envelope.t) Fieldslib.Field.t -> t -> Envelope.t -> bool) -> next_hop_choices:((t, Address.t list) Fieldslib.Field.t -> t -> Address.t list -> bool) -> retry_intervals:((t, Core.Std.Time.Span.t list) Fieldslib.Field.t -> t -> Core.Std.Time.Span.t list -> bool) -> bool

val exists : t -> envelope:((t, Envelope.t) Fieldslib.Field.t -> t -> Envelope.t -> bool) -> next_hop_choices:((t, Address.t list) Fieldslib.Field.t -> t -> Address.t list -> bool) -> retry_intervals:((t, Core.Std.Time.Span.t list) Fieldslib.Field.t -> t -> Core.Std.Time.Span.t list -> bool) -> bool

val to_list : t -> envelope:((t, Envelope.t) Fieldslib.Field.t -> t -> Envelope.t -> 'elem__) -> next_hop_choices:((t, Address.t list) Fieldslib.Field.t -> t -> Address.t list -> 'elem__) -> retry_intervals:((t, Core.Std.Time.Span.t list) Fieldslib.Field.t -> t -> Core.Std.Time.Span.t list -> 'elem__) -> 'elem__ list

val map : t -> envelope:((t, Envelope.t) Fieldslib.Field.t -> t -> Envelope.t -> Envelope.t) -> next_hop_choices:((t, Address.t list) Fieldslib.Field.t -> t -> Address.t list -> Address.t list) -> retry_intervals:((t, Core.Std.Time.Span.t list) Fieldslib.Field.t -> t -> Core.Std.Time.Span.t list -> Core.Std.Time.Span.t list) -> t

val set_all_mutable_fields : t -> unit