Hoogle Search
Within LTS Haskell 24.67 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
rawequal :: StackIndex -> StackIndex -> LuaE e Boolhslua-core HsLua.Core Returns True if the two values in indices idx1 and idx2 are primitively equal (that is, without calling the __eq metamethod). Otherwise returns False. Also returns False if any of the indices are not valid. Wraps lua_rawequal.
requiref :: LuaError e => Name -> CFunction -> Bool -> LuaE e ()hslua-core HsLua.Core If modname is not already present in package.loaded. calls function openf with string modname as an argument and sets the call result in package.loaded[modname], as if that function has been called through require. If glb is true, also stores the module into global modname. Leaves a copy of the module on the stack. See requirehs for a version intended to be used with Haskell actions.
requirehs :: LuaError e => Name -> (Name -> LuaE e ()) -> LuaE e ()hslua-core HsLua.Core Load a module, defined by a Haskell action, under the given name. Similar to luaL_requiref: If modname is not already present in package.loaded, calls function openf with string modname as an argument and sets the call result in package.loaded[modname], as if that function has been called through require. Leaves a copy of the module on the stack.
requirehs :: LuaError e => Name -> (Name -> LuaE e ()) -> LuaE e ()hslua-core HsLua.Core.Package Load a module, defined by a Haskell action, under the given name. Similar to luaL_requiref: If modname is not already present in package.loaded, calls function openf with string modname as an argument and sets the call result in package.loaded[modname], as if that function has been called through require. Leaves a copy of the module on the stack.
osequence_ :: (Applicative m, MonoFoldable mono, Element mono ~ m ()) => mono -> m ()mono-traversable Data.MonoTraversable Perform all actions in the given container
sequence_ :: (Applicative m, MonoFoldable mono, Element mono ~ m ()) => mono -> m ()mono-traversable Data.MonoTraversable.Unprefixed Synonym for osequence_
-
Abstractions over sequential data structures, like lists and vectors.
class (Monoid seq, MonoTraversable seq, SemiSequence seq, MonoPointed seq) =>
IsSequence seqmono-traversable Data.Sequences Sequence Laws:
fromList . otoList = id fromList (x <> y) = fromList x <> fromList y otoList (fromList x <> fromList y) = x <> y
-
mono-traversable Data.Sequences Lazy sequences containing strict chunks of data.
class (Integral Index seq, GrowingAppend seq) =>
SemiSequence seqmono-traversable Data.Sequences SemiSequence was created to share code between IsSequence and NonNull. Semi means SemiGroup A SemiSequence can accommodate a SemiGroup such as NonEmpty or NonNull A Monoid should be able to fill out IsSequence. SemiSequence operations maintain the same type because they all maintain the same number of elements or increase them. However, a decreasing function such as filter may change they type. For example, from NonEmpty to '[]' This type-changing function exists on NonNull as nfilter filter and other such functions are placed in IsSequence NOTE: Like GrowingAppend, ideally we'd have a Semigroup superclass constraint here, but that would pull in more dependencies to this package than desired.