package incr_dom

You can search for identifiers within the package.

in-package search v0.2.0

package incr_dom

incr_dom
- Incr_dom
  - App_intf
    
    S_derived
    
    Action
    
    Derived_model
    
    Model
    
    Model_summary
    
    State
    
    S_imperative
    
    Action
    
    Model
    
    Model_summary
    
    State
    
    S_simple
    
    Action
    
    Model
    
    State
  - Incr
    
    Map
    
    Lookup
    
    For_debug
    
    Select
  - Js_misc
    
    Rect
    
    Fields
    
    Direct
    
    Variants_of_rows_or_columns
  - Start_app

Legend:
Library
Module
Module type
Parameter
Class
Class type

module Incr : sig ... end

include module type of struct include Incr end

type 'a t = 'a Incr.t

val sexp_of_t : ('a -> Sexplib.Sexp.t) -> 'a t -> Sexplib.Sexp.t

type 'a incremental = 'a t

val invariant : 'a Base__.Invariant_intf.inv -> 'a t Base__.Invariant_intf.inv

val is_const : 'a t -> bool

val is_valid : 'a t -> bool

val is_necessary : 'a t -> bool

val const : 'a -> 'a t

val return : 'a -> 'a t

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

module Infix = Incr.Infix

val join : 'a t t -> 'a t

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

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

val depend_on : 'a t -> depend_on:'b t -> 'a t

val necessary_if_alive : 'a t -> 'a t

val for_all : bool t array -> bool t

val exists : bool t array -> bool t

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

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

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

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

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

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

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

val sum_int : int t array -> int t

val sum_float : float t array -> float t

module Var = Incr.Var

module Observer = Incr.Observer

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

module Update = Incr.Update

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

val stabilize : unit -> unit

val am_stabilizing : unit -> bool

module Cutoff = Incr.Cutoff

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

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

module Scope = Incr.Scope

val lazy_from_fun : (unit -> 'a) -> 'a Core_kernel.Lazy.t

val default_hash_table_initial_size : int

val memoize_fun : 
  ?initial_size:int ->
  'a Core_kernel.Hashtbl.Hashable.t ->
  ('a -> 'b) ->
  ('a -> 'b) Core_kernel.Staged.t

val memoize_fun_by_key : 
  ?initial_size:int ->
  'key Core_kernel.Hashtbl.Hashable.t ->
  ('a -> 'key) ->
  ('a -> 'b) ->
  ('a -> 'b) Core_kernel.Staged.t

val user_info : 'a t -> Core_kernel.Info.t option

val set_user_info : 'a t -> Core_kernel.Info.t option -> unit

module Expert = Incr.Expert

module State = Incr.State

module Packed = Incr.Packed

val pack : 'a t -> Packed.t

val save_dot : string -> unit

val keep_node_creation_backtrace : bool Core_kernel.ref

module Let_syntax = Incr.Let_syntax

val alarm_precision : Incremental_kernel__.Import.Time_ns.Span.t

val now : unit -> Incremental_kernel__.Import.Time_ns.t

val watch_now : unit -> Incremental_kernel__.Import.Time_ns.t t

val advance_clock : to_:Incremental_kernel__.Import.Time_ns.t -> unit

module Before_or_after = Incr.Before_or_after

val at : Incremental_kernel__.Import.Time_ns.t -> Before_or_after.t t

val after : Incremental_kernel__.Import.Time_ns.Span.t -> Before_or_after.t t

val at_intervals : Incremental_kernel__.Import.Time_ns.Span.t -> unit t

val step_function : 
  init:'a ->
  (Incremental_kernel__.Import.Time_ns.t * 'a) list ->
  'a t

val snapshot : 
  'a t ->
  at:Incremental_kernel__.Import.Time_ns.t ->
  before:'a ->
  'a t Core_kernel.Or_error.t

module Map : sig ... end

module Select : sig ... end