yices2_bindings 0.2 (latest)

type !'a iter = ('a -> unit) -> unit

type !'a gen = unit -> 'a option

type !'a printer = Stdlib.Format.formatter -> 'a -> unit

type !'a random_gen = Stdlib.Random.State.t -> 'a

val length : 'a list -> 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 rev : 'a list -> 'a list

val append : 'a list -> 'a list -> 'a list

val rev_append : 'a list -> 'a list -> 'a list

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

val iter : ('a -> unit) -> 'a list -> unit

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

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

val concat_map : ('a -> 'b list) -> '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 memq : 'a -> 'a list -> bool

val find : ('a -> bool) -> 'a list -> 'a

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 assq : 'a -> ('a * 'b) list -> 'b

val mem_assq : 'a -> ('a * 'b) list -> bool

val remove_assq : 'a -> ('a * '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 merge : ('a -> 'a -> int) -> 'a list -> 'a list -> 'a list

type !'a t = 'a list

val empty : 'a t

val is_empty : 'a t -> bool

val cons_maybe : 'a option -> 'a t -> 'a t

val cons' : 'a t -> 'a -> 'a t

val fold_while : ('a -> 'b -> 'a * [ `Continue | `Stop ]) -> 'a -> 'b t -> 'a

val fold_map : ('acc -> 'a -> 'acc * 'b) -> 'acc -> 'a list -> 'acc * 'b list

val fold_map_i : 
  ('acc -> int -> 'a -> 'acc * 'b) ->
  'acc ->
  'a list ->
  'acc * 'b list

val fold_on_map : 
  f:('a -> 'b) ->
  reduce:('acc -> 'b -> 'acc) ->
  'acc ->
  'a list ->
  'acc

val scan_left : ('acc -> 'a -> 'acc) -> 'acc -> 'a list -> 'acc list

val reduce : ('a -> 'a -> 'a) -> 'a list -> 'a option

val reduce_exn : ('a -> 'a -> 'a) -> 'a list -> 'a

val fold_map2 : 
  ('acc -> 'a -> 'b -> 'acc * 'c) ->
  'acc ->
  'a list ->
  'b list ->
  'acc * 'c list

val fold_filter_map : 
  ('acc -> 'a -> 'acc * 'b option) ->
  'acc ->
  'a list ->
  'acc * 'b list

val fold_filter_map_i : 
  ('acc -> int -> 'a -> 'acc * 'b option) ->
  'acc ->
  'a list ->
  'acc * 'b list

val fold_flat_map : 
  ('acc -> 'a -> 'acc * 'b list) ->
  'acc ->
  'a list ->
  'acc * 'b list

val fold_flat_map_i : 
  ('acc -> int -> 'a -> 'acc * 'b list) ->
  'acc ->
  'a list ->
  'acc * 'b list

val unfold : ('seed -> ('b * 'seed) option) -> 'seed -> 'b list

val count : ('a -> bool) -> 'a list -> int

val count_true_false : ('a -> bool) -> 'a list -> int * int

val init : int -> (int -> 'a) -> 'a t

val combine : 'a list -> 'b list -> ('a * 'b) list

val combine_gen : 'a list -> 'b list -> ('a * 'b) gen

val combine_shortest : 'a list -> 'b list -> ('a * 'b) list

val split : ('a * 'b) t -> 'a t * 'b t

val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

val compare_lengths : 'a t -> 'b t -> int

val compare_length_with : 'a t -> int -> int

val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

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

val flat_map_i : (int -> 'a -> 'b t) -> 'a t -> 'b t

val flatten : 'a t t -> 'a t

val product : ('a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t

val fold_product : ('c -> 'a -> 'b -> 'c) -> 'c -> 'a t -> 'b t -> 'c

val cartesian_product : 'a t t -> 'a t t

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

val diagonal : 'a t -> ('a * 'a) t

val partition_map_either : 
  ('a -> ('b, 'c) CCEither.t) ->
  'a list ->
  'b list * 'c list

val partition_filter_map : 
  ('a -> [< `Drop | `Left of 'b | `Right of 'c ]) ->
  'a list ->
  'b list * 'c list

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

deprecated use CCList.partition_filter_map instead

val group_by : ?hash:('a -> int) -> ?eq:('a -> 'a -> bool) -> 'a t -> 'a list t

val join : join_row:('a -> 'b -> 'c option) -> 'a t -> 'b t -> 'c t

val join_by : 
  ?eq:('key -> 'key -> bool) ->
  ?hash:('key -> int) ->
  ('a -> 'key) ->
  ('b -> 'key) ->
  merge:('key -> 'a -> 'b -> 'c option) ->
  'a t ->
  'b t ->
  'c t

val join_all_by : 
  ?eq:('key -> 'key -> bool) ->
  ?hash:('key -> int) ->
  ('a -> 'key) ->
  ('b -> 'key) ->
  merge:('key -> 'a list -> 'b list -> 'c option) ->
  'a t ->
  'b t ->
  'c t

val group_join_by : 
  ?eq:('a -> 'a -> bool) ->
  ?hash:('a -> int) ->
  ('b -> 'a) ->
  'a t ->
  'b t ->
  ('a * 'b list) t

val sublists_of_len : 
  ?last:('a list -> 'a list option) ->
  ?offset:int ->
  int ->
  'a list ->
  'a list list

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

val intersperse : 'a -> 'a list -> 'a list

val interleave : 'a list -> 'a list -> 'a list

val pure : 'a -> 'a t

val mguard : bool -> unit t

val return : 'a -> 'a t

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

val drop : int -> 'a t -> 'a t

val hd_tl : 'a t -> 'a * 'a t

val take_drop : int -> 'a t -> 'a t * 'a t

val take_while : ('a -> bool) -> 'a t -> 'a t

val drop_while : ('a -> bool) -> 'a t -> 'a t

val take_drop_while : ('a -> bool) -> 'a t -> 'a t * 'a t

val last : int -> 'a t -> 'a t

val head_opt : 'a t -> 'a option

val tail_opt : 'a t -> 'a t option

val last_opt : 'a t -> 'a option

val find_pred : ('a -> bool) -> 'a t -> 'a option

val find_opt : ('a -> bool) -> 'a t -> 'a option

val find_pred_exn : ('a -> bool) -> 'a t -> 'a

val find_map : ('a -> 'b option) -> 'a t -> 'b option

val find_mapi : (int -> 'a -> 'b option) -> 'a t -> 'b option

val find_idx : ('a -> bool) -> 'a t -> (int * 'a) option

val remove : eq:('a -> 'a -> bool) -> key:'a -> 'a t -> 'a t

val filter_map : ('a -> 'b option) -> 'a t -> 'b t

val keep_some : 'a option t -> 'a t

val keep_ok : ('a, 'b) Stdlib.result t -> 'a t

val all_some : 'a option t -> 'a t option

val all_ok : ('a, 'err) Stdlib.result t -> ('a t, 'err) Stdlib.result

val sorted_mem : cmp:('a -> 'a -> int) -> 'a -> 'a list -> bool

val sorted_merge : cmp:('a -> 'a -> int) -> 'a list -> 'a list -> 'a list

val sorted_diff : cmp:('a -> 'a -> int) -> 'a list -> 'a list -> 'a list

val sort_uniq : cmp:('a -> 'a -> int) -> 'a list -> 'a list

val sorted_merge_uniq : cmp:('a -> 'a -> int) -> 'a list -> 'a list -> 'a list

val sorted_diff_uniq : cmp:('a -> 'a -> int) -> 'a list -> 'a list -> 'a list

val is_sorted : cmp:('a -> 'a -> int) -> 'a list -> bool

val sorted_insert : 
  cmp:('a -> 'a -> int) ->
  ?uniq:bool ->
  'a ->
  'a list ->
  'a list

val sorted_remove : 
  cmp:('a -> 'a -> int) ->
  ?all:bool ->
  'a ->
  'a list ->
  'a list

val uniq_succ : eq:('a -> 'a -> bool) -> 'a list -> 'a list

val group_succ : eq:('a -> 'a -> bool) -> 'a list -> 'a list list

val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t

val iteri : (int -> 'a -> unit) -> 'a t -> unit

val iteri2 : (int -> 'a -> 'b -> unit) -> 'a t -> 'b t -> unit

val foldi : ('b -> int -> 'a -> 'b) -> 'b -> 'a t -> 'b

val foldi2 : ('c -> int -> 'a -> 'b -> 'c) -> 'c -> 'a t -> 'b t -> 'c

val get_at_idx : int -> 'a t -> 'a option

val nth_opt : 'a t -> int -> 'a option

val get_at_idx_exn : int -> 'a t -> 'a

val set_at_idx : int -> 'a -> 'a t -> 'a t

val insert_at_idx : int -> 'a -> 'a t -> 'a t

val remove_at_idx : int -> 'a t -> 'a t

val add_nodup : eq:('a -> 'a -> bool) -> 'a -> 'a t -> 'a t

val remove_one : eq:('a -> 'a -> bool) -> 'a -> 'a t -> 'a t

val mem : ?eq:('a -> 'a -> bool) -> 'a -> 'a t -> bool

val subset : eq:('a -> 'a -> bool) -> 'a t -> 'a t -> bool

val uniq : eq:('a -> 'a -> bool) -> 'a t -> 'a t

val union : eq:('a -> 'a -> bool) -> 'a t -> 'a t -> 'a t

val inter : eq:('a -> 'a -> bool) -> 'a t -> 'a t -> 'a t

val range_by : step:int -> int -> int -> int t

val range : int -> int -> int t

val range' : int -> int -> int t

val replicate : int -> 'a -> 'a t

val repeat : int -> 'a t -> 'a t

module Assoc : sig ... end

val assoc : eq:('a -> 'a -> bool) -> 'a -> ('a * 'b) t -> 'b

val assoc_opt : eq:('a -> 'a -> bool) -> 'a -> ('a * 'b) t -> 'b option

val assq_opt : 'a -> ('a * 'b) t -> 'b option

val mem_assoc : ?eq:('a -> 'a -> bool) -> 'a -> ('a * 'b) t -> bool

val remove_assoc : eq:('a -> 'a -> bool) -> 'a -> ('a * 'b) t -> ('a * 'b) t

module Ref : sig ... end

module type MONAD = sig ... end

module Traverse (M : MONAD) : sig ... end

val random : 'a random_gen -> 'a t random_gen

val random_non_empty : 'a random_gen -> 'a t random_gen

val random_len : int -> 'a random_gen -> 'a t random_gen

val random_choose : 'a t -> 'a random_gen

val random_sequence : 'a random_gen t -> 'a t random_gen

val to_string : 
  ?start:string ->
  ?stop:string ->
  ?sep:string ->
  ('a -> string) ->
  'a t ->
  string

val to_iter : 'a t -> 'a iter

val to_seq : 'a t -> 'a Stdlib.Seq.t

val of_iter : 'a iter -> 'a t

val of_seq_rev : 'a Stdlib.Seq.t -> 'a t

val of_seq : 'a Stdlib.Seq.t -> 'a t

val to_gen : 'a t -> 'a gen

val of_gen : 'a gen -> 'a t

module Infix : sig ... end

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

val (@) : 'a t -> 'a t -> 'a t

val (<*>) : ('a -> 'b) t -> 'a t -> 'b t

val (<$>) : ('a -> 'b) -> 'a t -> 'b t

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

val (--) : int -> int -> int t

val (--^) : int -> int -> int t

val let+ : 'a t -> ('a -> 'b) -> 'b t

val and+ : 'a t -> 'b t -> ('a * 'b) t

val let* : 'a t -> ('a -> 'b t) -> 'b t

val and* : 'a t -> 'b t -> ('a * 'b) t

val and& : 'a list -> 'b list -> ('a * 'b) list

val pp : 
  ?pp_start:unit printer ->
  ?pp_stop:unit printer ->
  ?pp_sep:unit printer ->
  'a printer ->
  'a t printer

package yices2_bindings