package sexp

You can search for identifiers within the package.

in-package search v0.2.0

S-expression swiss knife

Install

Dune Dependency

github.com Readme MIT License Edit opam file Versions (6)

Authors

J

Jane Street Group, LLC

Maintainers

J

Jane Street developers

Sources

sexp-v0.15.0.tar.gz

sha256=7c0bc2f04bf7abda23ccf02ce10cf90cd9e60124736ffa6501388693f2f30ac0

doc/sexp.lazy_list/Lazy_list/index.html

Module `Lazy_list`Source

Lazy lists.

Sourcetype 'a t

include Core.Monad.S with type 'a t := 'a t

val (>>=) : 'a t -> ('a -> 'b t) -> 'b t

val (>>|) : 'a t -> ('a -> 'b) -> 'b t

module Monad_infix : sig ... end

val bind : 'a t -> f:('a -> 'b t) -> 'b t

val return : 'a -> 'a t

val join : 'a t t -> 'a t

val ignore_m : 'a t -> unit t

val all : 'a t list -> 'a list t

val all_unit : unit t list -> unit t

module Let_syntax : sig ... end

Sourceval empty : unit -> 'a t

Sourceval is_empty : 'a t -> bool

Sourceval length : 'a t -> int

Sourceval decons : 'a t -> ('a * 'a t) option

Sourceval cons : 'a -> 'a t -> 'a t

Sourceval snoc : 'a t -> 'a -> 'a t

Sourceval append : 'a t -> 'a t -> 'a t

val map : 'a t -> f:('a -> 'b) -> 'b t

Sourceval concat : 'a t t -> 'a t

Sourceval nth : 'a t -> int -> 'a option

Sourceval concat_list : 'a list t -> 'a t

Sourceval find : f:('a -> bool) -> 'a t -> 'a option

Sourceval filter : f:('a -> bool) -> 'a t -> 'a t

Sourceval filter_opt : 'a option t -> 'a t

Sourceval filter_map : f:('a -> 'b option) -> 'a t -> 'b t

Sourceval fold_left : f:('a -> 'b -> 'a) -> init:'a -> 'b t -> 'a

Sourceval fold_right : f:('a -> 'b -> 'b) -> 'a t -> init:'b -> 'b

Sourceval foldr : 'a t -> f:('a -> 'b Core.Lazy.t -> 'b) -> init:'b -> 'b Core.Lazy.t

Sourceval iter : 'a t -> f:('a -> unit) -> unit

Sourceval of_iterator : curr:('a -> 'b option) -> next:('a -> 'a) -> init:'a -> 'b t

Sourceval build : f:('s -> ('a * 's) option) -> seed:'s -> 'a t

Sourceval unfold : f:('a -> 'a option) -> init:'a -> 'a t

Sourceval uniter : f:(unit -> 'a option) -> 'a t

Sourceval of_list : 'a list -> 'a t

Sourceval to_rev_list : 'a t -> 'a list

Sourceval to_list : 'a t -> 'a list

Sourceval of_array : 'a array -> 'a t

Sourceval to_array : 'a t -> 'a array

Sourceval cartesian_product : 'a t t -> 'a t t

Sourceval merge : cmp:('a -> 'a -> int) -> 'a t -> 'a t -> 'a t

Source

val unify : 
  cmp:('a -> 'b -> int) ->
  'a t ->
  'b t ->
  [ `Left of 'a | `Right of 'b | `Both of 'a * 'b ] t

Sourceval sort : cmp:('a -> 'a -> int) -> 'a t -> 'a t

Sourceval lazy_sort : cmp:('a -> 'a -> int) -> 'a t -> 'a t

Sourcemodule Of_container : sig ... end

Sourcemodule Iterator : sig ... end