package regenerate

You can search for identifiers within the package.

in-package search v0.2.0

package regenerate

regenerate
- Regenerate
  - Make
    
    IMap
    
    Segment
    
    Sigma
    
    Sigma_star
    
    Word
  - Regex
  - SIGMA
  - Word
    
    List
    
    C
    
    S
    
    String
regenerate.segments
- Segments
  - OrderedMonoid
  - S
  - Trie
    
    Make
    
    W
    
    String
    
    WORD

Legend:
Library
Module
Module type
Parameter
Class
Class type

include sig ... end

type key = CCInt.t

type 'a t = 'a Stdlib.Map.Make(CCInt).t

val empty : 'a t

val is_empty : 'a t -> bool

val mem : key -> 'a t -> bool

val add : key -> 'a -> 'a t -> 'a t

val singleton : key -> 'a -> 'a t

val remove : key -> 'a t -> 'a t

val merge : 
  (key -> 'a option -> 'b option -> 'c option) ->
  'a t ->
  'b t ->
  'c t

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

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

val iter : (key -> 'a -> unit) -> 'a t -> unit

val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b

val for_all : (key -> 'a -> bool) -> 'a t -> bool

val exists : (key -> 'a -> bool) -> 'a t -> bool

val filter : (key -> 'a -> bool) -> 'a t -> 'a t

val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

val cardinal : 'a t -> int

val bindings : 'a t -> (key * 'a) list

val min_binding : 'a t -> key * 'a

val max_binding : 'a t -> key * 'a

val choose : 'a t -> key * 'a

val split : key -> 'a t -> 'a t * 'a option * 'a t

val find : key -> 'a t -> 'a

val find_last : (key -> bool) -> 'a t -> key * 'a

val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

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

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

val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

val get : key -> 'a t -> 'a option

val get_or : key -> 'a t -> default:'a -> 'a

val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

val choose_opt : 'a t -> (key * 'a) option

val min_binding_opt : 'a t -> (key * 'a) option

val max_binding_opt : 'a t -> (key * 'a) option

val find_opt : key -> 'a t -> 'a option

val find_first : (key -> bool) -> 'a t -> key * 'a

val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

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

val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

val add_std_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> 'a t

val of_std_seq : (key * 'a) Stdlib.Seq.t -> 'a t

val add_iter : 'a t -> (key * 'a) CCMap.iter -> 'a t

val of_iter : (key * 'a) CCMap.iter -> 'a t

val to_iter : 'a t -> (key * 'a) CCMap.iter

val of_seq : (key * 'a) CCMap.sequence -> 'a t

deprecated use of_iter instead

val add_seq : 'a t -> (key * 'a) CCMap.sequence -> 'a t

deprecated use add_iter instead

val to_seq : 'a t -> (key * 'a) CCMap.sequence

deprecated use to_iter instead

val of_list : (key * 'a) list -> 'a t

val add_list : 'a t -> (key * 'a) list -> 'a t

val keys : 'a t -> key CCMap.iter

val values : 'a t -> 'a CCMap.iter

val to_list : 'a t -> (key * 'a) list

val pp : 
  ?start:string ->
  ?stop:string ->
  ?arrow:string ->
  ?sep:string ->
  key CCMap.printer ->
  'a CCMap.printer ->
  'a t CCMap.printer

val save : key -> Segment.t -> Segment.t t -> Segment.t t