package memtrace_viewer

  1. Overview
  2. Docs
package memtrace_viewer
Legend:
Library
Module
Module type
Parameter
Class
Class type
module Point : sig ... end
type t = Point.t t
include Sexplib0.Sexpable.S with type t := t
val t_of_sexp : Sexplib0.Sexp.t -> t
val sexp_of_t : t -> Sexplib0.Sexp.t
include Core.Bin_prot.Binable.S with type t := t
include Bin_prot.Binable.S_only_functions with type t := t
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write.writer
val bin_read_t : t Bin_prot.Read.reader
val __bin_read_t__ : (int -> t) Bin_prot.Read.reader

This function only needs implementation if t exposed to be a polymorphic variant. Despite what the type reads, this does *not* produce a function after reading; instead it takes the constructor tag (int) before reading and reads the rest of the variant t afterwards.

val bin_shape_t : Bin_prot.Shape.t
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
include Ppx_compare_lib.Equal.S with type t := t
val equal : t -> t -> bool
include Ppx_quickcheck_runtime.Quickcheckable.S with type t := t
val quickcheck_generator : t Base_quickcheck.Generator.t
val quickcheck_observer : t Base_quickcheck.Observer.t
val quickcheck_shrinker : t Base_quickcheck.Shrinker.t
val range : Point.t Bound.t -> Point.t Bound.t -> t
val at_least : Point.t -> t
val at_most : Point.t -> t
val greater_than : Point.t -> t
val less_than : Point.t -> t
val all : t
val is_all : t -> bool
val join : t -> t -> t

Return the join of two ranges. This is an approximation to the setwise union, since the union of two disjoint intervals is not in general an interval.

val compare_point : Point.t -> t -> int

Return -1 if the given value is less than the whole range, 0 if it's within the range (inclusive), or 1 if it's greater than the whole range.

val covers_points : t -> lower:Point.t -> upper:Point.t -> bool

Return whether the range's lower bound is either No_bound or less than lower and its upper bound is either No_bound or greater than upper.

val disjoint : t -> t -> bool
module Or_empty : sig ... end
val inter : t -> t -> Or_empty.t
val inter_opt : t -> t -> t option
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