Constructs a stream for the provided concurrency monad.
and ('a, 'err) node = | NilThe node of an empty stream
*)| Error of 'errA node of a permanently failed stream.
*)| Cons of 'a * ('a, 'err) tA node holding the next element and continuation of a stream.
*)val fold :
f:('a -> 'state -> 'state) ->
('a, 'err) t ->
'state ->
('state, 'err) Stdlib.result X.futurefold ~f stream acc consumes the remainder elements e1, ..., eN of stream and returns Ok (acc |> f e1 |> ... |> f eN) if no error occurred
val fold_s :
f:('a -> 'state -> ('state, 'err) Stdlib.result X.future) ->
('a, 'clog) t ->
'state ->
('state, [> `Congested of 'clog ] as 'err) Stdlib.result X.futurefold_s ~f stream acc consumes the remainder of stream, passing each element in order to f along with the latest accumulation starting at acc, and returning the final accumulation if successful. An error result may be due to either the stream provider or the callback, as distinguished with the `Congested constructor.
val iter_s :
f:('a -> (unit, 'err) Stdlib.result X.future) ->
('a, 'clog) t ->
(unit, [> `Congested of 'clog ] as 'err) Stdlib.result X.futureiter_s ~f stream consumes the remainder of stream, passing each element in order to f. An error result may be due to either the steram provider or the callback, as distinguished with the `Congested constructor.
to_rev_list stream consumes the remainder of stream, returning a list of its element in reverse order of production.
to_list stream consumes the remainder of stream, returning a list of its element in order of production.
val of_list : 'a list -> ('a, 'err) tof_list xs is a non-failing finite stream (re)producing the elements xs in order of occurrence.