package accessor_core

  1. Overview
  2. Docs
val empty : (_, unit, 'a Core_kernel.Fqueue.t, [< Accessor_core__.Import.variant ]) Accessor_base.Simple.t

Access () iff the queue is empty.

val each : ('i -> 'a -> 'b, 'i -> 'a Core_kernel.Fqueue.t -> 'b Core_kernel.Fqueue.t, [< Accessor_core__.Import.many ]) Accessor_base.t

Access each element of the queue.

val eachi : ((int * 'i) -> 'a -> 'b, 'i -> 'a Core_kernel.Fqueue.t -> 'b Core_kernel.Fqueue.t, [< Accessor_core__.Import.many ]) Accessor_base.t

The indexed version of each provides a numeric index for each element.

include Accessor_base.Monad.S with type 'a t := 'a Core_kernel.Fqueue.t
val map : ?how:[ `Parallel | `Sequential ] -> (Base.unit -> 'a -> 'b, Base.unit -> 'at -> 'bt, [> Accessor.Subtyping.many ]) Accessor.t -> 'at -> f:('a -> 'b Core_kernel.Fqueue.t) -> 'bt Core_kernel.Fqueue.t
val mapi : ?how:[ `Parallel | `Sequential ] -> ('i -> 'a -> 'b, Base.unit -> 'at -> 'bt, [> Accessor.Subtyping.many ]) Accessor.t -> 'at -> f:('i Accessor.Index.t -> 'a -> 'b Core_kernel.Fqueue.t) -> 'bt Core_kernel.Fqueue.t
val all : (Base.unit -> 'a Core_kernel.Fqueue.t -> 'a, Base.unit -> 'at -> 'bt, [> Accessor.Subtyping.many ]) Accessor.t -> 'at -> 'bt Core_kernel.Fqueue.t
val iter : ?how:[ `Parallel | `Sequential ] -> (Base.unit -> 'a -> _, Base.unit -> 'at -> _, [> Accessor.Subtyping.many_getter ]) Accessor.t -> 'at -> f:('a -> Base.unit Core_kernel.Fqueue.t) -> Base.unit Core_kernel.Fqueue.t
val iteri : ?how:[ `Parallel | `Sequential ] -> ('i -> 'a -> _, Base.unit -> 'at -> _, [> Accessor.Subtyping.many_getter ]) Accessor.t -> 'at -> f:('i Accessor.Index.t -> 'a -> Base.unit Core_kernel.Fqueue.t) -> Base.unit Core_kernel.Fqueue.t
val sum : ?how:[ `Parallel | `Sequential ] -> (module Base.Container.Summable with type t = 'sum) -> (Base.unit -> 'a -> _, Base.unit -> 'at -> _, [> Accessor.Subtyping.many_getter ]) Accessor.t -> 'at -> f:('a -> 'sum Core_kernel.Fqueue.t) -> 'sum Core_kernel.Fqueue.t
val sumi : ?how:[ `Parallel | `Sequential ] -> (module Base.Container.Summable with type t = 'sum) -> ('i -> 'a -> _, Base.unit -> 'at -> _, [> Accessor.Subtyping.many_getter ]) Accessor.t -> 'at -> f:('i Accessor.Index.t -> 'a -> 'sum Core_kernel.Fqueue.t) -> 'sum Core_kernel.Fqueue.t
val count : ?how:[ `Parallel | `Sequential ] -> (Base.unit -> 'a -> _, Base.unit -> 'at -> _, [> Accessor.Subtyping.many_getter ]) Accessor.t -> 'at -> f:('a -> Base.bool Core_kernel.Fqueue.t) -> Base.int Core_kernel.Fqueue.t
val counti : ?how:[ `Parallel | `Sequential ] -> ('i -> 'a -> _, Base.unit -> 'at -> _, [> Accessor.Subtyping.many_getter ]) Accessor.t -> 'at -> f:('i Accessor.Index.t -> 'a -> Base.bool Core_kernel.Fqueue.t) -> Base.int Core_kernel.Fqueue.t
val map_reduce : ?how:[ `Parallel | `Sequential ] -> (Base.unit -> 'a -> _, Base.unit -> 'at -> _, [> Accessor.Subtyping.many_getter ]) Accessor.t -> 'at -> empty:'b -> combine:('b -> 'b -> 'b) -> f:('a -> 'b Core_kernel.Fqueue.t) -> 'b Core_kernel.Fqueue.t
val map_reducei : ?how:[ `Parallel | `Sequential ] -> ('i -> 'a -> _, Base.unit -> 'at -> _, [> Accessor.Subtyping.many_getter ]) Accessor.t -> 'at -> empty:'b -> combine:('b -> 'b -> 'b) -> f:('i Accessor.Index.t -> 'a -> 'b Core_kernel.Fqueue.t) -> 'b Core_kernel.Fqueue.t
val map_reduce_nonempty : ?how:[ `Parallel | `Sequential ] -> (Base.unit -> 'a -> _, Base.unit -> 'at -> _, [> Accessor.Subtyping.nonempty_getter ]) Accessor.t -> 'at -> combine:('b -> 'b -> 'b) -> f:('a -> 'b Core_kernel.Fqueue.t) -> 'b Core_kernel.Fqueue.t
val map_reduce_nonemptyi : ?how:[ `Parallel | `Sequential ] -> ('i -> 'a -> _, Base.unit -> 'at -> _, [> Accessor.Subtyping.nonempty_getter ]) Accessor.t -> 'at -> combine:('b -> 'b -> 'b) -> f:('i Accessor.Index.t -> 'a -> 'b Core_kernel.Fqueue.t) -> 'b Core_kernel.Fqueue.t
OCaml

Innovation. Community. Security.