package mula

  1. Overview
  2. Docs
ML's Universal Levenshtein Automata library

Install

Dune Dependency

Authors

Maintainers

Sources

mula-0.1.1.tbz
sha256=ee5333b6f30b68a26af55b7f2f5a1f4f1189c13f4b678735da5dbb4685d0e225
sha512=22f63d6a077b5825d0b1ce076fa23f39bf4ae4280befec0a8765079fb9f542de2858e9a51e86547d47017c646dfe2c9d1fdd1c99d9f4c30aebf4f7cc06cfe995

doc/mula.internal/Internal/DFA/NFAStateSetMap/index.html

Module DFA.NFAStateSetMapSource

include sig ... end
Sourcetype !'a t
Sourceval empty : 'a t
Sourceval add : key -> 'a -> 'a t -> 'a t
Sourceval add_to_list : key -> 'a -> 'a list t -> 'a list t
Sourceval update : key -> ('a option -> 'a option) -> 'a t -> 'a t
Sourceval singleton : key -> 'a -> 'a t
Sourceval remove : key -> 'a t -> 'a t
Sourceval merge : (key -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
Sourceval union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
Sourceval cardinal : 'a t -> int
Sourceval bindings : 'a t -> (key * 'a) list
Sourceval min_binding : 'a t -> key * 'a
Sourceval min_binding_opt : 'a t -> (key * 'a) option
Sourceval max_binding : 'a t -> key * 'a
Sourceval max_binding_opt : 'a t -> (key * 'a) option
Sourceval choose : 'a t -> key * 'a
Sourceval choose_opt : 'a t -> (key * 'a) option
Sourceval find : key -> 'a t -> 'a
Sourceval find_opt : key -> 'a t -> 'a option
Sourceval find_first : (key -> bool) -> 'a t -> key * 'a
Sourceval find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option
Sourceval find_last : (key -> bool) -> 'a t -> key * 'a
Sourceval find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option
Sourceval iter : (key -> 'a -> unit) -> 'a t -> unit
Sourceval fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
Sourceval map : ('a -> 'b) -> 'a t -> 'b t
Sourceval mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
Sourceval filter : (key -> 'a -> bool) -> 'a t -> 'a t
Sourceval filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t
Sourceval partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
Sourceval split : key -> 'a t -> 'a t * 'a option * 'a t
Sourceval is_empty : 'a t -> bool
Sourceval mem : key -> 'a t -> bool
Sourceval equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
Sourceval compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
Sourceval for_all : (key -> 'a -> bool) -> 'a t -> bool
Sourceval exists : (key -> 'a -> bool) -> 'a t -> bool
Sourceval to_list : 'a t -> (key * 'a) list
Sourceval of_list : (key * 'a) list -> 'a t
Sourceval to_seq : 'a t -> (key * 'a) Seq.t
Sourceval to_rev_seq : 'a t -> (key * 'a) Seq.t
Sourceval to_seq_from : key -> 'a t -> (key * 'a) Seq.t
Sourceval add_seq : (key * 'a) Seq.t -> 'a t -> 'a t
Sourceval of_seq : (key * 'a) Seq.t -> 'a t
Sourceval pp_kv_pair : pp_val:(Format.formatter -> 'a -> unit) -> Format.formatter -> (NFA.StateSet.t * 'a) -> unit
Sourceval pp_map : pp_val:(Format.formatter -> 'a -> unit) -> Format.formatter -> 'a t -> unit
OCaml

Innovation. Community. Security.