package async_kernel
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Monadic concurrency library
Install
dune-project
Dependency
Authors
Maintainers
Sources
async_kernel-v0.16.0.tar.gz
sha256=0eda59386235e967698834d71cb8924d7b466bc4fcbf26ae72797ad05ca6f8a9
doc/src/async_kernel/monad_sequence.ml.html
Source file monad_sequence.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51(** [Monad_sequence.S] is a generic interface specifying functions that deal with a container and a monad. It is specialized to the [Deferred] monad and used with various containers in modules [Deferred.Array], [Deferred.List], [Deferred.Queue], and [Deferred.Sequence]. The [Monad_sequence.how] type specifies the parallelism of container iterators. *) open! Core open! Import type how = [ `Parallel (** like [`Max_concurrent_jobs Int.max_value] *) | `Sequential (** [`Sequential] is often but not always the same as [`Max_concurrent_jobs 1] (for example, they differ in the [Or_error] monad). *) | `Max_concurrent_jobs of int ] [@@deriving sexp_of] module type S = sig type 'a monad type 'a t val foldi : 'a t -> init:'b -> f:(int -> 'b -> 'a -> 'b monad) -> 'b monad val fold : 'a t -> init:'b -> f:('b -> 'a -> 'b monad) -> 'b monad val find : 'a t -> f:('a -> bool monad) -> 'a option monad val findi : 'a t -> f:(int -> 'a -> bool monad) -> (int * 'a) option monad val find_map : 'a t -> f:('a -> 'b option monad) -> 'b option monad val find_mapi : 'a t -> f:(int -> 'a -> 'b option monad) -> 'b option monad val exists : 'a t -> f:('a -> bool monad) -> bool monad val existsi : 'a t -> f:(int -> 'a -> bool monad) -> bool monad val for_all : 'a t -> f:('a -> bool monad) -> bool monad val for_alli : 'a t -> f:(int -> 'a -> bool monad) -> bool monad val all : 'a monad t -> 'a t monad val all_unit : unit monad t -> unit monad (** {2 Deferred iterators} In the following, the default [how] is [`Sequential] *) val init : how:how -> int -> f:(int -> 'a monad) -> 'a t monad val iter : how:how -> 'a t -> f:('a -> unit monad) -> unit monad val iteri : how:how -> 'a t -> f:(int -> 'a -> unit monad) -> unit monad val map : how:how -> 'a t -> f:('a -> 'b monad) -> 'b t monad val mapi : how:how -> 'a t -> f:(int -> 'a -> 'b monad) -> 'b t monad val filter : how:how -> 'a t -> f:('a -> bool monad) -> 'a t monad val filteri : how:how -> 'a t -> f:(int -> 'a -> bool monad) -> 'a t monad val filter_map : how:how -> 'a t -> f:('a -> 'b option monad) -> 'b t monad val filter_mapi : how:how -> 'a t -> f:(int -> 'a -> 'b option monad) -> 'b t monad val concat_map : how:how -> 'a t -> f:('a -> 'b t monad) -> 'b t monad val concat_mapi : how:how -> 'a t -> f:(int -> 'a -> 'b t monad) -> 'b t monad end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>