package p4spectec

  1. Overview
  2. Docs
package p4spectec
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module Kinds.TypHints

val empty : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t
val add : key -> 'a -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t
val add_to_list : key -> 'a -> 'a list Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a list Stdlib__Map.Make(Domain__Lib.CaseId).t
val update : key -> ('a option -> 'a option) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t
val singleton : key -> 'a -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t
val remove : key -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t
val merge : (key -> 'a option -> 'b option -> 'c option) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'b Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'c Stdlib__Map.Make(Domain__Lib.CaseId).t
val union : (key -> 'a -> 'a -> 'a option) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t
val cardinal : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> int
val bindings : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> (key * 'a) list
val min_binding : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> key * 'a
val min_binding_opt : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> (key * 'a) option
val max_binding : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> key * 'a
val max_binding_opt : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> (key * 'a) option
val choose : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> key * 'a
val choose_opt : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> (key * 'a) option
val find_opt : key -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a option
val find_first : (key -> bool) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> key * 'a
val find_first_opt : (key -> bool) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> (key * 'a) option
val find_last : (key -> bool) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> key * 'a
val find_last_opt : (key -> bool) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> (key * 'a) option
val iter : (key -> 'a -> unit) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> unit
val fold : (key -> 'a -> 'acc -> 'acc) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'acc -> 'acc
val map : ('a -> 'b) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'b Stdlib__Map.Make(Domain__Lib.CaseId).t
val mapi : (key -> 'a -> 'b) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'b Stdlib__Map.Make(Domain__Lib.CaseId).t
val filter : (key -> 'a -> bool) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t
val filter_map : (key -> 'a -> 'b option) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'b Stdlib__Map.Make(Domain__Lib.CaseId).t
val partition : (key -> 'a -> bool) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t * 'a Stdlib__Map.Make(Domain__Lib.CaseId).t
val split : key -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t * 'a option * 'a Stdlib__Map.Make(Domain__Lib.CaseId).t
val is_empty : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> bool
val is_singleton : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> bool
val mem : key -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> bool
val equal : ('a -> 'a -> bool) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> bool
val compare : ('a -> 'a -> int) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> int
val for_all : (key -> 'a -> bool) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> bool
val exists : (key -> 'a -> bool) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> bool
val to_list : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> (key * 'a) list
val to_seq : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> (key * 'a) Stdlib.Seq.t
val to_rev_seq : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> (key * 'a) Stdlib.Seq.t
val to_seq_from : key -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> (key * 'a) Stdlib.Seq.t
val add_seq : (key * 'a) Stdlib.Seq.t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t
val of_seq : (key * 'a) Stdlib.Seq.t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t
type !'v to_string_v = 'v -> string
val keys : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> key list
val dom : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> Stdlib__Set.Make(Domain__Lib.CaseId).t
val values : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a list
val extend : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t
val diff : 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'b Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t
val subset : ('a -> 'b -> bool) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'b Stdlib__Map.Make(Domain__Lib.CaseId).t -> bool
val eq : ('a -> 'a -> bool) -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> bool
val of_list : (key * 'a) list -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t
val of_lists : key list -> 'a list -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t
type t = Kind.t Stdlib__Map.Make(Domain__Lib.CaseId).t
val to_string : ?with_braces:??? -> ?bind:??? -> Kind.t Stdlib__Map.Make(Domain__Lib.CaseId).t -> string
val find : key -> 'a Stdlib__Map.Make(Domain__Lib.CaseId).t -> 'a