Hoogle Search
Within LTS Haskell 24.3 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
step :: (C q, C u, C v, Write sig q) => T s u v sig qsynthesizer-dimensional Synthesizer.Dimensional.RateAmplitude.Piece No documentation available.
step :: Statement -> IO StepResultdirect-sqlite Database.SQLite3 step :: Statement -> IO (Either Error StepResult)direct-sqlite Database.SQLite3.Direct step :: Monad m => m i -> (i -> m t) -> (a -> b) -> a -> m (t, b)perf Perf.Types A single step measurement.
step :: s -> ReObject s r -> ReObject s rregex-applicative Text.Regex.Applicative.Object Feed a symbol into a regex object
step :: Set set => State label set -> [State label set]set-cover Math.SetCover.Exact This is the key of the search algorithm. The search algorithm tries to build partitions by adding sets to a partition list successively. A step starts on a partial partition and looks for new sets that could be added. The goal is to avoid to check a set again down in a search branch and to quickly determine search directions that lead to a dead end. To this end a search step selects a certain set element and tries all sets that contain that element and that do not overlap with the partial partition. Practically, step selects an element with the minimal number of non-overlapping sets it is contained in. If this number is zero, then the search can be aborted in this branch. Most oftenly the power of the algorithm originates from the formulation of a problem as a set-cover problem and from the equal treatment of all elements. E.g. in the Soma cube example the algorithm chooses whether to do a case analysis on all bricks that cover a certain position, or to do a case analysis on all positions that are possible for a certain brick. The algorithm might not be extraordinarily fast, but in all cases it consumes only little memory since it only has to maintain the current state of search. Precondition: freeElements of the input state must not be empty.
step :: Methods queue set -> State queue label set -> [State queue label set]set-cover Math.SetCover.Exact.Priority No documentation available.
step :: State label -> [State label]set-cover Math.SetCover.Exact.UArray No documentation available.
-
dsp DSP.Source.Basic unit step
step :: Monad m => (a -> m (b, e)) -> MSFExcept m a b edunai Control.Monad.Trans.MSF.Except Advances a single tick with the given Kleisli arrow, and then throws an exception.