Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
highpassStep :: (C a, C a v) => Parameter a -> v -> State v vsynthesizer-core Synthesizer.Plain.Filter.Recursive.FirstOrder No documentation available.
lowpassStep :: (C a, C a v) => Parameter a -> v -> State v vsynthesizer-core Synthesizer.Plain.Filter.Recursive.FirstOrder No documentation available.
initStep :: Initialized s init ctrl a b -> ctrl -> a -> State s bsynthesizer-core Synthesizer.Plain.Modifier No documentation available.
-
synthesizer-core Synthesizer.State.Signal No documentation available.
autoSteps :: Int -> [Double] -> [Double]Chart Graphics.Rendering.Chart.Axis.Floating Given a target number of values, and a list of input points, find evenly spaced values from the set {1*X, 2*X, 2.5*X, 5*X} (where X is some power of ten) that evenly cover the input points.
so_step :: SparkOptions -> IntChart Graphics.Rendering.Chart.SparkLine step size
-
dejafu Test.DejaFu.SCT.Internal.DPOR One step of the execution, including information for backtracking purposes. This backtracking information is used to generate new schedules.
-
dejafu Test.DejaFu.SCT.Internal.DPOR No documentation available.
-
dejafu Test.DejaFu.SCT.Internal.DPOR Produce a list of new backtracking points from an execution trace. These are then used to inform new "to-do" points in the DPOR tree. Two traces are passed in to this function: the first is generated from the special DPOR scheduler, the other from the execution of the concurrent program. If the trace ends with any threads other than the initial one still runnable, a dependency is imposed between this final action and everything else.
incorporateBacktrackSteps :: HasCallStack => [BacktrackStep] -> DPOR -> DPORdejafu Test.DejaFu.SCT.Internal.DPOR Add new backtracking points, if they have not already been visited and aren't in the sleep set.