package General

  1. Overview
  2. Docs
Legend:
Library
Module
Module type
Parameter
Class
Class type
include sig ... end
type t = String.t list
module O : sig ... end
val empty : t
val singleton : String.t -> t
val of_list : String.t list -> t
val to_list : t -> String.t list
val of_array : String.t array -> t
val to_array : t -> String.t array
val size : t -> int
val is_empty : t -> bool
val head : t -> String.t
val tail : t -> t
val try_head : t -> String.t option
val try_tail : t -> t option
val prepend : String.t -> t -> t
val reverse : t -> t
val concat : t -> t -> t
val map : t -> f:(String.t -> String.t) -> t
val map_i : t -> f:(i:int -> String.t -> String.t) -> t
val map_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> 'acc * String.t) -> t
val filter : t -> f:(String.t -> bool) -> t
val filter_i : t -> f:(i:int -> String.t -> bool) -> t
val filter_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> 'acc * bool) -> t
val filter_map : t -> f:(String.t -> String.t option) -> t
val filter_map_i : t -> f:(i:int -> String.t -> String.t option) -> t
val filter_map_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> 'acc * String.t option) -> t
val flat_map : t -> f:(String.t -> t) -> t
val flat_map_i : t -> f:(i:int -> String.t -> t) -> t
val flat_map_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> 'acc * t) -> t
val fold : init:'b -> t -> f:('b -> String.t -> 'b) -> 'b
val fold_i : init:'b -> t -> f:(i:int -> 'b -> String.t -> 'b) -> 'b
val fold_acc : acc:'acc -> init:'b -> t -> f:(acc:'acc -> 'b -> String.t -> 'acc * 'b) -> 'b
val reduce : t -> f:(String.t -> String.t -> String.t) -> String.t
val reduce_i : t -> f:(i:int -> String.t -> String.t -> String.t) -> String.t
val reduce_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> String.t -> 'acc * String.t) -> String.t
val try_reduce : t -> f:(String.t -> String.t -> String.t) -> String.t option
val try_reduce_i : t -> f:(i:int -> String.t -> String.t -> String.t) -> String.t option
val try_reduce_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> String.t -> 'acc * String.t) -> String.t option
val iter : t -> f:(String.t -> unit) -> unit
val iter_i : t -> f:(i:int -> String.t -> unit) -> unit
val iter_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> 'acc) -> unit
val count : t -> f:(String.t -> bool) -> int
val count_i : t -> f:(i:int -> String.t -> bool) -> int
val count_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> 'acc * bool) -> int
val fold_short : init:'b -> t -> f:('b -> String.t -> Shorten.t * 'b) -> 'b
val fold_short_i : init:'b -> t -> f:(i:int -> 'b -> String.t -> Shorten.t * 'b) -> 'b
val fold_short_acc : acc:'acc -> init:'b -> t -> f:(acc:'acc -> 'b -> String.t -> 'acc * Shorten.t * 'b) -> 'b
val reduce_short : t -> f:(String.t -> String.t -> Shorten.t * String.t) -> String.t
val reduce_short_i : t -> f:(i:int -> String.t -> String.t -> Shorten.t * String.t) -> String.t
val reduce_short_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> String.t -> 'acc * Shorten.t * String.t) -> String.t
val try_reduce_short : t -> f:(String.t -> String.t -> Shorten.t * String.t) -> String.t option
val try_reduce_short_i : t -> f:(i:int -> String.t -> String.t -> Shorten.t * String.t) -> String.t option
val try_reduce_short_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> String.t -> 'acc * Shorten.t * String.t) -> String.t option
val iter_short : t -> f:(String.t -> Shorten.t) -> unit
val iter_short_i : t -> f:(i:int -> String.t -> Shorten.t) -> unit
val iter_short_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> 'acc * Shorten.t) -> unit
val for_all : t -> f:(String.t -> bool) -> bool
val for_all_i : t -> f:(i:int -> String.t -> bool) -> bool
val for_all_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> 'acc * bool) -> bool
val there_exists : t -> f:(String.t -> bool) -> bool
val there_exists_i : t -> f:(i:int -> String.t -> bool) -> bool
val there_exists_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> 'acc * bool) -> bool
val find : t -> f:(String.t -> bool) -> String.t
val find_i : t -> f:(i:int -> String.t -> bool) -> String.t
val find_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> 'acc * bool) -> String.t
val try_find : t -> f:(String.t -> bool) -> String.t option
val try_find_i : t -> f:(i:int -> String.t -> bool) -> String.t option
val try_find_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> 'acc * bool) -> String.t option
val find_map : t -> f:(String.t -> 'b option) -> 'b
val find_map_i : t -> f:(i:int -> String.t -> 'b option) -> 'b
val find_map_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> 'acc * 'b option) -> 'b
val try_find_map : t -> f:(String.t -> 'b option) -> 'b option
val try_find_map_i : t -> f:(i:int -> String.t -> 'b option) -> 'b option
val try_find_map_acc : acc:'acc -> t -> f:(acc:'acc -> String.t -> 'acc * 'b option) -> 'b option
val scan : init:String.t -> t -> f:(String.t -> String.t -> String.t) -> t
val scan_i : init:String.t -> t -> f:(i:int -> String.t -> String.t -> String.t) -> t
val scan_acc : acc:'acc -> init:String.t -> t -> f:(acc:'acc -> String.t -> String.t -> 'acc * String.t) -> t
val scan_short : init:String.t -> t -> f:(String.t -> String.t -> Shorten.t * String.t) -> t
val scan_short_i : init:String.t -> t -> f:(i:int -> String.t -> String.t -> Shorten.t * String.t) -> t
val scan_short_acc : acc:'acc -> init:String.t -> t -> f:(acc:'acc -> String.t -> String.t -> 'acc * Shorten.t * String.t) -> t
module ToList : sig ... end
include sig ... end
val contains : t -> String.t -> bool
val join : ?sep:string -> t -> string
OCaml

Innovation. Community. Security.