package mula

You can search for identifiers within the package.

in-package search v0.2.0

package mula

mula
- Mula
  - Match
    
    Make
    
    Dem
    
    Lev
    
    St
    
    S
  - Strings
    
    Dem
    
    Lev
mula.internal
- Internal
  - BitVec
  - DFA
    
    DFA
    
    NFAStateSetMap
    
    NFAStateSetSet
    
    Transitions
  - DemarauNFA
    
    State
    
    StateSet
    
    Transitions
  - NFA
    
    State
    
    StateSet
    
    Transitions
  - StringOps
    
    BitVecOps
    
    St
    
    S

Legend:
Library
Module
Module type
Parameter
Class
Class type

include sig ... end

type elt = State.t

type t

val empty : t

val add : elt -> t -> t

val singleton : elt -> t

val remove : elt -> t -> t

val union : t -> t -> t

val inter : t -> t -> t

val disjoint : t -> t -> bool

val diff : t -> t -> t

val cardinal : t -> int

val elements : t -> elt list

val min_elt : t -> elt

val min_elt_opt : t -> elt option

val max_elt : t -> elt

val max_elt_opt : t -> elt option

val choose : t -> elt

val choose_opt : t -> elt option

val find : elt -> t -> elt

val find_opt : elt -> t -> elt option

val find_first : (elt -> bool) -> t -> elt

val find_first_opt : (elt -> bool) -> t -> elt option

val find_last : (elt -> bool) -> t -> elt

val find_last_opt : (elt -> bool) -> t -> elt option

val iter : (elt -> unit) -> t -> unit

val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

val map : (elt -> elt) -> t -> t

val filter : (elt -> bool) -> t -> t

val filter_map : (elt -> elt option) -> t -> t

val partition : (elt -> bool) -> t -> t * t

val split : elt -> t -> t * bool * t

val is_empty : t -> bool

val mem : elt -> t -> bool

val equal : t -> t -> bool

val compare : t -> t -> int

val subset : t -> t -> bool

val for_all : (elt -> bool) -> t -> bool

val exists : (elt -> bool) -> t -> bool

val to_list : t -> elt list

val of_list : elt list -> t

val to_seq_from : elt -> t -> elt Seq.t

val to_seq : t -> elt Seq.t

val to_rev_seq : t -> elt Seq.t

val add_seq : elt Seq.t -> t -> t

val of_seq : elt Seq.t -> t

val subsumed_by : elt -> elt -> bool

val not_subsumed_by : elt -> elt -> bool

val reduce : t -> t

val min_cost : t -> int

val min_cost_opt : t -> int option

val start : t

val err : t

val is_err : t -> bool

val print_states : t -> unit

val pp_comma : Format.formatter -> unit -> unit

val pp_states : Format.formatter -> t -> unit