package incr_map

You can search for identifiers within the package.

in-package search v0.2.0

Helpers for incremental operations on map like data structures

Install

Dune Dependency

github.com Changelog MIT License Edit opam file Versions (6)

Authors

J

Jane Street Group, LLC

Maintainers

J

Jane Street developers

Sources

incr_map-v0.16.0.tar.gz

sha256=a29d13cbc1759714ef49cc398ccfd5548212d1c0ba497552877548c9ce734d67

doc/incr_map.collate/Incr_map_collate/Collated/index.html

Module `Incr_map_collate.Collated`Source

Sourcetype ('k, 'v) t

The result of collation - a filtered, sorted and restricted-to-a-range list of keys and values. The underlying data structure is a bit more sophisticated than a list, to provide better diffing.

To get an implementation of Diffable interface, you'll need to instantiate Make_concrete.

include Sexplib0.Sexpable.S2 with type ('k, 'v) t := ('k, 'v) t

Source

val t_of_sexp : 
  (Sexplib0.Sexp.t -> 'a) ->
  (Sexplib0.Sexp.t -> 'b) ->
  Sexplib0.Sexp.t ->
  ('a, 'b) t

Source

val sexp_of_t : 
  ('a -> Sexplib0.Sexp.t) ->
  ('b -> Sexplib0.Sexp.t) ->
  ('a, 'b) t ->
  Sexplib0.Sexp.t

include Core.Bin_prot.Binable.S2 with type ('k, 'v) t := ('k, 'v) t

Sourceval bin_shape_t : Bin_prot.Shape.t -> Bin_prot.Shape.t -> Bin_prot.Shape.t

Sourceval bin_size_t : ('a, 'b, ('a, 'b) t) Bin_prot.Size.sizer2

Sourceval bin_write_t : ('a, 'b, ('a, 'b) t) Bin_prot.Write.writer2

Sourceval bin_read_t : ('a, 'b, ('a, 'b) t) Bin_prot.Read.reader2

Sourceval __bin_read_t__ : ('a, 'b, int -> ('a, 'b) t) Bin_prot.Read.reader2

Sourceval bin_writer_t : ('a, 'b, ('a, 'b) t) Bin_prot.Type_class.S2.writer

Sourceval bin_reader_t : ('a, 'b, ('a, 'b) t) Bin_prot.Type_class.S2.reader

Sourceval bin_t : ('a, 'b, ('a, 'b) t) Bin_prot.Type_class.S2.t

include Ppx_compare_lib.Comparable.S2 with type ('k, 'v) t := ('k, 'v) t

Source

val compare : 
  'a Base__Ppx_compare_lib.compare ->
  'b Base__Ppx_compare_lib.compare ->
  ('a, 'b) t Base__Ppx_compare_lib.compare

include Ppx_compare_lib.Equal.S2 with type ('k, 'v) t := ('k, 'v) t

Source

val equal : 
  'a Base__Ppx_compare_lib.equal ->
  'b Base__Ppx_compare_lib.equal ->
  ('a, 'b) t Base__Ppx_compare_lib.equal

Sourceval empty : (_, _) t

Source

val fold : 
  ('k, 'v) t ->
  init:'accum ->
  f:('accum -> ('k * 'v) -> 'accum) ->
  'accum

Sourceval iter : ('k, 'v) t -> f:(('k * 'v) -> unit) -> unit

Sourceval to_alist : ('k, 'v) t -> ('k * 'v) list

Sourceval to_map_list : ('k, 'v) t -> ('k * 'v) Incr_map_erase_key.t

Sourceval first : ('k, 'v) t -> ('k * 'v) option

Sourceval last : ('k, 'v) t -> ('k * 'v) option

Sourceval mapi : ('k, 'v1) t -> f:('k -> 'v1 -> 'v2) -> ('k, 'v2) t

Sourceval length : (_, _) t -> int

Sourceval num_unfiltered_rows : (_, _) t -> int

Total number of rows before filtering

Sourceval num_filtered_rows : (_, _) t -> int

Total number of rows after filtering, but before limiting to range.

Sourceval num_before_range : (_, _) t -> int

Total number of rows that preceed the rank-range and key-range ranges.

Sourceval num_after_range : (_, _) t -> int

Total number of rows that follow the rank-range and key-range ranges.

Sourceval key_range : ('k, _) t -> 'k Collate.Which_range.t

The key range this result was computed for

Sourceval rank_range : (_, _) t -> int Collate.Which_range.t

The rank range this result was computed for

Sourcemodule Private : sig ... end

Sourcemodule For_testing : sig ... end

Sourcemodule type Concrete = sig ... end

Source

module Make_concrete
  (Key : sig ... end)
  (Value : sig ... end) : 
  Concrete with type Key.t = Key.t and type Value.t = Value.t

package incr_map

Install

Dune Dependency

Authors

Maintainers

Sources

doc/incr_map.collate/Incr_map_collate/Collated/index.html

Module Incr_map_collate.CollatedSource

Module `Incr_map_collate.Collated`Source