package incremental

  1. Overview
  2. Docs
Library for incremental computations

Install

Dune Dependency

Authors

Maintainers

Sources

v0.17.0.tar.gz
sha256=bcd6da0c70d9f0b0d528b16d8faf800dd92cd45dca817f4b750628921671e8e0

doc/incremental.incremental_step_function/Incremental_step_function/index.html

Module Incremental_step_functionSource

An 'a Step_function.t is a function from Time_ns.t to 'a.

Sourcetype 'a t
Sourceval sexp_of_t : ('a -> Sexplib0.Sexp.t) -> 'a t -> Sexplib0.Sexp.t
include Core.Invariant.S1 with type 'a t := 'a t
Sourceval invariant : ('a -> unit) -> 'a t -> unit
Sourceval init : 'a t -> 'a
Sourceval steps : 'a t -> (Core.Time_ns.t * 'a) Core.Sequence.t
Sourceval value : 'a t -> at:Core.Time_ns.t -> 'a
Sourceval constant : 'a -> 'a t

constant a is the step function t with value t ~at = a for all at.

Sourceval create_exn : init:'a -> steps:(Core.Time_ns.t * 'a) list -> 'a t

create_exn ~init ~steps:[(t_1, v_1); ...; (t_n, vn)] is the step function t with value t ~at = init for at < t_1, value t ~at = vi for t_i <= at < t_i+1. create_exn raises if the times aren't in nondecreasing order, i.e. if for some i < j, ti > tj.

Sourceval create_from_sequence : init:'a -> steps:(Core.Time_ns.t * 'a) Core.Sequence.t -> 'a t
OCaml

Innovation. Community. Security.