package memtrace_viewer

You can search for identifiers within the package.

in-package search v0.2.0

Interactive memory profiler based on Memtrace

Install

Dune Dependency

github.com MIT License Edit opam file Versions (5)

Authors

J

Jane Street Group, LLC <opensource@janestreet.com>

Maintainers

O

opensource@janestreet.com

Sources

memtrace_viewer-v0.15.0.tar.gz

sha256=b21d4895f874e48b9f271fb3166ea98c14e7cb1850d621c1e3275f0290d9e338

doc/memtrace_viewer.common/Memtrace_viewer_common/Range/Byte_units/index.html

Module `Range.Byte_units`Source

Sourcemodule Point : sig ... end

Sourcetype t = Point.t t

include Sexplib0.Sexpable.S with type t := t

Sourceval t_of_sexp : Sexplib0.Sexp.t -> t

Sourceval 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

Sourceval bin_size_t : t Bin_prot.Size.sizer

Sourceval bin_write_t : t Bin_prot.Write.writer

Sourceval bin_read_t : t Bin_prot.Read.reader

Sourceval __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.

Sourceval bin_shape_t : Bin_prot.Shape.t

Sourceval bin_writer_t : t Bin_prot.Type_class.writer

Sourceval bin_reader_t : t Bin_prot.Type_class.reader

Sourceval bin_t : t Bin_prot.Type_class.t

include Ppx_compare_lib.Equal.S with type t := t

Sourceval equal : t Base__Ppx_compare_lib.equal

include Ppx_quickcheck_runtime.Quickcheckable.S with type t := t

Sourceval quickcheck_generator : t Base_quickcheck.Generator.t

Sourceval quickcheck_observer : t Base_quickcheck.Observer.t

Sourceval quickcheck_shrinker : t Base_quickcheck.Shrinker.t

Sourceval range : Point.t Bound.t -> Point.t Bound.t -> t

Sourceval all : t

Sourceval is_all : t -> bool

Sourceval 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.

Sourceval 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.

Sourceval 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.

Sourceval disjoint : t -> t -> bool

Sourcemodule Or_empty : sig ... end

Sourceval inter : t -> t -> Or_empty.t

Sourceval inter_opt : t -> t -> t option