• OCaml logo OCaml logo
  • Learn
  • Packages
  • Community
  • Blog
  • Playground
  • Learn
  • Packages
  • Community
  • Blog
  • Playground
  • Get started

  bap-primus-greedy-scheduler

Evaluates all machines in the DFS order
package bap-primus-greedy-scheduler
  • primus_greedy_scheduler_plugin
    • Primus_greedy_main
      • Config
      • Greedy
        • 1-Machine
          • Collection
            • Delay
              • 1-T
            • Eager
              • 1-T
            • S
          • Exn
          • Fn
          • Global
          • Id
            • Hash_queue
            • Hash_set
              • Provide_bin_io
                • 1-X
              • Provide_of_sexp
                • 1-X
            • Map
              • Key
              • Provide_bin_io
                • 1-Key
              • Provide_hash
                • 1-Key
              • Provide_of_sexp
                • 1-Key
              • Tree
                • Provide_of_sexp
                  • 1-K
            • Replace_polymorphic_compare
            • Set
              • Elt
              • Named
              • Provide_bin_io
                • 1-Elt
              • Provide_hash
                • 1-Elt
              • Provide_of_sexp
                • 1-Elt
              • Tree
                • Named
                • Provide_of_sexp
                  • 1-Elt
            • Table
              • Provide_bin_io
                • 1-Key
              • Provide_of_sexp
                • 1-Key
          • Let
          • Let_syntax
            • Let_syntax
              • Open_on_rhs
          • Lift
          • List
          • Local
          • Monad_infix
          • Observation
          • Other
          • Pair
          • Seq
          • Syntax
          • Triple
        • Eval
Legend:
Library
Module
Module type
Parameter
Class
Class type
Library primus_greedy_scheduler_plugin
Module Primus_greedy_main . Greedy . Machine . Id . Map . Provide_hash

Parameters

module Key : Base.Hasher.S with type t := Key.t

Signature

val hash_fold_t : ( Base.Hash.state -> 'a -> Base.Hash.state ) -> Base.Hash.state -> 'a t -> Base.Hash.state
ON THIS PAGE
No table of contents
Innovation. Community. Security.
  • About Us
  • Industrial Users
  • Academic Users
  • Why OCaml
  • Resources
  • Get Started
  • Language Docs
  • Books
  • Releases
  • Community
  • Blog
  • Jobs
  • Legal
  • Carbon Footprint
  • Governance
  • Privacy Policy
  • Code of Conduct