package hardcaml_step_testbench

  1. Overview
  2. Docs
package hardcaml_step_testbench
Legend:
Library
Module
Module type
Parameter
Class
Class type
module Input_monad : Base.Monad.S with type 'a t = 'a Input_monad.t
type ('i, 'o) t_

t is mostly abstract, but we expose is as a constructor so that the type checker knows that t is injective.

type ('i, 'o) t =
  1. | T of ('i, 'o) t_
val sexp_of_t : ('i -> Sexplib0.Sexp.t) -> ('o -> Sexplib0.Sexp.t) -> ('i, 'o) t -> Sexplib0.Sexp.t
type ('i, 'o) t_module = (module Digital_components__.Component_intf.Module.S with type Input.t = 'i and type Output.t = 'o)
val sexp_of_input : ('i, _) t -> 'i -> Base.Sexp.t
val sexp_of_output : (_, 'o) t -> 'o -> Base.Sexp.t
val input_module : ('i, _) t -> 'i Data.t
val output_module : (_, 'o) t -> 'o Data.t
val create : ('i, 'o) t_module -> ('i, 'o) t
val output : ('i, 'o) t -> 'i -> 'o

output returns the output based on an input and its current state, but does not update the state. A component is called "combinational" if output t i ignores t. A component is called "sequential" if output t i uses t. A sequential component is called a "moore machine" if it ignores i and a "mealy machine" if it uses i.

val update_state : ?prune:Base.bool -> ('i, _) t -> 'i -> Base.unit

update_state updates t's state based on an input and its current state

val run_with_inputs : ('i, 'o) t -> 'i Base.list -> ('i * 'o) Base.list

run_with_inputs t is runs length is steps with t, on each step calling update_state and then output, pairing the input of that step with the output.

val prune_children : ('i, 'o) t -> Base.unit

Remove all children that has finished

val has_children : ('i, 'o) t -> Base.bool

Whether the component has any children

module Next_input : sig ... end
val run_until_finished : ?show_steps:Base.bool -> ('i, 'o) t -> first_input:'i -> next_input:('o -> 'i Next_input.t Input_monad.t) -> Base.unit Input_monad.t

Component combinators

val sequence : ('a, 'b) t -> ('b, 'c) t -> ('a, 'c) t
val map_input : ('i2, 'o) t -> 'i1 Data.t -> f:('i1 -> 'i2) -> ('i1, 'o) t
val map_output : ('i, 'o1) t -> 'o2 Data.t -> f:('o1 -> 'o2) -> ('i, 'o2) t

Combinational components

module Combinational : sig ... end
val create_combinational : ('i, 'o) Combinational.t -> ('i, 'o) t
val and_ : (Base.bool * Base.bool, Base.bool) t
val or_ : (Base.bool * Base.bool, Base.bool) t
val not_ : (Base.bool, Base.bool) t

Sequential components

val flip_flop : Base.unit -> (Base.bool, Base.bool) t
module Flip_flop_with_load_enable : sig ... end
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct