empty

empty :: Alternative f => f a
base Control.Applicative
emptySampleVar :: SampleVar a -> IO ()
base Control.Concurrent.SampleVar
If the SampleVar is full, leave it empty. Otherwise, do nothing.
Empty :: FiniteMap a b
fgl Data.Graph.Inductive.Internal.FiniteMap
Empty :: Heap a b
fgl Data.Graph.Inductive.Internal.Heap
Empty :: Text
text Data.Text.Lazy.Internal
Empty :: a -> Consumed a
parsec Text.Parsec.Prim
empty :: Array
text Data.Text.Array
An empty immutable array.
empty :: BlockTable a
html Text.Html.BlockTable
empty :: ByteString
bytestring Data.ByteString, bytestring Data.ByteString.Char8, bytestring Data.ByteString.Lazy, bytestring Data.ByteString.Lazy.Char8
O(1) The empty ByteString
empty :: Doc
template-haskell Language.Haskell.TH.PprLib
An empty document
empty :: Doc
pretty Text.PrettyPrint.HughesPJ, pretty Text.PrettyPrint
The empty document, with no height and no width. empty is the identity for <>, <+>, $$ and $+$, and anywhere in the argument list for sep, hcat, hsep, vcat, fcat etc.
empty :: IntMap a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
O(1). The empty map. > empty == fromList [] > size empty == 0
empty :: IntSet
containers Data.IntSet
O(1). The empty set.
empty :: Map k a
containers Data.Map.Lazy, containers Data.Map.Strict
O(1). The empty map. > empty == fromList [] > size empty == 0
empty :: Seq a
containers Data.Sequence
O(1). The empty sequence.
empty :: Set a
containers Data.Set
O(1). The empty set.
empty :: Text
text Data.Text.Internal, text Data.Text
O(1) The empty Text.
empty :: Text
text Data.Text.Lazy.Internal, text Data.Text.Lazy
Smart constructor for Empty.
empty :: Data a => a
syb Data.Generics.Builders
Construct the empty value for a datatype. For algebraic datatypes, the leftmost constructor is chosen.
empty :: Extract source => source
regex-base Text.Regex.Base.RegexLike
empty :: Graph gr => gr a b
fgl Data.Graph.Inductive.Graph
empty :: Ord a => Heap a b
fgl Data.Graph.Inductive.Internal.Heap
package empty
package
emptyAttr :: String -> HtmlAttr
html Text.Html, xhtml Text.XHtml.Strict, xhtml Text.XHtml.Frameset, xhtml Text.XHtml.Transitional
emptyBuffer :: RawBuffer e -> Int -> BufferState -> Buffer e
base GHC.IO.Buffer
emptyDef :: LanguageDef st
parsec Text.Parsec.Language, parsec Text.ParserCombinators.Parsec.Language
emptyFM :: Ord a => FiniteMap a b
fgl Data.Graph.Inductive.Internal.FiniteMap
EmptyL :: ViewL a
containers Data.Sequence
empty sequence
emptyM :: GraphM m gr => m (gr a b)
fgl Data.Graph.Inductive.Monad
emptyN :: Int -> IO (SGr a b)
fgl Data.Graph.Inductive.Monad.IOArray
emptyPermissions :: Permissions
directory System.Directory
EmptyR :: ViewR a
containers Data.Sequence
empty sequence
emptySignalSet :: SignalSet
unix System.Posix.Signals
emptyWriteBuffer :: BufferedIO dev => dev -> Buffer Word8 -> IO (Buffer Word8)
base GHC.IO.BufferedIO
eNOTEMPTY :: Errno
base Foreign.C.Error
isEmptyChan :: Chan a -> IO Bool
base Control.Concurrent.Chan
Returns True if the supplied Chan is empty.
isEmptyMVar :: MVar a -> IO Bool
base Control.Concurrent.MVar
Check whether a given MVar is empty. Notice that the boolean value returned is just a snapshot of the state of the MVar. By the time you get to react on its result, the MVar may have been filled (or emptied) - so be extremely careful when using this operation. Use tryTakeMVar instead if possible.
isEmptySampleVar :: SampleVar a -> IO Bool
base Control.Concurrent.SampleVar
Returns True if the SampleVar is currently empty. Note that this function is only useful if you know that no other threads can be modifying the state of the SampleVar, because otherwise the state of the SampleVar may have changed by the time you see the result of isEmptySampleVar.
mempty :: Monoid a => a
base Data.Monoid
newEmptyMVar :: IO (MVar a)
base Control.Concurrent.MVar
Create an MVar which is initially empty.
newEmptySampleVar :: IO (SampleVar a)
base Control.Concurrent.SampleVar
Build a new, empty, SampleVar
buf_empty :: BufferOp a -> a
HTTP Network.BufferType
buf_isEmpty :: BufferOp a -> a -> Bool
HTTP Network.BufferType
isEmpty :: Doc -> Bool
pretty Text.PrettyPrint.HughesPJ, pretty Text.PrettyPrint
Returns True if the document is empty
isEmpty :: Doc -> PprM Bool
template-haskell Language.Haskell.TH.PprLib
Returns True if the document is empty
isEmpty :: Graph gr => gr a b -> Bool
fgl Data.Graph.Inductive.Graph
isEmpty :: Ord a => Heap a b -> Bool
fgl Data.Graph.Inductive.Internal.Heap
isEmptyBuffer :: Buffer e -> Bool
base GHC.IO.Buffer
isEmptyFM :: FiniteMap a b -> Bool
fgl Data.Graph.Inductive.Internal.FiniteMap
isEmptyM :: GraphM m gr => m (gr a b) -> m Bool
fgl Data.Graph.Inductive.Monad
isEmptyTChan :: TChan a -> STM Bool
stm Control.Concurrent.STM.TChan
Returns True if the supplied TChan is empty.
isEmptyTMVar :: TMVar a -> STM Bool
stm Control.Concurrent.STM.TMVar
Check whether a given TMVar is empty.
newEmptyTMVar :: STM (TMVar a)
stm Control.Concurrent.STM.TMVar
Create a TMVar which is initially empty.
newEmptyTMVarIO :: IO (TMVar a)
stm Control.Concurrent.STM.TMVar
IO version of newEmptyTMVar. This is useful for creating top-level TMVars using unsafePerformIO, because using atomically inside unsafePerformIO isn't possible.
NonEmpty :: [a] -> NonEmptyList a
QuickCheck Test.QuickCheck.Modifiers, QuickCheck Test.QuickCheck
package NonEmpty
package
When you want to state that a list should always be non-empty, you can use this type. This enables you to avoid the error of taking the head or tail of an empty list. Version 0.1
newtype NonEmptyList a
QuickCheck Test.QuickCheck.Modifiers, QuickCheck Test.QuickCheck
NonEmpty xs: guarantees that xs is non-empty.
package NonEmptyList
package
A list with a length of at least one and type-safe head/tail operations. Version 0.0.9
queueEmpty :: Queue a -> Bool
fgl Data.Graph.Inductive.Internal.Queue
readTillEmpty1 :: BufferOp a -> IO (Result a) -> IO (Result [a])
HTTP Network.HTTP.Base
Remove leading crlfs then call readTillEmpty2 (not required by RFC)

Show more results