Hoogle Search
Within LTS Haskell 24.49 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
retractFBoundedLattice :: BoundedLattice a => FBoundedLattice a -> alattices Algebra.Lattice.Free.Final No documentation available.
promoteBoundedInstance :: OptionsMonad q => Name -> q [Dec]singletons-th Data.Singletons.TH Produce an instance for PBounded from the given type
promoteBoundedInstances :: OptionsMonad q => [Name] -> q [Dec]singletons-th Data.Singletons.TH Produce instances for PBounded from the given types
singBoundedInstance :: OptionsMonad q => Name -> q [Dec]singletons-th Data.Singletons.TH Create instance of SBounded for the given type
singBoundedInstances :: OptionsMonad q => [Name] -> q [Dec]singletons-th Data.Singletons.TH Create instances of SBounded for the given types
class
UnboundedStream (i :: Type -> Type) (o :: Type -> Type) | i -> ostm-conduit Data.Conduit.Utils Class for structures that can handle unbounded stream of values. Such streams break conduit assumptions that constant memory will be used, because if receiver is slower then sender than values will be accumulated.
-
stm-conduit Data.Conduit.Utils Create bounded conduit pair, see BoundedStream class description.
shiftBounded :: X -> Y -> Point -> Vector -> PointLambdaHack Game.LambdaHack.Common.Vector Translate a point by a vector, but only if the result fits in an area.
trajectoryToPathBounded :: X -> Y -> Point -> [Vector] -> [Point]LambdaHack Game.LambdaHack.Common.Vector A list of points that a list of vectors leads to, bounded by level size.
vicinityBounded :: X -> Y -> Point -> [Point]LambdaHack Game.LambdaHack.Common.Vector All (8 at most) closest neighbours of a point within an area.