b6449cae87
* `lib_stdlib`: basic extended OCaml stdlib and generic data structures
* `lib_data_encoding`: almost independant 'Data_encoding'
* `lib_error_monad`: almost independant 'Error_monad'
* `lib_stdlib_lwt`: extended Lwt library
* `lib_crypto`: all the crypto stuff (hashing, signing, cryptobox).
* `lib_base`:
- basic type definitions (Block_header, Operation, ...)
- a module `TzPervasives` to bind them all and to be the
single module opened everywhere.
In the process, I splitted `Tezos_data` and `Hash` in multiple
submodules, thus removing a lot of `-open`.
The following two modules may not have found their place yet:
- Base58 (currently in `lib_crypto`)
- Cli_entries (currently in `lib_stdlib_lwt`)
66 lines
2.4 KiB
OCaml
66 lines
2.4 KiB
OCaml
(**************************************************************************)
|
|
(* *)
|
|
(* Copyright (c) 2014 - 2017. *)
|
|
(* Dynamic Ledger Solutions, Inc. <contact@tezos.com> *)
|
|
(* *)
|
|
(* All rights reserved. No warranty, explicit or implicit, provided. *)
|
|
(* *)
|
|
(**************************************************************************)
|
|
|
|
(** [remove nb list] remove the first [nb] elements from the list [list]. *)
|
|
val remove: int -> 'a list -> 'a list
|
|
|
|
(** [repeat n x] is a list of [n] [x]'s **)
|
|
val repeat: int -> 'a -> 'a list
|
|
|
|
(** [take_n n l] returns the [n] first elements of [l]. When [compare]
|
|
is provided, it returns the [n] greatest element of [l]. *)
|
|
val take_n: ?compare:('a -> 'a -> int) -> int -> 'a list -> 'a list
|
|
|
|
(** Bounded sequence: keep only the [n] greatest elements. *)
|
|
module Bounded(E: Set.OrderedType) : sig
|
|
type t
|
|
val create: int -> t
|
|
val insert: E.t -> t -> unit
|
|
val get: t -> E.t list
|
|
end
|
|
|
|
(** [select n l] is ([n]th element of [l], [l] without that element) **)
|
|
val select: int -> 'a list -> 'a * 'a list
|
|
|
|
|
|
(** [filter_map f l] is [[y for x in l where (f x) = Some y]] **)
|
|
val filter_map: ('a -> 'b option) -> 'a list -> 'b list
|
|
|
|
(** [rev_sub l n] is [List.rev l] capped to max [n] elements *)
|
|
val rev_sub : 'a list -> int -> 'a list
|
|
|
|
(** [sub l n] is [l] capped to max [n] elements *)
|
|
val sub: 'a list -> int -> 'a list
|
|
|
|
(** Like [List.hd], but [Some hd] or [None] if empty **)
|
|
val hd_opt: 'a list -> 'a option
|
|
|
|
(** Last elt of list, or raise Not_found if empty **)
|
|
val last_exn: 'a list -> 'a
|
|
|
|
(** [merge_filter2 ~compare ~f l1 l2] merges two lists ordered by [compare]
|
|
and whose items can be merged with [f]. Item is discarded or kept whether
|
|
[f] returns [Some] or [None] *)
|
|
val merge_filter2 :
|
|
?finalize:('a list -> 'a list) ->
|
|
?compare:('a -> 'a -> int) ->
|
|
?f:('a option -> 'a option -> 'a option) ->
|
|
'a list -> 'a list ->
|
|
'a list
|
|
|
|
(** [merge2 ~compare ~f l1 l2] merges two lists ordered by [compare] and
|
|
whose items can be merged with [f] *)
|
|
val merge2 :
|
|
?finalize:('a list -> 'a list) ->
|
|
?compare:('a -> 'a -> int) ->
|
|
?f:('a -> 'a -> 'a) ->
|
|
'a list -> 'a list ->
|
|
'a list
|
|
|