package camlpdf

  1. Overview
  2. Docs
val position_gen : int -> 'a -> 'b list -> int option
val position : 'a -> 'b list -> int option
val position_1 : 'a -> 'b list -> int option
val string_replace_all : string -> string -> string -> string
val string_replace_all_lazy : string -> (unit -> string) -> string -> string
val flprint : string -> unit
val dp_print : bool ref
val dpr : string -> unit
val sort : ('a -> 'a -> int) -> 'a list -> 'a list
val hd : 'a list -> 'a
val tl : 'a list -> 'a list
val rev : 'a list -> 'a list
val iter : ('a -> unit) -> 'a list -> unit
val iter2 : ('a -> 'b -> unit) -> 'a list -> 'b list -> unit
val iter3 : ('a -> 'b -> 'c -> 'd) -> 'e list -> 'f list -> 'g list -> unit
val append : 'a list -> 'b list -> 'b list
val (@) : 'a list -> 'a list -> 'a list
val flatten : 'a list list -> 'a list
val rev_map : ('a -> 'b) -> 'a list -> 'b list
val map : ('a -> 'b) -> 'a list -> 'c list
val map2 : ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'd list
val split : ('a * 'b) list -> 'a list * 'b list
val split3 : ('a * 'b * 'c) list -> 'a list * 'b list * 'c list
val split5 : ('a * 'b * 'c * 'd * 'e) list -> 'a list * 'b list * 'c list * 'd list * 'e list
val split6 : ('a * 'b * 'c * 'd * 'e * 'f) list -> 'a list * 'b list * 'c list * 'd list * 'e list * 'f list
val split8 : ('a * 'b * 'c * 'd * 'e * 'f * 'g * 'h) list -> 'a list * 'b list * 'c list * 'd list * 'e list * 'f list * 'g list * 'h list
val combine : 'a list -> 'b list -> ('c * 'd) list
val combine3 : 'a list -> 'b list -> 'c list -> ('d * 'e * 'f) list
val fold_left : ('a -> 'b -> 'a) -> 'c -> 'b list -> 'd
val fold_right : ('a -> 'b -> 'c) -> 'd list -> 'e -> 'f
val length : 'a list -> int
val rev_map3_inner : ('a -> 'b -> 'c -> 'd) -> 'e list -> 'f list -> 'g list -> 'h list -> 'h list
val rev_map3 : ('a -> 'b -> 'c -> 'd) -> 'a list -> 'b list -> 'c list -> 'd list
val map3 : ('a -> 'b -> 'c -> 'd) -> 'a list -> 'b list -> 'c list -> 'e list
val rev_map4_inner : ('a -> 'b -> 'c -> 'd -> 'e) -> 'f list -> 'g list -> 'h list -> 'i list -> 'j list -> 'j list
val rev_map4 : ('a -> 'b -> 'c -> 'd -> 'e) -> 'a list -> 'b list -> 'c list -> 'd list -> 'e list
val map4 : ('a -> 'b -> 'c -> 'd -> 'e) -> 'a list -> 'b list -> 'c list -> 'd list -> 'f list
val rev_map5_inner : ('a -> 'b -> 'c -> 'd -> 'e -> 'f) -> 'g list -> 'h list -> 'i list -> 'j list -> 'k list -> 'l list -> 'l list
val rev_map5 : ('a -> 'b -> 'c -> 'd -> 'e -> 'f) -> 'a list -> 'b list -> 'c list -> 'd list -> 'e list -> 'f list
val map5 : ('a -> 'b -> 'c -> 'd -> 'e -> 'f) -> 'a list -> 'b list -> 'c list -> 'd list -> 'e list -> 'g list
val cumulative_sum : int -> int list -> int list
val split_around_inner : ('a -> bool) -> 'b list list -> 'c list -> 'd list -> 'b list list
val split_around : ('a -> bool) -> 'a list -> 'a list list
val lcount_inner : ('a -> bool) -> int -> 'b list -> int
val lcount : ('a -> bool) -> 'a list -> int
val index_inner : int -> ('a -> bool) -> 'b list -> int
val index : ('a -> bool) -> 'a list -> int
val firstchar : string -> char option
val lastchar : string -> char option
val explode : string -> char list
val implode : char list -> string
val string_of_char : char -> string
val i32ofi : int -> int32
val i32toi : int32 -> int
val i32tof : int32 -> float
val i32add : int32 -> int32 -> int32
val i32sub : int32 -> int32 -> int32
val i32mul : int32 -> int32 -> int32
val i32div : int32 -> int32 -> int32
val lsr32 : int32 -> int -> int32
val lsl32 : int32 -> int -> int32
val lor32 : int32 -> int32 -> int32
val land32 : int32 -> int32 -> int32
val lnot32 : int32 -> int32
val lxor32 : int32 -> int32 -> int32
val i32succ : int32 -> int32
val i32pred : int32 -> int32
val i32max : 'a -> 'a -> 'a
val i32min : 'a -> 'a -> 'a
val i64ofi : int -> int64
val i64toi : int64 -> int
val i64tof : int64 -> float
val i64add : int64 -> int64 -> int64
val i64sub : int64 -> int64 -> int64
val i64mul : int64 -> int64 -> int64
val i64div : int64 -> int64 -> int64
val lsr64 : int64 -> int -> int64
val lsl64 : int64 -> int -> int64
val land64 : int64 -> int64 -> int64
val lor64 : int64 -> int64 -> int64
val lnot64 : int64 -> int64
val lxor64 : int64 -> int64 -> int64
val i64succ : int64 -> int64
val i64pred : int64 -> int64
val i64max : 'a -> 'a -> 'a
val i64min : 'a -> 'a -> 'a
val i32ofi64 : int64 -> int32
val i64ofi32 : int32 -> int64
val sign_extend : int -> int -> int
val set_array : 'a array -> 'b -> unit
val do_return : (unit -> 'a) -> (unit -> 'b) -> 'c
val do_many : (unit -> 'a) -> int -> unit
val interleave : 'a -> 'b list -> 'b list
val interleave_lists : 'a list -> 'a list -> 'a list
val (=|) : 'a list ref -> 'b -> unit
val (=@) : 'a list ref -> 'a list -> unit
val isdigit : char -> bool
val toint : float -> int
val notpred : ('a -> bool) -> 'b -> bool
val eq : 'a -> 'a -> bool
val neq : 'a -> 'a -> bool
val map_lol : ('a -> 'b) -> 'a list list -> 'b list list
val pow : int -> int -> int
val lookup : 'a -> ('b * 'c) list -> 'd option
val lookup_failnull : 'a -> ('b * 'c) list -> 'd
val add : 'a -> 'b -> ('c * 'd) list -> ('c * 'd) list
val replace : 'a -> 'b -> ('c * 'd) list -> ('c * 'd) list
val remove : 'a -> ('b * 'c) list -> ('b * 'c) list
val mergedict : ('a * 'b) list -> ('c * 'd) list -> ('a * 'b) list
val (<|) : ('a -> 'b) -> 'c -> 'd
val (@@) : 'a list -> 'a list -> 'a list
val conspair : (('a * 'b) * ('c list * 'd list)) -> 'c list * 'd list
val conspairopt : (('a option * 'b option) * ('c list * 'd list)) -> 'c list * 'd list
val pairs_of_list : 'a list -> ('a * 'a) list
val replaceinlist : ('a -> bool) -> 'b -> 'a list -> 'a list
val pairs : 'a list -> ('a * 'a) list
val mem : 'a -> 'a list -> bool
val mem' : 'a list -> 'b -> bool
val setify_simple : 'a list -> 'a list
val setify_preserving_order : 'a list -> 'b list
val sorted_setify : 'a list -> 'b list -> 'c list
val setify : 'a list -> 'b list
val setminus : 'a list -> 'a list -> 'a list
val setminus_preserving_order : 'a list -> 'a list -> 'b list
val heads : 'a list list -> 'a list
val tails : 'a list list -> 'a list list
val zipn : 'a list list -> 'a list list
val drop_evens : 'a list -> 'a list
val really_drop_evens : 'a list -> 'a list
val drop_odds : 'a list -> 'a list
val tail_no_fail : 'a list -> 'b list
val couple : ('a -> 'a -> 'b) -> 'a list -> 'b list
val couple_ext : ('a -> 'a -> 'b) -> ('a -> 'b) -> 'a list -> 'b list
val couple_reduce : ('a -> 'a -> 'b) -> 'a list -> 'c
val pair : ('a -> 'a -> 'a) -> 'a list -> 'a list
val pair_ext : ('a -> 'a -> 'b) -> ('a -> 'b) -> 'a list -> 'b list
val pair_reduce : ('a -> 'a -> 'a) -> 'a list -> 'b
val keep : ('a -> bool) -> 'a list -> 'a list
val lose_inner : 'a list -> ('b -> bool) -> 'c list -> 'd list
val lose : ('a -> bool) -> 'a list -> 'a list
val many : 'a -> n:int -> 'b list
val manyunique : (unit -> 'a) -> int -> 'a list
val take : 'a list -> int -> 'a list
val take' : int -> 'a list -> 'a list
val takewhile_reverse : ('a -> bool) -> 'a list -> 'a list
val takewhile : ('a -> bool) -> 'a list -> 'a list
val drop_inner : int -> 'a list -> 'b list
val drop : 'a list -> int -> 'a list
val drop' : int -> 'a list -> 'a list
val dropwhile : ('a -> bool) -> 'b list -> 'c list
val cleave : 'a list -> int -> 'a list * 'a list
val cleavewhile : ('a -> bool) -> 'a list -> 'a list * 'a list
val cleavewhile_unordered : ('a -> bool) -> 'a list -> 'a list * 'a list
val isolate : ('a -> bool) -> ('b -> bool) -> 'c list -> 'd list
val collate : ('a -> 'b -> int) -> 'c list -> 'd list list
val splitinto : int -> 'a list -> 'a list list
val takeatmost : int -> 'a list -> 'b list
val dropatmost : int -> 'a list -> 'a list
val splitinto_small : int -> 'a list -> 'b list list
val splitat_inner : 'a list list -> 'a list -> int list -> 'a list list
val splitat : int list -> 'a list -> 'a list list
val select : int -> 'a list -> 'b
val replace_number_inner : 'a list -> int -> 'b -> 'c list -> 'd list
val replace_number : int -> 'a -> 'b list -> 'b list
val isnull : 'a list -> bool
val notnull : 'a list -> bool
val last : 'a list -> 'b
val all_but_last : 'a list -> 'b list
val extremes : 'a list -> 'b * 'c
val extremes_and_middle : 'a list -> 'b * 'c list * 'd
val set : bool ref -> unit
val clear : bool ref -> unit
val flip : bool ref -> unit
val (+=) : int ref -> int -> unit
val (-=) : int ref -> int -> unit
val (/=) : int ref -> int -> unit
val (*=) : int ref -> int -> unit
val (+.=) : float ref -> float -> unit
val (-.=) : float ref -> float -> unit
val (/.=) : float ref -> float -> unit
val (*.=) : float ref -> float -> unit
type vector = float * float
val mkvector : (float * float) -> (float * float) -> float * float
val invert : (float * float) -> float * float
val offset_point : (float * float) -> (float * float) -> float * float
val perpendicular : ('a * float) -> float * 'b
val sqr : float -> float
val veclength : (float * float) -> float
val scalevectolength : float -> (float * float) -> float * float
val mkunitvector : (float * float) -> (float * float) -> float * float
val between : (float * float) -> (float * float) -> float * float
val distance_between : (float * float) -> (float * float) -> float
val largest_pow2_divisible : int -> int
val pow2lt : int -> int
val pow2gt : int -> int
val log2of : int -> int
val compare_i : int -> int -> int
val rev_compare : 'a -> 'b -> int
val ilist : int -> int -> int list
val ilist_null : int -> int -> int list
val ilist_fail_null : int -> int -> int list
val indx : 'a list -> int list
val indx0 : 'a list -> int list
val indxn : int -> 'a list -> int list
val even : int -> bool
val odd : int -> bool
val (|&|) : bool -> bool -> bool
val ident : 'a -> 'b
val array_iter2 : ('a -> 'b -> 'c) -> 'd array -> 'e array -> unit
val array_map2 : ('a -> 'b -> 'c) -> 'd array -> 'e array -> 'f array
val some : 'a option -> bool
val none : 'a option -> bool
val unopt : 'a option -> 'b
val losenones : 'a option list -> 'a list
val option_map : ('a -> 'b option) -> 'a list -> 'b list
val option_map2 : ('a -> 'b -> 'c option) -> 'a list -> 'b list -> 'c list
val min : int -> int -> int
val max : int -> int -> int
val fmin : float -> float -> float
val fmax : float -> float -> float
val fabs : float -> float
val box_union : (int * int * int * int) -> (int * int * int * int) -> int * int * int * int
val box_union_float : (float * float * float * float) -> (float * float * float * float) -> float * float * float * float
val box_overlap : int -> int -> int -> int -> int -> int -> int -> int -> (int * int * int * int) option
val box_overlap_float : float -> float -> float -> float -> float -> float -> float -> float -> (float * float * float * float) option
val applyn : ('a -> 'b) -> int -> 'c -> 'd
type 'a tree =
  1. | Lf
  2. | Br of 'a * 'a tree * 'a tree
val pi : float
val root2 : float
val rad_of_deg : float -> float
val deg_of_rad : float -> float
val always : 'a -> bool
val never : 'a -> bool
val null_hash : unit -> ('a, 'b) Hashtbl.t
val tryfind : ('a, 'b) Hashtbl.t -> 'c -> 'd option
val list_of_hashtbl : ('a, 'b) Hashtbl.t -> ('c * 'd) list
val hashtable_of_dictionary : ('a * 'b) list -> ('c, 'd) Hashtbl.t
val hashset_of_list : 'a list -> ('b, unit) Hashtbl.t
val round : float -> float
val iround : float -> int
val safe_float : float -> float
val tuple : 'a -> 'b -> 'c * 'd
val mkunit : ('a -> 'b) -> 'c -> unit -> 'd
val swap : 'a array -> int -> int -> unit
val print_floats : float list -> unit
val print_ints : int list -> unit
val print_int32s : int32 list -> unit
val leafnames_of_dir : string -> string list
val roman_vals : (int * string) list
val roman : int -> string
val roman_upper : int -> string
val roman_lower : int -> string
val memoize : (unit -> 'a) -> unit -> 'b
OCaml

Innovation. Community. Security.