package core_extended

  1. Overview
  2. Docs
package core_extended
Legend:
Library
Module
Module type
Parameter
Class
Class type
type key
module Left_boundary : sig ... end
include Interval_map_intf.S with type Key.t = Left_boundary.t with type ('k, 'v, 'cmp) interval_map := ('k, 'v, 'cmp) t
module Interval : sig ... end
type +'a t = (Key.t, 'a, Key.comparator_witness) t
include sig ... end
val t_of_sexp : (Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a t
val sexp_of_t : ('a -> Sexplib.Sexp.t) -> 'a t -> Sexplib.Sexp.t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
include Core_kernel.Applicative.S with type 'a t := 'a t
val apply : ('a -> 'b) t -> 'a t -> 'b t
val map3 : 'a t -> 'b t -> 'c t -> f:('a -> 'b -> 'c -> 'd) -> 'd t
val both : 'a t -> 'b t -> ('a * 'b) t
module Applicative_infix : sig ... end
val (<*>) : ('a -> 'b) t -> 'a t -> 'b t
val (<*) : 'a t -> unit t -> 'a t
val (*>) : unit t -> 'a t -> 'a t
include Core_kernel.Monad.S with type 'a t := 'a t
val (>>=) : 'a t -> ('a -> 'b t) -> 'b t
val (>>|) : 'a t -> ('a -> 'b) -> 'b t
module Monad_infix : sig ... end
val bind : 'a t -> f:('a -> 'b t) -> 'b t
val return : 'a -> 'a t
val map : 'a t -> f:('a -> 'b) -> 'b t
val join : 'a t t -> 'a t
val ignore_m : 'a t -> unit t
val all : 'a t list -> 'a list t
val all_ignore : unit t list -> unit t
module Let_syntax : sig ... end
val create : left_of_leftmost:'a -> value_right_of:(Key.t, 'a, Key.comparator_witness) Core_kernel.Map.t -> 'a t
val always : 'a -> 'a t
val unit : unit t

All values of type unit t are equal.

val find : 'v t -> Key.t -> 'v
val change : 'v t -> at:Key.t -> 'v -> 'v t
val map2 : 'a t -> 'b t -> f:('a -> 'b -> 'c) -> 'c t
val remove_changes_within : 'v t -> Interval.t -> 'v t
val set_within : 'v t -> Interval.t -> 'v -> 'v t
val map_within : 'v t -> Interval.t -> f:('v -> 'v) -> 'v t
val construct_preimage : 'v t -> ('v * Interval.t) Core_kernel.Sequence.t
val find' : 'a t -> key -> 'a

Finding the value for an unwrapped key in an interval map based on wrapped keys means searching for the value at the point Inclusive k, because the point Exclusive k should not apply for keys equal to k. This can be very confusing, so find' k does this automatically.

OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct