Make_with_config (p.incremental.v0.17.0.doc.incremental.Incremental.Make_with

Parameters

module C : Incremental_config

Signature

Sourcetype state_witness

Sourceval sexp_of_state_witness : state_witness -> Sexplib0.Sexp.t

include S_gen
  with type 'a t = ('a, state_witness) incremental
  with type Before_or_after.t = Before_or_after.t
  with type Clock.t = state_witness Clock.t
  with type 'a Cutoff.t = 'a Cutoff.t
  with type 'a Expert.Dependency.t = ('a, state_witness) Expert.Dependency.t
  with type 'a Expert.Node.t = ('a, state_witness) Expert.Node.t
  with type Expert.Step_result.t = Expert.Step_result.t
  with type 'a Observer.t = ('a, state_witness) Observer.t
  with type 'a Observer.Update.t = 'a Observer.Update.t
  with type Packed.t = Packed.t
  with type Scope.t = state_witness Scope.t
  with type State.t = state_witness State.t
  with type State.Stats.t = State.Stats.t
  with type ('a, 'b) Unordered_array_fold_update.t =
         ('a, 'b) Unordered_array_fold_update.t
  with type 'a Update.t = 'a Update.t
  with type 'a Var.t = ('a, state_witness) Var.t

Sourcemodule State : sig ... end

Sourcetype 'a t = ('a, state_witness) incremental

Sourceval sexp_of_t : ('a -> Sexplib0.Sexp.t) -> 'a t -> Sexplib0.Sexp.t

type 'a incremental := 'a t

include Core.Invariant.S1 with type 'a t := 'a t

Sourceval invariant : ('a -> unit) -> 'a t -> unit

Sourceval is_const : _ t -> bool

Sourceval is_valid : _ t -> bool

Sourceval is_necessary : _ t -> bool

Sourceval const : 'a -> 'a t

Sourceval return : 'a -> 'a t

Sourceval map : 'a t -> f:('a -> 'b) -> 'b t

Sourceval (>>|) : 'a t -> ('a -> 'b) -> 'b t

Sourceval map2 : 'a1 t -> 'a2 t -> f:('a1 -> 'a2 -> 'b) -> 'b t

Sourceval map3 : 'a1 t -> 'a2 t -> 'a3 t -> f:('a1 -> 'a2 -> 'a3 -> 'b) -> 'b t

Source

val map4 : 
  'a1 t ->
  'a2 t ->
  'a3 t ->
  'a4 t ->
  f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'b) ->
  'b t

Source

val map5 : 
  'a1 t ->
  'a2 t ->
  'a3 t ->
  'a4 t ->
  'a5 t ->
  f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'b) ->
  'b t

Source

val map6 : 
  'a1 t ->
  'a2 t ->
  'a3 t ->
  'a4 t ->
  'a5 t ->
  'a6 t ->
  f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'a6 -> 'b) ->
  'b t

Source

val map7 : 
  'a1 t ->
  'a2 t ->
  'a3 t ->
  'a4 t ->
  'a5 t ->
  'a6 t ->
  'a7 t ->
  f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'a6 -> 'a7 -> 'b) ->
  'b t

Source

val map8 : 
  'a1 t ->
  'a2 t ->
  'a3 t ->
  'a4 t ->
  'a5 t ->
  'a6 t ->
  'a7 t ->
  'a8 t ->
  f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'a6 -> 'a7 -> 'a8 -> 'b) ->
  'b t

Source

val map9 : 
  'a1 t ->
  'a2 t ->
  'a3 t ->
  'a4 t ->
  'a5 t ->
  'a6 t ->
  'a7 t ->
  'a8 t ->
  'a9 t ->
  f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'a6 -> 'a7 -> 'a8 -> 'a9 -> 'b) ->
  'b t

Source

val map10 : 
  'a1 t ->
  'a2 t ->
  'a3 t ->
  'a4 t ->
  'a5 t ->
  'a6 t ->
  'a7 t ->
  'a8 t ->
  'a9 t ->
  'a10 t ->
  f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'a5 -> 'a6 -> 'a7 -> 'a8 -> 'a9 -> 'a10 -> 'b) ->
  'b t

Source

val map11 : 
  'a1 t ->
  'a2 t ->
  'a3 t ->
  'a4 t ->
  'a5 t ->
  'a6 t ->
  'a7 t ->
  'a8 t ->
  'a9 t ->
  'a10 t ->
  'a11 t ->
  f:
    ('a1 ->
      'a2 ->
      'a3 ->
      'a4 ->
      'a5 ->
      'a6 ->
      'a7 ->
      'a8 ->
      'a9 ->
      'a10 ->
      'a11 ->
      'b) ->
  'b t

Source

val map12 : 
  'a1 t ->
  'a2 t ->
  'a3 t ->
  'a4 t ->
  'a5 t ->
  'a6 t ->
  'a7 t ->
  'a8 t ->
  'a9 t ->
  'a10 t ->
  'a11 t ->
  'a12 t ->
  f:
    ('a1 ->
      'a2 ->
      'a3 ->
      'a4 ->
      'a5 ->
      'a6 ->
      'a7 ->
      'a8 ->
      'a9 ->
      'a10 ->
      'a11 ->
      'a12 ->
      'b) ->
  'b t

Source

val map13 : 
  'a1 t ->
  'a2 t ->
  'a3 t ->
  'a4 t ->
  'a5 t ->
  'a6 t ->
  'a7 t ->
  'a8 t ->
  'a9 t ->
  'a10 t ->
  'a11 t ->
  'a12 t ->
  'a13 t ->
  f:
    ('a1 ->
      'a2 ->
      'a3 ->
      'a4 ->
      'a5 ->
      'a6 ->
      'a7 ->
      'a8 ->
      'a9 ->
      'a10 ->
      'a11 ->
      'a12 ->
      'a13 ->
      'b) ->
  'b t

Source

val map14 : 
  'a1 t ->
  'a2 t ->
  'a3 t ->
  'a4 t ->
  'a5 t ->
  'a6 t ->
  'a7 t ->
  'a8 t ->
  'a9 t ->
  'a10 t ->
  'a11 t ->
  'a12 t ->
  'a13 t ->
  'a14 t ->
  f:
    ('a1 ->
      'a2 ->
      'a3 ->
      'a4 ->
      'a5 ->
      'a6 ->
      'a7 ->
      'a8 ->
      'a9 ->
      'a10 ->
      'a11 ->
      'a12 ->
      'a13 ->
      'a14 ->
      'b) ->
  'b t

Source

val map15 : 
  'a1 t ->
  'a2 t ->
  'a3 t ->
  'a4 t ->
  'a5 t ->
  'a6 t ->
  'a7 t ->
  'a8 t ->
  'a9 t ->
  'a10 t ->
  'a11 t ->
  'a12 t ->
  'a13 t ->
  'a14 t ->
  'a15 t ->
  f:
    ('a1 ->
      'a2 ->
      'a3 ->
      'a4 ->
      'a5 ->
      'a6 ->
      'a7 ->
      'a8 ->
      'a9 ->
      'a10 ->
      'a11 ->
      'a12 ->
      'a13 ->
      'a14 ->
      'a15 ->
      'b) ->
  'b t

Sourceval bind : 'a t -> f:('a -> 'b t) -> 'b t

Sourceval (>>=) : 'a t -> ('a -> 'b t) -> 'b t

Sourceval bind2 : 'a1 t -> 'a2 t -> f:('a1 -> 'a2 -> 'b t) -> 'b t

Sourceval bind3 : 'a1 t -> 'a2 t -> 'a3 t -> f:('a1 -> 'a2 -> 'a3 -> 'b t) -> 'b t

Source

val bind4 : 
  'a1 t ->
  'a2 t ->
  'a3 t ->
  'a4 t ->
  f:('a1 -> 'a2 -> 'a3 -> 'a4 -> 'b t) ->
  'b t

Sourcemodule Infix : sig ... end

Sourceval join : 'a t t -> 'a t

Sourceval if_ : bool t -> then_:'a t -> else_:'a t -> 'a t

Sourceval freeze : ?when_:('a -> bool) -> 'a t -> 'a t

Sourceval depend_on : 'a t -> depend_on:_ t -> 'a t

Sourceval necessary_if_alive : 'a t -> 'a t

Sourceval for_all : bool t array -> bool t

Sourceval exists : bool t array -> bool t

Sourceval all : 'a t list -> 'a list t

Sourceval both : 'a t -> 'b t -> ('a * 'b) t

Sourceval array_fold : 'a t array -> init:'b -> f:('b -> 'a -> 'b) -> 'b t

Source

val reduce_balanced : 
  'a t array ->
  f:('a -> 'b) ->
  reduce:('b -> 'b -> 'b) ->
  'b t option

Sourcemodule Unordered_array_fold_update : sig ... end

Source

val unordered_array_fold : 
  ?full_compute_every_n_changes:int ->
  'a t array ->
  init:'b ->
  f:('b -> 'a -> 'b) ->
  update:('a, 'b) Unordered_array_fold_update.t ->
  'b t

Source

val opt_unordered_array_fold : 
  ?full_compute_every_n_changes:int ->
  'a option t array ->
  init:'b ->
  f:('b -> 'a -> 'b) ->
  f_inverse:('b -> 'a -> 'b) ->
  'b option t

Source

val sum : 
  ?full_compute_every_n_changes:int ->
  'a t array ->
  zero:'a ->
  add:('a -> 'a -> 'a) ->
  sub:('a -> 'a -> 'a) ->
  'a t

Source

val opt_sum : 
  ?full_compute_every_n_changes:int ->
  'a option t array ->
  zero:'a ->
  add:('a -> 'a -> 'a) ->
  sub:('a -> 'a -> 'a) ->
  'a option t

Sourceval sum_int : int t array -> int t

Sourceval sum_float : float t array -> float t

Sourcemodule Scope : sig ... end

Sourcemodule Var : sig ... end

Sourcemodule Observer : sig ... end

Sourceval observe : ?should_finalize:bool -> 'a t -> 'a Observer.t

Sourcemodule Update : sig ... end

Sourceval on_update : 'a t -> f:('a Update.t -> unit) -> unit

Sourceval stabilize : unit -> unit

Sourceval am_stabilizing : unit -> bool

Sourcemodule Cutoff : sig ... end

Sourceval set_cutoff : 'a t -> 'a Cutoff.t -> unit

Sourceval get_cutoff : 'a t -> 'a Cutoff.t

Sourceval lazy_from_fun : (unit -> 'a) -> 'a Core.Lazy.t

Sourceval default_hash_table_initial_size : int

Source

val memoize_fun : 
  ?initial_size:int ->
  'a Base.Hashtbl.Key.t ->
  ('a -> 'b) ->
  ('a -> 'b) Core.Staged.t

Source

val memoize_fun_by_key : 
  ?initial_size:int ->
  'key Base.Hashtbl.Key.t ->
  ('a -> 'key) ->
  ('a -> 'b) ->
  ('a -> 'b) Core.Staged.t

Source

val weak_memoize_fun : 
  ?initial_size:int ->
  'a Base.Hashtbl.Key.t ->
  ('a -> 'b Core.Heap_block.t) ->
  ('a -> 'b Core.Heap_block.t) Core.Staged.t

Source

val weak_memoize_fun_by_key : 
  ?initial_size:int ->
  'key Base.Hashtbl.Key.t ->
  ('a -> 'key) ->
  ('a -> 'b Core.Heap_block.t) ->
  ('a -> 'b Core.Heap_block.t) Core.Staged.t

Sourceval user_info : _ t -> Core.Info.t option

Sourceval set_user_info : _ t -> Core.Info.t option -> unit

Source

val append_user_info_graphviz : 
  _ t ->
  label:string list ->
  attrs:string Core.String.Map.t ->
  unit

Sourcemodule Node_value : sig ... end

Sourceval node_value : 'a t -> 'a Node_value.t

node_value t returns whatever value t happens to have in it, regardless of whether t is valid, necessary, or stale. One should use observe for a more sensible semantics, reserving node_value for debugging.

Sourcemodule Packed : sig ... end

Sourceval pack : _ t -> Packed.t

Sourceval save_dot : ?emit_bind_edges:bool -> Core.Out_channel.t -> unit

Sourceval save_dot_to_file : ?emit_bind_edges:bool -> string -> unit

Sourcemodule Let_syntax : sig ... end

Sourcemodule Before_or_after : sig ... end

Sourcemodule Step_function = Incremental_step_function

Sourcemodule Clock : sig ... end

Sourcemodule Expert : sig ... end