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

v0.17.0.tar.gz

sha256=91acc784e4760af8544c4504bee1a9f6d7385eb0620f8e56392cd193a250b7d2

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

Module `Incr_map_collate.Collate`Source

Sourcemodule Which_range : sig ... end

Sourcetype ('k, 'filter, 'order) t = {

filter : 'filter;
(*
User-defined type, usually algebraic data type, describing how the table can be filtered. You'll need to provide equal and to_predicate of type 'filter -> ('k -> 'v -> bool) for collate.
*)
order : 'order;
(*
User-defined type, usually algebraic data type, describing how the table can be sorted. You'll need to provide equal and to_compare of type functionally equivalent to 'order -> ('v -> 'v -> int) for collate.
*)
key_range : 'k Which_range.t;
(*
Select only rows between these keys (in the configured ordering)
*)
rank_range : int Which_range.t;
(*
After selecting rows according to key_range, select rows between these positions.
For example, if your (sorted & filtered) data is (A, 1); (B, 2); (C, 3), then both for key_range = All_rows; rank_range = From 1 and key_range = From B; rank_range = All_rows the result would be (B, 2); (C, 3)
*)

}

include Ppx_compare_lib.Equal.S3
  with type ('k, 'filter, 'order) t := ('k, 'filter, 'order) t

Source

val equal : 
  ('a -> 'a -> bool) ->
  ('b -> 'b -> bool) ->
  ('c -> 'c -> bool) ->
  ('a, 'b, 'c) t ->
  ('a, 'b, 'c) t ->
  bool