package GT

You can search for identifiers within the package.

in-package search v0.2.0

Generic programming with extensible transformations

Install

Dune Dependency

github.com Readme Edit opam file Versions (9)

Authors

Maintainers

K

Kakadu@pm.me

Sources

GT-v0.5.3.tbz

sha256=55f8249e780b9a1891d9d4bb5bf2f4f7fdc619a06d9f6f04961afe193cbaaac4

sha512=3a9422aafb7a4d22c484d03950603e7f05c10512ddeb7675fe5dce73f0ef8f3537eabad1d5ebfb99c6b2e952a6203c793a1cd9d62d2863cef31616a4256b99d2

doc/GT.common/GTCommon/HelpersBase/List/index.html

Module `HelpersBase.List`Source

include module type of struct include Stdppx.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 -> len: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 rev_append : 'a list -> 'a list -> 'a list

val flatten : 'a list list -> 'a list

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

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

val iteri : f:(int -> 'a -> unit) -> 'a list -> unit

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

val fold_left_map : 
  f:('acc -> 'a -> 'acc * 'b) ->
  init:'acc ->
  'a list ->
  'acc * 'b list

val fold_left : f:('acc -> 'a -> 'acc) -> init:'acc -> 'a list -> 'acc

val iter2 : f:('a -> 'b -> unit) -> 'a list -> 'b list -> unit

val rev_map2 : f:('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list

val fold_left2 : 
  f:('acc -> 'a -> 'b -> 'acc) ->
  init:'acc ->
  'a list ->
  'b list ->
  'acc

val for_all : f:('a -> bool) -> 'a list -> bool

val exists : f:('a -> bool) -> 'a list -> bool

val for_all2 : f:('a -> 'b -> bool) -> 'a list -> 'b list -> bool

val exists2 : f:('a -> 'b -> bool) -> 'a list -> 'b list -> bool

val mem : 'a -> set:'a list -> bool

val memq : 'a -> set:'a list -> bool

val find_opt : f:('a -> bool) -> 'a list -> 'a option

val find_index : f:('a -> bool) -> 'a list -> int option

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

val filter : f:('a -> bool) -> 'a list -> 'a list

val find_all : f:('a -> bool) -> 'a list -> 'a list

val filteri : f:(int -> 'a -> bool) -> 'a list -> 'a list

val partition : f:('a -> bool) -> 'a list -> 'a list * 'a list

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

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

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

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

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

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

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

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

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

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

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

val merge : [> `not_tail_recursive ]

val remove_assoc : [> `not_tail_recursive ]

val remove_assq : [> `not_tail_recursive ]

val rev_mapi : 'a t -> f:(int -> 'a -> 'b) -> 'b t

val fold_right2 : 
  'a list ->
  'b list ->
  init:'c ->
  f:('a -> 'b -> 'c -> 'c) ->
  'c

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

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

val fold_right : 'a list -> init:'b -> f:('a -> 'b -> 'b) -> 'b

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

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

val rev_combine : 'a list -> 'b list -> ('a * 'b) t

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

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

val map2 : 'a list -> 'b list -> f:('a -> 'b -> 'c) -> 'c list

val partition_map : 
  ('a -> ('b, 'c) Stdppx.Either.t) ->
  'a t ->
  'b list * 'c list

val init : len:int -> f:(int -> 'a) -> 'a list

val is_empty : 'a t -> bool

val rev_filter_opt : 'a option list -> 'a t

val filter_opt : 'a option list -> 'a list

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

val find_map_exn : 'a t -> f:('a -> 'b option) -> 'b

val last : 'a t -> 'a option

val split_while : 'a t -> f:('a -> bool) -> 'a list * 'a t

val find_a_dup : 'elt t -> compare:('elt -> 'elt -> int) -> 'elt option

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

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

Sourceval split3 : ('a * 'b * 'c) list -> 'a t * 'b t * 'c t

Sourceval filter_map : f:('a -> 'b option) -> 'a list -> 'b t

Sourceval hd_exn : 'a list -> 'a

Sourceval tl_exn : 'a list -> 'a list

Sourceval fold2_exn : f:('a -> 'b -> 'c -> 'a) -> init:'a -> 'b list -> 'c list -> 'a

Sourceval map2_exn : 'a list -> 'b list -> f:('a -> 'b -> 'c) -> 'c list

Sourceval last_exn : 'a list -> 'a

Sourceval pp : f:('a -> string) -> 'a list -> string

Sourceval fold_left0 : ('a -> 'a -> 'a) -> 'a t -> 'a

Sourceval concat_map : f:('a -> 'b list) -> 'a list -> 'b list

Sourceval empty : 'a t -> bool

Sourceval return : 'a -> 'a t

Sourceval zip_exn : 'a list -> 'b list -> ('a * 'b) list

Sourceval map3_exn : 'a t -> 'b t -> 'c t -> f:('a -> 'b -> 'c -> 'd) -> 'd t

Sourcemodule Assoc : sig ... end

Sourceval find : 'a list -> f:('a -> bool) -> 'a option

Sourceval remove_consecutive_duplicates : equal:('a -> 'a -> bool) -> 'a t -> 'a t