package core-and-more

  1. Overview
  2. Docs
module IntIntDict : sig ... end
type t = {
  1. forward : IntIntDict.t;
  2. reverse : IntIntDict.t;
}
val compare : t -> t -> Ppx_deriving_runtime.int
val equal : t -> t -> Ppx_deriving_runtime.bool
val hash_fold_t : Base.Hash.state -> t -> Base.Hash.state
val hash : t -> Base.Hash.hash_value
val create_dict_of_pairs : int -> (int * int) list -> IntIntDict.t
val create_from_pairs : (int * int) list -> t
val create : int list -> t
val inverse : t -> t
val identity : int -> t
val apply_exn : t -> int -> int
val apply_inverse_exn : t -> int -> int
val apply_to_list_exn : t -> 'a list -> 'a0 list
val apply_inverse_to_list_exn : t -> 'a list -> 'a0 list
val size : t -> int
type swap_concat_compose_tree =
  1. | SCCTSwap of swap_concat_compose_tree * swap_concat_compose_tree
  2. | SCCTConcat of swap_concat_compose_tree * swap_concat_compose_tree
  3. | SCCTCompose of swap_concat_compose_tree * swap_concat_compose_tree
  4. | SCCTLeaf
val show_swap_concat_compose_tree : swap_concat_compose_tree -> Ppx_deriving_runtime.string
val hash_fold_swap_concat_compose_tree : Base.Hash.state -> swap_concat_compose_tree -> Base.Hash.state
val hash_swap_concat_compose_tree : swap_concat_compose_tree -> Base.Hash.hash_value
val size_scct : swap_concat_compose_tree -> int
val has_compose : swap_concat_compose_tree -> bool
val pp_swap_concat_compose_tree : swap_concat_compose_tree -> string
val as_int_list : t -> int list
val to_swap_concat_compose_tree : t -> swap_concat_compose_tree