plebeia

Functional storage using Merkle Patricia tree
Legend:
Library
Module
Module type
Parameter
Class
Class type
Library plebeia
Module Plebeia . Utils . List
include module type of struct include Stdlib.List end
type !'a t = 'a list =
| []
| :: of 'a * 'a list
val length : 'a list -> int
val compare_lengths : 'a list -> 'b list -> int
val compare_length_with : 'a list -> int -> int
val cons : 'a -> 'a list -> 'a list
val hd : 'a list -> 'a
val tl : 'a list -> 'a list
val nth : 'a list -> int -> 'a
val nth_opt : 'a list -> int -> 'a option
val rev : 'a list -> 'a list
val init : int -> ( int -> 'a ) -> 'a list
val append : 'a list -> 'a list -> 'a list
val rev_append : 'a list -> 'a list -> 'a list
val flatten : 'a list list -> 'a list
val equal : ( 'a -> 'a -> bool ) -> 'a list -> 'a list -> bool
val compare : ( 'a -> 'a -> int ) -> 'a list -> 'a list -> int
val iter : ( 'a -> unit ) -> 'a list -> unit
val iteri : ( int -> 'a -> unit ) -> 'a list -> unit
val mapi : ( int -> 'a -> 'b ) -> 'a list -> 'b list
val rev_map : ( 'a -> 'b ) -> 'a list -> 'b list
val filter_map : ( 'a -> 'b option ) -> 'a list -> 'b list
val fold_left_map : ( 'a -> 'b -> 'a * 'c ) -> 'a -> 'b list -> 'a * 'c list
val fold_left : ( 'a -> 'b -> 'a ) -> 'a -> 'b list -> 'a
val fold_right : ( 'a -> 'b -> 'b ) -> 'a list -> 'b -> 'b
val iter2 : ( 'a -> 'b -> unit ) -> 'a list -> 'b list -> unit
val map2 : ( 'a -> 'b -> 'c ) -> 'a list -> 'b list -> 'c list
val rev_map2 : ( 'a -> 'b -> 'c ) -> 'a list -> 'b list -> 'c list
val fold_left2 : ( 'a -> 'b -> 'c -> 'a ) -> 'a -> 'b list -> 'c list -> 'a
val fold_right2 : ( 'a -> 'b -> 'c -> 'c ) -> 'a list -> 'b list -> 'c -> 'c
val for_all : ( 'a -> bool ) -> 'a list -> bool
val exists : ( 'a -> bool ) -> 'a list -> bool
val for_all2 : ( 'a -> 'b -> bool ) -> 'a list -> 'b list -> bool
val exists2 : ( 'a -> 'b -> bool ) -> 'a list -> 'b list -> bool
val mem : 'a -> 'a list -> bool
val memq : 'a -> 'a list -> bool
val find : ( 'a -> bool ) -> 'a list -> 'a
val find_opt : ( 'a -> bool ) -> 'a list -> 'a option
val find_map : ( 'a -> 'b option ) -> 'a list -> 'b option
val filter : ( 'a -> bool ) -> 'a list -> 'a list
val find_all : ( 'a -> bool ) -> 'a list -> 'a list
val filteri : ( int -> 'a -> bool ) -> 'a list -> 'a list
val partition : ( 'a -> bool ) -> 'a list -> 'a list * 'a list
val assoc : 'a -> ('a * 'b) list -> 'b
val assoc_opt : 'a -> ('a * 'b) list -> 'b option
val assq : 'a -> ('a * 'b) list -> 'b
val assq_opt : 'a -> ('a * 'b) list -> 'b option
val mem_assoc : 'a -> ('a * 'b) list -> bool
val mem_assq : 'a -> ('a * 'b) list -> bool
val remove_assoc : 'a -> ('a * 'b) list -> ('a * 'b) list
val remove_assq : 'a -> ('a * 'b) list -> ('a * 'b) list
val split : ('a * 'b) list -> 'a list * 'b list
val combine : 'a list -> 'b list -> ('a * 'b) list
val sort : ( 'a -> 'a -> int ) -> 'a list -> 'a list
val stable_sort : ( 'a -> 'a -> int ) -> 'a list -> 'a list
val fast_sort : ( 'a -> 'a -> int ) -> 'a list -> 'a list
val sort_uniq : ( 'a -> 'a -> int ) -> 'a list -> 'a list
val merge : ( 'a -> 'a -> int ) -> 'a list -> 'a list -> 'a list
val to_seq : 'a list -> 'a Stdlib.Seq.t
val of_seq : 'a Stdlib.Seq.t -> 'a list
val (@) : 'a list -> 'a list -> 'a list

Tail recursive

val rev_concat : 'a list list -> 'a list

Reversed versio of concat. Tail recursive

val concat : 'a list list -> 'a list

Tail recursive

val map : ( 'a -> 'b ) -> 'a list -> 'b list

Tail recursive

val take_while_map : ( 'a -> 'b option ) -> 'a list -> 'b list * 'a list
val drop : int -> 'a list -> 'a list

drop n xs drops the first n elements from xs. If xs is shorter than n, drop n xs returns [].

val split_at : int -> 'a list -> 'a list * 'a list

split_at 3 [1;2;3;4;5] = ([1;2;3], [4;5]) split_at 3 [1;2] = ([1;2], [])

val take : int -> 'a list -> 'a list

take 3 [1;2;3;4;5] = [1;2;3] take 3 [1;2] = [1;2]

val uniq_sorted : ( 'a -> 'a -> bool ) -> 'a list -> 'a list
val concat_map : ( 'a -> 'b list ) -> 'a list -> 'b list
val is_prefix : 'a list -> 'a list -> 'a list option

is_prefix p xs checks p is a prefix of xs. If it is, it returns the Some postfix, where postfix is the rest of xs without the prefix.

Otherwise, it returns None.

val partition_map : ( 'a -> [< `Left of 'b | `Right of 'c ] ) -> 'a t -> 'b t * 'c t