package comby

You can search for identifiers within the package.

in-package search v0.2.0

A tool for structural code search and replace that supports ~every language

Install

Dune Dependency

github.com Readme Edit opam file Versions (5)

Authors

R

Rijnard van Tonder

Maintainers

R

rvantonder@gmail.com

Sources

comby-kernel.1.7.0.tar.gz

md5=ee6556d8bd9b25ed0445ebe23862e48a

sha512=e6386c8ce5ef14bbcab2b0ead5b1edc39375438f56330d5f02e81e467afe6623a7e299f97f26008d77bbc62850c6dc63a7cbe5b81671b5183ff3adeee5946bb3

doc/comby.patdiff_kernel/Patdiff_kernel/Format/Style/Map/Tree/index.html

Module `Map.Tree`Source

include Core_kernel.Map_intf.Make_S_plain_tree(Key).S

Source

type 'a t =
  (Key.t, 'a, Key.comparator_witness) Base.Map.Using_comparator.Tree.t

include Core_kernel.Map_intf.Creators_and_accessors1
  with type 'a t := 'a t
  with type 'a tree := 'a t
  with type key := Key.t
  with type comparator_witness := Key.comparator_witness

include Core_kernel.Map_intf.Creators1
  with type 'a t := 'a t
  with type 'a tree := 'a t
  with type key := Key.t
  with type comparator_witness := Key.comparator_witness

include Base.Map.Creators1
  with type 'a t := 'a t
  with type 'a tree := 'a t
  with type key := Key.t
  with type comparator_witness := Key.comparator_witness

Sourceval empty : _ t

Sourceval singleton : Key.t -> 'a -> 'a t

Sourceval of_alist : (Key.t * 'a) list -> [ `Ok of 'a t | `Duplicate_key of Key.t ]

Sourceval of_alist_or_error : (Key.t * 'a) list -> 'a t Base.Or_error.t

Sourceval of_alist_exn : (Key.t * 'a) list -> 'a t

Sourceval of_alist_multi : (Key.t * 'a) list -> 'a list t

Sourceval of_alist_fold : (Key.t * 'a) list -> init:'b -> f:('b -> 'a -> 'b) -> 'b t

Sourceval of_alist_reduce : (Key.t * 'a) list -> f:('a -> 'a -> 'a) -> 'a t

Sourceval of_sorted_array : (Key.t * 'a) array -> 'a t Base.Or_error.t

Sourceval of_sorted_array_unchecked : (Key.t * 'a) array -> 'a t

Sourceval of_increasing_iterator_unchecked : len:int -> f:(int -> Key.t * 'a) -> 'a t

Source

val of_increasing_sequence : 
  (Key.t * 'a) Base.Sequence.t ->
  'a t Base.Or_error.t

Source

val of_sequence : 
  (Key.t * 'a) Base.Sequence.t ->
  [ `Ok of 'a t | `Duplicate_key of Key.t ]

Sourceval of_sequence_or_error : (Key.t * 'a) Base.Sequence.t -> 'a t Base.Or_error.t

Sourceval of_sequence_exn : (Key.t * 'a) Base.Sequence.t -> 'a t

Sourceval of_sequence_multi : (Key.t * 'a) Base.Sequence.t -> 'a list t

Source

val of_sequence_fold : 
  (Key.t * 'a) Base.Sequence.t ->
  init:'b ->
  f:('b -> 'a -> 'b) ->
  'b t

Source

val of_sequence_reduce : 
  (Key.t * 'a) Base.Sequence.t ->
  f:('a -> 'a -> 'a) ->
  'a t

Source

val of_iteri : 
  iteri:(f:(key:Key.t -> data:'v -> unit) -> unit) ->
  [ `Ok of 'v t | `Duplicate_key of Key.t ]

Sourceval of_tree : 'a t -> 'a t

Sourceval of_hashtbl_exn : (Key.t, 'a) Core_kernel.Hashtbl.t -> 'a t

Source

val of_key_set : 
  (Key.t, Key.comparator_witness) Base.Set.t ->
  f:(Key.t -> 'v) ->
  'v t

Source

val quickcheck_generator : 
  Key.t Core_kernel.Quickcheck.Generator.t ->
  'a Core_kernel.Quickcheck.Generator.t ->
  'a t Core_kernel.Quickcheck.Generator.t

include Core_kernel.Map_intf.Accessors1
  with type 'a t := 'a t
  with type 'a tree := 'a t
  with type key := Key.t
  with type comparator_witness := Key.comparator_witness

include Base.Map.Accessors1
  with type 'a t := 'a t
  with type 'a tree := 'a t
  with type key := Key.t
  with type comparator_witness := Key.comparator_witness

Sourceval invariants : _ t -> bool

Sourceval is_empty : _ t -> bool

Sourceval length : _ t -> int

Sourceval add : 'a t -> key:Key.t -> data:'a -> [ `Ok of 'a t | `Duplicate ]

Sourceval add_exn : 'a t -> key:Key.t -> data:'a -> 'a t

Sourceval set : 'a t -> key:Key.t -> data:'a -> 'a t

Sourceval add_multi : 'a list t -> key:Key.t -> data:'a -> 'a list t

Sourceval remove_multi : 'a list t -> Key.t -> 'a list t

Sourceval find_multi : 'a list t -> Key.t -> 'a list

Sourceval change : 'a t -> Key.t -> f:('a option -> 'a option) -> 'a t

Sourceval update : 'a t -> Key.t -> f:('a option -> 'a) -> 'a t

Sourceval find : 'a t -> Key.t -> 'a option

Sourceval find_exn : 'a t -> Key.t -> 'a

Sourceval remove : 'a t -> Key.t -> 'a t

Sourceval mem : _ t -> Key.t -> bool

Sourceval iter_keys : _ t -> f:(Key.t -> unit) -> unit

Sourceval iter : 'a t -> f:('a -> unit) -> unit

Sourceval iteri : 'a t -> f:(key:Key.t -> data:'a -> unit) -> unit

Source

val iteri_until : 
  'a t ->
  f:(key:Key.t -> data:'a -> Base__.Map_intf.Continue_or_stop.t) ->
  Base__.Map_intf.Finished_or_unfinished.t

Source

val iter2 : 
  'a t ->
  'b t ->
  f:
    (key:Key.t ->
      data:[ `Left of 'a | `Right of 'b | `Both of 'a * 'b ] ->
      unit) ->
  unit

Sourceval map : 'a t -> f:('a -> 'b) -> 'b t

Sourceval mapi : 'a t -> f:(key:Key.t -> data:'a -> 'b) -> 'b t

Sourceval fold : 'a t -> init:'b -> f:(key:Key.t -> data:'a -> 'b -> 'b) -> 'b

Sourceval fold_right : 'a t -> init:'b -> f:(key:Key.t -> data:'a -> 'b -> 'b) -> 'b

Source

val fold2 : 
  'a t ->
  'b t ->
  init:'c ->
  f:
    (key:Key.t ->
      data:[ `Left of 'a | `Right of 'b | `Both of 'a * 'b ] ->
      'c ->
      'c) ->
  'c

Sourceval filter_keys : 'a t -> f:(Key.t -> bool) -> 'a t

Sourceval filter : 'a t -> f:('a -> bool) -> 'a t

Sourceval filteri : 'a t -> f:(key:Key.t -> data:'a -> bool) -> 'a t

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

Sourceval filter_mapi : 'a t -> f:(key:Key.t -> data:'a -> 'b option) -> 'b t

Source

val partition_mapi : 
  'a t ->
  f:(key:Key.t -> data:'a -> ('b, 'c) Base.Either.t) ->
  'b t * 'c t

Sourceval partition_map : 'a t -> f:('a -> ('b, 'c) Base.Either.t) -> 'b t * 'c t

Sourceval partitioni_tf : 'a t -> f:(key:Key.t -> data:'a -> bool) -> 'a t * 'a t

Sourceval partition_tf : 'a t -> f:('a -> bool) -> 'a t * 'a t

Sourceval combine_errors : 'a Base.Or_error.t t -> 'a t Base.Or_error.t

Sourceval compare_direct : ('a -> 'a -> int) -> 'a t -> 'a t -> int

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

Sourceval keys : _ t -> Key.t list

Sourceval data : 'a t -> 'a list

Source

val to_alist : 
  ?key_order:[ `Increasing | `Decreasing ] ->
  'a t ->
  (Key.t * 'a) list

Source

val validate : 
  name:(Key.t -> string) ->
  'a Base.Validate.check ->
  'a t Base.Validate.check

Source

val validatei : 
  name:(Key.t -> string) ->
  (Key.t * 'a) Base.Validate.check ->
  'a t Base.Validate.check

Source

val merge : 
  'a t ->
  'b t ->
  f:
    (key:Key.t ->
      [ `Left of 'a | `Right of 'b | `Both of 'a * 'b ] ->
      'c option) ->
  'c t

Source

val symmetric_diff : 
  'a t ->
  'a t ->
  data_equal:('a -> 'a -> bool) ->
  (Key.t * [ `Left of 'a | `Right of 'a | `Unequal of 'a * 'a ])
    Base.Sequence.t

Source

val fold_symmetric_diff : 
  'a t ->
  'a t ->
  data_equal:('a -> 'a -> bool) ->
  init:'c ->
  f:
    ('c ->
      (Key.t * [ `Left of 'a | `Right of 'a | `Unequal of 'a * 'a ]) ->
      'c) ->
  'c

Sourceval min_elt : 'a t -> (Key.t * 'a) option

Sourceval min_elt_exn : 'a t -> Key.t * 'a

Sourceval max_elt : 'a t -> (Key.t * 'a) option

Sourceval max_elt_exn : 'a t -> Key.t * 'a

Sourceval for_all : 'a t -> f:('a -> bool) -> bool

Sourceval for_alli : 'a t -> f:(key:Key.t -> data:'a -> bool) -> bool

Sourceval exists : 'a t -> f:('a -> bool) -> bool

Sourceval existsi : 'a t -> f:(key:Key.t -> data:'a -> bool) -> bool

Sourceval count : 'a t -> f:('a -> bool) -> int

Sourceval counti : 'a t -> f:(key:Key.t -> data:'a -> bool) -> int

Sourceval split : 'a t -> Key.t -> 'a t * (Key.t * 'a) option * 'a t

Source

val append : 
  lower_part:'a t ->
  upper_part:'a t ->
  [ `Ok of 'a t | `Overlapping_key_ranges ]

Source

val subrange : 
  'a t ->
  lower_bound:Key.t Base.Maybe_bound.t ->
  upper_bound:Key.t Base.Maybe_bound.t ->
  'a t

Source

val fold_range_inclusive : 
  'a t ->
  min:Key.t ->
  max:Key.t ->
  init:'b ->
  f:(key:Key.t -> data:'a -> 'b -> 'b) ->
  'b

Sourceval range_to_alist : 'a t -> min:Key.t -> max:Key.t -> (Key.t * 'a) list

Source

val closest_key : 
  'a t ->
  [ `Greater_or_equal_to | `Greater_than | `Less_or_equal_to | `Less_than ] ->
  Key.t ->
  (Key.t * 'a) option

Sourceval nth : 'a t -> int -> (Key.t * 'a) option

Sourceval nth_exn : 'a t -> int -> Key.t * 'a

Sourceval rank : _ t -> Key.t -> int option

Sourceval to_tree : 'a t -> 'a t

Source

val to_sequence : 
  ?order:[ `Increasing_key | `Decreasing_key ] ->
  ?keys_greater_or_equal_to:Key.t ->
  ?keys_less_or_equal_to:Key.t ->
  'a t ->
  (Key.t * 'a) Base.Sequence.t

Source

val binary_search : 
  'a t ->
  compare:(key:Key.t -> data:'a -> 'key -> int) ->
  [ `Last_strictly_less_than
  | `Last_less_than_or_equal_to
  | `Last_equal_to
  | `First_equal_to
  | `First_greater_than_or_equal_to
  | `First_strictly_greater_than ] ->
  'key ->
  (Key.t * 'a) option

Source

val binary_search_segmented : 
  'a t ->
  segment_of:(key:Key.t -> data:'a -> [ `Left | `Right ]) ->
  [ `Last_on_left | `First_on_right ] ->
  (Key.t * 'a) option

Sourceval key_set : _ t -> (Key.t, Key.comparator_witness) Base.Set.t

Source

val quickcheck_observer : 
  Key.t Core_kernel.Quickcheck.Observer.t ->
  'v Core_kernel.Quickcheck.Observer.t ->
  'v t Core_kernel.Quickcheck.Observer.t

Source

val quickcheck_shrinker : 
  Key.t Core_kernel.Quickcheck.Shrinker.t ->
  'v Core_kernel.Quickcheck.Shrinker.t ->
  'v t Core_kernel.Quickcheck.Shrinker.t

Sourcemodule Provide_of_sexp (K : sig ... end) : sig ... end

include Base.Sexpable.S1 with type 'a t := 'a t

Sourceval t_of_sexp : (Sexplib0__.Sexp.t -> 'a) -> Sexplib0__.Sexp.t -> 'a t

Sourceval sexp_of_t : ('a -> Sexplib0__.Sexp.t) -> 'a t -> Sexplib0__.Sexp.t

package comby

Install

Dune Dependency

Authors

Maintainers

Sources

doc/comby.patdiff_kernel/Patdiff_kernel/Format/Style/Map/Tree/index.html

Module Map.TreeSource

Module `Map.Tree`Source