| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
ClassyPrelude.Yesod
Synopsis
- seq :: a -> b -> b
- fst :: (a, b) -> a
- snd :: (a, b) -> b
- otherwise :: Bool
- assert :: Bool -> a -> a
- ($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
- fromIntegral :: (Integral a, Num b) => a -> b
- realToFrac :: (Real a, Fractional b) => a -> b
- guard :: Alternative f => Bool -> f ()
- join :: Monad m => m (m a) -> m a
- class Bounded a where
- class Enum a where
- succ :: a -> a
- pred :: a -> a
- toEnum :: Int -> a
- fromEnum :: a -> Int
- enumFrom :: a -> [a]
- enumFromThen :: a -> a -> [a]
- enumFromTo :: a -> a -> [a]
- enumFromThenTo :: a -> a -> a -> [a]
- class Eq a where
- class Fractional a => Floating a where
- class Num a => Fractional a where
- (/) :: a -> a -> a
- recip :: a -> a
- fromRational :: Rational -> a
- class (Real a, Enum a) => Integral a where
- class Applicative m => Monad (m :: Type -> Type) where
- class Functor (f :: Type -> Type) where
- class Num a where
- class Eq a => Ord a where
- class Read a
- class (Num a, Ord a) => Real a where
- toRational :: a -> Rational
- class (RealFrac a, Floating a) => RealFloat a where
- floatRadix :: a -> Integer
- floatDigits :: a -> Int
- floatRange :: a -> (Int, Int)
- decodeFloat :: a -> (Integer, Int)
- encodeFloat :: Integer -> Int -> a
- exponent :: a -> Int
- significand :: a -> a
- scaleFloat :: Int -> a -> a
- isNaN :: a -> Bool
- isInfinite :: a -> Bool
- isDenormalized :: a -> Bool
- isNegativeZero :: a -> Bool
- isIEEE :: a -> Bool
- atan2 :: a -> a -> a
- class (Real a, Fractional a) => RealFrac a where
- class Show a where
- class Typeable (a :: k)
- class IsString a where
- fromString :: String -> a
- class Functor f => Applicative (f :: Type -> Type) where
- class Foldable (t :: Type -> Type)
- class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where
- traverse :: Applicative f => (a -> f b) -> t a -> f (t b)
- sequenceA :: Applicative f => t (f a) -> f (t a)
- mapM :: Monad m => (a -> m b) -> t a -> m (t b)
- sequence :: Monad m => t (m a) -> m (t a)
- class Generic a
- class Semigroup a where
- class Semigroup a => Monoid a where
- data Bool
- data Char
- data Double
- data Float
- data Int
- data Int32
- data Int64
- data Integer
- data Maybe a
- data Ordering
- type Rational = Ratio Integer
- data RealWorld
- data IO a
- data Word
- data Word8
- data Word32
- data Word64
- data Either a b
- data ByteString
- (<$>) :: Functor f => (a -> b) -> f a -> f b
- type String = [Char]
- class Hashable a where
- hashWithSalt :: Int -> a -> Int
- hash :: a -> Int
- data Text
- const :: a -> b -> a
- data UTCTime = UTCTime {
- utctDay :: Day
- utctDayTime :: DiffTime
- data HashMap k v
- data Map k a
- class ToJSON a where
- toJSON :: a -> Value
- toEncoding :: a -> Encoding
- toJSONList :: [a] -> Value
- toEncodingList :: [a] -> Encoding
- (.=) :: (KeyValue kv, ToJSON v) => Text -> v -> kv
- (.:) :: FromJSON a => Object -> Text -> Parser a
- class FromJSON a where
- object :: [Pair] -> Value
- data Value
- (<&>) :: Functor f => f a -> (a -> b) -> f b
- ($>) :: Functor f => f a -> b -> f b
- data SomeAsyncException = Exception e => SomeAsyncException e
- data Chan a
- data MVar a
- newChan :: MonadIO m => m (Chan a)
- writeChan :: MonadIO m => Chan a -> a -> m ()
- readChan :: MonadIO m => Chan a -> m a
- dupChan :: MonadIO m => Chan a -> m (Chan a)
- getChanContents :: MonadIO m => Chan a -> m [a]
- writeList2Chan :: MonadIO m => Chan a -> [a] -> m ()
- data STM a
- data StringException = StringException String CallStack
- data AsyncExceptionWrapper = Exception e => AsyncExceptionWrapper e
- data SyncExceptionWrapper = Exception e => SyncExceptionWrapper e
- catch :: (MonadUnliftIO m, Exception e) => m a -> (e -> m a) -> m a
- catchIO :: MonadUnliftIO m => m a -> (IOException -> m a) -> m a
- catchAny :: MonadUnliftIO m => m a -> (SomeException -> m a) -> m a
- catchDeep :: (MonadUnliftIO m, Exception e, NFData a) => m a -> (e -> m a) -> m a
- catchAnyDeep :: (NFData a, MonadUnliftIO m) => m a -> (SomeException -> m a) -> m a
- catchJust :: (MonadUnliftIO m, Exception e) => (e -> Maybe b) -> m a -> (b -> m a) -> m a
- handle :: (MonadUnliftIO m, Exception e) => (e -> m a) -> m a -> m a
- handleIO :: MonadUnliftIO m => (IOException -> m a) -> m a -> m a
- handleAny :: MonadUnliftIO m => (SomeException -> m a) -> m a -> m a
- handleDeep :: (MonadUnliftIO m, Exception e, NFData a) => (e -> m a) -> m a -> m a
- handleAnyDeep :: (MonadUnliftIO m, NFData a) => (SomeException -> m a) -> m a -> m a
- handleJust :: (MonadUnliftIO m, Exception e) => (e -> Maybe b) -> (b -> m a) -> m a -> m a
- try :: (MonadUnliftIO m, Exception e) => m a -> m (Either e a)
- tryIO :: MonadUnliftIO m => m a -> m (Either IOException a)
- tryAny :: MonadUnliftIO m => m a -> m (Either SomeException a)
- tryDeep :: (MonadUnliftIO m, Exception e, NFData a) => m a -> m (Either e a)
- tryAnyDeep :: (MonadUnliftIO m, NFData a) => m a -> m (Either SomeException a)
- tryJust :: (MonadUnliftIO m, Exception e) => (e -> Maybe b) -> m a -> m (Either b a)
- pureTry :: a -> Either SomeException a
- pureTryDeep :: NFData a => a -> Either SomeException a
- catches :: MonadUnliftIO m => m a -> [Handler m a] -> m a
- catchesDeep :: (MonadUnliftIO m, NFData a) => m a -> [Handler m a] -> m a
- evaluate :: MonadIO m => a -> m a
- evaluateDeep :: (MonadIO m, NFData a) => a -> m a
- bracket :: MonadUnliftIO m => m a -> (a -> m b) -> (a -> m c) -> m c
- bracket_ :: MonadUnliftIO m => m a -> m b -> m c -> m c
- bracketOnError :: MonadUnliftIO m => m a -> (a -> m b) -> (a -> m c) -> m c
- bracketOnError_ :: MonadUnliftIO m => m a -> m b -> m c -> m c
- finally :: MonadUnliftIO m => m a -> m b -> m a
- withException :: (MonadUnliftIO m, Exception e) => m a -> (e -> m b) -> m a
- onException :: MonadUnliftIO m => m a -> m b -> m a
- throwIO :: (MonadIO m, Exception e) => e -> m a
- toSyncException :: Exception e => e -> SomeException
- toAsyncException :: Exception e => e -> SomeException
- isSyncException :: Exception e => e -> Bool
- isAsyncException :: Exception e => e -> Bool
- mask :: MonadUnliftIO m => ((forall a. m a -> m a) -> m b) -> m b
- uninterruptibleMask :: MonadUnliftIO m => ((forall a. m a -> m a) -> m b) -> m b
- mask_ :: MonadUnliftIO m => m a -> m a
- uninterruptibleMask_ :: MonadUnliftIO m => m a -> m a
- throwString :: (MonadIO m, HasCallStack) => String -> m a
- stringException :: HasCallStack => String -> StringException
- throwTo :: (Exception e, MonadIO m) => ThreadId -> e -> m ()
- impureThrow :: Exception e => e -> a
- fromEither :: (Exception e, MonadIO m) => Either e a -> m a
- fromEitherIO :: (Exception e, MonadIO m) => IO (Either e a) -> m a
- fromEitherM :: (Exception e, MonadIO m) => m (Either e a) -> m a
- newTVar :: a -> STM (TVar a)
- readTVar :: TVar a -> STM a
- writeTVar :: TVar a -> a -> STM ()
- data TVar a
- data BufferMode
- stderr :: Handle
- stdin :: Handle
- stdout :: Handle
- data SeekMode
- data IOMode
- withFile :: MonadUnliftIO m => FilePath -> IOMode -> (Handle -> m a) -> m a
- withBinaryFile :: MonadUnliftIO m => FilePath -> IOMode -> (Handle -> m a) -> m a
- hClose :: MonadIO m => Handle -> m ()
- hFlush :: MonadIO m => Handle -> m ()
- hFileSize :: MonadIO m => Handle -> m Integer
- hSetFileSize :: MonadIO m => Handle -> Integer -> m ()
- hIsEOF :: MonadIO m => Handle -> m Bool
- hSetBuffering :: MonadIO m => Handle -> BufferMode -> m ()
- hGetBuffering :: MonadIO m => Handle -> m BufferMode
- hSeek :: MonadIO m => Handle -> SeekMode -> Integer -> m ()
- hTell :: MonadIO m => Handle -> m Integer
- hIsOpen :: MonadIO m => Handle -> m Bool
- hIsClosed :: MonadIO m => Handle -> m Bool
- hIsReadable :: MonadIO m => Handle -> m Bool
- hIsWritable :: MonadIO m => Handle -> m Bool
- hIsSeekable :: MonadIO m => Handle -> m Bool
- hIsTerminalDevice :: MonadIO m => Handle -> m Bool
- hSetEcho :: MonadIO m => Handle -> Bool -> m ()
- hGetEcho :: MonadIO m => Handle -> m Bool
- hWaitForInput :: MonadIO m => Handle -> Int -> m Bool
- hReady :: MonadIO m => Handle -> m Bool
- getMonotonicTime :: MonadIO m => m Double
- newIORef :: MonadIO m => a -> m (IORef a)
- readIORef :: MonadIO m => IORef a -> m a
- writeIORef :: MonadIO m => IORef a -> a -> m ()
- modifyIORef :: MonadIO m => IORef a -> (a -> a) -> m ()
- modifyIORef' :: MonadIO m => IORef a -> (a -> a) -> m ()
- atomicModifyIORef :: MonadIO m => IORef a -> (a -> (a, b)) -> m b
- atomicModifyIORef' :: MonadIO m => IORef a -> (a -> (a, b)) -> m b
- atomicWriteIORef :: MonadIO m => IORef a -> a -> m ()
- mkWeakIORef :: MonadUnliftIO m => IORef a -> m () -> m (Weak (IORef a))
- isEmptyTBQueue :: TBQueue a -> STM Bool
- isFullTBQueue :: TBQueue a -> STM Bool
- newTBQueue :: Natural -> STM (TBQueue a)
- peekTBQueue :: TBQueue a -> STM a
- readTBQueue :: TBQueue a -> STM a
- tryPeekTBQueue :: TBQueue a -> STM (Maybe a)
- tryReadTBQueue :: TBQueue a -> STM (Maybe a)
- unGetTBQueue :: TBQueue a -> a -> STM ()
- writeTBQueue :: TBQueue a -> a -> STM ()
- cloneTChan :: TChan a -> STM (TChan a)
- dupTChan :: TChan a -> STM (TChan a)
- isEmptyTChan :: TChan a -> STM Bool
- newTChan :: STM (TChan a)
- peekTChan :: TChan a -> STM a
- readTChan :: TChan a -> STM a
- tryPeekTChan :: TChan a -> STM (Maybe a)
- tryReadTChan :: TChan a -> STM (Maybe a)
- unGetTChan :: TChan a -> a -> STM ()
- writeTChan :: TChan a -> a -> STM ()
- isEmptyTMVar :: TMVar a -> STM Bool
- newEmptyTMVar :: STM (TMVar a)
- newTMVar :: a -> STM (TMVar a)
- putTMVar :: TMVar a -> a -> STM ()
- readTMVar :: TMVar a -> STM a
- swapTMVar :: TMVar a -> a -> STM a
- takeTMVar :: TMVar a -> STM a
- tryPutTMVar :: TMVar a -> a -> STM Bool
- tryReadTMVar :: TMVar a -> STM (Maybe a)
- tryTakeTMVar :: TMVar a -> STM (Maybe a)
- isEmptyTQueue :: TQueue a -> STM Bool
- newTQueue :: STM (TQueue a)
- peekTQueue :: TQueue a -> STM a
- readTQueue :: TQueue a -> STM a
- tryPeekTQueue :: TQueue a -> STM (Maybe a)
- tryReadTQueue :: TQueue a -> STM (Maybe a)
- unGetTQueue :: TQueue a -> a -> STM ()
- writeTQueue :: TQueue a -> a -> STM ()
- modifyTVar :: TVar a -> (a -> a) -> STM ()
- modifyTVar' :: TVar a -> (a -> a) -> STM ()
- swapTVar :: TVar a -> a -> STM a
- data TBQueue a
- data TChan a
- data TMVar a
- data TQueue a
- data ConcException = EmptyWithNoAlternative
- data Conc (m :: Type -> Type) a
- newtype Concurrently (m :: Type -> Type) a = Concurrently {
- runConcurrently :: m a
- async :: MonadUnliftIO m => m a -> m (Async a)
- asyncBound :: MonadUnliftIO m => m a -> m (Async a)
- asyncOn :: MonadUnliftIO m => Int -> m a -> m (Async a)
- asyncWithUnmask :: MonadUnliftIO m => ((forall b. m b -> m b) -> m a) -> m (Async a)
- asyncOnWithUnmask :: MonadUnliftIO m => Int -> ((forall b. m b -> m b) -> m a) -> m (Async a)
- withAsync :: MonadUnliftIO m => m a -> (Async a -> m b) -> m b
- withAsyncBound :: MonadUnliftIO m => m a -> (Async a -> m b) -> m b
- withAsyncOn :: MonadUnliftIO m => Int -> m a -> (Async a -> m b) -> m b
- withAsyncWithUnmask :: MonadUnliftIO m => ((forall c. m c -> m c) -> m a) -> (Async a -> m b) -> m b
- withAsyncOnWithUnmask :: MonadUnliftIO m => Int -> ((forall c. m c -> m c) -> m a) -> (Async a -> m b) -> m b
- wait :: MonadIO m => Async a -> m a
- poll :: MonadIO m => Async a -> m (Maybe (Either SomeException a))
- waitCatch :: MonadIO m => Async a -> m (Either SomeException a)
- cancel :: MonadIO m => Async a -> m ()
- uninterruptibleCancel :: MonadIO m => Async a -> m ()
- cancelWith :: (Exception e, MonadIO m) => Async a -> e -> m ()
- waitAny :: MonadIO m => [Async a] -> m (Async a, a)
- waitAnyCatch :: MonadIO m => [Async a] -> m (Async a, Either SomeException a)
- waitAnyCancel :: MonadIO m => [Async a] -> m (Async a, a)
- waitAnyCatchCancel :: MonadIO m => [Async a] -> m (Async a, Either SomeException a)
- waitEither :: MonadIO m => Async a -> Async b -> m (Either a b)
- waitEitherCatch :: MonadIO m => Async a -> Async b -> m (Either (Either SomeException a) (Either SomeException b))
- waitEitherCancel :: MonadIO m => Async a -> Async b -> m (Either a b)
- waitEitherCatchCancel :: MonadIO m => Async a -> Async b -> m (Either (Either SomeException a) (Either SomeException b))
- waitEither_ :: MonadIO m => Async a -> Async b -> m ()
- waitBoth :: MonadIO m => Async a -> Async b -> m (a, b)
- link :: MonadIO m => Async a -> m ()
- link2 :: MonadIO m => Async a -> Async b -> m ()
- race :: MonadUnliftIO m => m a -> m b -> m (Either a b)
- race_ :: MonadUnliftIO m => m a -> m b -> m ()
- concurrently :: MonadUnliftIO m => m a -> m b -> m (a, b)
- concurrently_ :: MonadUnliftIO m => m a -> m b -> m ()
- forConcurrently :: (MonadUnliftIO m, Traversable t) => t a -> (a -> m b) -> m (t b)
- forConcurrently_ :: (MonadUnliftIO m, Foldable f) => f a -> (a -> m b) -> m ()
- replicateConcurrently :: MonadUnliftIO m => Int -> m b -> m [b]
- replicateConcurrently_ :: (Applicative m, MonadUnliftIO m) => Int -> m a -> m ()
- mapConcurrently :: (MonadUnliftIO m, Traversable t) => (a -> m b) -> t a -> m (t b)
- mapConcurrently_ :: (MonadUnliftIO m, Foldable f) => (a -> m b) -> f a -> m ()
- conc :: m a -> Conc m a
- runConc :: MonadUnliftIO m => Conc m a -> m a
- pooledMapConcurrentlyN :: (MonadUnliftIO m, Traversable t) => Int -> (a -> m b) -> t a -> m (t b)
- pooledMapConcurrently :: (MonadUnliftIO m, Traversable t) => (a -> m b) -> t a -> m (t b)
- pooledForConcurrentlyN :: (MonadUnliftIO m, Traversable t) => Int -> t a -> (a -> m b) -> m (t b)
- pooledForConcurrently :: (MonadUnliftIO m, Traversable t) => t a -> (a -> m b) -> m (t b)
- pooledMapConcurrentlyN_ :: (MonadUnliftIO m, Foldable f) => Int -> (a -> m b) -> f a -> m ()
- pooledMapConcurrently_ :: (MonadUnliftIO m, Foldable f) => (a -> m b) -> f a -> m ()
- pooledForConcurrently_ :: (MonadUnliftIO m, Foldable f) => f a -> (a -> m b) -> m ()
- pooledForConcurrentlyN_ :: (MonadUnliftIO m, Foldable t) => Int -> t a -> (a -> m b) -> m ()
- pooledReplicateConcurrentlyN :: MonadUnliftIO m => Int -> Int -> m a -> m [a]
- pooledReplicateConcurrently :: MonadUnliftIO m => Int -> m a -> m [a]
- pooledReplicateConcurrentlyN_ :: MonadUnliftIO m => Int -> Int -> m a -> m ()
- pooledReplicateConcurrently_ :: MonadUnliftIO m => Int -> m a -> m ()
- newEmptyMVar :: MonadIO m => m (MVar a)
- newMVar :: MonadIO m => a -> m (MVar a)
- takeMVar :: MonadIO m => MVar a -> m a
- putMVar :: MonadIO m => MVar a -> a -> m ()
- readMVar :: MonadIO m => MVar a -> m a
- swapMVar :: MonadIO m => MVar a -> a -> m a
- tryTakeMVar :: MonadIO m => MVar a -> m (Maybe a)
- tryPutMVar :: MonadIO m => MVar a -> a -> m Bool
- isEmptyMVar :: MonadIO m => MVar a -> m Bool
- tryReadMVar :: MonadIO m => MVar a -> m (Maybe a)
- withMVar :: MonadUnliftIO m => MVar a -> (a -> m b) -> m b
- withMVarMasked :: MonadUnliftIO m => MVar a -> (a -> m b) -> m b
- modifyMVar_ :: MonadUnliftIO m => MVar a -> (a -> m a) -> m ()
- modifyMVar :: MonadUnliftIO m => MVar a -> (a -> m (a, b)) -> m b
- modifyMVarMasked_ :: MonadUnliftIO m => MVar a -> (a -> m a) -> m ()
- modifyMVarMasked :: MonadUnliftIO m => MVar a -> (a -> m (a, b)) -> m b
- mkWeakMVar :: MonadUnliftIO m => MVar a -> m () -> m (Weak (MVar a))
- data Memoized a
- runMemoized :: MonadIO m => Memoized a -> m a
- memoizeRef :: MonadUnliftIO m => m a -> m (Memoized a)
- memoizeMVar :: MonadUnliftIO m => m a -> m (Memoized a)
- atomically :: MonadIO m => STM a -> m a
- retrySTM :: STM a
- checkSTM :: Bool -> STM ()
- newTVarIO :: MonadIO m => a -> m (TVar a)
- readTVarIO :: MonadIO m => TVar a -> m a
- registerDelay :: MonadIO m => Int -> m (TVar Bool)
- mkWeakTVar :: MonadUnliftIO m => TVar a -> m () -> m (Weak (TVar a))
- newTMVarIO :: MonadIO m => a -> m (TMVar a)
- newEmptyTMVarIO :: MonadIO m => m (TMVar a)
- mkWeakTMVar :: MonadUnliftIO m => TMVar a -> m () -> m (Weak (TMVar a))
- newTChanIO :: MonadIO m => m (TChan a)
- newBroadcastTChanIO :: MonadIO m => m (TChan a)
- newTQueueIO :: MonadIO m => m (TQueue a)
- newTBQueueIO :: MonadIO m => Natural -> m (TBQueue a)
- withSystemTempFile :: MonadUnliftIO m => String -> (FilePath -> Handle -> m a) -> m a
- withSystemTempDirectory :: MonadUnliftIO m => String -> (FilePath -> m a) -> m a
- withTempFile :: MonadUnliftIO m => FilePath -> String -> (FilePath -> Handle -> m a) -> m a
- withTempDirectory :: MonadUnliftIO m => FilePath -> String -> (FilePath -> m a) -> m a
- timeout :: MonadUnliftIO m => Int -> m a -> m (Maybe a)
- wrappedWithRunInIO :: MonadUnliftIO n => (n b -> m b) -> (forall a. m a -> n a) -> ((forall a. m a -> IO a) -> IO b) -> m b
- toIO :: MonadUnliftIO m => m a -> m (IO a)
- withUnliftIO :: MonadUnliftIO m => (UnliftIO m -> IO a) -> m a
- askRunInIO :: MonadUnliftIO m => m (m a -> IO a)
- newtype UnliftIO (m :: Type -> Type) = UnliftIO {}
- class MonadIO m => MonadUnliftIO (m :: Type -> Type) where
- askUnliftIO :: m (UnliftIO m)
- withRunInIO :: ((forall a. m a -> IO a) -> IO b) -> m b
- data TBChan a
- newTBChan :: Int -> STM (TBChan a)
- newTBChanIO :: Int -> IO (TBChan a)
- readTBChan :: TBChan a -> STM a
- tryReadTBChan :: TBChan a -> STM (Maybe a)
- peekTBChan :: TBChan a -> STM a
- tryPeekTBChan :: TBChan a -> STM (Maybe a)
- writeTBChan :: TBChan a -> a -> STM ()
- tryWriteTBChan :: TBChan a -> a -> STM Bool
- unGetTBChan :: TBChan a -> a -> STM ()
- isEmptyTBChan :: TBChan a -> STM Bool
- isFullTBChan :: TBChan a -> STM Bool
- estimateFreeSlotsTBChan :: TBChan a -> STM Int
- freeSlotsTBChan :: TBChan a -> STM Int
- data TBMChan a
- newTBMChan :: Int -> STM (TBMChan a)
- newTBMChanIO :: Int -> IO (TBMChan a)
- readTBMChan :: TBMChan a -> STM (Maybe a)
- tryReadTBMChan :: TBMChan a -> STM (Maybe (Maybe a))
- peekTBMChan :: TBMChan a -> STM (Maybe a)
- tryPeekTBMChan :: TBMChan a -> STM (Maybe (Maybe a))
- writeTBMChan :: TBMChan a -> a -> STM ()
- tryWriteTBMChan :: TBMChan a -> a -> STM (Maybe Bool)
- unGetTBMChan :: TBMChan a -> a -> STM ()
- closeTBMChan :: TBMChan a -> STM ()
- isClosedTBMChan :: TBMChan a -> STM Bool
- isEmptyTBMChan :: TBMChan a -> STM Bool
- isFullTBMChan :: TBMChan a -> STM Bool
- estimateFreeSlotsTBMChan :: TBMChan a -> STM Int
- freeSlotsTBMChan :: TBMChan a -> STM Int
- data TBMQueue a
- newTBMQueue :: Int -> STM (TBMQueue a)
- newTBMQueueIO :: Int -> IO (TBMQueue a)
- readTBMQueue :: TBMQueue a -> STM (Maybe a)
- tryReadTBMQueue :: TBMQueue a -> STM (Maybe (Maybe a))
- peekTBMQueue :: TBMQueue a -> STM (Maybe a)
- tryPeekTBMQueue :: TBMQueue a -> STM (Maybe (Maybe a))
- writeTBMQueue :: TBMQueue a -> a -> STM ()
- tryWriteTBMQueue :: TBMQueue a -> a -> STM (Maybe Bool)
- unGetTBMQueue :: TBMQueue a -> a -> STM ()
- closeTBMQueue :: TBMQueue a -> STM ()
- isClosedTBMQueue :: TBMQueue a -> STM Bool
- isEmptyTBMQueue :: TBMQueue a -> STM Bool
- isFullTBMQueue :: TBMQueue a -> STM Bool
- estimateFreeSlotsTBMQueue :: TBMQueue a -> STM Int
- freeSlotsTBMQueue :: TBMQueue a -> STM Int
- data TMChan a
- newTMChan :: STM (TMChan a)
- newTMChanIO :: IO (TMChan a)
- newBroadcastTMChan :: STM (TMChan a)
- newBroadcastTMChanIO :: IO (TMChan a)
- dupTMChan :: TMChan a -> STM (TMChan a)
- readTMChan :: TMChan a -> STM (Maybe a)
- tryReadTMChan :: TMChan a -> STM (Maybe (Maybe a))
- peekTMChan :: TMChan a -> STM (Maybe a)
- tryPeekTMChan :: TMChan a -> STM (Maybe (Maybe a))
- writeTMChan :: TMChan a -> a -> STM ()
- unGetTMChan :: TMChan a -> a -> STM ()
- closeTMChan :: TMChan a -> STM ()
- isClosedTMChan :: TMChan a -> STM Bool
- isEmptyTMChan :: TMChan a -> STM Bool
- data TMQueue a
- newTMQueue :: STM (TMQueue a)
- newTMQueueIO :: IO (TMQueue a)
- readTMQueue :: TMQueue a -> STM (Maybe a)
- tryReadTMQueue :: TMQueue a -> STM (Maybe (Maybe a))
- peekTMQueue :: TMQueue a -> STM (Maybe a)
- tryPeekTMQueue :: TMQueue a -> STM (Maybe (Maybe a))
- writeTMQueue :: TMQueue a -> a -> STM ()
- unGetTMQueue :: TMQueue a -> a -> STM ()
- closeTMQueue :: TMQueue a -> STM ()
- isClosedTMQueue :: TMQueue a -> STM Bool
- isEmptyTMQueue :: TMQueue a -> STM Bool
- newBroadcastTChan :: STM (TChan a)
- say :: MonadIO m => Text -> m ()
- sayString :: MonadIO m => String -> m ()
- sayShow :: (MonadIO m, Show a) => a -> m ()
- sayErr :: MonadIO m => Text -> m ()
- sayErrString :: MonadIO m => String -> m ()
- sayErrShow :: (MonadIO m, Show a) => a -> m ()
- hSay :: MonadIO m => Handle -> Text -> m ()
- hSayString :: MonadIO m => Handle -> String -> m ()
- hSayShow :: (MonadIO m, Show a) => Handle -> a -> m ()
- newMutVar :: PrimMonad m => a -> m (MutVar (PrimState m) a)
- readMutVar :: PrimMonad m => MutVar (PrimState m) a -> m a
- writeMutVar :: PrimMonad m => MutVar (PrimState m) a -> a -> m ()
- atomicModifyMutVar :: PrimMonad m => MutVar (PrimState m) a -> (a -> (a, b)) -> m b
- atomicModifyMutVar' :: PrimMonad m => MutVar (PrimState m) a -> (a -> (a, b)) -> m b
- modifyMutVar :: PrimMonad m => MutVar (PrimState m) a -> (a -> a) -> m ()
- modifyMutVar' :: PrimMonad m => MutVar (PrimState m) a -> (a -> a) -> m ()
- class Prim a
- data MutVar s a = MutVar (MutVar# s a)
- type family PrimState (m :: Type -> Type)
- class Monad m => PrimMonad (m :: Type -> Type) where
- data IORef a
- data STRef s a
- type MutableDeque c = (MutableQueue c, MutablePushFront c, MutablePopBack c)
- type MutableStack c = (MutablePopFront c, MutablePushFront c)
- type MutableQueue c = (MutablePopFront c, MutablePushBack c)
- class MutableCollection c => MutablePushBack c where
- pushBack :: (PrimMonad m, PrimState m ~ MCState c) => c -> CollElement c -> m ()
- class MutableCollection c => MutablePopBack c where
- class MutableCollection c => MutablePushFront c where
- pushFront :: (PrimMonad m, PrimState m ~ MCState c) => c -> CollElement c -> m ()
- class MutableCollection c => MutablePopFront c where
- class MutableContainer c => MutableCollection c where
- type CollElement c
- newColl :: (PrimMonad m, PrimState m ~ MCState c) => m c
- type family CollElement c
- class MutableRef c => MutableAtomicRef c where
- atomicModifyRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> (RefElement c, a)) -> m a
- atomicModifyRef' :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> (RefElement c, a)) -> m a
- class MutableContainer c => MutableRef c where
- type RefElement c
- newRef :: (PrimMonad m, PrimState m ~ MCState c) => RefElement c -> m c
- readRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> m (RefElement c)
- writeRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> RefElement c -> m ()
- modifyRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> RefElement c) -> m ()
- modifyRef' :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> RefElement c) -> m ()
- type family RefElement c
- class MutableContainer c where
- type MCState c
- type family MCState c
- asIORef :: IORef a -> IORef a
- asSTRef :: STRef s a -> STRef s a
- asMutVar :: MutVar s a -> MutVar s a
- type IOBRef = BRef (PrimState IO)
- data BRef s a
- asBRef :: BRef s a -> BRef s a
- data DLList s a
- asDLList :: DLList s a -> DLList s a
- type BDeque = Deque MVector
- type SDeque = Deque MVector
- type UDeque = Deque MVector
- data Deque (v :: Type -> Type -> Type) s a
- asUDeque :: UDeque s a -> UDeque s a
- asSDeque :: SDeque s a -> SDeque s a
- asBDeque :: BDeque s a -> BDeque s a
- type IOPRef = PRef (PrimState IO)
- data PRef s a
- asPRef :: PRef s a -> PRef s a
- type IOSRef = SRef (PrimState IO)
- data SRef s a
- asSRef :: SRef s a -> SRef s a
- type IOURef = URef (PrimState IO)
- data URef s a
- asURef :: URef s a -> URef s a
- data WrappedMono mono a where
- WrappedMono :: forall mono a. Element mono ~ a => mono -> WrappedMono mono a
- newtype WrappedPoly (f :: Type -> Type) a = WrappedPoly {
- unwrapPoly :: f a
- class MonoFoldable mono => GrowingAppend mono
- class MonoFunctor mono => MonoComonad mono where
- class MonoPointed mono where
- class (MonoFunctor mono, MonoFoldable mono) => MonoTraversable mono where
- otraverse :: Applicative f => (Element mono -> f (Element mono)) -> mono -> f mono
- omapM :: Applicative m => (Element mono -> m (Element mono)) -> mono -> m mono
- class MonoFoldable mono where
- ofoldMap :: Monoid m => (Element mono -> m) -> mono -> m
- ofoldr :: (Element mono -> b -> b) -> b -> mono -> b
- ofoldl' :: (a -> Element mono -> a) -> a -> mono -> a
- otoList :: mono -> [Element mono]
- oall :: (Element mono -> Bool) -> mono -> Bool
- oany :: (Element mono -> Bool) -> mono -> Bool
- onull :: mono -> Bool
- olength :: mono -> Int
- olength64 :: mono -> Int64
- ocompareLength :: Integral i => mono -> i -> Ordering
- otraverse_ :: Applicative f => (Element mono -> f b) -> mono -> f ()
- ofor_ :: Applicative f => mono -> (Element mono -> f b) -> f ()
- omapM_ :: Applicative m => (Element mono -> m ()) -> mono -> m ()
- oforM_ :: Applicative m => mono -> (Element mono -> m ()) -> m ()
- ofoldlM :: Monad m => (a -> Element mono -> m a) -> a -> mono -> m a
- ofoldMap1Ex :: Semigroup m => (Element mono -> m) -> mono -> m
- ofoldr1Ex :: (Element mono -> Element mono -> Element mono) -> mono -> Element mono
- ofoldl1Ex' :: (Element mono -> Element mono -> Element mono) -> mono -> Element mono
- headEx :: mono -> Element mono
- lastEx :: mono -> Element mono
- unsafeHead :: mono -> Element mono
- unsafeLast :: mono -> Element mono
- maximumByEx :: (Element mono -> Element mono -> Ordering) -> mono -> Element mono
- minimumByEx :: (Element mono -> Element mono -> Ordering) -> mono -> Element mono
- oelem :: Element mono -> mono -> Bool
- onotElem :: Element mono -> mono -> Bool
- class MonoFunctor mono where
- type family Element mono
- replaceElem :: (MonoFunctor mono, Eq (Element mono)) => Element mono -> Element mono -> mono -> mono
- replaceElemStrictText :: Char -> Char -> Text -> Text
- replaceElemLazyText :: Char -> Char -> Text -> Text
- headMay :: MonoFoldable mono => mono -> Maybe (Element mono)
- lastMay :: MonoFoldable mono => mono -> Maybe (Element mono)
- osum :: (MonoFoldable mono, Num (Element mono)) => mono -> Element mono
- oproduct :: (MonoFoldable mono, Num (Element mono)) => mono -> Element mono
- oand :: (Element mono ~ Bool, MonoFoldable mono) => mono -> Bool
- oor :: (Element mono ~ Bool, MonoFoldable mono) => mono -> Bool
- oconcatMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> m
- ofold :: (MonoFoldable mono, Monoid (Element mono)) => mono -> Element mono
- oconcat :: (MonoFoldable mono, Monoid (Element mono)) => mono -> Element mono
- ofoldM :: (MonoFoldable mono, Monad m) => (a -> Element mono -> m a) -> a -> mono -> m a
- osequence_ :: (Applicative m, MonoFoldable mono, Element mono ~ m ()) => mono -> m ()
- maximumEx :: (MonoFoldable mono, Ord (Element mono)) => mono -> Element mono
- minimumEx :: (MonoFoldable mono, Ord (Element mono)) => mono -> Element mono
- maximumMay :: (MonoFoldable mono, Ord (Element mono)) => mono -> Maybe (Element mono)
- maximumByMay :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> mono -> Maybe (Element mono)
- minimumMay :: (MonoFoldable mono, Ord (Element mono)) => mono -> Maybe (Element mono)
- minimumByMay :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> mono -> Maybe (Element mono)
- ofor :: (MonoTraversable mono, Applicative f) => mono -> (Element mono -> f (Element mono)) -> f mono
- oforM :: (MonoTraversable mono, Applicative f) => mono -> (Element mono -> f (Element mono)) -> f mono
- ofoldlUnwrap :: MonoFoldable mono => (x -> Element mono -> x) -> x -> (x -> b) -> mono -> b
- ofoldMUnwrap :: (Monad m, MonoFoldable mono) => (x -> Element mono -> m x) -> m x -> (x -> m b) -> mono -> m b
- ointercalate :: (MonoFoldable mono, Monoid (Element mono)) => Element mono -> mono -> Element mono
- unwrapMono :: WrappedMono mono a -> mono
- class SetContainer set => HasKeysSet set where
- type family KeySet set
- class MonoFunctor mono => MonoZip mono where
- class (SetContainer set, Element set ~ ContainerKey set) => IsSet set where
- class (MonoTraversable map, SetContainer map) => IsMap map where
- type MapValue map
- lookup :: ContainerKey map -> map -> Maybe (MapValue map)
- insertMap :: ContainerKey map -> MapValue map -> map -> map
- deleteMap :: ContainerKey map -> map -> map
- singletonMap :: ContainerKey map -> MapValue map -> map
- mapFromList :: [(ContainerKey map, MapValue map)] -> map
- mapToList :: map -> [(ContainerKey map, MapValue map)]
- findWithDefault :: MapValue map -> ContainerKey map -> map -> MapValue map
- insertWith :: (MapValue map -> MapValue map -> MapValue map) -> ContainerKey map -> MapValue map -> map -> map
- insertWithKey :: (ContainerKey map -> MapValue map -> MapValue map -> MapValue map) -> ContainerKey map -> MapValue map -> map -> map
- insertLookupWithKey :: (ContainerKey map -> MapValue map -> MapValue map -> MapValue map) -> ContainerKey map -> MapValue map -> map -> (Maybe (MapValue map), map)
- adjustMap :: (MapValue map -> MapValue map) -> ContainerKey map -> map -> map
- adjustWithKey :: (ContainerKey map -> MapValue map -> MapValue map) -> ContainerKey map -> map -> map
- updateMap :: (MapValue map -> Maybe (MapValue map)) -> ContainerKey map -> map -> map
- updateWithKey :: (ContainerKey map -> MapValue map -> Maybe (MapValue map)) -> ContainerKey map -> map -> map
- updateLookupWithKey :: (ContainerKey map -> MapValue map -> Maybe (MapValue map)) -> ContainerKey map -> map -> (Maybe (MapValue map), map)
- alterMap :: (Maybe (MapValue map) -> Maybe (MapValue map)) -> ContainerKey map -> map -> map
- unionWith :: (MapValue map -> MapValue map -> MapValue map) -> map -> map -> map
- unionWithKey :: (ContainerKey map -> MapValue map -> MapValue map -> MapValue map) -> map -> map -> map
- unionsWith :: (MapValue map -> MapValue map -> MapValue map) -> [map] -> map
- mapWithKey :: (ContainerKey map -> MapValue map -> MapValue map) -> map -> map
- omapKeysWith :: (MapValue map -> MapValue map -> MapValue map) -> (ContainerKey map -> ContainerKey map) -> map -> map
- filterMap :: (MapValue map -> Bool) -> map -> map
- type family MapValue map
- class BiPolyMap (map :: Type -> Type -> Type) where
- type BPMKeyConstraint (map :: Type -> Type -> Type) key
- mapKeysWith :: (BPMKeyConstraint map k1, BPMKeyConstraint map k2) => (v -> v -> v) -> (k1 -> k2) -> map k1 v -> map k2 v
- type family BPMKeyConstraint (map :: Type -> Type -> Type) key
- class PolyMap (map :: Type -> Type) where
- differenceMap :: map value1 -> map value2 -> map value1
- intersectionMap :: map value1 -> map value2 -> map value1
- intersectionWithMap :: (value1 -> value2 -> value3) -> map value1 -> map value2 -> map value3
- class (Monoid set, Semigroup set, MonoFoldable set, Eq (ContainerKey set), GrowingAppend set) => SetContainer set where
- type ContainerKey set
- member :: ContainerKey set -> set -> Bool
- notMember :: ContainerKey set -> set -> Bool
- union :: set -> set -> set
- unions :: (MonoFoldable mono, Element mono ~ set) => mono -> set
- difference :: set -> set -> set
- intersection :: set -> set -> set
- keys :: set -> [ContainerKey set]
- type family ContainerKey set
- foldMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> m
- foldr :: MonoFoldable mono => (Element mono -> b -> b) -> b -> mono -> b
- foldl' :: MonoFoldable mono => (a -> Element mono -> a) -> a -> mono -> a
- toList :: MonoFoldable mono => mono -> [Element mono]
- all :: MonoFoldable mono => (Element mono -> Bool) -> mono -> Bool
- any :: MonoFoldable mono => (Element mono -> Bool) -> mono -> Bool
- null :: MonoFoldable mono => mono -> Bool
- length :: MonoFoldable mono => mono -> Int
- length64 :: MonoFoldable mono => mono -> Int64
- compareLength :: (MonoFoldable mono, Integral i) => mono -> i -> Ordering
- traverse_ :: (MonoFoldable mono, Applicative f) => (Element mono -> f b) -> mono -> f ()
- for_ :: (MonoFoldable mono, Applicative f) => mono -> (Element mono -> f b) -> f ()
- mapM_ :: (MonoFoldable mono, Applicative m) => (Element mono -> m ()) -> mono -> m ()
- forM_ :: (MonoFoldable mono, Applicative m) => mono -> (Element mono -> m ()) -> m ()
- foldlM :: (MonoFoldable mono, Monad m) => (a -> Element mono -> m a) -> a -> mono -> m a
- foldMap1Ex :: (MonoFoldable mono, Semigroup m) => (Element mono -> m) -> mono -> m
- foldr1Ex :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> mono -> Element mono
- foldl1Ex' :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> mono -> Element mono
- sum :: (MonoFoldable mono, Num (Element mono)) => mono -> Element mono
- product :: (MonoFoldable mono, Num (Element mono)) => mono -> Element mono
- and :: (MonoFoldable mono, Element mono ~ Bool) => mono -> Bool
- or :: (MonoFoldable mono, Element mono ~ Bool) => mono -> Bool
- concatMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> m
- elem :: (MonoFoldable mono, Eq (Element mono)) => Element mono -> mono -> Bool
- notElem :: (MonoFoldable mono, Eq (Element mono)) => Element mono -> mono -> Bool
- point :: MonoPointed mono => Element mono -> mono
- intercalate :: (MonoFoldable mono, Monoid (Element mono)) => Element mono -> mono -> Element mono
- fold :: (MonoFoldable mono, Monoid (Element mono)) => mono -> Element mono
- concat :: (MonoFoldable mono, Monoid (Element mono)) => mono -> Element mono
- foldM :: (MonoFoldable mono, Monad m) => (a -> Element mono -> m a) -> a -> mono -> m a
- sequence_ :: (Applicative m, MonoFoldable mono, Element mono ~ m ()) => mono -> m ()
- class (Textual textual, IsSequence binary) => Utf8 textual binary | textual -> binary, binary -> textual where
- encodeUtf8 :: textual -> binary
- decodeUtf8 :: binary -> textual
- class (IsSequence lazy, IsSequence strict) => LazySequence lazy strict | lazy -> strict, strict -> lazy where
- toChunks :: lazy -> [strict]
- fromChunks :: [strict] -> lazy
- toStrict :: lazy -> strict
- fromStrict :: strict -> lazy
- class (IsSequence t, IsString t, Element t ~ Char) => Textual t where
- words :: t -> [t]
- unwords :: (Element seq ~ t, MonoFoldable seq) => seq -> t
- lines :: t -> [t]
- unlines :: (Element seq ~ t, MonoFoldable seq) => seq -> t
- toLower :: t -> t
- toUpper :: t -> t
- toCaseFold :: t -> t
- breakWord :: t -> (t, t)
- breakLine :: t -> (t, t)
- class (Monoid seq, MonoTraversable seq, SemiSequence seq, MonoPointed seq) => IsSequence seq where
- fromList :: [Element seq] -> seq
- lengthIndex :: seq -> Index seq
- break :: (Element seq -> Bool) -> seq -> (seq, seq)
- span :: (Element seq -> Bool) -> seq -> (seq, seq)
- dropWhile :: (Element seq -> Bool) -> seq -> seq
- takeWhile :: (Element seq -> Bool) -> seq -> seq
- splitAt :: Index seq -> seq -> (seq, seq)
- unsafeSplitAt :: Index seq -> seq -> (seq, seq)
- take :: Index seq -> seq -> seq
- unsafeTake :: Index seq -> seq -> seq
- drop :: Index seq -> seq -> seq
- unsafeDrop :: Index seq -> seq -> seq
- dropEnd :: Index seq -> seq -> seq
- partition :: (Element seq -> Bool) -> seq -> (seq, seq)
- uncons :: seq -> Maybe (Element seq, seq)
- unsnoc :: seq -> Maybe (seq, Element seq)
- filter :: (Element seq -> Bool) -> seq -> seq
- filterM :: Monad m => (Element seq -> m Bool) -> seq -> m seq
- replicate :: Index seq -> Element seq -> seq
- replicateM :: Monad m => Index seq -> m (Element seq) -> m seq
- groupBy :: (Element seq -> Element seq -> Bool) -> seq -> [seq]
- groupAllOn :: Eq b => (Element seq -> b) -> seq -> [seq]
- subsequences :: seq -> [seq]
- permutations :: seq -> [seq]
- tailEx :: seq -> seq
- tailMay :: seq -> Maybe seq
- initEx :: seq -> seq
- initMay :: seq -> Maybe seq
- unsafeTail :: seq -> seq
- unsafeInit :: seq -> seq
- index :: seq -> Index seq -> Maybe (Element seq)
- indexEx :: seq -> Index seq -> Element seq
- unsafeIndex :: seq -> Index seq -> Element seq
- splitWhen :: (Element seq -> Bool) -> seq -> [seq]
- class (Integral (Index seq), GrowingAppend seq) => SemiSequence seq where
- type family Index seq
- singleton :: MonoPointed seq => Element seq -> seq
- defaultFind :: MonoFoldable seq => (Element seq -> Bool) -> seq -> Maybe (Element seq)
- defaultIntersperse :: IsSequence seq => Element seq -> seq -> seq
- defaultReverse :: IsSequence seq => seq -> seq
- defaultSortBy :: IsSequence seq => (Element seq -> Element seq -> Ordering) -> seq -> seq
- defaultSplitWhen :: IsSequence seq => (Element seq -> Bool) -> seq -> [seq]
- vectorSortBy :: Vector v e => (e -> e -> Ordering) -> v e -> v e
- vectorSort :: (Vector v e, Ord e) => v e -> v e
- defaultCons :: IsSequence seq => Element seq -> seq -> seq
- defaultSnoc :: IsSequence seq => seq -> Element seq -> seq
- tailDef :: IsSequence seq => seq -> seq
- initDef :: IsSequence seq => seq -> seq
- splitElem :: (IsSequence seq, Eq (Element seq)) => Element seq -> seq -> [seq]
- splitSeq :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> [seq]
- replaceSeq :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> seq -> seq
- stripPrefix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Maybe seq
- stripSuffix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Maybe seq
- dropPrefix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> seq
- dropSuffix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> seq
- ensurePrefix :: (Eq (Element seq), IsSequence seq) => seq -> seq -> seq
- ensureSuffix :: (Eq (Element seq), IsSequence seq) => seq -> seq -> seq
- isPrefixOf :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Bool
- isSuffixOf :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Bool
- isInfixOf :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Bool
- group :: (IsSequence seq, Eq (Element seq)) => seq -> [seq]
- groupAll :: (IsSequence seq, Eq (Element seq)) => seq -> [seq]
- splitElemStrictBS :: Word8 -> ByteString -> [ByteString]
- stripPrefixStrictBS :: ByteString -> ByteString -> Maybe ByteString
- stripSuffixStrictBS :: ByteString -> ByteString -> Maybe ByteString
- splitSeqLazyBS :: Word8 -> ByteString -> [ByteString]
- stripPrefixLazyBS :: ByteString -> ByteString -> Maybe ByteString
- stripSuffixLazyBS :: ByteString -> ByteString -> Maybe ByteString
- splitSeqStrictText :: Text -> Text -> [Text]
- replaceSeqStrictText :: Text -> Text -> Text -> Text
- splitSeqLazyText :: Text -> Text -> [Text]
- replaceSeqLazyText :: Text -> Text -> Text -> Text
- sort :: (SemiSequence seq, Ord (Element seq)) => seq -> seq
- catMaybes :: (IsSequence (f (Maybe t)), Functor f, Element (f (Maybe t)) ~ Maybe t) => f (Maybe t) -> f t
- sortOn :: (Ord o, SemiSequence seq) => (Element seq -> o) -> seq -> seq
- pack :: IsSequence seq => [Element seq] -> seq
- unpack :: MonoFoldable mono => mono -> [Element mono]
- repack :: (MonoFoldable a, IsSequence b, Element a ~ Element b) => a -> b
- data NonNull mono
- fromNullable :: MonoFoldable mono => mono -> Maybe (NonNull mono)
- impureNonNull :: MonoFoldable mono => mono -> NonNull mono
- nonNull :: MonoFoldable mono => mono -> NonNull mono
- fromNonEmpty :: IsSequence seq => NonEmpty (Element seq) -> NonNull seq
- toNonEmpty :: MonoFoldable mono => NonNull mono -> NonEmpty (Element mono)
- toMinList :: NonEmpty a -> NonNull [a]
- ncons :: SemiSequence seq => Element seq -> seq -> NonNull seq
- nuncons :: IsSequence seq => NonNull seq -> (Element seq, Maybe (NonNull seq))
- splitFirst :: IsSequence seq => NonNull seq -> (Element seq, seq)
- nfilter :: IsSequence seq => (Element seq -> Bool) -> NonNull seq -> seq
- nfilterM :: (Monad m, IsSequence seq) => (Element seq -> m Bool) -> NonNull seq -> m seq
- nReplicate :: IsSequence seq => Index seq -> Element seq -> NonNull seq
- tail :: IsSequence seq => NonNull seq -> seq
- init :: IsSequence seq => NonNull seq -> seq
- (<|) :: SemiSequence seq => Element seq -> NonNull seq -> NonNull seq
- head :: MonoFoldable mono => NonNull mono -> Element mono
- last :: MonoFoldable mono => NonNull mono -> Element mono
- ofoldMap1 :: (MonoFoldable mono, Semigroup m) => (Element mono -> m) -> NonNull mono -> m
- ofold1 :: (MonoFoldable mono, Semigroup (Element mono)) => NonNull mono -> Element mono
- ofoldr1 :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> NonNull mono -> Element mono
- ofoldl1' :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> NonNull mono -> Element mono
- maximum :: (MonoFoldable mono, Ord (Element mono)) => NonNull mono -> Element mono
- minimum :: (MonoFoldable mono, Ord (Element mono)) => NonNull mono -> Element mono
- maximumBy :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> NonNull mono -> Element mono
- minimumBy :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> NonNull mono -> Element mono
- mapNonNull :: (Functor f, MonoFoldable (f b)) => (a -> b) -> NonNull (f a) -> NonNull (f b)
- class ToBuilder value builder where
- toBuilder :: value -> builder
- class Monoid builder => Builder builder lazy | builder -> lazy, lazy -> builder where
- builderToLazy :: builder -> lazy
- flushBuilder :: builder
- type ByteStringBuilder = Builder
- type BlazeBuilder = Builder
- type TextBuilder = Builder
- textToBuilder :: ToBuilder Text builder => Text -> builder
- class Bifunctor (p :: Type -> Type -> Type) where
- data Async a
- waitAnyCatchSTM :: [Async a] -> STM (Async a, Either SomeException a)
- waitAnySTM :: [Async a] -> STM (Async a, a)
- waitEitherCatchSTM :: Async a -> Async b -> STM (Either (Either SomeException a) (Either SomeException b))
- waitEitherSTM :: Async a -> Async b -> STM (Either a b)
- waitEitherSTM_ :: Async a -> Async b -> STM ()
- waitBothSTM :: Async a -> Async b -> STM (a, b)
- data Handle
- waitCatchSTM :: Async a -> STM (Either SomeException a)
- pollSTM :: Async a -> STM (Maybe (Either SomeException a))
- waitSTM :: Async a -> STM a
- interact :: MonadIO m => (LText -> LText) -> m ()
- getContents :: MonadIO m => m LText
- getLine :: MonadIO m => m Text
- getChar :: MonadIO m => m Char
- putStrLn :: MonadIO m => Text -> m ()
- putStr :: MonadIO m => Text -> m ()
- putChar :: MonadIO m => Char -> m ()
- hGetChunk :: MonadIO m => Handle -> m ByteString
- hPut :: MonadIO m => Handle -> ByteString -> m ()
- hGetContents :: MonadIO m => Handle -> m ByteString
- writeFileUtf8 :: MonadIO m => FilePath -> Text -> m ()
- writeFile :: MonadIO m => FilePath -> ByteString -> m ()
- readFileUtf8 :: MonadIO m => FilePath -> m Text
- readFile :: MonadIO m => FilePath -> m ByteString
- link2Async :: MonadIO m => Async a -> Async b -> m ()
- linkAsync :: MonadIO m => Async a -> m ()
- waitCatchAsync :: MonadIO m => Async a -> m (Either SomeException a)
- pollAsync :: MonadIO m => Async a -> m (Maybe (Either SomeException a))
- waitAsync :: MonadIO m => Async a -> m a
- fromByteVector :: SVector Word8 -> ByteString
- toByteVector :: ByteString -> SVector Word8
- (<||>) :: Applicative a => a Bool -> a Bool -> a Bool
- (<&&>) :: Applicative a => a Bool -> a Bool -> a Bool
- applyDList :: DList a -> [a] -> [a]
- asDList :: DList a -> DList a
- unlessM :: Monad m => m Bool -> m () -> m ()
- whenM :: Monad m => m Bool -> m () -> m ()
- orElseSTM :: STM a -> STM a -> STM a
- ordNubBy :: Ord b => (a -> b) -> (a -> a -> Bool) -> [a] -> [a]
- ordNub :: Ord a => [a] -> [a]
- hashNub :: (Hashable a, Eq a) => [a] -> [a]
- yieldThread :: MonadIO m => m ()
- traceShowM :: (Show a, Monad m) => a -> m ()
- traceShowId :: Show a => a -> a
- traceM :: Monad m => String -> m ()
- traceId :: String -> String
- traceShow :: Show a => a -> b -> b
- trace :: String -> a -> a
- undefined :: HasCallStack => a
- sortWith :: (Ord a, IsSequence c) => (Element c -> a) -> c -> c
- print :: (Show a, MonadIO m) => a -> m ()
- asString :: [Char] -> [Char]
- asSVector :: SVector a -> SVector a
- asUVector :: UVector a -> UVector a
- asVector :: Vector a -> Vector a
- asIntSet :: IntSet -> IntSet
- asSet :: Set a -> Set a
- asMaybe :: Maybe a -> Maybe a
- asIntMap :: IntMap v -> IntMap v
- asMap :: Map k v -> Map k v
- asList :: [a] -> [a]
- asLText :: LText -> LText
- asText :: Text -> Text
- asHashSet :: HashSet a -> HashSet a
- asHashMap :: HashMap k v -> HashMap k v
- asLByteString :: LByteString -> LByteString
- asByteString :: ByteString -> ByteString
- intersect :: SetContainer a => a -> a -> a
- (\\) :: SetContainer a => a -> a -> a
- (++) :: Monoid m => m -> m -> m
- map :: Functor f => (a -> b) -> f a -> f b
- readMay :: (Element c ~ Char, MonoFoldable c, Read a) => c -> Maybe a
- charToUpper :: Char -> Char
- charToLower :: Char -> Char
- tlshow :: Show a => a -> LText
- tshow :: Show a => a -> Text
- type Reader r = ReaderT r Identity
- class Monad m => MonadReader r (m :: Type -> Type) | m -> r where
- ask :: m r
- asks :: MonadReader r m => (r -> a) -> m a
- newtype Day = ModifiedJulianDay {}
- parseTimeM :: (MonadFail m, ParseTime t) => Bool -> TimeLocale -> String -> String -> m t
- parseTime :: ParseTime t => TimeLocale -> String -> String -> Maybe t
- defaultTimeLocale :: TimeLocale
- formatTime :: FormatTime t => TimeLocale -> String -> t -> String
- getCurrentTime :: IO UTCTime
- toGregorian :: Day -> (Integer, Int, Int)
- fromGregorian :: Integer -> Int -> Int -> Day
- newtype ReaderT r (m :: Type -> Type) a = ReaderT {
- runReaderT :: r -> m a
- data WrappedMonoid m
- force :: NFData a => a -> a
- deepseq :: NFData a => a -> b -> b
- ($!!) :: NFData a => (a -> b) -> a -> b
- liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d
- liftA :: Applicative f => (a -> b) -> f a -> f b
- (<**>) :: Applicative f => f a -> f (a -> b) -> f b
- optional :: Alternative f => f a -> f (Maybe a)
- class NFData a where
- rnf :: a -> ()
- class Applicative f => Alternative (f :: Type -> Type) where
- primToPrim :: (PrimBase m1, PrimMonad m2, PrimState m1 ~ PrimState m2) => m1 a -> m2 a
- primToIO :: (PrimBase m, PrimState m ~ RealWorld) => m a -> IO a
- primToST :: PrimBase m => m a -> ST (PrimState m) a
- newtype Identity a = Identity {
- runIdentity :: a
- data DList a
- error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => [Char] -> a
- data HashSet a
- class (Vector Vector a, MVector MVector a) => Unbox a
- data Vector a
- class Storable a
- either :: (a -> c) -> (b -> c) -> Either a b -> c
- maybe :: b -> (a -> b) -> Maybe a -> b
- curry :: ((a, b) -> c) -> a -> b -> c
- uncurry :: (a -> b -> c) -> (a, b) -> c
- ($!) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
- (=<<) :: Monad m => (a -> m b) -> m a -> m b
- asTypeOf :: a -> a -> a
- flip :: (a -> b -> c) -> b -> a -> c
- until :: (a -> Bool) -> (a -> a) -> a -> a
- repeat :: a -> [a]
- subtract :: Num a => a -> a -> a
- (^) :: (Num a, Integral b) => a -> b -> a
- (^^) :: (Fractional a, Integral b) => a -> b -> a
- even :: Integral a => a -> Bool
- odd :: Integral a => a -> Bool
- (&&) :: Bool -> Bool -> Bool
- not :: Bool -> Bool
- (||) :: Bool -> Bool -> Bool
- type FilePath = String
- class (Alternative m, Monad m) => MonadPlus (m :: Type -> Type) where
- ap :: Monad m => m (a -> b) -> m a -> m b
- liftM2 :: Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r
- liftM :: Monad m => (a1 -> r) -> m a1 -> m r
- (<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c
- (>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c
- forever :: Applicative f => f a -> f b
- replicateM_ :: Applicative m => Int -> m a -> m ()
- unless :: Applicative f => Bool -> f () -> f ()
- void :: Functor f => f a -> f ()
- forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b)
- liftM3 :: Monad m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r
- liftM4 :: Monad m => (a1 -> a2 -> a3 -> a4 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m r
- liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r
- when :: Applicative f => Bool -> f () -> f ()
- class (Typeable e, Show e) => Exception e where
- toException :: e -> SomeException
- fromException :: SomeException -> Maybe e
- displayException :: e -> String
- data SomeException = Exception e => SomeException e
- data IOException
- asum :: (Foldable t, Alternative f) => t (f a) -> f a
- newtype Down a = Down a
- for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b)
- fromMaybe :: a -> Maybe a -> a
- isJust :: Maybe a -> Bool
- isNothing :: Maybe a -> Bool
- listToMaybe :: [a] -> Maybe a
- mapMaybe :: (a -> Maybe b) -> [a] -> [b]
- maybeToList :: Maybe a -> [a]
- lefts :: [Either a b] -> [a]
- partitionEithers :: [Either a b] -> ([a], [b])
- rights :: [Either a b] -> [b]
- comparing :: Ord a => (b -> a) -> b -> b -> Ordering
- on :: (b -> b -> c) -> (a -> b) -> a -> a -> c
- swap :: (a, b) -> (b, a)
- class Monad m => MonadIO (m :: Type -> Type) where
- data Set a
- data IntMap a
- data IntSet
- data Seq a
- (<.>) :: FilePath -> String -> FilePath
- (</>) :: FilePath -> FilePath -> FilePath
- bool :: a -> a -> Bool -> a
- type SVector = Vector
- type UVector = Vector
- type LByteString = ByteString
- type LText = Text
- equating :: Eq a => (b -> a) -> b -> b -> Bool
- getArgs :: MonadIO m => m [Text]
- terror :: HasCallStack => Text -> a
- ioError :: IOError -> IO a
- userError :: String -> IOError
- type IOError = IOException
- data IOErrorType
- alreadyExistsErrorType :: IOErrorType
- alreadyInUseErrorType :: IOErrorType
- annotateIOError :: IOError -> String -> Maybe Handle -> Maybe FilePath -> IOError
- doesNotExistErrorType :: IOErrorType
- eofErrorType :: IOErrorType
- fullErrorType :: IOErrorType
- illegalOperationErrorType :: IOErrorType
- ioeGetErrorString :: IOError -> String
- ioeGetErrorType :: IOError -> IOErrorType
- ioeGetFileName :: IOError -> Maybe FilePath
- ioeGetHandle :: IOError -> Maybe Handle
- ioeGetLocation :: IOError -> String
- ioeSetErrorString :: IOError -> String -> IOError
- ioeSetErrorType :: IOError -> IOErrorType -> IOError
- ioeSetFileName :: IOError -> FilePath -> IOError
- ioeSetHandle :: IOError -> Handle -> IOError
- ioeSetLocation :: IOError -> String -> IOError
- isAlreadyExistsError :: IOError -> Bool
- isAlreadyExistsErrorType :: IOErrorType -> Bool
- isAlreadyInUseError :: IOError -> Bool
- isAlreadyInUseErrorType :: IOErrorType -> Bool
- isDoesNotExistError :: IOError -> Bool
- isDoesNotExistErrorType :: IOErrorType -> Bool
- isEOFError :: IOError -> Bool
- isEOFErrorType :: IOErrorType -> Bool
- isFullError :: IOError -> Bool
- isFullErrorType :: IOErrorType -> Bool
- isIllegalOperation :: IOError -> Bool
- isIllegalOperationErrorType :: IOErrorType -> Bool
- isPermissionError :: IOError -> Bool
- isPermissionErrorType :: IOErrorType -> Bool
- isUserError :: IOError -> Bool
- isUserErrorType :: IOErrorType -> Bool
- mkIOError :: IOErrorType -> String -> Maybe Handle -> Maybe FilePath -> IOError
- modifyIOError :: (IOError -> IOError) -> IO a -> IO a
- permissionErrorType :: IOErrorType
- tryIOError :: IO a -> IO (Either IOError a)
- userErrorType :: IOErrorType
- class Monad m => MonadThrow (m :: Type -> Type)
- runResourceT :: MonadUnliftIO m => ResourceT m a -> m a
- withAcquire :: MonadUnliftIO m => Acquire a -> (a -> m b) -> m b
- allocateAcquire :: MonadResource m => Acquire a -> m (ReleaseKey, a)
- class MonadIO m => MonadResource (m :: Type -> Type) where
- liftResourceT :: ResourceT IO a -> m a
- data ResourceT (m :: Type -> Type) a
- mkAcquireType :: IO a -> (a -> ReleaseType -> IO ()) -> Acquire a
- mkAcquire :: IO a -> (a -> IO ()) -> Acquire a
- data ReleaseType
- data Acquire a
- class MonadTrans (t :: (Type -> Type) -> Type -> Type) where
- data Void
- newtype ZipConduit i o (m :: Type -> Type) r = ZipConduit {
- getZipConduit :: ConduitT i o m r
- newtype ZipSink i (m :: Type -> Type) r = ZipSink {
- getZipSink :: Sink i m r
- newtype ZipSource (m :: Type -> Type) o = ZipSource {
- getZipSource :: Source m o
- data Flush a
- type Conduit i (m :: Type -> Type) o = ConduitT i o m ()
- type Consumer i (m :: Type -> Type) r = forall o. ConduitT i o m r
- type Sink i = ConduitT i Void
- type Producer (m :: Type -> Type) o = forall i. ConduitT i o m ()
- type Source (m :: Type -> Type) o = ConduitT () o m ()
- type ConduitM = ConduitT
- data SealedConduitT i o (m :: Type -> Type) r
- data ConduitT i o (m :: Type -> Type) r
- sealConduitT :: forall i o (m :: Type -> Type) r. ConduitT i o m r -> SealedConduitT i o m r
- unsealConduitT :: forall (m :: Type -> Type) i o r. Monad m => SealedConduitT i o m r -> ConduitT i o m r
- toProducer :: forall (m :: Type -> Type) a. Monad m => Source m a -> Producer m a
- toConsumer :: forall (m :: Type -> Type) a b. Monad m => Sink a m b -> Consumer a m b
- catchC :: forall (m :: Type -> Type) e i o r. (MonadUnliftIO m, Exception e) => ConduitT i o m r -> (e -> ConduitT i o m r) -> ConduitT i o m r
- handleC :: forall (m :: Type -> Type) e i o r. (MonadUnliftIO m, Exception e) => (e -> ConduitT i o m r) -> ConduitT i o m r -> ConduitT i o m r
- tryC :: forall (m :: Type -> Type) e i o r. (MonadUnliftIO m, Exception e) => ConduitT i o m r -> ConduitT i o m (Either e r)
- fuseReturnLeftovers :: forall (m :: Type -> Type) a b c r. Monad m => ConduitT a b m () -> ConduitT b c m r -> ConduitT a c m (r, [b])
- fuseLeftovers :: forall (m :: Type -> Type) b a c r. Monad m => ([b] -> [a]) -> ConduitT a b m () -> ConduitT b c m r -> ConduitT a c m r
- mergeSource :: forall (m :: Type -> Type) i a. Monad m => Source m i -> Conduit a m (i, a)
- passthroughSink :: Monad m => Sink i m r -> (r -> m ()) -> Conduit i m i
- sourceToList :: Monad m => Source m a -> m [a]
- connect :: Monad m => ConduitT () a m () -> ConduitT a Void m r -> m r
- fuse :: forall (m :: Type -> Type) a b c r. Monad m => Conduit a m b -> ConduitM b c m r -> ConduitM a c m r
- (.|) :: forall (m :: Type -> Type) a b c r. Monad m => ConduitM a b m () -> ConduitM b c m r -> ConduitM a c m r
- ($$) :: Monad m => Source m a -> Sink a m b -> m b
- ($=) :: forall (m :: Type -> Type) a b c r. Monad m => Conduit a m b -> ConduitT b c m r -> ConduitT a c m r
- (=$) :: forall (m :: Type -> Type) a b c r. Monad m => Conduit a m b -> ConduitT b c m r -> ConduitT a c m r
- (=$=) :: forall (m :: Type -> Type) a b c r. Monad m => Conduit a m b -> ConduitT b c m r -> ConduitT a c m r
- await :: forall (m :: Type -> Type) i. Monad m => Consumer i m (Maybe i)
- yield :: forall (m :: Type -> Type) o i. Monad m => o -> ConduitT i o m ()
- yieldM :: Monad m => m o -> ConduitT i o m ()
- leftover :: forall i o (m :: Type -> Type). i -> ConduitT i o m ()
- runConduit :: Monad m => ConduitT () Void m r -> m r
- bracketP :: forall (m :: Type -> Type) a i o r. MonadResource m => IO a -> (a -> IO ()) -> (a -> ConduitT i o m r) -> ConduitT i o m r
- awaitForever :: forall (m :: Type -> Type) i o r. Monad m => (i -> ConduitT i o m r) -> ConduitT i o m ()
- transPipe :: Monad m => (forall a. m a -> n a) -> ConduitT i o m r -> ConduitT i o n r
- mapOutput :: forall (m :: Type -> Type) o1 o2 i r. Monad m => (o1 -> o2) -> ConduitT i o1 m r -> ConduitT i o2 m r
- mapOutputMaybe :: forall (m :: Type -> Type) o1 o2 i r. Monad m => (o1 -> Maybe o2) -> ConduitT i o1 m r -> ConduitT i o2 m r
- mapInput :: forall (m :: Type -> Type) i1 i2 o r. Monad m => (i1 -> i2) -> (i2 -> Maybe i1) -> ConduitT i2 o m r -> ConduitT i1 o m r
- mapInputM :: Monad m => (i1 -> m i2) -> (i2 -> m (Maybe i1)) -> ConduitT i2 o m r -> ConduitT i1 o m r
- ($$+) :: Monad m => Source m a -> Sink a m b -> m (SealedConduitT () a m (), b)
- ($$++) :: Monad m => SealedConduitT () a m () -> Sink a m b -> m (SealedConduitT () a m (), b)
- ($$+-) :: Monad m => SealedConduitT () a m () -> Sink a m b -> m b
- ($=+) :: forall (m :: Type -> Type) a b. Monad m => SealedConduitT () a m () -> Conduit a m b -> SealedConduitT () b m ()
- sequenceSources :: forall f (m :: Type -> Type) o. (Traversable f, Monad m) => f (Source m o) -> Source m (f o)
- sequenceSinks :: forall f (m :: Type -> Type) i r. (Traversable f, Monad m) => f (Sink i m r) -> Sink i m (f r)
- (=$$+) :: forall (m :: Type -> Type) a b r. Monad m => ConduitT a b m () -> ConduitT b Void m r -> ConduitT a Void m (SealedConduitT a b m (), r)
- (=$$++) :: forall (m :: Type -> Type) i o r. Monad m => SealedConduitT i o m () -> ConduitT o Void m r -> ConduitT i Void m (SealedConduitT i o m (), r)
- (=$$+-) :: forall (m :: Type -> Type) i o r. Monad m => SealedConduitT i o m () -> ConduitT o Void m r -> ConduitT i Void m r
- sequenceConduits :: forall f (m :: Type -> Type) i o r. (Traversable f, Monad m) => f (ConduitT i o m r) -> ConduitT i o m (f r)
- fuseBoth :: forall (m :: Type -> Type) a b r1 c r2. Monad m => ConduitT a b m r1 -> ConduitT b c m r2 -> ConduitT a c m (r1, r2)
- fuseBothMaybe :: forall (m :: Type -> Type) a b r1 c r2. Monad m => ConduitT a b m r1 -> ConduitT b c m r2 -> ConduitT a c m (Maybe r1, r2)
- fuseUpstream :: forall (m :: Type -> Type) a b r c. Monad m => ConduitT a b m r -> Conduit b m c -> ConduitT a c m r
- runConduitPure :: ConduitT () Void Identity r -> r
- runConduitRes :: MonadUnliftIO m => ConduitT () Void (ResourceT m) r -> m r
- exceptC :: forall (m :: Type -> Type) i o e a. Monad m => ConduitT i o m (Either e a) -> ConduitT i o (ExceptT e m) a
- runExceptC :: forall (m :: Type -> Type) i o e r. Monad m => ConduitT i o (ExceptT e m) r -> ConduitT i o m (Either e r)
- catchExceptC :: forall (m :: Type -> Type) i o e r. Monad m => ConduitT i o (ExceptT e m) r -> (e -> ConduitT i o (ExceptT e m) r) -> ConduitT i o (ExceptT e m) r
- runCatchC :: forall (m :: Type -> Type) i o r. Monad m => ConduitT i o (CatchT m) r -> ConduitT i o m (Either SomeException r)
- catchCatchC :: forall (m :: Type -> Type) i o r. Monad m => ConduitT i o (CatchT m) r -> (SomeException -> ConduitT i o (CatchT m) r) -> ConduitT i o (CatchT m) r
- maybeC :: forall (m :: Type -> Type) i o a. Monad m => ConduitT i o m (Maybe a) -> ConduitT i o (MaybeT m) a
- runMaybeC :: forall (m :: Type -> Type) i o r. Monad m => ConduitT i o (MaybeT m) r -> ConduitT i o m (Maybe r)
- readerC :: forall (m :: Type -> Type) r i o a. Monad m => (r -> ConduitT i o m a) -> ConduitT i o (ReaderT r m) a
- runReaderC :: forall (m :: Type -> Type) r i o res. Monad m => r -> ConduitT i o (ReaderT r m) res -> ConduitT i o m res
- stateLC :: forall (m :: Type -> Type) s i o a. Monad m => (s -> ConduitT i o m (a, s)) -> ConduitT i o (StateT s m) a
- runStateLC :: forall (m :: Type -> Type) s i o r. Monad m => s -> ConduitT i o (StateT s m) r -> ConduitT i o m (r, s)
- evalStateLC :: forall (m :: Type -> Type) s i o r. Monad m => s -> ConduitT i o (StateT s m) r -> ConduitT i o m r
- execStateLC :: forall (m :: Type -> Type) s i o r. Monad m => s -> ConduitT i o (StateT s m) r -> ConduitT i o m s
- stateC :: forall (m :: Type -> Type) s i o a. Monad m => (s -> ConduitT i o m (a, s)) -> ConduitT i o (StateT s m) a
- runStateC :: forall (m :: Type -> Type) s i o r. Monad m => s -> ConduitT i o (StateT s m) r -> ConduitT i o m (r, s)
- evalStateC :: forall (m :: Type -> Type) s i o r. Monad m => s -> ConduitT i o (StateT s m) r -> ConduitT i o m r
- execStateC :: forall (m :: Type -> Type) s i o r. Monad m => s -> ConduitT i o (StateT s m) r -> ConduitT i o m s
- writerLC :: forall (m :: Type -> Type) w i o b. (Monad m, Monoid w) => ConduitT i o m (b, w) -> ConduitT i o (WriterT w m) b
- runWriterLC :: forall (m :: Type -> Type) w i o r. (Monad m, Monoid w) => ConduitT i o (WriterT w m) r -> ConduitT i o m (r, w)
- execWriterLC :: forall (m :: Type -> Type) w i o r. (Monad m, Monoid w) => ConduitT i o (WriterT w m) r -> ConduitT i o m w
- writerC :: forall (m :: Type -> Type) w i o b. (Monad m, Monoid w) => ConduitT i o m (b, w) -> ConduitT i o (WriterT w m) b
- runWriterC :: forall (m :: Type -> Type) w i o r. (Monad m, Monoid w) => ConduitT i o (WriterT w m) r -> ConduitT i o m (r, w)
- execWriterC :: forall (m :: Type -> Type) w i o r. (Monad m, Monoid w) => ConduitT i o (WriterT w m) r -> ConduitT i o m w
- rwsLC :: forall (m :: Type -> Type) w r s i o a. (Monad m, Monoid w) => (r -> s -> ConduitT i o m (a, s, w)) -> ConduitT i o (RWST r w s m) a
- runRWSLC :: forall (m :: Type -> Type) w r s i o res. (Monad m, Monoid w) => r -> s -> ConduitT i o (RWST r w s m) res -> ConduitT i o m (res, s, w)
- evalRWSLC :: forall (m :: Type -> Type) w r s i o res. (Monad m, Monoid w) => r -> s -> ConduitT i o (RWST r w s m) res -> ConduitT i o m (res, w)
- execRWSLC :: forall (m :: Type -> Type) w r s i o res. (Monad m, Monoid w) => r -> s -> ConduitT i o (RWST r w s m) res -> ConduitT i o m (s, w)
- rwsC :: forall (m :: Type -> Type) w r s i o a. (Monad m, Monoid w) => (r -> s -> ConduitT i o m (a, s, w)) -> ConduitT i o (RWST r w s m) a
- runRWSC :: forall (m :: Type -> Type) w r s i o res. (Monad m, Monoid w) => r -> s -> ConduitT i o (RWST r w s m) res -> ConduitT i o m (res, s, w)
- evalRWSC :: forall (m :: Type -> Type) w r s i o res. (Monad m, Monoid w) => r -> s -> ConduitT i o (RWST r w s m) res -> ConduitT i o m (res, w)
- execRWSC :: forall (m :: Type -> Type) w r s i o res. (Monad m, Monoid w) => r -> s -> ConduitT i o (RWST r w s m) res -> ConduitT i o m (s, w)
- type BufferAllocStrategy = (IO Buffer, Int -> Buffer -> IO (IO Buffer))
- yieldMany :: forall (m :: Type -> Type) mono i. (Monad m, MonoFoldable mono) => mono -> ConduitT i (Element mono) m ()
- sourceLazy :: forall (m :: Type -> Type) lazy strict i. (Monad m, LazySequence lazy strict) => lazy -> ConduitT i strict m ()
- sourceFile :: forall (m :: Type -> Type) i. MonadResource m => FilePath -> ConduitT i ByteString m ()
- sourceHandle :: forall (m :: Type -> Type) i. MonadIO m => Handle -> ConduitT i ByteString m ()
- sourceHandleUnsafe :: forall (m :: Type -> Type) i. MonadIO m => Handle -> ConduitT i ByteString m ()
- sourceIOHandle :: forall (m :: Type -> Type) i. MonadResource m => IO Handle -> ConduitT i ByteString m ()
- sourceFileBS :: forall (m :: Type -> Type) i. MonadResource m => FilePath -> ConduitT i ByteString m ()
- sinkFile :: forall (m :: Type -> Type) o. MonadResource m => FilePath -> ConduitT ByteString o m ()
- sinkFileCautious :: forall (m :: Type -> Type) o. MonadResource m => FilePath -> ConduitM ByteString o m ()
- withSinkFileCautious :: forall m (n :: Type -> Type) o a. (MonadUnliftIO m, MonadIO n) => FilePath -> (ConduitM ByteString o n () -> m a) -> m a
- sinkTempFile :: forall (m :: Type -> Type) o. MonadResource m => FilePath -> String -> ConduitM ByteString o m FilePath
- sinkSystemTempFile :: forall (m :: Type -> Type) o. MonadResource m => String -> ConduitM ByteString o m FilePath
- sinkHandle :: forall (m :: Type -> Type) o. MonadIO m => Handle -> ConduitT ByteString o m ()
- sinkHandleBuilder :: forall (m :: Type -> Type) o. MonadIO m => Handle -> ConduitM Builder o m ()
- sinkHandleFlush :: forall (m :: Type -> Type) o. MonadIO m => Handle -> ConduitM (Flush ByteString) o m ()
- sinkIOHandle :: forall (m :: Type -> Type) o. MonadResource m => IO Handle -> ConduitT ByteString o m ()
- withSourceFile :: forall m (n :: Type -> Type) i a. (MonadUnliftIO m, MonadIO n) => FilePath -> (ConduitM i ByteString n () -> m a) -> m a
- withSinkFile :: forall m (n :: Type -> Type) o a. (MonadUnliftIO m, MonadIO n) => FilePath -> (ConduitM ByteString o n () -> m a) -> m a
- withSinkFileBuilder :: forall m (n :: Type -> Type) o a. (MonadUnliftIO m, MonadIO n) => FilePath -> (ConduitM Builder o n () -> m a) -> m a
- sourceDirectory :: forall (m :: Type -> Type) i. MonadResource m => FilePath -> ConduitT i FilePath m ()
- sourceDirectoryDeep :: forall (m :: Type -> Type) i. MonadResource m => Bool -> FilePath -> ConduitT i FilePath m ()
- sinkLazy :: forall (m :: Type -> Type) lazy strict o. (Monad m, LazySequence lazy strict) => ConduitT strict o m lazy
- sinkList :: forall (m :: Type -> Type) a o. Monad m => ConduitT a o m [a]
- sinkVector :: forall v a (m :: Type -> Type) o. (Vector v a, PrimMonad m) => ConduitT a o m (v a)
- sinkVectorN :: forall v a (m :: Type -> Type) o. (Vector v a, PrimMonad m) => Int -> ConduitT a o m (v a)
- sinkLazyBuilder :: forall (m :: Type -> Type) o. Monad m => ConduitT Builder o m ByteString
- sinkNull :: forall (m :: Type -> Type) a o. Monad m => ConduitT a o m ()
- awaitNonNull :: forall (m :: Type -> Type) a o. (Monad m, MonoFoldable a) => ConduitT a o m (Maybe (NonNull a))
- sinkFileBS :: forall (m :: Type -> Type) o. MonadResource m => FilePath -> ConduitT ByteString o m ()
- builderToByteString :: forall (m :: Type -> Type). PrimMonad m => ConduitT Builder ByteString m ()
- builderToByteStringFlush :: forall (m :: Type -> Type). PrimMonad m => ConduitT (Flush Builder) (Flush ByteString) m ()
- unsafeBuilderToByteString :: forall (m :: Type -> Type). PrimMonad m => ConduitT Builder ByteString m ()
- builderToByteStringWith :: forall (m :: Type -> Type). PrimMonad m => BufferAllocStrategy -> ConduitT Builder ByteString m ()
- builderToByteStringWithFlush :: forall (m :: Type -> Type). PrimMonad m => BufferAllocStrategy -> ConduitT (Flush Builder) (Flush ByteString) m ()
- allNewBuffersStrategy :: Int -> BufferAllocStrategy
- reuseBufferStrategy :: IO Buffer -> BufferAllocStrategy
- mapAccumS :: forall (m :: Type -> Type) a s b. Monad m => (a -> s -> ConduitT b Void m s) -> s -> ConduitT () b m () -> ConduitT a Void m s
- peekForever :: forall (m :: Type -> Type) i o. Monad m => ConduitT i o m () -> ConduitT i o m ()
- peekForeverE :: forall (m :: Type -> Type) i o. (Monad m, MonoFoldable i) => ConduitT i o m () -> ConduitT i o m ()
- unfoldC :: forall (m :: Type -> Type) b a i. Monad m => (b -> Maybe (a, b)) -> b -> ConduitT i a m ()
- enumFromToC :: forall (m :: Type -> Type) a i. (Monad m, Enum a, Ord a) => a -> a -> ConduitT i a m ()
- iterateC :: forall (m :: Type -> Type) a i. Monad m => (a -> a) -> a -> ConduitT i a m ()
- repeatC :: forall (m :: Type -> Type) a i. Monad m => a -> ConduitT i a m ()
- replicateC :: forall (m :: Type -> Type) a i. Monad m => Int -> a -> ConduitT i a m ()
- repeatMC :: Monad m => m a -> ConduitT i a m ()
- repeatWhileMC :: Monad m => m a -> (a -> Bool) -> ConduitT i a m ()
- replicateMC :: Monad m => Int -> m a -> ConduitT i a m ()
- stdinC :: forall (m :: Type -> Type) i. MonadIO m => ConduitT i ByteString m ()
- dropC :: forall (m :: Type -> Type) a o. Monad m => Int -> ConduitT a o m ()
- dropCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq) => Index seq -> ConduitT seq o m ()
- dropWhileC :: forall (m :: Type -> Type) a o. Monad m => (a -> Bool) -> ConduitT a o m ()
- dropWhileCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq) => (Element seq -> Bool) -> ConduitT seq o m ()
- foldC :: forall (m :: Type -> Type) a o. (Monad m, Monoid a) => ConduitT a o m a
- foldCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono, Monoid (Element mono)) => ConduitT mono o m (Element mono)
- foldlC :: forall (m :: Type -> Type) a b o. Monad m => (a -> b -> a) -> a -> ConduitT b o m a
- foldlCE :: forall (m :: Type -> Type) mono a o. (Monad m, MonoFoldable mono) => (a -> Element mono -> a) -> a -> ConduitT mono o m a
- foldMapC :: forall (m :: Type -> Type) b a o. (Monad m, Monoid b) => (a -> b) -> ConduitT a o m b
- foldMapCE :: forall (m :: Type -> Type) mono w o. (Monad m, MonoFoldable mono, Monoid w) => (Element mono -> w) -> ConduitT mono o m w
- allC :: forall (m :: Type -> Type) a o. Monad m => (a -> Bool) -> ConduitT a o m Bool
- allCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono) => (Element mono -> Bool) -> ConduitT mono o m Bool
- anyC :: forall (m :: Type -> Type) a o. Monad m => (a -> Bool) -> ConduitT a o m Bool
- anyCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono) => (Element mono -> Bool) -> ConduitT mono o m Bool
- andC :: forall (m :: Type -> Type) o. Monad m => ConduitT Bool o m Bool
- andCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono, Element mono ~ Bool) => ConduitT mono o m Bool
- orC :: forall (m :: Type -> Type) o. Monad m => ConduitT Bool o m Bool
- orCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono, Element mono ~ Bool) => ConduitT mono o m Bool
- asumC :: forall (m :: Type -> Type) f a o. (Monad m, Alternative f) => ConduitT (f a) o m (f a)
- elemC :: forall (m :: Type -> Type) a o. (Monad m, Eq a) => a -> ConduitT a o m Bool
- elemCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq, Eq (Element seq)) => Element seq -> ConduitT seq o m Bool
- notElemC :: forall (m :: Type -> Type) a o. (Monad m, Eq a) => a -> ConduitT a o m Bool
- notElemCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq, Eq (Element seq)) => Element seq -> ConduitT seq o m Bool
- headC :: forall (m :: Type -> Type) a o. Monad m => ConduitT a o m (Maybe a)
- headDefC :: forall (m :: Type -> Type) a o. Monad m => a -> ConduitT a o m a
- headCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq) => ConduitT seq o m (Maybe (Element seq))
- peekC :: forall (m :: Type -> Type) a o. Monad m => ConduitT a o m (Maybe a)
- peekCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono) => ConduitT mono o m (Maybe (Element mono))
- lastC :: forall (m :: Type -> Type) a o. Monad m => ConduitT a o m (Maybe a)
- lastDefC :: forall (m :: Type -> Type) a o. Monad m => a -> ConduitT a o m a
- lastCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq) => ConduitT seq o m (Maybe (Element seq))
- lengthC :: forall (m :: Type -> Type) len a o. (Monad m, Num len) => ConduitT a o m len
- lengthCE :: forall (m :: Type -> Type) len mono o. (Monad m, Num len, MonoFoldable mono) => ConduitT mono o m len
- lengthIfC :: forall (m :: Type -> Type) len a o. (Monad m, Num len) => (a -> Bool) -> ConduitT a o m len
- lengthIfCE :: forall (m :: Type -> Type) len mono o. (Monad m, Num len, MonoFoldable mono) => (Element mono -> Bool) -> ConduitT mono o m len
- maximumC :: forall (m :: Type -> Type) a o. (Monad m, Ord a) => ConduitT a o m (Maybe a)
- maximumCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq, Ord (Element seq)) => ConduitT seq o m (Maybe (Element seq))
- minimumC :: forall (m :: Type -> Type) a o. (Monad m, Ord a) => ConduitT a o m (Maybe a)
- minimumCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq, Ord (Element seq)) => ConduitT seq o m (Maybe (Element seq))
- nullC :: forall (m :: Type -> Type) a o. Monad m => ConduitT a o m Bool
- nullCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono) => ConduitT mono o m Bool
- sumC :: forall (m :: Type -> Type) a o. (Monad m, Num a) => ConduitT a o m a
- sumCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono, Num (Element mono)) => ConduitT mono o m (Element mono)
- productC :: forall (m :: Type -> Type) a o. (Monad m, Num a) => ConduitT a o m a
- productCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono, Num (Element mono)) => ConduitT mono o m (Element mono)
- findC :: forall (m :: Type -> Type) a o. Monad m => (a -> Bool) -> ConduitT a o m (Maybe a)
- mapM_C :: Monad m => (a -> m ()) -> ConduitT a o m ()
- mapM_CE :: (Monad m, MonoFoldable mono) => (Element mono -> m ()) -> ConduitT mono o m ()
- foldMC :: Monad m => (a -> b -> m a) -> a -> ConduitT b o m a
- foldMCE :: (Monad m, MonoFoldable mono) => (a -> Element mono -> m a) -> a -> ConduitT mono o m a
- foldMapMC :: (Monad m, Monoid w) => (a -> m w) -> ConduitT a o m w
- foldMapMCE :: (Monad m, MonoFoldable mono, Monoid w) => (Element mono -> m w) -> ConduitT mono o m w
- printC :: forall a (m :: Type -> Type) o. (Show a, MonadIO m) => ConduitT a o m ()
- stdoutC :: forall (m :: Type -> Type) o. MonadIO m => ConduitT ByteString o m ()
- stderrC :: forall (m :: Type -> Type) o. MonadIO m => ConduitT ByteString o m ()
- mapC :: forall (m :: Type -> Type) a b. Monad m => (a -> b) -> ConduitT a b m ()
- mapCE :: forall (m :: Type -> Type) f a b. (Monad m, Functor f) => (a -> b) -> ConduitT (f a) (f b) m ()
- omapCE :: forall (m :: Type -> Type) mono. (Monad m, MonoFunctor mono) => (Element mono -> Element mono) -> ConduitT mono mono m ()
- concatMapC :: forall (m :: Type -> Type) mono a. (Monad m, MonoFoldable mono) => (a -> mono) -> ConduitT a (Element mono) m ()
- concatMapCE :: forall (m :: Type -> Type) mono w. (Monad m, MonoFoldable mono, Monoid w) => (Element mono -> w) -> ConduitT mono w m ()
- takeC :: forall (m :: Type -> Type) a. Monad m => Int -> ConduitT a a m ()
- takeCE :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq) => Index seq -> ConduitT seq seq m ()
- takeWhileC :: forall (m :: Type -> Type) a. Monad m => (a -> Bool) -> ConduitT a a m ()
- takeWhileCE :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq) => (Element seq -> Bool) -> ConduitT seq seq m ()
- takeExactlyC :: forall (m :: Type -> Type) a b r. Monad m => Int -> ConduitT a b m r -> ConduitT a b m r
- takeExactlyCE :: forall (m :: Type -> Type) a b r. (Monad m, IsSequence a) => Index a -> ConduitT a b m r -> ConduitT a b m r
- concatC :: forall (m :: Type -> Type) mono. (Monad m, MonoFoldable mono) => ConduitT mono (Element mono) m ()
- filterC :: forall (m :: Type -> Type) a. Monad m => (a -> Bool) -> ConduitT a a m ()
- filterCE :: forall seq (m :: Type -> Type). (IsSequence seq, Monad m) => (Element seq -> Bool) -> ConduitT seq seq m ()
- mapWhileC :: forall (m :: Type -> Type) a b. Monad m => (a -> Maybe b) -> ConduitT a b m ()
- conduitVector :: forall v a (m :: Type -> Type). (Vector v a, PrimMonad m) => Int -> ConduitT a (v a) m ()
- scanlC :: forall (m :: Type -> Type) a b. Monad m => (a -> b -> a) -> a -> ConduitT b a m ()
- mapAccumWhileC :: forall (m :: Type -> Type) a s b. Monad m => (a -> s -> Either s (s, b)) -> s -> ConduitT a b m s
- concatMapAccumC :: forall (m :: Type -> Type) a accum b. Monad m => (a -> accum -> (accum, [b])) -> accum -> ConduitT a b m ()
- intersperseC :: forall (m :: Type -> Type) a. Monad m => a -> ConduitT a a m ()
- slidingWindowC :: forall (m :: Type -> Type) seq a. (Monad m, IsSequence seq, Element seq ~ a) => Int -> ConduitT a seq m ()
- chunksOfCE :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq) => Index seq -> ConduitT seq seq m ()
- chunksOfExactlyCE :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq) => Index seq -> ConduitT seq seq m ()
- mapMC :: Monad m => (a -> m b) -> ConduitT a b m ()
- mapMCE :: (Monad m, Traversable f) => (a -> m b) -> ConduitT (f a) (f b) m ()
- omapMCE :: (Monad m, MonoTraversable mono) => (Element mono -> m (Element mono)) -> ConduitT mono mono m ()
- concatMapMC :: (Monad m, MonoFoldable mono) => (a -> m mono) -> ConduitT a (Element mono) m ()
- filterMC :: Monad m => (a -> m Bool) -> ConduitT a a m ()
- filterMCE :: (Monad m, IsSequence seq) => (Element seq -> m Bool) -> ConduitT seq seq m ()
- iterMC :: Monad m => (a -> m ()) -> ConduitT a a m ()
- scanlMC :: Monad m => (a -> b -> m a) -> a -> ConduitT b a m ()
- mapAccumWhileMC :: Monad m => (a -> s -> m (Either s (s, b))) -> s -> ConduitT a b m s
- concatMapAccumMC :: Monad m => (a -> accum -> m (accum, [b])) -> accum -> ConduitT a b m ()
- encodeUtf8C :: forall (m :: Type -> Type) text binary. (Monad m, Utf8 text binary) => ConduitT text binary m ()
- decodeUtf8C :: forall (m :: Type -> Type). MonadThrow m => ConduitT ByteString Text m ()
- decodeUtf8LenientC :: forall (m :: Type -> Type). Monad m => ConduitT ByteString Text m ()
- lineC :: forall (m :: Type -> Type) seq o r. (Monad m, IsSequence seq, Element seq ~ Char) => ConduitT seq o m r -> ConduitT seq o m r
- lineAsciiC :: forall (m :: Type -> Type) seq o r. (Monad m, IsSequence seq, Element seq ~ Word8) => ConduitT seq o m r -> ConduitT seq o m r
- unlinesC :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq, Element seq ~ Char) => ConduitT seq seq m ()
- unlinesAsciiC :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq, Element seq ~ Word8) => ConduitT seq seq m ()
- linesUnboundedC :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq, Element seq ~ Char) => ConduitT seq seq m ()
- linesUnboundedAsciiC :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq, Element seq ~ Word8) => ConduitT seq seq m ()
- vectorBuilderC :: forall (m :: Type -> Type) v e n i r. (PrimMonad m, Vector v e, PrimMonad n, PrimState m ~ PrimState n) => Int -> ((e -> n ()) -> ConduitT i Void m r) -> ConduitT i (v e) m r
- class Default a where
- def :: a
- httpSource :: forall (m :: Type -> Type) (n :: Type -> Type) env r. (MonadResource m, MonadIO n, MonadReader env m, HasHttpManager env) => Request -> (Response (ConduitM () ByteString n ()) -> ConduitM () r m ()) -> ConduitM () r m ()
- httpNoBody :: (MonadIO m, HasHttpManager env, MonadReader env m) => Request -> m (Response ())
- httpLbs :: (MonadIO m, HasHttpManager env, MonadReader env m) => Request -> m (Response ByteString)
- requestBodySourceChunked :: ConduitM () ByteString IO () -> RequestBody
- requestBodySource :: Int64 -> ConduitM () ByteString IO () -> RequestBody
- bodyReaderSource :: forall (m :: Type -> Type) i. MonadIO m => BodyReader -> ConduitM i ByteString m ()
- responseClose :: MonadIO m => Response body -> m ()
- responseOpen :: forall m (n :: Type -> Type) env i. (MonadIO m, MonadIO n, MonadReader env m, HasHttpManager env) => Request -> m (Response (ConduitM i ByteString n ()))
- newManagerSettings :: MonadIO m => ManagerSettings -> m Manager
- newManager :: MonadIO m => m Manager
- defaultManagerSettings :: ManagerSettings
- acquireResponse :: forall (n :: Type -> Type) env m i. (MonadIO n, MonadReader env m, HasHttpManager env) => Request -> m (Acquire (Response (ConduitM i ByteString n ())))
- withResponse :: forall m (n :: Type -> Type) env i a. (MonadUnliftIO m, MonadIO n, MonadReader env m, HasHttpManager env) => Request -> (Response (ConduitM i ByteString n ()) -> m a) -> m a
- type ResponseHeaders = [Header]
- type RequestHeaders = [Header]
- type Header = (HeaderName, ByteString)
- type Query = [QueryItem]
- type QueryItem = (ByteString, Maybe ByteString)
- data StreamFileStatus = StreamFileStatus {}
- class HasHttpManager a where
- getHttpManager :: a -> Manager
- data Manager
- data ProxyOverride
- data ManagerSettings
- data Response body
- data ResponseTimeout
- data Request
- type GivesPopper a = NeedsPopper a -> IO a
- type NeedsPopper a = Popper -> IO a
- type Popper = IO ByteString
- data RequestBody
- = RequestBodyLBS ByteString
- | RequestBodyBS ByteString
- | RequestBodyBuilder Int64 Builder
- | RequestBodyStream Int64 (GivesPopper ())
- | RequestBodyStreamChunked (GivesPopper ())
- | RequestBodyIO (IO RequestBody)
- data Proxy = Proxy {
- proxyHost :: ByteString
- proxyPort :: Int
- data CookieJar
- data Cookie = Cookie {}
- data HttpExceptionContent
- = StatusCodeException (Response ()) ByteString
- | TooManyRedirects [Response ByteString]
- | OverlongHeaders
- | ResponseTimeout
- | ConnectionTimeout
- | ConnectionFailure SomeException
- | InvalidStatusLine ByteString
- | InvalidHeader ByteString
- | InvalidRequestHeader ByteString
- | InternalException SomeException
- | ProxyConnectException ByteString Int Status
- | NoResponseDataReceived
- | TlsNotSupported
- | WrongRequestBodyStreamSize Word64 Word64
- | ResponseBodyTooShort Word64 Word64
- | InvalidChunkHeaders
- | IncompleteHeaders
- | InvalidDestinationHost ByteString
- | HttpZlibException ZlibException
- | InvalidProxyEnvironmentVariable Text Text
- | ConnectionClosed
- | InvalidProxySettings Text
- data HttpException
- makeConnection :: IO ByteString -> (ByteString -> IO ()) -> IO () -> IO Connection
- socketConnection :: Socket -> Int -> IO Connection
- brReadSome :: BodyReader -> Int -> IO ByteString
- parseUrl :: MonadThrow m => String -> m Request
- parseUrlThrow :: MonadThrow m => String -> m Request
- throwErrorStatusCodes :: MonadIO m => Request -> Response BodyReader -> m ()
- parseRequest :: MonadThrow m => String -> m Request
- parseRequest_ :: String -> Request
- requestFromURI :: MonadThrow m => URI -> m Request
- requestFromURI_ :: URI -> Request
- getUri :: Request -> URI
- defaultRequest :: Request
- applyBasicAuth :: ByteString -> ByteString -> Request -> Request
- applyBasicProxyAuth :: ByteString -> ByteString -> Request -> Request
- urlEncodedBody :: [(ByteString, ByteString)] -> Request -> Request
- setRequestIgnoreStatus :: Request -> Request
- setRequestCheckStatus :: Request -> Request
- setQueryString :: [(ByteString, Maybe ByteString)] -> Request -> Request
- setQueryStringPartialEscape :: [(ByteString, [EscapeItem])] -> Request -> Request
- streamFile :: FilePath -> IO RequestBody
- observedStreamFile :: (StreamFileStatus -> IO ()) -> FilePath -> IO RequestBody
- rawConnectionModifySocket :: (Socket -> IO ()) -> IO (Maybe HostAddress -> String -> Int -> IO Connection)
- rawConnectionModifySocketSize :: (Socket -> IO ()) -> IO (Int -> Maybe HostAddress -> String -> Int -> IO Connection)
- withManager :: ManagerSettings -> (Manager -> IO a) -> IO a
- proxyFromRequest :: ProxyOverride
- noProxy :: ProxyOverride
- useProxy :: Proxy -> ProxyOverride
- proxyEnvironment :: Maybe Proxy -> ProxyOverride
- proxyEnvironmentNamed :: Text -> Maybe Proxy -> ProxyOverride
- defaultProxy :: ProxyOverride
- isIpAddress :: ByteString -> Bool
- domainMatches :: ByteString -> ByteString -> Bool
- defaultPath :: Request -> ByteString
- pathMatches :: ByteString -> ByteString -> Bool
- createCookieJar :: [Cookie] -> CookieJar
- destroyCookieJar :: CookieJar -> [Cookie]
- removeExistingCookieFromCookieJar :: Cookie -> CookieJar -> (Maybe Cookie, CookieJar)
- evictExpiredCookies :: CookieJar -> UTCTime -> CookieJar
- insertCookiesIntoRequest :: Request -> CookieJar -> UTCTime -> (Request, CookieJar)
- computeCookieString :: Request -> CookieJar -> UTCTime -> Bool -> (ByteString, CookieJar)
- updateCookieJar :: Response a -> Request -> UTCTime -> CookieJar -> (CookieJar, Response a)
- receiveSetCookie :: SetCookie -> Request -> UTCTime -> Bool -> CookieJar -> CookieJar
- insertCheckedCookie :: Cookie -> CookieJar -> Bool -> CookieJar
- generateCookie :: SetCookie -> Request -> UTCTime -> Bool -> Maybe Cookie
- withConnection :: Request -> Manager -> (Connection -> IO a) -> IO a
- data HistoriedResponse body
- responseOpenHistory :: Request -> Manager -> IO (HistoriedResponse BodyReader)
- withResponseHistory :: Request -> Manager -> (HistoriedResponse BodyReader -> IO a) -> IO a
- managerSetInsecureProxy :: ProxyOverride -> ManagerSettings -> ManagerSettings
- managerSetSecureProxy :: ProxyOverride -> ManagerSettings -> ManagerSettings
- managerSetProxy :: ProxyOverride -> ManagerSettings -> ManagerSettings
- responseTimeoutMicro :: Int -> ResponseTimeout
- responseTimeoutNone :: ResponseTimeout
- responseTimeoutDefault :: ResponseTimeout
- http20 :: HttpVersion
- http11 :: HttpVersion
- http10 :: HttpVersion
- http09 :: HttpVersion
- data HttpVersion = HttpVersion {}
- class QueryLike a where
- renderQueryBuilderPartialEscape :: Bool -> PartialEscapeQuery -> Builder
- renderQueryPartialEscape :: Bool -> PartialEscapeQuery -> ByteString
- decodePath :: ByteString -> ([Text], Query)
- encodePath :: [Text] -> Query -> Builder
- extractPath :: ByteString -> ByteString
- decodePathSegments :: ByteString -> [Text]
- encodePathSegmentsRelative :: [Text] -> Builder
- encodePathSegments :: [Text] -> Builder
- urlDecode :: Bool -> ByteString -> ByteString
- urlEncode :: Bool -> ByteString -> ByteString
- urlEncodeBuilder :: Bool -> ByteString -> Builder
- parseSimpleQuery :: ByteString -> SimpleQuery
- parseQuery :: ByteString -> Query
- renderSimpleQuery :: Bool -> SimpleQuery -> ByteString
- renderQuery :: Bool -> Query -> ByteString
- renderQueryBuilder :: Bool -> Query -> Builder
- simpleQueryToQuery :: SimpleQuery -> Query
- parseQueryText :: ByteString -> QueryText
- queryToQueryText :: Query -> QueryText
- renderQueryText :: Bool -> QueryText -> Builder
- queryTextToQuery :: QueryText -> Query
- type QueryText = [(Text, Maybe Text)]
- type SimpleQueryItem = (ByteString, ByteString)
- type SimpleQuery = [SimpleQueryItem]
- data EscapeItem
- = QE ByteString
- | QN ByteString
- type PartialEscapeQueryItem = (ByteString, [EscapeItem])
- type PartialEscapeQuery = [PartialEscapeQueryItem]
- statusIsServerError :: Status -> Bool
- statusIsClientError :: Status -> Bool
- statusIsRedirection :: Status -> Bool
- statusIsSuccessful :: Status -> Bool
- statusIsInformational :: Status -> Bool
- networkAuthenticationRequired511 :: Status
- status511 :: Status
- httpVersionNotSupported505 :: Status
- status505 :: Status
- gatewayTimeout504 :: Status
- status504 :: Status
- serviceUnavailable503 :: Status
- status503 :: Status
- badGateway502 :: Status
- status502 :: Status
- notImplemented501 :: Status
- status501 :: Status
- internalServerError500 :: Status
- status500 :: Status
- requestHeaderFieldsTooLarge431 :: Status
- status431 :: Status
- tooManyRequests429 :: Status
- status429 :: Status
- preconditionRequired428 :: Status
- status428 :: Status
- unprocessableEntity422 :: Status
- status422 :: Status
- imATeapot418 :: Status
- status418 :: Status
- expectationFailed417 :: Status
- status417 :: Status
- requestedRangeNotSatisfiable416 :: Status
- status416 :: Status
- unsupportedMediaType415 :: Status
- status415 :: Status
- requestURITooLong414 :: Status
- status414 :: Status
- requestEntityTooLarge413 :: Status
- status413 :: Status
- preconditionFailed412 :: Status
- status412 :: Status
- lengthRequired411 :: Status
- status411 :: Status
- gone410 :: Status
- status410 :: Status
- conflict409 :: Status
- status409 :: Status
- requestTimeout408 :: Status
- status408 :: Status
- proxyAuthenticationRequired407 :: Status
- status407 :: Status
- notAcceptable406 :: Status
- status406 :: Status
- methodNotAllowed405 :: Status
- status405 :: Status
- notFound404 :: Status
- status404 :: Status
- forbidden403 :: Status
- status403 :: Status
- paymentRequired402 :: Status
- status402 :: Status
- unauthorized401 :: Status
- status401 :: Status
- badRequest400 :: Status
- status400 :: Status
- permanentRedirect308 :: Status
- status308 :: Status
- temporaryRedirect307 :: Status
- status307 :: Status
- useProxy305 :: Status
- status305 :: Status
- notModified304 :: Status
- status304 :: Status
- seeOther303 :: Status
- status303 :: Status
- found302 :: Status
- status302 :: Status
- movedPermanently301 :: Status
- status301 :: Status
- multipleChoices300 :: Status
- status300 :: Status
- partialContent206 :: Status
- status206 :: Status
- resetContent205 :: Status
- status205 :: Status
- noContent204 :: Status
- status204 :: Status
- nonAuthoritative203 :: Status
- status203 :: Status
- accepted202 :: Status
- status202 :: Status
- created201 :: Status
- status201 :: Status
- ok200 :: Status
- status200 :: Status
- switchingProtocols101 :: Status
- status101 :: Status
- continue100 :: Status
- status100 :: Status
- mkStatus :: Int -> ByteString -> Status
- data Status = Status {}
- renderStdMethod :: StdMethod -> Method
- renderMethod :: Either ByteString StdMethod -> Method
- parseMethod :: Method -> Either ByteString StdMethod
- methodPatch :: Method
- methodOptions :: Method
- methodConnect :: Method
- methodTrace :: Method
- methodDelete :: Method
- methodPut :: Method
- methodHead :: Method
- methodPost :: Method
- methodGet :: Method
- type Method = ByteString
- data StdMethod
- parseByteRanges :: ByteString -> Maybe ByteRanges
- renderByteRanges :: ByteRanges -> ByteString
- renderByteRangesBuilder :: ByteRanges -> Builder
- renderByteRange :: ByteRange -> ByteString
- renderByteRangeBuilder :: ByteRange -> Builder
- hCookie :: HeaderName
- hUserAgent :: HeaderName
- hServer :: HeaderName
- hReferer :: HeaderName
- hRange :: HeaderName
- hLocation :: HeaderName
- hLastModified :: HeaderName
- hIfRange :: HeaderName
- hIfModifiedSince :: HeaderName
- hDate :: HeaderName
- hContentType :: HeaderName
- hContentMD5 :: HeaderName
- hContentLength :: HeaderName
- hContentEncoding :: HeaderName
- hConnection :: HeaderName
- hCacheControl :: HeaderName
- hAuthorization :: HeaderName
- hAcceptLanguage :: HeaderName
- hAccept :: HeaderName
- type HeaderName = CI ByteString
- data ByteRange
- type ByteRanges = [ByteRange]
- runMigration :: forall (m :: Type -> Type). MonadIO m => Migration -> ReaderT SqlBackend m ()
- limitOffsetOrder :: PersistEntity val => [SelectOpt val] -> (Int, Int, [SelectOpt val])
- toJsonText :: ToJSON j => j -> Text
- mapToJSON :: [(Text, PersistValue)] -> Text
- listToJSON :: [PersistValue] -> Text
- (||.) :: [Filter v] -> [Filter v] -> [Filter v]
- (/<-.) :: forall v typ. PersistField typ => EntityField v typ -> [typ] -> Filter v
- (<-.) :: forall v typ. PersistField typ => EntityField v typ -> [typ] -> Filter v
- (>=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Filter v
- (>.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Filter v
- (<=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Filter v
- (<.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Filter v
- (!=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Filter v
- (==.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Filter v
- (/=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Update v
- (*=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Update v
- (-=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Update v
- (+=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Update v
- (=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Update v
- type SqlPersistT = ReaderT SqlBackend
- data SqlBackend
- type PersistUnique a = PersistUniqueWrite a
- type PersistQuery a = PersistQueryWrite a
- type PersistStore a = PersistStoreWrite a
- deleteCascadeWhere :: forall (m :: Type -> Type) record backend. (MonadIO m, DeleteCascade record backend, PersistQueryWrite backend) => [Filter record] -> ReaderT backend m ()
- class (PersistStoreWrite backend, PersistEntity record, BaseBackend backend ~ PersistEntityBackend record) => DeleteCascade record backend where
- deleteCascade :: forall (m :: Type -> Type). MonadIO m => Key record -> ReaderT backend m ()
- selectKeysList :: forall (m :: Type -> Type) backend record. (MonadIO m, PersistQueryRead backend, PersistRecordBackend record backend) => [Filter record] -> [SelectOpt record] -> ReaderT backend m [Key record]
- selectList :: forall (m :: Type -> Type) backend record. (MonadIO m, PersistQueryRead backend, PersistRecordBackend record backend) => [Filter record] -> [SelectOpt record] -> ReaderT backend m [Entity record]
- selectKeys :: forall backend (m :: Type -> Type) record. (PersistQueryRead backend, MonadResource m, PersistRecordBackend record backend, MonadReader backend m) => [Filter record] -> [SelectOpt record] -> ConduitM () (Key record) m ()
- selectSource :: forall backend (m :: Type -> Type) record. (PersistQueryRead backend, MonadResource m, PersistRecordBackend record backend, MonadReader backend m) => [Filter record] -> [SelectOpt record] -> ConduitM () (Entity record) m ()
- class (PersistCore backend, PersistStoreRead backend) => PersistQueryRead backend where
- selectSourceRes :: forall record (m1 :: Type -> Type) (m2 :: Type -> Type). (PersistRecordBackend record backend, MonadIO m1, MonadIO m2) => [Filter record] -> [SelectOpt record] -> ReaderT backend m1 (Acquire (ConduitM () (Entity record) m2 ()))
- selectFirst :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [Filter record] -> [SelectOpt record] -> ReaderT backend m (Maybe (Entity record))
- selectKeysRes :: forall (m1 :: Type -> Type) (m2 :: Type -> Type) record. (MonadIO m1, MonadIO m2, PersistRecordBackend record backend) => [Filter record] -> [SelectOpt record] -> ReaderT backend m1 (Acquire (ConduitM () (Key record) m2 ()))
- count :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [Filter record] -> ReaderT backend m Int
- class (PersistQueryRead backend, PersistStoreWrite backend) => PersistQueryWrite backend where
- updateWhere :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [Filter record] -> [Update record] -> ReaderT backend m ()
- deleteWhere :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [Filter record] -> ReaderT backend m ()
- checkUnique :: forall (m :: Type -> Type) record backend. (MonadIO m, PersistRecordBackend record backend, PersistUniqueRead backend) => record -> ReaderT backend m (Maybe (Unique record))
- replaceUnique :: forall (m :: Type -> Type) record backend. (MonadIO m, Eq (Unique record), PersistRecordBackend record backend, PersistUniqueWrite backend) => Key record -> record -> ReaderT backend m (Maybe (Unique record))
- getByValue :: forall record (m :: Type -> Type) backend. (MonadIO m, PersistUniqueRead backend, PersistRecordBackend record backend, AtLeastOneUniqueKey record) => record -> ReaderT backend m (Maybe (Entity record))
- onlyUnique :: forall (m :: Type -> Type) backend record. (MonadIO m, PersistUniqueWrite backend, PersistRecordBackend record backend, OnlyOneUniqueKey record) => record -> ReaderT backend m (Unique record)
- insertUniqueEntity :: forall (m :: Type -> Type) record backend. (MonadIO m, PersistRecordBackend record backend, PersistUniqueWrite backend) => record -> ReaderT backend m (Maybe (Entity record))
- insertBy :: forall (m :: Type -> Type) backend record. (MonadIO m, PersistUniqueWrite backend, PersistRecordBackend record backend, AtLeastOneUniqueKey record) => record -> ReaderT backend m (Either (Entity record) (Key record))
- class (PersistCore backend, PersistStoreRead backend) => PersistUniqueRead backend where
- class (PersistUniqueRead backend, PersistStoreWrite backend) => PersistUniqueWrite backend where
- deleteBy :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Unique record -> ReaderT backend m ()
- insertUnique :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => record -> ReaderT backend m (Maybe (Key record))
- upsert :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend, OnlyOneUniqueKey record) => record -> [Update record] -> ReaderT backend m (Entity record)
- upsertBy :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Unique record -> record -> [Update record] -> ReaderT backend m (Entity record)
- putMany :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [record] -> ReaderT backend m ()
- class PersistEntity record => OnlyOneUniqueKey record where
- onlyUniqueP :: record -> Unique record
- type NoUniqueKeysError ty = (('Text "The entity " :<>: 'ShowType ty) :<>: 'Text " does not have any unique keys.") :$$: ('Text "The function you are trying to call requires a unique key " :<>: 'Text "to be defined on the entity.")
- type MultipleUniqueKeysError ty = ((('Text "The entity " :<>: 'ShowType ty) :<>: 'Text " has multiple unique keys.") :$$: ('Text "The function you are trying to call requires only a single " :<>: 'Text "unique key.")) :$$: (('Text "There is probably a variant of the function with 'By' " :<>: 'Text "appended that will allow you to select a unique key ") :<>: 'Text "for the operation.")
- class PersistEntity record => AtLeastOneUniqueKey record where
- requireUniquesP :: record -> NonEmpty (Unique record)
- insertRecord :: forall record backend (m :: Type -> Type). (PersistEntityBackend record ~ BaseBackend backend, PersistEntity record, MonadIO m, PersistStoreWrite backend) => record -> ReaderT backend m record
- getEntity :: forall backend e (m :: Type -> Type). (PersistStoreRead backend, PersistRecordBackend e backend, MonadIO m) => Key e -> ReaderT backend m (Maybe (Entity e))
- insertEntity :: forall backend e (m :: Type -> Type). (PersistStoreWrite backend, PersistRecordBackend e backend, MonadIO m) => e -> ReaderT backend m (Entity e)
- belongsToJust :: forall backend ent1 ent2 (m :: Type -> Type). (PersistStoreRead backend, PersistEntity ent1, PersistRecordBackend ent2 backend, MonadIO m) => (ent1 -> Key ent2) -> ent1 -> ReaderT backend m ent2
- belongsTo :: forall backend ent1 ent2 (m :: Type -> Type). (PersistStoreRead backend, PersistEntity ent1, PersistRecordBackend ent2 backend, MonadIO m) => (ent1 -> Maybe (Key ent2)) -> ent1 -> ReaderT backend m (Maybe ent2)
- getJustEntity :: forall record backend (m :: Type -> Type). (PersistEntityBackend record ~ BaseBackend backend, MonadIO m, PersistEntity record, PersistStoreRead backend) => Key record -> ReaderT backend m (Entity record)
- getJust :: forall backend record (m :: Type -> Type). (PersistStoreRead backend, PersistRecordBackend record backend, MonadIO m) => Key record -> ReaderT backend m record
- liftPersist :: (MonadIO m, MonadReader backend m) => ReaderT backend IO b -> m b
- type family BaseBackend backend
- class HasPersistBackend backend where
- type BaseBackend backend
- persistBackend :: backend -> BaseBackend backend
- class HasPersistBackend backend => IsPersistBackend backend
- class BackendCompatible sup sub where
- projectBackend :: sub -> sup
- type PersistRecordBackend record backend = (PersistEntity record, PersistEntityBackend record ~ BaseBackend backend)
- class (PersistEntity record, PersistEntityBackend record ~ backend, PersistCore backend) => ToBackendKey backend record where
- toBackendKey :: Key record -> BackendKey backend
- fromBackendKey :: BackendKey backend -> Key record
- data family BackendKey backend
- class PersistCore backend where
- data BackendKey backend
- class (Show (BackendKey backend), Read (BackendKey backend), Eq (BackendKey backend), Ord (BackendKey backend), PersistCore backend, PersistField (BackendKey backend), ToJSON (BackendKey backend), FromJSON (BackendKey backend)) => PersistStoreRead backend where
- class (Show (BackendKey backend), Read (BackendKey backend), Eq (BackendKey backend), Ord (BackendKey backend), PersistStoreRead backend, PersistField (BackendKey backend), ToJSON (BackendKey backend), FromJSON (BackendKey backend)) => PersistStoreWrite backend where
- insert :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => record -> ReaderT backend m (Key record)
- insert_ :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => record -> ReaderT backend m ()
- insertMany :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [record] -> ReaderT backend m [Key record]
- insertMany_ :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [record] -> ReaderT backend m ()
- insertEntityMany :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [Entity record] -> ReaderT backend m ()
- insertKey :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Key record -> record -> ReaderT backend m ()
- repsert :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Key record -> record -> ReaderT backend m ()
- repsertMany :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [(Key record, record)] -> ReaderT backend m ()
- replace :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Key record -> record -> ReaderT backend m ()
- delete :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Key record -> ReaderT backend m ()
- update :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Key record -> [Update record] -> ReaderT backend m ()
- updateGet :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Key record -> [Update record] -> ReaderT backend m record
- fromPersistValueJSON :: FromJSON a => PersistValue -> Either Text a
- toPersistValueJSON :: ToJSON a => a -> PersistValue
- entityIdFromJSON :: (PersistEntity record, FromJSON record) => Value -> Parser (Entity record)
- entityIdToJSON :: (PersistEntity record, ToJSON record) => Entity record -> Value
- keyValueEntityFromJSON :: (PersistEntity record, FromJSON record) => Value -> Parser (Entity record)
- keyValueEntityToJSON :: (PersistEntity record, ToJSON record) => Entity record -> Value
- entityValues :: PersistEntity record => Entity record -> [PersistValue]
- data family Unique record
- data family EntityField record :: Type -> Type
- data family Key record
- type family PersistEntityBackend record
- class (PersistField (Key record), ToJSON (Key record), FromJSON (Key record), Show (Key record), Read (Key record), Eq (Key record), Ord (Key record)) => PersistEntity record where
- type PersistEntityBackend record
- data Key record
- data EntityField record :: Type -> Type
- data Unique record
- keyToValues :: Key record -> [PersistValue]
- keyFromValues :: [PersistValue] -> Either Text (Key record)
- persistIdField :: EntityField record (Key record)
- entityDef :: Monad m => m record -> EntityDef
- persistFieldDef :: EntityField record typ -> FieldDef
- toPersistFields :: record -> [SomePersistField]
- fromPersistValues :: [PersistValue] -> Either Text record
- persistUniqueKeys :: record -> [Unique record]
- persistUniqueToFieldNames :: Unique record -> [(HaskellName, DBName)]
- persistUniqueToValues :: Unique record -> [PersistValue]
- fieldLens :: EntityField record field -> forall (f :: Type -> Type). Functor f => (field -> f field) -> Entity record -> f (Entity record)
- type family BackendSpecificUpdate backend record
- data Update record
- = PersistField typ => Update {
- updateField :: EntityField record typ
- updateValue :: typ
- updateUpdate :: PersistUpdate
- | BackendUpdate (BackendSpecificUpdate (PersistEntityBackend record) record)
- = PersistField typ => Update {
- data SelectOpt record
- = Asc (EntityField record typ)
- | Desc (EntityField record typ)
- | OffsetBy Int
- | LimitTo Int
- type family BackendSpecificFilter backend record
- data Filter record
- = PersistField typ => Filter {
- filterField :: EntityField record typ
- filterValue :: FilterValue typ
- filterFilter :: PersistFilter
- | FilterAnd [Filter record]
- | FilterOr [Filter record]
- | BackendFilter (BackendSpecificFilter (PersistEntityBackend record) record)
- = PersistField typ => Filter {
- data FilterValue typ where
- FilterValue :: forall typ. typ -> FilterValue typ
- FilterValues :: forall typ. [typ] -> FilterValue typ
- UnsafeValue :: forall a typ. PersistField a => a -> FilterValue typ
- data Entity record = Entity {}
- getPersistMap :: PersistValue -> Either Text [(Text, PersistValue)]
- class PersistField a where
- toPersistValue :: a -> PersistValue
- fromPersistValue :: PersistValue -> Either Text a
- data SomePersistField = PersistField a => SomePersistField a
- fromPersistValueText :: PersistValue -> Either Text Text
- toEmbedEntityDef :: EntityDef -> EmbedEntityDef
- keyAndEntityFields :: EntityDef -> [FieldDef]
- entityKeyFields :: EntityDef -> [FieldDef]
- entityPrimary :: EntityDef -> Maybe CompositeDef
- data Checkmark
- data IsNullable
- data WhyNullable
- data EntityDef = EntityDef {
- entityHaskell :: !HaskellName
- entityDB :: !DBName
- entityId :: !FieldDef
- entityAttrs :: ![Attr]
- entityFields :: ![FieldDef]
- entityUniques :: ![UniqueDef]
- entityForeigns :: ![ForeignDef]
- entityDerives :: ![Text]
- entityExtra :: !(Map Text [ExtraLine])
- entitySum :: !Bool
- entityComments :: !(Maybe Text)
- type ExtraLine = [Text]
- newtype HaskellName = HaskellName {}
- newtype DBName = DBName {}
- type Attr = Text
- data FieldType
- data FieldDef = FieldDef {
- fieldHaskell :: !HaskellName
- fieldDB :: !DBName
- fieldType :: !FieldType
- fieldSqlType :: !SqlType
- fieldAttrs :: ![Attr]
- fieldStrict :: !Bool
- fieldReference :: !ReferenceDef
- fieldComments :: !(Maybe Text)
- data ReferenceDef
- data EmbedEntityDef = EmbedEntityDef {}
- data EmbedFieldDef = EmbedFieldDef {}
- data UniqueDef = UniqueDef {
- uniqueHaskell :: !HaskellName
- uniqueDBName :: !DBName
- uniqueFields :: ![(HaskellName, DBName)]
- uniqueAttrs :: ![Attr]
- data CompositeDef = CompositeDef {
- compositeFields :: ![FieldDef]
- compositeAttrs :: ![Attr]
- type ForeignFieldDef = (HaskellName, DBName)
- data ForeignDef = ForeignDef {}
- data PersistException
- data PersistValue
- = PersistText Text
- | PersistByteString ByteString
- | PersistInt64 Int64
- | PersistDouble Double
- | PersistRational Rational
- | PersistBool Bool
- | PersistDay Day
- | PersistTimeOfDay TimeOfDay
- | PersistUTCTime UTCTime
- | PersistNull
- | PersistList [PersistValue]
- | PersistMap [(Text, PersistValue)]
- | PersistObjectId ByteString
- | PersistArray [PersistValue]
- | PersistDbSpecific ByteString
- data SqlType
- data PersistFilter
- data UpdateException
- data OnlyUniqueException = OnlyUniqueException String
- data PersistUpdate
- type family PersistConfigPool c
- type family PersistConfigBackend c :: (Type -> Type) -> Type -> Type
- class PersistConfig c where
- type PersistConfigBackend c :: (Type -> Type) -> Type -> Type
- type PersistConfigPool c
- loadConfig :: Value -> Parser c
- applyEnv :: c -> IO c
- createPoolConfig :: c -> IO (PersistConfigPool c)
- runPool :: MonadUnliftIO m => c -> PersistConfigBackend c m a -> PersistConfigPool c -> m a
- newtype DBRunner site = DBRunner {
- runDBRunner :: forall a. YesodDB site a -> HandlerFor site a
- class YesodPersist site => YesodPersistRunner site where
- getDBRunner :: HandlerFor site (DBRunner site, HandlerFor site ())
- class Monad (YesodDB site) => YesodPersist site where
- type YesodPersistBackend site
- runDB :: YesodDB site a -> HandlerFor site a
- type family YesodPersistBackend site
- type YesodDB site = ReaderT (YesodPersistBackend site) (HandlerFor site)
- defaultRunDB :: PersistConfig c => (site -> c) -> (site -> PersistConfigPool c) -> PersistConfigBackend c (HandlerFor site) a -> HandlerFor site a
- defaultGetDBRunner :: (IsSqlBackend backend, YesodPersistBackend site ~ backend) => (site -> Pool backend) -> HandlerFor site (DBRunner site, HandlerFor site ())
- runDBSource :: YesodPersistRunner site => ConduitT () a (YesodDB site) () -> ConduitT () a (HandlerFor site) ()
- respondSourceDB :: YesodPersistRunner site => ContentType -> ConduitT () (Flush Builder) (YesodDB site) () -> HandlerFor site TypedContent
- get404 :: forall (m :: Type -> Type) backend val. (MonadIO m, PersistStoreRead backend, PersistRecordBackend val backend) => Key val -> ReaderT backend m val
- getBy404 :: forall backend val (m :: Type -> Type). (PersistUniqueRead backend, PersistRecordBackend val backend, MonadIO m) => Unique val -> ReaderT backend m (Entity val)
- insert400 :: forall (m :: Type -> Type) backend val. (MonadIO m, PersistUniqueWrite backend, PersistRecordBackend val backend) => val -> ReaderT backend m (Key val)
- insert400_ :: forall (m :: Type -> Type) backend val. (MonadIO m, PersistUniqueWrite backend, PersistRecordBackend val backend) => val -> ReaderT backend m ()
- mkMigrate :: String -> [EntityDef] -> Q [Dec]
- derivePersistFieldJSON :: String -> Q [Dec]
- derivePersistField :: String -> Q [Dec]
- mkEntityDefList :: String -> [EntityDef] -> Q [Dec]
- mkDeleteCascade :: MkPersistSettings -> [EntityDef] -> Q [Dec]
- mkSave :: String -> [EntityDef] -> Q [Dec]
- share :: [[EntityDef] -> Q [Dec]] -> [EntityDef] -> Q [Dec]
- persistFieldFromEntity :: MkPersistSettings -> EntityDef -> Q [Dec]
- fieldError :: Text -> Text -> Text -> Text
- lensPTH :: (s -> a) -> (s -> b -> t) -> Lens s t a b
- sqlSettings :: MkPersistSettings
- mkPersistSettings :: Type -> MkPersistSettings
- mkPersist :: MkPersistSettings -> [EntityDef] -> Q [Dec]
- parseReferences :: PersistSettings -> Text -> Q Exp
- embedEntityDefs :: [EntityDef] -> [EntityDef]
- persistManyFileWith :: PersistSettings -> [FilePath] -> Q Exp
- persistFileWith :: PersistSettings -> FilePath -> Q Exp
- persistLowerCase :: QuasiQuoter
- persistUpperCase :: QuasiQuoter
- persistWith :: PersistSettings -> QuasiQuoter
- data MkPersistSettings
- data EntityJSON = EntityJSON {
- entityToJSON :: Name
- entityFromJSON :: Name
- data FormMessage
- = MsgInvalidInteger Text
- | MsgInvalidNumber Text
- | MsgInvalidEntry Text
- | MsgInvalidUrl Text
- | MsgInvalidEmail Text
- | MsgInvalidTimeFormat
- | MsgInvalidHour Text
- | MsgInvalidMinute Text
- | MsgInvalidSecond Text
- | MsgInvalidDay
- | MsgCsrfWarning
- | MsgValueRequired
- | MsgInputNotFound Text
- | MsgSelectNone
- | MsgInvalidBool Text
- | MsgBoolYes
- | MsgBoolNo
- | MsgDelete
- data Field (m :: Type -> Type) a = Field {
- fieldParse :: [Text] -> [FileInfo] -> m (Either (SomeMessage (HandlerSite m)) (Maybe a))
- fieldView :: FieldViewFunc m a
- fieldEnctype :: Enctype
- type FieldViewFunc (m :: Type -> Type) a = Text -> Text -> [(Text, Text)] -> Either Text a -> Bool -> WidgetFor (HandlerSite m) ()
- data FieldView site = FieldView {}
- data FieldSettings master = FieldSettings {}
- newtype AForm (m :: Type -> Type) a = AForm {
- unAForm :: (HandlerSite m, [Text]) -> Maybe (Env, FileEnv) -> Ints -> m (FormResult a, [FieldView (HandlerSite m)] -> [FieldView (HandlerSite m)], Ints, Enctype)
- type MForm (m :: Type -> Type) a = RWST (Maybe (Env, FileEnv), HandlerSite m, [Lang]) Enctype Ints m a
- type WForm (m :: Type -> Type) a = MForm (WriterT [FieldView (HandlerSite m)] m) a
- type FileEnv = Map Text [FileInfo]
- type Env = Map Text [Text]
- data Ints
- data Enctype
- data FormResult a
- = FormMissing
- | FormFailure [Text]
- | FormSuccess a
- newtype FormInput (m :: Type -> Type) a = FormInput {
- unFormInput :: HandlerSite m -> [Text] -> Env -> FileEnv -> m (Either DText a)
- ireq :: forall (m :: Type -> Type) a. (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m a -> Text -> FormInput m a
- iopt :: forall (m :: Type -> Type) a. Monad m => Field m a -> Text -> FormInput m (Maybe a)
- runInputGet :: MonadHandler m => FormInput m a -> m a
- runInputGetResult :: MonadHandler m => FormInput m a -> m (FormResult a)
- runInputPost :: MonadHandler m => FormInput m a -> m a
- runInputPostResult :: MonadHandler m => FormInput m a -> m (FormResult a)
- type FormRender (m :: Type -> Type) a = AForm m a -> Markup -> MForm m (FormResult a, WidgetFor (HandlerSite m) ())
- newFormIdent :: forall (m :: Type -> Type). Monad m => MForm m Text
- formToAForm :: forall (m :: Type -> Type) site a. (HandlerSite m ~ site, Monad m) => MForm m (FormResult a, [FieldView site]) -> AForm m a
- aFormToForm :: forall (m :: Type -> Type) site a. (Monad m, HandlerSite m ~ site) => AForm m a -> MForm m (FormResult a, [FieldView site] -> [FieldView site])
- askParams :: forall (m :: Type -> Type). Monad m => MForm m (Maybe Env)
- askFiles :: forall (m :: Type -> Type). Monad m => MForm m (Maybe FileEnv)
- wreq :: forall site (m :: Type -> Type) a. (RenderMessage site FormMessage, HandlerSite m ~ site, MonadHandler m) => Field m a -> FieldSettings site -> Maybe a -> WForm m (FormResult a)
- wreqMsg :: forall site msg (m :: Type -> Type) a. (RenderMessage site msg, HandlerSite m ~ site, MonadHandler m) => Field m a -> FieldSettings site -> msg -> Maybe a -> WForm m (FormResult a)
- wopt :: forall (m :: Type -> Type) site a. (MonadHandler m, HandlerSite m ~ site) => Field m a -> FieldSettings site -> Maybe (Maybe a) -> WForm m (FormResult (Maybe a))
- wFormToAForm :: forall (m :: Type -> Type) a. MonadHandler m => WForm m (FormResult a) -> AForm m a
- wFormToMForm :: forall (m :: Type -> Type) site a. (MonadHandler m, HandlerSite m ~ site) => WForm m a -> MForm m (a, [FieldView site])
- mFormToWForm :: forall (m :: Type -> Type) site a. (MonadHandler m, HandlerSite m ~ site) => MForm m (a, FieldView site) -> WForm m a
- mreq :: forall site (m :: Type -> Type) a. (RenderMessage site FormMessage, HandlerSite m ~ site, MonadHandler m) => Field m a -> FieldSettings site -> Maybe a -> MForm m (FormResult a, FieldView site)
- mreqMsg :: forall site msg (m :: Type -> Type) a. (RenderMessage site msg, HandlerSite m ~ site, MonadHandler m) => Field m a -> FieldSettings site -> msg -> Maybe a -> MForm m (FormResult a, FieldView site)
- mopt :: forall site (m :: Type -> Type) a. (site ~ HandlerSite m, MonadHandler m) => Field m a -> FieldSettings site -> Maybe (Maybe a) -> MForm m (FormResult (Maybe a), FieldView site)
- areq :: forall site (m :: Type -> Type) a. (RenderMessage site FormMessage, HandlerSite m ~ site, MonadHandler m) => Field m a -> FieldSettings site -> Maybe a -> AForm m a
- areqMsg :: forall site msg (m :: Type -> Type) a. (RenderMessage site msg, HandlerSite m ~ site, MonadHandler m) => Field m a -> FieldSettings site -> msg -> Maybe a -> AForm m a
- aopt :: forall (m :: Type -> Type) a. MonadHandler m => Field m a -> FieldSettings (HandlerSite m) -> Maybe (Maybe a) -> AForm m (Maybe a)
- runFormPost :: (RenderMessage (HandlerSite m) FormMessage, MonadResource m, MonadHandler m) => (Markup -> MForm m (FormResult a, xml)) -> m ((FormResult a, xml), Enctype)
- generateFormPost :: (RenderMessage (HandlerSite m) FormMessage, MonadHandler m) => (Markup -> MForm m (FormResult a, xml)) -> m (xml, Enctype)
- runFormPostNoToken :: MonadHandler m => (Markup -> MForm m a) -> m (a, Enctype)
- runFormGet :: MonadHandler m => (Markup -> MForm m a) -> m (a, Enctype)
- generateFormGet' :: MonadHandler m => (Markup -> MForm m (FormResult a, xml)) -> m (xml, Enctype)
- generateFormGet :: MonadHandler m => (Markup -> MForm m a) -> m (a, Enctype)
- identifyForm :: forall (m :: Type -> Type) a. Monad m => Text -> (Markup -> MForm m (FormResult a, WidgetFor (HandlerSite m) ())) -> Markup -> MForm m (FormResult a, WidgetFor (HandlerSite m) ())
- renderTable :: forall (m :: Type -> Type) a. Monad m => FormRender m a
- renderDivs :: forall (m :: Type -> Type) a. Monad m => FormRender m a
- renderDivsNoLabels :: forall (m :: Type -> Type) a. Monad m => FormRender m a
- renderBootstrap2 :: forall (m :: Type -> Type) a. Monad m => FormRender m a
- renderBootstrap :: forall (m :: Type -> Type) a. Monad m => FormRender m a
- check :: forall (m :: Type -> Type) msg a. (Monad m, RenderMessage (HandlerSite m) msg) => (a -> Either msg a) -> Field m a -> Field m a
- checkBool :: forall (m :: Type -> Type) msg a. (Monad m, RenderMessage (HandlerSite m) msg) => (a -> Bool) -> msg -> Field m a -> Field m a
- checkM :: (Monad m, RenderMessage (HandlerSite m) msg) => (a -> m (Either msg a)) -> Field m a -> Field m a
- checkMMap :: (Monad m, RenderMessage (HandlerSite m) msg) => (a -> m (Either msg b)) -> (b -> a) -> Field m a -> Field m b
- customErrorMessage :: forall (m :: Type -> Type) a. Monad m => SomeMessage (HandlerSite m) -> Field m a -> Field m a
- fieldSettingsLabel :: RenderMessage site msg => msg -> FieldSettings site
- parseHelper :: (Monad m, RenderMessage site FormMessage) => (Text -> Either FormMessage a) -> [Text] -> [FileInfo] -> m (Either (SomeMessage site) (Maybe a))
- parseHelperGen :: (Monad m, RenderMessage site msg) => (Text -> Either msg a) -> [Text] -> [FileInfo] -> m (Either (SomeMessage site) (Maybe a))
- convertField :: forall (m :: Type -> Type) a b. Functor m => (a -> b) -> (b -> a) -> Field m a -> Field m b
- removeClass :: Text -> [(Text, Text)] -> [(Text, Text)]
- addClass :: Text -> [(Text, Text)] -> [(Text, Text)]
- data Option a = Option {}
- data OptionList a = OptionList {
- olOptions :: [Option a]
- olReadExternal :: Text -> Maybe a
- type AutoFocus = Bool
- newtype Textarea = Textarea {
- unTextarea :: Text
- defaultFormMessage :: FormMessage -> Text
- intField :: forall (m :: Type -> Type) i. (Monad m, Integral i, RenderMessage (HandlerSite m) FormMessage) => Field m i
- doubleField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Double
- dayField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Day
- timeField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m TimeOfDay
- timeFieldTypeTime :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m TimeOfDay
- timeFieldTypeText :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m TimeOfDay
- htmlField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Html
- textareaField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Textarea
- hiddenField :: forall (m :: Type -> Type) p. (Monad m, PathPiece p, RenderMessage (HandlerSite m) FormMessage) => Field m p
- textField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Text
- passwordField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Text
- parseDate :: String -> Either FormMessage Day
- emailField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Text
- multiEmailField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m [Text]
- searchField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => AutoFocus -> Field m Text
- urlField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Text
- selectFieldList :: (Eq a, RenderMessage site FormMessage, RenderMessage site msg) => [(msg, a)] -> Field (HandlerFor site) a
- selectField :: (Eq a, RenderMessage site FormMessage) => HandlerFor site (OptionList a) -> Field (HandlerFor site) a
- multiSelectFieldList :: (Eq a, RenderMessage site msg) => [(msg, a)] -> Field (HandlerFor site) [a]
- multiSelectField :: Eq a => HandlerFor site (OptionList a) -> Field (HandlerFor site) [a]
- radioFieldList :: (Eq a, RenderMessage site FormMessage, RenderMessage site msg) => [(msg, a)] -> Field (HandlerFor site) a
- checkboxesFieldList :: (Eq a, RenderMessage site msg) => [(msg, a)] -> Field (HandlerFor site) [a]
- checkboxesField :: Eq a => HandlerFor site (OptionList a) -> Field (HandlerFor site) [a]
- radioField :: (Eq a, RenderMessage site FormMessage) => HandlerFor site (OptionList a) -> Field (HandlerFor site) a
- boolField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Bool
- checkBoxField :: forall (m :: Type -> Type). Monad m => Field m Bool
- mkOptionList :: [Option a] -> OptionList a
- optionsPairs :: (MonadHandler m, RenderMessage (HandlerSite m) msg) => [(msg, a)] -> m (OptionList a)
- optionsEnum :: (MonadHandler m, Show a, Enum a, Bounded a) => m (OptionList a)
- optionsPersist :: (YesodPersist site, PersistQueryRead backend, PathPiece (Key a), RenderMessage site msg, YesodPersistBackend site ~ backend, PersistRecordBackend a backend) => [Filter a] -> [SelectOpt a] -> (a -> msg) -> HandlerFor site (OptionList (Entity a))
- optionsPersistKey :: (YesodPersist site, PersistQueryRead backend, PathPiece (Key a), RenderMessage site msg, backend ~ YesodPersistBackend site, PersistRecordBackend a backend) => [Filter a] -> [SelectOpt a] -> (a -> msg) -> HandlerFor site (OptionList (Key a))
- selectFieldHelper :: (Eq a, RenderMessage site FormMessage) => (Text -> Text -> [(Text, Text)] -> WidgetFor site () -> WidgetFor site ()) -> (Text -> Text -> Bool -> WidgetFor site ()) -> (Text -> Text -> [(Text, Text)] -> Text -> Bool -> Text -> WidgetFor site ()) -> HandlerFor site (OptionList a) -> Field (HandlerFor site) a
- fileField :: forall (m :: Type -> Type). Monad m => Field m FileInfo
- fileAFormReq :: forall (m :: Type -> Type). (MonadHandler m, RenderMessage (HandlerSite m) FormMessage) => FieldSettings (HandlerSite m) -> AForm m FileInfo
- fileAFormOpt :: forall (m :: Type -> Type). MonadHandler m => FieldSettings (HandlerSite m) -> AForm m (Maybe FileInfo)
- class PathPiece s where
- fromPathPiece :: Text -> Maybe s
- toPathPiece :: s -> Text
- class PathMultiPiece s where
- fromPathMultiPiece :: [Text] -> Maybe s
- toPathMultiPiece :: s -> [Text]
- formatW3 :: UTCTime -> Text
- formatRFC1123 :: UTCTime -> Text
- formatRFC822 :: UTCTime -> Text
- class RenderRoute a => RouteAttrs a where
- routeAttrs :: Route a -> Set Text
- class RenderRoute a => ParseRoute a where
- class Eq (Route a) => RenderRoute a where
- data family Route a
- data SubHandlerFor sub master a
- pattern AddCookie :: !SetCookie -> Header
- pattern DeleteCookie :: !ByteString -> !ByteString -> Header
- data ErrorResponse
- newtype DontFullyEvaluate a = DontFullyEvaluate {
- unDontFullyEvaluate :: a
- type ContentType = ByteString
- newtype RepXml = RepXml Content
- newtype RepPlain = RepPlain Content
- newtype RepJson = RepJson Content
- type RepHtml = Html
- data TypedContent = TypedContent !ContentType !Content
- data Content
- = ContentBuilder !Builder !(Maybe Int)
- | ContentSource !(ConduitT () (Flush Builder) (ResourceT IO) ())
- | ContentFile !FilePath !(Maybe FilePart)
- | ContentDontEvaluate !Content
- data PageContent url = PageContent {}
- newtype CssBuilder = CssBuilder {
- unCssBuilder :: Builder
- data WidgetFor site a
- data HandlerFor site a
- newtype WaiSubsiteWithAuth = WaiSubsiteWithAuth {}
- newtype WaiSubsite = WaiSubsite {}
- type Texts = [Text]
- type BottomOfHeadAsync master = [Text] -> Maybe (HtmlUrl (Route master)) -> HtmlUrl (Route master)
- data ScriptLoadPosition master
- = BottomOfBody
- | BottomOfHeadBlocking
- | BottomOfHeadAsync !(BottomOfHeadAsync master)
- data AuthResult
- data Approot master
- = ApprootRelative
- | ApprootStatic !Text
- | ApprootMaster !(master -> Text)
- | ApprootRequest !(master -> Request -> Text)
- data FileUpload
- = FileUploadMemory !(BackEnd ByteString)
- | FileUploadDisk !(InternalState -> BackEnd FilePath)
- | FileUploadSource !(BackEnd (ConduitT () ByteString (ResourceT IO) ()))
- data FileInfo
- type RequestBodyContents = ([(Text, Text)], [(Text, FileInfo)])
- data YesodRequest = YesodRequest {
- reqGetParams :: ![(Text, Text)]
- reqCookies :: ![(Text, Text)]
- reqWaiRequest :: !Request
- reqLangs :: ![Text]
- reqToken :: !(Maybe Text)
- reqSession :: !SessionMap
- reqAccept :: ![ContentType]
- newtype SessionBackend = SessionBackend {
- sbLoadSession :: Request -> IO (SessionMap, SaveSession)
- type SessionMap = Map Text ByteString
- clientSessionDateCacher :: NominalDiffTime -> IO (IO ClientSessionDateCache, IO ())
- class ToContent a => ToTypedContent a where
- toTypedContent :: a -> TypedContent
- class ToTypedContent a => HasContentType a where
- getContentType :: Monad m => m a -> ContentType
- class ToFlushBuilder a where
- toFlushBuilder :: a -> Flush Builder
- class ToContent a where
- emptyContent :: Content
- repJson :: ToContent a => a -> RepJson
- repPlain :: ToContent a => a -> RepPlain
- repXml :: ToContent a => a -> RepXml
- typeHtml :: ContentType
- typePlain :: ContentType
- typeJson :: ContentType
- typeXml :: ContentType
- typeAtom :: ContentType
- typeRss :: ContentType
- typeJpeg :: ContentType
- typePng :: ContentType
- typeGif :: ContentType
- typeSvg :: ContentType
- typeJavascript :: ContentType
- typeCss :: ContentType
- typeFlv :: ContentType
- typeOgv :: ContentType
- typeOctet :: ContentType
- simpleContentType :: ContentType -> ContentType
- contentTypeTypes :: ContentType -> (ByteString, ByteString)
- class MonadHandler m => MonadWidget (m :: Type -> Type) where
- liftWidget :: WidgetFor (HandlerSite m) a -> m a
- class (MonadResource m, MonadLogger m) => MonadHandler (m :: Type -> Type) where
- type HandlerSite (m :: Type -> Type)
- type SubHandlerSite (m :: Type -> Type)
- liftHandler :: HandlerFor (HandlerSite m) a -> m a
- liftSubHandler :: SubHandlerFor (SubHandlerSite m) (HandlerSite m) a -> m a
- type family HandlerSite (m :: Type -> Type)
- type family SubHandlerSite (m :: Type -> Type)
- data ProvidedRep (m :: Type -> Type)
- data Fragment a b = a :#: b
- class RedirectUrl master a where
- toTextUrl :: (MonadHandler m, HandlerSite m ~ master) => a -> m Text
- type HandlerT site (m :: Type -> Type) = HandlerFor site
- getRequest :: MonadHandler m => m YesodRequest
- runRequestBody :: MonadHandler m => m RequestBodyContents
- getYesod :: MonadHandler m => m (HandlerSite m)
- getsYesod :: MonadHandler m => (HandlerSite m -> a) -> m a
- getUrlRender :: MonadHandler m => m (Route (HandlerSite m) -> Text)
- getUrlRenderParams :: MonadHandler m => m (Route (HandlerSite m) -> [(Text, Text)] -> Text)
- getPostParams :: MonadHandler m => m [(Text, Text)]
- getCurrentRoute :: MonadHandler m => m (Maybe (Route (HandlerSite m)))
- handlerToIO :: MonadIO m => HandlerFor site (HandlerFor site a -> m a)
- forkHandler :: (SomeException -> HandlerFor site ()) -> HandlerFor site () -> HandlerFor site ()
- redirect :: (MonadHandler m, RedirectUrl (HandlerSite m) url) => url -> m a
- redirectWith :: (MonadHandler m, RedirectUrl (HandlerSite m) url) => Status -> url -> m a
- setUltDest :: (MonadHandler m, RedirectUrl (HandlerSite m) url) => url -> m ()
- setUltDestCurrent :: MonadHandler m => m ()
- setUltDestReferer :: MonadHandler m => m ()
- redirectUltDest :: (RedirectUrl (HandlerSite m) url, MonadHandler m) => url -> m a
- clearUltDest :: MonadHandler m => m ()
- addMessage :: MonadHandler m => Text -> Html -> m ()
- addMessageI :: (MonadHandler m, RenderMessage (HandlerSite m) msg) => Text -> msg -> m ()
- getMessages :: MonadHandler m => m [(Text, Html)]
- setMessage :: MonadHandler m => Html -> m ()
- setMessageI :: (MonadHandler m, RenderMessage (HandlerSite m) msg) => msg -> m ()
- getMessage :: MonadHandler m => m (Maybe Html)
- sendFile :: MonadHandler m => ContentType -> FilePath -> m a
- sendFilePart :: MonadHandler m => ContentType -> FilePath -> Integer -> Integer -> m a
- sendResponse :: (MonadHandler m, ToTypedContent c) => c -> m a
- sendResponseStatus :: (MonadHandler m, ToTypedContent c) => Status -> c -> m a
- sendStatusJSON :: (MonadHandler m, ToJSON c) => Status -> c -> m a
- sendResponseCreated :: MonadHandler m => Route (HandlerSite m) -> m a
- sendResponseNoContent :: MonadHandler m => m a
- sendWaiResponse :: MonadHandler m => Response -> m b
- sendWaiApplication :: MonadHandler m => Application -> m b
- sendRawResponseNoConduit :: (MonadHandler m, MonadUnliftIO m) => (IO ByteString -> (ByteString -> IO ()) -> m ()) -> m a
- sendRawResponse :: (MonadHandler m, MonadUnliftIO m) => (ConduitT () ByteString IO () -> ConduitT ByteString Void IO () -> m ()) -> m a
- notModified :: MonadHandler m => m a
- notFound :: MonadHandler m => m a
- badMethod :: MonadHandler m => m a
- notAuthenticated :: MonadHandler m => m a
- permissionDenied :: MonadHandler m => Text -> m a
- permissionDeniedI :: (RenderMessage (HandlerSite m) msg, MonadHandler m) => msg -> m a
- invalidArgs :: MonadHandler m => [Text] -> m a
- invalidArgsI :: (MonadHandler m, RenderMessage (HandlerSite m) msg) => [msg] -> m a
- setCookie :: MonadHandler m => SetCookie -> m ()
- getExpires :: MonadIO m => Int -> m UTCTime
- deleteCookie :: MonadHandler m => Text -> Text -> m ()
- setLanguage :: MonadHandler m => Text -> m ()
- addContentDispositionFileName :: MonadHandler m => Text -> m ()
- addHeader :: MonadHandler m => Text -> Text -> m ()
- setHeader :: MonadHandler m => Text -> Text -> m ()
- replaceOrAddHeader :: MonadHandler m => Text -> Text -> m ()
- cacheSeconds :: MonadHandler m => Int -> m ()
- neverExpires :: MonadHandler m => m ()
- alreadyExpired :: MonadHandler m => m ()
- expiresAt :: MonadHandler m => UTCTime -> m ()
- setEtag :: MonadHandler m => Text -> m ()
- setWeakEtag :: MonadHandler m => Text -> m ()
- setSession :: MonadHandler m => Text -> Text -> m ()
- setSessionBS :: MonadHandler m => Text -> ByteString -> m ()
- deleteSession :: MonadHandler m => Text -> m ()
- clearSession :: MonadHandler m => m ()
- lookupSession :: MonadHandler m => Text -> m (Maybe Text)
- lookupSessionBS :: MonadHandler m => Text -> m (Maybe ByteString)
- getSession :: MonadHandler m => m SessionMap
- newIdent :: MonadHandler m => m Text
- redirectToPost :: (MonadHandler m, RedirectUrl (HandlerSite m) url) => url -> m a
- hamletToRepHtml :: MonadHandler m => HtmlUrl (Route (HandlerSite m)) -> m Html
- giveUrlRenderer :: MonadHandler m => ((Route (HandlerSite m) -> [(Text, Text)] -> Text) -> output) -> m output
- withUrlRenderer :: MonadHandler m => ((Route (HandlerSite m) -> [(Text, Text)] -> Text) -> output) -> m output
- waiRequest :: MonadHandler m => m Request
- getMessageRender :: (MonadHandler m, RenderMessage (HandlerSite m) message) => m (message -> Text)
- cached :: (MonadHandler m, Typeable a) => m a -> m a
- cacheGet :: (MonadHandler m, Typeable a) => m (Maybe a)
- cacheSet :: (MonadHandler m, Typeable a) => a -> m ()
- cachedBy :: (MonadHandler m, Typeable a) => ByteString -> m a -> m a
- cacheByGet :: (MonadHandler m, Typeable a) => ByteString -> m (Maybe a)
- cacheBySet :: (MonadHandler m, Typeable a) => ByteString -> a -> m ()
- languages :: MonadHandler m => m [Text]
- lookupHeader :: MonadHandler m => CI ByteString -> m (Maybe ByteString)
- lookupHeaders :: MonadHandler m => CI ByteString -> m [ByteString]
- lookupBasicAuth :: MonadHandler m => m (Maybe (Text, Text))
- lookupBearerAuth :: MonadHandler m => m (Maybe Text)
- lookupGetParams :: MonadHandler m => Text -> m [Text]
- lookupGetParam :: MonadHandler m => Text -> m (Maybe Text)
- lookupPostParams :: (MonadResource m, MonadHandler m) => Text -> m [Text]
- lookupPostParam :: (MonadResource m, MonadHandler m) => Text -> m (Maybe Text)
- lookupFile :: MonadHandler m => Text -> m (Maybe FileInfo)
- lookupFiles :: MonadHandler m => Text -> m [FileInfo]
- lookupCookie :: MonadHandler m => Text -> m (Maybe Text)
- lookupCookies :: MonadHandler m => Text -> m [Text]
- selectRep :: MonadHandler m => Writer (Endo [ProvidedRep m]) () -> m TypedContent
- provideRep :: (Monad m, HasContentType a) => m a -> Writer (Endo [ProvidedRep m]) ()
- provideRepType :: (Monad m, ToContent a) => ContentType -> m a -> Writer (Endo [ProvidedRep m]) ()
- rawRequestBody :: forall (m :: Type -> Type) i. MonadHandler m => ConduitT i ByteString m ()
- fileSource :: forall (m :: Type -> Type). MonadResource m => FileInfo -> ConduitT () ByteString m ()
- fileSourceByteString :: MonadResource m => FileInfo -> m ByteString
- respond :: (Monad m, ToContent a) => ContentType -> a -> m TypedContent
- respondSource :: ContentType -> ConduitT () (Flush Builder) (HandlerFor site) () -> HandlerFor site TypedContent
- sendChunk :: forall (m :: Type -> Type) a i. (Monad m, ToFlushBuilder a) => a -> ConduitT i (Flush Builder) m ()
- sendFlush :: forall (m :: Type -> Type) i. Monad m => ConduitT i (Flush Builder) m ()
- sendChunkBS :: forall (m :: Type -> Type) i. Monad m => ByteString -> ConduitT i (Flush Builder) m ()
- sendChunkLBS :: forall (m :: Type -> Type) i. Monad m => ByteString -> ConduitT i (Flush Builder) m ()
- sendChunkText :: forall (m :: Type -> Type) i. Monad m => Text -> ConduitT i (Flush Builder) m ()
- sendChunkLazyText :: forall (m :: Type -> Type) i. Monad m => Text -> ConduitT i (Flush Builder) m ()
- sendChunkHtml :: forall (m :: Type -> Type) i. Monad m => Html -> ConduitT i (Flush Builder) m ()
- defaultCsrfCookieName :: ByteString
- setCsrfCookie :: MonadHandler m => m ()
- setCsrfCookieWithCookie :: MonadHandler m => SetCookie -> m ()
- defaultCsrfHeaderName :: CI ByteString
- checkCsrfHeaderNamed :: MonadHandler m => CI ByteString -> m ()
- hasValidCsrfHeaderNamed :: MonadHandler m => CI ByteString -> m Bool
- defaultCsrfParamName :: Text
- checkCsrfParamNamed :: MonadHandler m => Text -> m ()
- hasValidCsrfParamNamed :: MonadHandler m => Text -> m Bool
- checkCsrfHeaderOrParam :: (MonadHandler m, MonadLogger m) => CI ByteString -> Text -> m ()
- getSubYesod :: MonadHandler m => m (SubHandlerSite m)
- getRouteToParent :: MonadHandler m => m (Route (SubHandlerSite m) -> Route (HandlerSite m))
- getSubCurrentRoute :: MonadHandler m => m (Maybe (Route (SubHandlerSite m)))
- class ToWidgetHead site a where
- toWidgetHead :: (MonadWidget m, HandlerSite m ~ site) => a -> m ()
- class ToWidgetBody site a where
- toWidgetBody :: (MonadWidget m, HandlerSite m ~ site) => a -> m ()
- class ToWidgetMedia site a where
- toWidgetMedia :: (MonadWidget m, HandlerSite m ~ site) => Text -> a -> m ()
- class ToWidget site a where
- toWidget :: (MonadWidget m, HandlerSite m ~ site) => a -> m ()
- type WidgetT site (m :: Type -> Type) = WidgetFor site
- setTitle :: MonadWidget m => Html -> m ()
- setTitleI :: (MonadWidget m, RenderMessage (HandlerSite m) msg) => msg -> m ()
- setDescription :: MonadWidget m => Text -> m ()
- setDescriptionI :: (MonadWidget m, RenderMessage (HandlerSite m) msg) => msg -> m ()
- setOGType :: MonadWidget m => Text -> m ()
- setOGImage :: MonadWidget m => Text -> m ()
- addStylesheet :: MonadWidget m => Route (HandlerSite m) -> m ()
- addStylesheetAttrs :: MonadWidget m => Route (HandlerSite m) -> [(Text, Text)] -> m ()
- addStylesheetRemote :: MonadWidget m => Text -> m ()
- addStylesheetRemoteAttrs :: MonadWidget m => Text -> [(Text, Text)] -> m ()
- addStylesheetEither :: MonadWidget m => Either (Route (HandlerSite m)) Text -> m ()
- addScriptEither :: MonadWidget m => Either (Route (HandlerSite m)) Text -> m ()
- addScript :: MonadWidget m => Route (HandlerSite m) -> m ()
- addScriptAttrs :: MonadWidget m => Route (HandlerSite m) -> [(Text, Text)] -> m ()
- addScriptRemote :: MonadWidget m => Text -> m ()
- addScriptRemoteAttrs :: MonadWidget m => Text -> [(Text, Text)] -> m ()
- whamlet :: QuasiQuoter
- whamletFile :: FilePath -> Q Exp
- whamletFileWithSettings :: HamletSettings -> FilePath -> Q Exp
- asWidgetT :: forall site (m :: Type -> Type). WidgetT site m () -> WidgetT site m ()
- ihamletToRepHtml :: (MonadHandler m, RenderMessage (HandlerSite m) message) => HtmlUrlI18n message (Route (HandlerSite m)) -> m Html
- ihamletToHtml :: (MonadHandler m, RenderMessage (HandlerSite m) message) => HtmlUrlI18n message (Route (HandlerSite m)) -> m Html
- handlerToWidget :: HandlerFor site a -> WidgetFor site a
- class RenderRoute site => Yesod site where
- approot :: Approot site
- errorHandler :: ErrorResponse -> HandlerFor site TypedContent
- defaultLayout :: WidgetFor site () -> HandlerFor site Html
- urlParamRenderOverride :: site -> Route site -> [(Text, Text)] -> Maybe Builder
- isAuthorized :: Route site -> Bool -> HandlerFor site AuthResult
- isWriteRequest :: Route site -> HandlerFor site Bool
- authRoute :: site -> Maybe (Route site)
- cleanPath :: site -> [Text] -> Either [Text] [Text]
- joinPath :: site -> Text -> [Text] -> [(Text, Text)] -> Builder
- addStaticContent :: Text -> Text -> ByteString -> HandlerFor site (Maybe (Either Text (Route site, [(Text, Text)])))
- maximumContentLength :: site -> Maybe (Route site) -> Maybe Word64
- maximumContentLengthIO :: site -> Maybe (Route site) -> IO (Maybe Word64)
- makeLogger :: site -> IO Logger
- messageLoggerSource :: site -> Logger -> Loc -> LogSource -> LogLevel -> LogStr -> IO ()
- jsLoader :: site -> ScriptLoadPosition site
- jsAttributes :: site -> [(Text, Text)]
- jsAttributesHandler :: HandlerFor site [(Text, Text)]
- makeSessionBackend :: site -> IO (Maybe SessionBackend)
- fileUpload :: site -> RequestBodyLength -> FileUpload
- shouldLogIO :: site -> LogSource -> LogLevel -> IO Bool
- yesodMiddleware :: ToTypedContent res => HandlerFor site res -> HandlerFor site res
- yesodWithInternalState :: site -> Maybe (Route site) -> (InternalState -> IO a) -> IO a
- defaultMessageWidget :: Html -> HtmlUrl (Route site) -> WidgetFor site ()
- defaultMakeLogger :: IO Logger
- defaultMessageLoggerSource :: (LogSource -> LogLevel -> IO Bool) -> Logger -> Loc -> LogSource -> LogLevel -> LogStr -> IO ()
- defaultShouldLogIO :: LogSource -> LogLevel -> IO Bool
- defaultYesodMiddleware :: Yesod site => HandlerFor site res -> HandlerFor site res
- sslOnlySessions :: IO (Maybe SessionBackend) -> IO (Maybe SessionBackend)
- laxSameSiteSessions :: IO (Maybe SessionBackend) -> IO (Maybe SessionBackend)
- strictSameSiteSessions :: IO (Maybe SessionBackend) -> IO (Maybe SessionBackend)
- sslOnlyMiddleware :: Int -> HandlerFor site res -> HandlerFor site res
- authorizationCheck :: Yesod site => HandlerFor site ()
- defaultCsrfCheckMiddleware :: Yesod site => HandlerFor site res -> HandlerFor site res
- csrfCheckMiddleware :: HandlerFor site res -> HandlerFor site Bool -> CI ByteString -> Text -> HandlerFor site res
- defaultCsrfSetCookieMiddleware :: HandlerFor site res -> HandlerFor site res
- csrfSetCookieMiddleware :: HandlerFor site res -> SetCookie -> HandlerFor site res
- defaultCsrfMiddleware :: Yesod site => HandlerFor site res -> HandlerFor site res
- widgetToPageContent :: Yesod site => WidgetFor site () -> HandlerFor site (PageContent (Route site))
- defaultErrorHandler :: Yesod site => ErrorResponse -> HandlerFor site TypedContent
- formatLogMessage :: IO ZonedDate -> Loc -> LogSource -> LogLevel -> LogStr -> IO LogStr
- customizeSessionCookies :: (SetCookie -> SetCookie) -> SessionBackend -> SessionBackend
- defaultClientSessionBackend :: Int -> FilePath -> IO SessionBackend
- envClientSessionBackend :: Int -> String -> IO SessionBackend
- clientSessionBackend :: Key -> IO ClientSessionDateCache -> SessionBackend
- loadClientSession :: Key -> IO ClientSessionDateCache -> ByteString -> Request -> IO (SessionMap, SaveSession)
- guessApproot :: Approot site
- guessApprootOr :: Approot site -> Approot site
- getApprootText :: Approot site -> site -> Request -> Text
- defaultLayoutJson :: (Yesod site, ToJSON a) => WidgetFor site () -> HandlerFor site a -> HandlerFor site TypedContent
- jsonToRepJson :: (Monad m, ToJSON a) => a -> m Value
- returnJson :: (Monad m, ToJSON a) => a -> m Value
- returnJsonEncoding :: (Monad m, ToJSON a) => a -> m Encoding
- provideJson :: forall (m :: Type -> Type) a. (Monad m, ToJSON a) => a -> Writer (Endo [ProvidedRep m]) ()
- parseJsonBody :: (MonadHandler m, FromJSON a) => m (Result a)
- parseInsecureJsonBody :: (MonadHandler m, FromJSON a) => m (Result a)
- parseCheckJsonBody :: (MonadHandler m, FromJSON a) => m (Result a)
- parseJsonBody_ :: (MonadHandler m, FromJSON a) => m a
- requireJsonBody :: (MonadHandler m, FromJSON a) => m a
- requireInsecureJsonBody :: (MonadHandler m, FromJSON a) => m a
- requireCheckJsonBody :: (MonadHandler m, FromJSON a) => m a
- array :: ToJSON a => [a] -> Value
- jsonOrRedirect :: (MonadHandler m, ToJSON a) => Route (HandlerSite m) -> a -> m Value
- jsonEncodingOrRedirect :: (MonadHandler m, ToJSON a) => Route (HandlerSite m) -> a -> m Encoding
- acceptsJson :: MonadHandler m => m Bool
- contentTypeHeaderIsJson :: ByteString -> Bool
- yesodRunner :: (ToTypedContent res, Yesod site) => HandlerFor site res -> YesodRunnerEnv site -> Maybe (Route site) -> Application
- yesodRender :: Yesod y => y -> ResolvedApproot -> Route y -> [(Text, Text)] -> Text
- class YesodSubDispatch sub master where
- yesodSubDispatch :: YesodSubRunnerEnv sub master -> Application
- class Yesod site => YesodDispatch site where
- yesodDispatch :: YesodRunnerEnv site -> Application
- type LiteWidget = WidgetFor LiteApp
- type LiteHandler = HandlerFor LiteApp
- newtype LiteApp = LiteApp {
- unLiteApp :: Method -> [Text] -> Maybe (LiteHandler TypedContent)
- liteApp :: Writer LiteApp () -> LiteApp
- dispatchTo :: ToTypedContent a => LiteHandler a -> Writer LiteApp ()
- onMethod :: Method -> Writer LiteApp () -> Writer LiteApp ()
- onStatic :: Text -> Writer LiteApp () -> Writer LiteApp ()
- withDynamic :: PathPiece p => (p -> Writer LiteApp ()) -> Writer LiteApp ()
- withDynamicMulti :: PathMultiPiece ps => (ps -> Writer LiteApp ()) -> Writer LiteApp ()
- class YesodBreadcrumbs site where
- breadcrumb :: Route site -> HandlerFor site (Text, Maybe (Route site))
- breadcrumbs :: YesodBreadcrumbs site => HandlerFor site (Text, [(Route site, Text)])
- parseRoutes :: QuasiQuoter
- parseRoutesFile :: FilePath -> Q Exp
- parseRoutesFileNoCheck :: FilePath -> Q Exp
- parseRoutesNoCheck :: QuasiQuoter
- mkYesod :: String -> [ResourceTree String] -> Q [Dec]
- mkYesodWith :: [[String]] -> String -> [String] -> [ResourceTree String] -> Q [Dec]
- mkYesodData :: String -> [ResourceTree String] -> Q [Dec]
- mkYesodSubData :: String -> [ResourceTree String] -> Q [Dec]
- mkYesodDispatch :: String -> [ResourceTree String] -> Q [Dec]
- mkYesodSubDispatch :: [ResourceTree a] -> Q Exp
- toWaiAppPlain :: YesodDispatch site => site -> IO Application
- toWaiAppYre :: YesodDispatch site => YesodRunnerEnv site -> Application
- toWaiApp :: YesodDispatch site => site -> IO Application
- warp :: YesodDispatch site => Int -> site -> IO ()
- mkDefaultMiddlewares :: Logger -> IO Middleware
- defaultMiddlewaresNoLogging :: Middleware
- warpDebug :: YesodDispatch site => Int -> site -> IO ()
- warpEnv :: YesodDispatch site => site -> IO ()
- getGetMaxExpires :: IO (IO Text)
- runFakeHandler :: (Yesod site, MonadIO m) => SessionMap -> (site -> Logger) -> site -> HandlerT site IO a -> m (Either ErrorResponse a)
- unauthorizedI :: (MonadHandler m, RenderMessage (HandlerSite m) msg) => msg -> m AuthResult
- yesodVersion :: String
- maybeAuthorized :: Yesod site => Route site -> Bool -> HandlerT site IO (Maybe (Route site))
- showIntegral :: Integral a => a -> String
- readIntegral :: Num a => String -> Maybe a
- type Application = Request -> (Response -> IO ResponseReceived) -> IO ResponseReceived
- type Html = Markup
- type JavascriptUrl url = (url -> [(Text, Text)] -> Text) -> Javascript
- renderJavascriptUrl :: (url -> [(Text, Text)] -> Text) -> JavascriptUrl url -> Text
- julius :: QuasiQuoter
- type CssUrl url = (url -> [(Text, Text)] -> Text) -> Css
- renderCssUrl :: (url -> [(Text, Text)] -> Text) -> CssUrl url -> Text
- lucius :: QuasiQuoter
- type HtmlUrl url = Render url -> Html
- shamlet :: QuasiQuoter
- hamlet :: QuasiQuoter
- xhamlet :: QuasiQuoter
- cassius :: QuasiQuoter
- data SomeMessage master = RenderMessage master msg => SomeMessage msg
- type Lang = Text
- class RenderMessage master message where
- renderMessage :: master -> [Lang] -> message -> Text
- class ToMessage a where
- mkMessage :: String -> FilePath -> Lang -> Q [Dec]
- mkMessageFor :: String -> String -> FilePath -> Lang -> Q [Dec]
- mkMessageVariant :: String -> String -> FilePath -> Lang -> Q [Dec]
- toHtml :: ToMarkup a => a -> Html
- class Monad m => MonadLogger (m :: Type -> Type)
- data LogLevel
- logDebug :: Q Exp
- logInfo :: Q Exp
- logWarn :: Q Exp
- logError :: Q Exp
- logOther :: Text -> Q Exp
- logDebugS :: Q Exp
- logInfoS :: Q Exp
- logWarnS :: Q Exp
- logErrorS :: Q Exp
- logOtherS :: Q Exp
- newsFeedText :: MonadHandler m => Feed Text -> m TypedContent
- newsFeed :: MonadHandler m => Feed (Route (HandlerSite m)) -> m TypedContent
- data Feed url = Feed {
- feedTitle :: Text
- feedLinkSelf :: url
- feedLinkHome :: url
- feedAuthor :: Text
- feedDescription :: Html
- feedLanguage :: Text
- feedUpdated :: UTCTime
- feedLogo :: Maybe (url, Text)
- feedEntries :: [FeedEntry url]
- data EntryEnclosure url = EntryEnclosure {
- enclosedUrl :: url
- enclosedSize :: Int
- enclosedMimeType :: Text
- data EntryCategory = EntryCategory {}
- data FeedEntry url = FeedEntry {
- feedEntryLink :: url
- feedEntryUpdated :: UTCTime
- feedEntryTitle :: Text
- feedEntryContent :: Html
- feedEntryEnclosure :: Maybe (EntryEnclosure url)
- feedEntryCategories :: [EntryCategory]
- combineScripts' :: Bool -> CombineSettings -> Name -> [Route Static] -> Q Exp
- combineStylesheets' :: Bool -> CombineSettings -> Name -> [Route Static] -> Q Exp
- base64md5 :: ByteString -> String
- staticFilesMergeMap :: FilePath -> Map FilePath FilePath -> Q [Dec]
- staticFilesMap :: FilePath -> Map FilePath FilePath -> Q [Dec]
- publicFiles :: FilePath -> Q [Dec]
- staticFilesList :: FilePath -> [FilePath] -> Q [Dec]
- staticFiles :: FilePath -> Q [Dec]
- embed :: FilePath -> Q Exp
- staticDevel :: FilePath -> IO Static
- static :: FilePath -> IO Static
- newtype Static = Static StaticSettings
- type StaticRoute = Route Static
- data CombineSettings
- (***) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c')
- (&&&) :: Arrow a => a b c -> a b c' -> a b (c, c')
- id :: forall (a :: k). Category cat => cat a a
- (.) :: forall (b :: k) (c :: k) (a :: k). Category cat => cat b c -> cat a b -> cat a c
- zip :: Zip f => f a -> f b -> f (a, b)
- unzip :: Zip f => f (a, b) -> (f a, f b)
- zipWith :: Zip f => (a -> b -> c) -> f a -> f b -> f c
- unzip3 :: Zip3 f => f (a, b, c) -> (f a, f b, f c)
- zip3 :: Zip3 f => f a -> f b -> f c -> f (a, b, c)
- zipWith3 :: Zip3 f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d
- unzip4 :: Zip4 f => f (a, b, c, d) -> (f a, f b, f c, f d)
- zip4 :: Zip4 f => f a -> f b -> f c -> f d -> f (a, b, c, d)
- zipWith4 :: Zip4 f => (a -> b -> c -> d -> e) -> f a -> f b -> f c -> f d -> f e
- unzip5 :: Zip5 f => f (a, b, c, d, e) -> (f a, f b, f c, f d, f e)
- zip5 :: Zip5 f => f a -> f b -> f c -> f d -> f e -> f (a, b, c, d, e)
- zipWith5 :: Zip5 f => (a -> b -> c -> d -> e -> g) -> f a -> f b -> f c -> f d -> f e -> f g
- unzip6 :: Zip6 f => f (a, b, c, d, e, g) -> (f a, f b, f c, f d, f e, f g)
- zip6 :: Zip6 f => f a -> f b -> f c -> f d -> f e -> f g -> f (a, b, c, d, e, g)
- zipWith6 :: Zip6 f => (a -> b -> c -> d -> e -> g -> h) -> f a -> f b -> f c -> f d -> f e -> f g -> f h
- unzip7 :: Zip7 f => f (a, b, c, d, e, g, h) -> (f a, f b, f c, f d, f e, f g, f h)
- zip7 :: Zip7 f => f a -> f b -> f c -> f d -> f e -> f g -> f h -> f (a, b, c, d, e, g, h)
- zipWith7 :: Zip7 f => (a -> b -> c -> d -> e -> g -> h -> i) -> f a -> f b -> f c -> f d -> f e -> f g -> f h -> f i
- preEscapedToMarkup :: ToMarkup a => a -> Markup
Documentation
fromIntegral :: (Integral a, Num b) => a -> b #
realToFrac :: (Real a, Fractional b) => a -> b #
guard :: Alternative f => Bool -> f () #
Instances
Methods
enumFromThen :: a -> a -> [a] #
enumFromTo :: a -> a -> [a] #
enumFromThenTo :: a -> a -> a -> [a] #
Instances
| Enum Bool | |
| Enum Char | |
| Enum Int | |
| Enum Int8 | |
| Enum Int16 | |
| Enum Int32 | |
| Enum Int64 | |
| Enum Integer | |
| Enum Natural | |
Defined in GHC.Enum Methods enumFrom :: Natural -> [Natural] # enumFromThen :: Natural -> Natural -> [Natural] # enumFromTo :: Natural -> Natural -> [Natural] # enumFromThenTo :: Natural -> Natural -> Natural -> [Natural] # | |
| Enum Ordering | |
| Enum Word | |
| Enum Word8 | |
| Enum Word16 | |
Defined in GHC.Word | |
| Enum Word32 | |
Defined in GHC.Word | |
| Enum Word64 | |
Defined in GHC.Word | |
| Enum VecCount | |
Defined in GHC.Enum Methods succ :: VecCount -> VecCount # pred :: VecCount -> VecCount # enumFrom :: VecCount -> [VecCount] # enumFromThen :: VecCount -> VecCount -> [VecCount] # enumFromTo :: VecCount -> VecCount -> [VecCount] # enumFromThenTo :: VecCount -> VecCount -> VecCount -> [VecCount] # | |
| Enum VecElem | |
Defined in GHC.Enum Methods enumFrom :: VecElem -> [VecElem] # enumFromThen :: VecElem -> VecElem -> [VecElem] # enumFromTo :: VecElem -> VecElem -> [VecElem] # enumFromThenTo :: VecElem -> VecElem -> VecElem -> [VecElem] # | |
| Enum () | |
| Enum SeekMode | |
| Enum IOMode | |
Defined in GHC.IO.IOMode | |
| Enum Day | |
| Enum ReleaseType | |
Defined in Data.Acquire.Internal Methods succ :: ReleaseType -> ReleaseType # pred :: ReleaseType -> ReleaseType # toEnum :: Int -> ReleaseType # fromEnum :: ReleaseType -> Int # enumFrom :: ReleaseType -> [ReleaseType] # enumFromThen :: ReleaseType -> ReleaseType -> [ReleaseType] # enumFromTo :: ReleaseType -> ReleaseType -> [ReleaseType] # enumFromThenTo :: ReleaseType -> ReleaseType -> ReleaseType -> [ReleaseType] # | |
| Enum Status | |
Defined in Network.HTTP.Types.Status | |
| Enum StdMethod | |
Defined in Network.HTTP.Types.Method Methods succ :: StdMethod -> StdMethod # pred :: StdMethod -> StdMethod # fromEnum :: StdMethod -> Int # enumFrom :: StdMethod -> [StdMethod] # enumFromThen :: StdMethod -> StdMethod -> [StdMethod] # enumFromTo :: StdMethod -> StdMethod -> [StdMethod] # enumFromThenTo :: StdMethod -> StdMethod -> StdMethod -> [StdMethod] # | |
| Enum IsolationLevel | |
Defined in Database.Persist.Sql.Types.Internal Methods succ :: IsolationLevel -> IsolationLevel # pred :: IsolationLevel -> IsolationLevel # toEnum :: Int -> IsolationLevel # fromEnum :: IsolationLevel -> Int # enumFrom :: IsolationLevel -> [IsolationLevel] # enumFromThen :: IsolationLevel -> IsolationLevel -> [IsolationLevel] # enumFromTo :: IsolationLevel -> IsolationLevel -> [IsolationLevel] # enumFromThenTo :: IsolationLevel -> IsolationLevel -> IsolationLevel -> [IsolationLevel] # | |
| Enum Checkmark | |
Defined in Database.Persist.Types.Base Methods succ :: Checkmark -> Checkmark # pred :: Checkmark -> Checkmark # fromEnum :: Checkmark -> Int # enumFrom :: Checkmark -> [Checkmark] # enumFromThen :: Checkmark -> Checkmark -> [Checkmark] # enumFromTo :: Checkmark -> Checkmark -> [Checkmark] # enumFromThenTo :: Checkmark -> Checkmark -> Checkmark -> [Checkmark] # | |
| Enum Enctype | |
| Enum CTime | |
Defined in Foreign.C.Types | |
| Enum CInt | |
Defined in Foreign.C.Types | |
| Enum CChar | |
Defined in Foreign.C.Types | |
| Enum CSize | |
Defined in Foreign.C.Types | |
| Enum DiffTime | |
Defined in Data.Time.Clock.Internal.DiffTime Methods succ :: DiffTime -> DiffTime # pred :: DiffTime -> DiffTime # enumFrom :: DiffTime -> [DiffTime] # enumFromThen :: DiffTime -> DiffTime -> [DiffTime] # enumFromTo :: DiffTime -> DiffTime -> [DiffTime] # enumFromThenTo :: DiffTime -> DiffTime -> DiffTime -> [DiffTime] # | |
| Enum NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods succ :: NominalDiffTime -> NominalDiffTime # pred :: NominalDiffTime -> NominalDiffTime # toEnum :: Int -> NominalDiffTime # fromEnum :: NominalDiffTime -> Int # enumFrom :: NominalDiffTime -> [NominalDiffTime] # enumFromThen :: NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] # enumFromTo :: NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] # enumFromThenTo :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] # | |
| Enum Associativity | |
Defined in GHC.Generics Methods succ :: Associativity -> Associativity # pred :: Associativity -> Associativity # toEnum :: Int -> Associativity # fromEnum :: Associativity -> Int # enumFrom :: Associativity -> [Associativity] # enumFromThen :: Associativity -> Associativity -> [Associativity] # enumFromTo :: Associativity -> Associativity -> [Associativity] # enumFromThenTo :: Associativity -> Associativity -> Associativity -> [Associativity] # | |
| Enum DecidedStrictness | |
Defined in GHC.Generics Methods succ :: DecidedStrictness -> DecidedStrictness # pred :: DecidedStrictness -> DecidedStrictness # toEnum :: Int -> DecidedStrictness # fromEnum :: DecidedStrictness -> Int # enumFrom :: DecidedStrictness -> [DecidedStrictness] # enumFromThen :: DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] # enumFromTo :: DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] # enumFromThenTo :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] # | |
| Enum SourceStrictness | |
Defined in GHC.Generics Methods succ :: SourceStrictness -> SourceStrictness # pred :: SourceStrictness -> SourceStrictness # toEnum :: Int -> SourceStrictness # fromEnum :: SourceStrictness -> Int # enumFrom :: SourceStrictness -> [SourceStrictness] # enumFromThen :: SourceStrictness -> SourceStrictness -> [SourceStrictness] # enumFromTo :: SourceStrictness -> SourceStrictness -> [SourceStrictness] # enumFromThenTo :: SourceStrictness -> SourceStrictness -> SourceStrictness -> [SourceStrictness] # | |
| Enum SourceUnpackedness | |
Defined in GHC.Generics Methods succ :: SourceUnpackedness -> SourceUnpackedness # pred :: SourceUnpackedness -> SourceUnpackedness # toEnum :: Int -> SourceUnpackedness # fromEnum :: SourceUnpackedness -> Int # enumFrom :: SourceUnpackedness -> [SourceUnpackedness] # enumFromThen :: SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] # enumFromTo :: SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] # enumFromThenTo :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] # | |
| Enum CBool | |
Defined in Foreign.C.Types | |
| Enum CClock | |
Defined in Foreign.C.Types | |
| Enum CDouble | |
Defined in Foreign.C.Types Methods enumFrom :: CDouble -> [CDouble] # enumFromThen :: CDouble -> CDouble -> [CDouble] # enumFromTo :: CDouble -> CDouble -> [CDouble] # enumFromThenTo :: CDouble -> CDouble -> CDouble -> [CDouble] # | |
| Enum CFloat | |
Defined in Foreign.C.Types | |
| Enum CIntMax | |
Defined in Foreign.C.Types Methods enumFrom :: CIntMax -> [CIntMax] # enumFromThen :: CIntMax -> CIntMax -> [CIntMax] # enumFromTo :: CIntMax -> CIntMax -> [CIntMax] # enumFromThenTo :: CIntMax -> CIntMax -> CIntMax -> [CIntMax] # | |
| Enum CIntPtr | |
Defined in Foreign.C.Types Methods enumFrom :: CIntPtr -> [CIntPtr] # enumFromThen :: CIntPtr -> CIntPtr -> [CIntPtr] # enumFromTo :: CIntPtr -> CIntPtr -> [CIntPtr] # enumFromThenTo :: CIntPtr -> CIntPtr -> CIntPtr -> [CIntPtr] # | |
| Enum CLLong | |
Defined in Foreign.C.Types | |
| Enum CLong | |
Defined in Foreign.C.Types | |
| Enum CPtrdiff | |
Defined in Foreign.C.Types Methods succ :: CPtrdiff -> CPtrdiff # pred :: CPtrdiff -> CPtrdiff # enumFrom :: CPtrdiff -> [CPtrdiff] # enumFromThen :: CPtrdiff -> CPtrdiff -> [CPtrdiff] # enumFromTo :: CPtrdiff -> CPtrdiff -> [CPtrdiff] # enumFromThenTo :: CPtrdiff -> CPtrdiff -> CPtrdiff -> [CPtrdiff] # | |
| Enum CSChar | |
Defined in Foreign.C.Types | |
| Enum CSUSeconds | |
Defined in Foreign.C.Types Methods succ :: CSUSeconds -> CSUSeconds # pred :: CSUSeconds -> CSUSeconds # fromEnum :: CSUSeconds -> Int # enumFrom :: CSUSeconds -> [CSUSeconds] # enumFromThen :: CSUSeconds -> CSUSeconds -> [CSUSeconds] # enumFromTo :: CSUSeconds -> CSUSeconds -> [CSUSeconds] # enumFromThenTo :: CSUSeconds -> CSUSeconds -> CSUSeconds -> [CSUSeconds] # | |
| Enum CShort | |
Defined in Foreign.C.Types | |
| Enum CSigAtomic | |
Defined in Foreign.C.Types Methods succ :: CSigAtomic -> CSigAtomic # pred :: CSigAtomic -> CSigAtomic # fromEnum :: CSigAtomic -> Int # enumFrom :: CSigAtomic -> [CSigAtomic] # enumFromThen :: CSigAtomic -> CSigAtomic -> [CSigAtomic] # enumFromTo :: CSigAtomic -> CSigAtomic -> [CSigAtomic] # enumFromThenTo :: CSigAtomic -> CSigAtomic -> CSigAtomic -> [CSigAtomic] # | |
| Enum CUChar | |
Defined in Foreign.C.Types | |
| Enum CUInt | |
Defined in Foreign.C.Types | |
| Enum CUIntMax | |
Defined in Foreign.C.Types Methods succ :: CUIntMax -> CUIntMax # pred :: CUIntMax -> CUIntMax # enumFrom :: CUIntMax -> [CUIntMax] # enumFromThen :: CUIntMax -> CUIntMax -> [CUIntMax] # enumFromTo :: CUIntMax -> CUIntMax -> [CUIntMax] # enumFromThenTo :: CUIntMax -> CUIntMax -> CUIntMax -> [CUIntMax] # | |
| Enum CUIntPtr | |
Defined in Foreign.C.Types Methods succ :: CUIntPtr -> CUIntPtr # pred :: CUIntPtr -> CUIntPtr # enumFrom :: CUIntPtr -> [CUIntPtr] # enumFromThen :: CUIntPtr -> CUIntPtr -> [CUIntPtr] # enumFromTo :: CUIntPtr -> CUIntPtr -> [CUIntPtr] # enumFromThenTo :: CUIntPtr -> CUIntPtr -> CUIntPtr -> [CUIntPtr] # | |
| Enum CULLong | |
Defined in Foreign.C.Types Methods enumFrom :: CULLong -> [CULLong] # enumFromThen :: CULLong -> CULLong -> [CULLong] # enumFromTo :: CULLong -> CULLong -> [CULLong] # enumFromThenTo :: CULLong -> CULLong -> CULLong -> [CULLong] # | |
| Enum CULong | |
Defined in Foreign.C.Types | |
| Enum CUSeconds | |
Defined in Foreign.C.Types Methods succ :: CUSeconds -> CUSeconds # pred :: CUSeconds -> CUSeconds # fromEnum :: CUSeconds -> Int # enumFrom :: CUSeconds -> [CUSeconds] # enumFromThen :: CUSeconds -> CUSeconds -> [CUSeconds] # enumFromTo :: CUSeconds -> CUSeconds -> [CUSeconds] # enumFromThenTo :: CUSeconds -> CUSeconds -> CUSeconds -> [CUSeconds] # | |
| Enum CUShort | |
Defined in Foreign.C.Types Methods enumFrom :: CUShort -> [CUShort] # enumFromThen :: CUShort -> CUShort -> [CUShort] # enumFromTo :: CUShort -> CUShort -> [CUShort] # enumFromThenTo :: CUShort -> CUShort -> CUShort -> [CUShort] # | |
| Enum CWchar | |
Defined in Foreign.C.Types | |
| Enum Encoding | |
Defined in Basement.String Methods succ :: Encoding -> Encoding # pred :: Encoding -> Encoding # enumFrom :: Encoding -> [Encoding] # enumFromThen :: Encoding -> Encoding -> [Encoding] # enumFromTo :: Encoding -> Encoding -> [Encoding] # enumFromThenTo :: Encoding -> Encoding -> Encoding -> [Encoding] # | |
| Enum UTF32_Invalid | |
Defined in Basement.String.Encoding.UTF32 Methods succ :: UTF32_Invalid -> UTF32_Invalid # pred :: UTF32_Invalid -> UTF32_Invalid # toEnum :: Int -> UTF32_Invalid # fromEnum :: UTF32_Invalid -> Int # enumFrom :: UTF32_Invalid -> [UTF32_Invalid] # enumFromThen :: UTF32_Invalid -> UTF32_Invalid -> [UTF32_Invalid] # enumFromTo :: UTF32_Invalid -> UTF32_Invalid -> [UTF32_Invalid] # enumFromThenTo :: UTF32_Invalid -> UTF32_Invalid -> UTF32_Invalid -> [UTF32_Invalid] # | |
| Enum CryptoError | |
Defined in Crypto.Error.Types Methods succ :: CryptoError -> CryptoError # pred :: CryptoError -> CryptoError # toEnum :: Int -> CryptoError # fromEnum :: CryptoError -> Int # enumFrom :: CryptoError -> [CryptoError] # enumFromThen :: CryptoError -> CryptoError -> [CryptoError] # enumFromTo :: CryptoError -> CryptoError -> [CryptoError] # enumFromThenTo :: CryptoError -> CryptoError -> CryptoError -> [CryptoError] # | |
| Enum CompressionStrategy | |
Defined in Codec.Compression.Zlib.Stream Methods succ :: CompressionStrategy -> CompressionStrategy # pred :: CompressionStrategy -> CompressionStrategy # toEnum :: Int -> CompressionStrategy # fromEnum :: CompressionStrategy -> Int # enumFrom :: CompressionStrategy -> [CompressionStrategy] # enumFromThen :: CompressionStrategy -> CompressionStrategy -> [CompressionStrategy] # enumFromTo :: CompressionStrategy -> CompressionStrategy -> [CompressionStrategy] # enumFromThenTo :: CompressionStrategy -> CompressionStrategy -> CompressionStrategy -> [CompressionStrategy] # | |
| Enum Format | |
Defined in Codec.Compression.Zlib.Stream | |
| Enum Method | |
Defined in Codec.Compression.Zlib.Stream | |
| Enum IP | |
Defined in Data.IP.Addr | |
| Enum IPv4 | |
Defined in Data.IP.Addr | |
| Enum IPv6 | |
Defined in Data.IP.Addr | |
| Enum PortNumber | |
Defined in Network.Socket.Types Methods succ :: PortNumber -> PortNumber # pred :: PortNumber -> PortNumber # fromEnum :: PortNumber -> Int # enumFrom :: PortNumber -> [PortNumber] # enumFromThen :: PortNumber -> PortNumber -> [PortNumber] # enumFromTo :: PortNumber -> PortNumber -> [PortNumber] # enumFromThenTo :: PortNumber -> PortNumber -> PortNumber -> [PortNumber] # | |
| Enum VarType | |
Defined in Text.Shakespeare Methods enumFrom :: VarType -> [VarType] # enumFromThen :: VarType -> VarType -> [VarType] # enumFromTo :: VarType -> VarType -> [VarType] # enumFromThenTo :: VarType -> VarType -> VarType -> [VarType] # | |
| Integral a => Enum (Ratio a) | |
Defined in GHC.Real Methods enumFrom :: Ratio a -> [Ratio a] # enumFromThen :: Ratio a -> Ratio a -> [Ratio a] # enumFromTo :: Ratio a -> Ratio a -> [Ratio a] # enumFromThenTo :: Ratio a -> Ratio a -> Ratio a -> [Ratio a] # | |
| Enum a => Enum (WrappedMonoid a) | |
Defined in Data.Semigroup Methods succ :: WrappedMonoid a -> WrappedMonoid a # pred :: WrappedMonoid a -> WrappedMonoid a # toEnum :: Int -> WrappedMonoid a # fromEnum :: WrappedMonoid a -> Int # enumFrom :: WrappedMonoid a -> [WrappedMonoid a] # enumFromThen :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # enumFromTo :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # enumFromThenTo :: WrappedMonoid a -> WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # | |
| Enum a => Enum (Identity a) | |
Defined in Data.Functor.Identity Methods succ :: Identity a -> Identity a # pred :: Identity a -> Identity a # fromEnum :: Identity a -> Int # enumFrom :: Identity a -> [Identity a] # enumFromThen :: Identity a -> Identity a -> [Identity a] # enumFromTo :: Identity a -> Identity a -> [Identity a] # enumFromThenTo :: Identity a -> Identity a -> Identity a -> [Identity a] # | |
| Enum (Offset ty) | |
Defined in Basement.Types.OffsetSize Methods succ :: Offset ty -> Offset ty # pred :: Offset ty -> Offset ty # fromEnum :: Offset ty -> Int # enumFrom :: Offset ty -> [Offset ty] # enumFromThen :: Offset ty -> Offset ty -> [Offset ty] # enumFromTo :: Offset ty -> Offset ty -> [Offset ty] # enumFromThenTo :: Offset ty -> Offset ty -> Offset ty -> [Offset ty] # | |
| Enum (CountOf ty) | |
Defined in Basement.Types.OffsetSize Methods succ :: CountOf ty -> CountOf ty # pred :: CountOf ty -> CountOf ty # fromEnum :: CountOf ty -> Int # enumFrom :: CountOf ty -> [CountOf ty] # enumFromThen :: CountOf ty -> CountOf ty -> [CountOf ty] # enumFromTo :: CountOf ty -> CountOf ty -> [CountOf ty] # enumFromThenTo :: CountOf ty -> CountOf ty -> CountOf ty -> [CountOf ty] # | |
| Enum a => Enum (First a) | |
Defined in Data.Semigroup Methods enumFrom :: First a -> [First a] # enumFromThen :: First a -> First a -> [First a] # enumFromTo :: First a -> First a -> [First a] # enumFromThenTo :: First a -> First a -> First a -> [First a] # | |
| Enum a => Enum (Last a) | |
Defined in Data.Semigroup | |
| Enum a => Enum (Max a) | |
Defined in Data.Semigroup | |
| Enum a => Enum (Min a) | |
Defined in Data.Semigroup | |
| Enum a => Enum (Tagged s a) | |
Defined in Data.Tagged Methods succ :: Tagged s a -> Tagged s a # pred :: Tagged s a -> Tagged s a # fromEnum :: Tagged s a -> Int # enumFrom :: Tagged s a -> [Tagged s a] # enumFromThen :: Tagged s a -> Tagged s a -> [Tagged s a] # enumFromTo :: Tagged s a -> Tagged s a -> [Tagged s a] # enumFromThenTo :: Tagged s a -> Tagged s a -> Tagged s a -> [Tagged s a] # | |
| Enum (f a) => Enum (Alt f a) | |
Defined in Data.Semigroup.Internal Methods enumFrom :: Alt f a -> [Alt f a] # enumFromThen :: Alt f a -> Alt f a -> [Alt f a] # enumFromTo :: Alt f a -> Alt f a -> [Alt f a] # enumFromThenTo :: Alt f a -> Alt f a -> Alt f a -> [Alt f a] # | |
Instances
| Eq Bool | |
| Eq Char | |
| Eq Double | |
| Eq Float | |
| Eq Int | |
| Eq Int8 | |
| Eq Int16 | |
| Eq Int32 | |
| Eq Int64 | |
| Eq Integer | |
| Eq Natural | |
| Eq Ordering | |
| Eq Word | |
| Eq Word8 | |
| Eq Word16 | |
| Eq Word32 | |
| Eq Word64 | |
| Eq SomeTypeRep | |
| Eq Exp | |
| Eq Match | |
| Eq Clause | |
| Eq Pat | |
| Eq Type | |
| Eq Dec | |
| Eq Name | |
| Eq FunDep | |
| Eq InjectivityAnn | |
| Eq Overlap | |
| Eq () | |
| Eq TyCon | |
| Eq Module | |
| Eq TrName | |
| Eq Con | |
| Eq ByteString | |
Defined in Data.ByteString.Internal | |
| Eq ByteString | |
| Eq Builder | |
| Eq Scientific | |
| Eq UTCTime | |
| Eq JSONPathElement | |
Defined in Data.Aeson.Types.Internal Methods (==) :: JSONPathElement -> JSONPathElement -> Bool # (/=) :: JSONPathElement -> JSONPathElement -> Bool # | |
| Eq Value | |
| Eq DotNetTime | |
Defined in Data.Aeson.Types.Internal | |
| Eq SumEncoding | |
Defined in Data.Aeson.Types.Internal | |
| Eq BufferMode | |
Defined in GHC.IO.Handle.Types | |
| Eq SeekMode | |
| Eq IOMode | |
| Eq ConcException | |
Defined in UnliftIO.Internals.Async Methods (==) :: ConcException -> ConcException -> Bool # (/=) :: ConcException -> ConcException -> Bool # | |
| Eq Handle | |
| Eq Day | |
| Eq IOException | |
Defined in GHC.IO.Exception | |
| Eq IntSet | |
| Eq IOErrorType | |
Defined in GHC.IO.Exception | |
| Eq ReleaseType | |
Defined in Data.Acquire.Internal | |
| Eq Void | |
| Eq StreamFileStatus | |
Defined in Network.HTTP.Client.Types Methods (==) :: StreamFileStatus -> StreamFileStatus -> Bool # (/=) :: StreamFileStatus -> StreamFileStatus -> Bool # | |
| Eq ResponseTimeout | |
Defined in Network.HTTP.Client.Types Methods (==) :: ResponseTimeout -> ResponseTimeout -> Bool # (/=) :: ResponseTimeout -> ResponseTimeout -> Bool # | |
| Eq Proxy | |
| Eq CookieJar | |
| Eq Cookie | |
| Eq HttpVersion | |
Defined in Network.HTTP.Types.Version | |
| Eq EscapeItem | |
Defined in Network.HTTP.Types.URI | |
| Eq Status | |
| Eq StdMethod | |
| Eq ByteRange | |
| Eq Token | |
| Eq Column | |
| Eq IsolationLevel | |
Defined in Database.Persist.Sql.Types.Internal Methods (==) :: IsolationLevel -> IsolationLevel -> Bool # (/=) :: IsolationLevel -> IsolationLevel -> Bool # | |
| Eq Checkmark | |
| Eq IsNullable | |
Defined in Database.Persist.Types.Base | |
| Eq WhyNullable | |
Defined in Database.Persist.Types.Base | |
| Eq EntityDef | |
| Eq HaskellName | |
Defined in Database.Persist.Types.Base | |
| Eq DBName | |
| Eq FieldType | |
| Eq FieldDef | |
| Eq ReferenceDef | |
Defined in Database.Persist.Types.Base | |
| Eq EmbedEntityDef | |
Defined in Database.Persist.Types.Base Methods (==) :: EmbedEntityDef -> EmbedEntityDef -> Bool # (/=) :: EmbedEntityDef -> EmbedEntityDef -> Bool # | |
| Eq EmbedFieldDef | |
Defined in Database.Persist.Types.Base Methods (==) :: EmbedFieldDef -> EmbedFieldDef -> Bool # (/=) :: EmbedFieldDef -> EmbedFieldDef -> Bool # | |
| Eq UniqueDef | |
| Eq CompositeDef | |
Defined in Database.Persist.Types.Base | |
| Eq ForeignDef | |
Defined in Database.Persist.Types.Base | |
| Eq PersistValue | |
Defined in Database.Persist.Types.Base | |
| Eq SqlType | |
| Eq FormMessage | |
Defined in Yesod.Form.Types | |
| Eq Enctype | |
| Eq Textarea | |
| Eq Header | |
| Eq ErrorResponse | |
Defined in Yesod.Core.Types Methods (==) :: ErrorResponse -> ErrorResponse -> Bool # (/=) :: ErrorResponse -> ErrorResponse -> Bool # | |
| Eq AuthResult | |
Defined in Yesod.Core.Types | |
| Eq LogLevel | |
| Eq NameFlavour | |
| Eq CTime | |
| Eq All | |
| Eq SrcLoc | |
| Eq Any | |
| Eq OccName | |
| Eq Body | |
| Eq Lit | |
| Eq URIAuth | |
| Eq ResponseClose | |
| Eq URI | |
| Eq AddrInfo | |
| Eq AddrInfoFlag | |
| Eq NameInfoFlag | |
| Eq Family | |
| Eq SockAddr | |
| Eq CInt | |
| Eq SocketType | |
| Eq CChar | |
| Eq CSize | |
| Eq More | |
| Eq Pos | |
| Eq DiffTime | |
| Eq TimeLocale | |
| Eq LocalTime | |
| Eq NominalDiffTime | |
| Eq TimeOfDay | |
| Eq SpecConstrAnnotation | |
| Eq Version | |
| Eq Associativity | |
| Eq DecidedStrictness | |
| Eq Fixity | |
| Eq SourceStrictness | |
| Eq SourceUnpackedness | |
| Eq Mode | |
| Eq Style | |
| Eq TextDetails | |
| Eq Doc | |
| Eq ByteArray | |
| Eq ThreadId | |
| Eq CBool | |
| Eq CClock | |
| Eq CDouble | |
| Eq CFloat | |
| Eq CIntMax | |
| Eq CIntPtr | |
| Eq CLLong | |
| Eq CLong | |
| Eq CPtrdiff | |
| Eq CSChar | |
| Eq CSUSeconds | |
| Eq CShort | |
| Eq CSigAtomic | |
| Eq CUChar | |
| Eq CUInt | |
| Eq CUIntMax | |
| Eq CUIntPtr | |
| Eq CULLong | |
| Eq CULong | |
| Eq CUSeconds | |
| Eq CUShort | |
| Eq CWchar | |
| Eq Encoding | |
| Eq String | |
| Eq ASCII7_Invalid | |
| Eq ISO_8859_1_Invalid | |
| Eq UTF16_Invalid | |
| Eq UTF32_Invalid | |
| Eq FileSize | |
| Eq SharedSecret | |
| Eq CryptoError | |
| Eq ConnHost | |
| Eq ConnKey | |
| Eq StatusHeaders | |
| Eq CompressionLevel | |
| Eq CompressionStrategy | |
| Eq DictionaryHash | |
| Eq Format | |
| Eq MemoryLevel | |
| Eq Method | |
| Eq WindowBits | |
| Eq LogStr | |
| Eq Loc | |
| Eq UUID | |
| Eq UnpackedUUID | |
| Eq EmailAddress | |
| Eq IP | |
| Eq IPv4 | |
| Eq IPv6 | |
| Eq PortNumber | |
| Eq IPRange | |
| Eq Content | |
| Eq VarType | |
| Eq Content | |
| Eq ClientSessionDateCache | |
| Eq SetCookie | |
| Eq Content | |
| Eq Doctype | |
| Eq Document | |
| Eq Element | |
| Eq Event | |
| Eq ExternalID | |
| Eq Instruction | |
| Eq Miscellaneous | |
| Eq Name | |
| Eq Node | |
| Eq Prologue | |
| Eq BigNat | |
| Eq ArrayException | |
| Eq AsyncException | |
| Eq ExitCode | |
| Eq ArithException | |
| Eq BlockReason | |
| Eq ThreadStatus | |
| Eq MaskingState | |
| Eq Newline | |
| Eq NewlineMode | |
| Eq IODeviceType | |
| Eq AsyncCancelled | |
| Eq Socket | |
| Eq SameSiteOption | |
| Eq SomeSymbol | |
| Eq AnnLookup | |
| Eq AnnTarget | |
| Eq Bang | |
| Eq Callconv | |
| Eq DecidedStrictness | |
| Eq DerivClause | |
| Eq DerivStrategy | |
| Eq FamilyResultSig | |
| Eq Fixity | |
| Eq FixityDirection | |
| Eq Foreign | |
| Eq Guard | |
| Eq Info | |
| Eq Inline | |
| Eq ModName | |
| Eq Module | |
| Eq ModuleInfo | |
| Eq NameSpace | |
| Eq PatSynArgs | |
| Eq PatSynDir | |
| Eq Phases | |
| Eq PkgName | |
| Eq Pragma | |
| Eq Range | |
| Eq Role | |
| Eq RuleBndr | |
| Eq RuleMatch | |
| Eq Safety | |
| Eq SourceStrictness | |
| Eq SourceUnpackedness | |
| Eq Stmt | |
| Eq TyLit | |
| Eq TySynEqn | |
| Eq TyVarBndr | |
| Eq TypeFamilyHead | |
| Eq LinesWithComments | |
| Eq Content | |
| Eq Doc | |
| Eq Bound | |
| Eq Key | |
| Eq IV | |
| Eq Etag | |
| Eq Binding | |
| Eq DataConstr | |
| Eq Module | |
| Eq Line | |
| Eq TypeTree | |
| Eq AbsoluteSize | |
| Eq AbsoluteUnit | |
| Eq EmSize | |
| Eq ExSize | |
| Eq PercentageSize | |
| Eq PixelSize | |
| Eq a => Eq [a] | |
| Eq a => Eq (Maybe a) | |
| Eq a => Eq (Ratio a) | |
| Eq p => Eq (Par1 p) | |
| Eq (Encoding' a) | |
| Eq a => Eq (IResult a) | |
| Eq a => Eq (Result a) | |
| Eq (Chan a) | |
| Eq (MVar a) | |
| Eq (TVar a) | |
| Eq (TBQueue a) | |
| Eq (TChan a) | |
| Eq (TMVar a) | |
| Eq (TQueue a) | |
| Eq (IORef a) | |
| Eq mono => Eq (NonNull mono) | |
| Eq (Async a) | |
| Eq m => Eq (WrappedMonoid m) | |
Defined in Data.Semigroup Methods (==) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (/=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # | |
| Eq a => Eq (Identity a) | |
| Eq a => Eq (DList a) | |
| Eq a => Eq (HashSet a) | |
| Eq a => Eq (Vector a) | |
| Eq a => Eq (Down a) | |
| Eq a => Eq (Set a) | |
| Eq a => Eq (IntMap a) | |
| Eq a => Eq (Seq a) | |
| Eq a => Eq (Flush a) | |
| Eq body => Eq (Response body) | |
| Eq a => Eq (NonEmpty a) | |
| Eq (f Text) => Eq (Line' f) | |
| Eq a => Eq (Single a) | |
| (Eq (Key record), Eq record) => Eq (Entity record) | |
| Eq a => Eq (FormResult a) | |
Defined in Yesod.Form.Types | |
| Eq (Route WaiSubsiteWithAuth) | |
Defined in Yesod.Core.Types Methods (==) :: Route WaiSubsiteWithAuth -> Route WaiSubsiteWithAuth -> Bool # (/=) :: Route WaiSubsiteWithAuth -> Route WaiSubsiteWithAuth -> Bool # | |
| Eq (Route WaiSubsite) | |
Defined in Yesod.Core.Types Methods (==) :: Route WaiSubsite -> Route WaiSubsite -> Bool # (/=) :: Route WaiSubsite -> Route WaiSubsite -> Bool # | |
| Eq (Route LiteApp) | |
| Eq (Route Static) | |
| Eq (Digest a) | |
| Eq a => Eq (Option a) | |
| (Prim a, Eq a) => Eq (Vector a) | |
| (Storable a, Eq a) => Eq (Vector a) | |
| Eq s => Eq (CI s) | |
| (PrimType ty, Eq ty) => Eq (UArray ty) | |
| Eq (Offset ty) | |
| Eq (CountOf ty) | |
| (PrimType ty, Eq ty) => Eq (Block ty) | |
| Eq a => Eq (NonEmpty a) | |
| Eq a => Eq (Dual a) | |
| Eq a => Eq (Product a) | |
| Eq a => Eq (Sum a) | |
| Eq a => Eq (ZipList a) | |
| Eq a => Eq (ViewL a) | |
| Eq a => Eq (ViewR a) | |
| Eq a => Eq (AnnotDetails a) | |
| Eq (Doc a) | |
| Eq a => Eq (Span a) | |
| Eq a => Eq (Array a) | |
| (Eq a, Prim a) => Eq (PrimArray a) | |
| Eq a => Eq (SmallArray a) | |
| Eq a => Eq (First a) | |
| Eq a => Eq (Last a) | |
| Eq a => Eq (Max a) | |
| Eq a => Eq (Min a) | |
| Eq (Zn n) | |
| Eq (Zn64 n) | |
| Eq a => Eq (CryptoFailable a) | |
| Eq a => Eq (AddrRange a) | |
| Eq c => Eq (FileInfo c) | |
| Eq url => Eq (Script url) | |
| Eq url => Eq (Stylesheet url) | |
| Eq url => Eq (Location url) | |
| Eq a => Eq (Hashed a) | |
| Eq v => Eq (Result v) | |
| (Eq a, Eq b) => Eq (Either a b) | |
| Eq (V1 p) | |
| Eq (U1 p) | |
| Eq (TypeRep a) | |
| (Eq a, Eq b) => Eq (a, b) | |
| (Eq k, Eq v) => Eq (HashMap k v) | |
| (Eq k, Eq a) => Eq (Map k a) | |
| Eq (MutVar s a) | |
| Eq (STRef s a) | |
| Eq a => Eq (Arg a b) | |
| (Eq k, Eq v) => Eq (Leaf k v) | |
| (Eq1 f, Eq a) => Eq (Cofree f a) | |
| (Eq1 f, Eq a) => Eq (Free f a) | |
| (Eq1 m, Eq a) => Eq (MaybeT m a) | |
| Eq (MutableArray s a) | |
| Eq (SmallMutableArray s a) | |
| Eq (f p) => Eq (Rec1 f p) | |
| Eq (URec (Ptr ()) p) | |
| Eq (URec Char p) | |
| Eq (URec Double p) | |
| Eq (URec Float p) | |
| Eq (URec Int p) | |
| Eq (URec Word p) | |
| (Eq a, Eq b, Eq c) => Eq (a, b, c) | |
| (Eq w, Eq1 m, Eq a) => Eq (WriterT w m a) | |
| Eq b => Eq (Tagged s b) | |
| (Eq e, Eq1 m, Eq a) => Eq (ErrorT e m a) | |
| Eq (p a a) => Eq (Join p a) | |
| (Eq1 f, Eq1 m, Eq a) => Eq (FreeT f m a) | |
| (Eq a, Eq (f b)) => Eq (FreeF f a b) | |
| (Eq w, Eq1 m, Eq a) => Eq (WriterT w m a) | |
| Eq (f a) => Eq (Alt f a) | |
| (Eq e, Eq1 m, Eq a) => Eq (ExceptT e m a) | |
| Eq c => Eq (K1 i c p) | |
| (Eq (f p), Eq (g p)) => Eq ((f :+: g) p) | |
| (Eq (f p), Eq (g p)) => Eq ((f :*: g) p) | |
| (Eq a, Eq b, Eq c, Eq d) => Eq (a, b, c, d) | |
| Eq (f p) => Eq (M1 i c f p) | |
| Eq (f (g p)) => Eq ((f :.: g) p) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (a, b, c, d, e) | |
| Eq (f a) => Eq (Clown f a b) | |
| Eq (p b a) => Eq (Flip p a b) | |
| Eq (g b) => Eq (Joker g a b) | |
| Eq (p a b) => Eq (WrappedBifunctor p a b) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq (a, b, c, d, e, f) | |
| (Eq (f a b), Eq (g a b)) => Eq (Product f g a b) | |
| (Eq (p a b), Eq (q a b)) => Eq (Sum p q a b) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq (a, b, c, d, e, f, g) | |
| Eq (f (p a b)) => Eq (Tannen f p a b) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h) => Eq (a, b, c, d, e, f, g, h) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i) => Eq (a, b, c, d, e, f, g, h, i) | |
| Eq (p (f a) (g b)) => Eq (Biff p f g a b) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j) => Eq (a, b, c, d, e, f, g, h, i, j) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k) => Eq (a, b, c, d, e, f, g, h, i, j, k) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l) => Eq (a, b, c, d, e, f, g, h, i, j, k, l) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n, Eq o) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | |
class Fractional a => Floating a where #
Minimal complete definition
pi, exp, log, sin, cos, asin, acos, atan, sinh, cosh, asinh, acosh, atanh
Methods
Instances
| Floating Double | |
| Floating Float | |
| Floating CDouble | |
| Floating CFloat | |
| Floating a => Floating (Identity a) | |
Defined in Data.Functor.Identity Methods exp :: Identity a -> Identity a # log :: Identity a -> Identity a # sqrt :: Identity a -> Identity a # (**) :: Identity a -> Identity a -> Identity a # logBase :: Identity a -> Identity a -> Identity a # sin :: Identity a -> Identity a # cos :: Identity a -> Identity a # tan :: Identity a -> Identity a # asin :: Identity a -> Identity a # acos :: Identity a -> Identity a # atan :: Identity a -> Identity a # sinh :: Identity a -> Identity a # cosh :: Identity a -> Identity a # tanh :: Identity a -> Identity a # asinh :: Identity a -> Identity a # acosh :: Identity a -> Identity a # atanh :: Identity a -> Identity a # log1p :: Identity a -> Identity a expm1 :: Identity a -> Identity a | |
| Floating a => Floating (Tagged s a) | |
Defined in Data.Tagged Methods exp :: Tagged s a -> Tagged s a # log :: Tagged s a -> Tagged s a # sqrt :: Tagged s a -> Tagged s a # (**) :: Tagged s a -> Tagged s a -> Tagged s a # logBase :: Tagged s a -> Tagged s a -> Tagged s a # sin :: Tagged s a -> Tagged s a # cos :: Tagged s a -> Tagged s a # tan :: Tagged s a -> Tagged s a # asin :: Tagged s a -> Tagged s a # acos :: Tagged s a -> Tagged s a # atan :: Tagged s a -> Tagged s a # sinh :: Tagged s a -> Tagged s a # cosh :: Tagged s a -> Tagged s a # tanh :: Tagged s a -> Tagged s a # asinh :: Tagged s a -> Tagged s a # acosh :: Tagged s a -> Tagged s a # atanh :: Tagged s a -> Tagged s a # log1p :: Tagged s a -> Tagged s a expm1 :: Tagged s a -> Tagged s a log1pexp :: Tagged s a -> Tagged s a log1mexp :: Tagged s a -> Tagged s a | |
class Num a => Fractional a where #
Minimal complete definition
fromRational, (recip | (/))
Instances
| Fractional Scientific | |
Defined in Data.Scientific | |
| Fractional DiffTime | |
Defined in Data.Time.Clock.Internal.DiffTime | |
| Fractional NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime | |
| Fractional CDouble | |
Defined in Foreign.C.Types | |
| Fractional CFloat | |
Defined in Foreign.C.Types | |
| Fractional AbsoluteSize | |
Defined in Text.Internal.CssCommon | |
| Fractional EmSize | |
Defined in Text.Internal.CssCommon | |
| Fractional ExSize | |
Defined in Text.Internal.CssCommon | |
| Fractional PercentageSize | |
Defined in Text.Internal.CssCommon | |
| Fractional PixelSize | |
Defined in Text.Internal.CssCommon | |
| Integral a => Fractional (Ratio a) | |
| Fractional a => Fractional (Identity a) | |
| Fractional a => Fractional (Tagged s a) | |
Defined in Data.Tagged | |
class (Real a, Enum a) => Integral a where #
Methods
Instances
| Integral Int | |
| Integral Int8 | |
| Integral Int16 | |
| Integral Int32 | |
| Integral Int64 | |
| Integral Integer | |
Defined in GHC.Real | |
| Integral Natural | |
Defined in GHC.Real | |
| Integral Word | |
| Integral Word8 | |
| Integral Word16 | |
| Integral Word32 | |
| Integral Word64 | |
| Integral CInt | |
| Integral CChar | |
| Integral CSize | |
| Integral CBool | |
| Integral CIntMax | |
Defined in Foreign.C.Types | |
| Integral CIntPtr | |
Defined in Foreign.C.Types | |
| Integral CLLong | |
Defined in Foreign.C.Types | |
| Integral CLong | |
| Integral CPtrdiff | |
Defined in Foreign.C.Types | |
| Integral CSChar | |
Defined in Foreign.C.Types | |
| Integral CShort | |
Defined in Foreign.C.Types | |
| Integral CSigAtomic | |
Defined in Foreign.C.Types Methods quot :: CSigAtomic -> CSigAtomic -> CSigAtomic # rem :: CSigAtomic -> CSigAtomic -> CSigAtomic # div :: CSigAtomic -> CSigAtomic -> CSigAtomic # mod :: CSigAtomic -> CSigAtomic -> CSigAtomic # quotRem :: CSigAtomic -> CSigAtomic -> (CSigAtomic, CSigAtomic) # divMod :: CSigAtomic -> CSigAtomic -> (CSigAtomic, CSigAtomic) # | |
| Integral CUChar | |
Defined in Foreign.C.Types | |
| Integral CUInt | |
| Integral CUIntMax | |
Defined in Foreign.C.Types | |
| Integral CUIntPtr | |
Defined in Foreign.C.Types | |
| Integral CULLong | |
Defined in Foreign.C.Types | |
| Integral CULong | |
Defined in Foreign.C.Types | |
| Integral CUShort | |
Defined in Foreign.C.Types | |
| Integral CWchar | |
Defined in Foreign.C.Types | |
| Integral PortNumber | |
Defined in Network.Socket.Types Methods quot :: PortNumber -> PortNumber -> PortNumber # rem :: PortNumber -> PortNumber -> PortNumber # div :: PortNumber -> PortNumber -> PortNumber # mod :: PortNumber -> PortNumber -> PortNumber # quotRem :: PortNumber -> PortNumber -> (PortNumber, PortNumber) # divMod :: PortNumber -> PortNumber -> (PortNumber, PortNumber) # | |
| Integral a => Integral (Identity a) | |
Defined in Data.Functor.Identity Methods quot :: Identity a -> Identity a -> Identity a # rem :: Identity a -> Identity a -> Identity a # div :: Identity a -> Identity a -> Identity a # mod :: Identity a -> Identity a -> Identity a # quotRem :: Identity a -> Identity a -> (Identity a, Identity a) # divMod :: Identity a -> Identity a -> (Identity a, Identity a) # | |
| Integral a => Integral (Tagged s a) | |
Defined in Data.Tagged Methods quot :: Tagged s a -> Tagged s a -> Tagged s a # rem :: Tagged s a -> Tagged s a -> Tagged s a # div :: Tagged s a -> Tagged s a -> Tagged s a # mod :: Tagged s a -> Tagged s a -> Tagged s a # quotRem :: Tagged s a -> Tagged s a -> (Tagged s a, Tagged s a) # divMod :: Tagged s a -> Tagged s a -> (Tagged s a, Tagged s a) # | |
class Applicative m => Monad (m :: Type -> Type) where #
Minimal complete definition
Instances
| Monad [] | |
| Monad Maybe | |
| Monad IO | |
| Monad Par1 | |
| Monad Q | |
| Monad IResult | |
| Monad Result | |
| Monad Parser | |
| Monad STM | |
| Monad Memoized | |
| Monad Identity | |
| Monad DList | |
| Monad Vector | |
| Monad Down | |
| Monad Seq | |
| Monad Acquire | |
| Monad NonEmpty | |
| Monad P | |
| Monad Option | |
| Monad ReadP | |
| Monad Dual | |
| Monad Product | |
| Monad Sum | |
| Monad Array | |
| Monad SmallArray | |
| Monad First | |
| Monad Last | |
| Monad Max | |
| Monad Min | |
| Monad CryptoFailable | |
| Monad Stream | |
| Monad MarkupM | |
| Monad Put | |
| Monad Result | |
| Monad (Either e) | |
| Monad (U1 :: Type -> Type) | |
| Monoid a => Monad ((,) a) | |
| Monad f => Monad (WrappedPoly f) | |
Defined in Data.MonoTraversable Methods (>>=) :: WrappedPoly f a -> (a -> WrappedPoly f b) -> WrappedPoly f b # (>>) :: WrappedPoly f a -> WrappedPoly f b -> WrappedPoly f b # return :: a -> WrappedPoly f a # | |
| Monad m => Monad (ResourceT m) | |
| Monad (WidgetFor site) | |
| Monad (HandlerFor site) | |
Defined in Yesod.Core.Types Methods (>>=) :: HandlerFor site a -> (a -> HandlerFor site b) -> HandlerFor site b # (>>) :: HandlerFor site a -> HandlerFor site b -> HandlerFor site b # return :: a -> HandlerFor site a # | |
| Monad (ST s) | |
| Monad m => Monad (WrappedMonad m) | |
| Monad (Parser i) | |
| Representable f => Monad (Co f) | |
| Alternative f => Monad (Cofree f) | |
| Functor f => Monad (Free f) | |
| Monad m => Monad (MaybeT m) | |
| (Monad (Rep p), Representable p) => Monad (Prep p) | |
| Monad m => Monad (LoggingT m) | |
| Monad m => Monad (NoLoggingT m) | |
| Monad m => Monad (WriterLoggingT m) | |
| Monad m => Monad (CatchT m) | |
| ArrowApply a => Monad (ArrowMonad a) | |
| Monad f => Monad (Rec1 f) | |
| Monad m => Monad (ReaderT r m) | |
| (Monoid w, Monad m) => Monad (WriterT w m) | |
| Monad (SubHandlerFor child master) | |
Defined in Yesod.Core.Types Methods (>>=) :: SubHandlerFor child master a -> (a -> SubHandlerFor child master b) -> SubHandlerFor child master b # (>>) :: SubHandlerFor child master a -> SubHandlerFor child master b -> SubHandlerFor child master b # return :: a -> SubHandlerFor child master a # | |
| Monad (Tagged s) | |
| Monad m => Monad (StateT s m) | |
| (Monad m, Error e) => Monad (ErrorT e m) | |
| (Functor f, Monad m) => Monad (FreeT f m) | |
| (Monoid w, Monad m) => Monad (WriterT w m) | |
| Monad m => Monad (StateT s m) | |
| Monad f => Monad (Alt f) | |
| Monad m => Monad (ExceptT e m) | |
| (Applicative f, Monad f) => Monad (WhenMissing f x) | |
| Monad ((->) r :: Type -> Type) | |
| (Monad f, Monad g) => Monad (f :*: g) | |
| Monad (ConduitT i o m) | |
| (Applicative f, Monad f) => Monad (WhenMissing f k x) | |
| (Monad f, Applicative f) => Monad (WhenMatched f x y) | |
| Monad f => Monad (M1 i c f) | |
| (Monoid w, Monad m) => Monad (RWST r w s m) | |
| (Monoid w, Monad m) => Monad (RWST r w s m) | |
| (Monad f, Applicative f) => Monad (WhenMatched f k x y) | |
| Monad m => Monad (Pipe l i o u m) | |
| Monad state => Monad (Builder collection mutCollection step state err) | |
Defined in Basement.MutableBuilder Methods (>>=) :: Builder collection mutCollection step state err a -> (a -> Builder collection mutCollection step state err b) -> Builder collection mutCollection step state err b # (>>) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err b # return :: a -> Builder collection mutCollection step state err a # | |
class Functor (f :: Type -> Type) where #
Minimal complete definition
Instances
Methods
fromInteger :: Integer -> a #
Instances
| Num Int | |
| Num Int8 | |
| Num Int16 | |
| Num Int32 | |
| Num Int64 | |
| Num Integer | |
| Num Natural | |
| Num Word | |
| Num Word8 | |
| Num Word16 | |
| Num Word32 | |
| Num Word64 | |
| Num Scientific | |
Defined in Data.Scientific | |
| Num CTime | |
| Num CInt | |
| Num CChar | |
| Num CSize | |
| Num Pos | |
| Num DiffTime | |
Defined in Data.Time.Clock.Internal.DiffTime | |
| Num NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods (+) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # (-) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # (*) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # negate :: NominalDiffTime -> NominalDiffTime # abs :: NominalDiffTime -> NominalDiffTime # signum :: NominalDiffTime -> NominalDiffTime # fromInteger :: Integer -> NominalDiffTime # | |
| Num CBool | |
| Num CClock | |
| Num CDouble | |
| Num CFloat | |
| Num CIntMax | |
| Num CIntPtr | |
| Num CLLong | |
| Num CLong | |
| Num CPtrdiff | |
| Num CSChar | |
| Num CSUSeconds | |
Defined in Foreign.C.Types | |
| Num CShort | |
| Num CSigAtomic | |
Defined in Foreign.C.Types | |
| Num CUChar | |
| Num CUInt | |
| Num CUIntMax | |
| Num CUIntPtr | |
| Num CULLong | |
| Num CULong | |
| Num CUSeconds | |
Defined in Foreign.C.Types | |
| Num CUShort | |
| Num CWchar | |
| Num PortNumber | |
Defined in Network.Socket.Types | |
| Num AbsoluteSize | |
Defined in Text.Internal.CssCommon Methods (+) :: AbsoluteSize -> AbsoluteSize -> AbsoluteSize # (-) :: AbsoluteSize -> AbsoluteSize -> AbsoluteSize # (*) :: AbsoluteSize -> AbsoluteSize -> AbsoluteSize # negate :: AbsoluteSize -> AbsoluteSize # abs :: AbsoluteSize -> AbsoluteSize # signum :: AbsoluteSize -> AbsoluteSize # fromInteger :: Integer -> AbsoluteSize # | |
| Num EmSize | |
| Num ExSize | |
| Num PercentageSize | |
Defined in Text.Internal.CssCommon Methods (+) :: PercentageSize -> PercentageSize -> PercentageSize # (-) :: PercentageSize -> PercentageSize -> PercentageSize # (*) :: PercentageSize -> PercentageSize -> PercentageSize # negate :: PercentageSize -> PercentageSize # abs :: PercentageSize -> PercentageSize # signum :: PercentageSize -> PercentageSize # fromInteger :: Integer -> PercentageSize # | |
| Num PixelSize | |
Defined in Text.Internal.CssCommon | |
| Integral a => Num (Ratio a) | |
| Num a => Num (Identity a) | |
Defined in Data.Functor.Identity | |
| Num a => Num (Down a) | |
| Num (Offset ty) | |
Defined in Basement.Types.OffsetSize | |
| Num (CountOf ty) | |
Defined in Basement.Types.OffsetSize | |
| Num a => Num (Product a) | |
Defined in Data.Semigroup.Internal | |
| Num a => Num (Sum a) | |
| Num a => Num (Max a) | |
| Num a => Num (Min a) | |
| KnownNat n => Num (Zn n) | |
| (KnownNat n, NatWithinBound Word64 n) => Num (Zn64 n) | |
| Num a => Num (Tagged s a) | |
Defined in Data.Tagged | |
| Num (f a) => Num (Alt f a) | |
Instances
| Ord Bool | |
| Ord Char | |
| Ord Double | |
| Ord Float | |
| Ord Int | |
| Ord Int8 | |
| Ord Int16 | |
| Ord Int32 | |
| Ord Int64 | |
| Ord Integer | |
| Ord Natural | |
| Ord Ordering | |
Defined in GHC.Classes | |
| Ord Word | |
| Ord Word8 | |
| Ord Word16 | |
| Ord Word32 | |
| Ord Word64 | |
| Ord SomeTypeRep | |
Defined in Data.Typeable.Internal | |
| Ord Exp | |
| Ord Match | |
| Ord Clause | |
| Ord Pat | |
| Ord Type | |
| Ord Dec | |
| Ord Name | |
| Ord FunDep | |
| Ord InjectivityAnn | |
Defined in Language.Haskell.TH.Syntax Methods compare :: InjectivityAnn -> InjectivityAnn -> Ordering # (<) :: InjectivityAnn -> InjectivityAnn -> Bool # (<=) :: InjectivityAnn -> InjectivityAnn -> Bool # (>) :: InjectivityAnn -> InjectivityAnn -> Bool # (>=) :: InjectivityAnn -> InjectivityAnn -> Bool # | |
| Ord Overlap | |
Defined in Language.Haskell.TH.Syntax | |
| Ord () | |
| Ord TyCon | |
| Ord Con | |
| Ord ByteString | |
Defined in Data.ByteString.Internal Methods compare :: ByteString -> ByteString -> Ordering # (<) :: ByteString -> ByteString -> Bool # (<=) :: ByteString -> ByteString -> Bool # (>) :: ByteString -> ByteString -> Bool # (>=) :: ByteString -> ByteString -> Bool # max :: ByteString -> ByteString -> ByteString # min :: ByteString -> ByteString -> ByteString # | |
| Ord ByteString | |
Defined in Data.ByteString.Lazy.Internal | |
| Ord Builder | |
Defined in Data.Text.Internal.Builder | |
| Ord Scientific | |
| Ord UTCTime | |
Defined in Data.Time.Clock.Internal.UTCTime | |
| Ord JSONPathElement | |
Defined in Data.Aeson.Types.Internal Methods compare :: JSONPathElement -> JSONPathElement -> Ordering # (<) :: JSONPathElement -> JSONPathElement -> Bool # (<=) :: JSONPathElement -> JSONPathElement -> Bool # (>) :: JSONPathElement -> JSONPathElement -> Bool # (>=) :: JSONPathElement -> JSONPathElement -> Bool # max :: JSONPathElement -> JSONPathElement -> JSONPathElement # min :: JSONPathElement -> JSONPathElement -> JSONPathElement # | |
| Ord DotNetTime | |
Defined in Data.Aeson.Types.Internal Methods compare :: DotNetTime -> DotNetTime -> Ordering # (<) :: DotNetTime -> DotNetTime -> Bool # (<=) :: DotNetTime -> DotNetTime -> Bool # (>) :: DotNetTime -> DotNetTime -> Bool # (>=) :: DotNetTime -> DotNetTime -> Bool # max :: DotNetTime -> DotNetTime -> DotNetTime # min :: DotNetTime -> DotNetTime -> DotNetTime # | |
| Ord BufferMode | |
Defined in GHC.IO.Handle.Types Methods compare :: BufferMode -> BufferMode -> Ordering # (<) :: BufferMode -> BufferMode -> Bool # (<=) :: BufferMode -> BufferMode -> Bool # (>) :: BufferMode -> BufferMode -> Bool # (>=) :: BufferMode -> BufferMode -> Bool # max :: BufferMode -> BufferMode -> BufferMode # min :: BufferMode -> BufferMode -> BufferMode # | |
| Ord SeekMode | |
Defined in GHC.IO.Device | |
| Ord IOMode | |
| Ord ConcException | |
Defined in UnliftIO.Internals.Async Methods compare :: ConcException -> ConcException -> Ordering # (<) :: ConcException -> ConcException -> Bool # (<=) :: ConcException -> ConcException -> Bool # (>) :: ConcException -> ConcException -> Bool # (>=) :: ConcException -> ConcException -> Bool # max :: ConcException -> ConcException -> ConcException # min :: ConcException -> ConcException -> ConcException # | |
| Ord Day | |
| Ord IntSet | |
| Ord ReleaseType | |
Defined in Data.Acquire.Internal Methods compare :: ReleaseType -> ReleaseType -> Ordering # (<) :: ReleaseType -> ReleaseType -> Bool # (<=) :: ReleaseType -> ReleaseType -> Bool # (>) :: ReleaseType -> ReleaseType -> Bool # (>=) :: ReleaseType -> ReleaseType -> Bool # max :: ReleaseType -> ReleaseType -> ReleaseType # min :: ReleaseType -> ReleaseType -> ReleaseType # | |
| Ord Void | |
| Ord StreamFileStatus | |
Defined in Network.HTTP.Client.Types Methods compare :: StreamFileStatus -> StreamFileStatus -> Ordering # (<) :: StreamFileStatus -> StreamFileStatus -> Bool # (<=) :: StreamFileStatus -> StreamFileStatus -> Bool # (>) :: StreamFileStatus -> StreamFileStatus -> Bool # (>=) :: StreamFileStatus -> StreamFileStatus -> Bool # max :: StreamFileStatus -> StreamFileStatus -> StreamFileStatus # min :: StreamFileStatus -> StreamFileStatus -> StreamFileStatus # | |
| Ord Proxy | |
| Ord Cookie | |
| Ord HttpVersion | |
Defined in Network.HTTP.Types.Version Methods compare :: HttpVersion -> HttpVersion -> Ordering # (<) :: HttpVersion -> HttpVersion -> Bool # (<=) :: HttpVersion -> HttpVersion -> Bool # (>) :: HttpVersion -> HttpVersion -> Bool # (>=) :: HttpVersion -> HttpVersion -> Bool # max :: HttpVersion -> HttpVersion -> HttpVersion # min :: HttpVersion -> HttpVersion -> HttpVersion # | |
| Ord EscapeItem | |
Defined in Network.HTTP.Types.URI Methods compare :: EscapeItem -> EscapeItem -> Ordering # (<) :: EscapeItem -> EscapeItem -> Bool # (<=) :: EscapeItem -> EscapeItem -> Bool # (>) :: EscapeItem -> EscapeItem -> Bool # (>=) :: EscapeItem -> EscapeItem -> Bool # max :: EscapeItem -> EscapeItem -> EscapeItem # min :: EscapeItem -> EscapeItem -> EscapeItem # | |
| Ord Status | |
| Ord StdMethod | |
| Ord ByteRange | |
| Ord Column | |
| Ord IsolationLevel | |
Defined in Database.Persist.Sql.Types.Internal Methods compare :: IsolationLevel -> IsolationLevel -> Ordering # (<) :: IsolationLevel -> IsolationLevel -> Bool # (<=) :: IsolationLevel -> IsolationLevel -> Bool # (>) :: IsolationLevel -> IsolationLevel -> Bool # (>=) :: IsolationLevel -> IsolationLevel -> Bool # max :: IsolationLevel -> IsolationLevel -> IsolationLevel # min :: IsolationLevel -> IsolationLevel -> IsolationLevel # | |
| Ord Checkmark | |
| Ord EntityDef | |
| Ord HaskellName | |
Defined in Database.Persist.Types.Base Methods compare :: HaskellName -> HaskellName -> Ordering # (<) :: HaskellName -> HaskellName -> Bool # (<=) :: HaskellName -> HaskellName -> Bool # (>) :: HaskellName -> HaskellName -> Bool # (>=) :: HaskellName -> HaskellName -> Bool # max :: HaskellName -> HaskellName -> HaskellName # min :: HaskellName -> HaskellName -> HaskellName # | |
| Ord DBName | |
| Ord FieldType | |
| Ord FieldDef | |
Defined in Database.Persist.Types.Base | |
| Ord ReferenceDef | |
Defined in Database.Persist.Types.Base Methods compare :: ReferenceDef -> ReferenceDef -> Ordering # (<) :: ReferenceDef -> ReferenceDef -> Bool # (<=) :: ReferenceDef -> ReferenceDef -> Bool # (>) :: ReferenceDef -> ReferenceDef -> Bool # (>=) :: ReferenceDef -> ReferenceDef -> Bool # max :: ReferenceDef -> ReferenceDef -> ReferenceDef # min :: ReferenceDef -> ReferenceDef -> ReferenceDef # | |
| Ord EmbedEntityDef | |
Defined in Database.Persist.Types.Base Methods compare :: EmbedEntityDef -> EmbedEntityDef -> Ordering # (<) :: EmbedEntityDef -> EmbedEntityDef -> Bool # (<=) :: EmbedEntityDef -> EmbedEntityDef -> Bool # (>) :: EmbedEntityDef -> EmbedEntityDef -> Bool # (>=) :: EmbedEntityDef -> EmbedEntityDef -> Bool # max :: EmbedEntityDef -> EmbedEntityDef -> EmbedEntityDef # min :: EmbedEntityDef -> EmbedEntityDef -> EmbedEntityDef # | |
| Ord EmbedFieldDef | |
Defined in Database.Persist.Types.Base Methods compare :: EmbedFieldDef -> EmbedFieldDef -> Ordering # (<) :: EmbedFieldDef -> EmbedFieldDef -> Bool # (<=) :: EmbedFieldDef -> EmbedFieldDef -> Bool # (>) :: EmbedFieldDef -> EmbedFieldDef -> Bool # (>=) :: EmbedFieldDef -> EmbedFieldDef -> Bool # max :: EmbedFieldDef -> EmbedFieldDef -> EmbedFieldDef # min :: EmbedFieldDef -> EmbedFieldDef -> EmbedFieldDef # | |
| Ord UniqueDef | |
| Ord CompositeDef | |
Defined in Database.Persist.Types.Base Methods compare :: CompositeDef -> CompositeDef -> Ordering # (<) :: CompositeDef -> CompositeDef -> Bool # (<=) :: CompositeDef -> CompositeDef -> Bool # (>) :: CompositeDef -> CompositeDef -> Bool # (>=) :: CompositeDef -> CompositeDef -> Bool # max :: CompositeDef -> CompositeDef -> CompositeDef # min :: CompositeDef -> CompositeDef -> CompositeDef # | |
| Ord ForeignDef | |
Defined in Database.Persist.Types.Base Methods compare :: ForeignDef -> ForeignDef -> Ordering # (<) :: ForeignDef -> ForeignDef -> Bool # (<=) :: ForeignDef -> ForeignDef -> Bool # (>) :: ForeignDef -> ForeignDef -> Bool # (>=) :: ForeignDef -> ForeignDef -> Bool # max :: ForeignDef -> ForeignDef -> ForeignDef # min :: ForeignDef -> ForeignDef -> ForeignDef # | |
| Ord PersistValue | |
Defined in Database.Persist.Types.Base Methods compare :: PersistValue -> PersistValue -> Ordering # (<) :: PersistValue -> PersistValue -> Bool # (<=) :: PersistValue -> PersistValue -> Bool # (>) :: PersistValue -> PersistValue -> Bool # (>=) :: PersistValue -> PersistValue -> Bool # max :: PersistValue -> PersistValue -> PersistValue # min :: PersistValue -> PersistValue -> PersistValue # | |
| Ord SqlType | |
Defined in Database.Persist.Types.Base | |
| Ord Textarea | |
Defined in Yesod.Form.Fields | |
| Ord LogLevel | |
Defined in Control.Monad.Logger | |
| Ord NameFlavour | |
Defined in Language.Haskell.TH.Syntax | |
| Ord CTime | |
| Ord All | |
| Ord Any | |
| Ord OccName | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Body | |
| Ord Lit | |
| Ord URIAuth | |
| Ord URI | |
| Ord Family | |
| Ord SockAddr | |
Defined in Network.Socket.Types | |
| Ord CInt | |
| Ord SocketType | |
Defined in Network.Socket.Types | |
| Ord CChar | |
| Ord CSize | |
| Ord Pos | |
| Ord DiffTime | |
Defined in Data.Time.Clock.Internal.DiffTime | |
| Ord TimeLocale | |
Defined in Data.Time.Format.Locale | |
| Ord LocalTime | |
Defined in Data.Time.LocalTime.Internal.LocalTime | |
| Ord NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods compare :: NominalDiffTime -> NominalDiffTime -> Ordering # (<) :: NominalDiffTime -> NominalDiffTime -> Bool # (<=) :: NominalDiffTime -> NominalDiffTime -> Bool # (>) :: NominalDiffTime -> NominalDiffTime -> Bool # (>=) :: NominalDiffTime -> NominalDiffTime -> Bool # max :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # min :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # | |
| Ord TimeOfDay | |
Defined in Data.Time.LocalTime.Internal.TimeOfDay | |
| Ord Version | |
| Ord Associativity | |
Defined in GHC.Generics Methods compare :: Associativity -> Associativity -> Ordering # (<) :: Associativity -> Associativity -> Bool # (<=) :: Associativity -> Associativity -> Bool # (>) :: Associativity -> Associativity -> Bool # (>=) :: Associativity -> Associativity -> Bool # | |
| Ord DecidedStrictness | |
Defined in GHC.Generics Methods compare :: DecidedStrictness -> DecidedStrictness -> Ordering # (<) :: DecidedStrictness -> DecidedStrictness -> Bool # (<=) :: DecidedStrictness -> DecidedStrictness -> Bool # (>) :: DecidedStrictness -> DecidedStrictness -> Bool # (>=) :: DecidedStrictness -> DecidedStrictness -> Bool # max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # | |
| Ord Fixity | |
| Ord SourceStrictness | |
Defined in GHC.Generics Methods compare :: SourceStrictness -> SourceStrictness -> Ordering # (<) :: SourceStrictness -> SourceStrictness -> Bool # (<=) :: SourceStrictness -> SourceStrictness -> Bool # (>) :: SourceStrictness -> SourceStrictness -> Bool # (>=) :: SourceStrictness -> SourceStrictness -> Bool # max :: SourceStrictness -> SourceStrictness -> SourceStrictness # min :: SourceStrictness -> SourceStrictness -> SourceStrictness # | |
| Ord SourceUnpackedness | |
Defined in GHC.Generics Methods compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering # (<) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # | |
| Ord ByteArray | |
| Ord ThreadId | |
Defined in GHC.Conc.Sync | |
| Ord CBool | |
| Ord CClock | |
| Ord CDouble | |
| Ord CFloat | |
| Ord CIntMax | |
| Ord CIntPtr | |
| Ord CLLong | |
| Ord CLong | |
| Ord CPtrdiff | |
Defined in Foreign.C.Types | |
| Ord CSChar | |
| Ord CSUSeconds | |
| Ord CShort | |
| Ord CSigAtomic | |
| Ord CUChar | |
| Ord CUInt | |
| Ord CUIntMax | |
Defined in Foreign.C.Types | |
| Ord CUIntPtr | |
Defined in Foreign.C.Types | |
| Ord CULLong | |
| Ord CULong | |
| Ord CUSeconds | |
| Ord CUShort | |
| Ord CWchar | |
| Ord Encoding | |
Defined in Basement.String | |
| Ord String | |
| Ord UTF32_Invalid | |
Defined in Basement.String.Encoding.UTF32 Methods compare :: UTF32_Invalid -> UTF32_Invalid -> Ordering # (<) :: UTF32_Invalid -> UTF32_Invalid -> Bool # (<=) :: UTF32_Invalid -> UTF32_Invalid -> Bool # (>) :: UTF32_Invalid -> UTF32_Invalid -> Bool # (>=) :: UTF32_Invalid -> UTF32_Invalid -> Bool # | |
| Ord FileSize | |
Defined in Basement.Types.OffsetSize | |
| Ord ConnHost | |
Defined in Network.HTTP.Client.Types | |
| Ord ConnKey | |
Defined in Network.HTTP.Client.Types | |
| Ord StatusHeaders | |
Defined in Network.HTTP.Client.Types Methods compare :: StatusHeaders -> StatusHeaders -> Ordering # (<) :: StatusHeaders -> StatusHeaders -> Bool # (<=) :: StatusHeaders -> StatusHeaders -> Bool # (>) :: StatusHeaders -> StatusHeaders -> Bool # (>=) :: StatusHeaders -> StatusHeaders -> Bool # | |
| Ord CompressionStrategy | |
Defined in Codec.Compression.Zlib.Stream Methods compare :: CompressionStrategy -> CompressionStrategy -> Ordering # (<) :: CompressionStrategy -> CompressionStrategy -> Bool # (<=) :: CompressionStrategy -> CompressionStrategy -> Bool # (>) :: CompressionStrategy -> CompressionStrategy -> Bool # (>=) :: CompressionStrategy -> CompressionStrategy -> Bool # max :: CompressionStrategy -> CompressionStrategy -> CompressionStrategy # min :: CompressionStrategy -> CompressionStrategy -> CompressionStrategy # | |
| Ord DictionaryHash | |
Defined in Codec.Compression.Zlib.Stream Methods compare :: DictionaryHash -> DictionaryHash -> Ordering # (<) :: DictionaryHash -> DictionaryHash -> Bool # (<=) :: DictionaryHash -> DictionaryHash -> Bool # (>) :: DictionaryHash -> DictionaryHash -> Bool # (>=) :: DictionaryHash -> DictionaryHash -> Bool # | |
| Ord Format | |
| Ord Method | |
| Ord WindowBits | |
Defined in Codec.Compression.Zlib.Stream | |
| Ord Loc | |
| Ord UUID | |
| Ord UnpackedUUID | |
Defined in Data.UUID.Types.Internal | |
| Ord EmailAddress | |
Defined in Text.Email.Parser | |
| Ord IP | |
| Ord IPv4 | |
| Ord IPv6 | |
| Ord PortNumber | |
Defined in Network.Socket.Types | |
| Ord IPRange | |
| Ord VarType | |
| Ord Content | |
| Ord Doctype | |
| Ord Document | |
Defined in Data.XML.Types | |
| Ord Element | |
| Ord Event | |
| Ord ExternalID | |
| Ord Instruction | |
Defined in Data.XML.Types | |
| Ord Miscellaneous | |
Defined in Data.XML.Types Methods compare :: Miscellaneous -> Miscellaneous -> Ordering # (<) :: Miscellaneous -> Miscellaneous -> Bool # (<=) :: Miscellaneous -> Miscellaneous -> Bool # (>) :: Miscellaneous -> Miscellaneous -> Bool # (>=) :: Miscellaneous -> Miscellaneous -> Bool # | |
| Ord Name | |
| Ord Node | |
| Ord Prologue | |
Defined in Data.XML.Types | |
| Ord BigNat | |
| Ord ArrayException | |
Defined in GHC.IO.Exception Methods compare :: ArrayException -> ArrayException -> Ordering # (<) :: ArrayException -> ArrayException -> Bool # (<=) :: ArrayException -> ArrayException -> Bool # (>) :: ArrayException -> ArrayException -> Bool # (>=) :: ArrayException -> ArrayException -> Bool # | |
| Ord AsyncException | |
Defined in GHC.IO.Exception Methods compare :: AsyncException -> AsyncException -> Ordering # (<) :: AsyncException -> AsyncException -> Bool # (<=) :: AsyncException -> AsyncException -> Bool # (>) :: AsyncException -> AsyncException -> Bool # (>=) :: AsyncException -> AsyncException -> Bool # | |
| Ord ExitCode | |
Defined in GHC.IO.Exception | |
| Ord ArithException | |
Defined in GHC.Exception.Type Methods compare :: ArithException -> ArithException -> Ordering # (<) :: ArithException -> ArithException -> Bool # (<=) :: ArithException -> ArithException -> Bool # (>) :: ArithException -> ArithException -> Bool # (>=) :: ArithException -> ArithException -> Bool # | |
| Ord BlockReason | |
Defined in GHC.Conc.Sync | |
| Ord ThreadStatus | |
Defined in GHC.Conc.Sync | |
| Ord Newline | |
| Ord NewlineMode | |
Defined in GHC.IO.Handle.Types | |
| Ord SomeSymbol | |
| Ord AnnLookup | |
| Ord AnnTarget | |
| Ord Bang | |
| Ord Callconv | |
Defined in Language.Haskell.TH.Syntax | |
| Ord DecidedStrictness | |
Defined in Language.Haskell.TH.Syntax Methods compare :: DecidedStrictness -> DecidedStrictness -> Ordering # (<) :: DecidedStrictness -> DecidedStrictness -> Bool # (<=) :: DecidedStrictness -> DecidedStrictness -> Bool # (>) :: DecidedStrictness -> DecidedStrictness -> Bool # (>=) :: DecidedStrictness -> DecidedStrictness -> Bool # max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness # | |
| Ord DerivClause | |
Defined in Language.Haskell.TH.Syntax | |
| Ord DerivStrategy | |
Defined in Language.Haskell.TH.Syntax Methods compare :: DerivStrategy -> DerivStrategy -> Ordering # (<) :: DerivStrategy -> DerivStrategy -> Bool # (<=) :: DerivStrategy -> DerivStrategy -> Bool # (>) :: DerivStrategy -> DerivStrategy -> Bool # (>=) :: DerivStrategy -> DerivStrategy -> Bool # | |
| Ord FamilyResultSig | |
Defined in Language.Haskell.TH.Syntax Methods compare :: FamilyResultSig -> FamilyResultSig -> Ordering # (<) :: FamilyResultSig -> FamilyResultSig -> Bool # (<=) :: FamilyResultSig -> FamilyResultSig -> Bool # (>) :: FamilyResultSig -> FamilyResultSig -> Bool # (>=) :: FamilyResultSig -> FamilyResultSig -> Bool # max :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig # min :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig # | |
| Ord Fixity | |
| Ord FixityDirection | |
Defined in Language.Haskell.TH.Syntax Methods compare :: FixityDirection -> FixityDirection -> Ordering # (<) :: FixityDirection -> FixityDirection -> Bool # (<=) :: FixityDirection -> FixityDirection -> Bool # (>) :: FixityDirection -> FixityDirection -> Bool # (>=) :: FixityDirection -> FixityDirection -> Bool # max :: FixityDirection -> FixityDirection -> FixityDirection # min :: FixityDirection -> FixityDirection -> FixityDirection # | |
| Ord Foreign | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Guard | |
| Ord Info | |
| Ord Inline | |
| Ord ModName | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Module | |
| Ord ModuleInfo | |
Defined in Language.Haskell.TH.Syntax | |
| Ord NameSpace | |
| Ord PatSynArgs | |
Defined in Language.Haskell.TH.Syntax | |
| Ord PatSynDir | |
| Ord Phases | |
| Ord PkgName | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Pragma | |
| Ord Range | |
| Ord Role | |
| Ord RuleBndr | |
Defined in Language.Haskell.TH.Syntax | |
| Ord RuleMatch | |
| Ord Safety | |
| Ord SourceStrictness | |
Defined in Language.Haskell.TH.Syntax Methods compare :: SourceStrictness -> SourceStrictness -> Ordering # (<) :: SourceStrictness -> SourceStrictness -> Bool # (<=) :: SourceStrictness -> SourceStrictness -> Bool # (>) :: SourceStrictness -> SourceStrictness -> Bool # (>=) :: SourceStrictness -> SourceStrictness -> Bool # max :: SourceStrictness -> SourceStrictness -> SourceStrictness # min :: SourceStrictness -> SourceStrictness -> SourceStrictness # | |
| Ord SourceUnpackedness | |
Defined in Language.Haskell.TH.Syntax Methods compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering # (<) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness # | |
| Ord Stmt | |
| Ord TyLit | |
| Ord TySynEqn | |
Defined in Language.Haskell.TH.Syntax | |
| Ord TyVarBndr | |
| Ord TypeFamilyHead | |
Defined in Language.Haskell.TH.Syntax Methods compare :: TypeFamilyHead -> TypeFamilyHead -> Ordering # (<) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (<=) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (>) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (>=) :: TypeFamilyHead -> TypeFamilyHead -> Bool # | |
| Ord IV | |
| Ord AbsoluteSize | |
Defined in Text.Internal.CssCommon | |
| Ord EmSize | |
| Ord ExSize | |
| Ord PercentageSize | |
Defined in Text.Internal.CssCommon Methods compare :: PercentageSize -> PercentageSize -> Ordering # (<) :: PercentageSize -> PercentageSize -> Bool # (<=) :: PercentageSize -> PercentageSize -> Bool # (>) :: PercentageSize -> PercentageSize -> Bool # (>=) :: PercentageSize -> PercentageSize -> Bool # | |
| Ord PixelSize | |
| Ord a => Ord [a] | |
| Ord a => Ord (Maybe a) | |
| Integral a => Ord (Ratio a) | |
| Ord p => Ord (Par1 p) | |
| Ord (Encoding' a) | |
Defined in Data.Aeson.Encoding.Internal | |
| Ord mono => Ord (NonNull mono) | |
Defined in Data.NonNull | |
| Ord (Async a) | |
Defined in Control.Concurrent.Async | |
| Ord m => Ord (WrappedMonoid m) | |
Defined in Data.Semigroup Methods compare :: WrappedMonoid m -> WrappedMonoid m -> Ordering # (<) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (<=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # max :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # min :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # | |
| Ord a => Ord (Identity a) | |
Defined in Data.Functor.Identity | |
| Ord a => Ord (DList a) | |
| Ord a => Ord (HashSet a) | |
| Ord a => Ord (Vector a) | |
Defined in Data.Vector | |
| Ord a => Ord (Down a) | |
| Ord a => Ord (Set a) | |
| Ord a => Ord (IntMap a) | |
Defined in Data.IntMap.Internal | |
| Ord a => Ord (Seq a) | |
| Ord a => Ord (Flush a) | |
Defined in Data.Conduit.Internal.Conduit | |
| Ord a => Ord (NonEmpty a) | |
| Ord a => Ord (Single a) | |
Defined in Database.Persist.Sql.Types | |
| (Ord (Key record), Ord record) => Ord (Entity record) | |
Defined in Database.Persist.Class.PersistEntity Methods compare :: Entity record -> Entity record -> Ordering # (<) :: Entity record -> Entity record -> Bool # (<=) :: Entity record -> Entity record -> Bool # (>) :: Entity record -> Entity record -> Bool # (>=) :: Entity record -> Entity record -> Bool # | |
| Ord (Route WaiSubsiteWithAuth) | |
Defined in Yesod.Core.Types Methods compare :: Route WaiSubsiteWithAuth -> Route WaiSubsiteWithAuth -> Ordering # (<) :: Route WaiSubsiteWithAuth -> Route WaiSubsiteWithAuth -> Bool # (<=) :: Route WaiSubsiteWithAuth -> Route WaiSubsiteWithAuth -> Bool # (>) :: Route WaiSubsiteWithAuth -> Route WaiSubsiteWithAuth -> Bool # (>=) :: Route WaiSubsiteWithAuth -> Route WaiSubsiteWithAuth -> Bool # max :: Route WaiSubsiteWithAuth -> Route WaiSubsiteWithAuth -> Route WaiSubsiteWithAuth # min :: Route WaiSubsiteWithAuth -> Route WaiSubsiteWithAuth -> Route WaiSubsiteWithAuth # | |
| Ord (Route WaiSubsite) | |
Defined in Yesod.Core.Types Methods compare :: Route WaiSubsite -> Route WaiSubsite -> Ordering # (<) :: Route WaiSubsite -> Route WaiSubsite -> Bool # (<=) :: Route WaiSubsite -> Route WaiSubsite -> Bool # (>) :: Route WaiSubsite -> Route WaiSubsite -> Bool # (>=) :: Route WaiSubsite -> Route WaiSubsite -> Bool # max :: Route WaiSubsite -> Route WaiSubsite -> Route WaiSubsite # min :: Route WaiSubsite -> Route WaiSubsite -> Route WaiSubsite # | |
| Ord (Route LiteApp) | |
Defined in Yesod.Core.Internal.LiteApp Methods compare :: Route LiteApp -> Route LiteApp -> Ordering # (<) :: Route LiteApp -> Route LiteApp -> Bool # (<=) :: Route LiteApp -> Route LiteApp -> Bool # (>) :: Route LiteApp -> Route LiteApp -> Bool # (>=) :: Route LiteApp -> Route LiteApp -> Bool # | |
| Ord (Digest a) | |
Defined in Crypto.Hash.Types | |
| Ord a => Ord (Option a) | |
Defined in Data.Semigroup | |
| (Prim a, Ord a) => Ord (Vector a) | |
Defined in Data.Vector.Primitive | |
| (Storable a, Ord a) => Ord (Vector a) | |
Defined in Data.Vector.Storable | |
| Ord s => Ord (CI s) | |
| (PrimType ty, Ord ty) => Ord (UArray ty) | |
| Ord (Offset ty) | |
| Ord (CountOf ty) | |
Defined in Basement.Types.OffsetSize | |
| (PrimType ty, Ord ty) => Ord (Block ty) | |
Defined in Basement.Block.Base | |
| Ord a => Ord (Dual a) | |
| Ord a => Ord (Product a) | |
| Ord a => Ord (Sum a) | |
| Ord a => Ord (ZipList a) | |
| Ord a => Ord (ViewL a) | |
Defined in Data.Sequence.Internal | |
| Ord a => Ord (ViewR a) | |
Defined in Data.Sequence.Internal | |
| Ord a => Ord (Array a) | |
Defined in Data.Primitive.Array | |
| (Ord a, Prim a) => Ord (PrimArray a) | |
Defined in Data.Primitive.PrimArray | |
| Ord a => Ord (SmallArray a) | |
Defined in Data.Primitive.SmallArray | |
| Ord a => Ord (First a) | |
| Ord a => Ord (Last a) | |
| Ord a => Ord (Max a) | |
| Ord a => Ord (Min a) | |
| Ord (Zn n) | |
| Ord (Zn64 n) | |
| Ord a => Ord (AddrRange a) | |
Defined in Data.IP.Range | |
| Ord a => Ord (Hashed a) | |
Defined in Data.Hashable.Class | |
| (Ord a, Ord b) => Ord (Either a b) | |
| Ord (V1 p) | |
| Ord (U1 p) | |
| Ord (TypeRep a) | |
| (Ord a, Ord b) => Ord (a, b) | |
| (Ord k, Ord v) => Ord (HashMap k v) | |
Defined in Data.HashMap.Base | |
| (Ord k, Ord v) => Ord (Map k v) | |
| Ord a => Ord (Arg a b) | |
| (Ord1 f, Ord a) => Ord (Cofree f a) | |
Defined in Control.Comonad.Cofree | |
| (Ord1 f, Ord a) => Ord (Free f a) | |
Defined in Control.Monad.Free | |
| (Ord1 m, Ord a) => Ord (MaybeT m a) | |
Defined in Control.Monad.Trans.Maybe | |
| Ord (f p) => Ord (Rec1 f p) | |
Defined in GHC.Generics | |
| Ord (URec (Ptr ()) p) | |
Defined in GHC.Generics Methods compare :: URec (Ptr ()) p -> URec (Ptr ()) p -> Ordering # (<) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (<=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (>) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (>=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # max :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p # min :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p # | |
| Ord (URec Char p) | |
Defined in GHC.Generics | |
| Ord (URec Double p) | |
Defined in GHC.Generics Methods compare :: URec Double p -> URec Double p -> Ordering # (<) :: URec Double p -> URec Double p -> Bool # (<=) :: URec Double p -> URec Double p -> Bool # (>) :: URec Double p -> URec Double p -> Bool # (>=) :: URec Double p -> URec Double p -> Bool # | |
| Ord (URec Float p) | |
Defined in GHC.Generics | |
| Ord (URec Int p) | |
| Ord (URec Word p) | |
Defined in GHC.Generics | |
| (Ord a, Ord b, Ord c) => Ord (a, b, c) | |
| (Ord w, Ord1 m, Ord a) => Ord (WriterT w m a) | |
Defined in Control.Monad.Trans.Writer.Lazy Methods compare :: WriterT w m a -> WriterT w m a -> Ordering # (<) :: WriterT w m a -> WriterT w m a -> Bool # (<=) :: WriterT w m a -> WriterT w m a -> Bool # (>) :: WriterT w m a -> WriterT w m a -> Bool # (>=) :: WriterT w m a -> WriterT w m a -> Bool # | |
| Ord b => Ord (Tagged s b) | |
| (Ord e, Ord1 m, Ord a) => Ord (ErrorT e m a) | |
Defined in Control.Monad.Trans.Error | |
| Ord (p a a) => Ord (Join p a) | |
Defined in Data.Bifunctor.Join | |
| (Ord1 f, Ord1 m, Ord a) => Ord (FreeT f m a) | |
Defined in Control.Monad.Trans.Free | |
| (Ord a, Ord (f b)) => Ord (FreeF f a b) | |
Defined in Control.Monad.Trans.Free | |
| (Ord w, Ord1 m, Ord a) => Ord (WriterT w m a) | |
Defined in Control.Monad.Trans.Writer.Strict Methods compare :: WriterT w m a -> WriterT w m a -> Ordering # (<) :: WriterT w m a -> WriterT w m a -> Bool # (<=) :: WriterT w m a -> WriterT w m a -> Bool # (>) :: WriterT w m a -> WriterT w m a -> Bool # (>=) :: WriterT w m a -> WriterT w m a -> Bool # | |
| Ord (f a) => Ord (Alt f a) | |
Defined in Data.Semigroup.Internal | |
| (Ord e, Ord1 m, Ord a) => Ord (ExceptT e m a) | |
Defined in Control.Monad.Trans.Except Methods compare :: ExceptT e m a -> ExceptT e m a -> Ordering # (<) :: ExceptT e m a -> ExceptT e m a -> Bool # (<=) :: ExceptT e m a -> ExceptT e m a -> Bool # (>) :: ExceptT e m a -> ExceptT e m a -> Bool # (>=) :: ExceptT e m a -> ExceptT e m a -> Bool # | |
| Ord c => Ord (K1 i c p) | |
Defined in GHC.Generics | |
| (Ord (f p), Ord (g p)) => Ord ((f :+: g) p) | |
Defined in GHC.Generics | |
| (Ord (f p), Ord (g p)) => Ord ((f :*: g) p) | |
Defined in GHC.Generics | |
| (Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d) | |
Defined in GHC.Classes | |
| Ord (f p) => Ord (M1 i c f p) | |
| Ord (f (g p)) => Ord ((f :.: g) p) | |
Defined in GHC.Generics | |
| (Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (a, b, c, d, e) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e) -> (a, b, c, d, e) -> Ordering # (<) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (<=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # (>=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool # max :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # min :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # | |
| Ord (f a) => Ord (Clown f a b) | |
Defined in Data.Bifunctor.Clown | |
| Ord (p b a) => Ord (Flip p a b) | |
Defined in Data.Bifunctor.Flip | |
| Ord (g b) => Ord (Joker g a b) | |
Defined in Data.Bifunctor.Joker | |
| Ord (p a b) => Ord (WrappedBifunctor p a b) | |
Defined in Data.Bifunctor.Wrapped Methods compare :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Ordering # (<) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # (<=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # (>) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # (>=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool # max :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b # min :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord (a, b, c, d, e, f) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Ordering # (<) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (<=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (>) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # (>=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool # max :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) # min :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) # | |
| (Ord (f a b), Ord (g a b)) => Ord (Product f g a b) | |
Defined in Data.Bifunctor.Product Methods compare :: Product f g a b -> Product f g a b -> Ordering # (<) :: Product f g a b -> Product f g a b -> Bool # (<=) :: Product f g a b -> Product f g a b -> Bool # (>) :: Product f g a b -> Product f g a b -> Bool # (>=) :: Product f g a b -> Product f g a b -> Bool # max :: Product f g a b -> Product f g a b -> Product f g a b # min :: Product f g a b -> Product f g a b -> Product f g a b # | |
| (Ord (p a b), Ord (q a b)) => Ord (Sum p q a b) | |
Defined in Data.Bifunctor.Sum | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord (a, b, c, d, e, f, g) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Ordering # (<) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (<=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (>) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # (>=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool # max :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) # min :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) # | |
| Ord (f (p a b)) => Ord (Tannen f p a b) | |
Defined in Data.Bifunctor.Tannen Methods compare :: Tannen f p a b -> Tannen f p a b -> Ordering # (<) :: Tannen f p a b -> Tannen f p a b -> Bool # (<=) :: Tannen f p a b -> Tannen f p a b -> Bool # (>) :: Tannen f p a b -> Tannen f p a b -> Bool # (>=) :: Tannen f p a b -> Tannen f p a b -> Bool # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => Ord (a, b, c, d, e, f, g, h) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Ordering # (<) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (<=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (>) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # (>=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool # max :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) # min :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i) => Ord (a, b, c, d, e, f, g, h, i) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool # max :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) # min :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) # | |
| Ord (p (f a) (g b)) => Ord (Biff p f g a b) | |
Defined in Data.Bifunctor.Biff Methods compare :: Biff p f g a b -> Biff p f g a b -> Ordering # (<) :: Biff p f g a b -> Biff p f g a b -> Bool # (<=) :: Biff p f g a b -> Biff p f g a b -> Bool # (>) :: Biff p f g a b -> Biff p f g a b -> Bool # (>=) :: Biff p f g a b -> Biff p f g a b -> Bool # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j) => Ord (a, b, c, d, e, f, g, h, i, j) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) # min :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k) => Ord (a, b, c, d, e, f, g, h, i, j, k) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) # min :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l) => Ord (a, b, c, d, e, f, g, h, i, j, k, l) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) # min :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) # min :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # min :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j, Ord k, Ord l, Ord m, Ord n, Ord o) => Ord (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | |
Defined in GHC.Classes Methods compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Ordering # (<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # (>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool # max :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # min :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # | |
Minimal complete definition
readsPrec | readPrec
Instances
| Read Bool | |
| Read Char | |
| Read Double | |
| Read Float | |
| Read Int | |
| Read Int8 | |
| Read Int16 | |
| Read Int32 | |
| Read Int64 | |
| Read Integer | |
| Read Natural | |
| Read Ordering | |
| Read Word | |
| Read Word8 | |
| Read Word16 | |
| Read Word32 | |
| Read Word64 | |
| Read () | |
| Read ByteString | |
Defined in Data.ByteString.Internal Methods readsPrec :: Int -> ReadS ByteString readList :: ReadS [ByteString] readPrec :: ReadPrec ByteString readListPrec :: ReadPrec [ByteString] | |
| Read ByteString | |
Defined in Data.ByteString.Lazy.Internal Methods readsPrec :: Int -> ReadS ByteString readList :: ReadS [ByteString] readPrec :: ReadPrec ByteString readListPrec :: ReadPrec [ByteString] | |
| Read Scientific | |
Defined in Data.Scientific Methods readsPrec :: Int -> ReadS Scientific readList :: ReadS [Scientific] readPrec :: ReadPrec Scientific readListPrec :: ReadPrec [Scientific] | |
| Read Value | |
Defined in Data.Aeson.Types.Internal | |
| Read DotNetTime | |
Defined in Data.Aeson.Types.Internal Methods readsPrec :: Int -> ReadS DotNetTime readList :: ReadS [DotNetTime] readPrec :: ReadPrec DotNetTime readListPrec :: ReadPrec [DotNetTime] | |
| Read BufferMode | |
Defined in GHC.IO.Handle.Types Methods readsPrec :: Int -> ReadS BufferMode readList :: ReadS [BufferMode] readPrec :: ReadPrec BufferMode readListPrec :: ReadPrec [BufferMode] | |
| Read SeekMode | |
Defined in GHC.IO.Device | |
| Read IOMode | |
Defined in GHC.IO.IOMode | |
| Read IntSet | |
Defined in Data.IntSet.Internal | |
| Read ReleaseType | |
Defined in Data.Acquire.Internal Methods readsPrec :: Int -> ReadS ReleaseType readList :: ReadS [ReleaseType] readPrec :: ReadPrec ReleaseType readListPrec :: ReadPrec [ReleaseType] | |
| Read Void | |
| Read Proxy | |
Defined in Network.HTTP.Client.Types | |
| Read CookieJar | |
Defined in Network.HTTP.Client.Types | |
| Read Cookie | |
Defined in Network.HTTP.Client.Types | |
| Read StdMethod | |
Defined in Network.HTTP.Types.Method | |
| Read Checkmark | |
Defined in Database.Persist.Types.Base | |
| Read EntityDef | |
Defined in Database.Persist.Types.Base | |
| Read HaskellName | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS HaskellName readList :: ReadS [HaskellName] readPrec :: ReadPrec HaskellName readListPrec :: ReadPrec [HaskellName] | |
| Read DBName | |
Defined in Database.Persist.Types.Base | |
| Read FieldType | |
Defined in Database.Persist.Types.Base | |
| Read FieldDef | |
Defined in Database.Persist.Types.Base | |
| Read ReferenceDef | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS ReferenceDef readList :: ReadS [ReferenceDef] readPrec :: ReadPrec ReferenceDef readListPrec :: ReadPrec [ReferenceDef] | |
| Read EmbedEntityDef | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS EmbedEntityDef readList :: ReadS [EmbedEntityDef] readPrec :: ReadPrec EmbedEntityDef readListPrec :: ReadPrec [EmbedEntityDef] | |
| Read EmbedFieldDef | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS EmbedFieldDef readList :: ReadS [EmbedFieldDef] readPrec :: ReadPrec EmbedFieldDef readListPrec :: ReadPrec [EmbedFieldDef] | |
| Read UniqueDef | |
Defined in Database.Persist.Types.Base | |
| Read CompositeDef | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS CompositeDef readList :: ReadS [CompositeDef] readPrec :: ReadPrec CompositeDef readListPrec :: ReadPrec [CompositeDef] | |
| Read ForeignDef | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS ForeignDef readList :: ReadS [ForeignDef] readPrec :: ReadPrec ForeignDef readListPrec :: ReadPrec [ForeignDef] | |
| Read PersistValue | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS PersistValue readList :: ReadS [PersistValue] readPrec :: ReadPrec PersistValue readListPrec :: ReadPrec [PersistValue] | |
| Read SqlType | |
Defined in Database.Persist.Types.Base | |
| Read PersistFilter | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS PersistFilter readList :: ReadS [PersistFilter] readPrec :: ReadPrec PersistFilter readListPrec :: ReadPrec [PersistFilter] | |
| Read PersistUpdate | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS PersistUpdate readList :: ReadS [PersistUpdate] readPrec :: ReadPrec PersistUpdate readListPrec :: ReadPrec [PersistUpdate] | |
| Read FormMessage | |
Defined in Yesod.Form.Types Methods readsPrec :: Int -> ReadS FormMessage readList :: ReadS [FormMessage] readPrec :: ReadPrec FormMessage readListPrec :: ReadPrec [FormMessage] | |
| Read Textarea | |
Defined in Yesod.Form.Fields | |
| Read AuthResult | |
Defined in Yesod.Core.Types Methods readsPrec :: Int -> ReadS AuthResult readList :: ReadS [AuthResult] readPrec :: ReadPrec AuthResult readListPrec :: ReadPrec [AuthResult] | |
| Read LogLevel | |
Defined in Control.Monad.Logger | |
| Read Lexeme | |
| Read CTime | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CTime readList :: ReadS [CTime] readPrec :: ReadPrec CTime readListPrec :: ReadPrec [CTime] | |
| Read All | |
Defined in Data.Semigroup.Internal | |
| Read Any | |
Defined in Data.Semigroup.Internal | |
| Read AddrInfoFlag | |
Defined in Network.Socket.Info Methods readsPrec :: Int -> ReadS AddrInfoFlag readList :: ReadS [AddrInfoFlag] readPrec :: ReadPrec AddrInfoFlag readListPrec :: ReadPrec [AddrInfoFlag] | |
| Read NameInfoFlag | |
Defined in Network.Socket.Info Methods readsPrec :: Int -> ReadS NameInfoFlag readList :: ReadS [NameInfoFlag] readPrec :: ReadPrec NameInfoFlag readListPrec :: ReadPrec [NameInfoFlag] | |
| Read Family | |
Defined in Network.Socket.Types Methods readsPrec :: Int -> ReadS Family readList :: ReadS [Family] readPrec :: ReadPrec Family readListPrec :: ReadPrec [Family] | |
| Read CInt | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CInt readList :: ReadS [CInt] readPrec :: ReadPrec CInt readListPrec :: ReadPrec [CInt] | |
| Read SocketType | |
Defined in Network.Socket.Types Methods readsPrec :: Int -> ReadS SocketType readList :: ReadS [SocketType] readPrec :: ReadPrec SocketType readListPrec :: ReadPrec [SocketType] | |
| Read CChar | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CChar readList :: ReadS [CChar] readPrec :: ReadPrec CChar readListPrec :: ReadPrec [CChar] | |
| Read CSize | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CSize readList :: ReadS [CSize] readPrec :: ReadPrec CSize readListPrec :: ReadPrec [CSize] | |
| Read Version | |
Defined in Data.Version Methods readsPrec :: Int -> ReadS Version readList :: ReadS [Version] readPrec :: ReadPrec Version readListPrec :: ReadPrec [Version] | |
| Read Associativity | |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS Associativity readList :: ReadS [Associativity] readPrec :: ReadPrec Associativity readListPrec :: ReadPrec [Associativity] | |
| Read DecidedStrictness | |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS DecidedStrictness readList :: ReadS [DecidedStrictness] readPrec :: ReadPrec DecidedStrictness readListPrec :: ReadPrec [DecidedStrictness] | |
| Read Fixity | |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS Fixity readList :: ReadS [Fixity] readPrec :: ReadPrec Fixity readListPrec :: ReadPrec [Fixity] | |
| Read SourceStrictness | |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS SourceStrictness readList :: ReadS [SourceStrictness] readPrec :: ReadPrec SourceStrictness readListPrec :: ReadPrec [SourceStrictness] | |
| Read SourceUnpackedness | |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS SourceUnpackedness readList :: ReadS [SourceUnpackedness] readPrec :: ReadPrec SourceUnpackedness readListPrec :: ReadPrec [SourceUnpackedness] | |
| Read CBool | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CBool readList :: ReadS [CBool] readPrec :: ReadPrec CBool readListPrec :: ReadPrec [CBool] | |
| Read CClock | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CClock readList :: ReadS [CClock] readPrec :: ReadPrec CClock readListPrec :: ReadPrec [CClock] | |
| Read CDouble | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CDouble readList :: ReadS [CDouble] readPrec :: ReadPrec CDouble readListPrec :: ReadPrec [CDouble] | |
| Read CFloat | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CFloat readList :: ReadS [CFloat] readPrec :: ReadPrec CFloat readListPrec :: ReadPrec [CFloat] | |
| Read CIntMax | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CIntMax readList :: ReadS [CIntMax] readPrec :: ReadPrec CIntMax readListPrec :: ReadPrec [CIntMax] | |
| Read CIntPtr | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CIntPtr readList :: ReadS [CIntPtr] readPrec :: ReadPrec CIntPtr readListPrec :: ReadPrec [CIntPtr] | |
| Read CLLong | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CLLong readList :: ReadS [CLLong] readPrec :: ReadPrec CLLong readListPrec :: ReadPrec [CLLong] | |
| Read CLong | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CLong readList :: ReadS [CLong] readPrec :: ReadPrec CLong readListPrec :: ReadPrec [CLong] | |
| Read CPtrdiff | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CPtrdiff readList :: ReadS [CPtrdiff] readPrec :: ReadPrec CPtrdiff readListPrec :: ReadPrec [CPtrdiff] | |
| Read CSChar | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CSChar readList :: ReadS [CSChar] readPrec :: ReadPrec CSChar readListPrec :: ReadPrec [CSChar] | |
| Read CSUSeconds | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CSUSeconds readList :: ReadS [CSUSeconds] readPrec :: ReadPrec CSUSeconds readListPrec :: ReadPrec [CSUSeconds] | |
| Read CShort | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CShort readList :: ReadS [CShort] readPrec :: ReadPrec CShort readListPrec :: ReadPrec [CShort] | |
| Read CSigAtomic | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CSigAtomic readList :: ReadS [CSigAtomic] readPrec :: ReadPrec CSigAtomic readListPrec :: ReadPrec [CSigAtomic] | |
| Read CUChar | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CUChar readList :: ReadS [CUChar] readPrec :: ReadPrec CUChar readListPrec :: ReadPrec [CUChar] | |
| Read CUInt | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CUInt readList :: ReadS [CUInt] readPrec :: ReadPrec CUInt readListPrec :: ReadPrec [CUInt] | |
| Read CUIntMax | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CUIntMax readList :: ReadS [CUIntMax] readPrec :: ReadPrec CUIntMax readListPrec :: ReadPrec [CUIntMax] | |
| Read CUIntPtr | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CUIntPtr readList :: ReadS [CUIntPtr] readPrec :: ReadPrec CUIntPtr readListPrec :: ReadPrec [CUIntPtr] | |
| Read CULLong | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CULLong readList :: ReadS [CULLong] readPrec :: ReadPrec CULLong readListPrec :: ReadPrec [CULLong] | |
| Read CULong | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CULong readList :: ReadS [CULong] readPrec :: ReadPrec CULong readListPrec :: ReadPrec [CULong] | |
| Read CUSeconds | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CUSeconds readList :: ReadS [CUSeconds] readPrec :: ReadPrec CUSeconds readListPrec :: ReadPrec [CUSeconds] | |
| Read CUShort | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CUShort readList :: ReadS [CUShort] readPrec :: ReadPrec CUShort readListPrec :: ReadPrec [CUShort] | |
| Read CWchar | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CWchar readList :: ReadS [CWchar] readPrec :: ReadPrec CWchar readListPrec :: ReadPrec [CWchar] | |
| Read DictionaryHash | |
Defined in Codec.Compression.Zlib.Stream Methods readsPrec :: Int -> ReadS DictionaryHash readList :: ReadS [DictionaryHash] readPrec :: ReadPrec DictionaryHash readListPrec :: ReadPrec [DictionaryHash] | |
| Read UUID | |
Defined in Data.UUID.Types.Internal Methods readsPrec :: Int -> ReadS UUID readList :: ReadS [UUID] readPrec :: ReadPrec UUID readListPrec :: ReadPrec [UUID] | |
| Read UnpackedUUID | |
Defined in Data.UUID.Types.Internal Methods readsPrec :: Int -> ReadS UnpackedUUID readList :: ReadS [UnpackedUUID] readPrec :: ReadPrec UnpackedUUID readListPrec :: ReadPrec [UnpackedUUID] | |
| Read EmailAddress | |
Defined in Text.Email.Parser Methods readsPrec :: Int -> ReadS EmailAddress readList :: ReadS [EmailAddress] readPrec :: ReadPrec EmailAddress readListPrec :: ReadPrec [EmailAddress] | |
| Read IP | |
Defined in Data.IP.Addr | |
| Read IPv4 | |
Defined in Data.IP.Addr Methods readsPrec :: Int -> ReadS IPv4 readList :: ReadS [IPv4] readPrec :: ReadPrec IPv4 readListPrec :: ReadPrec [IPv4] | |
| Read IPv6 | |
Defined in Data.IP.Addr Methods readsPrec :: Int -> ReadS IPv6 readList :: ReadS [IPv6] readPrec :: ReadPrec IPv6 readListPrec :: ReadPrec [IPv6] | |
| Read PortNumber | |
Defined in Network.Socket.Types Methods readsPrec :: Int -> ReadS PortNumber readList :: ReadS [PortNumber] readPrec :: ReadPrec PortNumber readListPrec :: ReadPrec [PortNumber] | |
| Read IPRange | |
Defined in Data.IP.Range Methods readsPrec :: Int -> ReadS IPRange readList :: ReadS [IPRange] readPrec :: ReadPrec IPRange readListPrec :: ReadPrec [IPRange] | |
| Read SessionCookie | |
Defined in Yesod.Core.Types Methods readsPrec :: Int -> ReadS SessionCookie readList :: ReadS [SessionCookie] readPrec :: ReadPrec SessionCookie readListPrec :: ReadPrec [SessionCookie] | |
| Read GeneralCategory | |
| Read ExitCode | |
Defined in GHC.IO.Exception Methods readsPrec :: Int -> ReadS ExitCode readList :: ReadS [ExitCode] readPrec :: ReadPrec ExitCode readListPrec :: ReadPrec [ExitCode] | |
| Read Newline | |
Defined in GHC.IO.Handle.Types Methods readsPrec :: Int -> ReadS Newline readList :: ReadS [Newline] readPrec :: ReadPrec Newline readListPrec :: ReadPrec [Newline] | |
| Read NewlineMode | |
Defined in GHC.IO.Handle.Types Methods readsPrec :: Int -> ReadS NewlineMode readList :: ReadS [NewlineMode] readPrec :: ReadPrec NewlineMode readListPrec :: ReadPrec [NewlineMode] | |
| Read SomeSymbol | |
Defined in GHC.TypeLits Methods readsPrec :: Int -> ReadS SomeSymbol readList :: ReadS [SomeSymbol] readPrec :: ReadPrec SomeSymbol readListPrec :: ReadPrec [SomeSymbol] | |
| Read Content | |
Defined in Text.Hamlet.Parse Methods readsPrec :: Int -> ReadS Content readList :: ReadS [Content] readPrec :: ReadPrec Content readListPrec :: ReadPrec [Content] | |
| Read Doc | |
Defined in Text.Hamlet.Parse | |
| Read Binding | |
Defined in Text.Hamlet.Parse Methods readsPrec :: Int -> ReadS Binding readList :: ReadS [Binding] readPrec :: ReadPrec Binding readListPrec :: ReadPrec [Binding] | |
| Read DataConstr | |
Defined in Text.Hamlet.Parse Methods readsPrec :: Int -> ReadS DataConstr readList :: ReadS [DataConstr] readPrec :: ReadPrec DataConstr readListPrec :: ReadPrec [DataConstr] | |
| Read Module | |
Defined in Text.Hamlet.Parse Methods readsPrec :: Int -> ReadS Module readList :: ReadS [Module] readPrec :: ReadPrec Module readListPrec :: ReadPrec [Module] | |
| Read Line | |
Defined in Text.Hamlet.Parse Methods readsPrec :: Int -> ReadS Line readList :: ReadS [Line] readPrec :: ReadPrec Line readListPrec :: ReadPrec [Line] | |
| Read a => Read [a] | |
| Read a => Read (Maybe a) | |
| (Integral a, Read a) => Read (Ratio a) | |
| Read p => Read (Par1 p) | |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS (Par1 p) readList :: ReadS [Par1 p] readPrec :: ReadPrec (Par1 p) readListPrec :: ReadPrec [Par1 p] | |
| Read mono => Read (NonNull mono) | |
Defined in Data.NonNull | |
| Read m => Read (WrappedMonoid m) | |
Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (WrappedMonoid m) readList :: ReadS [WrappedMonoid m] readPrec :: ReadPrec (WrappedMonoid m) readListPrec :: ReadPrec [WrappedMonoid m] | |
| Read a => Read (Identity a) | |
Defined in Data.Functor.Identity | |
| Read a => Read (DList a) | |
Defined in Data.DList | |
| (Eq a, Hashable a, Read a) => Read (HashSet a) | |
Defined in Data.HashSet.Base | |
| Read a => Read (Vector a) | |
Defined in Data.Vector | |
| Read a => Read (Down a) | |
| (Read a, Ord a) => Read (Set a) | |
Defined in Data.Set.Internal | |
| Read e => Read (IntMap e) | |
Defined in Data.IntMap.Internal | |
| Read a => Read (Seq a) | |
Defined in Data.Sequence.Internal | |
| Read a => Read (NonEmpty a) | |
| Read a => Read (Single a) | |
Defined in Database.Persist.Sql.Types | |
| (Read (Key record), Read record) => Read (Entity record) | |
Defined in Database.Persist.Class.PersistEntity | |
| Read (Route WaiSubsiteWithAuth) | |
Defined in Yesod.Core.Types Methods readsPrec :: Int -> ReadS (Route WaiSubsiteWithAuth) readList :: ReadS [Route WaiSubsiteWithAuth] readPrec :: ReadPrec (Route WaiSubsiteWithAuth) readListPrec :: ReadPrec [Route WaiSubsiteWithAuth] | |
| Read (Route WaiSubsite) | |
Defined in Yesod.Core.Types Methods readsPrec :: Int -> ReadS (Route WaiSubsite) readList :: ReadS [Route WaiSubsite] readPrec :: ReadPrec (Route WaiSubsite) readListPrec :: ReadPrec [Route WaiSubsite] | |
| Read (Route LiteApp) | |
| Read (Route Static) | |
| HashAlgorithm a => Read (Digest a) | |
Defined in Crypto.Hash.Types Methods readsPrec :: Int -> ReadS (Digest a) readList :: ReadS [Digest a] readPrec :: ReadPrec (Digest a) readListPrec :: ReadPrec [Digest a] | |
| Read a => Read (Option a) | |
Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Option a) readList :: ReadS [Option a] readPrec :: ReadPrec (Option a) readListPrec :: ReadPrec [Option a] | |
| (Read a, Prim a) => Read (Vector a) | |
Defined in Data.Vector.Primitive Methods readsPrec :: Int -> ReadS (Vector a) readList :: ReadS [Vector a] readPrec :: ReadPrec (Vector a) readListPrec :: ReadPrec [Vector a] | |
| (Read a, Storable a) => Read (Vector a) | |
Defined in Data.Vector.Storable Methods readsPrec :: Int -> ReadS (Vector a) readList :: ReadS [Vector a] readPrec :: ReadPrec (Vector a) readListPrec :: ReadPrec [Vector a] | |
| (Read s, FoldCase s) => Read (CI s) | |
Defined in Data.CaseInsensitive.Internal Methods readsPrec :: Int -> ReadS (CI s) readList :: ReadS [CI s] readPrec :: ReadPrec (CI s) readListPrec :: ReadPrec [CI s] | |
| Read a => Read (Dual a) | |
Defined in Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS (Dual a) readList :: ReadS [Dual a] readPrec :: ReadPrec (Dual a) readListPrec :: ReadPrec [Dual a] | |
| Read a => Read (Product a) | |
Defined in Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS (Product a) readList :: ReadS [Product a] readPrec :: ReadPrec (Product a) readListPrec :: ReadPrec [Product a] | |
| Read a => Read (Sum a) | |
Defined in Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS (Sum a) readList :: ReadS [Sum a] readPrec :: ReadPrec (Sum a) readListPrec :: ReadPrec [Sum a] | |
| Read a => Read (ZipList a) | |
Defined in Control.Applicative Methods readsPrec :: Int -> ReadS (ZipList a) readList :: ReadS [ZipList a] readPrec :: ReadPrec (ZipList a) readListPrec :: ReadPrec [ZipList a] | |
| Read a => Read (ViewL a) | |
Defined in Data.Sequence.Internal Methods readsPrec :: Int -> ReadS (ViewL a) readList :: ReadS [ViewL a] readPrec :: ReadPrec (ViewL a) readListPrec :: ReadPrec [ViewL a] | |
| Read a => Read (ViewR a) | |
Defined in Data.Sequence.Internal Methods readsPrec :: Int -> ReadS (ViewR a) readList :: ReadS [ViewR a] readPrec :: ReadPrec (ViewR a) readListPrec :: ReadPrec [ViewR a] | |
| Read a => Read (Array a) | |
Defined in Data.Primitive.Array Methods readsPrec :: Int -> ReadS (Array a) readList :: ReadS [Array a] readPrec :: ReadPrec (Array a) readListPrec :: ReadPrec [Array a] | |
| Read a => Read (SmallArray a) | |
Defined in Data.Primitive.SmallArray Methods readsPrec :: Int -> ReadS (SmallArray a) readList :: ReadS [SmallArray a] readPrec :: ReadPrec (SmallArray a) readListPrec :: ReadPrec [SmallArray a] | |
| Read a => Read (First a) | |
Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (First a) readList :: ReadS [First a] readPrec :: ReadPrec (First a) readListPrec :: ReadPrec [First a] | |
| Read a => Read (Last a) | |
Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Last a) readList :: ReadS [Last a] readPrec :: ReadPrec (Last a) readListPrec :: ReadPrec [Last a] | |
| Read a => Read (Max a) | |
Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Max a) readList :: ReadS [Max a] readPrec :: ReadPrec (Max a) readListPrec :: ReadPrec [Max a] | |
| Read a => Read (Min a) | |
Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Min a) readList :: ReadS [Min a] readPrec :: ReadPrec (Min a) readListPrec :: ReadPrec [Min a] | |
| Read (AddrRange IPv4) | |
Defined in Data.IP.Range Methods readsPrec :: Int -> ReadS (AddrRange IPv4) readList :: ReadS [AddrRange IPv4] readPrec :: ReadPrec (AddrRange IPv4) readListPrec :: ReadPrec [AddrRange IPv4] | |
| Read (AddrRange IPv6) | |
Defined in Data.IP.Range Methods readsPrec :: Int -> ReadS (AddrRange IPv6) readList :: ReadS [AddrRange IPv6] readPrec :: ReadPrec (AddrRange IPv6) readListPrec :: ReadPrec [AddrRange IPv6] | |
| Read v => Read (Result v) | |
Defined in Text.Hamlet.Parse Methods readsPrec :: Int -> ReadS (Result v) readList :: ReadS [Result v] readPrec :: ReadPrec (Result v) readListPrec :: ReadPrec [Result v] | |
| (Read a, Read b) => Read (Either a b) | |
Defined in Data.Either | |
| Read (V1 p) | |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS (V1 p) readList :: ReadS [V1 p] readPrec :: ReadPrec (V1 p) readListPrec :: ReadPrec [V1 p] | |
| Read (U1 p) | |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS (U1 p) readList :: ReadS [U1 p] readPrec :: ReadPrec (U1 p) readListPrec :: ReadPrec [U1 p] | |
| (Read a, Read b) => Read (a, b) | |
| (Eq k, Hashable k, Read k, Read e) => Read (HashMap k e) | |
Defined in Data.HashMap.Base | |
| (Ord k, Read k, Read e) => Read (Map k e) | |
Defined in Data.Map.Internal | |
| (Read a, Read b) => Read (Arg a b) | |
Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Arg a b) readList :: ReadS [Arg a b] readPrec :: ReadPrec (Arg a b) readListPrec :: ReadPrec [Arg a b] | |
| (Ix a, Read a, Read b) => Read (Array a b) | |
| (Read1 f, Read a) => Read (Cofree f a) | |
Defined in Control.Comonad.Cofree Methods readsPrec :: Int -> ReadS (Cofree f a) readList :: ReadS [Cofree f a] readPrec :: ReadPrec (Cofree f a) readListPrec :: ReadPrec [Cofree f a] | |
| (Read1 f, Read a) => Read (Free f a) | |
Defined in Control.Monad.Free Methods readsPrec :: Int -> ReadS (Free f a) readList :: ReadS [Free f a] readPrec :: ReadPrec (Free f a) readListPrec :: ReadPrec [Free f a] | |
| (Read1 m, Read a) => Read (MaybeT m a) | |
Defined in Control.Monad.Trans.Maybe Methods readsPrec :: Int -> ReadS (MaybeT m a) readList :: ReadS [MaybeT m a] readPrec :: ReadPrec (MaybeT m a) readListPrec :: ReadPrec [MaybeT m a] | |
| Read (f p) => Read (Rec1 f p) | |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS (Rec1 f p) readList :: ReadS [Rec1 f p] readPrec :: ReadPrec (Rec1 f p) readListPrec :: ReadPrec [Rec1 f p] | |
| (Read a, Read b, Read c) => Read (a, b, c) | |
| (Read w, Read1 m, Read a) => Read (WriterT w m a) | |
Defined in Control.Monad.Trans.Writer.Lazy Methods readsPrec :: Int -> ReadS (WriterT w m a) readList :: ReadS [WriterT w m a] readPrec :: ReadPrec (WriterT w m a) readListPrec :: ReadPrec [WriterT w m a] | |
| Read b => Read (Tagged s b) | |
Defined in Data.Tagged Methods readsPrec :: Int -> ReadS (Tagged s b) readList :: ReadS [Tagged s b] readPrec :: ReadPrec (Tagged s b) readListPrec :: ReadPrec [Tagged s b] | |
| (Read e, Read1 m, Read a) => Read (ErrorT e m a) | |
Defined in Control.Monad.Trans.Error Methods readsPrec :: Int -> ReadS (ErrorT e m a) readList :: ReadS [ErrorT e m a] readPrec :: ReadPrec (ErrorT e m a) readListPrec :: ReadPrec [ErrorT e m a] | |
| Read (p a a) => Read (Join p a) | |
Defined in Data.Bifunctor.Join Methods readsPrec :: Int -> ReadS (Join p a) readList :: ReadS [Join p a] readPrec :: ReadPrec (Join p a) readListPrec :: ReadPrec [Join p a] | |
| (Read1 f, Read1 m, Read a) => Read (FreeT f m a) | |
Defined in Control.Monad.Trans.Free Methods readsPrec :: Int -> ReadS (FreeT f m a) readList :: ReadS [FreeT f m a] readPrec :: ReadPrec (FreeT f m a) readListPrec :: ReadPrec [FreeT f m a] | |
| (Read a, Read (f b)) => Read (FreeF f a b) | |
Defined in Control.Monad.Trans.Free Methods readsPrec :: Int -> ReadS (FreeF f a b) readList :: ReadS [FreeF f a b] readPrec :: ReadPrec (FreeF f a b) readListPrec :: ReadPrec [FreeF f a b] | |
| (Read w, Read1 m, Read a) => Read (WriterT w m a) | |
Defined in Control.Monad.Trans.Writer.Strict Methods readsPrec :: Int -> ReadS (WriterT w m a) readList :: ReadS [WriterT w m a] readPrec :: ReadPrec (WriterT w m a) readListPrec :: ReadPrec [WriterT w m a] | |
| Read (f a) => Read (Alt f a) | |
Defined in Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS (Alt f a) readList :: ReadS [Alt f a] readPrec :: ReadPrec (Alt f a) readListPrec :: ReadPrec [Alt f a] | |
| (Read e, Read1 m, Read a) => Read (ExceptT e m a) | |
Defined in Control.Monad.Trans.Except Methods readsPrec :: Int -> ReadS (ExceptT e m a) readList :: ReadS [ExceptT e m a] readPrec :: ReadPrec (ExceptT e m a) readListPrec :: ReadPrec [ExceptT e m a] | |
| Read c => Read (K1 i c p) | |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS (K1 i c p) readList :: ReadS [K1 i c p] readPrec :: ReadPrec (K1 i c p) readListPrec :: ReadPrec [K1 i c p] | |
| (Read (f p), Read (g p)) => Read ((f :+: g) p) | |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS ((f :+: g) p) readList :: ReadS [(f :+: g) p] readPrec :: ReadPrec ((f :+: g) p) readListPrec :: ReadPrec [(f :+: g) p] | |
| (Read (f p), Read (g p)) => Read ((f :*: g) p) | |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS ((f :*: g) p) readList :: ReadS [(f :*: g) p] readPrec :: ReadPrec ((f :*: g) p) readListPrec :: ReadPrec [(f :*: g) p] | |
| (Read a, Read b, Read c, Read d) => Read (a, b, c, d) | |
| Read (f p) => Read (M1 i c f p) | |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS (M1 i c f p) readList :: ReadS [M1 i c f p] readPrec :: ReadPrec (M1 i c f p) readListPrec :: ReadPrec [M1 i c f p] | |
| Read (f (g p)) => Read ((f :.: g) p) | |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS ((f :.: g) p) readList :: ReadS [(f :.: g) p] readPrec :: ReadPrec ((f :.: g) p) readListPrec :: ReadPrec [(f :.: g) p] | |
| (Read a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e) | |
| Read (f a) => Read (Clown f a b) | |
Defined in Data.Bifunctor.Clown Methods readsPrec :: Int -> ReadS (Clown f a b) readList :: ReadS [Clown f a b] readPrec :: ReadPrec (Clown f a b) readListPrec :: ReadPrec [Clown f a b] | |
| Read (p b a) => Read (Flip p a b) | |
Defined in Data.Bifunctor.Flip Methods readsPrec :: Int -> ReadS (Flip p a b) readList :: ReadS [Flip p a b] readPrec :: ReadPrec (Flip p a b) readListPrec :: ReadPrec [Flip p a b] | |
| Read (g b) => Read (Joker g a b) | |
Defined in Data.Bifunctor.Joker Methods readsPrec :: Int -> ReadS (Joker g a b) readList :: ReadS [Joker g a b] readPrec :: ReadPrec (Joker g a b) readListPrec :: ReadPrec [Joker g a b] | |
| Read (p a b) => Read (WrappedBifunctor p a b) | |
Defined in Data.Bifunctor.Wrapped Methods readsPrec :: Int -> ReadS (WrappedBifunctor p a b) readList :: ReadS [WrappedBifunctor p a b] readPrec :: ReadPrec (WrappedBifunctor p a b) readListPrec :: ReadPrec [WrappedBifunctor p a b] | |
| (Read a, Read b, Read c, Read d, Read e, Read f) => Read (a, b, c, d, e, f) | |
| (Read (f a b), Read (g a b)) => Read (Product f g a b) | |
Defined in Data.Bifunctor.Product Methods readsPrec :: Int -> ReadS (Product f g a b) readList :: ReadS [Product f g a b] readPrec :: ReadPrec (Product f g a b) readListPrec :: ReadPrec [Product f g a b] | |
| (Read (p a b), Read (q a b)) => Read (Sum p q a b) | |
Defined in Data.Bifunctor.Sum Methods readsPrec :: Int -> ReadS (Sum p q a b) readList :: ReadS [Sum p q a b] readPrec :: ReadPrec (Sum p q a b) readListPrec :: ReadPrec [Sum p q a b] | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read (a, b, c, d, e, f, g) | |
| Read (f (p a b)) => Read (Tannen f p a b) | |
Defined in Data.Bifunctor.Tannen Methods readsPrec :: Int -> ReadS (Tannen f p a b) readList :: ReadS [Tannen f p a b] readPrec :: ReadPrec (Tannen f p a b) readListPrec :: ReadPrec [Tannen f p a b] | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h) => Read (a, b, c, d, e, f, g, h) | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i) => Read (a, b, c, d, e, f, g, h, i) | |
| Read (p (f a) (g b)) => Read (Biff p f g a b) | |
Defined in Data.Bifunctor.Biff Methods readsPrec :: Int -> ReadS (Biff p f g a b) readList :: ReadS [Biff p f g a b] readPrec :: ReadPrec (Biff p f g a b) readListPrec :: ReadPrec [Biff p f g a b] | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j) => Read (a, b, c, d, e, f, g, h, i, j) | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k) => Read (a, b, c, d, e, f, g, h, i, j, k) | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l) => Read (a, b, c, d, e, f, g, h, i, j, k, l) | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m) | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n, Read o) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | |
Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] | |
class (Num a, Ord a) => Real a where #
Methods
toRational :: a -> Rational #
Instances
| Real Int | |
Defined in GHC.Real Methods toRational :: Int -> Rational # | |
| Real Int8 | |
Defined in GHC.Int Methods toRational :: Int8 -> Rational # | |
| Real Int16 | |
Defined in GHC.Int Methods toRational :: Int16 -> Rational # | |
| Real Int32 | |
Defined in GHC.Int Methods toRational :: Int32 -> Rational # | |
| Real Int64 | |
Defined in GHC.Int Methods toRational :: Int64 -> Rational # | |
| Real Integer | |
Defined in GHC.Real Methods toRational :: Integer -> Rational # | |
| Real Natural | |
Defined in GHC.Real Methods toRational :: Natural -> Rational # | |
| Real Word | |
Defined in GHC.Real Methods toRational :: Word -> Rational # | |
| Real Word8 | |
Defined in GHC.Word Methods toRational :: Word8 -> Rational # | |
| Real Word16 | |
Defined in GHC.Word Methods toRational :: Word16 -> Rational # | |
| Real Word32 | |
Defined in GHC.Word Methods toRational :: Word32 -> Rational # | |
| Real Word64 | |
Defined in GHC.Word Methods toRational :: Word64 -> Rational # | |
| Real Scientific | |
Defined in Data.Scientific Methods toRational :: Scientific -> Rational # | |
| Real CTime | |
Defined in Foreign.C.Types Methods toRational :: CTime -> Rational # | |
| Real CInt | |
Defined in Foreign.C.Types Methods toRational :: CInt -> Rational # | |
| Real CChar | |
Defined in Foreign.C.Types Methods toRational :: CChar -> Rational # | |
| Real CSize | |
Defined in Foreign.C.Types Methods toRational :: CSize -> Rational # | |
| Real DiffTime | |
Defined in Data.Time.Clock.Internal.DiffTime Methods toRational :: DiffTime -> Rational # | |
| Real NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods toRational :: NominalDiffTime -> Rational # | |
| Real CBool | |
Defined in Foreign.C.Types Methods toRational :: CBool -> Rational # | |
| Real CClock | |
Defined in Foreign.C.Types Methods toRational :: CClock -> Rational # | |
| Real CDouble | |
Defined in Foreign.C.Types Methods toRational :: CDouble -> Rational # | |
| Real CFloat | |
Defined in Foreign.C.Types Methods toRational :: CFloat -> Rational # | |
| Real CIntMax | |
Defined in Foreign.C.Types Methods toRational :: CIntMax -> Rational # | |
| Real CIntPtr | |
Defined in Foreign.C.Types Methods toRational :: CIntPtr -> Rational # | |
| Real CLLong | |
Defined in Foreign.C.Types Methods toRational :: CLLong -> Rational # | |
| Real CLong | |
Defined in Foreign.C.Types Methods toRational :: CLong -> Rational # | |
| Real CPtrdiff | |
Defined in Foreign.C.Types Methods toRational :: CPtrdiff -> Rational # | |
| Real CSChar | |
Defined in Foreign.C.Types Methods toRational :: CSChar -> Rational # | |
| Real CSUSeconds | |
Defined in Foreign.C.Types Methods toRational :: CSUSeconds -> Rational # | |
| Real CShort | |
Defined in Foreign.C.Types Methods toRational :: CShort -> Rational # | |
| Real CSigAtomic | |
Defined in Foreign.C.Types Methods toRational :: CSigAtomic -> Rational # | |
| Real CUChar | |
Defined in Foreign.C.Types Methods toRational :: CUChar -> Rational # | |
| Real CUInt | |
Defined in Foreign.C.Types Methods toRational :: CUInt -> Rational # | |
| Real CUIntMax | |
Defined in Foreign.C.Types Methods toRational :: CUIntMax -> Rational # | |
| Real CUIntPtr | |
Defined in Foreign.C.Types Methods toRational :: CUIntPtr -> Rational # | |
| Real CULLong | |
Defined in Foreign.C.Types Methods toRational :: CULLong -> Rational # | |
| Real CULong | |
Defined in Foreign.C.Types Methods toRational :: CULong -> Rational # | |
| Real CUSeconds | |
Defined in Foreign.C.Types Methods toRational :: CUSeconds -> Rational # | |
| Real CUShort | |
Defined in Foreign.C.Types Methods toRational :: CUShort -> Rational # | |
| Real CWchar | |
Defined in Foreign.C.Types Methods toRational :: CWchar -> Rational # | |
| Real PortNumber | |
Defined in Network.Socket.Types Methods toRational :: PortNumber -> Rational # | |
| Integral a => Real (Ratio a) | |
Defined in GHC.Real Methods toRational :: Ratio a -> Rational # | |
| Real a => Real (Identity a) | |
Defined in Data.Functor.Identity Methods toRational :: Identity a -> Rational # | |
| Real a => Real (Tagged s a) | |
Defined in Data.Tagged Methods toRational :: Tagged s a -> Rational # | |
class (RealFrac a, Floating a) => RealFloat a where #
Minimal complete definition
floatRadix, floatDigits, floatRange, decodeFloat, encodeFloat, isNaN, isInfinite, isDenormalized, isNegativeZero, isIEEE
Methods
floatRadix :: a -> Integer #
floatDigits :: a -> Int #
floatRange :: a -> (Int, Int) #
decodeFloat :: a -> (Integer, Int) #
encodeFloat :: Integer -> Int -> a #
significand :: a -> a #
scaleFloat :: Int -> a -> a #
isInfinite :: a -> Bool #
isDenormalized :: a -> Bool #
isNegativeZero :: a -> Bool #
Instances
class (Real a, Fractional a) => RealFrac a where #
Minimal complete definition
Methods
properFraction :: Integral b => a -> (b, a) #
truncate :: Integral b => a -> b #
round :: Integral b => a -> b #
Instances
| Show Bool | |
| Show Char | |
| Show Int | |
| Show Int8 | |
| Show Int16 | |
| Show Int32 | |
| Show Int64 | |
| Show Integer | |
| Show Natural | |
| Show Ordering | |
| Show Word | |
| Show Word8 | |
| Show Word16 | |
| Show Word32 | |
| Show Word64 | |
| Show RuntimeRep | |
| Show VecCount | |
| Show VecElem | |
| Show CallStack | |
| Show SomeTypeRep | |
| Show Exp | |
| Show Match | |
| Show Clause | |
| Show Pat | |
| Show Type | |
| Show Dec | |
| Show Name | |
| Show FunDep | |
| Show InjectivityAnn | |
| Show Overlap | |
| Show () | |
| Show TyCon | |
| Show Module | |
| Show TrName | |
| Show KindRep | |
| Show TypeLitSort | |
| Show Con | |
| Show ByteString | |
Defined in Data.ByteString.Internal Methods showsPrec :: Int -> ByteString -> ShowS # show :: ByteString -> String # showList :: [ByteString] -> ShowS # | |
| Show ByteString | |
| Show Builder | |
| Show Scientific | |
| Show JSONPathElement | |
Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> JSONPathElement -> ShowS # show :: JSONPathElement -> String # showList :: [JSONPathElement] -> ShowS # | |
| Show Value | |
| Show DotNetTime | |
Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> DotNetTime -> ShowS # show :: DotNetTime -> String # showList :: [DotNetTime] -> ShowS # | |
| Show Options | |
| Show SumEncoding | |
Defined in Data.Aeson.Types.Internal Methods showsPrec :: Int -> SumEncoding -> ShowS # show :: SumEncoding -> String # showList :: [SumEncoding] -> ShowS # | |
| Show SomeAsyncException | |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> SomeAsyncException -> ShowS # show :: SomeAsyncException -> String # showList :: [SomeAsyncException] -> ShowS # | |
| Show StringException | |
Defined in UnliftIO.Exception Methods showsPrec :: Int -> StringException -> ShowS # show :: StringException -> String # showList :: [StringException] -> ShowS # | |
| Show AsyncExceptionWrapper | |
Defined in UnliftIO.Exception Methods showsPrec :: Int -> AsyncExceptionWrapper -> ShowS # show :: AsyncExceptionWrapper -> String # showList :: [AsyncExceptionWrapper] -> ShowS # | |
| Show SyncExceptionWrapper | |
Defined in UnliftIO.Exception Methods showsPrec :: Int -> SyncExceptionWrapper -> ShowS # show :: SyncExceptionWrapper -> String # showList :: [SyncExceptionWrapper] -> ShowS # | |
| Show BufferMode | |
Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> BufferMode -> ShowS # show :: BufferMode -> String # showList :: [BufferMode] -> ShowS # | |
| Show SeekMode | |
| Show IOMode | |
| Show ConcException | |
Defined in UnliftIO.Internals.Async Methods showsPrec :: Int -> ConcException -> ShowS # show :: ConcException -> String # showList :: [ConcException] -> ShowS # | |
| Show Handle | |
| Show SomeException | |
Defined in GHC.Exception.Type Methods showsPrec :: Int -> SomeException -> ShowS # show :: SomeException -> String # showList :: [SomeException] -> ShowS # | |
| Show IOException | |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOException -> ShowS # show :: IOException -> String # showList :: [IOException] -> ShowS # | |
| Show IntSet | |
| Show IOErrorType | |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOErrorType -> ShowS # show :: IOErrorType -> String # showList :: [IOErrorType] -> ShowS # | |
| Show ReleaseType | |
Defined in Data.Acquire.Internal Methods showsPrec :: Int -> ReleaseType -> ShowS # show :: ReleaseType -> String # showList :: [ReleaseType] -> ShowS # | |
| Show Void | |
| Show StreamFileStatus | |
Defined in Network.HTTP.Client.Types Methods showsPrec :: Int -> StreamFileStatus -> ShowS # show :: StreamFileStatus -> String # showList :: [StreamFileStatus] -> ShowS # | |
| Show ResponseTimeout | |
Defined in Network.HTTP.Client.Types Methods showsPrec :: Int -> ResponseTimeout -> ShowS # show :: ResponseTimeout -> String # showList :: [ResponseTimeout] -> ShowS # | |
| Show Request | |
| Show Proxy | |
| Show CookieJar | |
| Show Cookie | |
| Show HttpExceptionContent | |
Defined in Network.HTTP.Client.Types Methods showsPrec :: Int -> HttpExceptionContent -> ShowS # show :: HttpExceptionContent -> String # showList :: [HttpExceptionContent] -> ShowS # | |
| Show HttpException | |
Defined in Network.HTTP.Client.Types Methods showsPrec :: Int -> HttpException -> ShowS # show :: HttpException -> String # showList :: [HttpException] -> ShowS # | |
| Show HttpVersion | |
Defined in Network.HTTP.Types.Version Methods showsPrec :: Int -> HttpVersion -> ShowS # show :: HttpVersion -> String # showList :: [HttpVersion] -> ShowS # | |
| Show EscapeItem | |
Defined in Network.HTTP.Types.URI Methods showsPrec :: Int -> EscapeItem -> ShowS # show :: EscapeItem -> String # showList :: [EscapeItem] -> ShowS # | |
| Show Status | |
| Show StdMethod | |
| Show ByteRange | |
| Show Token | |
| Show Column | |
| Show PersistentSqlException | |
Defined in Database.Persist.Sql.Types Methods showsPrec :: Int -> PersistentSqlException -> ShowS # show :: PersistentSqlException -> String # showList :: [PersistentSqlException] -> ShowS # | |
| Show IsolationLevel | |
Defined in Database.Persist.Sql.Types.Internal Methods showsPrec :: Int -> IsolationLevel -> ShowS # show :: IsolationLevel -> String # showList :: [IsolationLevel] -> ShowS # | |
| Show Checkmark | |
| Show IsNullable | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> IsNullable -> ShowS # show :: IsNullable -> String # showList :: [IsNullable] -> ShowS # | |
| Show WhyNullable | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> WhyNullable -> ShowS # show :: WhyNullable -> String # showList :: [WhyNullable] -> ShowS # | |
| Show EntityDef | |
| Show HaskellName | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> HaskellName -> ShowS # show :: HaskellName -> String # showList :: [HaskellName] -> ShowS # | |
| Show DBName | |
| Show FieldType | |
| Show FieldDef | |
| Show ReferenceDef | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> ReferenceDef -> ShowS # show :: ReferenceDef -> String # showList :: [ReferenceDef] -> ShowS # | |
| Show EmbedEntityDef | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> EmbedEntityDef -> ShowS # show :: EmbedEntityDef -> String # showList :: [EmbedEntityDef] -> ShowS # | |
| Show EmbedFieldDef | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> EmbedFieldDef -> ShowS # show :: EmbedFieldDef -> String # showList :: [EmbedFieldDef] -> ShowS # | |
| Show UniqueDef | |
| Show CompositeDef | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> CompositeDef -> ShowS # show :: CompositeDef -> String # showList :: [CompositeDef] -> ShowS # | |
| Show ForeignDef | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> ForeignDef -> ShowS # show :: ForeignDef -> String # showList :: [ForeignDef] -> ShowS # | |
| Show PersistException | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> PersistException -> ShowS # show :: PersistException -> String # showList :: [PersistException] -> ShowS # | |
| Show PersistValue | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> PersistValue -> ShowS # show :: PersistValue -> String # showList :: [PersistValue] -> ShowS # | |
| Show SqlType | |
| Show PersistFilter | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> PersistFilter -> ShowS # show :: PersistFilter -> String # showList :: [PersistFilter] -> ShowS # | |
| Show UpdateException | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> UpdateException -> ShowS # show :: UpdateException -> String # showList :: [UpdateException] -> ShowS # | |
| Show OnlyUniqueException | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> OnlyUniqueException -> ShowS # show :: OnlyUniqueException -> String # showList :: [OnlyUniqueException] -> ShowS # | |
| Show PersistUpdate | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> PersistUpdate -> ShowS # show :: PersistUpdate -> String # showList :: [PersistUpdate] -> ShowS # | |
| Show FormMessage | |
Defined in Yesod.Form.Types Methods showsPrec :: Int -> FormMessage -> ShowS # show :: FormMessage -> String # showList :: [FormMessage] -> ShowS # | |
| Show Ints | |
| Show Textarea | |
| Show Header | |
| Show ErrorResponse | |
Defined in Yesod.Core.Types Methods showsPrec :: Int -> ErrorResponse -> ShowS # show :: ErrorResponse -> String # showList :: [ErrorResponse] -> ShowS # | |
| Show AuthResult | |
Defined in Yesod.Core.Types Methods showsPrec :: Int -> AuthResult -> ShowS # show :: AuthResult -> String # showList :: [AuthResult] -> ShowS # | |
| Show LogLevel | |
| Show Request | |
| Show MD5 | |
| Show NameFlavour | |
| Show CTime | |
| Show All | |
| Show SrcLoc | |
| Show Any | |
| Show EntityDefSqlTypeExp | |
| Show SqlTypeExp | |
| Show FTTypeConDescr | |
| Show OccName | |
| Show Body | |
| Show Lit | |
| Show URIAuth | |
| Show ResponseClose | |
| Show URI | |
| Show AddrInfo | |
| Show AddrInfoFlag | |
| Show NameInfoFlag | |
| Show Family | |
| Show CInt | |
| Show SocketType | |
| Show CChar | |
| Show CSize | |
| Show More | |
| Show Pos | |
| Show DiffTime | |
| Show TimeLocale | |
| Show LocalTime | |
| Show NominalDiffTime | |
| Show TimeOfDay | |
| Show ZonedTime | |
| Show Version | |
| Show Associativity | |
| Show DecidedStrictness | |
| Show Fixity | |
| Show SourceStrictness | |
| Show SourceUnpackedness | |
| Show NullError | |
| Show Mode | |
| Show Style | |
| Show TextDetails | |
| Show Doc | |
| Show ByteArray | |
| Show ThreadId | |
| Show BlockedIndefinitelyOnSTM | |
| Show CBool | |
| Show CClock | |
| Show CDouble | |
| Show CFloat | |
| Show CIntMax | |
| Show CIntPtr | |
| Show CLLong | |
| Show CLong | |
| Show CPtrdiff | |
| Show CSChar | |
| Show CSUSeconds | |
| Show CShort | |
| Show CSigAtomic | |
| Show CUChar | |
| Show CUInt | |
| Show CUIntMax | |
| Show CUIntPtr | |
| Show CULLong | |
| Show CULong | |
| Show CUSeconds | |
| Show CUShort | |
| Show CWchar | |
| Show Encoding | |
| Show String | |
| Show ASCII7_Invalid | |
| Show ISO_8859_1_Invalid | |
| Show UTF16_Invalid | |
| Show UTF32_Invalid | |
| Show FileSize | |
| Show Curve_Edwards25519 | |
| Show Curve_P256R1 | |
| Show Curve_P384R1 | |
| Show Curve_P521R1 | |
| Show Curve_X25519 | |
| Show Curve_X448 | |
| Show CryptoError | |
| Show Blake2b_160 | |
| Show Blake2b_224 | |
| Show Blake2b_256 | |
| Show Blake2b_384 | |
| Show Blake2b_512 | |
| Show Blake2bp_512 | |
| Show Blake2s_160 | |
| Show Blake2s_224 | |
| Show Blake2s_256 | |
| Show Blake2sp_224 | |
| Show Blake2sp_256 | |
| Show Keccak_224 | |
| Show Keccak_256 | |
| Show Keccak_384 | |
| Show Keccak_512 | |
| Show MD2 | |
| Show MD4 | |
| Show RIPEMD160 | |
| Show SHA1 | |
| Show SHA224 | |
| Show SHA256 | |
| Show SHA3_224 | |
| Show SHA3_256 | |
| Show SHA3_384 | |
| Show SHA3_512 | |
| Show SHA384 | |
| Show SHA512 | |
| Show SHA512t_224 | |
| Show SHA512t_256 | |
| Show Skein256_224 | |
| Show Skein256_256 | |
| Show Skein512_224 | |
| Show Skein512_256 | |
| Show Skein512_384 | |
| Show Skein512_512 | |
| Show Tiger | |
| Show Whirlpool | |
| Show ConnHost | |
| Show ConnKey | |
| Show HttpExceptionContentWrapper | |
| Show StatusHeaders | |
| Show CompressionLevel | |
| Show CompressionStrategy | |
| Show DictionaryHash | |
| Show Format | |
| Show MemoryLevel | |
| Show Method | |
| Show WindowBits | |
| Show LogStr | |
| Show Loc | |
| Show UUID | |
| Show UnpackedUUID | |
| Show EmailAddress | |
| Show IP | |
| Show IPv4 | |
| Show IPv6 | |
| Show PortNumber | |
| Show IPRange | |
| Show Content | |
| Show VarType | |
| Show Content | |
| Show RequestBodyLength | |
| Show ClientSessionDateCache | |
| Show HandlerContents | |
| Show SessionCookie | |
| Show FilePart | |
| Show SetCookie | |
| Show Content | |
| Show Doctype | |
| Show Document | |
| Show Element | |
| Show Event | |
| Show ExternalID | |
| Show Instruction | |
| Show Miscellaneous | |
| Show Name | |
| Show Node | |
| Show Prologue | |
| Show AllocationLimitExceeded | |
| Show ArrayException | |
| Show AssertionFailed | |
| Show AsyncException | |
| Show BlockedIndefinitelyOnMVar | |
| Show CompactionFailed | |
| Show Deadlock | |
| Show ExitCode | |
| Show FixIOException | |
| Show ArithException | |
| Show BlockReason | |
| Show ThreadStatus | |
| Show MaskingState | |
| Show HandleType | |
| Show Newline | |
| Show NewlineMode | |
| Show AsyncCancelled | |
| Show ExceptionInLinkedThread | |
| Show InvalidAccess | |
| Show ResourceCleanupException | |
| Show Socket | |
| Show SameSiteOption | |
| Show SomeSymbol | |
| Show AnnLookup | |
| Show AnnTarget | |
| Show Bang | |
| Show Callconv | |
| Show DecidedStrictness | |
| Show DerivClause | |
| Show DerivStrategy | |
| Show FamilyResultSig | |
| Show Fixity | |
| Show FixityDirection | |
| Show Foreign | |
| Show Guard | |
| Show Info | |
| Show Inline | |
| Show ModName | |
| Show Module | |
| Show ModuleInfo | |
| Show NameSpace | |
| Show PatSynArgs | |
| Show PatSynDir | |
| Show Phases | |
| Show PkgName | |
| Show Pragma | |
| Show Range | |
| Show Role | |
| Show RuleBndr | |
| Show RuleMatch | |
| Show Safety | |
| Show SourceStrictness | |
| Show SourceUnpackedness | |
| Show Stmt | |
| Show TyLit | |
| Show TySynEqn | |
| Show TyVarBndr | |
| Show TypeFamilyHead | |
| Show LinesWithComments | |
| Show NewlineStyle | |
| Show Content | |
| Show Doc | |
| Show Bound | |
| Show Key | |
| Show IV | |
| Show Etag | |
| Show Binding | |
| Show DataConstr | |
| Show Module | |
| Show Line | |
| Show TagPiece | |
| Show TypeTree | |
| Show AbsoluteSize | |
| Show AbsoluteUnit | |
| Show Color | |
| Show EmSize | |
| Show ExSize | |
| Show PercentageSize | |
| Show PixelSize | |
| Show a => Show [a] | |
| Show a => Show (Maybe a) | |
| Show a => Show (Ratio a) | |
| Show p => Show (Par1 p) | |
| Show (Encoding' a) | |
| Show a => Show (IResult a) | |
| Show a => Show (Result a) | |
| Show (Memoized a) | |
| Show mono => Show (NonNull mono) | |
| Show m => Show (WrappedMonoid m) | |
Defined in Data.Semigroup Methods showsPrec :: Int -> WrappedMonoid m -> ShowS # show :: WrappedMonoid m -> String # showList :: [WrappedMonoid m] -> ShowS # | |
| Show a => Show (Identity a) | |
| Show a => Show (DList a) | |
| Show a => Show (HashSet a) | |
| Show a => Show (Vector a) | |
| Show a => Show (Down a) | |
| Show a => Show (Set a) | |
| Show a => Show (IntMap a) | |
| Show a => Show (Seq a) | |
| Show a => Show (Flush a) | |
| Show body => Show (Response body) | |
| Show body => Show (HistoriedResponse body) | |
Defined in Network.HTTP.Client Methods showsPrec :: Int -> HistoriedResponse body -> ShowS # show :: HistoriedResponse body -> String # showList :: [HistoriedResponse body] -> ShowS # | |
| Show a => Show (NonEmpty a) | |
| Show (f Text) => Show (Line' f) | |
| Show a => Show (Single a) | |
| (Show (Key record), Show record) => Show (Entity record) | |
| Show a => Show (FormResult a) | |
Defined in Yesod.Form.Types Methods showsPrec :: Int -> FormResult a -> ShowS # show :: FormResult a -> String # showList :: [FormResult a] -> ShowS # | |
| Show (Route WaiSubsiteWithAuth) | |
Defined in Yesod.Core.Types Methods showsPrec :: Int -> Route WaiSubsiteWithAuth -> ShowS # show :: Route WaiSubsiteWithAuth -> String # showList :: [Route WaiSubsiteWithAuth] -> ShowS # | |
| Show (Route WaiSubsite) | |
Defined in Yesod.Core.Types Methods showsPrec :: Int -> Route WaiSubsite -> ShowS # show :: Route WaiSubsite -> String # showList :: [Route WaiSubsite] -> ShowS # | |
| Show (Route LiteApp) | |
| Show (Route Static) | |
| Show (Digest a) | |
| Show a => Show (Option a) | |
| (Show a, Prim a) => Show (Vector a) | |
| (Show a, Storable a) => Show (Vector a) | |
| Show s => Show (CI s) | |
| (PrimType ty, Show ty) => Show (UArray ty) | |
| Show (Offset ty) | |
| Show (CountOf ty) | |
| (PrimType ty, Show ty) => Show (Block ty) | |
| Show a => Show (NonEmpty a) | |
| Show a => Show (Dual a) | |
| Show a => Show (Product a) | |
| Show a => Show (Sum a) | |
| Show a => Show (ZipList a) | |
| Show a => Show (ViewL a) | |
| Show a => Show (ViewR a) | |
| Show a => Show (AnnotDetails a) | |
| Show (Doc a) | |
| Show a => Show (Span a) | |
| Show a => Show (Array a) | |
| (Show a, Prim a) => Show (PrimArray a) | |
| Show a => Show (SmallArray a) | |
| Show a => Show (First a) | |
| Show a => Show (Last a) | |
| Show a => Show (Max a) | |
| Show a => Show (Min a) | |
| Show (Zn n) | |
| Show (Zn64 n) | |
| Show a => Show (CryptoFailable a) | |
| Show (Blake2b bitlen) | |
| Show (Blake2bp bitlen) | |
| Show (Blake2s bitlen) | |
| Show (Blake2sp bitlen) | |
| Show (SHAKE128 bitlen) | |
| Show (SHAKE256 bitlen) | |
| Show a => Show (ExitCase a) | |
| Show a => Show (AddrRange a) | |
| Show c => Show (FileInfo c) | |
| Show url => Show (Script url) | |
| Show url => Show (Stylesheet url) | |
| Show url => Show (Location url) | |
| Show a => Show (Hashed a) | |
| Show (Pool a) | |
| Show a => Show (ParseState a) | |
| Show v => Show (Result v) | |
| Show typ => Show (ResourceTree typ) | |
| Show typ => Show (Dispatch typ) | |
| Show a => Show (FlatResource a) | |
| Show typ => Show (Piece typ) | |
| Show typ => Show (Resource typ) | |
| (Show a, Show b) => Show (Either a b) | |
| Show (V1 p) | |
| Show (U1 p) | |
| Show (TypeRep a) | |
| (Show a, Show b) => Show (a, b) | |
| (Show k, Show v) => Show (HashMap k v) | |
| (Show k, Show a) => Show (Map k a) | |
| (Show a, Show b) => Show (Fragment a b) | |
| (Show a, Show b) => Show (Arg a b) | |
| Show (ST s a) | |
| (Show i, Show r) => Show (IResult i r) | |
| (Show1 f, Show a) => Show (Cofree f a) | |
| (Show1 f, Show a) => Show (Free f a) | |
| (Show1 m, Show a) => Show (MaybeT m a) | |
| Show (VarExp msg url) | |
| Show (f p) => Show (Rec1 f p) | |
| Show (URec Char p) | |
| Show (URec Double p) | |
| Show (URec Float p) | |
| Show (URec Int p) | |
| Show (URec Word p) | |
| (Show a, Show b, Show c) => Show (a, b, c) | |
| (Show w, Show1 m, Show a) => Show (WriterT w m a) | |
| Show b => Show (Tagged s b) | |
| (Show e, Show1 m, Show a) => Show (ErrorT e m a) | |
| Show (p a a) => Show (Join p a) | |
| (Show1 f, Show1 m, Show a) => Show (FreeT f m a) | |
| (Show a, Show (f b)) => Show (FreeF f a b) | |
| (Show w, Show1 m, Show a) => Show (WriterT w m a) | |
| Show (f a) => Show (Alt f a) | |
| (Show e, Show1 m, Show a) => Show (ExceptT e m a) | |
| Show c => Show (K1 i c p) | |
| (Show (f p), Show (g p)) => Show ((f :+: g) p) | |
| (Show (f p), Show (g p)) => Show ((f :*: g) p) | |
| (Show a, Show b, Show c, Show d) => Show (a, b, c, d) | |
| Show (f p) => Show (M1 i c f p) | |
| Show (f (g p)) => Show ((f :.: g) p) | |
| (Show a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e) | |
| Show (f a) => Show (Clown f a b) | |
| Show (p b a) => Show (Flip p a b) | |
| Show (g b) => Show (Joker g a b) | |
| Show (p a b) => Show (WrappedBifunctor p a b) | |
| (Show a, Show b, Show c, Show d, Show e, Show f) => Show (a, b, c, d, e, f) | |
| (Show (f a b), Show (g a b)) => Show (Product f g a b) | |
| (Show (p a b), Show (q a b)) => Show (Sum p q a b) | |
| (Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show (a, b, c, d, e, f, g) | |
| Show (f (p a b)) => Show (Tannen f p a b) | |
| (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h) => Show (a, b, c, d, e, f, g, h) | |
| (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i) => Show (a, b, c, d, e, f, g, h, i) | |
| Show (p (f a) (g b)) => Show (Biff p f g a b) | |
| (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j) => Show (a, b, c, d, e, f, g, h, i, j) | |
| (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k) => Show (a, b, c, d, e, f, g, h, i, j, k) | |
| (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l) => Show (a, b, c, d, e, f, g, h, i, j, k, l) | |
| (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m) | |
| (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | |
| (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n, Show o) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | |
Methods
fromString :: String -> a #
Instances
class Functor f => Applicative (f :: Type -> Type) where #
Instances
| Applicative [] | |
| Applicative Maybe | |
| Applicative IO | |
| Applicative Par1 | |
| Applicative Q | |
| Applicative IResult | |
| Applicative Result | |
| Applicative Parser | |
| Applicative STM | |
| Applicative Memoized | |
| Applicative Identity | |
| Applicative DList | |
| Applicative Vector | |
| Applicative Down | |
| Applicative Seq | |
| Applicative Acquire | |
| Applicative NonEmpty | |
| Applicative FormResult | |
Defined in Yesod.Form.Types Methods pure :: a -> FormResult a # (<*>) :: FormResult (a -> b) -> FormResult a -> FormResult b # liftA2 :: (a -> b -> c) -> FormResult a -> FormResult b -> FormResult c # (*>) :: FormResult a -> FormResult b -> FormResult b # (<*) :: FormResult a -> FormResult b -> FormResult a # | |
| Applicative P | |
| Applicative Option | |
| Applicative ReadP | |
| Applicative Dual | |
| Applicative Product | |
| Applicative Sum | |
| Applicative ZipList | |
| Applicative Array | |
| Applicative SmallArray | |
Defined in Data.Primitive.SmallArray | |
| Applicative Flat | |
| Applicative FlatApp | |
| Applicative First | |
| Applicative Last | |
| Applicative Max | |
| Applicative Min | |
| Applicative CryptoFailable | |
Defined in Crypto.Error.Types Methods pure :: a -> CryptoFailable a # (<*>) :: CryptoFailable (a -> b) -> CryptoFailable a -> CryptoFailable b # liftA2 :: (a -> b -> c) -> CryptoFailable a -> CryptoFailable b -> CryptoFailable c # (*>) :: CryptoFailable a -> CryptoFailable b -> CryptoFailable b # (<*) :: CryptoFailable a -> CryptoFailable b -> CryptoFailable a # | |
| Applicative Stream | |
| Applicative MarkupM | |
| Applicative Concurrently | |
Defined in Control.Concurrent.Async | |
| Applicative Put | |
| Applicative Result | |
| Applicative (Either e) | |
| Applicative (U1 :: Type -> Type) | |
| Monoid a => Applicative ((,) a) | |
| MonadUnliftIO m => Applicative (Conc m) | |
| MonadUnliftIO m => Applicative (Concurrently m) | |
Defined in UnliftIO.Internals.Async Methods pure :: a -> Concurrently m a # (<*>) :: Concurrently m (a -> b) -> Concurrently m a -> Concurrently m b # liftA2 :: (a -> b -> c) -> Concurrently m a -> Concurrently m b -> Concurrently m c # (*>) :: Concurrently m a -> Concurrently m b -> Concurrently m b # (<*) :: Concurrently m a -> Concurrently m b -> Concurrently m a # | |
| Applicative f => Applicative (WrappedPoly f) | |
Defined in Data.MonoTraversable Methods pure :: a -> WrappedPoly f a # (<*>) :: WrappedPoly f (a -> b) -> WrappedPoly f a -> WrappedPoly f b # liftA2 :: (a -> b -> c) -> WrappedPoly f a -> WrappedPoly f b -> WrappedPoly f c # (*>) :: WrappedPoly f a -> WrappedPoly f b -> WrappedPoly f b # (<*) :: WrappedPoly f a -> WrappedPoly f b -> WrappedPoly f a # | |
| Applicative m => Applicative (ResourceT m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
| Monad m => Applicative (ZipSource m) | |
Defined in Data.Conduit.Internal.Conduit | |
| Monad m => Applicative (AForm m) | |
| Monad m => Applicative (FormInput m) | |
Defined in Yesod.Form.Input | |
| Applicative (WidgetFor site) | |
Defined in Yesod.Core.Types Methods pure :: a -> WidgetFor site a # (<*>) :: WidgetFor site (a -> b) -> WidgetFor site a -> WidgetFor site b # liftA2 :: (a -> b -> c) -> WidgetFor site a -> WidgetFor site b -> WidgetFor site c # (*>) :: WidgetFor site a -> WidgetFor site b -> WidgetFor site b # (<*) :: WidgetFor site a -> WidgetFor site b -> WidgetFor site a # | |
| Applicative (HandlerFor site) | |
Defined in Yesod.Core.Types Methods pure :: a -> HandlerFor site a # (<*>) :: HandlerFor site (a -> b) -> HandlerFor site a -> HandlerFor site b # liftA2 :: (a -> b -> c) -> HandlerFor site a -> HandlerFor site b -> HandlerFor site c # (*>) :: HandlerFor site a -> HandlerFor site b -> HandlerFor site b # (<*) :: HandlerFor site a -> HandlerFor site b -> HandlerFor site a # | |
| Applicative (ST s) | |
| Monad m => Applicative (WrappedMonad m) | |
Defined in Control.Applicative Methods pure :: a -> WrappedMonad m a # (<*>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b # liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c # (*>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b # (<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a # | |
| Applicative (Parser i) | |
| Representable f => Applicative (Co f) | |
| Alternative f => Applicative (Cofree f) | |
| Functor f => Applicative (Free f) | |
| Applicative (StateL s) | |
| Applicative (StateR s) | |
| (Functor m, Monad m) => Applicative (MaybeT m) | |
| (Applicative (Rep p), Representable p) => Applicative (Prep p) | |
| Applicative m => Applicative (LoggingT m) | |
Defined in Control.Monad.Logger | |
| Applicative m => Applicative (NoLoggingT m) | |
Defined in Control.Monad.Logger | |
| Applicative m => Applicative (WriterLoggingT m) | |
Defined in Control.Monad.Logger Methods pure :: a -> WriterLoggingT m a # (<*>) :: WriterLoggingT m (a -> b) -> WriterLoggingT m a -> WriterLoggingT m b # liftA2 :: (a -> b -> c) -> WriterLoggingT m a -> WriterLoggingT m b -> WriterLoggingT m c # (*>) :: WriterLoggingT m a -> WriterLoggingT m b -> WriterLoggingT m b # (<*) :: WriterLoggingT m a -> WriterLoggingT m b -> WriterLoggingT m a # | |
| Monad m => Applicative (CatchT m) | |
| Arrow a => Applicative (ArrowMonad a) | |
Defined in Control.Arrow Methods pure :: a0 -> ArrowMonad a a0 # (<*>) :: ArrowMonad a (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b # liftA2 :: (a0 -> b -> c) -> ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a c # (*>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b # (<*) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a a0 # | |
| Applicative f => Applicative (Rec1 f) | |
| Applicative m => Applicative (ReaderT r m) | |
Defined in Control.Monad.Trans.Reader | |
| Monad m => Applicative (ZipSink i m) | |
Defined in Data.Conduit.Internal.Conduit | |
| (Monoid w, Applicative m) => Applicative (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.Lazy | |
| Applicative (SubHandlerFor child master) | |
Defined in Yesod.Core.Types Methods pure :: a -> SubHandlerFor child master a # (<*>) :: SubHandlerFor child master (a -> b) -> SubHandlerFor child master a -> SubHandlerFor child master b # liftA2 :: (a -> b -> c) -> SubHandlerFor child master a -> SubHandlerFor child master b -> SubHandlerFor child master c # (*>) :: SubHandlerFor child master a -> SubHandlerFor child master b -> SubHandlerFor child master b # (<*) :: SubHandlerFor child master a -> SubHandlerFor child master b -> SubHandlerFor child master a # | |
| Applicative (Tagged s) | |
| (Functor m, Monad m) => Applicative (StateT s m) | |
Defined in Control.Monad.Trans.State.Lazy | |
| (Functor m, Monad m) => Applicative (ErrorT e m) | |
Defined in Control.Monad.Trans.Error | |
| Arrow a => Applicative (WrappedArrow a b) | |
Defined in Control.Applicative Methods pure :: a0 -> WrappedArrow a b a0 # (<*>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 # liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c # (*>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 # (<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 # | |
| Biapplicative p => Applicative (Join p) | |
| (Functor f, Monad m) => Applicative (FreeT f m) | |
Defined in Control.Monad.Trans.Free | |
| (Applicative f, Applicative g) => Applicative (Day f g) | |
| (Monoid w, Applicative m) => Applicative (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.Strict | |
| (Functor m, Monad m) => Applicative (StateT s m) | |
Defined in Control.Monad.Trans.State.Strict | |
| Applicative f => Applicative (Alt f) | |
| (Functor m, Monad m) => Applicative (ExceptT e m) | |
Defined in Control.Monad.Trans.Except | |
| (Applicative f, Monad f) => Applicative (WhenMissing f x) | |
Defined in Data.IntMap.Internal Methods pure :: a -> WhenMissing f x a # (<*>) :: WhenMissing f x (a -> b) -> WhenMissing f x a -> WhenMissing f x b # liftA2 :: (a -> b -> c) -> WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x c # (*>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # (<*) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x a # | |
| Applicative ((->) a :: Type -> Type) | |
| Monoid c => Applicative (K1 i c :: Type -> Type) | |
| (Applicative f, Applicative g) => Applicative (f :*: g) | |
| Monad m => Applicative (ZipConduit i o m) | |
Defined in Data.Conduit.Internal.Conduit Methods pure :: a -> ZipConduit i o m a # (<*>) :: ZipConduit i o m (a -> b) -> ZipConduit i o m a -> ZipConduit i o m b # liftA2 :: (a -> b -> c) -> ZipConduit i o m a -> ZipConduit i o m b -> ZipConduit i o m c # (*>) :: ZipConduit i o m a -> ZipConduit i o m b -> ZipConduit i o m b # (<*) :: ZipConduit i o m a -> ZipConduit i o m b -> ZipConduit i o m a # | |
| Applicative (ConduitT i o m) | |
Defined in Data.Conduit.Internal.Conduit Methods pure :: a -> ConduitT i o m a # (<*>) :: ConduitT i o m (a -> b) -> ConduitT i o m a -> ConduitT i o m b # liftA2 :: (a -> b -> c) -> ConduitT i o m a -> ConduitT i o m b -> ConduitT i o m c # (*>) :: ConduitT i o m a -> ConduitT i o m b -> ConduitT i o m b # (<*) :: ConduitT i o m a -> ConduitT i o m b -> ConduitT i o m a # | |
| (Applicative f, Monad f) => Applicative (WhenMissing f k x) | |
Defined in Data.Map.Internal Methods pure :: a -> WhenMissing f k x a # (<*>) :: WhenMissing f k x (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b # liftA2 :: (a -> b -> c) -> WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x c # (*>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b # (<*) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x a # | |
| (Monad f, Applicative f) => Applicative (WhenMatched f x y) | |
Defined in Data.IntMap.Internal Methods pure :: a -> WhenMatched f x y a # (<*>) :: WhenMatched f x y (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b # liftA2 :: (a -> b -> c) -> WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y c # (*>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b # (<*) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y a # | |
| Applicative f => Applicative (M1 i c f) | |
| (Applicative f, Applicative g) => Applicative (f :.: g) | |
| (Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.Strict | |
| (Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.Lazy | |
| (Monad f, Applicative f) => Applicative (WhenMatched f k x y) | |
Defined in Data.Map.Internal Methods pure :: a -> WhenMatched f k x y a # (<*>) :: WhenMatched f k x y (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b # liftA2 :: (a -> b -> c) -> WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y c # (*>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b # (<*) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y a # | |
| Monad m => Applicative (Pipe l i o u m) | |
Defined in Data.Conduit.Internal.Pipe Methods pure :: a -> Pipe l i o u m a # (<*>) :: Pipe l i o u m (a -> b) -> Pipe l i o u m a -> Pipe l i o u m b # liftA2 :: (a -> b -> c) -> Pipe l i o u m a -> Pipe l i o u m b -> Pipe l i o u m c # (*>) :: Pipe l i o u m a -> Pipe l i o u m b -> Pipe l i o u m b # (<*) :: Pipe l i o u m a -> Pipe l i o u m b -> Pipe l i o u m a # | |
| Monad state => Applicative (Builder collection mutCollection step state err) | |
Defined in Basement.MutableBuilder Methods pure :: a -> Builder collection mutCollection step state err a # (<*>) :: Builder collection mutCollection step state err (a -> b) -> Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b # liftA2 :: (a -> b -> c) -> Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err c # (*>) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err b # (<*) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err a # | |
class Foldable (t :: Type -> Type) #
Minimal complete definition
foldMap | foldr
Instances
| Foldable [] | |
Defined in Data.Foldable Methods foldMap :: Monoid m => (a -> m) -> [a] -> m foldMap' :: Monoid m => (a -> m) -> [a] -> m foldr :: (a -> b -> b) -> b -> [a] -> b foldr' :: (a -> b -> b) -> b -> [a] -> b foldl :: (b -> a -> b) -> b -> [a] -> b foldl' :: (b -> a -> b) -> b -> [a] -> b foldr1 :: (a -> a -> a) -> [a] -> a foldl1 :: (a -> a -> a) -> [a] -> a toList :: [a] -> [a] | |
| Foldable Maybe | |
Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m foldMap :: Monoid m => (a -> m) -> Maybe a -> m foldMap' :: Monoid m => (a -> m) -> Maybe a -> m foldr :: (a -> b -> b) -> b -> Maybe a -> b foldr' :: (a -> b -> b) -> b -> Maybe a -> b foldl :: (b -> a -> b) -> b -> Maybe a -> b foldl' :: (b -> a -> b) -> b -> Maybe a -> b foldr1 :: (a -> a -> a) -> Maybe a -> a foldl1 :: (a -> a -> a) -> Maybe a -> a elem :: Eq a => a -> Maybe a -> Bool maximum :: Ord a => Maybe a -> a | |
| Foldable Par1 | |
Defined in Data.Foldable Methods fold :: Monoid m => Par1 m -> m foldMap :: Monoid m => (a -> m) -> Par1 a -> m foldMap' :: Monoid m => (a -> m) -> Par1 a -> m foldr :: (a -> b -> b) -> b -> Par1 a -> b foldr' :: (a -> b -> b) -> b -> Par1 a -> b foldl :: (b -> a -> b) -> b -> Par1 a -> b foldl' :: (b -> a -> b) -> b -> Par1 a -> b foldr1 :: (a -> a -> a) -> Par1 a -> a foldl1 :: (a -> a -> a) -> Par1 a -> a toList :: Par1 a -> [a] elem :: Eq a => a -> Par1 a -> Bool maximum :: Ord a => Par1 a -> a | |
| Foldable IResult | |
Defined in Data.Aeson.Types.Internal Methods fold :: Monoid m => IResult m -> m foldMap :: Monoid m => (a -> m) -> IResult a -> m foldMap' :: Monoid m => (a -> m) -> IResult a -> m foldr :: (a -> b -> b) -> b -> IResult a -> b foldr' :: (a -> b -> b) -> b -> IResult a -> b foldl :: (b -> a -> b) -> b -> IResult a -> b foldl' :: (b -> a -> b) -> b -> IResult a -> b foldr1 :: (a -> a -> a) -> IResult a -> a foldl1 :: (a -> a -> a) -> IResult a -> a elem :: Eq a => a -> IResult a -> Bool maximum :: Ord a => IResult a -> a minimum :: Ord a => IResult a -> a | |
| Foldable Result | |
Defined in Data.Aeson.Types.Internal Methods fold :: Monoid m => Result m -> m foldMap :: Monoid m => (a -> m) -> Result a -> m foldMap' :: Monoid m => (a -> m) -> Result a -> m foldr :: (a -> b -> b) -> b -> Result a -> b foldr' :: (a -> b -> b) -> b -> Result a -> b foldl :: (b -> a -> b) -> b -> Result a -> b foldl' :: (b -> a -> b) -> b -> Result a -> b foldr1 :: (a -> a -> a) -> Result a -> a foldl1 :: (a -> a -> a) -> Result a -> a elem :: Eq a => a -> Result a -> Bool maximum :: Ord a => Result a -> a | |
| Foldable Identity | |
Defined in Data.Functor.Identity Methods fold :: Monoid m => Identity m -> m foldMap :: Monoid m => (a -> m) -> Identity a -> m foldMap' :: Monoid m => (a -> m) -> Identity a -> m foldr :: (a -> b -> b) -> b -> Identity a -> b foldr' :: (a -> b -> b) -> b -> Identity a -> b foldl :: (b -> a -> b) -> b -> Identity a -> b foldl' :: (b -> a -> b) -> b -> Identity a -> b foldr1 :: (a -> a -> a) -> Identity a -> a foldl1 :: (a -> a -> a) -> Identity a -> a elem :: Eq a => a -> Identity a -> Bool maximum :: Ord a => Identity a -> a minimum :: Ord a => Identity a -> a | |
| Foldable DList | |
Defined in Data.DList Methods fold :: Monoid m => DList m -> m foldMap :: Monoid m => (a -> m) -> DList a -> m foldMap' :: Monoid m => (a -> m) -> DList a -> m foldr :: (a -> b -> b) -> b -> DList a -> b foldr' :: (a -> b -> b) -> b -> DList a -> b foldl :: (b -> a -> b) -> b -> DList a -> b foldl' :: (b -> a -> b) -> b -> DList a -> b foldr1 :: (a -> a -> a) -> DList a -> a foldl1 :: (a -> a -> a) -> DList a -> a elem :: Eq a => a -> DList a -> Bool maximum :: Ord a => DList a -> a | |
| Foldable HashSet | |
Defined in Data.HashSet.Base Methods fold :: Monoid m => HashSet m -> m foldMap :: Monoid m => (a -> m) -> HashSet a -> m foldMap' :: Monoid m => (a -> m) -> HashSet a -> m foldr :: (a -> b -> b) -> b -> HashSet a -> b foldr' :: (a -> b -> b) -> b -> HashSet a -> b foldl :: (b -> a -> b) -> b -> HashSet a -> b foldl' :: (b -> a -> b) -> b -> HashSet a -> b foldr1 :: (a -> a -> a) -> HashSet a -> a foldl1 :: (a -> a -> a) -> HashSet a -> a elem :: Eq a => a -> HashSet a -> Bool maximum :: Ord a => HashSet a -> a minimum :: Ord a => HashSet a -> a | |
| Foldable Vector | |
Defined in Data.Vector Methods fold :: Monoid m => Vector m -> m foldMap :: Monoid m => (a -> m) -> Vector a -> m foldMap' :: Monoid m => (a -> m) -> Vector a -> m foldr :: (a -> b -> b) -> b -> Vector a -> b foldr' :: (a -> b -> b) -> b -> Vector a -> b foldl :: (b -> a -> b) -> b -> Vector a -> b foldl' :: (b -> a -> b) -> b -> Vector a -> b foldr1 :: (a -> a -> a) -> Vector a -> a foldl1 :: (a -> a -> a) -> Vector a -> a elem :: Eq a => a -> Vector a -> Bool maximum :: Ord a => Vector a -> a | |
| Foldable Down | |
Defined in Data.Foldable Methods fold :: Monoid m => Down m -> m foldMap :: Monoid m => (a -> m) -> Down a -> m foldMap' :: Monoid m => (a -> m) -> Down a -> m foldr :: (a -> b -> b) -> b -> Down a -> b foldr' :: (a -> b -> b) -> b -> Down a -> b foldl :: (b -> a -> b) -> b -> Down a -> b foldl' :: (b -> a -> b) -> b -> Down a -> b foldr1 :: (a -> a -> a) -> Down a -> a foldl1 :: (a -> a -> a) -> Down a -> a elem :: Eq a => a -> Down a -> Bool maximum :: Ord a => Down a -> a | |
| Foldable Set | |
Defined in Data.Set.Internal Methods fold :: Monoid m => Set m -> m foldMap :: Monoid m => (a -> m) -> Set a -> m foldMap' :: Monoid m => (a -> m) -> Set a -> m foldr :: (a -> b -> b) -> b -> Set a -> b foldr' :: (a -> b -> b) -> b -> Set a -> b foldl :: (b -> a -> b) -> b -> Set a -> b foldl' :: (b -> a -> b) -> b -> Set a -> b foldr1 :: (a -> a -> a) -> Set a -> a foldl1 :: (a -> a -> a) -> Set a -> a elem :: Eq a => a -> Set a -> Bool maximum :: Ord a => Set a -> a | |
| Foldable IntMap | |
Defined in Data.IntMap.Internal Methods fold :: Monoid m => IntMap m -> m foldMap :: Monoid m => (a -> m) -> IntMap a -> m foldMap' :: Monoid m => (a -> m) -> IntMap a -> m foldr :: (a -> b -> b) -> b -> IntMap a -> b foldr' :: (a -> b -> b) -> b -> IntMap a -> b foldl :: (b -> a -> b) -> b -> IntMap a -> b foldl' :: (b -> a -> b) -> b -> IntMap a -> b foldr1 :: (a -> a -> a) -> IntMap a -> a foldl1 :: (a -> a -> a) -> IntMap a -> a elem :: Eq a => a -> IntMap a -> Bool maximum :: Ord a => IntMap a -> a | |
| Foldable Seq | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Seq m -> m foldMap :: Monoid m => (a -> m) -> Seq a -> m foldMap' :: Monoid m => (a -> m) -> Seq a -> m foldr :: (a -> b -> b) -> b -> Seq a -> b foldr' :: (a -> b -> b) -> b -> Seq a -> b foldl :: (b -> a -> b) -> b -> Seq a -> b foldl' :: (b -> a -> b) -> b -> Seq a -> b foldr1 :: (a -> a -> a) -> Seq a -> a foldl1 :: (a -> a -> a) -> Seq a -> a elem :: Eq a => a -> Seq a -> Bool maximum :: Ord a => Seq a -> a | |
| Foldable Response | |
Defined in Network.HTTP.Client.Types Methods fold :: Monoid m => Response m -> m foldMap :: Monoid m => (a -> m) -> Response a -> m foldMap' :: Monoid m => (a -> m) -> Response a -> m foldr :: (a -> b -> b) -> b -> Response a -> b foldr' :: (a -> b -> b) -> b -> Response a -> b foldl :: (b -> a -> b) -> b -> Response a -> b foldl' :: (b -> a -> b) -> b -> Response a -> b foldr1 :: (a -> a -> a) -> Response a -> a foldl1 :: (a -> a -> a) -> Response a -> a elem :: Eq a => a -> Response a -> Bool maximum :: Ord a => Response a -> a minimum :: Ord a => Response a -> a | |
| Foldable HistoriedResponse | |
Defined in Network.HTTP.Client Methods fold :: Monoid m => HistoriedResponse m -> m foldMap :: Monoid m => (a -> m) -> HistoriedResponse a -> m foldMap' :: Monoid m => (a -> m) -> HistoriedResponse a -> m foldr :: (a -> b -> b) -> b -> HistoriedResponse a -> b foldr' :: (a -> b -> b) -> b -> HistoriedResponse a -> b foldl :: (b -> a -> b) -> b -> HistoriedResponse a -> b foldl' :: (b -> a -> b) -> b -> HistoriedResponse a -> b foldr1 :: (a -> a -> a) -> HistoriedResponse a -> a foldl1 :: (a -> a -> a) -> HistoriedResponse a -> a toList :: HistoriedResponse a -> [a] null :: HistoriedResponse a -> Bool length :: HistoriedResponse a -> Int elem :: Eq a => a -> HistoriedResponse a -> Bool maximum :: Ord a => HistoriedResponse a -> a minimum :: Ord a => HistoriedResponse a -> a sum :: Num a => HistoriedResponse a -> a product :: Num a => HistoriedResponse a -> a | |
| Foldable NonEmpty | |
Defined in Data.Foldable Methods fold :: Monoid m => NonEmpty m -> m foldMap :: Monoid m => (a -> m) -> NonEmpty a -> m foldMap' :: Monoid m => (a -> m) -> NonEmpty a -> m foldr :: (a -> b -> b) -> b -> NonEmpty a -> b foldr' :: (a -> b -> b) -> b -> NonEmpty a -> b foldl :: (b -> a -> b) -> b -> NonEmpty a -> b foldl' :: (b -> a -> b) -> b -> NonEmpty a -> b foldr1 :: (a -> a -> a) -> NonEmpty a -> a foldl1 :: (a -> a -> a) -> NonEmpty a -> a toList :: NonEmpty a -> [a] elem :: Eq a => a -> NonEmpty a -> Bool maximum :: Ord a => NonEmpty a -> a minimum :: Ord a => NonEmpty a -> a | |
| Foldable FormResult | |
Defined in Yesod.Form.Types Methods fold :: Monoid m => FormResult m -> m foldMap :: Monoid m => (a -> m) -> FormResult a -> m foldMap' :: Monoid m => (a -> m) -> FormResult a -> m foldr :: (a -> b -> b) -> b -> FormResult a -> b foldr' :: (a -> b -> b) -> b -> FormResult a -> b foldl :: (b -> a -> b) -> b -> FormResult a -> b foldl' :: (b -> a -> b) -> b -> FormResult a -> b foldr1 :: (a -> a -> a) -> FormResult a -> a foldl1 :: (a -> a -> a) -> FormResult a -> a toList :: FormResult a -> [a] null :: FormResult a -> Bool length :: FormResult a -> Int elem :: Eq a => a -> FormResult a -> Bool maximum :: Ord a => FormResult a -> a minimum :: Ord a => FormResult a -> a sum :: Num a => FormResult a -> a product :: Num a => FormResult a -> a | |
| Foldable Option | |
Defined in Data.Semigroup Methods fold :: Monoid m => Option m -> m foldMap :: Monoid m => (a -> m) -> Option a -> m foldMap' :: Monoid m => (a -> m) -> Option a -> m foldr :: (a -> b -> b) -> b -> Option a -> b foldr' :: (a -> b -> b) -> b -> Option a -> b foldl :: (b -> a -> b) -> b -> Option a -> b foldl' :: (b -> a -> b) -> b -> Option a -> b foldr1 :: (a -> a -> a) -> Option a -> a foldl1 :: (a -> a -> a) -> Option a -> a toList :: Option a -> [a] elem :: Eq a => a -> Option a -> Bool maximum :: Ord a => Option a -> a | |
| Foldable Dual | |
Defined in Data.Foldable Methods fold :: Monoid m => Dual m -> m foldMap :: Monoid m => (a -> m) -> Dual a -> m foldMap' :: Monoid m => (a -> m) -> Dual a -> m foldr :: (a -> b -> b) -> b -> Dual a -> b foldr' :: (a -> b -> b) -> b -> Dual a -> b foldl :: (b -> a -> b) -> b -> Dual a -> b foldl' :: (b -> a -> b) -> b -> Dual a -> b foldr1 :: (a -> a -> a) -> Dual a -> a foldl1 :: (a -> a -> a) -> Dual a -> a toList :: Dual a -> [a] elem :: Eq a => a -> Dual a -> Bool maximum :: Ord a => Dual a -> a | |
| Foldable Product | |
Defined in Data.Foldable Methods fold :: Monoid m => Product m -> m foldMap :: Monoid m => (a -> m) -> Product a -> m foldMap' :: Monoid m => (a -> m) -> Product a -> m foldr :: (a -> b -> b) -> b -> Product a -> b foldr' :: (a -> b -> b) -> b -> Product a -> b foldl :: (b -> a -> b) -> b -> Product a -> b foldl' :: (b -> a -> b) -> b -> Product a -> b foldr1 :: (a -> a -> a) -> Product a -> a foldl1 :: (a -> a -> a) -> Product a -> a toList :: Product a -> [a] elem :: Eq a => a -> Product a -> Bool maximum :: Ord a => Product a -> a minimum :: Ord a => Product a -> a | |
| Foldable Sum | |
Defined in Data.Foldable Methods fold :: Monoid m => Sum m -> m foldMap :: Monoid m => (a -> m) -> Sum a -> m foldMap' :: Monoid m => (a -> m) -> Sum a -> m foldr :: (a -> b -> b) -> b -> Sum a -> b foldr' :: (a -> b -> b) -> b -> Sum a -> b foldl :: (b -> a -> b) -> b -> Sum a -> b foldl' :: (b -> a -> b) -> b -> Sum a -> b foldr1 :: (a -> a -> a) -> Sum a -> a foldl1 :: (a -> a -> a) -> Sum a -> a toList :: Sum a -> [a] elem :: Eq a => a -> Sum a -> Bool maximum :: Ord a => Sum a -> a | |
| Foldable ZipList | |
Defined in Control.Applicative Methods fold :: Monoid m => ZipList m -> m foldMap :: Monoid m => (a -> m) -> ZipList a -> m foldMap' :: Monoid m => (a -> m) -> ZipList a -> m foldr :: (a -> b -> b) -> b -> ZipList a -> b foldr' :: (a -> b -> b) -> b -> ZipList a -> b foldl :: (b -> a -> b) -> b -> ZipList a -> b foldl' :: (b -> a -> b) -> b -> ZipList a -> b foldr1 :: (a -> a -> a) -> ZipList a -> a foldl1 :: (a -> a -> a) -> ZipList a -> a toList :: ZipList a -> [a] elem :: Eq a => a -> ZipList a -> Bool maximum :: Ord a => ZipList a -> a minimum :: Ord a => ZipList a -> a | |
| Foldable Elem | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Elem m -> m foldMap :: Monoid m => (a -> m) -> Elem a -> m foldMap' :: Monoid m => (a -> m) -> Elem a -> m foldr :: (a -> b -> b) -> b -> Elem a -> b foldr' :: (a -> b -> b) -> b -> Elem a -> b foldl :: (b -> a -> b) -> b -> Elem a -> b foldl' :: (b -> a -> b) -> b -> Elem a -> b foldr1 :: (a -> a -> a) -> Elem a -> a foldl1 :: (a -> a -> a) -> Elem a -> a toList :: Elem a -> [a] elem :: Eq a => a -> Elem a -> Bool maximum :: Ord a => Elem a -> a | |
| Foldable First | |
Defined in Data.Foldable Methods fold :: Monoid m => First m -> m foldMap :: Monoid m => (a -> m) -> First a -> m foldMap' :: Monoid m => (a -> m) -> First a -> m foldr :: (a -> b -> b) -> b -> First a -> b foldr' :: (a -> b -> b) -> b -> First a -> b foldl :: (b -> a -> b) -> b -> First a -> b foldl' :: (b -> a -> b) -> b -> First a -> b foldr1 :: (a -> a -> a) -> First a -> a foldl1 :: (a -> a -> a) -> First a -> a toList :: First a -> [a] elem :: Eq a => a -> First a -> Bool maximum :: Ord a => First a -> a | |
| Foldable ViewL | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => ViewL m -> m foldMap :: Monoid m => (a -> m) -> ViewL a -> m foldMap' :: Monoid m => (a -> m) -> ViewL a -> m foldr :: (a -> b -> b) -> b -> ViewL a -> b foldr' :: (a -> b -> b) -> b -> ViewL a -> b foldl :: (b -> a -> b) -> b -> ViewL a -> b foldl' :: (b -> a -> b) -> b -> ViewL a -> b foldr1 :: (a -> a -> a) -> ViewL a -> a foldl1 :: (a -> a -> a) -> ViewL a -> a toList :: ViewL a -> [a] elem :: Eq a => a -> ViewL a -> Bool maximum :: Ord a => ViewL a -> a | |
| Foldable ViewR | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => ViewR m -> m foldMap :: Monoid m => (a -> m) -> ViewR a -> m foldMap' :: Monoid m => (a -> m) -> ViewR a -> m foldr :: (a -> b -> b) -> b -> ViewR a -> b foldr' :: (a -> b -> b) -> b -> ViewR a -> b foldl :: (b -> a -> b) -> b -> ViewR a -> b foldl' :: (b -> a -> b) -> b -> ViewR a -> b foldr1 :: (a -> a -> a) -> ViewR a -> a foldl1 :: (a -> a -> a) -> ViewR a -> a toList :: ViewR a -> [a] elem :: Eq a => a -> ViewR a -> Bool maximum :: Ord a => ViewR a -> a | |
| Foldable Node | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Node m -> m foldMap :: Monoid m => (a -> m) -> Node a -> m foldMap' :: Monoid m => (a -> m) -> Node a -> m foldr :: (a -> b -> b) -> b -> Node a -> b foldr' :: (a -> b -> b) -> b -> Node a -> b foldl :: (b -> a -> b) -> b -> Node a -> b foldl' :: (b -> a -> b) -> b -> Node a -> b foldr1 :: (a -> a -> a) -> Node a -> a foldl1 :: (a -> a -> a) -> Node a -> a toList :: Node a -> [a] elem :: Eq a => a -> Node a -> Bool maximum :: Ord a => Node a -> a | |
| Foldable FingerTree | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => FingerTree m -> m foldMap :: Monoid m => (a -> m) -> FingerTree a -> m foldMap' :: Monoid m => (a -> m) -> FingerTree a -> m foldr :: (a -> b -> b) -> b -> FingerTree a -> b foldr' :: (a -> b -> b) -> b -> FingerTree a -> b foldl :: (b -> a -> b) -> b -> FingerTree a -> b foldl' :: (b -> a -> b) -> b -> FingerTree a -> b foldr1 :: (a -> a -> a) -> FingerTree a -> a foldl1 :: (a -> a -> a) -> FingerTree a -> a toList :: FingerTree a -> [a] elem :: Eq a => a -> FingerTree a -> Bool maximum :: Ord a => FingerTree a -> a minimum :: Ord a => FingerTree a -> a | |
| Foldable Array | |
Defined in Data.Primitive.Array Methods fold :: Monoid m => Array m -> m foldMap :: Monoid m => (a -> m) -> Array a -> m foldMap' :: Monoid m => (a -> m) -> Array a -> m foldr :: (a -> b -> b) -> b -> Array a -> b foldr' :: (a -> b -> b) -> b -> Array a -> b foldl :: (b -> a -> b) -> b -> Array a -> b foldl' :: (b -> a -> b) -> b -> Array a -> b foldr1 :: (a -> a -> a) -> Array a -> a foldl1 :: (a -> a -> a) -> Array a -> a toList :: Array a -> [a] elem :: Eq a => a -> Array a -> Bool maximum :: Ord a => Array a -> a | |
| Foldable SmallArray | |
Defined in Data.Primitive.SmallArray Methods fold :: Monoid m => SmallArray m -> m foldMap :: Monoid m => (a -> m) -> SmallArray a -> m foldMap' :: Monoid m => (a -> m) -> SmallArray a -> m foldr :: (a -> b -> b) -> b -> SmallArray a -> b foldr' :: (a -> b -> b) -> b -> SmallArray a -> b foldl :: (b -> a -> b) -> b -> SmallArray a -> b foldl' :: (b -> a -> b) -> b -> SmallArray a -> b foldr1 :: (a -> a -> a) -> SmallArray a -> a foldl1 :: (a -> a -> a) -> SmallArray a -> a toList :: SmallArray a -> [a] elem :: Eq a => a -> SmallArray a -> Bool maximum :: Ord a => SmallArray a -> a minimum :: Ord a => SmallArray a -> a | |
| Foldable First | |
Defined in Data.Semigroup Methods fold :: Monoid m => First m -> m foldMap :: Monoid m => (a -> m) -> First a -> m foldMap' :: Monoid m => (a -> m) -> First a -> m foldr :: (a -> b -> b) -> b -> First a -> b foldr' :: (a -> b -> b) -> b -> First a -> b foldl :: (b -> a -> b) -> b -> First a -> b foldl' :: (b -> a -> b) -> b -> First a -> b foldr1 :: (a -> a -> a) -> First a -> a foldl1 :: (a -> a -> a) -> First a -> a toList :: First a -> [a] elem :: Eq a => a -> First a -> Bool maximum :: Ord a => First a -> a | |
| Foldable Last | |
Defined in Data.Semigroup Methods fold :: Monoid m => Last m -> m foldMap :: Monoid m => (a -> m) -> Last a -> m foldMap' :: Monoid m => (a -> m) -> Last a -> m foldr :: (a -> b -> b) -> b -> Last a -> b foldr' :: (a -> b -> b) -> b -> Last a -> b foldl :: (b -> a -> b) -> b -> Last a -> b foldl' :: (b -> a -> b) -> b -> Last a -> b foldr1 :: (a -> a -> a) -> Last a -> a foldl1 :: (a -> a -> a) -> Last a -> a toList :: Last a -> [a] elem :: Eq a => a -> Last a -> Bool maximum :: Ord a => Last a -> a | |
| Foldable Max | |
Defined in Data.Semigroup Methods fold :: Monoid m => Max m -> m foldMap :: Monoid m => (a -> m) -> Max a -> m foldMap' :: Monoid m => (a -> m) -> Max a -> m foldr :: (a -> b -> b) -> b -> Max a -> b foldr' :: (a -> b -> b) -> b -> Max a -> b foldl :: (b -> a -> b) -> b -> Max a -> b foldl' :: (b -> a -> b) -> b -> Max a -> b foldr1 :: (a -> a -> a) -> Max a -> a foldl1 :: (a -> a -> a) -> Max a -> a toList :: Max a -> [a] elem :: Eq a => a -> Max a -> Bool maximum :: Ord a => Max a -> a | |
| Foldable Min | |
Defined in Data.Semigroup Methods fold :: Monoid m => Min m -> m foldMap :: Monoid m => (a -> m) -> Min a -> m foldMap' :: Monoid m => (a -> m) -> Min a -> m foldr :: (a -> b -> b) -> b -> Min a -> b foldr' :: (a -> b -> b) -> b -> Min a -> b foldl :: (b -> a -> b) -> b -> Min a -> b foldl' :: (b -> a -> b) -> b -> Min a -> b foldr1 :: (a -> a -> a) -> Min a -> a foldl1 :: (a -> a -> a) -> Min a -> a toList :: Min a -> [a] elem :: Eq a => a -> Min a -> Bool maximum :: Ord a => Min a -> a | |
| Foldable Last | |
Defined in Data.Foldable Methods fold :: Monoid m => Last m -> m foldMap :: Monoid m => (a -> m) -> Last a -> m foldMap' :: Monoid m => (a -> m) -> Last a -> m foldr :: (a -> b -> b) -> b -> Last a -> b foldr' :: (a -> b -> b) -> b -> Last a -> b foldl :: (b -> a -> b) -> b -> Last a -> b foldl' :: (b -> a -> b) -> b -> Last a -> b foldr1 :: (a -> a -> a) -> Last a -> a foldl1 :: (a -> a -> a) -> Last a -> a toList :: Last a -> [a] elem :: Eq a => a -> Last a -> Bool maximum :: Ord a => Last a -> a | |
| Foldable Hashed | |
Defined in Data.Hashable.Class Methods fold :: Monoid m => Hashed m -> m foldMap :: Monoid m => (a -> m) -> Hashed a -> m foldMap' :: Monoid m => (a -> m) -> Hashed a -> m foldr :: (a -> b -> b) -> b -> Hashed a -> b foldr' :: (a -> b -> b) -> b -> Hashed a -> b foldl :: (b -> a -> b) -> b -> Hashed a -> b foldl' :: (b -> a -> b) -> b -> Hashed a -> b foldr1 :: (a -> a -> a) -> Hashed a -> a foldl1 :: (a -> a -> a) -> Hashed a -> a toList :: Hashed a -> [a] elem :: Eq a => a -> Hashed a -> Bool maximum :: Ord a => Hashed a -> a | |
| Foldable Digit | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Digit m -> m foldMap :: Monoid m => (a -> m) -> Digit a -> m foldMap' :: Monoid m => (a -> m) -> Digit a -> m foldr :: (a -> b -> b) -> b -> Digit a -> b foldr' :: (a -> b -> b) -> b -> Digit a -> b foldl :: (b -> a -> b) -> b -> Digit a -> b foldl' :: (b -> a -> b) -> b -> Digit a -> b foldr1 :: (a -> a -> a) -> Digit a -> a foldl1 :: (a -> a -> a) -> Digit a -> a toList :: Digit a -> [a] elem :: Eq a => a -> Digit a -> Bool maximum :: Ord a => Digit a -> a | |
| Foldable PoolList | |
Defined in Data.KeyedPool Methods fold :: Monoid m => PoolList m -> m foldMap :: Monoid m => (a -> m) -> PoolList a -> m foldMap' :: Monoid m => (a -> m) -> PoolList a -> m foldr :: (a -> b -> b) -> b -> PoolList a -> b foldr' :: (a -> b -> b) -> b -> PoolList a -> b foldl :: (b -> a -> b) -> b -> PoolList a -> b foldl' :: (b -> a -> b) -> b -> PoolList a -> b foldr1 :: (a -> a -> a) -> PoolList a -> a foldl1 :: (a -> a -> a) -> PoolList a -> a toList :: PoolList a -> [a] elem :: Eq a => a -> PoolList a -> Bool maximum :: Ord a => PoolList a -> a minimum :: Ord a => PoolList a -> a | |
| Foldable (Either a) | |
Defined in Data.Foldable Methods fold :: Monoid m => Either a m -> m foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 elem :: Eq a0 => a0 -> Either a a0 -> Bool maximum :: Ord a0 => Either a a0 -> a0 minimum :: Ord a0 => Either a a0 -> a0 | |
| Foldable (V1 :: Type -> Type) | |
Defined in Data.Foldable Methods foldMap :: Monoid m => (a -> m) -> V1 a -> m foldMap' :: Monoid m => (a -> m) -> V1 a -> m foldr :: (a -> b -> b) -> b -> V1 a -> b foldr' :: (a -> b -> b) -> b -> V1 a -> b foldl :: (b -> a -> b) -> b -> V1 a -> b foldl' :: (b -> a -> b) -> b -> V1 a -> b foldr1 :: (a -> a -> a) -> V1 a -> a foldl1 :: (a -> a -> a) -> V1 a -> a toList :: V1 a -> [a] | |
| Foldable (U1 :: Type -> Type) | |
Defined in Data.Foldable Methods foldMap :: Monoid m => (a -> m) -> U1 a -> m foldMap' :: Monoid m => (a -> m) -> U1 a -> m foldr :: (a -> b -> b) -> b -> U1 a -> b foldr' :: (a -> b -> b) -> b -> U1 a -> b foldl :: (b -> a -> b) -> b -> U1 a -> b foldl' :: (b -> a -> b) -> b -> U1 a -> b foldr1 :: (a -> a -> a) -> U1 a -> a foldl1 :: (a -> a -> a) -> U1 a -> a toList :: U1 a -> [a] | |
| Foldable ((,) a) | |
Defined in Data.Foldable Methods fold :: Monoid m => (a, m) -> m foldMap :: Monoid m => (a0 -> m) -> (a, a0) -> m foldMap' :: Monoid m => (a0 -> m) -> (a, a0) -> m foldr :: (a0 -> b -> b) -> b -> (a, a0) -> b foldr' :: (a0 -> b -> b) -> b -> (a, a0) -> b foldl :: (b -> a0 -> b) -> b -> (a, a0) -> b foldl' :: (b -> a0 -> b) -> b -> (a, a0) -> b foldr1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 foldl1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 toList :: (a, a0) -> [a0] elem :: Eq a0 => a0 -> (a, a0) -> Bool maximum :: Ord a0 => (a, a0) -> a0 minimum :: Ord a0 => (a, a0) -> a0 | |
| Foldable (HashMap k) | |
Defined in Data.HashMap.Base Methods fold :: Monoid m => HashMap k m -> m foldMap :: Monoid m => (a -> m) -> HashMap k a -> m foldMap' :: Monoid m => (a -> m) -> HashMap k a -> m foldr :: (a -> b -> b) -> b -> HashMap k a -> b foldr' :: (a -> b -> b) -> b -> HashMap k a -> b foldl :: (b -> a -> b) -> b -> HashMap k a -> b foldl' :: (b -> a -> b) -> b -> HashMap k a -> b foldr1 :: (a -> a -> a) -> HashMap k a -> a foldl1 :: (a -> a -> a) -> HashMap k a -> a elem :: Eq a => a -> HashMap k a -> Bool maximum :: Ord a => HashMap k a -> a minimum :: Ord a => HashMap k a -> a | |
| Foldable (Map k) | |
Defined in Data.Map.Internal Methods fold :: Monoid m => Map k m -> m foldMap :: Monoid m => (a -> m) -> Map k a -> m foldMap' :: Monoid m => (a -> m) -> Map k a -> m foldr :: (a -> b -> b) -> b -> Map k a -> b foldr' :: (a -> b -> b) -> b -> Map k a -> b foldl :: (b -> a -> b) -> b -> Map k a -> b foldl' :: (b -> a -> b) -> b -> Map k a -> b foldr1 :: (a -> a -> a) -> Map k a -> a foldl1 :: (a -> a -> a) -> Map k a -> a elem :: Eq a => a -> Map k a -> Bool maximum :: Ord a => Map k a -> a | |
| MonoFoldable mono => Foldable (WrappedMono mono) | |
Defined in Data.MonoTraversable Methods fold :: Monoid m => WrappedMono mono m -> m foldMap :: Monoid m => (a -> m) -> WrappedMono mono a -> m foldMap' :: Monoid m => (a -> m) -> WrappedMono mono a -> m foldr :: (a -> b -> b) -> b -> WrappedMono mono a -> b foldr' :: (a -> b -> b) -> b -> WrappedMono mono a -> b foldl :: (b -> a -> b) -> b -> WrappedMono mono a -> b foldl' :: (b -> a -> b) -> b -> WrappedMono mono a -> b foldr1 :: (a -> a -> a) -> WrappedMono mono a -> a foldl1 :: (a -> a -> a) -> WrappedMono mono a -> a toList :: WrappedMono mono a -> [a] null :: WrappedMono mono a -> Bool length :: WrappedMono mono a -> Int elem :: Eq a => a -> WrappedMono mono a -> Bool maximum :: Ord a => WrappedMono mono a -> a minimum :: Ord a => WrappedMono mono a -> a sum :: Num a => WrappedMono mono a -> a product :: Num a => WrappedMono mono a -> a | |
| Foldable f => Foldable (WrappedPoly f) | |
Defined in Data.MonoTraversable Methods fold :: Monoid m => WrappedPoly f m -> m foldMap :: Monoid m => (a -> m) -> WrappedPoly f a -> m foldMap' :: Monoid m => (a -> m) -> WrappedPoly f a -> m foldr :: (a -> b -> b) -> b -> WrappedPoly f a -> b foldr' :: (a -> b -> b) -> b -> WrappedPoly f a -> b foldl :: (b -> a -> b) -> b -> WrappedPoly f a -> b foldl' :: (b -> a -> b) -> b -> WrappedPoly f a -> b foldr1 :: (a -> a -> a) -> WrappedPoly f a -> a foldl1 :: (a -> a -> a) -> WrappedPoly f a -> a toList :: WrappedPoly f a -> [a] null :: WrappedPoly f a -> Bool length :: WrappedPoly f a -> Int elem :: Eq a => a -> WrappedPoly f a -> Bool maximum :: Ord a => WrappedPoly f a -> a minimum :: Ord a => WrappedPoly f a -> a sum :: Num a => WrappedPoly f a -> a product :: Num a => WrappedPoly f a -> a | |
| Foldable (Arg a) | |
Defined in Data.Semigroup Methods fold :: Monoid m => Arg a m -> m foldMap :: Monoid m => (a0 -> m) -> Arg a a0 -> m foldMap' :: Monoid m => (a0 -> m) -> Arg a a0 -> m foldr :: (a0 -> b -> b) -> b -> Arg a a0 -> b foldr' :: (a0 -> b -> b) -> b -> Arg a a0 -> b foldl :: (b -> a0 -> b) -> b -> Arg a a0 -> b foldl' :: (b -> a0 -> b) -> b -> Arg a a0 -> b foldr1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 foldl1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 toList :: Arg a a0 -> [a0] elem :: Eq a0 => a0 -> Arg a a0 -> Bool maximum :: Ord a0 => Arg a a0 -> a0 minimum :: Ord a0 => Arg a a0 -> a0 | |
| Foldable (Proxy :: Type -> Type) | |
Defined in Data.Foldable Methods fold :: Monoid m => Proxy m -> m foldMap :: Monoid m => (a -> m) -> Proxy a -> m foldMap' :: Monoid m => (a -> m) -> Proxy a -> m foldr :: (a -> b -> b) -> b -> Proxy a -> b foldr' :: (a -> b -> b) -> b -> Proxy a -> b foldl :: (b -> a -> b) -> b -> Proxy a -> b foldl' :: (b -> a -> b) -> b -> Proxy a -> b foldr1 :: (a -> a -> a) -> Proxy a -> a foldl1 :: (a -> a -> a) -> Proxy a -> a toList :: Proxy a -> [a] elem :: Eq a => a -> Proxy a -> Bool maximum :: Ord a => Proxy a -> a | |
| Foldable (Array i) | |
Defined in Data.Foldable Methods fold :: Monoid m => Array i m -> m foldMap :: Monoid m => (a -> m) -> Array i a -> m foldMap' :: Monoid m => (a -> m) -> Array i a -> m foldr :: (a -> b -> b) -> b -> Array i a -> b foldr' :: (a -> b -> b) -> b -> Array i a -> b foldl :: (b -> a -> b) -> b -> Array i a -> b foldl' :: (b -> a -> b) -> b -> Array i a -> b foldr1 :: (a -> a -> a) -> Array i a -> a foldl1 :: (a -> a -> a) -> Array i a -> a toList :: Array i a -> [a] elem :: Eq a => a -> Array i a -> Bool maximum :: Ord a => Array i a -> a minimum :: Ord a => Array i a -> a | |
| Foldable f => Foldable (Cofree f) | |
Defined in Control.Comonad.Cofree Methods fold :: Monoid m => Cofree f m -> m foldMap :: Monoid m => (a -> m) -> Cofree f a -> m foldMap' :: Monoid m => (a -> m) -> Cofree f a -> m foldr :: (a -> b -> b) -> b -> Cofree f a -> b foldr' :: (a -> b -> b) -> b -> Cofree f a -> b foldl :: (b -> a -> b) -> b -> Cofree f a -> b foldl' :: (b -> a -> b) -> b -> Cofree f a -> b foldr1 :: (a -> a -> a) -> Cofree f a -> a foldl1 :: (a -> a -> a) -> Cofree f a -> a toList :: Cofree f a -> [a] elem :: Eq a => a -> Cofree f a -> Bool maximum :: Ord a => Cofree f a -> a minimum :: Ord a => Cofree f a -> a | |
| Foldable f => Foldable (Free f) | |
Defined in Control.Monad.Free Methods fold :: Monoid m => Free f m -> m foldMap :: Monoid m => (a -> m) -> Free f a -> m foldMap' :: Monoid m => (a -> m) -> Free f a -> m foldr :: (a -> b -> b) -> b -> Free f a -> b foldr' :: (a -> b -> b) -> b -> Free f a -> b foldl :: (b -> a -> b) -> b -> Free f a -> b foldl' :: (b -> a -> b) -> b -> Free f a -> b foldr1 :: (a -> a -> a) -> Free f a -> a foldl1 :: (a -> a -> a) -> Free f a -> a toList :: Free f a -> [a] elem :: Eq a => a -> Free f a -> Bool maximum :: Ord a => Free f a -> a | |
| Foldable f => Foldable (MaybeT f) | |
Defined in Control.Monad.Trans.Maybe Methods fold :: Monoid m => MaybeT f m -> m foldMap :: Monoid m => (a -> m) -> MaybeT f a -> m foldMap' :: Monoid m => (a -> m) -> MaybeT f a -> m foldr :: (a -> b -> b) -> b -> MaybeT f a -> b foldr' :: (a -> b -> b) -> b -> MaybeT f a -> b foldl :: (b -> a -> b) -> b -> MaybeT f a -> b foldl' :: (b -> a -> b) -> b -> MaybeT f a -> b foldr1 :: (a -> a -> a) -> MaybeT f a -> a foldl1 :: (a -> a -> a) -> MaybeT f a -> a toList :: MaybeT f a -> [a] elem :: Eq a => a -> MaybeT f a -> Bool maximum :: Ord a => MaybeT f a -> a minimum :: Ord a => MaybeT f a -> a | |
| Foldable m => Foldable (CatchT m) | |
Defined in Control.Monad.Catch.Pure Methods fold :: Monoid m0 => CatchT m m0 -> m0 foldMap :: Monoid m0 => (a -> m0) -> CatchT m a -> m0 foldMap' :: Monoid m0 => (a -> m0) -> CatchT m a -> m0 foldr :: (a -> b -> b) -> b -> CatchT m a -> b foldr' :: (a -> b -> b) -> b -> CatchT m a -> b foldl :: (b -> a -> b) -> b -> CatchT m a -> b foldl' :: (b -> a -> b) -> b -> CatchT m a -> b foldr1 :: (a -> a -> a) -> CatchT m a -> a foldl1 :: (a -> a -> a) -> CatchT m a -> a toList :: CatchT m a -> [a] elem :: Eq a => a -> CatchT m a -> Bool maximum :: Ord a => CatchT m a -> a minimum :: Ord a => CatchT m a -> a | |
| Foldable (PoolMap key) | |
Defined in Data.KeyedPool Methods fold :: Monoid m => PoolMap key m -> m foldMap :: Monoid m => (a -> m) -> PoolMap key a -> m foldMap' :: Monoid m => (a -> m) -> PoolMap key a -> m foldr :: (a -> b -> b) -> b -> PoolMap key a -> b foldr' :: (a -> b -> b) -> b -> PoolMap key a -> b foldl :: (b -> a -> b) -> b -> PoolMap key a -> b foldl' :: (b -> a -> b) -> b -> PoolMap key a -> b foldr1 :: (a -> a -> a) -> PoolMap key a -> a foldl1 :: (a -> a -> a) -> PoolMap key a -> a toList :: PoolMap key a -> [a] length :: PoolMap key a -> Int elem :: Eq a => a -> PoolMap key a -> Bool maximum :: Ord a => PoolMap key a -> a minimum :: Ord a => PoolMap key a -> a | |
| Foldable f => Foldable (Rec1 f) | |
Defined in Data.Foldable Methods fold :: Monoid m => Rec1 f m -> m foldMap :: Monoid m => (a -> m) -> Rec1 f a -> m foldMap' :: Monoid m => (a -> m) -> Rec1 f a -> m foldr :: (a -> b -> b) -> b -> Rec1 f a -> b foldr' :: (a -> b -> b) -> b -> Rec1 f a -> b foldl :: (b -> a -> b) -> b -> Rec1 f a -> b foldl' :: (b -> a -> b) -> b -> Rec1 f a -> b foldr1 :: (a -> a -> a) -> Rec1 f a -> a foldl1 :: (a -> a -> a) -> Rec1 f a -> a toList :: Rec1 f a -> [a] elem :: Eq a => a -> Rec1 f a -> Bool maximum :: Ord a => Rec1 f a -> a | |
| Foldable (URec Char :: Type -> Type) | |
Defined in Data.Foldable Methods fold :: Monoid m => URec Char m -> m foldMap :: Monoid m => (a -> m) -> URec Char a -> m foldMap' :: Monoid m => (a -> m) -> URec Char a -> m foldr :: (a -> b -> b) -> b -> URec Char a -> b foldr' :: (a -> b -> b) -> b -> URec Char a -> b foldl :: (b -> a -> b) -> b -> URec Char a -> b foldl' :: (b -> a -> b) -> b -> URec Char a -> b foldr1 :: (a -> a -> a) -> URec Char a -> a foldl1 :: (a -> a -> a) -> URec Char a -> a elem :: Eq a => a -> URec Char a -> Bool maximum :: Ord a => URec Char a -> a minimum :: Ord a => URec Char a -> a | |
| Foldable (URec Double :: Type -> Type) | |
Defined in Data.Foldable Methods fold :: Monoid m => URec Double m -> m foldMap :: Monoid m => (a -> m) -> URec Double a -> m foldMap' :: Monoid m => (a -> m) -> URec Double a -> m foldr :: (a -> b -> b) -> b -> URec Double a -> b foldr' :: (a -> b -> b) -> b -> URec Double a -> b foldl :: (b -> a -> b) -> b -> URec Double a -> b foldl' :: (b -> a -> b) -> b -> URec Double a -> b foldr1 :: (a -> a -> a) -> URec Double a -> a foldl1 :: (a -> a -> a) -> URec Double a -> a toList :: URec Double a -> [a] length :: URec Double a -> Int elem :: Eq a => a -> URec Double a -> Bool maximum :: Ord a => URec Double a -> a minimum :: Ord a => URec Double a -> a | |
| Foldable (URec Float :: Type -> Type) | |
Defined in Data.Foldable Methods fold :: Monoid m => URec Float m -> m foldMap :: Monoid m => (a -> m) -> URec Float a -> m foldMap' :: Monoid m => (a -> m) -> URec Float a -> m foldr :: (a -> b -> b) -> b -> URec Float a -> b foldr' :: (a -> b -> b) -> b -> URec Float a -> b foldl :: (b -> a -> b) -> b -> URec Float a -> b foldl' :: (b -> a -> b) -> b -> URec Float a -> b foldr1 :: (a -> a -> a) -> URec Float a -> a foldl1 :: (a -> a -> a) -> URec Float a -> a elem :: Eq a => a -> URec Float a -> Bool maximum :: Ord a => URec Float a -> a minimum :: Ord a => URec Float a -> a | |
| Foldable (URec Int :: Type -> Type) | |
Defined in Data.Foldable Methods fold :: Monoid m => URec Int m -> m foldMap :: Monoid m => (a -> m) -> URec Int a -> m foldMap' :: Monoid m => (a -> m) -> URec Int a -> m foldr :: (a -> b -> b) -> b -> URec Int a -> b foldr' :: (a -> b -> b) -> b -> URec Int a -> b foldl :: (b -> a -> b) -> b -> URec Int a -> b foldl' :: (b -> a -> b) -> b -> URec Int a -> b foldr1 :: (a -> a -> a) -> URec Int a -> a foldl1 :: (a -> a -> a) -> URec Int a -> a elem :: Eq a => a -> URec Int a -> Bool maximum :: Ord a => URec Int a -> a minimum :: Ord a => URec Int a -> a | |
| Foldable (URec Word :: Type -> Type) | |
Defined in Data.Foldable Methods fold :: Monoid m => URec Word m -> m foldMap :: Monoid m => (a -> m) -> URec Word a -> m foldMap' :: Monoid m => (a -> m) -> URec Word a -> m foldr :: (a -> b -> b) -> b -> URec Word a -> b foldr' :: (a -> b -> b) -> b -> URec Word a -> b foldl :: (b -> a -> b) -> b -> URec Word a -> b foldl' :: (b -> a -> b) -> b -> URec Word a -> b foldr1 :: (a -> a -> a) -> URec Word a -> a foldl1 :: (a -> a -> a) -> URec Word a -> a elem :: Eq a => a -> URec Word a -> Bool maximum :: Ord a => URec Word a -> a minimum :: Ord a => URec Word a -> a | |
| Foldable (URec (Ptr ()) :: Type -> Type) | |
Defined in Data.Foldable Methods fold :: Monoid m => URec (Ptr ()) m -> m foldMap :: Monoid m => (a -> m) -> URec (Ptr ()) a -> m foldMap' :: Monoid m => (a -> m) -> URec (Ptr ()) a -> m foldr :: (a -> b -> b) -> b -> URec (Ptr ()) a -> b foldr' :: (a -> b -> b) -> b -> URec (Ptr ()) a -> b foldl :: (b -> a -> b) -> b -> URec (Ptr ()) a -> b foldl' :: (b -> a -> b) -> b -> URec (Ptr ()) a -> b foldr1 :: (a -> a -> a) -> URec (Ptr ()) a -> a foldl1 :: (a -> a -> a) -> URec (Ptr ()) a -> a toList :: URec (Ptr ()) a -> [a] null :: URec (Ptr ()) a -> Bool length :: URec (Ptr ()) a -> Int elem :: Eq a => a -> URec (Ptr ()) a -> Bool maximum :: Ord a => URec (Ptr ()) a -> a minimum :: Ord a => URec (Ptr ()) a -> a | |
| Foldable f => Foldable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Lazy Methods fold :: Monoid m => WriterT w f m -> m foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m foldMap' :: Monoid m => (a -> m) -> WriterT w f a -> m foldr :: (a -> b -> b) -> b -> WriterT w f a -> b foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b foldl :: (b -> a -> b) -> b -> WriterT w f a -> b foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b foldr1 :: (a -> a -> a) -> WriterT w f a -> a foldl1 :: (a -> a -> a) -> WriterT w f a -> a toList :: WriterT w f a -> [a] length :: WriterT w f a -> Int elem :: Eq a => a -> WriterT w f a -> Bool maximum :: Ord a => WriterT w f a -> a minimum :: Ord a => WriterT w f a -> a | |
| Foldable (Tagged s) | |
Defined in Data.Tagged Methods fold :: Monoid m => Tagged s m -> m foldMap :: Monoid m => (a -> m) -> Tagged s a -> m foldMap' :: Monoid m => (a -> m) -> Tagged s a -> m foldr :: (a -> b -> b) -> b -> Tagged s a -> b foldr' :: (a -> b -> b) -> b -> Tagged s a -> b foldl :: (b -> a -> b) -> b -> Tagged s a -> b foldl' :: (b -> a -> b) -> b -> Tagged s a -> b foldr1 :: (a -> a -> a) -> Tagged s a -> a foldl1 :: (a -> a -> a) -> Tagged s a -> a toList :: Tagged s a -> [a] elem :: Eq a => a -> Tagged s a -> Bool maximum :: Ord a => Tagged s a -> a minimum :: Ord a => Tagged s a -> a | |
| Foldable f => Foldable (ErrorT e f) | |
Defined in Control.Monad.Trans.Error Methods fold :: Monoid m => ErrorT e f m -> m foldMap :: Monoid m => (a -> m) -> ErrorT e f a -> m foldMap' :: Monoid m => (a -> m) -> ErrorT e f a -> m foldr :: (a -> b -> b) -> b -> ErrorT e f a -> b foldr' :: (a -> b -> b) -> b -> ErrorT e f a -> b foldl :: (b -> a -> b) -> b -> ErrorT e f a -> b foldl' :: (b -> a -> b) -> b -> ErrorT e f a -> b foldr1 :: (a -> a -> a) -> ErrorT e f a -> a foldl1 :: (a -> a -> a) -> ErrorT e f a -> a toList :: ErrorT e f a -> [a] elem :: Eq a => a -> ErrorT e f a -> Bool maximum :: Ord a => ErrorT e f a -> a minimum :: Ord a => ErrorT e f a -> a | |
| Bifoldable p => Foldable (Join p) | |
Defined in Data.Bifunctor.Join Methods fold :: Monoid m => Join p m -> m foldMap :: Monoid m => (a -> m) -> Join p a -> m foldMap' :: Monoid m => (a -> m) -> Join p a -> m foldr :: (a -> b -> b) -> b -> Join p a -> b foldr' :: (a -> b -> b) -> b -> Join p a -> b foldl :: (b -> a -> b) -> b -> Join p a -> b foldl' :: (b -> a -> b) -> b -> Join p a -> b foldr1 :: (a -> a -> a) -> Join p a -> a foldl1 :: (a -> a -> a) -> Join p a -> a toList :: Join p a -> [a] elem :: Eq a => a -> Join p a -> Bool maximum :: Ord a => Join p a -> a | |
| (Foldable m, Foldable f) => Foldable (FreeT f m) | |
Defined in Control.Monad.Trans.Free Methods fold :: Monoid m0 => FreeT f m m0 -> m0 foldMap :: Monoid m0 => (a -> m0) -> FreeT f m a -> m0 foldMap' :: Monoid m0 => (a -> m0) -> FreeT f m a -> m0 foldr :: (a -> b -> b) -> b -> FreeT f m a -> b foldr' :: (a -> b -> b) -> b -> FreeT f m a -> b foldl :: (b -> a -> b) -> b -> FreeT f m a -> b foldl' :: (b -> a -> b) -> b -> FreeT f m a -> b foldr1 :: (a -> a -> a) -> FreeT f m a -> a foldl1 :: (a -> a -> a) -> FreeT f m a -> a toList :: FreeT f m a -> [a] elem :: Eq a => a -> FreeT f m a -> Bool maximum :: Ord a => FreeT f m a -> a minimum :: Ord a => FreeT f m a -> a | |
| Foldable f => Foldable (FreeF f a) | |
Defined in Control.Monad.Trans.Free Methods fold :: Monoid m => FreeF f a m -> m foldMap :: Monoid m => (a0 -> m) -> FreeF f a a0 -> m foldMap' :: Monoid m => (a0 -> m) -> FreeF f a a0 -> m foldr :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b foldr' :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b foldl :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b foldl' :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b foldr1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 foldl1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 toList :: FreeF f a a0 -> [a0] elem :: Eq a0 => a0 -> FreeF f a a0 -> Bool maximum :: Ord a0 => FreeF f a a0 -> a0 minimum :: Ord a0 => FreeF f a a0 -> a0 | |
| Foldable f => Foldable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Strict Methods fold :: Monoid m => WriterT w f m -> m foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m foldMap' :: Monoid m => (a -> m) -> WriterT w f a -> m foldr :: (a -> b -> b) -> b -> WriterT w f a -> b foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b foldl :: (b -> a -> b) -> b -> WriterT w f a -> b foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b foldr1 :: (a -> a -> a) -> WriterT w f a -> a foldl1 :: (a -> a -> a) -> WriterT w f a -> a toList :: WriterT w f a -> [a] length :: WriterT w f a -> Int elem :: Eq a => a -> WriterT w f a -> Bool maximum :: Ord a => WriterT w f a -> a minimum :: Ord a => WriterT w f a -> a | |
| Foldable f => Foldable (Alt f) | |
Defined in Data.Foldable Methods fold :: Monoid m => Alt f m -> m foldMap :: Monoid m => (a -> m) -> Alt f a -> m foldMap' :: Monoid m => (a -> m) -> Alt f a -> m foldr :: (a -> b -> b) -> b -> Alt f a -> b foldr' :: (a -> b -> b) -> b -> Alt f a -> b foldl :: (b -> a -> b) -> b -> Alt f a -> b foldl' :: (b -> a -> b) -> b -> Alt f a -> b foldr1 :: (a -> a -> a) -> Alt f a -> a foldl1 :: (a -> a -> a) -> Alt f a -> a toList :: Alt f a -> [a] elem :: Eq a => a -> Alt f a -> Bool maximum :: Ord a => Alt f a -> a | |
| Foldable f => Foldable (ExceptT e f) | |
Defined in Control.Monad.Trans.Except Methods fold :: Monoid m => ExceptT e f m -> m foldMap :: Monoid m => (a -> m) -> ExceptT e f a -> m foldMap' :: Monoid m => (a -> m) -> ExceptT e f a -> m foldr :: (a -> b -> b) -> b -> ExceptT e f a -> b foldr' :: (a -> b -> b) -> b -> ExceptT e f a -> b foldl :: (b -> a -> b) -> b -> ExceptT e f a -> b foldl' :: (b -> a -> b) -> b -> ExceptT e f a -> b foldr1 :: (a -> a -> a) -> ExceptT e f a -> a foldl1 :: (a -> a -> a) -> ExceptT e f a -> a toList :: ExceptT e f a -> [a] length :: ExceptT e f a -> Int elem :: Eq a => a -> ExceptT e f a -> Bool maximum :: Ord a => ExceptT e f a -> a minimum :: Ord a => ExceptT e f a -> a | |
| Foldable f => Foldable (Ap f) | |
Defined in Data.Foldable Methods fold :: Monoid m => Ap f m -> m foldMap :: Monoid m => (a -> m) -> Ap f a -> m foldMap' :: Monoid m => (a -> m) -> Ap f a -> m foldr :: (a -> b -> b) -> b -> Ap f a -> b foldr' :: (a -> b -> b) -> b -> Ap f a -> b foldl :: (b -> a -> b) -> b -> Ap f a -> b foldl' :: (b -> a -> b) -> b -> Ap f a -> b foldr1 :: (a -> a -> a) -> Ap f a -> a foldl1 :: (a -> a -> a) -> Ap f a -> a toList :: Ap f a -> [a] elem :: Eq a => a -> Ap f a -> Bool maximum :: Ord a => Ap f a -> a | |
| Foldable (K1 i c :: Type -> Type) | |
Defined in Data.Foldable Methods fold :: Monoid m => K1 i c m -> m foldMap :: Monoid m => (a -> m) -> K1 i c a -> m foldMap' :: Monoid m => (a -> m) -> K1 i c a -> m foldr :: (a -> b -> b) -> b -> K1 i c a -> b foldr' :: (a -> b -> b) -> b -> K1 i c a -> b foldl :: (b -> a -> b) -> b -> K1 i c a -> b foldl' :: (b -> a -> b) -> b -> K1 i c a -> b foldr1 :: (a -> a -> a) -> K1 i c a -> a foldl1 :: (a -> a -> a) -> K1 i c a -> a toList :: K1 i c a -> [a] elem :: Eq a => a -> K1 i c a -> Bool maximum :: Ord a => K1 i c a -> a | |
| (Foldable f, Foldable g) => Foldable (f :+: g) | |
Defined in Data.Foldable Methods fold :: Monoid m => (f :+: g) m -> m foldMap :: Monoid m => (a -> m) -> (f :+: g) a -> m foldMap' :: Monoid m => (a -> m) -> (f :+: g) a -> m foldr :: (a -> b -> b) -> b -> (f :+: g) a -> b foldr' :: (a -> b -> b) -> b -> (f :+: g) a -> b foldl :: (b -> a -> b) -> b -> (f :+: g) a -> b foldl' :: (b -> a -> b) -> b -> (f :+: g) a -> b foldr1 :: (a -> a -> a) -> (f :+: g) a -> a foldl1 :: (a -> a -> a) -> (f :+: g) a -> a toList :: (f :+: g) a -> [a] elem :: Eq a => a -> (f :+: g) a -> Bool maximum :: Ord a => (f :+: g) a -> a minimum :: Ord a => (f :+: g) a -> a | |
| (Foldable f, Foldable g) => Foldable (f :*: g) | |
Defined in Data.Foldable Methods fold :: Monoid m => (f :*: g) m -> m foldMap :: Monoid m => (a -> m) -> (f :*: g) a -> m foldMap' :: Monoid m => (a -> m) -> (f :*: g) a -> m foldr :: (a -> b -> b) -> b -> (f :*: g) a -> b foldr' :: (a -> b -> b) -> b -> (f :*: g) a -> b foldl :: (b -> a -> b) -> b -> (f :*: g) a -> b foldl' :: (b -> a -> b) -> b -> (f :*: g) a -> b foldr1 :: (a -> a -> a) -> (f :*: g) a -> a foldl1 :: (a -> a -> a) -> (f :*: g) a -> a toList :: (f :*: g) a -> [a] elem :: Eq a => a -> (f :*: g) a -> Bool maximum :: Ord a => (f :*: g) a -> a minimum :: Ord a => (f :*: g) a -> a | |
| Foldable f => Foldable (M1 i c f) | |
Defined in Data.Foldable Methods fold :: Monoid m => M1 i c f m -> m foldMap :: Monoid m => (a -> m) -> M1 i c f a -> m foldMap' :: Monoid m => (a -> m) -> M1 i c f a -> m foldr :: (a -> b -> b) -> b -> M1 i c f a -> b foldr' :: (a -> b -> b) -> b -> M1 i c f a -> b foldl :: (b -> a -> b) -> b -> M1 i c f a -> b foldl' :: (b -> a -> b) -> b -> M1 i c f a -> b foldr1 :: (a -> a -> a) -> M1 i c f a -> a foldl1 :: (a -> a -> a) -> M1 i c f a -> a toList :: M1 i c f a -> [a] elem :: Eq a => a -> M1 i c f a -> Bool maximum :: Ord a => M1 i c f a -> a minimum :: Ord a => M1 i c f a -> a | |
| (Foldable f, Foldable g) => Foldable (f :.: g) | |
Defined in Data.Foldable Methods fold :: Monoid m => (f :.: g) m -> m foldMap :: Monoid m => (a -> m) -> (f :.: g) a -> m foldMap' :: Monoid m => (a -> m) -> (f :.: g) a -> m foldr :: (a -> b -> b) -> b -> (f :.: g) a -> b foldr' :: (a -> b -> b) -> b -> (f :.: g) a -> b foldl :: (b -> a -> b) -> b -> (f :.: g) a -> b foldl' :: (b -> a -> b) -> b -> (f :.: g) a -> b foldr1 :: (a -> a -> a) -> (f :.: g) a -> a foldl1 :: (a -> a -> a) -> (f :.: g) a -> a toList :: (f :.: g) a -> [a] elem :: Eq a => a -> (f :.: g) a -> Bool maximum :: Ord a => (f :.: g) a -> a minimum :: Ord a => (f :.: g) a -> a | |
| Foldable (Clown f a :: Type -> Type) | |
Defined in Data.Bifunctor.Clown Methods fold :: Monoid m => Clown f a m -> m foldMap :: Monoid m => (a0 -> m) -> Clown f a a0 -> m foldMap' :: Monoid m => (a0 -> m) -> Clown f a a0 -> m foldr :: (a0 -> b -> b) -> b -> Clown f a a0 -> b foldr' :: (a0 -> b -> b) -> b -> Clown f a a0 -> b foldl :: (b -> a0 -> b) -> b -> Clown f a a0 -> b foldl' :: (b -> a0 -> b) -> b -> Clown f a a0 -> b foldr1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 foldl1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 toList :: Clown f a a0 -> [a0] elem :: Eq a0 => a0 -> Clown f a a0 -> Bool maximum :: Ord a0 => Clown f a a0 -> a0 minimum :: Ord a0 => Clown f a a0 -> a0 | |
| Bifoldable p => Foldable (Flip p a) | |
Defined in Data.Bifunctor.Flip Methods fold :: Monoid m => Flip p a m -> m foldMap :: Monoid m => (a0 -> m) -> Flip p a a0 -> m foldMap' :: Monoid m => (a0 -> m) -> Flip p a a0 -> m foldr :: (a0 -> b -> b) -> b -> Flip p a a0 -> b foldr' :: (a0 -> b -> b) -> b -> Flip p a a0 -> b foldl :: (b -> a0 -> b) -> b -> Flip p a a0 -> b foldl' :: (b -> a0 -> b) -> b -> Flip p a a0 -> b foldr1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 foldl1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 toList :: Flip p a a0 -> [a0] elem :: Eq a0 => a0 -> Flip p a a0 -> Bool maximum :: Ord a0 => Flip p a a0 -> a0 minimum :: Ord a0 => Flip p a a0 -> a0 | |
| Foldable g => Foldable (Joker g a) | |
Defined in Data.Bifunctor.Joker Methods fold :: Monoid m => Joker g a m -> m foldMap :: Monoid m => (a0 -> m) -> Joker g a a0 -> m foldMap' :: Monoid m => (a0 -> m) -> Joker g a a0 -> m foldr :: (a0 -> b -> b) -> b -> Joker g a a0 -> b foldr' :: (a0 -> b -> b) -> b -> Joker g a a0 -> b foldl :: (b -> a0 -> b) -> b -> Joker g a a0 -> b foldl' :: (b -> a0 -> b) -> b -> Joker g a a0 -> b foldr1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 foldl1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 toList :: Joker g a a0 -> [a0] elem :: Eq a0 => a0 -> Joker g a a0 -> Bool maximum :: Ord a0 => Joker g a a0 -> a0 minimum :: Ord a0 => Joker g a a0 -> a0 | |
| Bifoldable p => Foldable (WrappedBifunctor p a) | |
Defined in Data.Bifunctor.Wrapped Methods fold :: Monoid m => WrappedBifunctor p a m -> m foldMap :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m foldMap' :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m foldr :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b foldr' :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b foldl :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b foldl' :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b foldr1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 foldl1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 toList :: WrappedBifunctor p a a0 -> [a0] null :: WrappedBifunctor p a a0 -> Bool length :: WrappedBifunctor p a a0 -> Int elem :: Eq a0 => a0 -> WrappedBifunctor p a a0 -> Bool maximum :: Ord a0 => WrappedBifunctor p a a0 -> a0 minimum :: Ord a0 => WrappedBifunctor p a a0 -> a0 | |
| (Foldable f, Bifoldable p) => Foldable (Tannen f p a) | |
Defined in Data.Bifunctor.Tannen Methods fold :: Monoid m => Tannen f p a m -> m foldMap :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m foldMap' :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m foldr :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b foldr' :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b foldl :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b foldl' :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b foldr1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 foldl1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 toList :: Tannen f p a a0 -> [a0] null :: Tannen f p a a0 -> Bool length :: Tannen f p a a0 -> Int elem :: Eq a0 => a0 -> Tannen f p a a0 -> Bool maximum :: Ord a0 => Tannen f p a a0 -> a0 minimum :: Ord a0 => Tannen f p a a0 -> a0 | |
| (Bifoldable p, Foldable g) => Foldable (Biff p f g a) | |
Defined in Data.Bifunctor.Biff Methods fold :: Monoid m => Biff p f g a m -> m foldMap :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m foldMap' :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m foldr :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b foldr' :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b foldl :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b foldl' :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b foldr1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 foldl1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 toList :: Biff p f g a a0 -> [a0] null :: Biff p f g a a0 -> Bool length :: Biff p f g a a0 -> Int elem :: Eq a0 => a0 -> Biff p f g a a0 -> Bool maximum :: Ord a0 => Biff p f g a a0 -> a0 minimum :: Ord a0 => Biff p f g a a0 -> a0 | |
class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where #
Methods
traverse :: Applicative f => (a -> f b) -> t a -> f (t b) #
sequenceA :: Applicative f => t (f a) -> f (t a) #
Instances
| Traversable [] | |
Defined in Data.Traversable | |
| Traversable Maybe | |
| Traversable Par1 | |
Defined in Data.Traversable | |
| Traversable IResult | |
| Traversable Result | |
| Traversable Identity | |
| Traversable Vector | |
| Traversable Down | |
| Traversable IntMap | |
| Traversable Seq | |
| Traversable Response | |
Defined in Network.HTTP.Client.Types | |
| Traversable HistoriedResponse | |
Defined in Network.HTTP.Client Methods traverse :: Applicative f => (a -> f b) -> HistoriedResponse a -> f (HistoriedResponse b) # sequenceA :: Applicative f => HistoriedResponse (f a) -> f (HistoriedResponse a) # mapM :: Monad m => (a -> m b) -> HistoriedResponse a -> m (HistoriedResponse b) # sequence :: Monad m => HistoriedResponse (m a) -> m (HistoriedResponse a) # | |
| Traversable NonEmpty | |
Defined in Data.Traversable | |
| Traversable FormResult | |
Defined in Yesod.Form.Types Methods traverse :: Applicative f => (a -> f b) -> FormResult a -> f (FormResult b) # sequenceA :: Applicative f => FormResult (f a) -> f (FormResult a) # mapM :: Monad m => (a -> m b) -> FormResult a -> m (FormResult b) # sequence :: Monad m => FormResult (m a) -> m (FormResult a) # | |
| Traversable Option | |
Defined in Data.Semigroup | |
| Traversable Dual | |
Defined in Data.Traversable | |
| Traversable Product | |
Defined in Data.Traversable | |
| Traversable Sum | |
Defined in Data.Traversable | |
| Traversable ZipList | |
Defined in Data.Traversable | |
| Traversable Elem | |
Defined in Data.Sequence.Internal | |
| Traversable First | |
Defined in Data.Traversable | |
| Traversable ViewL | |
Defined in Data.Sequence.Internal | |
| Traversable ViewR | |
Defined in Data.Sequence.Internal | |
| Traversable Node | |
Defined in Data.Sequence.Internal | |
| Traversable FingerTree | |
Defined in Data.Sequence.Internal | |
| Traversable Array | |
Defined in Data.Primitive.Array | |
| Traversable SmallArray | |
Defined in Data.Primitive.SmallArray | |
| Traversable First | |
Defined in Data.Semigroup | |
| Traversable Last | |
Defined in Data.Semigroup | |
| Traversable Max | |
Defined in Data.Semigroup | |
| Traversable Min | |
Defined in Data.Semigroup | |
| Traversable Last | |
Defined in Data.Traversable | |
| Traversable Digit | |
Defined in Data.Sequence.Internal | |
| Traversable (Either a) | |
Defined in Data.Traversable | |
| Traversable (V1 :: Type -> Type) | |
Defined in Data.Traversable | |
| Traversable (U1 :: Type -> Type) | |
Defined in Data.Traversable | |
| Traversable ((,) a) | |
Defined in Data.Traversable | |
| Traversable (HashMap k) | |
Defined in Data.HashMap.Base | |
| Traversable (Map k) | |
| Traversable (Arg a) | |
Defined in Data.Semigroup | |
| Traversable (Proxy :: Type -> Type) | |
Defined in Data.Traversable | |
| Ix i => Traversable (Array i) | |
Defined in Data.Traversable | |
| Traversable f => Traversable (Cofree f) | |
Defined in Control.Comonad.Cofree | |
| Traversable f => Traversable (Free f) | |
Defined in Control.Monad.Free | |
| Traversable f => Traversable (MaybeT f) | |
Defined in Control.Monad.Trans.Maybe | |
| (Monad m, Traversable m) => Traversable (CatchT m) | |
Defined in Control.Monad.Catch.Pure | |
| Traversable f => Traversable (Rec1 f) | |
Defined in Data.Traversable | |
| Traversable (URec Char :: Type -> Type) | |
Defined in Data.Traversable | |
| Traversable (URec Double :: Type -> Type) | |
Defined in Data.Traversable | |
| Traversable (URec Float :: Type -> Type) | |
Defined in Data.Traversable | |
| Traversable (URec Int :: Type -> Type) | |
| Traversable (URec Word :: Type -> Type) | |
Defined in Data.Traversable | |
| Traversable (URec (Ptr ()) :: Type -> Type) | |
Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec (Ptr ()) a -> f (URec (Ptr ()) b) # sequenceA :: Applicative f => URec (Ptr ()) (f a) -> f (URec (Ptr ()) a) # mapM :: Monad m => (a -> m b) -> URec (Ptr ()) a -> m (URec (Ptr ()) b) # sequence :: Monad m => URec (Ptr ()) (m a) -> m (URec (Ptr ()) a) # | |
| Traversable f => Traversable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Lazy | |
| Traversable (Const m :: Type -> Type) | |
Defined in Data.Traversable | |
| Traversable (Tagged s) | |
Defined in Data.Tagged | |
| Traversable f => Traversable (ErrorT e f) | |
Defined in Control.Monad.Trans.Error | |
| Bitraversable p => Traversable (Join p) | |
Defined in Data.Bifunctor.Join | |
| (Monad m, Traversable m, Traversable f) => Traversable (FreeT f m) | |
Defined in Control.Monad.Trans.Free | |
| Traversable f => Traversable (FreeF f a) | |
Defined in Control.Monad.Trans.Free | |
| Traversable f => Traversable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Strict | |
| Traversable f => Traversable (Alt f) | |
Defined in Data.Traversable | |
| Traversable f => Traversable (ExceptT e f) | |
Defined in Control.Monad.Trans.Except | |
| Traversable f => Traversable (Ap f) | |
Defined in Data.Traversable | |
| Traversable (K1 i c :: Type -> Type) | |
Defined in Data.Traversable | |
| (Traversable f, Traversable g) => Traversable (f :+: g) | |
Defined in Data.Traversable | |
| (Traversable f, Traversable g) => Traversable (f :*: g) | |
Defined in Data.Traversable | |
| Traversable f => Traversable (M1 i c f) | |
Defined in Data.Traversable | |
| (Traversable f, Traversable g) => Traversable (f :.: g) | |
Defined in Data.Traversable | |
| Traversable (Clown f a :: Type -> Type) | |
Defined in Data.Bifunctor.Clown | |
| Bitraversable p => Traversable (Flip p a) | |
Defined in Data.Bifunctor.Flip | |
| Traversable g => Traversable (Joker g a) | |
Defined in Data.Bifunctor.Joker | |
| Bitraversable p => Traversable (WrappedBifunctor p a) | |
Defined in Data.Bifunctor.Wrapped Methods traverse :: Applicative f => (a0 -> f b) -> WrappedBifunctor p a a0 -> f (WrappedBifunctor p a b) # sequenceA :: Applicative f => WrappedBifunctor p a (f a0) -> f (WrappedBifunctor p a a0) # mapM :: Monad m => (a0 -> m b) -> WrappedBifunctor p a a0 -> m (WrappedBifunctor p a b) # sequence :: Monad m => WrappedBifunctor p a (m a0) -> m (WrappedBifunctor p a a0) # | |
| (Traversable f, Bitraversable p) => Traversable (Tannen f p a) | |
Defined in Data.Bifunctor.Tannen Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Tannen f p a a0 -> f0 (Tannen f p a b) # sequenceA :: Applicative f0 => Tannen f p a (f0 a0) -> f0 (Tannen f p a a0) # mapM :: Monad m => (a0 -> m b) -> Tannen f p a a0 -> m (Tannen f p a b) # sequence :: Monad m => Tannen f p a (m a0) -> m (Tannen f p a a0) # | |
| (Bitraversable p, Traversable g) => Traversable (Biff p f g a) | |
Defined in Data.Bifunctor.Biff Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Biff p f g a a0 -> f0 (Biff p f g a b) # sequenceA :: Applicative f0 => Biff p f g a (f0 a0) -> f0 (Biff p f g a a0) # mapM :: Monad m => (a0 -> m b) -> Biff p f g a a0 -> m (Biff p f g a b) # sequence :: Monad m => Biff p f g a (m a0) -> m (Biff p f g a a0) # | |
Minimal complete definition
from, to
Instances
| Generic Bool | |
| Generic Ordering | |
| Generic Exp | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Exp :: Type -> Type | |
| Generic Match | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Match :: Type -> Type | |
| Generic Clause | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Clause :: Type -> Type | |
| Generic Pat | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Pat :: Type -> Type | |
| Generic Type | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Type :: Type -> Type | |
| Generic Dec | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Dec :: Type -> Type | |
| Generic Name | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Name :: Type -> Type | |
| Generic FunDep | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep FunDep :: Type -> Type | |
| Generic InjectivityAnn | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep InjectivityAnn :: Type -> Type | |
| Generic Overlap | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Overlap :: Type -> Type | |
| Generic () | |
Defined in GHC.Generics Associated Types type Rep () :: Type -> Type | |
| Generic Con | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Con :: Type -> Type | |
| Generic Value | |
| Generic ConcException | |
Defined in UnliftIO.Internals.Async Associated Types type Rep ConcException :: Type -> Type | |
| Generic Void | |
| Generic ErrorResponse | |
Defined in Yesod.Core.Types Associated Types type Rep ErrorResponse :: Type -> Type | |
| Generic NameFlavour | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep NameFlavour :: Type -> Type | |
| Generic All | |
Defined in Data.Semigroup.Internal Associated Types type Rep All :: Type -> Type | |
| Generic Any | |
Defined in Data.Semigroup.Internal Associated Types type Rep Any :: Type -> Type | |
| Generic OccName | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep OccName :: Type -> Type | |
| Generic Body | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Body :: Type -> Type | |
| Generic Lit | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Lit :: Type -> Type | |
| Generic URIAuth | |
Defined in Network.URI Associated Types type Rep URIAuth :: Type -> Type | |
| Generic URI | |
Defined in Network.URI Associated Types type Rep URI :: Type -> Type | |
| Generic Version | |
Defined in Data.Version Associated Types type Rep Version :: Type -> Type | |
| Generic Associativity | |
Defined in GHC.Generics Associated Types type Rep Associativity :: Type -> Type | |
| Generic DecidedStrictness | |
Defined in GHC.Generics Associated Types type Rep DecidedStrictness :: Type -> Type | |
| Generic Fixity | |
Defined in GHC.Generics Associated Types type Rep Fixity :: Type -> Type | |
| Generic SourceStrictness | |
Defined in GHC.Generics Associated Types type Rep SourceStrictness :: Type -> Type | |
| Generic SourceUnpackedness | |
Defined in GHC.Generics Associated Types type Rep SourceUnpackedness :: Type -> Type | |
| Generic Mode | |
Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep Mode :: Type -> Type | |
| Generic Style | |
Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep Style :: Type -> Type | |
| Generic TextDetails | |
Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep TextDetails :: Type -> Type | |
| Generic Doc | |
Defined in Text.PrettyPrint.HughesPJ Associated Types type Rep Doc :: Type -> Type | |
| Generic CompressionLevel | |
Defined in Codec.Compression.Zlib.Stream Associated Types type Rep CompressionLevel :: Type -> Type | |
| Generic CompressionStrategy | |
Defined in Codec.Compression.Zlib.Stream Associated Types type Rep CompressionStrategy :: Type -> Type | |
| Generic Format | |
Defined in Codec.Compression.Zlib.Stream Associated Types type Rep Format :: Type -> Type | |
| Generic MemoryLevel | |
Defined in Codec.Compression.Zlib.Stream Associated Types type Rep MemoryLevel :: Type -> Type | |
| Generic Method | |
Defined in Codec.Compression.Zlib.Stream Associated Types type Rep Method :: Type -> Type | |
| Generic WindowBits | |
Defined in Codec.Compression.Zlib.Stream Associated Types type Rep WindowBits :: Type -> Type | |
| Generic Loc | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Loc :: Type -> Type | |
| Generic EmailAddress | |
Defined in Text.Email.Parser Associated Types type Rep EmailAddress :: Type -> Type | |
| Generic IP | |
Defined in Data.IP.Addr Associated Types type Rep IP :: Type -> Type | |
| Generic IPv4 | |
Defined in Data.IP.Addr Associated Types type Rep IPv4 :: Type -> Type | |
| Generic IPv6 | |
Defined in Data.IP.Addr Associated Types type Rep IPv6 :: Type -> Type | |
| Generic IPRange | |
Defined in Data.IP.Range Associated Types type Rep IPRange :: Type -> Type | |
| Generic VarType | |
Defined in Text.Shakespeare Associated Types type Rep VarType :: Type -> Type | |
| Generic Content | |
Defined in Data.XML.Types Associated Types type Rep Content :: Type -> Type | |
| Generic Doctype | |
Defined in Data.XML.Types Associated Types type Rep Doctype :: Type -> Type | |
| Generic Document | |
Defined in Data.XML.Types Associated Types type Rep Document :: Type -> Type | |
| Generic Element | |
Defined in Data.XML.Types Associated Types type Rep Element :: Type -> Type | |
| Generic Event | |
Defined in Data.XML.Types Associated Types type Rep Event :: Type -> Type | |
| Generic ExternalID | |
Defined in Data.XML.Types Associated Types type Rep ExternalID :: Type -> Type | |
| Generic Instruction | |
Defined in Data.XML.Types Associated Types type Rep Instruction :: Type -> Type | |
| Generic Miscellaneous | |
Defined in Data.XML.Types Associated Types type Rep Miscellaneous :: Type -> Type | |
| Generic Name | |
Defined in Data.XML.Types Associated Types type Rep Name :: Type -> Type | |
| Generic Node | |
Defined in Data.XML.Types Associated Types type Rep Node :: Type -> Type | |
| Generic Prologue | |
Defined in Data.XML.Types Associated Types type Rep Prologue :: Type -> Type | |
| Generic ExitCode | |
Defined in GHC.IO.Exception Associated Types type Rep ExitCode :: Type -> Type | |
| Generic AnnLookup | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep AnnLookup :: Type -> Type | |
| Generic AnnTarget | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep AnnTarget :: Type -> Type | |
| Generic Bang | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Bang :: Type -> Type | |
| Generic Callconv | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Callconv :: Type -> Type | |
| Generic DecidedStrictness | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep DecidedStrictness :: Type -> Type | |
| Generic DerivClause | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep DerivClause :: Type -> Type | |
| Generic DerivStrategy | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep DerivStrategy :: Type -> Type | |
| Generic FamilyResultSig | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep FamilyResultSig :: Type -> Type | |
| Generic Fixity | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Fixity :: Type -> Type | |
| Generic FixityDirection | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep FixityDirection :: Type -> Type | |
| Generic Foreign | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Foreign :: Type -> Type | |
| Generic Guard | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Guard :: Type -> Type | |
| Generic Info | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Info :: Type -> Type | |
| Generic Inline | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Inline :: Type -> Type | |
| Generic ModName | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep ModName :: Type -> Type | |
| Generic Module | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Module :: Type -> Type | |
| Generic ModuleInfo | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep ModuleInfo :: Type -> Type | |
| Generic NameSpace | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep NameSpace :: Type -> Type | |
| Generic PatSynArgs | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep PatSynArgs :: Type -> Type | |
| Generic PatSynDir | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep PatSynDir :: Type -> Type | |
| Generic Phases | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Phases :: Type -> Type | |
| Generic PkgName | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep PkgName :: Type -> Type | |
| Generic Pragma | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Pragma :: Type -> Type | |
| Generic Range | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Range :: Type -> Type | |
| Generic Role | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Role :: Type -> Type | |
| Generic RuleBndr | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep RuleBndr :: Type -> Type | |
| Generic RuleMatch | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep RuleMatch :: Type -> Type | |
| Generic Safety | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Safety :: Type -> Type | |
| Generic SourceStrictness | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep SourceStrictness :: Type -> Type | |
| Generic SourceUnpackedness | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep SourceUnpackedness :: Type -> Type | |
| Generic Stmt | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep Stmt :: Type -> Type | |
| Generic TyLit | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep TyLit :: Type -> Type | |
| Generic TySynEqn | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep TySynEqn :: Type -> Type | |
| Generic TyVarBndr | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep TyVarBndr :: Type -> Type | |
| Generic TypeFamilyHead | |
Defined in Language.Haskell.TH.Syntax Associated Types type Rep TypeFamilyHead :: Type -> Type | |
| Generic [a] | |
Defined in GHC.Generics Associated Types type Rep [a] :: Type -> Type | |
| Generic (Maybe a) | |
| Generic (Par1 p) | |
Defined in GHC.Generics Associated Types type Rep (Par1 p) :: Type -> Type | |
| Generic (WrappedMonoid m) | |
Defined in Data.Semigroup Associated Types type Rep (WrappedMonoid m) :: Type -> Type Methods from :: WrappedMonoid m -> Rep (WrappedMonoid m) x to :: Rep (WrappedMonoid m) x -> WrappedMonoid m | |
| Generic (Identity a) | |
| Generic (Down a) | |
| Generic (HistoriedResponse body) | |
Defined in Network.HTTP.Client Associated Types type Rep (HistoriedResponse body) :: Type -> Type Methods from :: HistoriedResponse body -> Rep (HistoriedResponse body) x to :: Rep (HistoriedResponse body) x -> HistoriedResponse body | |
| Generic (NonEmpty a) | |
Defined in GHC.Generics Associated Types type Rep (NonEmpty a) :: Type -> Type | |
| (Generic (Key record), Generic record) => Generic (Entity record) | |
| Generic (Endo a) | |
Defined in Data.Semigroup.Internal Associated Types type Rep (Endo a) :: Type -> Type | |
| Generic (Option a) | |
Defined in Data.Semigroup Associated Types type Rep (Option a) :: Type -> Type | |
| Generic (Dual a) | |
Defined in Data.Semigroup.Internal Associated Types type Rep (Dual a) :: Type -> Type | |
| Generic (Product a) | |
Defined in Data.Semigroup.Internal Associated Types type Rep (Product a) :: Type -> Type | |
| Generic (Sum a) | |
Defined in Data.Semigroup.Internal Associated Types type Rep (Sum a) :: Type -> Type | |
| Generic (ZipList a) | |
Defined in Control.Applicative Associated Types type Rep (ZipList a) :: Type -> Type | |
| Generic (Elem a) | |
Defined in Data.Sequence.Internal Associated Types type Rep (Elem a) :: Type -> Type | |
| Generic (ViewL a) | |
Defined in Data.Sequence.Internal Associated Types type Rep (ViewL a) :: Type -> Type | |
| Generic (ViewR a) | |
Defined in Data.Sequence.Internal Associated Types type Rep (ViewR a) :: Type -> Type | |
| Generic (Node a) | |
Defined in Data.Sequence.Internal Associated Types type Rep (Node a) :: Type -> Type | |
| Generic (FingerTree a) | |
Defined in Data.Sequence.Internal Associated Types type Rep (FingerTree a) :: Type -> Type | |
| Generic (Doc a) | |
Defined in Text.PrettyPrint.Annotated.HughesPJ Associated Types type Rep (Doc a) :: Type -> Type | |
| Generic (First a) | |
Defined in Data.Semigroup Associated Types type Rep (First a) :: Type -> Type | |
| Generic (Last a) | |
Defined in Data.Semigroup Associated Types type Rep (Last a) :: Type -> Type | |
| Generic (Max a) | |
Defined in Data.Semigroup Associated Types type Rep (Max a) :: Type -> Type | |
| Generic (Min a) | |
Defined in Data.Semigroup Associated Types type Rep (Min a) :: Type -> Type | |
| Generic (AddrRange a) | |
Defined in Data.IP.Range Associated Types type Rep (AddrRange a) :: Type -> Type | |
| Generic (Digit a) | |
Defined in Data.Sequence.Internal Associated Types type Rep (Digit a) :: Type -> Type | |
| Generic (Either a b) | |
| Generic (V1 p) | |
Defined in GHC.Generics Associated Types type Rep (V1 p) :: Type -> Type | |
| Generic (U1 p) | |
Defined in GHC.Generics Associated Types type Rep (U1 p) :: Type -> Type | |
| Generic (a, b) | |
Defined in GHC.Generics Associated Types type Rep (a, b) :: Type -> Type | |
| Generic (Arg a b) | |
Defined in Data.Semigroup Associated Types type Rep (Arg a b) :: Type -> Type | |
| Generic (WrappedMonad m a) | |
Defined in Control.Applicative Associated Types type Rep (WrappedMonad m a) :: Type -> Type | |
| Generic (Proxy t) | |
Defined in GHC.Generics Associated Types type Rep (Proxy t) :: Type -> Type | |
| Generic (Cofree f a) | |
Defined in Control.Comonad.Cofree Associated Types type Rep (Cofree f a) :: Type -> Type | |
| Generic (Free f a) | |
Defined in Control.Monad.Free Associated Types type Rep (Free f a) :: Type -> Type | |
| Generic (Rec1 f p) | |
Defined in GHC.Generics Associated Types type Rep (Rec1 f p) :: Type -> Type | |
| Generic (URec (Ptr ()) p) | |
Defined in GHC.Generics Associated Types type Rep (URec (Ptr ()) p) :: Type -> Type | |
| Generic (URec Char p) | |
| Generic (URec Double p) | |
| Generic (URec Float p) | |
| Generic (URec Int p) | |
| Generic (URec Word p) | |
| Generic (a, b, c) | |
Defined in GHC.Generics Associated Types type Rep (a, b, c) :: Type -> Type | |
| Generic (Tagged s b) | |
Defined in Data.Tagged Associated Types type Rep (Tagged s b) :: Type -> Type | |
| Generic (WrappedArrow a b c) | |
Defined in Control.Applicative Associated Types type Rep (WrappedArrow a b c) :: Type -> Type | |
| Generic (Join p a) | |
Defined in Data.Bifunctor.Join Associated Types type Rep (Join p a) :: Type -> Type | |
| Generic (FreeF f a b) | |
Defined in Control.Monad.Trans.Free Associated Types type Rep (FreeF f a b) :: Type -> Type | |
| Generic (Alt f a) | |
Defined in Data.Semigroup.Internal Associated Types type Rep (Alt f a) :: Type -> Type | |
| Generic (K1 i c p) | |
Defined in GHC.Generics Associated Types type Rep (K1 i c p) :: Type -> Type | |
| Generic ((f :+: g) p) | |
Defined in GHC.Generics Associated Types type Rep ((f :+: g) p) :: Type -> Type | |
| Generic ((f :*: g) p) | |
Defined in GHC.Generics Associated Types type Rep ((f :*: g) p) :: Type -> Type | |
| Generic (a, b, c, d) | |
Defined in GHC.Generics Associated Types type Rep (a, b, c, d) :: Type -> Type | |
| Generic (M1 i c f p) | |
Defined in GHC.Generics Associated Types type Rep (M1 i c f p) :: Type -> Type | |
| Generic ((f :.: g) p) | |
Defined in GHC.Generics Associated Types type Rep ((f :.: g) p) :: Type -> Type | |
| Generic (a, b, c, d, e) | |
Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e) :: Type -> Type | |
| Generic (Clown f a b) | |
Defined in Data.Bifunctor.Clown Associated Types type Rep (Clown f a b) :: Type -> Type | |
| Generic (Flip p a b) | |
Defined in Data.Bifunctor.Flip Associated Types type Rep (Flip p a b) :: Type -> Type | |
| Generic (Joker g a b) | |
Defined in Data.Bifunctor.Joker Associated Types type Rep (Joker g a b) :: Type -> Type | |
| Generic (WrappedBifunctor p a b) | |
Defined in Data.Bifunctor.Wrapped Associated Types type Rep (WrappedBifunctor p a b) :: Type -> Type | |
| Generic (a, b, c, d, e, f) | |
Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f) :: Type -> Type | |
| Generic (Product f g a b) | |
Defined in Data.Bifunctor.Product Associated Types type Rep (Product f g a b) :: Type -> Type | |
| Generic (Sum p q a b) | |
Defined in Data.Bifunctor.Sum Associated Types type Rep (Sum p q a b) :: Type -> Type | |
| Generic (a, b, c, d, e, f, g) | |
Defined in GHC.Generics Associated Types type Rep (a, b, c, d, e, f, g) :: Type -> Type | |
| Generic (Tannen f p a b) | |
Defined in Data.Bifunctor.Tannen Associated Types type Rep (Tannen f p a b) :: Type -> Type | |
| Generic (Biff p f g a b) | |
Defined in Data.Bifunctor.Biff Associated Types type Rep (Biff p f g a b) :: Type -> Type | |
Minimal complete definition
Instances
class Semigroup a => Monoid a where #
Minimal complete definition
Instances
Instances
Instances
| Bounded Char | |
| Enum Char | |
| Eq Char | |
| Ord Char | |
| Read Char | |
| Show Char | |
| Lift Char | |
Defined in Language.Haskell.TH.Syntax | |
| Hashable Char | |
Defined in Data.Hashable.Class | |
| ToJSON Char | |
| ToJSONKey Char | |
Defined in Data.Aeson.Types.ToJSON Methods | |
| FromJSON Char | |
| FromJSONKey Char | |
Defined in Data.Aeson.Types.FromJSON Methods | |
| Prim Char | |
Defined in Data.Primitive.Types Methods alignment# :: Char -> Int# indexByteArray# :: ByteArray# -> Int# -> Char readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Char #) writeByteArray# :: MutableByteArray# s -> Int# -> Char -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Char -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Char readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Char #) writeOffAddr# :: Addr# -> Int# -> Char -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Char -> State# s -> State# s | |
| NFData Char | |
Defined in Control.DeepSeq | |
| Unbox Char | |
Defined in Data.Vector.Unboxed.Base | |
| Storable Char | |
Defined in Foreign.Storable | |
| PathPiece String | |
Defined in Web.PathPieces | |
| ToFlushBuilder String | |
Defined in Yesod.Core.Content Methods toFlushBuilder :: String -> Flush Builder # | |
| ToContent String | |
Defined in Yesod.Core.Content | |
| ToMessage String | |
Defined in Text.Shakespeare.I18N | |
| ToMarkup Char | |
Defined in Text.Blaze | |
| ToMarkup String | |
Defined in Text.Blaze | |
| PrimType Char | |
Defined in Basement.PrimType Associated Types type PrimSize Char :: Nat Methods primSizeInBytes :: Proxy Char -> CountOf Word8 primShiftToBytes :: Proxy Char -> Int primBaUIndex :: ByteArray# -> Offset Char -> Char primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Char -> prim Char primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Char -> Char -> prim () primAddrIndex :: Addr# -> Offset Char -> Char primAddrRead :: PrimMonad prim => Addr# -> Offset Char -> prim Char primAddrWrite :: PrimMonad prim => Addr# -> Offset Char -> Char -> prim () | |
| ErrorList Char | |
Defined in Control.Monad.Trans.Error | |
| PrimMemoryComparable Char | |
Defined in Basement.PrimType | |
| Subtractive Char | |
| ToLogStr String | |
Defined in System.Log.FastLogger.LogStr | |
| ToValue Char | |
Defined in Text.Blaze | |
| ToValue String | |
Defined in Text.Blaze | |
| FoldCase Char | |
Defined in Data.CaseInsensitive.Internal | |
| ToJavascript String | |
Defined in Text.Julius Methods toJavascript :: String -> Javascript | |
| ToBuilder Char Builder | |
Defined in Data.Builder | |
| ToBuilder Char Builder | |
Defined in Data.Builder | |
| RedirectUrl master String | |
Defined in Yesod.Core.Handler Methods toTextUrl :: (MonadHandler m, HandlerSite m ~ master) => String -> m Text # | |
| MVector MVector Char | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Char -> Int basicUnsafeSlice :: Int -> Int -> MVector s Char -> MVector s Char basicOverlaps :: MVector s Char -> MVector s Char -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Char) basicInitialize :: PrimMonad m => MVector (PrimState m) Char -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Char -> m (MVector (PrimState m) Char) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Char -> Int -> m Char basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Char -> Int -> Char -> m () basicClear :: PrimMonad m => MVector (PrimState m) Char -> m () basicSet :: PrimMonad m => MVector (PrimState m) Char -> Char -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Char -> MVector (PrimState m) Char -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Char -> MVector (PrimState m) Char -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Char -> Int -> m (MVector (PrimState m) Char) | |
| Vector Vector Char | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Char -> m (Vector Char) basicUnsafeThaw :: PrimMonad m => Vector Char -> m (Mutable Vector (PrimState m) Char) basicLength :: Vector Char -> Int basicUnsafeSlice :: Int -> Int -> Vector Char -> Vector Char basicUnsafeIndexM :: Monad m => Vector Char -> Int -> m Char basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Char -> Vector Char -> m () | |
| Generic1 (URec Char :: k -> Type) | |
| QueryKeyLike [Char] | |
Defined in Network.HTTP.Types.QueryLike Methods toQueryKey :: [Char] -> ByteString Source # | |
| QueryValueLike [Char] | |
Defined in Network.HTTP.Types.QueryLike Methods toQueryValue :: [Char] -> Maybe ByteString Source # | |
| PersistField [Char] | |
Defined in Database.Persist.Class.PersistField Methods toPersistValue :: [Char] -> PersistValue Source # fromPersistValue :: PersistValue -> Either Text [Char] Source # | |
| ToTypedContent [Char] | |
Defined in Yesod.Core.Content Methods toTypedContent :: [Char] -> TypedContent # | |
| ToFlushBuilder (Flush String) | |
Defined in Yesod.Core.Content Methods toFlushBuilder :: Flush String -> Flush Builder # | |
| ToCss [Char] | |
Defined in Text.Internal.Css | |
| ToAttributes [(String, String)] | |
Defined in Text.Hamlet Methods toAttributes :: [(String, String)] -> [(Text, Text)] | |
| RawJS [Char] | |
Defined in Text.Julius | |
| Functor (URec Char :: Type -> Type) | |
| Foldable (URec Char :: Type -> Type) | |
Defined in Data.Foldable Methods fold :: Monoid m => URec Char m -> m foldMap :: Monoid m => (a -> m) -> URec Char a -> m foldMap' :: Monoid m => (a -> m) -> URec Char a -> m foldr :: (a -> b -> b) -> b -> URec Char a -> b foldr' :: (a -> b -> b) -> b -> URec Char a -> b foldl :: (b -> a -> b) -> b -> URec Char a -> b foldl' :: (b -> a -> b) -> b -> URec Char a -> b foldr1 :: (a -> a -> a) -> URec Char a -> a foldl1 :: (a -> a -> a) -> URec Char a -> a elem :: Eq a => a -> URec Char a -> Bool maximum :: Ord a => URec Char a -> a minimum :: Ord a => URec Char a -> a | |
| Traversable (URec Char :: Type -> Type) | |
Defined in Data.Traversable | |
| Lift (String -> CloseStyle) | |
Defined in Text.Hamlet.Parse | |
| ToAttributes (String, String) | |
Defined in Text.Hamlet Methods toAttributes :: (String, String) -> [(Text, Text)] | |
| Eq (URec Char p) | |
| Ord (URec Char p) | |
Defined in GHC.Generics | |
| Show (URec Char p) | |
| Generic (URec Char p) | |
| newtype Vector Char | |
Defined in Data.Vector.Unboxed.Base | |
| type NatNumMaxBound Char | |
Defined in Basement.Nat type NatNumMaxBound Char = 1114111 | |
| type Difference Char | |
Defined in Basement.Numerical.Subtractive | |
| type PrimSize Char | |
Defined in Basement.PrimType type PrimSize Char = 4 | |
| data URec Char (p :: k) | |
Defined in GHC.Generics | |
| newtype MVector s Char | |
Defined in Data.Vector.Unboxed.Base | |
| type Rep1 (URec Char :: k -> Type) | |
Defined in GHC.Generics | |
| type Rep (URec Char p) | |
Defined in GHC.Generics | |
Instances
| Eq Double | |
| Floating Double | |
| Ord Double | |
| Read Double | |
| RealFloat Double | |
Defined in GHC.Float Methods floatRadix :: Double -> Integer # floatDigits :: Double -> Int # floatRange :: Double -> (Int, Int) # decodeFloat :: Double -> (Integer, Int) # encodeFloat :: Integer -> Int -> Double # significand :: Double -> Double # scaleFloat :: Int -> Double -> Double # isInfinite :: Double -> Bool # isDenormalized :: Double -> Bool # isNegativeZero :: Double -> Bool # | |
| Lift Double | |
Defined in Language.Haskell.TH.Syntax | |
| Hashable Double | |
Defined in Data.Hashable.Class | |
| ToJSON Double | |
| ToJSONKey Double | |
Defined in Data.Aeson.Types.ToJSON Methods | |
| FromJSON Double | |
| FromJSONKey Double | |
Defined in Data.Aeson.Types.FromJSON Methods | |
| Prim Double | |
Defined in Data.Primitive.Types Methods alignment# :: Double -> Int# indexByteArray# :: ByteArray# -> Int# -> Double readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Double #) writeByteArray# :: MutableByteArray# s -> Int# -> Double -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Double -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Double readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Double #) writeOffAddr# :: Addr# -> Int# -> Double -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Double -> State# s -> State# s | |
| NFData Double | |
Defined in Control.DeepSeq | |
| Unbox Double | |
Defined in Data.Vector.Unboxed.Base | |
| Storable Double | |
Defined in Foreign.Storable | |
| Default Double | |
Defined in Data.Default.Class | |
| PersistField Double | |
Defined in Database.Persist.Class.PersistField Methods toPersistValue :: Double -> PersistValue Source # fromPersistValue :: PersistValue -> Either Text Double Source # | |
| ToMarkup Double | |
Defined in Text.Blaze | |
| PrimType Double | |
Defined in Basement.PrimType Associated Types type PrimSize Double :: Nat Methods primSizeInBytes :: Proxy Double -> CountOf Word8 primShiftToBytes :: Proxy Double -> Int primBaUIndex :: ByteArray# -> Offset Double -> Double primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Double -> prim Double primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Double -> Double -> prim () primAddrIndex :: Addr# -> Offset Double -> Double primAddrRead :: PrimMonad prim => Addr# -> Offset Double -> prim Double primAddrWrite :: PrimMonad prim => Addr# -> Offset Double -> Double -> prim () | |
| Subtractive Double | |
| ToLogStr Double | |
Defined in System.Log.FastLogger.LogStr | |
| ToValue Double | |
Defined in Text.Blaze | |
| MVector MVector Double | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Double -> Int basicUnsafeSlice :: Int -> Int -> MVector s Double -> MVector s Double basicOverlaps :: MVector s Double -> MVector s Double -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Double) basicInitialize :: PrimMonad m => MVector (PrimState m) Double -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Double -> m (MVector (PrimState m) Double) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Double -> Int -> m Double basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Double -> Int -> Double -> m () basicClear :: PrimMonad m => MVector (PrimState m) Double -> m () basicSet :: PrimMonad m => MVector (PrimState m) Double -> Double -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Double -> MVector (PrimState m) Double -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Double -> MVector (PrimState m) Double -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Double -> Int -> m (MVector (PrimState m) Double) | |
| Vector Vector Double | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Double -> m (Vector Double) basicUnsafeThaw :: PrimMonad m => Vector Double -> m (Mutable Vector (PrimState m) Double) basicLength :: Vector Double -> Int basicUnsafeSlice :: Int -> Int -> Vector Double -> Vector Double basicUnsafeIndexM :: Monad m => Vector Double -> Int -> m Double basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Double -> Vector Double -> m () | |
| Generic1 (URec Double :: k -> Type) | |
| Functor (URec Double :: Type -> Type) | |
| Foldable (URec Double :: Type -> Type) | |
Defined in Data.Foldable Methods fold :: Monoid m => URec Double m -> m foldMap :: Monoid m => (a -> m) -> URec Double a -> m foldMap' :: Monoid m => (a -> m) -> URec Double a -> m foldr :: (a -> b -> b) -> b -> URec Double a -> b foldr' :: (a -> b -> b) -> b -> URec Double a -> b foldl :: (b -> a -> b) -> b -> URec Double a -> b foldl' :: (b -> a -> b) -> b -> URec Double a -> b foldr1 :: (a -> a -> a) -> URec Double a -> a foldl1 :: (a -> a -> a) -> URec Double a -> a toList :: URec Double a -> [a] length :: URec Double a -> Int elem :: Eq a => a -> URec Double a -> Bool maximum :: Ord a => URec Double a -> a minimum :: Ord a => URec Double a -> a | |
| Traversable (URec Double :: Type -> Type) | |
Defined in Data.Traversable | |
| Eq (URec Double p) | |
| Ord (URec Double p) | |
Defined in GHC.Generics Methods compare :: URec Double p -> URec Double p -> Ordering # (<) :: URec Double p -> URec Double p -> Bool # (<=) :: URec Double p -> URec Double p -> Bool # (>) :: URec Double p -> URec Double p -> Bool # (>=) :: URec Double p -> URec Double p -> Bool # | |
| Show (URec Double p) | |
| Generic (URec Double p) | |
| newtype Vector Double | |
Defined in Data.Vector.Unboxed.Base | |
| type Difference Double | |
Defined in Basement.Numerical.Subtractive | |
| type PrimSize Double | |
Defined in Basement.PrimType type PrimSize Double = 8 | |
| data URec Double (p :: k) | |
Defined in GHC.Generics | |
| newtype MVector s Double | |
Defined in Data.Vector.Unboxed.Base | |
| type Rep1 (URec Double :: k -> Type) | |
Defined in GHC.Generics | |
| type Rep (URec Double p) | |
Defined in GHC.Generics | |
Instances
| Eq Float | |
| Floating Float | |
| Ord Float | |
| Read Float | |
| RealFloat Float | |
Defined in GHC.Float Methods floatRadix :: Float -> Integer # floatDigits :: Float -> Int # floatRange :: Float -> (Int, Int) # decodeFloat :: Float -> (Integer, Int) # encodeFloat :: Integer -> Int -> Float # significand :: Float -> Float # scaleFloat :: Int -> Float -> Float # isInfinite :: Float -> Bool # isDenormalized :: Float -> Bool # isNegativeZero :: Float -> Bool # | |
| Lift Float | |
Defined in Language.Haskell.TH.Syntax | |
| Hashable Float | |
Defined in Data.Hashable.Class | |
| ToJSON Float | |
| ToJSONKey Float | |
Defined in Data.Aeson.Types.ToJSON Methods | |
| FromJSON Float | |
| FromJSONKey Float | |
Defined in Data.Aeson.Types.FromJSON Methods | |
| Prim Float | |
Defined in Data.Primitive.Types Methods alignment# :: Float -> Int# indexByteArray# :: ByteArray# -> Int# -> Float readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Float #) writeByteArray# :: MutableByteArray# s -> Int# -> Float -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Float -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Float readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Float #) writeOffAddr# :: Addr# -> Int# -> Float -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Float -> State# s -> State# s | |
| NFData Float | |
Defined in Control.DeepSeq | |
| Unbox Float | |
Defined in Data.Vector.Unboxed.Base | |
| Storable Float | |
Defined in Foreign.Storable | |
| Default Float | |
Defined in Data.Default.Class | |
| ToMarkup Float | |
Defined in Text.Blaze | |
| PrimType Float | |
Defined in Basement.PrimType Associated Types type PrimSize Float :: Nat Methods primSizeInBytes :: Proxy Float -> CountOf Word8 primShiftToBytes :: Proxy Float -> Int primBaUIndex :: ByteArray# -> Offset Float -> Float primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Float -> prim Float primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Float -> Float -> prim () primAddrIndex :: Addr# -> Offset Float -> Float primAddrRead :: PrimMonad prim => Addr# -> Offset Float -> prim Float primAddrWrite :: PrimMonad prim => Addr# -> Offset Float -> Float -> prim () | |
| Subtractive Float | |
| ToLogStr Float | |
Defined in System.Log.FastLogger.LogStr | |
| ToValue Float | |
Defined in Text.Blaze | |
| MVector MVector Float | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Float -> Int basicUnsafeSlice :: Int -> Int -> MVector s Float -> MVector s Float basicOverlaps :: MVector s Float -> MVector s Float -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Float) basicInitialize :: PrimMonad m => MVector (PrimState m) Float -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Float -> m (MVector (PrimState m) Float) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Float -> Int -> m Float basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Float -> Int -> Float -> m () basicClear :: PrimMonad m => MVector (PrimState m) Float -> m () basicSet :: PrimMonad m => MVector (PrimState m) Float -> Float -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Float -> MVector (PrimState m) Float -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Float -> MVector (PrimState m) Float -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Float -> Int -> m (MVector (PrimState m) Float) | |
| Vector Vector Float | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Float -> m (Vector Float) basicUnsafeThaw :: PrimMonad m => Vector Float -> m (Mutable Vector (PrimState m) Float) basicLength :: Vector Float -> Int basicUnsafeSlice :: Int -> Int -> Vector Float -> Vector Float basicUnsafeIndexM :: Monad m => Vector Float -> Int -> m Float basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Float -> Vector Float -> m () | |
| Generic1 (URec Float :: k -> Type) | |
| Functor (URec Float :: Type -> Type) | |
| Foldable (URec Float :: Type -> Type) | |
Defined in Data.Foldable Methods fold :: Monoid m => URec Float m -> m foldMap :: Monoid m => (a -> m) -> URec Float a -> m foldMap' :: Monoid m => (a -> m) -> URec Float a -> m foldr :: (a -> b -> b) -> b -> URec Float a -> b foldr' :: (a -> b -> b) -> b -> URec Float a -> b foldl :: (b -> a -> b) -> b -> URec Float a -> b foldl' :: (b -> a -> b) -> b -> URec Float a -> b foldr1 :: (a -> a -> a) -> URec Float a -> a foldl1 :: (a -> a -> a) -> URec Float a -> a elem :: Eq a => a -> URec Float a -> Bool maximum :: Ord a => URec Float a -> a minimum :: Ord a => URec Float a -> a | |
| Traversable (URec Float :: Type -> Type) | |
Defined in Data.Traversable | |
| Eq (URec Float p) | |
| Ord (URec Float p) | |
Defined in GHC.Generics | |
| Show (URec Float p) | |
| Generic (URec Float p) | |
| newtype Vector Float | |
Defined in Data.Vector.Unboxed.Base | |
| type Difference Float | |
Defined in Basement.Numerical.Subtractive | |
| type PrimSize Float | |
Defined in Basement.PrimType type PrimSize Float = 4 | |
| data URec Float (p :: k) | |
Defined in GHC.Generics | |
| newtype MVector s Float | |
Defined in Data.Vector.Unboxed.Base | |
| type Rep1 (URec Float :: k -> Type) | |
Defined in GHC.Generics | |
| type Rep (URec Float p) | |
Defined in GHC.Generics | |
Instances
| Bounded Int | |
| Enum Int | |
| Eq Int | |
| Integral Int | |
| Num Int | |
| Ord Int | |
| Read Int | |
| Real Int | |
Defined in GHC.Real Methods toRational :: Int -> Rational # | |
| Show Int | |
| Lift Int | |
Defined in Language.Haskell.TH.Syntax | |
| Hashable Int | |
Defined in Data.Hashable.Class | |
| ToJSON Int | |
| ToJSONKey Int | |
Defined in Data.Aeson.Types.ToJSON | |
| FromJSON Int | |
| FromJSONKey Int | |
Defined in Data.Aeson.Types.FromJSON Methods | |
| Prim Int | |
Defined in Data.Primitive.Types Methods alignment# :: Int -> Int# indexByteArray# :: ByteArray# -> Int# -> Int readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int #) writeByteArray# :: MutableByteArray# s -> Int# -> Int -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Int readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int #) writeOffAddr# :: Addr# -> Int# -> Int -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Int -> State# s -> State# s | |
| NFData Int | |
Defined in Control.DeepSeq | |
| Unbox Int | |
Defined in Data.Vector.Unboxed.Base | |
| Storable Int | |
| Default Int | |
Defined in Data.Default.Class | |
| PersistField Int | |
Defined in Database.Persist.Class.PersistField Methods toPersistValue :: Int -> PersistValue Source # fromPersistValue :: PersistValue -> Either Text Int Source # | |
| PathPiece Int | |
Defined in Web.PathPieces | |
| ToMarkup Int | |
Defined in Text.Blaze | |
| PrimType Int | |
Defined in Basement.PrimType Associated Types type PrimSize Int :: Nat Methods primSizeInBytes :: Proxy Int -> CountOf Word8 primShiftToBytes :: Proxy Int -> Int primBaUIndex :: ByteArray# -> Offset Int -> Int primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Int -> prim Int primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Int -> Int -> prim () primAddrIndex :: Addr# -> Offset Int -> Int primAddrRead :: PrimMonad prim => Addr# -> Offset Int -> prim Int primAddrWrite :: PrimMonad prim => Addr# -> Offset Int -> Int -> prim () | |
| PrimMemoryComparable Int | |
Defined in Basement.PrimType | |
| Subtractive Int | |
| ToLogStr Int | |
Defined in System.Log.FastLogger.LogStr | |
| ByteSource Int | |
Defined in Data.UUID.Types.Internal.Builder | |
| ToValue Int | |
Defined in Text.Blaze | |
| MVector MVector Int | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Int -> Int basicUnsafeSlice :: Int -> Int -> MVector s Int -> MVector s Int basicOverlaps :: MVector s Int -> MVector s Int -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Int) basicInitialize :: PrimMonad m => MVector (PrimState m) Int -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Int -> m (MVector (PrimState m) Int) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Int -> Int -> m Int basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Int -> Int -> Int -> m () basicClear :: PrimMonad m => MVector (PrimState m) Int -> m () basicSet :: PrimMonad m => MVector (PrimState m) Int -> Int -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Int -> MVector (PrimState m) Int -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Int -> MVector (PrimState m) Int -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Int -> Int -> m (MVector (PrimState m) Int) | |
| Vector Vector Int | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Int -> m (Vector Int) basicUnsafeThaw :: PrimMonad m => Vector Int -> m (Mutable Vector (PrimState m) Int) basicLength :: Vector Int -> Int basicUnsafeSlice :: Int -> Int -> Vector Int -> Vector Int basicUnsafeIndexM :: Monad m => Vector Int -> Int -> m Int basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Int -> Vector Int -> m () | |
| Generic1 (URec Int :: k -> Type) | |
| Functor (URec Int :: Type -> Type) | |
| Foldable (URec Int :: Type -> Type) | |
Defined in Data.Foldable Methods fold :: Monoid m => URec Int m -> m foldMap :: Monoid m => (a -> m) -> URec Int a -> m foldMap' :: Monoid m => (a -> m) -> URec Int a -> m foldr :: (a -> b -> b) -> b -> URec Int a -> b foldr' :: (a -> b -> b) -> b -> URec Int a -> b foldl :: (b -> a -> b) -> b -> URec Int a -> b foldl' :: (b -> a -> b) -> b -> URec Int a -> b foldr1 :: (a -> a -> a) -> URec Int a -> a foldl1 :: (a -> a -> a) -> URec Int a -> a elem :: Eq a => a -> URec Int a -> Bool maximum :: Ord a => URec Int a -> a minimum :: Ord a => URec Int a -> a | |
| Traversable (URec Int :: Type -> Type) | |
| Eq (URec Int p) | |
| Ord (URec Int p) | |
| Show (URec Int p) | |
| Generic (URec Int p) | |
| newtype Vector Int | |
Defined in Data.Vector.Unboxed.Base | |
| type NatNumMaxBound Int | |
Defined in Basement.Nat | |
| type Difference Int | |
Defined in Basement.Numerical.Subtractive | |
| type PrimSize Int | |
Defined in Basement.PrimType type PrimSize Int = 8 | |
| data URec Int (p :: k) | |
Defined in GHC.Generics | |
| newtype MVector s Int | |
Defined in Data.Vector.Unboxed.Base | |
| type ByteSink Int g | |
Defined in Data.UUID.Types.Internal.Builder type ByteSink Int g = Takes4Bytes g | |
| type Rep1 (URec Int :: k -> Type) | |
Defined in GHC.Generics | |
| type Rep (URec Int p) | |
Defined in GHC.Generics | |
Instances
Instances
Instances
Instances
| Monad Maybe | |
| Functor Maybe | |
| MonadFail Maybe | |
Defined in Control.Monad.Fail | |
| Applicative Maybe | |
| Foldable Maybe | |
Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m foldMap :: Monoid m => (a -> m) -> Maybe a -> m foldMap' :: Monoid m => (a -> m) -> Maybe a -> m foldr :: (a -> b -> b) -> b -> Maybe a -> b foldr' :: (a -> b -> b) -> b -> Maybe a -> b foldl :: (b -> a -> b) -> b -> Maybe a -> b foldl' :: (b -> a -> b) -> b -> Maybe a -> b foldr1 :: (a -> a -> a) -> Maybe a -> a foldl1 :: (a -> a -> a) -> Maybe a -> a elem :: Eq a => a -> Maybe a -> Bool maximum :: Ord a => Maybe a -> a | |
| Traversable Maybe | |
| ToJSON1 Maybe | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Maybe a -> Value Source # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Maybe a] -> Value Source # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Maybe a -> Encoding Source # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Maybe a] -> Encoding Source # | |
| FromJSON1 Maybe | |
| Alternative Maybe | |
| MonadPlus Maybe | |
| MonadThrow Maybe | |
Defined in Control.Monad.Catch | |
| FoldableWithKey Maybe | |
Defined in Data.Key Methods toKeyedList :: Maybe a -> [(Key Maybe, a)] foldMapWithKey :: Monoid m => (Key Maybe -> a -> m) -> Maybe a -> m foldrWithKey :: (Key Maybe -> a -> b -> b) -> b -> Maybe a -> b foldlWithKey :: (b -> Key Maybe -> a -> b) -> b -> Maybe a -> b | |
| Indexable Maybe | |
| Keyed Maybe | |
Defined in Data.Key Methods mapWithKey :: (Key Maybe -> a -> b) -> Maybe a -> Maybe b | |
| Lookup Maybe | |
| TraversableWithKey Maybe | |
Defined in Data.Key Methods traverseWithKey :: Applicative f => (Key Maybe -> a -> f b) -> Maybe a -> f (Maybe b) mapWithKeyM :: Monad m => (Key Maybe -> a -> m b) -> Maybe a -> m (Maybe b) | |
| Zip Maybe | |
| ZipWithKey Maybe | |
| Hashable1 Maybe | |
Defined in Data.Hashable.Class | |
| NFData1 Maybe | |
Defined in Control.DeepSeq | |
| MonadFailure Maybe | |
Defined in Basement.Monad Associated Types type Failure Maybe | |
| MonadBaseControl Maybe Maybe | |
Defined in Control.Monad.Trans.Control Associated Types type StM Maybe a | |
| (Selector s, GToJSON enc arity (K1 i (Maybe a) :: Type -> Type), KeyValuePair enc pairs, Monoid pairs) => RecordToPairs enc pairs arity (S1 s (K1 i (Maybe a) :: Type -> Type)) | |
Defined in Data.Aeson.Types.ToJSON Methods recordToPairs :: Options -> ToArgs enc arity a0 -> S1 s (K1 i (Maybe a)) a0 -> pairs | |
| (Selector s, FromJSON a) => RecordFromJSON' arity (S1 s (K1 i (Maybe a) :: Type -> Type)) | |
Defined in Data.Aeson.Types.FromJSON | |
| Eq a => Eq (Maybe a) | |
| Ord a => Ord (Maybe a) | |
| Read a => Read (Maybe a) | |
| Show a => Show (Maybe a) | |
| Generic (Maybe a) | |
| Semigroup a => Semigroup (Maybe a) | |
| Semigroup a => Monoid (Maybe a) | |
| Lift a => Lift (Maybe a) | |
Defined in Language.Haskell.TH.Syntax | |
| Hashable a => Hashable (Maybe a) | |
Defined in Data.Hashable.Class | |
| ToJSON a => ToJSON (Maybe a) | |
| FromJSON a => FromJSON (Maybe a) | |
| MonoPointed (Maybe a) | |
| MonoTraversable (Maybe a) | |
| MonoFoldable (Maybe a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Maybe a) -> m) -> Maybe a -> m # ofoldr :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # ofoldl' :: (a0 -> Element (Maybe a) -> a0) -> a0 -> Maybe a -> a0 # otoList :: Maybe a -> [Element (Maybe a)] # oall :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # oany :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # olength64 :: Maybe a -> Int64 # ocompareLength :: Integral i => Maybe a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Maybe a) -> f b) -> Maybe a -> f () # ofor_ :: Applicative f => Maybe a -> (Element (Maybe a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Maybe a) -> m ()) -> Maybe a -> m () # oforM_ :: Applicative m => Maybe a -> (Element (Maybe a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Maybe a) -> m a0) -> a0 -> Maybe a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Maybe a) -> m) -> Maybe a -> m # ofoldr1Ex :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # ofoldl1Ex' :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # headEx :: Maybe a -> Element (Maybe a) # lastEx :: Maybe a -> Element (Maybe a) # unsafeHead :: Maybe a -> Element (Maybe a) # unsafeLast :: Maybe a -> Element (Maybe a) # maximumByEx :: (Element (Maybe a) -> Element (Maybe a) -> Ordering) -> Maybe a -> Element (Maybe a) # minimumByEx :: (Element (Maybe a) -> Element (Maybe a) -> Ordering) -> Maybe a -> Element (Maybe a) # | |
| MonoFunctor (Maybe a) | |
| NFData a => NFData (Maybe a) | |
Defined in Control.DeepSeq | |
| Default (Maybe a) | |
Defined in Data.Default.Class | |
| (QueryKeyLike k, QueryValueLike v) => QueryLike [Maybe (k, v)] | |
| QueryValueLike a => QueryValueLike (Maybe a) | |
Defined in Network.HTTP.Types.QueryLike Methods toQueryValue :: Maybe a -> Maybe ByteString Source # | |
| PersistField a => PersistField (Maybe a) | |
Defined in Database.Persist.Class.PersistField Methods toPersistValue :: Maybe a -> PersistValue Source # fromPersistValue :: PersistValue -> Either Text (Maybe a) Source # | |
| PathPiece a => PathPiece (Maybe a) | |
Defined in Web.PathPieces | |
| SingKind a => SingKind (Maybe a) | |
Defined in GHC.Generics Associated Types type DemoteRep (Maybe a) | |
| Generic1 Maybe | |
| SingI ('Nothing :: Maybe a) | |
Defined in GHC.Generics | |
| SingI a2 => SingI ('Just a2 :: Maybe a1) | |
Defined in GHC.Generics | |
| type Key Maybe | |
| type Failure Maybe | |
Defined in Basement.Monad type Failure Maybe = () | |
| type StM Maybe a | |
Defined in Control.Monad.Trans.Control type StM Maybe a = a | |
| type Rep (Maybe a) | |
Defined in GHC.Generics | |
| type Element (Maybe a) | |
Defined in Data.MonoTraversable | |
| type DemoteRep (Maybe a) | |
Defined in GHC.Generics | |
| data Sing (b :: Maybe a) | |
| type Rep1 Maybe | |
Instances
| Bounded Ordering | |
| Enum Ordering | |
| Eq Ordering | |
| Ord Ordering | |
Defined in GHC.Classes | |
| Read Ordering | |
| Show Ordering | |
| Generic Ordering | |
| Semigroup Ordering | |
| Monoid Ordering | |
| Hashable Ordering | |
Defined in Data.Hashable.Class | |
| ToJSON Ordering | |
| FromJSON Ordering | |
| NFData Ordering | |
Defined in Control.DeepSeq | |
| Default Ordering | |
Defined in Data.Default.Class | |
| type Rep Ordering | |
Instances
| Monad IO | |
| Functor IO | |
| MonadFail IO | |
Defined in Control.Monad.Fail | |
| Applicative IO | |
| MonadUnliftIO IO | |
Defined in Control.Monad.IO.Unlift | |
| PrimMonad IO | |
| Alternative IO | |
| MonadPlus IO | |
| MonadIO IO | |
Defined in Control.Monad.IO.Class | |
| MonadThrow IO | |
Defined in Control.Monad.Catch | |
| Quasi IO | |
Defined in Language.Haskell.TH.Syntax Methods qReport :: Bool -> String -> IO () qRecover :: IO a -> IO a -> IO a qLookupName :: Bool -> String -> IO (Maybe Name) qReifyFixity :: Name -> IO (Maybe Fixity) qReifyInstances :: Name -> [Type] -> IO [Dec] qReifyRoles :: Name -> IO [Role] qReifyAnnotations :: Data a => AnnLookup -> IO [a] qReifyModule :: Module -> IO ModuleInfo qReifyConStrictness :: Name -> IO [DecidedStrictness] qAddDependentFile :: FilePath -> IO () qAddTempFile :: String -> IO FilePath qAddTopDecls :: [Dec] -> IO () qAddForeignFilePath :: ForeignSrcLang -> String -> IO () qAddModFinalizer :: Q () -> IO () qAddCorePlugin :: String -> IO () qGetQ :: Typeable a => IO (Maybe a) qPutQ :: Typeable a => a -> IO () qIsExtEnabled :: Extension -> IO Bool qExtsEnabled :: IO [Extension] | |
| PrimMonad IO | |
Defined in Basement.Monad Methods primitive :: (State# (PrimState IO) -> (# State# (PrimState IO), a #)) -> IO a primThrow :: Exception e => e -> IO a unPrimMonad :: IO a -> State# (PrimState IO) -> (# State# (PrimState IO), a #) primVarNew :: a -> IO (PrimVar IO a) primVarRead :: PrimVar IO a -> IO a primVarWrite :: PrimVar IO a -> a -> IO () | |
| MonadCatch IO | |
| MonadMask IO | |
| PrimBase IO | |
| MonadBaseControl IO IO | |
Defined in Control.Monad.Trans.Control Associated Types type StM IO a | |
| Semigroup a => Semigroup (IO a) | |
| Monoid a => Monoid (IO a) | |
| MonoPointed (IO a) | |
| MonoFunctor (IO a) | |
| Default a => Default (IO a) | |
Defined in Data.Default.Class | |
| ToFlushBuilder builder => ToContent (SealedConduitT () builder (ResourceT IO) ()) | |
Defined in Yesod.Core.Content | |
| ToFlushBuilder builder => ToContent (ConduitT () builder (ResourceT IO) ()) | |
| ToFlushBuilder builder => ToContent (Pipe () () builder () (ResourceT IO) ()) | |
| type PrimState IO | |
Defined in Control.Monad.Primitive | |
| type PrimState IO | |
Defined in Basement.Monad | |
| type PrimVar IO | |
Defined in Basement.Monad | |
| type StM IO a | |
Defined in Control.Monad.Trans.Control type StM IO a = a | |
| type Element (IO a) | |
Defined in Data.MonoTraversable | |
Instances
| Bounded Word | |
| Enum Word | |
| Eq Word | |
| Integral Word | |
| Num Word | |
| Ord Word | |
| Read Word | |
| Real Word | |
Defined in GHC.Real Methods toRational :: Word -> Rational # | |
| Show Word | |
| Lift Word | |
Defined in Language.Haskell.TH.Syntax | |
| Hashable Word | |
Defined in Data.Hashable.Class | |
| ToJSON Word | |
| ToJSONKey Word | |
Defined in Data.Aeson.Types.ToJSON Methods | |
| FromJSON Word | |
| FromJSONKey Word | |
Defined in Data.Aeson.Types.FromJSON Methods | |
| Prim Word | |
Defined in Data.Primitive.Types Methods alignment# :: Word -> Int# indexByteArray# :: ByteArray# -> Int# -> Word readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word #) writeByteArray# :: MutableByteArray# s -> Int# -> Word -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Word readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word #) writeOffAddr# :: Addr# -> Int# -> Word -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Word -> State# s -> State# s | |
| NFData Word | |
Defined in Control.DeepSeq | |
| Unbox Word | |
Defined in Data.Vector.Unboxed.Base | |
| Storable Word | |
Defined in Foreign.Storable | |
| Default Word | |
Defined in Data.Default.Class | |
| PersistField Word | |
Defined in Database.Persist.Class.PersistField Methods toPersistValue :: Word -> PersistValue Source # fromPersistValue :: PersistValue -> Either Text Word Source # | |
| PathPiece Word | |
Defined in Web.PathPieces | |
| ToMarkup Word | |
Defined in Text.Blaze | |
| PrimType Word | |
Defined in Basement.PrimType Associated Types type PrimSize Word :: Nat Methods primSizeInBytes :: Proxy Word -> CountOf Word8 primShiftToBytes :: Proxy Word -> Int primBaUIndex :: ByteArray# -> Offset Word -> Word primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Word -> prim Word primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Word -> Word -> prim () primAddrIndex :: Addr# -> Offset Word -> Word primAddrRead :: PrimMonad prim => Addr# -> Offset Word -> prim Word primAddrWrite :: PrimMonad prim => Addr# -> Offset Word -> Word -> prim () | |
| PrimMemoryComparable Word | |
Defined in Basement.PrimType | |
| Subtractive Word | |
| ToLogStr Word | |
Defined in System.Log.FastLogger.LogStr | |
| ToValue Word | |
Defined in Text.Blaze | |
| MVector MVector Word | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Word -> Int basicUnsafeSlice :: Int -> Int -> MVector s Word -> MVector s Word basicOverlaps :: MVector s Word -> MVector s Word -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Word) basicInitialize :: PrimMonad m => MVector (PrimState m) Word -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Word -> m (MVector (PrimState m) Word) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Word -> Int -> m Word basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Word -> Int -> Word -> m () basicClear :: PrimMonad m => MVector (PrimState m) Word -> m () basicSet :: PrimMonad m => MVector (PrimState m) Word -> Word -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Word -> MVector (PrimState m) Word -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Word -> MVector (PrimState m) Word -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Word -> Int -> m (MVector (PrimState m) Word) | |
| Vector Vector Word | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Word -> m (Vector Word) basicUnsafeThaw :: PrimMonad m => Vector Word -> m (Mutable Vector (PrimState m) Word) basicLength :: Vector Word -> Int basicUnsafeSlice :: Int -> Int -> Vector Word -> Vector Word basicUnsafeIndexM :: Monad m => Vector Word -> Int -> m Word basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Word -> Vector Word -> m () | |
| Generic1 (URec Word :: k -> Type) | |
| Functor (URec Word :: Type -> Type) | |
| Foldable (URec Word :: Type -> Type) | |
Defined in Data.Foldable Methods fold :: Monoid m => URec Word m -> m foldMap :: Monoid m => (a -> m) -> URec Word a -> m foldMap' :: Monoid m => (a -> m) -> URec Word a -> m foldr :: (a -> b -> b) -> b -> URec Word a -> b foldr' :: (a -> b -> b) -> b -> URec Word a -> b foldl :: (b -> a -> b) -> b -> URec Word a -> b foldl' :: (b -> a -> b) -> b -> URec Word a -> b foldr1 :: (a -> a -> a) -> URec Word a -> a foldl1 :: (a -> a -> a) -> URec Word a -> a elem :: Eq a => a -> URec Word a -> Bool maximum :: Ord a => URec Word a -> a minimum :: Ord a => URec Word a -> a | |
| Traversable (URec Word :: Type -> Type) | |
Defined in Data.Traversable | |
| Eq (URec Word p) | |
| Ord (URec Word p) | |
Defined in GHC.Generics | |
| Show (URec Word p) | |
| Generic (URec Word p) | |
| newtype Vector Word | |
Defined in Data.Vector.Unboxed.Base | |
| type NatNumMaxBound Word | |
Defined in Basement.Nat | |
| type Difference Word | |
Defined in Basement.Numerical.Subtractive | |
| type PrimSize Word | |
Defined in Basement.PrimType type PrimSize Word = 8 | |
| data URec Word (p :: k) | |
Defined in GHC.Generics | |
| newtype MVector s Word | |
Defined in Data.Vector.Unboxed.Base | |
| type Rep1 (URec Word :: k -> Type) | |
Defined in GHC.Generics | |
| type Rep (URec Word p) | |
Defined in GHC.Generics | |
Instances
Instances
Instances
Instances
| ToJSON2 Either | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON2 :: (a -> Value) -> ([a] -> Value) -> (b -> Value) -> ([b] -> Value) -> Either a b -> Value Source # liftToJSONList2 :: (a -> Value) -> ([a] -> Value) -> (b -> Value) -> ([b] -> Value) -> [Either a b] -> Value Source # liftToEncoding2 :: (a -> Encoding) -> ([a] -> Encoding) -> (b -> Encoding) -> ([b] -> Encoding) -> Either a b -> Encoding Source # liftToEncodingList2 :: (a -> Encoding) -> ([a] -> Encoding) -> (b -> Encoding) -> ([b] -> Encoding) -> [Either a b] -> Encoding Source # | |
| FromJSON2 Either | |
Defined in Data.Aeson.Types.FromJSON Methods liftParseJSON2 :: (Value -> Parser a) -> (Value -> Parser [a]) -> (Value -> Parser b) -> (Value -> Parser [b]) -> Value -> Parser (Either a b) Source # liftParseJSONList2 :: (Value -> Parser a) -> (Value -> Parser [a]) -> (Value -> Parser b) -> (Value -> Parser [b]) -> Value -> Parser [Either a b] Source # | |
| Bifunctor Either | |
| Hashable2 Either | |
Defined in Data.Hashable.Class | |
| NFData2 Either | |
Defined in Control.DeepSeq | |
| Monad (Either e) | |
| Functor (Either a) | |
| Applicative (Either e) | |
| Foldable (Either a) | |
Defined in Data.Foldable Methods fold :: Monoid m => Either a m -> m foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 elem :: Eq a0 => a0 -> Either a a0 -> Bool maximum :: Ord a0 => Either a a0 -> a0 minimum :: Ord a0 => Either a a0 -> a0 | |
| Traversable (Either a) | |
Defined in Data.Traversable | |
| ToJSON a => ToJSON1 (Either a) | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a0 -> Value) -> ([a0] -> Value) -> Either a a0 -> Value Source # liftToJSONList :: (a0 -> Value) -> ([a0] -> Value) -> [Either a a0] -> Value Source # liftToEncoding :: (a0 -> Encoding) -> ([a0] -> Encoding) -> Either a a0 -> Encoding Source # liftToEncodingList :: (a0 -> Encoding) -> ([a0] -> Encoding) -> [Either a a0] -> Encoding Source # | |
| FromJSON a => FromJSON1 (Either a) | |
| e ~ SomeException => MonadThrow (Either e) | |
Defined in Control.Monad.Catch | |
| Hashable a => Hashable1 (Either a) | |
Defined in Data.Hashable.Class | |
| e ~ SomeException => MonadCatch (Either e) | |
| NFData a => NFData1 (Either a) | |
Defined in Control.DeepSeq | |
| MonadFailure (Either a) | |
Defined in Basement.Monad Associated Types type Failure (Either a) | |
| e ~ SomeException => MonadMask (Either e) | |
Defined in Control.Monad.Catch | |
| Generic1 (Either a :: Type -> Type) | |
| MonadBaseControl (Either e) (Either e) | |
Defined in Control.Monad.Trans.Control Associated Types type StM (Either e) a | |
| (Eq a, Eq b) => Eq (Either a b) | |
| (Ord a, Ord b) => Ord (Either a b) | |
| (Read a, Read b) => Read (Either a b) | |
Defined in Data.Either | |
| (Show a, Show b) => Show (Either a b) | |
| Generic (Either a b) | |
| Semigroup (Either a b) | |
| (Lift a, Lift b) => Lift (Either a b) | |
Defined in Language.Haskell.TH.Syntax | |
| (Hashable a, Hashable b) => Hashable (Either a b) | |
Defined in Data.Hashable.Class | |
| (ToJSON a, ToJSON b) => ToJSON (Either a b) | |
| (FromJSON a, FromJSON b) => FromJSON (Either a b) | |
| MonoPointed (Either a b) | |
| MonoTraversable (Either a b) | |
| MonoFoldable (Either a b) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Either a b) -> m) -> Either a b -> m # ofoldr :: (Element (Either a b) -> b0 -> b0) -> b0 -> Either a b -> b0 # ofoldl' :: (a0 -> Element (Either a b) -> a0) -> a0 -> Either a b -> a0 # otoList :: Either a b -> [Element (Either a b)] # oall :: (Element (Either a b) -> Bool) -> Either a b -> Bool # oany :: (Element (Either a b) -> Bool) -> Either a b -> Bool # olength :: Either a b -> Int # olength64 :: Either a b -> Int64 # ocompareLength :: Integral i => Either a b -> i -> Ordering # otraverse_ :: Applicative f => (Element (Either a b) -> f b0) -> Either a b -> f () # ofor_ :: Applicative f => Either a b -> (Element (Either a b) -> f b0) -> f () # omapM_ :: Applicative m => (Element (Either a b) -> m ()) -> Either a b -> m () # oforM_ :: Applicative m => Either a b -> (Element (Either a b) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Either a b) -> m a0) -> a0 -> Either a b -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Either a b) -> m) -> Either a b -> m # ofoldr1Ex :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Element (Either a b) # ofoldl1Ex' :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Element (Either a b) # headEx :: Either a b -> Element (Either a b) # lastEx :: Either a b -> Element (Either a b) # unsafeHead :: Either a b -> Element (Either a b) # unsafeLast :: Either a b -> Element (Either a b) # maximumByEx :: (Element (Either a b) -> Element (Either a b) -> Ordering) -> Either a b -> Element (Either a b) # minimumByEx :: (Element (Either a b) -> Element (Either a b) -> Ordering) -> Either a b -> Element (Either a b) # | |
| MonoFunctor (Either a b) | |
| (NFData a, NFData b) => NFData (Either a b) | |
Defined in Control.DeepSeq | |
| (PersistConfig c1, PersistConfig c2, PersistConfigPool c1 ~ PersistConfigPool c2, PersistConfigBackend c1 ~ PersistConfigBackend c2) => PersistConfig (Either c1 c2) | |
Defined in Database.Persist.Class.PersistConfig Associated Types type PersistConfigBackend (Either c1 c2) :: (Type -> Type) -> Type -> Type Source # type PersistConfigPool (Either c1 c2) Source # Methods loadConfig :: Value -> Parser (Either c1 c2) Source # applyEnv :: Either c1 c2 -> IO (Either c1 c2) Source # createPoolConfig :: Either c1 c2 -> IO (PersistConfigPool (Either c1 c2)) Source # runPool :: MonadUnliftIO m => Either c1 c2 -> PersistConfigBackend (Either c1 c2) m a -> PersistConfigPool (Either c1 c2) -> m a Source # | |
| type Failure (Either a) | |
Defined in Basement.Monad type Failure (Either a) = a | |
| type StM (Either e) a | |
Defined in Control.Monad.Trans.Control type StM (Either e) a = a | |
| type Rep1 (Either a :: Type -> Type) | |
Defined in GHC.Generics type Rep1 (Either a :: Type -> Type) = D1 ('MetaData "Either" "Data.Either" "base" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1)) | |
| type Rep (Either a b) | |
Defined in GHC.Generics type Rep (Either a b) = D1 ('MetaData "Either" "Data.Either" "base" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 b))) | |
| type Element (Either a b) | |
Defined in Data.MonoTraversable | |
| type PersistConfigPool (Either c1 c2) | |
Defined in Database.Persist.Class.PersistConfig | |
| type PersistConfigBackend (Either c1 c2) | |
Defined in Database.Persist.Class.PersistConfig | |
data ByteString #
Instances
Minimal complete definition
Nothing
Instances
Instances
Constructors
| UTCTime | |
Fields
| |
Instances
| Eq UTCTime | |
| Data UTCTime | |
Defined in Data.Time.Clock.Internal.UTCTime Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UTCTime -> c UTCTime gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c UTCTime dataTypeOf :: UTCTime -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c UTCTime) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c UTCTime) gmapT :: (forall b. Data b => b -> b) -> UTCTime -> UTCTime gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UTCTime -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UTCTime -> r gmapQ :: (forall d. Data d => d -> u) -> UTCTime -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> UTCTime -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> UTCTime -> m UTCTime gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UTCTime -> m UTCTime gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UTCTime -> m UTCTime | |
| Ord UTCTime | |
Defined in Data.Time.Clock.Internal.UTCTime | |
| ToJSON UTCTime | |
| ToJSONKey UTCTime | |
Defined in Data.Aeson.Types.ToJSON Methods | |
| FromJSON UTCTime | |
| FromJSONKey UTCTime | |
Defined in Data.Aeson.Types.FromJSON Methods | |
| NFData UTCTime | |
Defined in Data.Time.Clock.Internal.UTCTime | |
| PersistField UTCTime | |
Defined in Database.Persist.Class.PersistField Methods toPersistValue :: UTCTime -> PersistValue Source # fromPersistValue :: PersistValue -> Either Text UTCTime Source # | |
Instances
| KeyValue Object | Constructs a singleton |
| BiPolyMap HashMap | |
Defined in Data.Containers Associated Types type BPMKeyConstraint HashMap key # Methods mapKeysWith :: (BPMKeyConstraint HashMap k1, BPMKeyConstraint HashMap k2) => (v -> v -> v) -> (k1 -> k2) -> HashMap k1 v -> HashMap k2 v # | |
| Eq2 HashMap | |
| Ord2 HashMap | |
Defined in Data.HashMap.Base | |
| Show2 HashMap | |
Defined in Data.HashMap.Base Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> HashMap a b -> ShowS liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [HashMap a b] -> ShowS | |
| Hashable2 HashMap | |
Defined in Data.HashMap.Base | |
| Functor (HashMap k) | |
| Foldable (HashMap k) | |
Defined in Data.HashMap.Base Methods fold :: Monoid m => HashMap k m -> m foldMap :: Monoid m => (a -> m) -> HashMap k a -> m foldMap' :: Monoid m => (a -> m) -> HashMap k a -> m foldr :: (a -> b -> b) -> b -> HashMap k a -> b foldr' :: (a -> b -> b) -> b -> HashMap k a -> b foldl :: (b -> a -> b) -> b -> HashMap k a -> b foldl' :: (b -> a -> b) -> b -> HashMap k a -> b foldr1 :: (a -> a -> a) -> HashMap k a -> a foldl1 :: (a -> a -> a) -> HashMap k a -> a elem :: Eq a => a -> HashMap k a -> Bool maximum :: Ord a => HashMap k a -> a minimum :: Ord a => HashMap k a -> a | |
| Traversable (HashMap k) | |
Defined in Data.HashMap.Base | |
| ToJSONKey k => ToJSON1 (HashMap k) | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> HashMap k a -> Value Source # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [HashMap k a] -> Value Source # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> HashMap k a -> Encoding Source # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [HashMap k a] -> Encoding Source # | |
| (FromJSONKey k, Eq k, Hashable k) => FromJSON1 (HashMap k) | |
| (Eq key, Hashable key) => PolyMap (HashMap key) | |
Defined in Data.Containers Methods differenceMap :: HashMap key value1 -> HashMap key value2 -> HashMap key value1 # intersectionMap :: HashMap key value1 -> HashMap key value2 -> HashMap key value1 # intersectionWithMap :: (value1 -> value2 -> value3) -> HashMap key value1 -> HashMap key value2 -> HashMap key value3 # | |
| FoldableWithKey (HashMap k) | |
Defined in Data.Key Methods toKeyedList :: HashMap k a -> [(Key (HashMap k), a)] foldMapWithKey :: Monoid m => (Key (HashMap k) -> a -> m) -> HashMap k a -> m foldrWithKey :: (Key (HashMap k) -> a -> b -> b) -> b -> HashMap k a -> b foldlWithKey :: (b -> Key (HashMap k) -> a -> b) -> b -> HashMap k a -> b | |
| (Eq k, Hashable k) => Indexable (HashMap k) | |
| Keyed (HashMap k) | |
Defined in Data.Key Methods mapWithKey :: (Key (HashMap k) -> a -> b) -> HashMap k a -> HashMap k b | |
| (Eq k, Hashable k) => Lookup (HashMap k) | |
| TraversableWithKey (HashMap k) | |
Defined in Data.Key Methods traverseWithKey :: Applicative f => (Key (HashMap k) -> a -> f b) -> HashMap k a -> f (HashMap k b) mapWithKeyM :: Monad m => (Key (HashMap k) -> a -> m b) -> HashMap k a -> m (HashMap k b) | |
| (Eq k, Hashable k) => Zip (HashMap k) | |
| (Eq k, Hashable k) => ZipWithKey (HashMap k) | |
| Eq k => Eq1 (HashMap k) | |
| Ord k => Ord1 (HashMap k) | |
Defined in Data.HashMap.Base Methods liftCompare :: (a -> b -> Ordering) -> HashMap k a -> HashMap k b -> Ordering | |
| (Eq k, Hashable k, Read k) => Read1 (HashMap k) | |
Defined in Data.HashMap.Base Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (HashMap k a) liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [HashMap k a] liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (HashMap k a) liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [HashMap k a] | |
| Show k => Show1 (HashMap k) | |
Defined in Data.HashMap.Base Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> HashMap k a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [HashMap k a] -> ShowS | |
| Hashable k => Hashable1 (HashMap k) | |
Defined in Data.HashMap.Base | |
| (Eq k, Hashable k) => IsList (HashMap k v) | |
| (Eq k, Eq v) => Eq (HashMap k v) | |
| (Data k, Data v, Eq k, Hashable k) => Data (HashMap k v) | |
Defined in Data.HashMap.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HashMap k v -> c (HashMap k v) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HashMap k v) toConstr :: HashMap k v -> Constr dataTypeOf :: HashMap k v -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HashMap k v)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HashMap k v)) gmapT :: (forall b. Data b => b -> b) -> HashMap k v -> HashMap k v gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HashMap k v -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HashMap k v -> r gmapQ :: (forall d. Data d => d -> u) -> HashMap k v -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> HashMap k v -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> HashMap k v -> m (HashMap k v) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HashMap k v -> m (HashMap k v) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HashMap k v -> m (HashMap k v) | |
| (Ord k, Ord v) => Ord (HashMap k v) | |
Defined in Data.HashMap.Base | |
| (Eq k, Hashable k, Read k, Read e) => Read (HashMap k e) | |
Defined in Data.HashMap.Base | |
| (Show k, Show v) => Show (HashMap k v) | |
| (Eq k, Hashable k) => Semigroup (HashMap k v) | |
| (Eq k, Hashable k) => Monoid (HashMap k v) | |
| (Hashable k, Hashable v) => Hashable (HashMap k v) | |
Defined in Data.HashMap.Base | |
| (ToJSON v, ToJSONKey k) => ToJSON (HashMap k v) | |
| (FromJSON v, FromJSONKey k, Eq k, Hashable k) => FromJSON (HashMap k v) | |
| (Eq k, Hashable k) => GrowingAppend (HashMap k v) | |
Defined in Data.MonoTraversable | |
| MonoTraversable (HashMap k v) | |
| MonoFoldable (HashMap k v) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (HashMap k v) -> m) -> HashMap k v -> m # ofoldr :: (Element (HashMap k v) -> b -> b) -> b -> HashMap k v -> b # ofoldl' :: (a -> Element (HashMap k v) -> a) -> a -> HashMap k v -> a # otoList :: HashMap k v -> [Element (HashMap k v)] # oall :: (Element (HashMap k v) -> Bool) -> HashMap k v -> Bool # oany :: (Element (HashMap k v) -> Bool) -> HashMap k v -> Bool # onull :: HashMap k v -> Bool # olength :: HashMap k v -> Int # olength64 :: HashMap k v -> Int64 # ocompareLength :: Integral i => HashMap k v -> i -> Ordering # otraverse_ :: Applicative f => (Element (HashMap k v) -> f b) -> HashMap k v -> f () # ofor_ :: Applicative f => HashMap k v -> (Element (HashMap k v) -> f b) -> f () # omapM_ :: Applicative m => (Element (HashMap k v) -> m ()) -> HashMap k v -> m () # oforM_ :: Applicative m => HashMap k v -> (Element (HashMap k v) -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element (HashMap k v) -> m a) -> a -> HashMap k v -> m a # ofoldMap1Ex :: Semigroup m => (Element (HashMap k v) -> m) -> HashMap k v -> m # ofoldr1Ex :: (Element (HashMap k v) -> Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> Element (HashMap k v) # ofoldl1Ex' :: (Element (HashMap k v) -> Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> Element (HashMap k v) # headEx :: HashMap k v -> Element (HashMap k v) # lastEx :: HashMap k v -> Element (HashMap k v) # unsafeHead :: HashMap k v -> Element (HashMap k v) # unsafeLast :: HashMap k v -> Element (HashMap k v) # maximumByEx :: (Element (HashMap k v) -> Element (HashMap k v) -> Ordering) -> HashMap k v -> Element (HashMap k v) # minimumByEx :: (Element (HashMap k v) -> Element (HashMap k v) -> Ordering) -> HashMap k v -> Element (HashMap k v) # | |
| MonoFunctor (HashMap k v) | |
| (Hashable k, Eq k) => HasKeysSet (HashMap k v) | |
| (Eq key, Hashable key) => IsMap (HashMap key value) | |
Defined in Data.Containers Methods lookup :: ContainerKey (HashMap key value) -> HashMap key value -> Maybe (MapValue (HashMap key value)) # insertMap :: ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> HashMap key value # deleteMap :: ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # singletonMap :: ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value # mapFromList :: [(ContainerKey (HashMap key value), MapValue (HashMap key value))] -> HashMap key value # mapToList :: HashMap key value -> [(ContainerKey (HashMap key value), MapValue (HashMap key value))] # findWithDefault :: MapValue (HashMap key value) -> ContainerKey (HashMap key value) -> HashMap key value -> MapValue (HashMap key value) # insertWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> HashMap key value # insertWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> HashMap key value # insertLookupWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> (Maybe (MapValue (HashMap key value)), HashMap key value) # adjustMap :: (MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # adjustWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # updateMap :: (MapValue (HashMap key value) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # updateWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # updateLookupWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> (Maybe (MapValue (HashMap key value)), HashMap key value) # alterMap :: (Maybe (MapValue (HashMap key value)) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # unionWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> HashMap key value -> HashMap key value -> HashMap key value # unionWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> HashMap key value -> HashMap key value -> HashMap key value # unionsWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> [HashMap key value] -> HashMap key value # mapWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> HashMap key value -> HashMap key value # omapKeysWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> (ContainerKey (HashMap key value) -> ContainerKey (HashMap key value)) -> HashMap key value -> HashMap key value # filterMap :: (MapValue (HashMap key value) -> Bool) -> HashMap key value -> HashMap key value # | |
| (Eq key, Hashable key) => SetContainer (HashMap key value) | |
Defined in Data.Containers Associated Types type ContainerKey (HashMap key value) # Methods member :: ContainerKey (HashMap key value) -> HashMap key value -> Bool # notMember :: ContainerKey (HashMap key value) -> HashMap key value -> Bool # union :: HashMap key value -> HashMap key value -> HashMap key value # unions :: (MonoFoldable mono, Element mono ~ HashMap key value) => mono -> HashMap key value # difference :: HashMap key value -> HashMap key value -> HashMap key value # intersection :: HashMap key value -> HashMap key value -> HashMap key value # keys :: HashMap key value -> [ContainerKey (HashMap key value)] # | |
| (NFData k, NFData v) => NFData (HashMap k v) | |
Defined in Data.HashMap.Base | |
| type BPMKeyConstraint HashMap key | |
Defined in Data.Containers | |
| type Key (HashMap k) | |
| type Element (HashMap k v) | |
Defined in Data.MonoTraversable | |
| type KeySet (HashMap k v) | |
Defined in Data.Containers | |
| type MapValue (HashMap key value) | |
Defined in Data.Containers | |
| type ContainerKey (HashMap key value) | |
Defined in Data.Containers | |
| type Item (HashMap k v) | |
Defined in Data.HashMap.Base type Item (HashMap k v) = (k, v) | |
Instances
| BiPolyMap Map | |
Defined in Data.Containers Associated Types type BPMKeyConstraint Map key # Methods mapKeysWith :: (BPMKeyConstraint Map k1, BPMKeyConstraint Map k2) => (v -> v -> v) -> (k1 -> k2) -> Map k1 v -> Map k2 v # | |
| Eq2 Map | |
| Ord2 Map | |
Defined in Data.Map.Internal | |
| Show2 Map | |
Defined in Data.Map.Internal Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Map a b -> ShowS liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Map a b] -> ShowS | |
| (key ~ Text, val ~ Text) => RedirectUrl master (Route master, Map key val) | |
Defined in Yesod.Core.Handler Methods toTextUrl :: (MonadHandler m, HandlerSite m ~ master) => (Route master, Map key val) -> m Text # | |
| Functor (Map k) | |
| Foldable (Map k) | |
Defined in Data.Map.Internal Methods fold :: Monoid m => Map k m -> m foldMap :: Monoid m => (a -> m) -> Map k a -> m foldMap' :: Monoid m => (a -> m) -> Map k a -> m foldr :: (a -> b -> b) -> b -> Map k a -> b foldr' :: (a -> b -> b) -> b -> Map k a -> b foldl :: (b -> a -> b) -> b -> Map k a -> b foldl' :: (b -> a -> b) -> b -> Map k a -> b foldr1 :: (a -> a -> a) -> Map k a -> a foldl1 :: (a -> a -> a) -> Map k a -> a elem :: Eq a => a -> Map k a -> Bool maximum :: Ord a => Map k a -> a | |
| Traversable (Map k) | |
| ToJSONKey k => ToJSON1 (Map k) | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Map k a -> Value Source # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Map k a] -> Value Source # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Map k a -> Encoding Source # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Map k a] -> Encoding Source # | |
| (FromJSONKey k, Ord k) => FromJSON1 (Map k) | |
| Ord key => PolyMap (Map key) | |
Defined in Data.Containers Methods differenceMap :: Map key value1 -> Map key value2 -> Map key value1 # intersectionMap :: Map key value1 -> Map key value2 -> Map key value1 # intersectionWithMap :: (value1 -> value2 -> value3) -> Map key value1 -> Map key value2 -> Map key value3 # | |
| Ord k => Adjustable (Map k) | |
| FoldableWithKey (Map k) | |
Defined in Data.Key Methods toKeyedList :: Map k a -> [(Key (Map k), a)] foldMapWithKey :: Monoid m => (Key (Map k) -> a -> m) -> Map k a -> m foldrWithKey :: (Key (Map k) -> a -> b -> b) -> b -> Map k a -> b foldlWithKey :: (b -> Key (Map k) -> a -> b) -> b -> Map k a -> b | |
| Ord k => Indexable (Map k) | |
| Keyed (Map k) | |
Defined in Data.Key Methods mapWithKey :: (Key (Map k) -> a -> b) -> Map k a -> Map k b | |
| Ord k => Lookup (Map k) | |
| TraversableWithKey (Map k) | |
Defined in Data.Key Methods traverseWithKey :: Applicative f => (Key (Map k) -> a -> f b) -> Map k a -> f (Map k b) mapWithKeyM :: Monad m => (Key (Map k) -> a -> m b) -> Map k a -> m (Map k b) | |
| Ord k => Zip (Map k) | |
| Ord k => ZipWithKey (Map k) | |
| Eq k => Eq1 (Map k) | |
| Ord k => Ord1 (Map k) | |
Defined in Data.Map.Internal Methods liftCompare :: (a -> b -> Ordering) -> Map k a -> Map k b -> Ordering | |
| (Ord k, Read k) => Read1 (Map k) | |
Defined in Data.Map.Internal Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Map k a) liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Map k a] liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Map k a) liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Map k a] | |
| Show k => Show1 (Map k) | |
Defined in Data.Map.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Map k a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Map k a] -> ShowS | |
| Ord k => IsList (Map k v) | |
| (Eq k, Eq a) => Eq (Map k a) | |
| (Data k, Data a, Ord k) => Data (Map k a) | |
Defined in Data.Map.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Map k a -> c (Map k a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Map k a) dataTypeOf :: Map k a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Map k a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Map k a)) gmapT :: (forall b. Data b => b -> b) -> Map k a -> Map k a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r gmapQ :: (forall d. Data d => d -> u) -> Map k a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Map k a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) | |
| (Ord k, Ord v) => Ord (Map k v) | |
| (Ord k, Read k, Read e) => Read (Map k e) | |
Defined in Data.Map.Internal | |
| (Show k, Show a) => Show (Map k a) | |
| Ord k => Semigroup (Map k v) | |
| Ord k => Monoid (Map k v) | |
| (ToJSON v, ToJSONKey k) => ToJSON (Map k v) | |
| (FromJSONKey k, Ord k, FromJSON v) => FromJSON (Map k v) | |
| Ord k => GrowingAppend (Map k v) | |
Defined in Data.MonoTraversable | |
| MonoTraversable (Map k v) | |
| MonoFoldable (Map k v) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Map k v) -> m) -> Map k v -> m # ofoldr :: (Element (Map k v) -> b -> b) -> b -> Map k v -> b # ofoldl' :: (a -> Element (Map k v) -> a) -> a -> Map k v -> a # otoList :: Map k v -> [Element (Map k v)] # oall :: (Element (Map k v) -> Bool) -> Map k v -> Bool # oany :: (Element (Map k v) -> Bool) -> Map k v -> Bool # olength64 :: Map k v -> Int64 # ocompareLength :: Integral i => Map k v -> i -> Ordering # otraverse_ :: Applicative f => (Element (Map k v) -> f b) -> Map k v -> f () # ofor_ :: Applicative f => Map k v -> (Element (Map k v) -> f b) -> f () # omapM_ :: Applicative m => (Element (Map k v) -> m ()) -> Map k v -> m () # oforM_ :: Applicative m => Map k v -> (Element (Map k v) -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element (Map k v) -> m a) -> a -> Map k v -> m a # ofoldMap1Ex :: Semigroup m => (Element (Map k v) -> m) -> Map k v -> m # ofoldr1Ex :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Element (Map k v) # ofoldl1Ex' :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Element (Map k v) # headEx :: Map k v -> Element (Map k v) # lastEx :: Map k v -> Element (Map k v) # unsafeHead :: Map k v -> Element (Map k v) # unsafeLast :: Map k v -> Element (Map k v) # maximumByEx :: (Element (Map k v) -> Element (Map k v) -> Ordering) -> Map k v -> Element (Map k v) # minimumByEx :: (Element (Map k v) -> Element (Map k v) -> Ordering) -> Map k v -> Element (Map k v) # | |
| MonoFunctor (Map k v) | |
| Ord k => HasKeysSet (Map k v) | |
| Ord key => IsMap (Map key value) | |
Defined in Data.Containers Methods lookup :: ContainerKey (Map key value) -> Map key value -> Maybe (MapValue (Map key value)) # insertMap :: ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> Map key value # deleteMap :: ContainerKey (Map key value) -> Map key value -> Map key value # singletonMap :: ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value # mapFromList :: [(ContainerKey (Map key value), MapValue (Map key value))] -> Map key value # mapToList :: Map key value -> [(ContainerKey (Map key value), MapValue (Map key value))] # findWithDefault :: MapValue (Map key value) -> ContainerKey (Map key value) -> Map key value -> MapValue (Map key value) # insertWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> Map key value # insertWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> Map key value # insertLookupWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> (Maybe (MapValue (Map key value)), Map key value) # adjustMap :: (MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> Map key value -> Map key value # adjustWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> Map key value -> Map key value # updateMap :: (MapValue (Map key value) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> Map key value # updateWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> Map key value # updateLookupWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> (Maybe (MapValue (Map key value)), Map key value) # alterMap :: (Maybe (MapValue (Map key value)) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> Map key value # unionWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> Map key value -> Map key value -> Map key value # unionWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> Map key value -> Map key value -> Map key value # unionsWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> [Map key value] -> Map key value # mapWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> Map key value -> Map key value # omapKeysWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> (ContainerKey (Map key value) -> ContainerKey (Map key value)) -> Map key value -> Map key value # filterMap :: (MapValue (Map key value) -> Bool) -> Map key value -> Map key value # | |
| Ord k => SetContainer (Map k v) | |
Defined in Data.Containers Associated Types type ContainerKey (Map k v) # Methods member :: ContainerKey (Map k v) -> Map k v -> Bool # notMember :: ContainerKey (Map k v) -> Map k v -> Bool # union :: Map k v -> Map k v -> Map k v # unions :: (MonoFoldable mono, Element mono ~ Map k v) => mono -> Map k v # difference :: Map k v -> Map k v -> Map k v # intersection :: Map k v -> Map k v -> Map k v # keys :: Map k v -> [ContainerKey (Map k v)] # | |
| (NFData k, NFData a) => NFData (Map k a) | |
Defined in Data.Map.Internal | |
| PersistField v => PersistField (Map Text v) | |
Defined in Database.Persist.Class.PersistField Methods toPersistValue :: Map Text v -> PersistValue Source # fromPersistValue :: PersistValue -> Either Text (Map Text v) Source # | |
| type BPMKeyConstraint Map key | |
Defined in Data.Containers | |
| type Key (Map k) | |
| type Element (Map k v) | |
Defined in Data.MonoTraversable | |
| type KeySet (Map k v) | |
Defined in Data.Containers | |
| type MapValue (Map key value) | |
Defined in Data.Containers | |
| type ContainerKey (Map k v) | |
Defined in Data.Containers | |
| type Item (Map k v) | |
Defined in Data.Map.Internal type Item (Map k v) = (k, v) | |
A type that can be converted to JSON.
Instances in general must specify toJSON and should (but don't need
to) specify toEncoding.
An example type and instance:
-- Allow ourselves to writeTextliterals. {-# LANGUAGE OverloadedStrings #-} data Coord = Coord { x :: Double, y :: Double } instanceToJSONCoord wheretoJSON(Coord x y) =object["x".=x, "y".=y]toEncoding(Coord x y) =pairs("x".=x<>"y".=y)
Instead of manually writing your ToJSON instance, there are two options
to do it automatically:
- Data.Aeson.TH provides Template Haskell functions which will derive an instance at compile time. The generated instance is optimized for your type so it will probably be more efficient than the following option.
- The compiler can provide a default generic implementation for
toJSON.
To use the second, simply add a deriving clause to your
datatype and declare a GenericToJSON instance. If you require nothing other than
defaultOptions, it is sufficient to write (and this is the only
alternative where the default toJSON implementation is sufficient):
{-# LANGUAGE DeriveGeneric #-}
import GHC.Generics
data Coord = Coord { x :: Double, y :: Double } deriving Generic
instance ToJSON Coord where
toEncoding = genericToEncoding defaultOptions
If on the other hand you wish to customize the generic decoding, you have to implement both methods:
customOptions =defaultOptions{fieldLabelModifier=maptoUpper} instanceToJSONCoord wheretoJSON=genericToJSONcustomOptionstoEncoding=genericToEncodingcustomOptions
Previous versions of this library only had the toJSON method. Adding
toEncoding had two reasons:
- toEncoding is more efficient for the common case that the output of
toJSONis directly serialized to aByteString. Further, expressing either method in terms of the other would be non-optimal. - The choice of defaults allows a smooth transition for existing users:
Existing instances that do not define
toEncodingstill compile and have the correct semantics. This is ensured by making the default implementation oftoEncodingusetoJSON. This produces correct results, but since it performs an intermediate conversion to aValue, it will be less efficient than directly emitting anEncoding. (this also means that specifying nothing more thaninstance ToJSON Coordwould be sufficient as a generically decoding instance, but there probably exists no good reason to not specifytoEncodingin new instances.)
Minimal complete definition
Nothing
Methods
Convert a Haskell value to a JSON-friendly intermediate type.
toEncoding :: a -> Encoding Source #
Encode a Haskell value as JSON.
The default implementation of this method creates an
intermediate Value using toJSON. This provides
source-level compatibility for people upgrading from older
versions of this library, but obviously offers no performance
advantage.
To benefit from direct encoding, you must provide an
implementation for this method. The easiest way to do so is by
having your types implement Generic using the DeriveGeneric
extension, and then have GHC generate a method body as follows.
instanceToJSONCoord wheretoEncoding=genericToEncodingdefaultOptions
toJSONList :: [a] -> Value Source #
toEncodingList :: [a] -> Encoding Source #
Instances
(.:) :: FromJSON a => Object -> Text -> Parser a Source #
Retrieve the value associated with the given key of an Object.
The result is empty if the key is not present or the value cannot
be converted to the desired type.
This accessor is appropriate if the key and value must be present
in an object for it to be valid. If the key and value are
optional, use .:? instead.
class FromJSON a where Source #
A type that can be converted from JSON, with the possibility of failure.
In many cases, you can get the compiler to generate parsing code for you (see below). To begin, let's cover writing an instance by hand.
There are various reasons a conversion could fail. For example, an
Object could be missing a required key, an Array could be of
the wrong size, or a value could be of an incompatible type.
The basic ways to signal a failed conversion are as follows:
failyields a custom error message: it is the recommended way of reporting a failure;empty(ormzero) is uninformative: use it when the error is meant to be caught by some(;<|>)typeMismatchcan be used to report a failure when the encountered value is not of the expected JSON type;unexpectedis an appropriate alternative when more than one type may be expected, or to keep the expected type implicit.
prependFailure (or modifyFailure) add more information to a parser's
error messages.
An example type and instance using typeMismatch and prependFailure:
-- Allow ourselves to writeTextliterals. {-# LANGUAGE OverloadedStrings #-} data Coord = Coord { x :: Double, y :: Double } instanceFromJSONCoord whereparseJSON(Objectv) = Coord<$>v.:"x"<*>v.:"y" -- We do not expect a non-Objectvalue here. -- We could useemptyto fail, buttypeMismatch-- gives a much more informative error message.parseJSONinvalid =prependFailure"parsing Coord failed, " (typeMismatch"Object" invalid)
For this common case of only being concerned with a single
type of JSON value, the functions withObject, withScientific, etc.
are provided. Their use is to be preferred when possible, since
they are more terse. Using withObject, we can rewrite the above instance
(assuming the same language extension and data type) as:
instanceFromJSONCoord whereparseJSON=withObject"Coord" $ \v -> Coord<$>v.:"x"<*>v.:"y"
Instead of manually writing your FromJSON instance, there are two options
to do it automatically:
- Data.Aeson.TH provides Template Haskell functions which will derive an instance at compile time. The generated instance is optimized for your type so it will probably be more efficient than the following option.
- The compiler can provide a default generic implementation for
parseJSON.
To use the second, simply add a deriving clause to your
datatype and declare a GenericFromJSON instance for your datatype without giving
a definition for parseJSON.
For example, the previous example can be simplified to just:
{-# LANGUAGE DeriveGeneric #-}
import GHC.Generics
data Coord = Coord { x :: Double, y :: Double } deriving Generic
instance FromJSON Coord
The default implementation will be equivalent to
parseJSON = ; if you need different
options, you can customize the generic decoding by defining:genericParseJSON defaultOptions
customOptions =defaultOptions{fieldLabelModifier=maptoUpper} instanceFromJSONCoord whereparseJSON=genericParseJSONcustomOptions
Minimal complete definition
Nothing
Instances
| FromJSON Bool | |
| FromJSON Char | |
| FromJSON Double | |
| FromJSON Float | |
| FromJSON Int | |
| FromJSON Int8 | |
| FromJSON Int16 | |
| FromJSON Int32 | |
| FromJSON Int64 | |
| FromJSON Integer | This instance includes a bounds check to prevent maliciously
large inputs to fill up the memory of the target system. You can
newtype |
| FromJSON Natural | |
| FromJSON Ordering | |
| FromJSON Word | |
| FromJSON Word8 | |
| FromJSON Word16 | |
| FromJSON Word32 | |
| FromJSON Word64 | |
| FromJSON () | |
| FromJSON Scientific | |
| FromJSON Text | |
| FromJSON UTCTime | |
| FromJSON Value | |
| FromJSON DotNetTime | |
Defined in Data.Aeson.Types.FromJSON Methods parseJSON :: Value -> Parser DotNetTime Source # parseJSONList :: Value -> Parser [DotNetTime] Source # | |
| FromJSON Day | |
| FromJSON IntSet | |
| FromJSON Void | |
| FromJSON PersistValue | |
Defined in Database.Persist.Types.Base Methods parseJSON :: Value -> Parser PersistValue Source # parseJSONList :: Value -> Parser [PersistValue] Source # | |
| FromJSON Textarea | |
| FromJSON Text | |
| FromJSON CTime | |
| FromJSON DiffTime | This instance includes a bounds check to prevent maliciously
large inputs to fill up the memory of the target system. You can
newtype |
| FromJSON SystemTime | |
| FromJSON CalendarDiffDays | |
| FromJSON CalendarDiffTime | |
| FromJSON DayOfWeek | |
| FromJSON LocalTime | |
| FromJSON NominalDiffTime | This instance includes a bounds check to prevent maliciously
large inputs to fill up the memory of the target system. You can
newtype |
| FromJSON TimeOfDay | |
| FromJSON ZonedTime | Supported string formats:
The first space may instead be a |
| FromJSON Version | |
| FromJSON UUID | |
| FromJSON a => FromJSON [a] | |
| FromJSON a => FromJSON (Maybe a) | |
| (FromJSON a, Integral a) => FromJSON (Ratio a) | |
| FromJSON a => FromJSON (WrappedMonoid a) | |
Defined in Data.Aeson.Types.FromJSON Methods parseJSON :: Value -> Parser (WrappedMonoid a) Source # parseJSONList :: Value -> Parser [WrappedMonoid a] Source # | |
| FromJSON a => FromJSON (Identity a) | |
| FromJSON a => FromJSON (DList a) | |
| (Eq a, Hashable a, FromJSON a) => FromJSON (HashSet a) | |
| FromJSON a => FromJSON (Vector a) | |
| (Ord a, FromJSON a) => FromJSON (Set a) | |
| FromJSON a => FromJSON (IntMap a) | |
| FromJSON a => FromJSON (Seq a) | |
| FromJSON a => FromJSON (NonEmpty a) | |
| FromJSON v => FromJSON (Tree v) | |
| FromJSON a => FromJSON (Option a) | |
| (Prim a, FromJSON a) => FromJSON (Vector a) | |
| (Storable a, FromJSON a) => FromJSON (Vector a) | |
| (Vector Vector a, FromJSON a) => FromJSON (Vector a) | |
| FromJSON a => FromJSON (Dual a) | |
| FromJSON a => FromJSON (First a) | |
| FromJSON a => FromJSON (Array a) | |
| (Prim a, FromJSON a) => FromJSON (PrimArray a) | |
| FromJSON a => FromJSON (SmallArray a) | |
| FromJSON a => FromJSON (First a) | |
| FromJSON a => FromJSON (Last a) | |
| FromJSON a => FromJSON (Max a) | |
| FromJSON a => FromJSON (Min a) | |
| FromJSON a => FromJSON (Last a) | |
| HasResolution a => FromJSON (Fixed a) | This instance includes a bounds check to prevent maliciously
large inputs to fill up the memory of the target system. You can
newtype |
| (FromJSON a, FromJSON b) => FromJSON (Either a b) | |
| (FromJSON a, FromJSON b) => FromJSON (a, b) | |
| (FromJSON v, FromJSONKey k, Eq k, Hashable k) => FromJSON (HashMap k v) | |
| (FromJSONKey k, Ord k, FromJSON v) => FromJSON (Map k v) | |
| FromJSON (Proxy a) | |
| (FromJSON a, FromJSON b, FromJSON c) => FromJSON (a, b, c) | |
| FromJSON a => FromJSON (Const a b) | |
| FromJSON b => FromJSON (Tagged a b) | |
| (FromJSON a, FromJSON b, FromJSON c, FromJSON d) => FromJSON (a, b, c, d) | |
| (FromJSON1 f, FromJSON1 g, FromJSON a) => FromJSON (Product f g a) | |
| (FromJSON1 f, FromJSON1 g, FromJSON a) => FromJSON (Sum f g a) | |
| (FromJSON a, FromJSON b, FromJSON c, FromJSON d, FromJSON e) => FromJSON (a, b, c, d, e) | |
| (FromJSON1 f, FromJSON1 g, FromJSON a) => FromJSON (Compose f g a) | |
| (FromJSON a, FromJSON b, FromJSON c, FromJSON d, FromJSON e, FromJSON f) => FromJSON (a, b, c, d, e, f) | |
| (FromJSON a, FromJSON b, FromJSON c, FromJSON d, FromJSON e, FromJSON f, FromJSON g) => FromJSON (a, b, c, d, e, f, g) | |
| (FromJSON a, FromJSON b, FromJSON c, FromJSON d, FromJSON e, FromJSON f, FromJSON g, FromJSON h) => FromJSON (a, b, c, d, e, f, g, h) | |
| (FromJSON a, FromJSON b, FromJSON c, FromJSON d, FromJSON e, FromJSON f, FromJSON g, FromJSON h, FromJSON i) => FromJSON (a, b, c, d, e, f, g, h, i) | |
| (FromJSON a, FromJSON b, FromJSON c, FromJSON d, FromJSON e, FromJSON f, FromJSON g, FromJSON h, FromJSON i, FromJSON j) => FromJSON (a, b, c, d, e, f, g, h, i, j) | |
| (FromJSON a, FromJSON b, FromJSON c, FromJSON d, FromJSON e, FromJSON f, FromJSON g, FromJSON h, FromJSON i, FromJSON j, FromJSON k) => FromJSON (a, b, c, d, e, f, g, h, i, j, k) | |
| (FromJSON a, FromJSON b, FromJSON c, FromJSON d, FromJSON e, FromJSON f, FromJSON g, FromJSON h, FromJSON i, FromJSON j, FromJSON k, FromJSON l) => FromJSON (a, b, c, d, e, f, g, h, i, j, k, l) | |
| (FromJSON a, FromJSON b, FromJSON c, FromJSON d, FromJSON e, FromJSON f, FromJSON g, FromJSON h, FromJSON i, FromJSON j, FromJSON k, FromJSON l, FromJSON m) => FromJSON (a, b, c, d, e, f, g, h, i, j, k, l, m) | |
| (FromJSON a, FromJSON b, FromJSON c, FromJSON d, FromJSON e, FromJSON f, FromJSON g, FromJSON h, FromJSON i, FromJSON j, FromJSON k, FromJSON l, FromJSON m, FromJSON n) => FromJSON (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | |
| (FromJSON a, FromJSON b, FromJSON c, FromJSON d, FromJSON e, FromJSON f, FromJSON g, FromJSON h, FromJSON i, FromJSON j, FromJSON k, FromJSON l, FromJSON m, FromJSON n, FromJSON o) => FromJSON (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | |
A JSON value represented as a Haskell value.
Instances
| Eq Value | |
| Data Value | |
Defined in Data.Aeson.Types.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Value -> c Value gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Value dataTypeOf :: Value -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Value) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Value) gmapT :: (forall b. Data b => b -> b) -> Value -> Value gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Value -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Value -> r gmapQ :: (forall d. Data d => d -> u) -> Value -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Value -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Value -> m Value gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Value -> m Value gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Value -> m Value | |
| Read Value | |
Defined in Data.Aeson.Types.Internal | |
| Show Value | |
| IsString Value | |
Defined in Data.Aeson.Types.Internal Methods fromString :: String -> Value # | |
| Generic Value | |
| Lift Value | |
Defined in Data.Aeson.Types.Internal | |
| Hashable Value | |
Defined in Data.Aeson.Types.Internal | |
| ToJSON Value | |
| KeyValue Object | Constructs a singleton |
| KeyValue Pair | |
| FromJSON Value | |
| NFData Value | |
Defined in Data.Aeson.Types.Internal | |
| ToTypedContent Encoding | |
Defined in Yesod.Core.Content Methods toTypedContent :: Encoding -> TypedContent # | |
| ToTypedContent Value | |
Defined in Yesod.Core.Content Methods toTypedContent :: Value -> TypedContent # | |
| HasContentType Encoding | |
Defined in Yesod.Core.Content Methods getContentType :: Monad m => m Encoding -> ContentType # | |
| HasContentType Value | |
Defined in Yesod.Core.Content Methods getContentType :: Monad m => m Value -> ContentType # | |
| ToContent Encoding | |
Defined in Yesod.Core.Content | |
| ToContent Value | |
Defined in Yesod.Core.Content | |
| FromString Encoding | |
Defined in Data.Aeson.Types.ToJSON Methods fromString :: String -> Encoding | |
| FromString Value | |
Defined in Data.Aeson.Types.ToJSON Methods fromString :: String -> Value | |
| ToJavascript Value | |
Defined in Text.Julius Methods toJavascript :: Value -> Javascript | |
| GToJSON Encoding arity (U1 :: Type -> Type) | |
| GToJSON Value arity (V1 :: Type -> Type) | |
| GToJSON Value arity (U1 :: Type -> Type) | |
| ToJSON1 f => GToJSON Encoding One (Rec1 f) | |
| ToJSON1 f => GToJSON Value One (Rec1 f) | |
| ToJSON a => GToJSON Encoding arity (K1 i a :: Type -> Type) | |
| (EncodeProduct arity a, EncodeProduct arity b) => GToJSON Encoding arity (a :*: b) | |
| ToJSON a => GToJSON Value arity (K1 i a :: Type -> Type) | |
| (WriteProduct arity a, WriteProduct arity b, ProductSize a, ProductSize b) => GToJSON Value arity (a :*: b) | |
| (ToJSON1 f, GToJSON Encoding One g) => GToJSON Encoding One (f :.: g) | |
| (ToJSON1 f, GToJSON Value One g) => GToJSON Value One (f :.: g) | |
| FromPairs Value (DList Pair) | |
Defined in Data.Aeson.Types.ToJSON | |
| v ~ Value => KeyValuePair v (DList Pair) | |
Defined in Data.Aeson.Types.ToJSON | |
| (GToJSON Encoding arity a, ConsToJSON Encoding arity a, Constructor c) => SumToJSON' TwoElemArray Encoding arity (C1 c a) | |
Defined in Data.Aeson.Types.ToJSON Methods sumToJSON' :: Options -> ToArgs Encoding arity a0 -> C1 c a a0 -> Tagged TwoElemArray Encoding | |
| (GToJSON Value arity a, ConsToJSON Value arity a, Constructor c) => SumToJSON' TwoElemArray Value arity (C1 c a) | |
Defined in Data.Aeson.Types.ToJSON Methods sumToJSON' :: Options -> ToArgs Value arity a0 -> C1 c a a0 -> Tagged TwoElemArray Value | |
| type Rep Value | |
Defined in Data.Aeson.Types.Internal type Rep Value = D1 ('MetaData "Value" "Data.Aeson.Types.Internal" "aeson-1.4.7.1-4nEbPfB99jL2Y9NC3JxDd6" 'False) ((C1 ('MetaCons "Object" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Object)) :+: (C1 ('MetaCons "Array" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Array)) :+: C1 ('MetaCons "String" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Text)))) :+: (C1 ('MetaCons "Number" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Scientific)) :+: (C1 ('MetaCons "Bool" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Bool)) :+: C1 ('MetaCons "Null" 'PrefixI 'False) (U1 :: Type -> Type)))) | |
data SomeAsyncException #
Constructors
| Exception e => SomeAsyncException e |
Instances
| Show SomeAsyncException | |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> SomeAsyncException -> ShowS # show :: SomeAsyncException -> String # showList :: [SomeAsyncException] -> ShowS # | |
| Exception SomeAsyncException | |
Defined in GHC.IO.Exception Methods toException :: SomeAsyncException -> SomeException # fromException :: SomeException -> Maybe SomeAsyncException # | |
getChanContents :: MonadIO m => Chan a -> m [a] #
writeList2Chan :: MonadIO m => Chan a -> [a] -> m () #
Instances
| Monad STM | |
| Functor STM | |
| Applicative STM | |
| Alternative STM | |
| MonadPlus STM | |
| MonadThrow STM | |
Defined in Control.Monad.Catch | |
| MonadCatch STM | |
| MonadBaseControl STM STM | |
Defined in Control.Monad.Trans.Control Associated Types type StM STM a | |
| type StM STM a | |
Defined in Control.Monad.Trans.Control type StM STM a = a | |
data StringException #
Constructors
| StringException String CallStack |
Instances
| Show StringException | |
Defined in UnliftIO.Exception Methods showsPrec :: Int -> StringException -> ShowS # show :: StringException -> String # showList :: [StringException] -> ShowS # | |
| Exception StringException | |
Defined in UnliftIO.Exception Methods toException :: StringException -> SomeException # | |
data AsyncExceptionWrapper #
Constructors
| Exception e => AsyncExceptionWrapper e |
Instances
| Show AsyncExceptionWrapper | |
Defined in UnliftIO.Exception Methods showsPrec :: Int -> AsyncExceptionWrapper -> ShowS # show :: AsyncExceptionWrapper -> String # showList :: [AsyncExceptionWrapper] -> ShowS # | |
| Exception AsyncExceptionWrapper | |
Defined in UnliftIO.Exception | |
data SyncExceptionWrapper #
Constructors
| Exception e => SyncExceptionWrapper e |
Instances
| Show SyncExceptionWrapper | |
Defined in UnliftIO.Exception Methods showsPrec :: Int -> SyncExceptionWrapper -> ShowS # show :: SyncExceptionWrapper -> String # showList :: [SyncExceptionWrapper] -> ShowS # | |
| Exception SyncExceptionWrapper | |
Defined in UnliftIO.Exception Methods toException :: SyncExceptionWrapper -> SomeException # fromException :: SomeException -> Maybe SyncExceptionWrapper # | |
catch :: (MonadUnliftIO m, Exception e) => m a -> (e -> m a) -> m a #
catchIO :: MonadUnliftIO m => m a -> (IOException -> m a) -> m a #
catchAny :: MonadUnliftIO m => m a -> (SomeException -> m a) -> m a #
catchDeep :: (MonadUnliftIO m, Exception e, NFData a) => m a -> (e -> m a) -> m a #
catchAnyDeep :: (NFData a, MonadUnliftIO m) => m a -> (SomeException -> m a) -> m a #
catchJust :: (MonadUnliftIO m, Exception e) => (e -> Maybe b) -> m a -> (b -> m a) -> m a #
handle :: (MonadUnliftIO m, Exception e) => (e -> m a) -> m a -> m a #
handleIO :: MonadUnliftIO m => (IOException -> m a) -> m a -> m a #
handleAny :: MonadUnliftIO m => (SomeException -> m a) -> m a -> m a #
handleDeep :: (MonadUnliftIO m, Exception e, NFData a) => (e -> m a) -> m a -> m a #
handleAnyDeep :: (MonadUnliftIO m, NFData a) => (SomeException -> m a) -> m a -> m a #
handleJust :: (MonadUnliftIO m, Exception e) => (e -> Maybe b) -> (b -> m a) -> m a -> m a #
try :: (MonadUnliftIO m, Exception e) => m a -> m (Either e a) #
tryIO :: MonadUnliftIO m => m a -> m (Either IOException a) #
tryAny :: MonadUnliftIO m => m a -> m (Either SomeException a) #
tryAnyDeep :: (MonadUnliftIO m, NFData a) => m a -> m (Either SomeException a) #
pureTry :: a -> Either SomeException a #
pureTryDeep :: NFData a => a -> Either SomeException a #
catches :: MonadUnliftIO m => m a -> [Handler m a] -> m a #
catchesDeep :: (MonadUnliftIO m, NFData a) => m a -> [Handler m a] -> m a #
evaluateDeep :: (MonadIO m, NFData a) => a -> m a #
bracket :: MonadUnliftIO m => m a -> (a -> m b) -> (a -> m c) -> m c #
bracket_ :: MonadUnliftIO m => m a -> m b -> m c -> m c #
bracketOnError :: MonadUnliftIO m => m a -> (a -> m b) -> (a -> m c) -> m c #
bracketOnError_ :: MonadUnliftIO m => m a -> m b -> m c -> m c #
finally :: MonadUnliftIO m => m a -> m b -> m a #
withException :: (MonadUnliftIO m, Exception e) => m a -> (e -> m b) -> m a #
onException :: MonadUnliftIO m => m a -> m b -> m a #
toSyncException :: Exception e => e -> SomeException #
toAsyncException :: Exception e => e -> SomeException #
isSyncException :: Exception e => e -> Bool #
isAsyncException :: Exception e => e -> Bool #
mask :: MonadUnliftIO m => ((forall a. m a -> m a) -> m b) -> m b #
uninterruptibleMask :: MonadUnliftIO m => ((forall a. m a -> m a) -> m b) -> m b #
mask_ :: MonadUnliftIO m => m a -> m a #
uninterruptibleMask_ :: MonadUnliftIO m => m a -> m a #
throwString :: (MonadIO m, HasCallStack) => String -> m a #
stringException :: HasCallStack => String -> StringException #
impureThrow :: Exception e => e -> a #
fromEither :: (Exception e, MonadIO m) => Either e a -> m a #
fromEitherM :: (Exception e, MonadIO m) => m (Either e a) -> m a #
data BufferMode #
Constructors
| NoBuffering | |
| LineBuffering | |
| BlockBuffering (Maybe Int) |
Instances
| Eq BufferMode | |
Defined in GHC.IO.Handle.Types | |
| Ord BufferMode | |
Defined in GHC.IO.Handle.Types Methods compare :: BufferMode -> BufferMode -> Ordering # (<) :: BufferMode -> BufferMode -> Bool # (<=) :: BufferMode -> BufferMode -> Bool # (>) :: BufferMode -> BufferMode -> Bool # (>=) :: BufferMode -> BufferMode -> Bool # max :: BufferMode -> BufferMode -> BufferMode # min :: BufferMode -> BufferMode -> BufferMode # | |
| Read BufferMode | |
Defined in GHC.IO.Handle.Types Methods readsPrec :: Int -> ReadS BufferMode readList :: ReadS [BufferMode] readPrec :: ReadPrec BufferMode readListPrec :: ReadPrec [BufferMode] | |
| Show BufferMode | |
Defined in GHC.IO.Handle.Types Methods showsPrec :: Int -> BufferMode -> ShowS # show :: BufferMode -> String # showList :: [BufferMode] -> ShowS # | |
Instances
| Enum SeekMode | |
| Eq SeekMode | |
| Ord SeekMode | |
Defined in GHC.IO.Device | |
| Read SeekMode | |
Defined in GHC.IO.Device | |
| Show SeekMode | |
| Ix SeekMode | |
Defined in GHC.IO.Device | |
Constructors
| ReadMode | |
| WriteMode | |
| AppendMode | |
| ReadWriteMode |
withBinaryFile :: MonadUnliftIO m => FilePath -> IOMode -> (Handle -> m a) -> m a #
hSetFileSize :: MonadIO m => Handle -> Integer -> m () #
hSetBuffering :: MonadIO m => Handle -> BufferMode -> m () #
hGetBuffering :: MonadIO m => Handle -> m BufferMode #
hIsReadable :: MonadIO m => Handle -> m Bool #
hIsWritable :: MonadIO m => Handle -> m Bool #
hIsSeekable :: MonadIO m => Handle -> m Bool #
hIsTerminalDevice :: MonadIO m => Handle -> m Bool #
getMonotonicTime :: MonadIO m => m Double #
writeIORef :: MonadIO m => IORef a -> a -> m () #
modifyIORef :: MonadIO m => IORef a -> (a -> a) -> m () #
modifyIORef' :: MonadIO m => IORef a -> (a -> a) -> m () #
atomicModifyIORef :: MonadIO m => IORef a -> (a -> (a, b)) -> m b #
atomicModifyIORef' :: MonadIO m => IORef a -> (a -> (a, b)) -> m b #
atomicWriteIORef :: MonadIO m => IORef a -> a -> m () #
mkWeakIORef :: MonadUnliftIO m => IORef a -> m () -> m (Weak (IORef a)) #
isEmptyTBQueue :: TBQueue a -> STM Bool #
isFullTBQueue :: TBQueue a -> STM Bool #
newTBQueue :: Natural -> STM (TBQueue a) #
peekTBQueue :: TBQueue a -> STM a #
readTBQueue :: TBQueue a -> STM a #
tryPeekTBQueue :: TBQueue a -> STM (Maybe a) #
tryReadTBQueue :: TBQueue a -> STM (Maybe a) #
unGetTBQueue :: TBQueue a -> a -> STM () #
writeTBQueue :: TBQueue a -> a -> STM () #
cloneTChan :: TChan a -> STM (TChan a) #
isEmptyTChan :: TChan a -> STM Bool #
tryPeekTChan :: TChan a -> STM (Maybe a) #
tryReadTChan :: TChan a -> STM (Maybe a) #
unGetTChan :: TChan a -> a -> STM () #
writeTChan :: TChan a -> a -> STM () #
isEmptyTMVar :: TMVar a -> STM Bool #
newEmptyTMVar :: STM (TMVar a) #
tryPutTMVar :: TMVar a -> a -> STM Bool #
tryReadTMVar :: TMVar a -> STM (Maybe a) #
tryTakeTMVar :: TMVar a -> STM (Maybe a) #
isEmptyTQueue :: TQueue a -> STM Bool #
peekTQueue :: TQueue a -> STM a #
readTQueue :: TQueue a -> STM a #
tryPeekTQueue :: TQueue a -> STM (Maybe a) #
tryReadTQueue :: TQueue a -> STM (Maybe a) #
unGetTQueue :: TQueue a -> a -> STM () #
writeTQueue :: TQueue a -> a -> STM () #
modifyTVar :: TVar a -> (a -> a) -> STM () #
modifyTVar' :: TVar a -> (a -> a) -> STM () #
data ConcException #
Constructors
| EmptyWithNoAlternative |
Instances
data Conc (m :: Type -> Type) a #
Instances
| Functor m => Functor (Conc m) | |
| MonadUnliftIO m => Applicative (Conc m) | |
| MonadUnliftIO m => Alternative (Conc m) | |
| (MonadUnliftIO m, Semigroup a) => Semigroup (Conc m a) | |
| (Monoid a, MonadUnliftIO m) => Monoid (Conc m a) | |
newtype Concurrently (m :: Type -> Type) a #
Constructors
| Concurrently | |
Fields
| |
Instances
async :: MonadUnliftIO m => m a -> m (Async a) #
asyncBound :: MonadUnliftIO m => m a -> m (Async a) #
asyncOn :: MonadUnliftIO m => Int -> m a -> m (Async a) #
asyncWithUnmask :: MonadUnliftIO m => ((forall b. m b -> m b) -> m a) -> m (Async a) #
asyncOnWithUnmask :: MonadUnliftIO m => Int -> ((forall b. m b -> m b) -> m a) -> m (Async a) #
withAsync :: MonadUnliftIO m => m a -> (Async a -> m b) -> m b #
withAsyncBound :: MonadUnliftIO m => m a -> (Async a -> m b) -> m b #
withAsyncOn :: MonadUnliftIO m => Int -> m a -> (Async a -> m b) -> m b #
withAsyncWithUnmask :: MonadUnliftIO m => ((forall c. m c -> m c) -> m a) -> (Async a -> m b) -> m b #
withAsyncOnWithUnmask :: MonadUnliftIO m => Int -> ((forall c. m c -> m c) -> m a) -> (Async a -> m b) -> m b #
uninterruptibleCancel :: MonadIO m => Async a -> m () #
cancelWith :: (Exception e, MonadIO m) => Async a -> e -> m () #
waitAnyCatch :: MonadIO m => [Async a] -> m (Async a, Either SomeException a) #
waitAnyCancel :: MonadIO m => [Async a] -> m (Async a, a) #
waitAnyCatchCancel :: MonadIO m => [Async a] -> m (Async a, Either SomeException a) #
waitEitherCatch :: MonadIO m => Async a -> Async b -> m (Either (Either SomeException a) (Either SomeException b)) #
waitEitherCatchCancel :: MonadIO m => Async a -> Async b -> m (Either (Either SomeException a) (Either SomeException b)) #
waitEither_ :: MonadIO m => Async a -> Async b -> m () #
race :: MonadUnliftIO m => m a -> m b -> m (Either a b) #
race_ :: MonadUnliftIO m => m a -> m b -> m () #
concurrently :: MonadUnliftIO m => m a -> m b -> m (a, b) #
concurrently_ :: MonadUnliftIO m => m a -> m b -> m () #
forConcurrently :: (MonadUnliftIO m, Traversable t) => t a -> (a -> m b) -> m (t b) #
forConcurrently_ :: (MonadUnliftIO m, Foldable f) => f a -> (a -> m b) -> m () #
replicateConcurrently :: MonadUnliftIO m => Int -> m b -> m [b] #
replicateConcurrently_ :: (Applicative m, MonadUnliftIO m) => Int -> m a -> m () #
mapConcurrently :: (MonadUnliftIO m, Traversable t) => (a -> m b) -> t a -> m (t b) #
mapConcurrently_ :: (MonadUnliftIO m, Foldable f) => (a -> m b) -> f a -> m () #
runConc :: MonadUnliftIO m => Conc m a -> m a #
pooledMapConcurrentlyN :: (MonadUnliftIO m, Traversable t) => Int -> (a -> m b) -> t a -> m (t b) #
pooledMapConcurrently :: (MonadUnliftIO m, Traversable t) => (a -> m b) -> t a -> m (t b) #
pooledForConcurrentlyN :: (MonadUnliftIO m, Traversable t) => Int -> t a -> (a -> m b) -> m (t b) #
pooledForConcurrently :: (MonadUnliftIO m, Traversable t) => t a -> (a -> m b) -> m (t b) #
pooledMapConcurrentlyN_ :: (MonadUnliftIO m, Foldable f) => Int -> (a -> m b) -> f a -> m () #
pooledMapConcurrently_ :: (MonadUnliftIO m, Foldable f) => (a -> m b) -> f a -> m () #
pooledForConcurrently_ :: (MonadUnliftIO m, Foldable f) => f a -> (a -> m b) -> m () #
pooledForConcurrentlyN_ :: (MonadUnliftIO m, Foldable t) => Int -> t a -> (a -> m b) -> m () #
pooledReplicateConcurrentlyN :: MonadUnliftIO m => Int -> Int -> m a -> m [a] #
pooledReplicateConcurrently :: MonadUnliftIO m => Int -> m a -> m [a] #
pooledReplicateConcurrentlyN_ :: MonadUnliftIO m => Int -> Int -> m a -> m () #
pooledReplicateConcurrently_ :: MonadUnliftIO m => Int -> m a -> m () #
newEmptyMVar :: MonadIO m => m (MVar a) #
tryTakeMVar :: MonadIO m => MVar a -> m (Maybe a) #
tryPutMVar :: MonadIO m => MVar a -> a -> m Bool #
isEmptyMVar :: MonadIO m => MVar a -> m Bool #
tryReadMVar :: MonadIO m => MVar a -> m (Maybe a) #
withMVar :: MonadUnliftIO m => MVar a -> (a -> m b) -> m b #
withMVarMasked :: MonadUnliftIO m => MVar a -> (a -> m b) -> m b #
modifyMVar_ :: MonadUnliftIO m => MVar a -> (a -> m a) -> m () #
modifyMVar :: MonadUnliftIO m => MVar a -> (a -> m (a, b)) -> m b #
modifyMVarMasked_ :: MonadUnliftIO m => MVar a -> (a -> m a) -> m () #
modifyMVarMasked :: MonadUnliftIO m => MVar a -> (a -> m (a, b)) -> m b #
mkWeakMVar :: MonadUnliftIO m => MVar a -> m () -> m (Weak (MVar a)) #
runMemoized :: MonadIO m => Memoized a -> m a #
memoizeRef :: MonadUnliftIO m => m a -> m (Memoized a) #
memoizeMVar :: MonadUnliftIO m => m a -> m (Memoized a) #
atomically :: MonadIO m => STM a -> m a #
readTVarIO :: MonadIO m => TVar a -> m a #
mkWeakTVar :: MonadUnliftIO m => TVar a -> m () -> m (Weak (TVar a)) #
newTMVarIO :: MonadIO m => a -> m (TMVar a) #
newEmptyTMVarIO :: MonadIO m => m (TMVar a) #
mkWeakTMVar :: MonadUnliftIO m => TMVar a -> m () -> m (Weak (TMVar a)) #
newTChanIO :: MonadIO m => m (TChan a) #
newBroadcastTChanIO :: MonadIO m => m (TChan a) #
newTQueueIO :: MonadIO m => m (TQueue a) #
newTBQueueIO :: MonadIO m => Natural -> m (TBQueue a) #
withSystemTempFile :: MonadUnliftIO m => String -> (FilePath -> Handle -> m a) -> m a #
withSystemTempDirectory :: MonadUnliftIO m => String -> (FilePath -> m a) -> m a #
withTempFile :: MonadUnliftIO m => FilePath -> String -> (FilePath -> Handle -> m a) -> m a #
withTempDirectory :: MonadUnliftIO m => FilePath -> String -> (FilePath -> m a) -> m a #
timeout :: MonadUnliftIO m => Int -> m a -> m (Maybe a) #
wrappedWithRunInIO :: MonadUnliftIO n => (n b -> m b) -> (forall a. m a -> n a) -> ((forall a. m a -> IO a) -> IO b) -> m b #
toIO :: MonadUnliftIO m => m a -> m (IO a) #
withUnliftIO :: MonadUnliftIO m => (UnliftIO m -> IO a) -> m a #
askRunInIO :: MonadUnliftIO m => m (m a -> IO a) #
class MonadIO m => MonadUnliftIO (m :: Type -> Type) where #
Minimal complete definition
Instances
| MonadUnliftIO IO | |
Defined in Control.Monad.IO.Unlift | |
| MonadUnliftIO m => MonadUnliftIO (ResourceT m) | |
Defined in Control.Monad.Trans.Resource.Internal | |
| MonadUnliftIO (WidgetFor site) | |
Defined in Yesod.Core.Types | |
| MonadUnliftIO (HandlerFor site) | |
Defined in Yesod.Core.Types Methods askUnliftIO :: HandlerFor site (UnliftIO (HandlerFor site)) # withRunInIO :: ((forall a. HandlerFor site a -> IO a) -> IO b) -> HandlerFor site b # | |
| MonadUnliftIO m => MonadUnliftIO (LoggingT m) | |
Defined in Control.Monad.Logger Methods askUnliftIO :: LoggingT m (UnliftIO (LoggingT m)) # withRunInIO :: ((forall a. LoggingT m a -> IO a) -> IO b) -> LoggingT m b # | |
| MonadUnliftIO m => MonadUnliftIO (NoLoggingT m) | |
Defined in Control.Monad.Logger Methods askUnliftIO :: NoLoggingT m (UnliftIO (NoLoggingT m)) # withRunInIO :: ((forall a. NoLoggingT m a -> IO a) -> IO b) -> NoLoggingT m b # | |
| MonadUnliftIO m => MonadUnliftIO (ReaderT r m) | |
Defined in Control.Monad.IO.Unlift | |
| MonadUnliftIO (SubHandlerFor child master) | |
Defined in Yesod.Core.Types Methods askUnliftIO :: SubHandlerFor child master (UnliftIO (SubHandlerFor child master)) # withRunInIO :: ((forall a. SubHandlerFor child master a -> IO a) -> IO b) -> SubHandlerFor child master b # | |
| MonadUnliftIO m => MonadUnliftIO (IdentityT m) | |
Defined in Control.Monad.IO.Unlift Methods askUnliftIO :: IdentityT m (UnliftIO (IdentityT m)) # withRunInIO :: ((forall a. IdentityT m a -> IO a) -> IO b) -> IdentityT m b # | |
newTBChanIO :: Int -> IO (TBChan a) #
readTBChan :: TBChan a -> STM a #
tryReadTBChan :: TBChan a -> STM (Maybe a) #
peekTBChan :: TBChan a -> STM a #
tryPeekTBChan :: TBChan a -> STM (Maybe a) #
writeTBChan :: TBChan a -> a -> STM () #
tryWriteTBChan :: TBChan a -> a -> STM Bool #
unGetTBChan :: TBChan a -> a -> STM () #
isEmptyTBChan :: TBChan a -> STM Bool #
isFullTBChan :: TBChan a -> STM Bool #
estimateFreeSlotsTBChan :: TBChan a -> STM Int #
freeSlotsTBChan :: TBChan a -> STM Int #
newTBMChan :: Int -> STM (TBMChan a) #
newTBMChanIO :: Int -> IO (TBMChan a) #
readTBMChan :: TBMChan a -> STM (Maybe a) #
peekTBMChan :: TBMChan a -> STM (Maybe a) #
writeTBMChan :: TBMChan a -> a -> STM () #
unGetTBMChan :: TBMChan a -> a -> STM () #
closeTBMChan :: TBMChan a -> STM () #
isClosedTBMChan :: TBMChan a -> STM Bool #
isEmptyTBMChan :: TBMChan a -> STM Bool #
isFullTBMChan :: TBMChan a -> STM Bool #
estimateFreeSlotsTBMChan :: TBMChan a -> STM Int #
freeSlotsTBMChan :: TBMChan a -> STM Int #
newTBMQueue :: Int -> STM (TBMQueue a) #
newTBMQueueIO :: Int -> IO (TBMQueue a) #
readTBMQueue :: TBMQueue a -> STM (Maybe a) #
peekTBMQueue :: TBMQueue a -> STM (Maybe a) #
writeTBMQueue :: TBMQueue a -> a -> STM () #
unGetTBMQueue :: TBMQueue a -> a -> STM () #
closeTBMQueue :: TBMQueue a -> STM () #
isClosedTBMQueue :: TBMQueue a -> STM Bool #
isEmptyTBMQueue :: TBMQueue a -> STM Bool #
isFullTBMQueue :: TBMQueue a -> STM Bool #
estimateFreeSlotsTBMQueue :: TBMQueue a -> STM Int #
freeSlotsTBMQueue :: TBMQueue a -> STM Int #
newTMChanIO :: IO (TMChan a) #
newBroadcastTMChan :: STM (TMChan a) #
newBroadcastTMChanIO :: IO (TMChan a) #
readTMChan :: TMChan a -> STM (Maybe a) #
peekTMChan :: TMChan a -> STM (Maybe a) #
writeTMChan :: TMChan a -> a -> STM () #
unGetTMChan :: TMChan a -> a -> STM () #
closeTMChan :: TMChan a -> STM () #
isClosedTMChan :: TMChan a -> STM Bool #
isEmptyTMChan :: TMChan a -> STM Bool #
newTMQueue :: STM (TMQueue a) #
newTMQueueIO :: IO (TMQueue a) #
readTMQueue :: TMQueue a -> STM (Maybe a) #
peekTMQueue :: TMQueue a -> STM (Maybe a) #
writeTMQueue :: TMQueue a -> a -> STM () #
unGetTMQueue :: TMQueue a -> a -> STM () #
closeTMQueue :: TMQueue a -> STM () #
isClosedTMQueue :: TMQueue a -> STM Bool #
isEmptyTMQueue :: TMQueue a -> STM Bool #
newBroadcastTChan :: STM (TChan a) #
sayErrString :: MonadIO m => String -> m () #
sayErrShow :: (MonadIO m, Show a) => a -> m () #
hSayString :: MonadIO m => Handle -> String -> m () #
readMutVar :: PrimMonad m => MutVar (PrimState m) a -> m a #
writeMutVar :: PrimMonad m => MutVar (PrimState m) a -> a -> m () #
atomicModifyMutVar :: PrimMonad m => MutVar (PrimState m) a -> (a -> (a, b)) -> m b #
atomicModifyMutVar' :: PrimMonad m => MutVar (PrimState m) a -> (a -> (a, b)) -> m b #
modifyMutVar :: PrimMonad m => MutVar (PrimState m) a -> (a -> a) -> m () #
modifyMutVar' :: PrimMonad m => MutVar (PrimState m) a -> (a -> a) -> m () #
Minimal complete definition
sizeOf#, alignment#, indexByteArray#, readByteArray#, writeByteArray#, setByteArray#, indexOffAddr#, readOffAddr#, writeOffAddr#, setOffAddr#
Instances
| Prim Char | |
Defined in Data.Primitive.Types Methods alignment# :: Char -> Int# indexByteArray# :: ByteArray# -> Int# -> Char readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Char #) writeByteArray# :: MutableByteArray# s -> Int# -> Char -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Char -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Char readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Char #) writeOffAddr# :: Addr# -> Int# -> Char -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Char -> State# s -> State# s | |
| Prim Double | |
Defined in Data.Primitive.Types Methods alignment# :: Double -> Int# indexByteArray# :: ByteArray# -> Int# -> Double readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Double #) writeByteArray# :: MutableByteArray# s -> Int# -> Double -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Double -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Double readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Double #) writeOffAddr# :: Addr# -> Int# -> Double -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Double -> State# s -> State# s | |
| Prim Float | |
Defined in Data.Primitive.Types Methods alignment# :: Float -> Int# indexByteArray# :: ByteArray# -> Int# -> Float readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Float #) writeByteArray# :: MutableByteArray# s -> Int# -> Float -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Float -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Float readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Float #) writeOffAddr# :: Addr# -> Int# -> Float -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Float -> State# s -> State# s | |
| Prim Int | |
Defined in Data.Primitive.Types Methods alignment# :: Int -> Int# indexByteArray# :: ByteArray# -> Int# -> Int readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int #) writeByteArray# :: MutableByteArray# s -> Int# -> Int -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Int readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int #) writeOffAddr# :: Addr# -> Int# -> Int -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Int -> State# s -> State# s | |
| Prim Int8 | |
Defined in Data.Primitive.Types Methods sizeOf# :: Int8 -> Int# alignment# :: Int8 -> Int# indexByteArray# :: ByteArray# -> Int# -> Int8 readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int8 #) writeByteArray# :: MutableByteArray# s -> Int# -> Int8 -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int8 -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Int8 readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int8 #) writeOffAddr# :: Addr# -> Int# -> Int8 -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Int8 -> State# s -> State# s | |
| Prim Int16 | |
Defined in Data.Primitive.Types Methods sizeOf# :: Int16 -> Int# alignment# :: Int16 -> Int# indexByteArray# :: ByteArray# -> Int# -> Int16 readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int16 #) writeByteArray# :: MutableByteArray# s -> Int# -> Int16 -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int16 -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Int16 readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int16 #) writeOffAddr# :: Addr# -> Int# -> Int16 -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Int16 -> State# s -> State# s | |
| Prim Int32 | |
Defined in Data.Primitive.Types Methods alignment# :: Int32 -> Int# indexByteArray# :: ByteArray# -> Int# -> Int32 readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int32 #) writeByteArray# :: MutableByteArray# s -> Int# -> Int32 -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int32 -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Int32 readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int32 #) writeOffAddr# :: Addr# -> Int# -> Int32 -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Int32 -> State# s -> State# s | |
| Prim Int64 | |
Defined in Data.Primitive.Types Methods alignment# :: Int64 -> Int# indexByteArray# :: ByteArray# -> Int# -> Int64 readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int64 #) writeByteArray# :: MutableByteArray# s -> Int# -> Int64 -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int64 -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Int64 readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int64 #) writeOffAddr# :: Addr# -> Int# -> Int64 -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Int64 -> State# s -> State# s | |
| Prim Word | |
Defined in Data.Primitive.Types Methods alignment# :: Word -> Int# indexByteArray# :: ByteArray# -> Int# -> Word readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word #) writeByteArray# :: MutableByteArray# s -> Int# -> Word -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Word readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word #) writeOffAddr# :: Addr# -> Int# -> Word -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Word -> State# s -> State# s | |
| Prim Word8 | |
Defined in Data.Primitive.Types Methods alignment# :: Word8 -> Int# indexByteArray# :: ByteArray# -> Int# -> Word8 readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word8 #) writeByteArray# :: MutableByteArray# s -> Int# -> Word8 -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word8 -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Word8 readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word8 #) writeOffAddr# :: Addr# -> Int# -> Word8 -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Word8 -> State# s -> State# s | |
| Prim Word16 | |
Defined in Data.Primitive.Types Methods sizeOf# :: Word16 -> Int# alignment# :: Word16 -> Int# indexByteArray# :: ByteArray# -> Int# -> Word16 readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word16 #) writeByteArray# :: MutableByteArray# s -> Int# -> Word16 -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word16 -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Word16 readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word16 #) writeOffAddr# :: Addr# -> Int# -> Word16 -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Word16 -> State# s -> State# s | |
| Prim Word32 | |
Defined in Data.Primitive.Types Methods alignment# :: Word32 -> Int# indexByteArray# :: ByteArray# -> Int# -> Word32 readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word32 #) writeByteArray# :: MutableByteArray# s -> Int# -> Word32 -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word32 -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Word32 readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word32 #) writeOffAddr# :: Addr# -> Int# -> Word32 -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Word32 -> State# s -> State# s | |
| Prim Word64 | |
Defined in Data.Primitive.Types Methods alignment# :: Word64 -> Int# indexByteArray# :: ByteArray# -> Int# -> Word64 readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word64 #) writeByteArray# :: MutableByteArray# s -> Int# -> Word64 -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word64 -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Word64 readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word64 #) writeOffAddr# :: Addr# -> Int# -> Word64 -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Word64 -> State# s -> State# s | |
| Prim CTime | |
Defined in Data.Primitive.Types Methods sizeOf# :: CTime -> Int# alignment# :: CTime -> Int# indexByteArray# :: ByteArray# -> Int# -> CTime readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CTime #) writeByteArray# :: MutableByteArray# s -> Int# -> CTime -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CTime -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CTime readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CTime #) writeOffAddr# :: Addr# -> Int# -> CTime -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CTime -> State# s -> State# s | |
| Prim CInt | |
Defined in Data.Primitive.Types Methods sizeOf# :: CInt -> Int# alignment# :: CInt -> Int# indexByteArray# :: ByteArray# -> Int# -> CInt readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CInt #) writeByteArray# :: MutableByteArray# s -> Int# -> CInt -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CInt -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CInt readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CInt #) writeOffAddr# :: Addr# -> Int# -> CInt -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CInt -> State# s -> State# s | |
| Prim CChar | |
Defined in Data.Primitive.Types Methods sizeOf# :: CChar -> Int# alignment# :: CChar -> Int# indexByteArray# :: ByteArray# -> Int# -> CChar readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CChar #) writeByteArray# :: MutableByteArray# s -> Int# -> CChar -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CChar -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CChar readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CChar #) writeOffAddr# :: Addr# -> Int# -> CChar -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CChar -> State# s -> State# s | |
| Prim CSize | |
Defined in Data.Primitive.Types Methods sizeOf# :: CSize -> Int# alignment# :: CSize -> Int# indexByteArray# :: ByteArray# -> Int# -> CSize readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CSize #) writeByteArray# :: MutableByteArray# s -> Int# -> CSize -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CSize -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CSize readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CSize #) writeOffAddr# :: Addr# -> Int# -> CSize -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CSize -> State# s -> State# s | |
| Prim CBool | |
Defined in Data.Primitive.Types Methods sizeOf# :: CBool -> Int# alignment# :: CBool -> Int# indexByteArray# :: ByteArray# -> Int# -> CBool readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CBool #) writeByteArray# :: MutableByteArray# s -> Int# -> CBool -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CBool -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CBool readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CBool #) writeOffAddr# :: Addr# -> Int# -> CBool -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CBool -> State# s -> State# s | |
| Prim CClock | |
Defined in Data.Primitive.Types Methods sizeOf# :: CClock -> Int# alignment# :: CClock -> Int# indexByteArray# :: ByteArray# -> Int# -> CClock readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CClock #) writeByteArray# :: MutableByteArray# s -> Int# -> CClock -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CClock -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CClock readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CClock #) writeOffAddr# :: Addr# -> Int# -> CClock -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CClock -> State# s -> State# s | |
| Prim CDouble | |
Defined in Data.Primitive.Types Methods sizeOf# :: CDouble -> Int# alignment# :: CDouble -> Int# indexByteArray# :: ByteArray# -> Int# -> CDouble readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CDouble #) writeByteArray# :: MutableByteArray# s -> Int# -> CDouble -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CDouble -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CDouble readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CDouble #) writeOffAddr# :: Addr# -> Int# -> CDouble -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CDouble -> State# s -> State# s | |
| Prim CFloat | |
Defined in Data.Primitive.Types Methods sizeOf# :: CFloat -> Int# alignment# :: CFloat -> Int# indexByteArray# :: ByteArray# -> Int# -> CFloat readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CFloat #) writeByteArray# :: MutableByteArray# s -> Int# -> CFloat -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CFloat -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CFloat readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CFloat #) writeOffAddr# :: Addr# -> Int# -> CFloat -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CFloat -> State# s -> State# s | |
| Prim CIntMax | |
Defined in Data.Primitive.Types Methods sizeOf# :: CIntMax -> Int# alignment# :: CIntMax -> Int# indexByteArray# :: ByteArray# -> Int# -> CIntMax readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CIntMax #) writeByteArray# :: MutableByteArray# s -> Int# -> CIntMax -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CIntMax -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CIntMax readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CIntMax #) writeOffAddr# :: Addr# -> Int# -> CIntMax -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CIntMax -> State# s -> State# s | |
| Prim CIntPtr | |
Defined in Data.Primitive.Types Methods sizeOf# :: CIntPtr -> Int# alignment# :: CIntPtr -> Int# indexByteArray# :: ByteArray# -> Int# -> CIntPtr readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CIntPtr #) writeByteArray# :: MutableByteArray# s -> Int# -> CIntPtr -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CIntPtr -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CIntPtr readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CIntPtr #) writeOffAddr# :: Addr# -> Int# -> CIntPtr -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CIntPtr -> State# s -> State# s | |
| Prim CLLong | |
Defined in Data.Primitive.Types Methods sizeOf# :: CLLong -> Int# alignment# :: CLLong -> Int# indexByteArray# :: ByteArray# -> Int# -> CLLong readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CLLong #) writeByteArray# :: MutableByteArray# s -> Int# -> CLLong -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CLLong -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CLLong readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CLLong #) writeOffAddr# :: Addr# -> Int# -> CLLong -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CLLong -> State# s -> State# s | |
| Prim CLong | |
Defined in Data.Primitive.Types Methods sizeOf# :: CLong -> Int# alignment# :: CLong -> Int# indexByteArray# :: ByteArray# -> Int# -> CLong readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CLong #) writeByteArray# :: MutableByteArray# s -> Int# -> CLong -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CLong -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CLong readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CLong #) writeOffAddr# :: Addr# -> Int# -> CLong -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CLong -> State# s -> State# s | |
| Prim COff | |
Defined in Data.Primitive.Types Methods sizeOf# :: COff -> Int# alignment# :: COff -> Int# indexByteArray# :: ByteArray# -> Int# -> COff readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, COff #) writeByteArray# :: MutableByteArray# s -> Int# -> COff -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> COff -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> COff readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, COff #) writeOffAddr# :: Addr# -> Int# -> COff -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> COff -> State# s -> State# s | |
| Prim CPtrdiff | |
Defined in Data.Primitive.Types Methods sizeOf# :: CPtrdiff -> Int# alignment# :: CPtrdiff -> Int# indexByteArray# :: ByteArray# -> Int# -> CPtrdiff readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CPtrdiff #) writeByteArray# :: MutableByteArray# s -> Int# -> CPtrdiff -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CPtrdiff -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CPtrdiff readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CPtrdiff #) writeOffAddr# :: Addr# -> Int# -> CPtrdiff -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CPtrdiff -> State# s -> State# s | |
| Prim CSChar | |
Defined in Data.Primitive.Types Methods sizeOf# :: CSChar -> Int# alignment# :: CSChar -> Int# indexByteArray# :: ByteArray# -> Int# -> CSChar readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CSChar #) writeByteArray# :: MutableByteArray# s -> Int# -> CSChar -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CSChar -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CSChar readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CSChar #) writeOffAddr# :: Addr# -> Int# -> CSChar -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CSChar -> State# s -> State# s | |
| Prim CSUSeconds | |
Defined in Data.Primitive.Types Methods sizeOf# :: CSUSeconds -> Int# alignment# :: CSUSeconds -> Int# indexByteArray# :: ByteArray# -> Int# -> CSUSeconds readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CSUSeconds #) writeByteArray# :: MutableByteArray# s -> Int# -> CSUSeconds -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CSUSeconds -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CSUSeconds readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CSUSeconds #) writeOffAddr# :: Addr# -> Int# -> CSUSeconds -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CSUSeconds -> State# s -> State# s | |
| Prim CShort | |
Defined in Data.Primitive.Types Methods sizeOf# :: CShort -> Int# alignment# :: CShort -> Int# indexByteArray# :: ByteArray# -> Int# -> CShort readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CShort #) writeByteArray# :: MutableByteArray# s -> Int# -> CShort -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CShort -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CShort readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CShort #) writeOffAddr# :: Addr# -> Int# -> CShort -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CShort -> State# s -> State# s | |
| Prim CSigAtomic | |
Defined in Data.Primitive.Types Methods sizeOf# :: CSigAtomic -> Int# alignment# :: CSigAtomic -> Int# indexByteArray# :: ByteArray# -> Int# -> CSigAtomic readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CSigAtomic #) writeByteArray# :: MutableByteArray# s -> Int# -> CSigAtomic -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CSigAtomic -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CSigAtomic readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CSigAtomic #) writeOffAddr# :: Addr# -> Int# -> CSigAtomic -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CSigAtomic -> State# s -> State# s | |
| Prim CUChar | |
Defined in Data.Primitive.Types Methods sizeOf# :: CUChar -> Int# alignment# :: CUChar -> Int# indexByteArray# :: ByteArray# -> Int# -> CUChar readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CUChar #) writeByteArray# :: MutableByteArray# s -> Int# -> CUChar -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CUChar -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CUChar readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CUChar #) writeOffAddr# :: Addr# -> Int# -> CUChar -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CUChar -> State# s -> State# s | |
| Prim CUInt | |
Defined in Data.Primitive.Types Methods sizeOf# :: CUInt -> Int# alignment# :: CUInt -> Int# indexByteArray# :: ByteArray# -> Int# -> CUInt readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CUInt #) writeByteArray# :: MutableByteArray# s -> Int# -> CUInt -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CUInt -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CUInt readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CUInt #) writeOffAddr# :: Addr# -> Int# -> CUInt -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CUInt -> State# s -> State# s | |
| Prim CUIntMax | |
Defined in Data.Primitive.Types Methods sizeOf# :: CUIntMax -> Int# alignment# :: CUIntMax -> Int# indexByteArray# :: ByteArray# -> Int# -> CUIntMax readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CUIntMax #) writeByteArray# :: MutableByteArray# s -> Int# -> CUIntMax -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CUIntMax -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CUIntMax readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CUIntMax #) writeOffAddr# :: Addr# -> Int# -> CUIntMax -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CUIntMax -> State# s -> State# s | |
| Prim CUIntPtr | |
Defined in Data.Primitive.Types Methods sizeOf# :: CUIntPtr -> Int# alignment# :: CUIntPtr -> Int# indexByteArray# :: ByteArray# -> Int# -> CUIntPtr readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CUIntPtr #) writeByteArray# :: MutableByteArray# s -> Int# -> CUIntPtr -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CUIntPtr -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CUIntPtr readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CUIntPtr #) writeOffAddr# :: Addr# -> Int# -> CUIntPtr -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CUIntPtr -> State# s -> State# s | |
| Prim CULLong | |
Defined in Data.Primitive.Types Methods sizeOf# :: CULLong -> Int# alignment# :: CULLong -> Int# indexByteArray# :: ByteArray# -> Int# -> CULLong readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CULLong #) writeByteArray# :: MutableByteArray# s -> Int# -> CULLong -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CULLong -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CULLong readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CULLong #) writeOffAddr# :: Addr# -> Int# -> CULLong -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CULLong -> State# s -> State# s | |
| Prim CULong | |
Defined in Data.Primitive.Types Methods sizeOf# :: CULong -> Int# alignment# :: CULong -> Int# indexByteArray# :: ByteArray# -> Int# -> CULong readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CULong #) writeByteArray# :: MutableByteArray# s -> Int# -> CULong -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CULong -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CULong readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CULong #) writeOffAddr# :: Addr# -> Int# -> CULong -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CULong -> State# s -> State# s | |
| Prim CUSeconds | |
Defined in Data.Primitive.Types Methods sizeOf# :: CUSeconds -> Int# alignment# :: CUSeconds -> Int# indexByteArray# :: ByteArray# -> Int# -> CUSeconds readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CUSeconds #) writeByteArray# :: MutableByteArray# s -> Int# -> CUSeconds -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CUSeconds -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CUSeconds readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CUSeconds #) writeOffAddr# :: Addr# -> Int# -> CUSeconds -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CUSeconds -> State# s -> State# s | |
| Prim CUShort | |
Defined in Data.Primitive.Types Methods sizeOf# :: CUShort -> Int# alignment# :: CUShort -> Int# indexByteArray# :: ByteArray# -> Int# -> CUShort readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CUShort #) writeByteArray# :: MutableByteArray# s -> Int# -> CUShort -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CUShort -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CUShort readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CUShort #) writeOffAddr# :: Addr# -> Int# -> CUShort -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CUShort -> State# s -> State# s | |
| Prim CWchar | |
Defined in Data.Primitive.Types Methods sizeOf# :: CWchar -> Int# alignment# :: CWchar -> Int# indexByteArray# :: ByteArray# -> Int# -> CWchar readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CWchar #) writeByteArray# :: MutableByteArray# s -> Int# -> CWchar -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CWchar -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CWchar readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CWchar #) writeOffAddr# :: Addr# -> Int# -> CWchar -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CWchar -> State# s -> State# s | |
| Prim CSsize | |
Defined in Data.Primitive.Types Methods sizeOf# :: CSsize -> Int# alignment# :: CSsize -> Int# indexByteArray# :: ByteArray# -> Int# -> CSsize readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CSsize #) writeByteArray# :: MutableByteArray# s -> Int# -> CSsize -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CSsize -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CSsize readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CSsize #) writeOffAddr# :: Addr# -> Int# -> CSsize -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CSsize -> State# s -> State# s | |
| Prim CDev | |
Defined in Data.Primitive.Types Methods sizeOf# :: CDev -> Int# alignment# :: CDev -> Int# indexByteArray# :: ByteArray# -> Int# -> CDev readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CDev #) writeByteArray# :: MutableByteArray# s -> Int# -> CDev -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CDev -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CDev readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CDev #) writeOffAddr# :: Addr# -> Int# -> CDev -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CDev -> State# s -> State# s | |
| Prim CIno | |
Defined in Data.Primitive.Types Methods sizeOf# :: CIno -> Int# alignment# :: CIno -> Int# indexByteArray# :: ByteArray# -> Int# -> CIno readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CIno #) writeByteArray# :: MutableByteArray# s -> Int# -> CIno -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CIno -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CIno readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CIno #) writeOffAddr# :: Addr# -> Int# -> CIno -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CIno -> State# s -> State# s | |
| Prim CPid | |
Defined in Data.Primitive.Types Methods sizeOf# :: CPid -> Int# alignment# :: CPid -> Int# indexByteArray# :: ByteArray# -> Int# -> CPid readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CPid #) writeByteArray# :: MutableByteArray# s -> Int# -> CPid -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CPid -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CPid readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CPid #) writeOffAddr# :: Addr# -> Int# -> CPid -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CPid -> State# s -> State# s | |
| Prim CBlkCnt | |
Defined in Data.Primitive.Types Methods sizeOf# :: CBlkCnt -> Int# alignment# :: CBlkCnt -> Int# indexByteArray# :: ByteArray# -> Int# -> CBlkCnt readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CBlkCnt #) writeByteArray# :: MutableByteArray# s -> Int# -> CBlkCnt -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CBlkCnt -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CBlkCnt readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CBlkCnt #) writeOffAddr# :: Addr# -> Int# -> CBlkCnt -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CBlkCnt -> State# s -> State# s | |
| Prim CBlkSize | |
Defined in Data.Primitive.Types Methods sizeOf# :: CBlkSize -> Int# alignment# :: CBlkSize -> Int# indexByteArray# :: ByteArray# -> Int# -> CBlkSize readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CBlkSize #) writeByteArray# :: MutableByteArray# s -> Int# -> CBlkSize -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CBlkSize -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CBlkSize readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CBlkSize #) writeOffAddr# :: Addr# -> Int# -> CBlkSize -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CBlkSize -> State# s -> State# s | |
| Prim CCc | |
Defined in Data.Primitive.Types Methods sizeOf# :: CCc -> Int# alignment# :: CCc -> Int# indexByteArray# :: ByteArray# -> Int# -> CCc readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CCc #) writeByteArray# :: MutableByteArray# s -> Int# -> CCc -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CCc -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CCc readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CCc #) writeOffAddr# :: Addr# -> Int# -> CCc -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CCc -> State# s -> State# s | |
| Prim CClockId | |
Defined in Data.Primitive.Types Methods sizeOf# :: CClockId -> Int# alignment# :: CClockId -> Int# indexByteArray# :: ByteArray# -> Int# -> CClockId readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CClockId #) writeByteArray# :: MutableByteArray# s -> Int# -> CClockId -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CClockId -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CClockId readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CClockId #) writeOffAddr# :: Addr# -> Int# -> CClockId -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CClockId -> State# s -> State# s | |
| Prim CFsBlkCnt | |
Defined in Data.Primitive.Types Methods sizeOf# :: CFsBlkCnt -> Int# alignment# :: CFsBlkCnt -> Int# indexByteArray# :: ByteArray# -> Int# -> CFsBlkCnt readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CFsBlkCnt #) writeByteArray# :: MutableByteArray# s -> Int# -> CFsBlkCnt -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CFsBlkCnt -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CFsBlkCnt readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CFsBlkCnt #) writeOffAddr# :: Addr# -> Int# -> CFsBlkCnt -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CFsBlkCnt -> State# s -> State# s | |
| Prim CFsFilCnt | |
Defined in Data.Primitive.Types Methods sizeOf# :: CFsFilCnt -> Int# alignment# :: CFsFilCnt -> Int# indexByteArray# :: ByteArray# -> Int# -> CFsFilCnt readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CFsFilCnt #) writeByteArray# :: MutableByteArray# s -> Int# -> CFsFilCnt -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CFsFilCnt -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CFsFilCnt readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CFsFilCnt #) writeOffAddr# :: Addr# -> Int# -> CFsFilCnt -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CFsFilCnt -> State# s -> State# s | |
| Prim CGid | |
Defined in Data.Primitive.Types Methods sizeOf# :: CGid -> Int# alignment# :: CGid -> Int# indexByteArray# :: ByteArray# -> Int# -> CGid readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CGid #) writeByteArray# :: MutableByteArray# s -> Int# -> CGid -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CGid -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CGid readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CGid #) writeOffAddr# :: Addr# -> Int# -> CGid -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CGid -> State# s -> State# s | |
| Prim CId | |
Defined in Data.Primitive.Types Methods sizeOf# :: CId -> Int# alignment# :: CId -> Int# indexByteArray# :: ByteArray# -> Int# -> CId readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CId #) writeByteArray# :: MutableByteArray# s -> Int# -> CId -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CId -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CId readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CId #) writeOffAddr# :: Addr# -> Int# -> CId -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CId -> State# s -> State# s | |
| Prim CKey | |
Defined in Data.Primitive.Types Methods sizeOf# :: CKey -> Int# alignment# :: CKey -> Int# indexByteArray# :: ByteArray# -> Int# -> CKey readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CKey #) writeByteArray# :: MutableByteArray# s -> Int# -> CKey -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CKey -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CKey readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CKey #) writeOffAddr# :: Addr# -> Int# -> CKey -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CKey -> State# s -> State# s | |
| Prim CMode | |
Defined in Data.Primitive.Types Methods sizeOf# :: CMode -> Int# alignment# :: CMode -> Int# indexByteArray# :: ByteArray# -> Int# -> CMode readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CMode #) writeByteArray# :: MutableByteArray# s -> Int# -> CMode -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CMode -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CMode readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CMode #) writeOffAddr# :: Addr# -> Int# -> CMode -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CMode -> State# s -> State# s | |
| Prim CNlink | |
Defined in Data.Primitive.Types Methods sizeOf# :: CNlink -> Int# alignment# :: CNlink -> Int# indexByteArray# :: ByteArray# -> Int# -> CNlink readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CNlink #) writeByteArray# :: MutableByteArray# s -> Int# -> CNlink -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CNlink -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CNlink readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CNlink #) writeOffAddr# :: Addr# -> Int# -> CNlink -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CNlink -> State# s -> State# s | |
| Prim CRLim | |
Defined in Data.Primitive.Types Methods sizeOf# :: CRLim -> Int# alignment# :: CRLim -> Int# indexByteArray# :: ByteArray# -> Int# -> CRLim readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CRLim #) writeByteArray# :: MutableByteArray# s -> Int# -> CRLim -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CRLim -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CRLim readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CRLim #) writeOffAddr# :: Addr# -> Int# -> CRLim -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CRLim -> State# s -> State# s | |
| Prim CSpeed | |
Defined in Data.Primitive.Types Methods sizeOf# :: CSpeed -> Int# alignment# :: CSpeed -> Int# indexByteArray# :: ByteArray# -> Int# -> CSpeed readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CSpeed #) writeByteArray# :: MutableByteArray# s -> Int# -> CSpeed -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CSpeed -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CSpeed readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CSpeed #) writeOffAddr# :: Addr# -> Int# -> CSpeed -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CSpeed -> State# s -> State# s | |
| Prim CTcflag | |
Defined in Data.Primitive.Types Methods sizeOf# :: CTcflag -> Int# alignment# :: CTcflag -> Int# indexByteArray# :: ByteArray# -> Int# -> CTcflag readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CTcflag #) writeByteArray# :: MutableByteArray# s -> Int# -> CTcflag -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CTcflag -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CTcflag readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CTcflag #) writeOffAddr# :: Addr# -> Int# -> CTcflag -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CTcflag -> State# s -> State# s | |
| Prim CTimer | |
Defined in Data.Primitive.Types Methods sizeOf# :: CTimer -> Int# alignment# :: CTimer -> Int# indexByteArray# :: ByteArray# -> Int# -> CTimer readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CTimer #) writeByteArray# :: MutableByteArray# s -> Int# -> CTimer -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CTimer -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CTimer readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CTimer #) writeOffAddr# :: Addr# -> Int# -> CTimer -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CTimer -> State# s -> State# s | |
| Prim CUid | |
Defined in Data.Primitive.Types Methods sizeOf# :: CUid -> Int# alignment# :: CUid -> Int# indexByteArray# :: ByteArray# -> Int# -> CUid readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CUid #) writeByteArray# :: MutableByteArray# s -> Int# -> CUid -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CUid -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> CUid readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CUid #) writeOffAddr# :: Addr# -> Int# -> CUid -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> CUid -> State# s -> State# s | |
| Prim Fd | |
Defined in Data.Primitive.Types Methods sizeOf# :: Fd -> Int# alignment# :: Fd -> Int# indexByteArray# :: ByteArray# -> Int# -> Fd readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Fd #) writeByteArray# :: MutableByteArray# s -> Int# -> Fd -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Fd -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Fd readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Fd #) writeOffAddr# :: Addr# -> Int# -> Fd -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Fd -> State# s -> State# s | |
| Prim (StablePtr a) | |
Defined in Data.Primitive.Types Methods sizeOf# :: StablePtr a -> Int# alignment# :: StablePtr a -> Int# indexByteArray# :: ByteArray# -> Int# -> StablePtr a readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, StablePtr a #) writeByteArray# :: MutableByteArray# s -> Int# -> StablePtr a -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> StablePtr a -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> StablePtr a readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, StablePtr a #) writeOffAddr# :: Addr# -> Int# -> StablePtr a -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> StablePtr a -> State# s -> State# s | |
| Prim (Ptr a) | |
Defined in Data.Primitive.Types Methods sizeOf# :: Ptr a -> Int# alignment# :: Ptr a -> Int# indexByteArray# :: ByteArray# -> Int# -> Ptr a readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Ptr a #) writeByteArray# :: MutableByteArray# s -> Int# -> Ptr a -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Ptr a -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Ptr a readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Ptr a #) writeOffAddr# :: Addr# -> Int# -> Ptr a -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Ptr a -> State# s -> State# s | |
| Prim (FunPtr a) | |
Defined in Data.Primitive.Types Methods sizeOf# :: FunPtr a -> Int# alignment# :: FunPtr a -> Int# indexByteArray# :: ByteArray# -> Int# -> FunPtr a readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, FunPtr a #) writeByteArray# :: MutableByteArray# s -> Int# -> FunPtr a -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> FunPtr a -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> FunPtr a readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, FunPtr a #) writeOffAddr# :: Addr# -> Int# -> FunPtr a -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> FunPtr a -> State# s -> State# s | |
| Prim a => Prim (Identity a) | |
Defined in Data.Primitive.Types Methods alignment# :: Identity a -> Int# indexByteArray# :: ByteArray# -> Int# -> Identity a readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Identity a #) writeByteArray# :: MutableByteArray# s -> Int# -> Identity a -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Identity a -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Identity a readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Identity a #) writeOffAddr# :: Addr# -> Int# -> Identity a -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Identity a -> State# s -> State# s | |
| Prim a => Prim (Down a) | |
Defined in Data.Primitive.Types Methods alignment# :: Down a -> Int# indexByteArray# :: ByteArray# -> Int# -> Down a readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Down a #) writeByteArray# :: MutableByteArray# s -> Int# -> Down a -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Down a -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Down a readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Down a #) writeOffAddr# :: Addr# -> Int# -> Down a -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Down a -> State# s -> State# s | |
| Prim a => Prim (Dual a) | |
Defined in Data.Primitive.Types Methods sizeOf# :: Dual a -> Int# alignment# :: Dual a -> Int# indexByteArray# :: ByteArray# -> Int# -> Dual a readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Dual a #) writeByteArray# :: MutableByteArray# s -> Int# -> Dual a -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Dual a -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Dual a readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Dual a #) writeOffAddr# :: Addr# -> Int# -> Dual a -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Dual a -> State# s -> State# s | |
| Prim a => Prim (Product a) | |
Defined in Data.Primitive.Types Methods sizeOf# :: Product a -> Int# alignment# :: Product a -> Int# indexByteArray# :: ByteArray# -> Int# -> Product a readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Product a #) writeByteArray# :: MutableByteArray# s -> Int# -> Product a -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Product a -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Product a readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Product a #) writeOffAddr# :: Addr# -> Int# -> Product a -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Product a -> State# s -> State# s | |
| Prim a => Prim (Sum a) | |
Defined in Data.Primitive.Types Methods sizeOf# :: Sum a -> Int# alignment# :: Sum a -> Int# indexByteArray# :: ByteArray# -> Int# -> Sum a readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Sum a #) writeByteArray# :: MutableByteArray# s -> Int# -> Sum a -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Sum a -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Sum a readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Sum a #) writeOffAddr# :: Addr# -> Int# -> Sum a -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Sum a -> State# s -> State# s | |
| Prim a => Prim (First a) | |
Defined in Data.Primitive.Types Methods sizeOf# :: First a -> Int# alignment# :: First a -> Int# indexByteArray# :: ByteArray# -> Int# -> First a readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, First a #) writeByteArray# :: MutableByteArray# s -> Int# -> First a -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> First a -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> First a readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, First a #) writeOffAddr# :: Addr# -> Int# -> First a -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> First a -> State# s -> State# s | |
| Prim a => Prim (Last a) | |
Defined in Data.Primitive.Types Methods sizeOf# :: Last a -> Int# alignment# :: Last a -> Int# indexByteArray# :: ByteArray# -> Int# -> Last a readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Last a #) writeByteArray# :: MutableByteArray# s -> Int# -> Last a -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Last a -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Last a readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Last a #) writeOffAddr# :: Addr# -> Int# -> Last a -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Last a -> State# s -> State# s | |
| Prim a => Prim (Max a) | |
Defined in Data.Primitive.Types Methods sizeOf# :: Max a -> Int# alignment# :: Max a -> Int# indexByteArray# :: ByteArray# -> Int# -> Max a readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Max a #) writeByteArray# :: MutableByteArray# s -> Int# -> Max a -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Max a -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Max a readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Max a #) writeOffAddr# :: Addr# -> Int# -> Max a -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Max a -> State# s -> State# s | |
| Prim a => Prim (Min a) | |
Defined in Data.Primitive.Types Methods sizeOf# :: Min a -> Int# alignment# :: Min a -> Int# indexByteArray# :: ByteArray# -> Int# -> Min a readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Min a #) writeByteArray# :: MutableByteArray# s -> Int# -> Min a -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Min a -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Min a readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Min a #) writeOffAddr# :: Addr# -> Int# -> Min a -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Min a -> State# s -> State# s | |
| Prim a => Prim (Const a b) | |
Defined in Data.Primitive.Types Methods sizeOf# :: Const a b -> Int# alignment# :: Const a b -> Int# indexByteArray# :: ByteArray# -> Int# -> Const a b readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Const a b #) writeByteArray# :: MutableByteArray# s -> Int# -> Const a b -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Const a b -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Const a b readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Const a b #) writeOffAddr# :: Addr# -> Int# -> Const a b -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Const a b -> State# s -> State# s | |
Constructors
| MutVar (MutVar# s a) |
Instances
type family PrimState (m :: Type -> Type) #
Instances
class Monad m => PrimMonad (m :: Type -> Type) where #
Instances
| PrimMonad IO | |
| PrimMonad m => PrimMonad (ResourceT m) | |
| PrimMonad (WidgetFor site) | |
| PrimMonad (HandlerFor site) | |
Defined in Yesod.Core.Types Associated Types type PrimState (HandlerFor site) # Methods primitive :: (State# (PrimState (HandlerFor site)) -> (# State# (PrimState (HandlerFor site)), a #)) -> HandlerFor site a # | |
| PrimMonad (ST s) | |
| PrimMonad m => PrimMonad (ListT m) | |
| PrimMonad m => PrimMonad (MaybeT m) | |
| PrimMonad m => PrimMonad (ReaderT r m) | |
| (Monoid w, PrimMonad m) => PrimMonad (WriterT w m) | |
| PrimMonad m => PrimMonad (IdentityT m) | |
| PrimMonad m => PrimMonad (StateT s m) | |
| (Error e, PrimMonad m) => PrimMonad (ErrorT e m) | |
| (Monoid w, PrimMonad m) => PrimMonad (WriterT w m) | |
| PrimMonad m => PrimMonad (StateT s m) | |
| PrimMonad m => PrimMonad (ExceptT e m) | |
| (Monoid w, PrimMonad m) => PrimMonad (AccumT w m) | |
| PrimMonad m => PrimMonad (SelectT r m) | |
| (Monoid w, PrimMonad m) => PrimMonad (WriterT w m) | |
| PrimMonad m => PrimMonad (ConduitT i o m) | |
| PrimMonad m => PrimMonad (ContT r m) | |
| (Monoid w, PrimMonad m) => PrimMonad (RWST r w s m) | |
| (Monoid w, PrimMonad m) => PrimMonad (RWST r w s m) | |
| (Monoid w, PrimMonad m) => PrimMonad (RWST r w s m) | |
| PrimMonad m => PrimMonad (Pipe l i o u m) | |
Instances
Instances
type MutableDeque c = (MutableQueue c, MutablePushFront c, MutablePopBack c) #
type MutableStack c = (MutablePopFront c, MutablePushFront c) #
type MutableQueue c = (MutablePopFront c, MutablePushBack c) #
class MutableCollection c => MutablePushBack c where #
Instances
| IsSequence a => MutablePushBack (IORef a) | |
Defined in Data.Mutable.Class | |
| IsSequence a => MutablePushBack (MutVar s a) | |
Defined in Data.Mutable.Class | |
| IsSequence a => MutablePushBack (STRef s a) | |
Defined in Data.Mutable.Class | |
| IsSequence seq => MutablePushBack (BRef s seq) | |
Defined in Data.Mutable.BRef | |
| MutablePushBack (DLList s a) | |
Defined in Data.Mutable.DLList | |
| MVector v a => MutablePushBack (Deque v s a) | |
Defined in Data.Mutable.Deque | |
class MutableCollection c => MutablePopBack c where #
Instances
| IsSequence a => MutablePopBack (IORef a) | |
| IsSequence a => MutablePopBack (MutVar s a) | |
| IsSequence a => MutablePopBack (STRef s a) | |
| IsSequence seq => MutablePopBack (BRef s seq) | |
| MutablePopBack (DLList s a) | |
| MVector v a => MutablePopBack (Deque v s a) | |
class MutableCollection c => MutablePushFront c where #
Instances
| IsSequence a => MutablePushFront (IORef a) | |
Defined in Data.Mutable.Class | |
| IsSequence a => MutablePushFront (MutVar s a) | |
Defined in Data.Mutable.Class | |
| IsSequence a => MutablePushFront (STRef s a) | |
Defined in Data.Mutable.Class | |
| IsSequence seq => MutablePushFront (BRef s seq) | |
Defined in Data.Mutable.BRef | |
| MutablePushFront (DLList s a) | |
Defined in Data.Mutable.DLList | |
| MVector v a => MutablePushFront (Deque v s a) | |
Defined in Data.Mutable.Deque | |
class MutableCollection c => MutablePopFront c where #
Instances
| IsSequence a => MutablePopFront (IORef a) | |
| IsSequence a => MutablePopFront (MutVar s a) | |
| IsSequence a => MutablePopFront (STRef s a) | |
| IsSequence seq => MutablePopFront (BRef s seq) | |
| MutablePopFront (DLList s a) | |
| MVector v a => MutablePopFront (Deque v s a) | |
class MutableContainer c => MutableCollection c where #
Associated Types
type CollElement c #
Instances
| Monoid w => MutableCollection (IORef w) | |
| Monoid w => MutableCollection (MutVar s w) | |
| Monoid w => MutableCollection (STRef s w) | |
| Monoid w => MutableCollection (BRef s w) | |
| MutableCollection (DLList s a) | |
| MVector v a => MutableCollection (Deque v s a) | |
type family CollElement c #
Instances
| type CollElement (IORef w) | |
Defined in Data.Mutable.Class | |
| type CollElement (MutVar s w) | |
Defined in Data.Mutable.Class | |
| type CollElement (STRef s w) | |
Defined in Data.Mutable.Class | |
| type CollElement (BRef s w) | |
Defined in Data.Mutable.BRef | |
| type CollElement (DLList s a) | |
Defined in Data.Mutable.DLList | |
| type CollElement (Deque v s a) | |
Defined in Data.Mutable.Deque | |
class MutableRef c => MutableAtomicRef c where #
Methods
atomicModifyRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> (RefElement c, a)) -> m a #
atomicModifyRef' :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> (RefElement c, a)) -> m a #
Instances
| MutableAtomicRef (IORef a) | |
Defined in Data.Mutable.Class Methods atomicModifyRef :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> (RefElement (IORef a) -> (RefElement (IORef a), a0)) -> m a0 # atomicModifyRef' :: (PrimMonad m, PrimState m ~ MCState (IORef a)) => IORef a -> (RefElement (IORef a) -> (RefElement (IORef a), a0)) -> m a0 # | |
| MutableAtomicRef (MutVar s a) | |
Defined in Data.Mutable.Class Methods atomicModifyRef :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> (RefElement (MutVar s a) -> (RefElement (MutVar s a), a0)) -> m a0 # atomicModifyRef' :: (PrimMonad m, PrimState m ~ MCState (MutVar s a)) => MutVar s a -> (RefElement (MutVar s a) -> (RefElement (MutVar s a), a0)) -> m a0 # | |
class MutableContainer c => MutableRef c where #
Associated Types
type RefElement c #
Methods
newRef :: (PrimMonad m, PrimState m ~ MCState c) => RefElement c -> m c #
readRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> m (RefElement c) #
writeRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> RefElement c -> m () #
modifyRef :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> RefElement c) -> m () #
modifyRef' :: (PrimMonad m, PrimState m ~ MCState c) => c -> (RefElement c -> RefElement c) -> m () #
Instances
type family RefElement c #
Instances
| type RefElement (IORef a) | |
Defined in Data.Mutable.Class | |
| type RefElement (MutVar s a) | |
Defined in Data.Mutable.Class | |
| type RefElement (STRef s a) | |
Defined in Data.Mutable.Class | |
| type RefElement (BRef s a) | |
Defined in Data.Mutable.BRef | |
| type RefElement (PRef s a) | |
Defined in Data.Mutable.PRef | |
| type RefElement (SRef s a) | |
Defined in Data.Mutable.SRef | |
| type RefElement (URef s a) | |
Defined in Data.Mutable.URef | |
class MutableContainer c #
Instances
| MutableContainer (IORef a) | |
Defined in Data.Mutable.Class | |
| MutableContainer (MutVar s a) | |
Defined in Data.Mutable.Class | |
| MutableContainer (STRef s a) | |
Defined in Data.Mutable.Class | |
| MutableContainer (BRef s a) | |
Defined in Data.Mutable.BRef | |
| MutableContainer (DLList s a) | |
Defined in Data.Mutable.DLList | |
| MutableContainer (PRef s a) | |
Defined in Data.Mutable.PRef | |
| MutableContainer (SRef s a) | |
Defined in Data.Mutable.SRef | |
| MutableContainer (URef s a) | |
Defined in Data.Mutable.URef | |
| MutableContainer (Deque v s a) | |
Defined in Data.Mutable.Deque | |
Instances
| type MCState (IORef a) | |
Defined in Data.Mutable.Class | |
| type MCState (MutVar s a) | |
Defined in Data.Mutable.Class | |
| type MCState (STRef s a) | |
Defined in Data.Mutable.Class | |
| type MCState (BRef s a) | |
Defined in Data.Mutable.BRef | |
| type MCState (DLList s a) | |
Defined in Data.Mutable.DLList | |
| type MCState (PRef s a) | |
Defined in Data.Mutable.PRef | |
| type MCState (SRef s a) | |
Defined in Data.Mutable.SRef | |
| type MCState (URef s a) | |
Defined in Data.Mutable.URef | |
| type MCState (Deque v s a) | |
Defined in Data.Mutable.Deque | |
Instances
Instances
| MutablePushBack (DLList s a) | |
Defined in Data.Mutable.DLList | |
| MutablePopBack (DLList s a) | |
| MutablePushFront (DLList s a) | |
Defined in Data.Mutable.DLList | |
| MutablePopFront (DLList s a) | |
| MutableCollection (DLList s a) | |
| MutableContainer (DLList s a) | |
Defined in Data.Mutable.DLList | |
| type CollElement (DLList s a) | |
Defined in Data.Mutable.DLList | |
| type MCState (DLList s a) | |
Defined in Data.Mutable.DLList | |
data Deque (v :: Type -> Type -> Type) s a #
Instances
| MVector v a => MutablePushBack (Deque v s a) | |
Defined in Data.Mutable.Deque | |
| MVector v a => MutablePopBack (Deque v s a) | |
| MVector v a => MutablePushFront (Deque v s a) | |
Defined in Data.Mutable.Deque | |
| MVector v a => MutablePopFront (Deque v s a) | |
| MVector v a => MutableCollection (Deque v s a) | |
| MutableContainer (Deque v s a) | |
Defined in Data.Mutable.Deque | |
| type CollElement (Deque v s a) | |
Defined in Data.Mutable.Deque | |
| type MCState (Deque v s a) | |
Defined in Data.Mutable.Deque | |
Instances
| Prim a => MutableRef (PRef s a) | |
Defined in Data.Mutable.PRef Associated Types type RefElement (PRef s a) # Methods newRef :: (PrimMonad m, PrimState m ~ MCState (PRef s a)) => RefElement (PRef s a) -> m (PRef s a) # readRef :: (PrimMonad m, PrimState m ~ MCState (PRef s a)) => PRef s a -> m (RefElement (PRef s a)) # writeRef :: (PrimMonad m, PrimState m ~ MCState (PRef s a)) => PRef s a -> RefElement (PRef s a) -> m () # modifyRef :: (PrimMonad m, PrimState m ~ MCState (PRef s a)) => PRef s a -> (RefElement (PRef s a) -> RefElement (PRef s a)) -> m () # modifyRef' :: (PrimMonad m, PrimState m ~ MCState (PRef s a)) => PRef s a -> (RefElement (PRef s a) -> RefElement (PRef s a)) -> m () # | |
| MutableContainer (PRef s a) | |
Defined in Data.Mutable.PRef | |
| type RefElement (PRef s a) | |
Defined in Data.Mutable.PRef | |
| type MCState (PRef s a) | |
Defined in Data.Mutable.PRef | |
Instances
| Storable a => MutableRef (SRef s a) | |
Defined in Data.Mutable.SRef Associated Types type RefElement (SRef s a) # Methods newRef :: (PrimMonad m, PrimState m ~ MCState (SRef s a)) => RefElement (SRef s a) -> m (SRef s a) # readRef :: (PrimMonad m, PrimState m ~ MCState (SRef s a)) => SRef s a -> m (RefElement (SRef s a)) # writeRef :: (PrimMonad m, PrimState m ~ MCState (SRef s a)) => SRef s a -> RefElement (SRef s a) -> m () # modifyRef :: (PrimMonad m, PrimState m ~ MCState (SRef s a)) => SRef s a -> (RefElement (SRef s a) -> RefElement (SRef s a)) -> m () # modifyRef' :: (PrimMonad m, PrimState m ~ MCState (SRef s a)) => SRef s a -> (RefElement (SRef s a) -> RefElement (SRef s a)) -> m () # | |
| MutableContainer (SRef s a) | |
Defined in Data.Mutable.SRef | |
| type RefElement (SRef s a) | |
Defined in Data.Mutable.SRef | |
| type MCState (SRef s a) | |
Defined in Data.Mutable.SRef | |
Instances
| Unbox a => MutableRef (URef s a) | |
Defined in Data.Mutable.URef Associated Types type RefElement (URef s a) # Methods newRef :: (PrimMonad m, PrimState m ~ MCState (URef s a)) => RefElement (URef s a) -> m (URef s a) # readRef :: (PrimMonad m, PrimState m ~ MCState (URef s a)) => URef s a -> m (RefElement (URef s a)) # writeRef :: (PrimMonad m, PrimState m ~ MCState (URef s a)) => URef s a -> RefElement (URef s a) -> m () # modifyRef :: (PrimMonad m, PrimState m ~ MCState (URef s a)) => URef s a -> (RefElement (URef s a) -> RefElement (URef s a)) -> m () # modifyRef' :: (PrimMonad m, PrimState m ~ MCState (URef s a)) => URef s a -> (RefElement (URef s a) -> RefElement (URef s a)) -> m () # | |
| MutableContainer (URef s a) | |
Defined in Data.Mutable.URef | |
| type RefElement (URef s a) | |
Defined in Data.Mutable.URef | |
| type MCState (URef s a) | |
Defined in Data.Mutable.URef | |
data WrappedMono mono a where #
Constructors
| WrappedMono :: forall mono a. Element mono ~ a => mono -> WrappedMono mono a |
Instances
newtype WrappedPoly (f :: Type -> Type) a #
Constructors
| WrappedPoly | |
Fields
| |
Instances
class MonoFoldable mono => GrowingAppend mono #
Instances
class MonoFunctor mono => MonoComonad mono where #
Instances
| IsSequence mono => MonoComonad (NonNull mono) | |
| MonoComonad (ViewL a) | |
| MonoComonad (ViewR a) | |
class MonoPointed mono where #
Minimal complete definition
Nothing
Instances
class (MonoFunctor mono, MonoFoldable mono) => MonoTraversable mono where #
Minimal complete definition
Nothing
Methods
otraverse :: Applicative f => (Element mono -> f (Element mono)) -> mono -> f mono #
omapM :: Applicative m => (Element mono -> m (Element mono)) -> mono -> m mono #
Instances
| MonoTraversable ByteString | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element ByteString -> f (Element ByteString)) -> ByteString -> f ByteString # omapM :: Applicative m => (Element ByteString -> m (Element ByteString)) -> ByteString -> m ByteString # | |
| MonoTraversable ByteString | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element ByteString -> f (Element ByteString)) -> ByteString -> f ByteString # omapM :: Applicative m => (Element ByteString -> m (Element ByteString)) -> ByteString -> m ByteString # | |
| MonoTraversable Text | |
| MonoTraversable Text | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element Text -> f (Element Text)) -> Text -> f Text # omapM :: Applicative m => (Element Text -> m (Element Text)) -> Text -> m Text # | |
| MonoTraversable [a] | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element [a] -> f (Element [a])) -> [a] -> f [a] # omapM :: Applicative m => (Element [a] -> m (Element [a])) -> [a] -> m [a] # | |
| MonoTraversable (Maybe a) | |
| MonoTraversable (Par1 a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Par1 a) -> f (Element (Par1 a))) -> Par1 a -> f (Par1 a) # omapM :: Applicative m => (Element (Par1 a) -> m (Element (Par1 a))) -> Par1 a -> m (Par1 a) # | |
| MonoTraversable mono => MonoTraversable (NonNull mono) | |
| MonoTraversable (Identity a) | |
| MonoTraversable (Vector a) | |
| MonoTraversable (IntMap a) | |
| MonoTraversable (Seq a) | |
| MonoTraversable (NonEmpty a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (NonEmpty a) -> f (Element (NonEmpty a))) -> NonEmpty a -> f (NonEmpty a) # omapM :: Applicative m => (Element (NonEmpty a) -> m (Element (NonEmpty a))) -> NonEmpty a -> m (NonEmpty a) # | |
| MonoTraversable (Tree a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Tree a) -> f (Element (Tree a))) -> Tree a -> f (Tree a) # omapM :: Applicative m => (Element (Tree a) -> m (Element (Tree a))) -> Tree a -> m (Tree a) # | |
| MonoTraversable (Option a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Option a) -> f (Element (Option a))) -> Option a -> f (Option a) # omapM :: Applicative m => (Element (Option a) -> m (Element (Option a))) -> Option a -> m (Option a) # | |
| Storable a => MonoTraversable (Vector a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Vector a) -> f (Element (Vector a))) -> Vector a -> f (Vector a) # omapM :: Applicative m => (Element (Vector a) -> m (Element (Vector a))) -> Vector a -> m (Vector a) # | |
| Unbox a => MonoTraversable (Vector a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Vector a) -> f (Element (Vector a))) -> Vector a -> f (Vector a) # omapM :: Applicative m => (Element (Vector a) -> m (Element (Vector a))) -> Vector a -> m (Vector a) # | |
| MonoTraversable (ViewL a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (ViewL a) -> f (Element (ViewL a))) -> ViewL a -> f (ViewL a) # omapM :: Applicative m => (Element (ViewL a) -> m (Element (ViewL a))) -> ViewL a -> m (ViewL a) # | |
| MonoTraversable (ViewR a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (ViewR a) -> f (Element (ViewR a))) -> ViewR a -> f (ViewR a) # omapM :: Applicative m => (Element (ViewR a) -> m (Element (ViewR a))) -> ViewR a -> m (ViewR a) # | |
| MonoTraversable (Either a b) | |
| MonoTraversable (V1 a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (V1 a) -> f (Element (V1 a))) -> V1 a -> f (V1 a) # omapM :: Applicative m => (Element (V1 a) -> m (Element (V1 a))) -> V1 a -> m (V1 a) # | |
| MonoTraversable (U1 a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (U1 a) -> f (Element (U1 a))) -> U1 a -> f (U1 a) # omapM :: Applicative m => (Element (U1 a) -> m (Element (U1 a))) -> U1 a -> m (U1 a) # | |
| MonoTraversable (a, b) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (a, b) -> f (Element (a, b))) -> (a, b) -> f (a, b) # omapM :: Applicative m => (Element (a, b) -> m (Element (a, b))) -> (a, b) -> m (a, b) # | |
| MonoTraversable (HashMap k v) | |
| MonoTraversable (Map k v) | |
| MonoTraversable (Proxy a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Proxy a) -> f (Element (Proxy a))) -> Proxy a -> f (Proxy a) # omapM :: Applicative m => (Element (Proxy a) -> m (Element (Proxy a))) -> Proxy a -> m (Proxy a) # | |
| Traversable f => MonoTraversable (ListT f a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (ListT f a) -> f0 (Element (ListT f a))) -> ListT f a -> f0 (ListT f a) # omapM :: Applicative m => (Element (ListT f a) -> m (Element (ListT f a))) -> ListT f a -> m (ListT f a) # | |
| Traversable f => MonoTraversable (MaybeT f a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (MaybeT f a) -> f0 (Element (MaybeT f a))) -> MaybeT f a -> f0 (MaybeT f a) # omapM :: Applicative m => (Element (MaybeT f a) -> m (Element (MaybeT f a))) -> MaybeT f a -> m (MaybeT f a) # | |
| Traversable f => MonoTraversable (Rec1 f a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (Rec1 f a) -> f0 (Element (Rec1 f a))) -> Rec1 f a -> f0 (Rec1 f a) # omapM :: Applicative m => (Element (Rec1 f a) -> m (Element (Rec1 f a))) -> Rec1 f a -> m (Rec1 f a) # | |
| Traversable f => MonoTraversable (WriterT w f a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (WriterT w f a) -> f0 (Element (WriterT w f a))) -> WriterT w f a -> f0 (WriterT w f a) # omapM :: Applicative m => (Element (WriterT w f a) -> m (Element (WriterT w f a))) -> WriterT w f a -> m (WriterT w f a) # | |
| Traversable f => MonoTraversable (IdentityT f a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (IdentityT f a) -> f0 (Element (IdentityT f a))) -> IdentityT f a -> f0 (IdentityT f a) # omapM :: Applicative m => (Element (IdentityT f a) -> m (Element (IdentityT f a))) -> IdentityT f a -> m (IdentityT f a) # | |
| MonoTraversable (Const m a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (Const m a) -> f (Element (Const m a))) -> Const m a -> f (Const m a) # omapM :: Applicative m0 => (Element (Const m a) -> m0 (Element (Const m a))) -> Const m a -> m0 (Const m a) # | |
| Traversable f => MonoTraversable (WriterT w f a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (WriterT w f a) -> f0 (Element (WriterT w f a))) -> WriterT w f a -> f0 (WriterT w f a) # omapM :: Applicative m => (Element (WriterT w f a) -> m (Element (WriterT w f a))) -> WriterT w f a -> m (WriterT w f a) # | |
| MonoTraversable (K1 i c a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f => (Element (K1 i c a) -> f (Element (K1 i c a))) -> K1 i c a -> f (K1 i c a) # omapM :: Applicative m => (Element (K1 i c a) -> m (Element (K1 i c a))) -> K1 i c a -> m (K1 i c a) # | |
| (Traversable f, Traversable g) => MonoTraversable ((f :+: g) a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element ((f :+: g) a) -> f0 (Element ((f :+: g) a))) -> (f :+: g) a -> f0 ((f :+: g) a) # omapM :: Applicative m => (Element ((f :+: g) a) -> m (Element ((f :+: g) a))) -> (f :+: g) a -> m ((f :+: g) a) # | |
| (Traversable f, Traversable g) => MonoTraversable ((f :*: g) a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element ((f :*: g) a) -> f0 (Element ((f :*: g) a))) -> (f :*: g) a -> f0 ((f :*: g) a) # omapM :: Applicative m => (Element ((f :*: g) a) -> m (Element ((f :*: g) a))) -> (f :*: g) a -> m ((f :*: g) a) # | |
| (Traversable f, Traversable g) => MonoTraversable (Product f g a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (Product f g a) -> f0 (Element (Product f g a))) -> Product f g a -> f0 (Product f g a) # omapM :: Applicative m => (Element (Product f g a) -> m (Element (Product f g a))) -> Product f g a -> m (Product f g a) # | |
| Traversable f => MonoTraversable (M1 i c f a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (M1 i c f a) -> f0 (Element (M1 i c f a))) -> M1 i c f a -> f0 (M1 i c f a) # omapM :: Applicative m => (Element (M1 i c f a) -> m (Element (M1 i c f a))) -> M1 i c f a -> m (M1 i c f a) # | |
| (Traversable f, Traversable g) => MonoTraversable ((f :.: g) a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element ((f :.: g) a) -> f0 (Element ((f :.: g) a))) -> (f :.: g) a -> f0 ((f :.: g) a) # omapM :: Applicative m => (Element ((f :.: g) a) -> m (Element ((f :.: g) a))) -> (f :.: g) a -> m ((f :.: g) a) # | |
| (Traversable f, Traversable g) => MonoTraversable (Compose f g a) | |
Defined in Data.MonoTraversable Methods otraverse :: Applicative f0 => (Element (Compose f g a) -> f0 (Element (Compose f g a))) -> Compose f g a -> f0 (Compose f g a) # omapM :: Applicative m => (Element (Compose f g a) -> m (Element (Compose f g a))) -> Compose f g a -> m (Compose f g a) # | |
class MonoFoldable mono where #
Minimal complete definition
Nothing
Methods
ofoldMap :: Monoid m => (Element mono -> m) -> mono -> m #
ofoldr :: (Element mono -> b -> b) -> b -> mono -> b #
ofoldl' :: (a -> Element mono -> a) -> a -> mono -> a #
otoList :: mono -> [Element mono] #
oall :: (Element mono -> Bool) -> mono -> Bool #
oany :: (Element mono -> Bool) -> mono -> Bool #
ocompareLength :: Integral i => mono -> i -> Ordering #
otraverse_ :: Applicative f => (Element mono -> f b) -> mono -> f () #
ofor_ :: Applicative f => mono -> (Element mono -> f b) -> f () #
omapM_ :: Applicative m => (Element mono -> m ()) -> mono -> m () #
oforM_ :: Applicative m => mono -> (Element mono -> m ()) -> m () #
ofoldlM :: Monad m => (a -> Element mono -> m a) -> a -> mono -> m a #
ofoldMap1Ex :: Semigroup m => (Element mono -> m) -> mono -> m #
ofoldr1Ex :: (Element mono -> Element mono -> Element mono) -> mono -> Element mono #
ofoldl1Ex' :: (Element mono -> Element mono -> Element mono) -> mono -> Element mono #
headEx :: mono -> Element mono #
lastEx :: mono -> Element mono #
unsafeHead :: mono -> Element mono #
unsafeLast :: mono -> Element mono #
maximumByEx :: (Element mono -> Element mono -> Ordering) -> mono -> Element mono #
minimumByEx :: (Element mono -> Element mono -> Ordering) -> mono -> Element mono #
Instances
| MonoFoldable ByteString | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element ByteString -> m) -> ByteString -> m # ofoldr :: (Element ByteString -> b -> b) -> b -> ByteString -> b # ofoldl' :: (a -> Element ByteString -> a) -> a -> ByteString -> a # otoList :: ByteString -> [Element ByteString] # oall :: (Element ByteString -> Bool) -> ByteString -> Bool # oany :: (Element ByteString -> Bool) -> ByteString -> Bool # onull :: ByteString -> Bool # olength :: ByteString -> Int # olength64 :: ByteString -> Int64 # ocompareLength :: Integral i => ByteString -> i -> Ordering # otraverse_ :: Applicative f => (Element ByteString -> f b) -> ByteString -> f () # ofor_ :: Applicative f => ByteString -> (Element ByteString -> f b) -> f () # omapM_ :: Applicative m => (Element ByteString -> m ()) -> ByteString -> m () # oforM_ :: Applicative m => ByteString -> (Element ByteString -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element ByteString -> m a) -> a -> ByteString -> m a # ofoldMap1Ex :: Semigroup m => (Element ByteString -> m) -> ByteString -> m # ofoldr1Ex :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString # ofoldl1Ex' :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString # headEx :: ByteString -> Element ByteString # lastEx :: ByteString -> Element ByteString # unsafeHead :: ByteString -> Element ByteString # unsafeLast :: ByteString -> Element ByteString # maximumByEx :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> Element ByteString # minimumByEx :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> Element ByteString # oelem :: Element ByteString -> ByteString -> Bool # onotElem :: Element ByteString -> ByteString -> Bool # | |
| MonoFoldable ByteString | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element ByteString -> m) -> ByteString -> m # ofoldr :: (Element ByteString -> b -> b) -> b -> ByteString -> b # ofoldl' :: (a -> Element ByteString -> a) -> a -> ByteString -> a # otoList :: ByteString -> [Element ByteString] # oall :: (Element ByteString -> Bool) -> ByteString -> Bool # oany :: (Element ByteString -> Bool) -> ByteString -> Bool # olength :: ByteString -> Int # olength64 :: ByteString -> Int64 # ocompareLength :: Integral i => ByteString -> i -> Ordering # otraverse_ :: Applicative f => (Element ByteString -> f b) -> ByteString -> f () # ofor_ :: Applicative f => ByteString -> (Element ByteString -> f b) -> f () # omapM_ :: Applicative m => (Element ByteString -> m ()) -> ByteString -> m () # oforM_ :: Applicative m => ByteString -> (Element ByteString -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element ByteString -> m a) -> a -> ByteString -> m a # ofoldMap1Ex :: Semigroup m => (Element ByteString -> m) -> ByteString -> m # ofoldr1Ex :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString # ofoldl1Ex' :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> Element ByteString # headEx :: ByteString -> Element ByteString # lastEx :: ByteString -> Element ByteString # unsafeHead :: ByteString -> Element ByteString # unsafeLast :: ByteString -> Element ByteString # maximumByEx :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> Element ByteString # minimumByEx :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> Element ByteString # | |
| MonoFoldable Text | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element Text -> m) -> Text -> m # ofoldr :: (Element Text -> b -> b) -> b -> Text -> b # ofoldl' :: (a -> Element Text -> a) -> a -> Text -> a # otoList :: Text -> [Element Text] # oall :: (Element Text -> Bool) -> Text -> Bool # oany :: (Element Text -> Bool) -> Text -> Bool # ocompareLength :: Integral i => Text -> i -> Ordering # otraverse_ :: Applicative f => (Element Text -> f b) -> Text -> f () # ofor_ :: Applicative f => Text -> (Element Text -> f b) -> f () # omapM_ :: Applicative m => (Element Text -> m ()) -> Text -> m () # oforM_ :: Applicative m => Text -> (Element Text -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element Text -> m a) -> a -> Text -> m a # ofoldMap1Ex :: Semigroup m => (Element Text -> m) -> Text -> m # ofoldr1Ex :: (Element Text -> Element Text -> Element Text) -> Text -> Element Text # ofoldl1Ex' :: (Element Text -> Element Text -> Element Text) -> Text -> Element Text # headEx :: Text -> Element Text # lastEx :: Text -> Element Text # unsafeHead :: Text -> Element Text # unsafeLast :: Text -> Element Text # maximumByEx :: (Element Text -> Element Text -> Ordering) -> Text -> Element Text # minimumByEx :: (Element Text -> Element Text -> Ordering) -> Text -> Element Text # | |
| MonoFoldable IntSet | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element IntSet -> m) -> IntSet -> m # ofoldr :: (Element IntSet -> b -> b) -> b -> IntSet -> b # ofoldl' :: (a -> Element IntSet -> a) -> a -> IntSet -> a # otoList :: IntSet -> [Element IntSet] # oall :: (Element IntSet -> Bool) -> IntSet -> Bool # oany :: (Element IntSet -> Bool) -> IntSet -> Bool # olength64 :: IntSet -> Int64 # ocompareLength :: Integral i => IntSet -> i -> Ordering # otraverse_ :: Applicative f => (Element IntSet -> f b) -> IntSet -> f () # ofor_ :: Applicative f => IntSet -> (Element IntSet -> f b) -> f () # omapM_ :: Applicative m => (Element IntSet -> m ()) -> IntSet -> m () # oforM_ :: Applicative m => IntSet -> (Element IntSet -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element IntSet -> m a) -> a -> IntSet -> m a # ofoldMap1Ex :: Semigroup m => (Element IntSet -> m) -> IntSet -> m # ofoldr1Ex :: (Element IntSet -> Element IntSet -> Element IntSet) -> IntSet -> Element IntSet # ofoldl1Ex' :: (Element IntSet -> Element IntSet -> Element IntSet) -> IntSet -> Element IntSet # headEx :: IntSet -> Element IntSet # lastEx :: IntSet -> Element IntSet # unsafeHead :: IntSet -> Element IntSet # unsafeLast :: IntSet -> Element IntSet # maximumByEx :: (Element IntSet -> Element IntSet -> Ordering) -> IntSet -> Element IntSet # minimumByEx :: (Element IntSet -> Element IntSet -> Ordering) -> IntSet -> Element IntSet # | |
| MonoFoldable Text | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element Text -> m) -> Text -> m # ofoldr :: (Element Text -> b -> b) -> b -> Text -> b # ofoldl' :: (a -> Element Text -> a) -> a -> Text -> a # otoList :: Text -> [Element Text] # oall :: (Element Text -> Bool) -> Text -> Bool # oany :: (Element Text -> Bool) -> Text -> Bool # ocompareLength :: Integral i => Text -> i -> Ordering # otraverse_ :: Applicative f => (Element Text -> f b) -> Text -> f () # ofor_ :: Applicative f => Text -> (Element Text -> f b) -> f () # omapM_ :: Applicative m => (Element Text -> m ()) -> Text -> m () # oforM_ :: Applicative m => Text -> (Element Text -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element Text -> m a) -> a -> Text -> m a # ofoldMap1Ex :: Semigroup m => (Element Text -> m) -> Text -> m # ofoldr1Ex :: (Element Text -> Element Text -> Element Text) -> Text -> Element Text # ofoldl1Ex' :: (Element Text -> Element Text -> Element Text) -> Text -> Element Text # headEx :: Text -> Element Text # lastEx :: Text -> Element Text # unsafeHead :: Text -> Element Text # unsafeLast :: Text -> Element Text # maximumByEx :: (Element Text -> Element Text -> Ordering) -> Text -> Element Text # minimumByEx :: (Element Text -> Element Text -> Ordering) -> Text -> Element Text # | |
| MonoFoldable [a] | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element [a] -> m) -> [a] -> m # ofoldr :: (Element [a] -> b -> b) -> b -> [a] -> b # ofoldl' :: (a0 -> Element [a] -> a0) -> a0 -> [a] -> a0 # otoList :: [a] -> [Element [a]] # oall :: (Element [a] -> Bool) -> [a] -> Bool # oany :: (Element [a] -> Bool) -> [a] -> Bool # ocompareLength :: Integral i => [a] -> i -> Ordering # otraverse_ :: Applicative f => (Element [a] -> f b) -> [a] -> f () # ofor_ :: Applicative f => [a] -> (Element [a] -> f b) -> f () # omapM_ :: Applicative m => (Element [a] -> m ()) -> [a] -> m () # oforM_ :: Applicative m => [a] -> (Element [a] -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element [a] -> m a0) -> a0 -> [a] -> m a0 # ofoldMap1Ex :: Semigroup m => (Element [a] -> m) -> [a] -> m # ofoldr1Ex :: (Element [a] -> Element [a] -> Element [a]) -> [a] -> Element [a] # ofoldl1Ex' :: (Element [a] -> Element [a] -> Element [a]) -> [a] -> Element [a] # headEx :: [a] -> Element [a] # lastEx :: [a] -> Element [a] # unsafeHead :: [a] -> Element [a] # unsafeLast :: [a] -> Element [a] # maximumByEx :: (Element [a] -> Element [a] -> Ordering) -> [a] -> Element [a] # minimumByEx :: (Element [a] -> Element [a] -> Ordering) -> [a] -> Element [a] # | |
| MonoFoldable (Maybe a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Maybe a) -> m) -> Maybe a -> m # ofoldr :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # ofoldl' :: (a0 -> Element (Maybe a) -> a0) -> a0 -> Maybe a -> a0 # otoList :: Maybe a -> [Element (Maybe a)] # oall :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # oany :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # olength64 :: Maybe a -> Int64 # ocompareLength :: Integral i => Maybe a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Maybe a) -> f b) -> Maybe a -> f () # ofor_ :: Applicative f => Maybe a -> (Element (Maybe a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Maybe a) -> m ()) -> Maybe a -> m () # oforM_ :: Applicative m => Maybe a -> (Element (Maybe a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Maybe a) -> m a0) -> a0 -> Maybe a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Maybe a) -> m) -> Maybe a -> m # ofoldr1Ex :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # ofoldl1Ex' :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # headEx :: Maybe a -> Element (Maybe a) # lastEx :: Maybe a -> Element (Maybe a) # unsafeHead :: Maybe a -> Element (Maybe a) # unsafeLast :: Maybe a -> Element (Maybe a) # maximumByEx :: (Element (Maybe a) -> Element (Maybe a) -> Ordering) -> Maybe a -> Element (Maybe a) # minimumByEx :: (Element (Maybe a) -> Element (Maybe a) -> Ordering) -> Maybe a -> Element (Maybe a) # | |
| MonoFoldable (Par1 a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Par1 a) -> m) -> Par1 a -> m # ofoldr :: (Element (Par1 a) -> b -> b) -> b -> Par1 a -> b # ofoldl' :: (a0 -> Element (Par1 a) -> a0) -> a0 -> Par1 a -> a0 # otoList :: Par1 a -> [Element (Par1 a)] # oall :: (Element (Par1 a) -> Bool) -> Par1 a -> Bool # oany :: (Element (Par1 a) -> Bool) -> Par1 a -> Bool # olength64 :: Par1 a -> Int64 # ocompareLength :: Integral i => Par1 a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Par1 a) -> f b) -> Par1 a -> f () # ofor_ :: Applicative f => Par1 a -> (Element (Par1 a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Par1 a) -> m ()) -> Par1 a -> m () # oforM_ :: Applicative m => Par1 a -> (Element (Par1 a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Par1 a) -> m a0) -> a0 -> Par1 a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Par1 a) -> m) -> Par1 a -> m # ofoldr1Ex :: (Element (Par1 a) -> Element (Par1 a) -> Element (Par1 a)) -> Par1 a -> Element (Par1 a) # ofoldl1Ex' :: (Element (Par1 a) -> Element (Par1 a) -> Element (Par1 a)) -> Par1 a -> Element (Par1 a) # headEx :: Par1 a -> Element (Par1 a) # lastEx :: Par1 a -> Element (Par1 a) # unsafeHead :: Par1 a -> Element (Par1 a) # unsafeLast :: Par1 a -> Element (Par1 a) # maximumByEx :: (Element (Par1 a) -> Element (Par1 a) -> Ordering) -> Par1 a -> Element (Par1 a) # minimumByEx :: (Element (Par1 a) -> Element (Par1 a) -> Ordering) -> Par1 a -> Element (Par1 a) # | |
| MonoFoldable mono => MonoFoldable (NonNull mono) | |
Defined in Data.NonNull Methods ofoldMap :: Monoid m => (Element (NonNull mono) -> m) -> NonNull mono -> m # ofoldr :: (Element (NonNull mono) -> b -> b) -> b -> NonNull mono -> b # ofoldl' :: (a -> Element (NonNull mono) -> a) -> a -> NonNull mono -> a # otoList :: NonNull mono -> [Element (NonNull mono)] # oall :: (Element (NonNull mono) -> Bool) -> NonNull mono -> Bool # oany :: (Element (NonNull mono) -> Bool) -> NonNull mono -> Bool # onull :: NonNull mono -> Bool # olength :: NonNull mono -> Int # olength64 :: NonNull mono -> Int64 # ocompareLength :: Integral i => NonNull mono -> i -> Ordering # otraverse_ :: Applicative f => (Element (NonNull mono) -> f b) -> NonNull mono -> f () # ofor_ :: Applicative f => NonNull mono -> (Element (NonNull mono) -> f b) -> f () # omapM_ :: Applicative m => (Element (NonNull mono) -> m ()) -> NonNull mono -> m () # oforM_ :: Applicative m => NonNull mono -> (Element (NonNull mono) -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element (NonNull mono) -> m a) -> a -> NonNull mono -> m a # ofoldMap1Ex :: Semigroup m => (Element (NonNull mono) -> m) -> NonNull mono -> m # ofoldr1Ex :: (Element (NonNull mono) -> Element (NonNull mono) -> Element (NonNull mono)) -> NonNull mono -> Element (NonNull mono) # ofoldl1Ex' :: (Element (NonNull mono) -> Element (NonNull mono) -> Element (NonNull mono)) -> NonNull mono -> Element (NonNull mono) # headEx :: NonNull mono -> Element (NonNull mono) # lastEx :: NonNull mono -> Element (NonNull mono) # unsafeHead :: NonNull mono -> Element (NonNull mono) # unsafeLast :: NonNull mono -> Element (NonNull mono) # maximumByEx :: (Element (NonNull mono) -> Element (NonNull mono) -> Ordering) -> NonNull mono -> Element (NonNull mono) # minimumByEx :: (Element (NonNull mono) -> Element (NonNull mono) -> Ordering) -> NonNull mono -> Element (NonNull mono) # oelem :: Element (NonNull mono) -> NonNull mono -> Bool # onotElem :: Element (NonNull mono) -> NonNull mono -> Bool # | |
| MonoFoldable (Identity a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Identity a) -> m) -> Identity a -> m # ofoldr :: (Element (Identity a) -> b -> b) -> b -> Identity a -> b # ofoldl' :: (a0 -> Element (Identity a) -> a0) -> a0 -> Identity a -> a0 # otoList :: Identity a -> [Element (Identity a)] # oall :: (Element (Identity a) -> Bool) -> Identity a -> Bool # oany :: (Element (Identity a) -> Bool) -> Identity a -> Bool # olength :: Identity a -> Int # olength64 :: Identity a -> Int64 # ocompareLength :: Integral i => Identity a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Identity a) -> f b) -> Identity a -> f () # ofor_ :: Applicative f => Identity a -> (Element (Identity a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Identity a) -> m ()) -> Identity a -> m () # oforM_ :: Applicative m => Identity a -> (Element (Identity a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Identity a) -> m a0) -> a0 -> Identity a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Identity a) -> m) -> Identity a -> m # ofoldr1Ex :: (Element (Identity a) -> Element (Identity a) -> Element (Identity a)) -> Identity a -> Element (Identity a) # ofoldl1Ex' :: (Element (Identity a) -> Element (Identity a) -> Element (Identity a)) -> Identity a -> Element (Identity a) # headEx :: Identity a -> Element (Identity a) # lastEx :: Identity a -> Element (Identity a) # unsafeHead :: Identity a -> Element (Identity a) # unsafeLast :: Identity a -> Element (Identity a) # maximumByEx :: (Element (Identity a) -> Element (Identity a) -> Ordering) -> Identity a -> Element (Identity a) # minimumByEx :: (Element (Identity a) -> Element (Identity a) -> Ordering) -> Identity a -> Element (Identity a) # | |
| MonoFoldable (HashSet e) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (HashSet e) -> m) -> HashSet e -> m # ofoldr :: (Element (HashSet e) -> b -> b) -> b -> HashSet e -> b # ofoldl' :: (a -> Element (HashSet e) -> a) -> a -> HashSet e -> a # otoList :: HashSet e -> [Element (HashSet e)] # oall :: (Element (HashSet e) -> Bool) -> HashSet e -> Bool # oany :: (Element (HashSet e) -> Bool) -> HashSet e -> Bool # olength64 :: HashSet e -> Int64 # ocompareLength :: Integral i => HashSet e -> i -> Ordering # otraverse_ :: Applicative f => (Element (HashSet e) -> f b) -> HashSet e -> f () # ofor_ :: Applicative f => HashSet e -> (Element (HashSet e) -> f b) -> f () # omapM_ :: Applicative m => (Element (HashSet e) -> m ()) -> HashSet e -> m () # oforM_ :: Applicative m => HashSet e -> (Element (HashSet e) -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element (HashSet e) -> m a) -> a -> HashSet e -> m a # ofoldMap1Ex :: Semigroup m => (Element (HashSet e) -> m) -> HashSet e -> m # ofoldr1Ex :: (Element (HashSet e) -> Element (HashSet e) -> Element (HashSet e)) -> HashSet e -> Element (HashSet e) # ofoldl1Ex' :: (Element (HashSet e) -> Element (HashSet e) -> Element (HashSet e)) -> HashSet e -> Element (HashSet e) # headEx :: HashSet e -> Element (HashSet e) # lastEx :: HashSet e -> Element (HashSet e) # unsafeHead :: HashSet e -> Element (HashSet e) # unsafeLast :: HashSet e -> Element (HashSet e) # maximumByEx :: (Element (HashSet e) -> Element (HashSet e) -> Ordering) -> HashSet e -> Element (HashSet e) # minimumByEx :: (Element (HashSet e) -> Element (HashSet e) -> Ordering) -> HashSet e -> Element (HashSet e) # | |
| MonoFoldable (Vector a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr :: (Element (Vector a) -> b -> b) -> b -> Vector a -> b # ofoldl' :: (a0 -> Element (Vector a) -> a0) -> a0 -> Vector a -> a0 # otoList :: Vector a -> [Element (Vector a)] # oall :: (Element (Vector a) -> Bool) -> Vector a -> Bool # oany :: (Element (Vector a) -> Bool) -> Vector a -> Bool # olength64 :: Vector a -> Int64 # ocompareLength :: Integral i => Vector a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Vector a) -> f b) -> Vector a -> f () # ofor_ :: Applicative f => Vector a -> (Element (Vector a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Vector a) -> m ()) -> Vector a -> m () # oforM_ :: Applicative m => Vector a -> (Element (Vector a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Vector a) -> m a0) -> a0 -> Vector a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr1Ex :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # ofoldl1Ex' :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # headEx :: Vector a -> Element (Vector a) # lastEx :: Vector a -> Element (Vector a) # unsafeHead :: Vector a -> Element (Vector a) # unsafeLast :: Vector a -> Element (Vector a) # maximumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # minimumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # | |
| Ord e => MonoFoldable (Set e) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Set e) -> m) -> Set e -> m # ofoldr :: (Element (Set e) -> b -> b) -> b -> Set e -> b # ofoldl' :: (a -> Element (Set e) -> a) -> a -> Set e -> a # otoList :: Set e -> [Element (Set e)] # oall :: (Element (Set e) -> Bool) -> Set e -> Bool # oany :: (Element (Set e) -> Bool) -> Set e -> Bool # ocompareLength :: Integral i => Set e -> i -> Ordering # otraverse_ :: Applicative f => (Element (Set e) -> f b) -> Set e -> f () # ofor_ :: Applicative f => Set e -> (Element (Set e) -> f b) -> f () # omapM_ :: Applicative m => (Element (Set e) -> m ()) -> Set e -> m () # oforM_ :: Applicative m => Set e -> (Element (Set e) -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element (Set e) -> m a) -> a -> Set e -> m a # ofoldMap1Ex :: Semigroup m => (Element (Set e) -> m) -> Set e -> m # ofoldr1Ex :: (Element (Set e) -> Element (Set e) -> Element (Set e)) -> Set e -> Element (Set e) # ofoldl1Ex' :: (Element (Set e) -> Element (Set e) -> Element (Set e)) -> Set e -> Element (Set e) # headEx :: Set e -> Element (Set e) # lastEx :: Set e -> Element (Set e) # unsafeHead :: Set e -> Element (Set e) # unsafeLast :: Set e -> Element (Set e) # maximumByEx :: (Element (Set e) -> Element (Set e) -> Ordering) -> Set e -> Element (Set e) # minimumByEx :: (Element (Set e) -> Element (Set e) -> Ordering) -> Set e -> Element (Set e) # | |
| MonoFoldable (IntMap a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (IntMap a) -> m) -> IntMap a -> m # ofoldr :: (Element (IntMap a) -> b -> b) -> b -> IntMap a -> b # ofoldl' :: (a0 -> Element (IntMap a) -> a0) -> a0 -> IntMap a -> a0 # otoList :: IntMap a -> [Element (IntMap a)] # oall :: (Element (IntMap a) -> Bool) -> IntMap a -> Bool # oany :: (Element (IntMap a) -> Bool) -> IntMap a -> Bool # olength64 :: IntMap a -> Int64 # ocompareLength :: Integral i => IntMap a -> i -> Ordering # otraverse_ :: Applicative f => (Element (IntMap a) -> f b) -> IntMap a -> f () # ofor_ :: Applicative f => IntMap a -> (Element (IntMap a) -> f b) -> f () # omapM_ :: Applicative m => (Element (IntMap a) -> m ()) -> IntMap a -> m () # oforM_ :: Applicative m => IntMap a -> (Element (IntMap a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (IntMap a) -> m a0) -> a0 -> IntMap a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (IntMap a) -> m) -> IntMap a -> m # ofoldr1Ex :: (Element (IntMap a) -> Element (IntMap a) -> Element (IntMap a)) -> IntMap a -> Element (IntMap a) # ofoldl1Ex' :: (Element (IntMap a) -> Element (IntMap a) -> Element (IntMap a)) -> IntMap a -> Element (IntMap a) # headEx :: IntMap a -> Element (IntMap a) # lastEx :: IntMap a -> Element (IntMap a) # unsafeHead :: IntMap a -> Element (IntMap a) # unsafeLast :: IntMap a -> Element (IntMap a) # maximumByEx :: (Element (IntMap a) -> Element (IntMap a) -> Ordering) -> IntMap a -> Element (IntMap a) # minimumByEx :: (Element (IntMap a) -> Element (IntMap a) -> Ordering) -> IntMap a -> Element (IntMap a) # | |
| MonoFoldable (Seq a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Seq a) -> m) -> Seq a -> m # ofoldr :: (Element (Seq a) -> b -> b) -> b -> Seq a -> b # ofoldl' :: (a0 -> Element (Seq a) -> a0) -> a0 -> Seq a -> a0 # otoList :: Seq a -> [Element (Seq a)] # oall :: (Element (Seq a) -> Bool) -> Seq a -> Bool # oany :: (Element (Seq a) -> Bool) -> Seq a -> Bool # ocompareLength :: Integral i => Seq a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Seq a) -> f b) -> Seq a -> f () # ofor_ :: Applicative f => Seq a -> (Element (Seq a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Seq a) -> m ()) -> Seq a -> m () # oforM_ :: Applicative m => Seq a -> (Element (Seq a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Seq a) -> m a0) -> a0 -> Seq a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Seq a) -> m) -> Seq a -> m # ofoldr1Ex :: (Element (Seq a) -> Element (Seq a) -> Element (Seq a)) -> Seq a -> Element (Seq a) # ofoldl1Ex' :: (Element (Seq a) -> Element (Seq a) -> Element (Seq a)) -> Seq a -> Element (Seq a) # headEx :: Seq a -> Element (Seq a) # lastEx :: Seq a -> Element (Seq a) # unsafeHead :: Seq a -> Element (Seq a) # unsafeLast :: Seq a -> Element (Seq a) # maximumByEx :: (Element (Seq a) -> Element (Seq a) -> Ordering) -> Seq a -> Element (Seq a) # minimumByEx :: (Element (Seq a) -> Element (Seq a) -> Ordering) -> Seq a -> Element (Seq a) # | |
| MonoFoldable (NonEmpty a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (NonEmpty a) -> m) -> NonEmpty a -> m # ofoldr :: (Element (NonEmpty a) -> b -> b) -> b -> NonEmpty a -> b # ofoldl' :: (a0 -> Element (NonEmpty a) -> a0) -> a0 -> NonEmpty a -> a0 # otoList :: NonEmpty a -> [Element (NonEmpty a)] # oall :: (Element (NonEmpty a) -> Bool) -> NonEmpty a -> Bool # oany :: (Element (NonEmpty a) -> Bool) -> NonEmpty a -> Bool # olength :: NonEmpty a -> Int # olength64 :: NonEmpty a -> Int64 # ocompareLength :: Integral i => NonEmpty a -> i -> Ordering # otraverse_ :: Applicative f => (Element (NonEmpty a) -> f b) -> NonEmpty a -> f () # ofor_ :: Applicative f => NonEmpty a -> (Element (NonEmpty a) -> f b) -> f () # omapM_ :: Applicative m => (Element (NonEmpty a) -> m ()) -> NonEmpty a -> m () # oforM_ :: Applicative m => NonEmpty a -> (Element (NonEmpty a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (NonEmpty a) -> m a0) -> a0 -> NonEmpty a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (NonEmpty a) -> m) -> NonEmpty a -> m # ofoldr1Ex :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Element (NonEmpty a)) -> NonEmpty a -> Element (NonEmpty a) # ofoldl1Ex' :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Element (NonEmpty a)) -> NonEmpty a -> Element (NonEmpty a) # headEx :: NonEmpty a -> Element (NonEmpty a) # lastEx :: NonEmpty a -> Element (NonEmpty a) # unsafeHead :: NonEmpty a -> Element (NonEmpty a) # unsafeLast :: NonEmpty a -> Element (NonEmpty a) # maximumByEx :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Ordering) -> NonEmpty a -> Element (NonEmpty a) # minimumByEx :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Ordering) -> NonEmpty a -> Element (NonEmpty a) # | |
| MonoFoldable (Tree a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Tree a) -> m) -> Tree a -> m # ofoldr :: (Element (Tree a) -> b -> b) -> b -> Tree a -> b # ofoldl' :: (a0 -> Element (Tree a) -> a0) -> a0 -> Tree a -> a0 # otoList :: Tree a -> [Element (Tree a)] # oall :: (Element (Tree a) -> Bool) -> Tree a -> Bool # oany :: (Element (Tree a) -> Bool) -> Tree a -> Bool # olength64 :: Tree a -> Int64 # ocompareLength :: Integral i => Tree a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Tree a) -> f b) -> Tree a -> f () # ofor_ :: Applicative f => Tree a -> (Element (Tree a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Tree a) -> m ()) -> Tree a -> m () # oforM_ :: Applicative m => Tree a -> (Element (Tree a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Tree a) -> m a0) -> a0 -> Tree a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Tree a) -> m) -> Tree a -> m # ofoldr1Ex :: (Element (Tree a) -> Element (Tree a) -> Element (Tree a)) -> Tree a -> Element (Tree a) # ofoldl1Ex' :: (Element (Tree a) -> Element (Tree a) -> Element (Tree a)) -> Tree a -> Element (Tree a) # headEx :: Tree a -> Element (Tree a) # lastEx :: Tree a -> Element (Tree a) # unsafeHead :: Tree a -> Element (Tree a) # unsafeLast :: Tree a -> Element (Tree a) # maximumByEx :: (Element (Tree a) -> Element (Tree a) -> Ordering) -> Tree a -> Element (Tree a) # minimumByEx :: (Element (Tree a) -> Element (Tree a) -> Ordering) -> Tree a -> Element (Tree a) # | |
| MonoFoldable (Option a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Option a) -> m) -> Option a -> m # ofoldr :: (Element (Option a) -> b -> b) -> b -> Option a -> b # ofoldl' :: (a0 -> Element (Option a) -> a0) -> a0 -> Option a -> a0 # otoList :: Option a -> [Element (Option a)] # oall :: (Element (Option a) -> Bool) -> Option a -> Bool # oany :: (Element (Option a) -> Bool) -> Option a -> Bool # olength64 :: Option a -> Int64 # ocompareLength :: Integral i => Option a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Option a) -> f b) -> Option a -> f () # ofor_ :: Applicative f => Option a -> (Element (Option a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Option a) -> m ()) -> Option a -> m () # oforM_ :: Applicative m => Option a -> (Element (Option a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Option a) -> m a0) -> a0 -> Option a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Option a) -> m) -> Option a -> m # ofoldr1Ex :: (Element (Option a) -> Element (Option a) -> Element (Option a)) -> Option a -> Element (Option a) # ofoldl1Ex' :: (Element (Option a) -> Element (Option a) -> Element (Option a)) -> Option a -> Element (Option a) # headEx :: Option a -> Element (Option a) # lastEx :: Option a -> Element (Option a) # unsafeHead :: Option a -> Element (Option a) # unsafeLast :: Option a -> Element (Option a) # maximumByEx :: (Element (Option a) -> Element (Option a) -> Ordering) -> Option a -> Element (Option a) # minimumByEx :: (Element (Option a) -> Element (Option a) -> Ordering) -> Option a -> Element (Option a) # | |
| Storable a => MonoFoldable (Vector a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr :: (Element (Vector a) -> b -> b) -> b -> Vector a -> b # ofoldl' :: (a0 -> Element (Vector a) -> a0) -> a0 -> Vector a -> a0 # otoList :: Vector a -> [Element (Vector a)] # oall :: (Element (Vector a) -> Bool) -> Vector a -> Bool # oany :: (Element (Vector a) -> Bool) -> Vector a -> Bool # olength64 :: Vector a -> Int64 # ocompareLength :: Integral i => Vector a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Vector a) -> f b) -> Vector a -> f () # ofor_ :: Applicative f => Vector a -> (Element (Vector a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Vector a) -> m ()) -> Vector a -> m () # oforM_ :: Applicative m => Vector a -> (Element (Vector a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Vector a) -> m a0) -> a0 -> Vector a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr1Ex :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # ofoldl1Ex' :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # headEx :: Vector a -> Element (Vector a) # lastEx :: Vector a -> Element (Vector a) # unsafeHead :: Vector a -> Element (Vector a) # unsafeLast :: Vector a -> Element (Vector a) # maximumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # minimumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # | |
| Unbox a => MonoFoldable (Vector a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr :: (Element (Vector a) -> b -> b) -> b -> Vector a -> b # ofoldl' :: (a0 -> Element (Vector a) -> a0) -> a0 -> Vector a -> a0 # otoList :: Vector a -> [Element (Vector a)] # oall :: (Element (Vector a) -> Bool) -> Vector a -> Bool # oany :: (Element (Vector a) -> Bool) -> Vector a -> Bool # olength64 :: Vector a -> Int64 # ocompareLength :: Integral i => Vector a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Vector a) -> f b) -> Vector a -> f () # ofor_ :: Applicative f => Vector a -> (Element (Vector a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Vector a) -> m ()) -> Vector a -> m () # oforM_ :: Applicative m => Vector a -> (Element (Vector a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Vector a) -> m a0) -> a0 -> Vector a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr1Ex :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # ofoldl1Ex' :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # headEx :: Vector a -> Element (Vector a) # lastEx :: Vector a -> Element (Vector a) # unsafeHead :: Vector a -> Element (Vector a) # unsafeLast :: Vector a -> Element (Vector a) # maximumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # minimumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # | |
| MonoFoldable (ViewL a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (ViewL a) -> m) -> ViewL a -> m # ofoldr :: (Element (ViewL a) -> b -> b) -> b -> ViewL a -> b # ofoldl' :: (a0 -> Element (ViewL a) -> a0) -> a0 -> ViewL a -> a0 # otoList :: ViewL a -> [Element (ViewL a)] # oall :: (Element (ViewL a) -> Bool) -> ViewL a -> Bool # oany :: (Element (ViewL a) -> Bool) -> ViewL a -> Bool # olength64 :: ViewL a -> Int64 # ocompareLength :: Integral i => ViewL a -> i -> Ordering # otraverse_ :: Applicative f => (Element (ViewL a) -> f b) -> ViewL a -> f () # ofor_ :: Applicative f => ViewL a -> (Element (ViewL a) -> f b) -> f () # omapM_ :: Applicative m => (Element (ViewL a) -> m ()) -> ViewL a -> m () # oforM_ :: Applicative m => ViewL a -> (Element (ViewL a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (ViewL a) -> m a0) -> a0 -> ViewL a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (ViewL a) -> m) -> ViewL a -> m # ofoldr1Ex :: (Element (ViewL a) -> Element (ViewL a) -> Element (ViewL a)) -> ViewL a -> Element (ViewL a) # ofoldl1Ex' :: (Element (ViewL a) -> Element (ViewL a) -> Element (ViewL a)) -> ViewL a -> Element (ViewL a) # headEx :: ViewL a -> Element (ViewL a) # lastEx :: ViewL a -> Element (ViewL a) # unsafeHead :: ViewL a -> Element (ViewL a) # unsafeLast :: ViewL a -> Element (ViewL a) # maximumByEx :: (Element (ViewL a) -> Element (ViewL a) -> Ordering) -> ViewL a -> Element (ViewL a) # minimumByEx :: (Element (ViewL a) -> Element (ViewL a) -> Ordering) -> ViewL a -> Element (ViewL a) # | |
| MonoFoldable (ViewR a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (ViewR a) -> m) -> ViewR a -> m # ofoldr :: (Element (ViewR a) -> b -> b) -> b -> ViewR a -> b # ofoldl' :: (a0 -> Element (ViewR a) -> a0) -> a0 -> ViewR a -> a0 # otoList :: ViewR a -> [Element (ViewR a)] # oall :: (Element (ViewR a) -> Bool) -> ViewR a -> Bool # oany :: (Element (ViewR a) -> Bool) -> ViewR a -> Bool # olength64 :: ViewR a -> Int64 # ocompareLength :: Integral i => ViewR a -> i -> Ordering # otraverse_ :: Applicative f => (Element (ViewR a) -> f b) -> ViewR a -> f () # ofor_ :: Applicative f => ViewR a -> (Element (ViewR a) -> f b) -> f () # omapM_ :: Applicative m => (Element (ViewR a) -> m ()) -> ViewR a -> m () # oforM_ :: Applicative m => ViewR a -> (Element (ViewR a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (ViewR a) -> m a0) -> a0 -> ViewR a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (ViewR a) -> m) -> ViewR a -> m # ofoldr1Ex :: (Element (ViewR a) -> Element (ViewR a) -> Element (ViewR a)) -> ViewR a -> Element (ViewR a) # ofoldl1Ex' :: (Element (ViewR a) -> Element (ViewR a) -> Element (ViewR a)) -> ViewR a -> Element (ViewR a) # headEx :: ViewR a -> Element (ViewR a) # lastEx :: ViewR a -> Element (ViewR a) # unsafeHead :: ViewR a -> Element (ViewR a) # unsafeLast :: ViewR a -> Element (ViewR a) # maximumByEx :: (Element (ViewR a) -> Element (ViewR a) -> Ordering) -> ViewR a -> Element (ViewR a) # minimumByEx :: (Element (ViewR a) -> Element (ViewR a) -> Ordering) -> ViewR a -> Element (ViewR a) # | |
| MonoFoldable (Either a b) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Either a b) -> m) -> Either a b -> m # ofoldr :: (Element (Either a b) -> b0 -> b0) -> b0 -> Either a b -> b0 # ofoldl' :: (a0 -> Element (Either a b) -> a0) -> a0 -> Either a b -> a0 # otoList :: Either a b -> [Element (Either a b)] # oall :: (Element (Either a b) -> Bool) -> Either a b -> Bool # oany :: (Element (Either a b) -> Bool) -> Either a b -> Bool # olength :: Either a b -> Int # olength64 :: Either a b -> Int64 # ocompareLength :: Integral i => Either a b -> i -> Ordering # otraverse_ :: Applicative f => (Element (Either a b) -> f b0) -> Either a b -> f () # ofor_ :: Applicative f => Either a b -> (Element (Either a b) -> f b0) -> f () # omapM_ :: Applicative m => (Element (Either a b) -> m ()) -> Either a b -> m () # oforM_ :: Applicative m => Either a b -> (Element (Either a b) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Either a b) -> m a0) -> a0 -> Either a b -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Either a b) -> m) -> Either a b -> m # ofoldr1Ex :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Element (Either a b) # ofoldl1Ex' :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Element (Either a b) # headEx :: Either a b -> Element (Either a b) # lastEx :: Either a b -> Element (Either a b) # unsafeHead :: Either a b -> Element (Either a b) # unsafeLast :: Either a b -> Element (Either a b) # maximumByEx :: (Element (Either a b) -> Element (Either a b) -> Ordering) -> Either a b -> Element (Either a b) # minimumByEx :: (Element (Either a b) -> Element (Either a b) -> Ordering) -> Either a b -> Element (Either a b) # | |
| MonoFoldable (V1 a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (V1 a) -> m) -> V1 a -> m # ofoldr :: (Element (V1 a) -> b -> b) -> b -> V1 a -> b # ofoldl' :: (a0 -> Element (V1 a) -> a0) -> a0 -> V1 a -> a0 # otoList :: V1 a -> [Element (V1 a)] # oall :: (Element (V1 a) -> Bool) -> V1 a -> Bool # oany :: (Element (V1 a) -> Bool) -> V1 a -> Bool # ocompareLength :: Integral i => V1 a -> i -> Ordering # otraverse_ :: Applicative f => (Element (V1 a) -> f b) -> V1 a -> f () # ofor_ :: Applicative f => V1 a -> (Element (V1 a) -> f b) -> f () # omapM_ :: Applicative m => (Element (V1 a) -> m ()) -> V1 a -> m () # oforM_ :: Applicative m => V1 a -> (Element (V1 a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (V1 a) -> m a0) -> a0 -> V1 a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (V1 a) -> m) -> V1 a -> m # ofoldr1Ex :: (Element (V1 a) -> Element (V1 a) -> Element (V1 a)) -> V1 a -> Element (V1 a) # ofoldl1Ex' :: (Element (V1 a) -> Element (V1 a) -> Element (V1 a)) -> V1 a -> Element (V1 a) # headEx :: V1 a -> Element (V1 a) # lastEx :: V1 a -> Element (V1 a) # unsafeHead :: V1 a -> Element (V1 a) # unsafeLast :: V1 a -> Element (V1 a) # maximumByEx :: (Element (V1 a) -> Element (V1 a) -> Ordering) -> V1 a -> Element (V1 a) # minimumByEx :: (Element (V1 a) -> Element (V1 a) -> Ordering) -> V1 a -> Element (V1 a) # | |
| MonoFoldable (U1 a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (U1 a) -> m) -> U1 a -> m # ofoldr :: (Element (U1 a) -> b -> b) -> b -> U1 a -> b # ofoldl' :: (a0 -> Element (U1 a) -> a0) -> a0 -> U1 a -> a0 # otoList :: U1 a -> [Element (U1 a)] # oall :: (Element (U1 a) -> Bool) -> U1 a -> Bool # oany :: (Element (U1 a) -> Bool) -> U1 a -> Bool # ocompareLength :: Integral i => U1 a -> i -> Ordering # otraverse_ :: Applicative f => (Element (U1 a) -> f b) -> U1 a -> f () # ofor_ :: Applicative f => U1 a -> (Element (U1 a) -> f b) -> f () # omapM_ :: Applicative m => (Element (U1 a) -> m ()) -> U1 a -> m () # oforM_ :: Applicative m => U1 a -> (Element (U1 a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (U1 a) -> m a0) -> a0 -> U1 a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (U1 a) -> m) -> U1 a -> m # ofoldr1Ex :: (Element (U1 a) -> Element (U1 a) -> Element (U1 a)) -> U1 a -> Element (U1 a) # ofoldl1Ex' :: (Element (U1 a) -> Element (U1 a) -> Element (U1 a)) -> U1 a -> Element (U1 a) # headEx :: U1 a -> Element (U1 a) # lastEx :: U1 a -> Element (U1 a) # unsafeHead :: U1 a -> Element (U1 a) # unsafeLast :: U1 a -> Element (U1 a) # maximumByEx :: (Element (U1 a) -> Element (U1 a) -> Ordering) -> U1 a -> Element (U1 a) # minimumByEx :: (Element (U1 a) -> Element (U1 a) -> Ordering) -> U1 a -> Element (U1 a) # | |
| MonoFoldable (a, b) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (a, b) -> m) -> (a, b) -> m # ofoldr :: (Element (a, b) -> b0 -> b0) -> b0 -> (a, b) -> b0 # ofoldl' :: (a0 -> Element (a, b) -> a0) -> a0 -> (a, b) -> a0 # otoList :: (a, b) -> [Element (a, b)] # oall :: (Element (a, b) -> Bool) -> (a, b) -> Bool # oany :: (Element (a, b) -> Bool) -> (a, b) -> Bool # olength64 :: (a, b) -> Int64 # ocompareLength :: Integral i => (a, b) -> i -> Ordering # otraverse_ :: Applicative f => (Element (a, b) -> f b0) -> (a, b) -> f () # ofor_ :: Applicative f => (a, b) -> (Element (a, b) -> f b0) -> f () # omapM_ :: Applicative m => (Element (a, b) -> m ()) -> (a, b) -> m () # oforM_ :: Applicative m => (a, b) -> (Element (a, b) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (a, b) -> m a0) -> a0 -> (a, b) -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (a, b) -> m) -> (a, b) -> m # ofoldr1Ex :: (Element (a, b) -> Element (a, b) -> Element (a, b)) -> (a, b) -> Element (a, b) # ofoldl1Ex' :: (Element (a, b) -> Element (a, b) -> Element (a, b)) -> (a, b) -> Element (a, b) # headEx :: (a, b) -> Element (a, b) # lastEx :: (a, b) -> Element (a, b) # unsafeHead :: (a, b) -> Element (a, b) # unsafeLast :: (a, b) -> Element (a, b) # maximumByEx :: (Element (a, b) -> Element (a, b) -> Ordering) -> (a, b) -> Element (a, b) # minimumByEx :: (Element (a, b) -> Element (a, b) -> Ordering) -> (a, b) -> Element (a, b) # | |
| MonoFoldable (HashMap k v) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (HashMap k v) -> m) -> HashMap k v -> m # ofoldr :: (Element (HashMap k v) -> b -> b) -> b -> HashMap k v -> b # ofoldl' :: (a -> Element (HashMap k v) -> a) -> a -> HashMap k v -> a # otoList :: HashMap k v -> [Element (HashMap k v)] # oall :: (Element (HashMap k v) -> Bool) -> HashMap k v -> Bool # oany :: (Element (HashMap k v) -> Bool) -> HashMap k v -> Bool # onull :: HashMap k v -> Bool # olength :: HashMap k v -> Int # olength64 :: HashMap k v -> Int64 # ocompareLength :: Integral i => HashMap k v -> i -> Ordering # otraverse_ :: Applicative f => (Element (HashMap k v) -> f b) -> HashMap k v -> f () # ofor_ :: Applicative f => HashMap k v -> (Element (HashMap k v) -> f b) -> f () # omapM_ :: Applicative m => (Element (HashMap k v) -> m ()) -> HashMap k v -> m () # oforM_ :: Applicative m => HashMap k v -> (Element (HashMap k v) -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element (HashMap k v) -> m a) -> a -> HashMap k v -> m a # ofoldMap1Ex :: Semigroup m => (Element (HashMap k v) -> m) -> HashMap k v -> m # ofoldr1Ex :: (Element (HashMap k v) -> Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> Element (HashMap k v) # ofoldl1Ex' :: (Element (HashMap k v) -> Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> Element (HashMap k v) # headEx :: HashMap k v -> Element (HashMap k v) # lastEx :: HashMap k v -> Element (HashMap k v) # unsafeHead :: HashMap k v -> Element (HashMap k v) # unsafeLast :: HashMap k v -> Element (HashMap k v) # maximumByEx :: (Element (HashMap k v) -> Element (HashMap k v) -> Ordering) -> HashMap k v -> Element (HashMap k v) # minimumByEx :: (Element (HashMap k v) -> Element (HashMap k v) -> Ordering) -> HashMap k v -> Element (HashMap k v) # | |
| MonoFoldable (Map k v) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Map k v) -> m) -> Map k v -> m # ofoldr :: (Element (Map k v) -> b -> b) -> b -> Map k v -> b # ofoldl' :: (a -> Element (Map k v) -> a) -> a -> Map k v -> a # otoList :: Map k v -> [Element (Map k v)] # oall :: (Element (Map k v) -> Bool) -> Map k v -> Bool # oany :: (Element (Map k v) -> Bool) -> Map k v -> Bool # olength64 :: Map k v -> Int64 # ocompareLength :: Integral i => Map k v -> i -> Ordering # otraverse_ :: Applicative f => (Element (Map k v) -> f b) -> Map k v -> f () # ofor_ :: Applicative f => Map k v -> (Element (Map k v) -> f b) -> f () # omapM_ :: Applicative m => (Element (Map k v) -> m ()) -> Map k v -> m () # oforM_ :: Applicative m => Map k v -> (Element (Map k v) -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element (Map k v) -> m a) -> a -> Map k v -> m a # ofoldMap1Ex :: Semigroup m => (Element (Map k v) -> m) -> Map k v -> m # ofoldr1Ex :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Element (Map k v) # ofoldl1Ex' :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Element (Map k v) # headEx :: Map k v -> Element (Map k v) # lastEx :: Map k v -> Element (Map k v) # unsafeHead :: Map k v -> Element (Map k v) # unsafeLast :: Map k v -> Element (Map k v) # maximumByEx :: (Element (Map k v) -> Element (Map k v) -> Ordering) -> Map k v -> Element (Map k v) # minimumByEx :: (Element (Map k v) -> Element (Map k v) -> Ordering) -> Map k v -> Element (Map k v) # | |
| MonoFoldable mono => MonoFoldable (WrappedMono mono a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (WrappedMono mono a) -> m) -> WrappedMono mono a -> m # ofoldr :: (Element (WrappedMono mono a) -> b -> b) -> b -> WrappedMono mono a -> b # ofoldl' :: (a0 -> Element (WrappedMono mono a) -> a0) -> a0 -> WrappedMono mono a -> a0 # otoList :: WrappedMono mono a -> [Element (WrappedMono mono a)] # oall :: (Element (WrappedMono mono a) -> Bool) -> WrappedMono mono a -> Bool # oany :: (Element (WrappedMono mono a) -> Bool) -> WrappedMono mono a -> Bool # onull :: WrappedMono mono a -> Bool # olength :: WrappedMono mono a -> Int # olength64 :: WrappedMono mono a -> Int64 # ocompareLength :: Integral i => WrappedMono mono a -> i -> Ordering # otraverse_ :: Applicative f => (Element (WrappedMono mono a) -> f b) -> WrappedMono mono a -> f () # ofor_ :: Applicative f => WrappedMono mono a -> (Element (WrappedMono mono a) -> f b) -> f () # omapM_ :: Applicative m => (Element (WrappedMono mono a) -> m ()) -> WrappedMono mono a -> m () # oforM_ :: Applicative m => WrappedMono mono a -> (Element (WrappedMono mono a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (WrappedMono mono a) -> m a0) -> a0 -> WrappedMono mono a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (WrappedMono mono a) -> m) -> WrappedMono mono a -> m # ofoldr1Ex :: (Element (WrappedMono mono a) -> Element (WrappedMono mono a) -> Element (WrappedMono mono a)) -> WrappedMono mono a -> Element (WrappedMono mono a) # ofoldl1Ex' :: (Element (WrappedMono mono a) -> Element (WrappedMono mono a) -> Element (WrappedMono mono a)) -> WrappedMono mono a -> Element (WrappedMono mono a) # headEx :: WrappedMono mono a -> Element (WrappedMono mono a) # lastEx :: WrappedMono mono a -> Element (WrappedMono mono a) # unsafeHead :: WrappedMono mono a -> Element (WrappedMono mono a) # unsafeLast :: WrappedMono mono a -> Element (WrappedMono mono a) # maximumByEx :: (Element (WrappedMono mono a) -> Element (WrappedMono mono a) -> Ordering) -> WrappedMono mono a -> Element (WrappedMono mono a) # minimumByEx :: (Element (WrappedMono mono a) -> Element (WrappedMono mono a) -> Ordering) -> WrappedMono mono a -> Element (WrappedMono mono a) # oelem :: Element (WrappedMono mono a) -> WrappedMono mono a -> Bool # onotElem :: Element (WrappedMono mono a) -> WrappedMono mono a -> Bool # | |
| Foldable f => MonoFoldable (WrappedPoly f a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (WrappedPoly f a) -> m) -> WrappedPoly f a -> m # ofoldr :: (Element (WrappedPoly f a) -> b -> b) -> b -> WrappedPoly f a -> b # ofoldl' :: (a0 -> Element (WrappedPoly f a) -> a0) -> a0 -> WrappedPoly f a -> a0 # otoList :: WrappedPoly f a -> [Element (WrappedPoly f a)] # oall :: (Element (WrappedPoly f a) -> Bool) -> WrappedPoly f a -> Bool # oany :: (Element (WrappedPoly f a) -> Bool) -> WrappedPoly f a -> Bool # onull :: WrappedPoly f a -> Bool # olength :: WrappedPoly f a -> Int # olength64 :: WrappedPoly f a -> Int64 # ocompareLength :: Integral i => WrappedPoly f a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (WrappedPoly f a) -> f0 b) -> WrappedPoly f a -> f0 () # ofor_ :: Applicative f0 => WrappedPoly f a -> (Element (WrappedPoly f a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (WrappedPoly f a) -> m ()) -> WrappedPoly f a -> m () # oforM_ :: Applicative m => WrappedPoly f a -> (Element (WrappedPoly f a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (WrappedPoly f a) -> m a0) -> a0 -> WrappedPoly f a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (WrappedPoly f a) -> m) -> WrappedPoly f a -> m # ofoldr1Ex :: (Element (WrappedPoly f a) -> Element (WrappedPoly f a) -> Element (WrappedPoly f a)) -> WrappedPoly f a -> Element (WrappedPoly f a) # ofoldl1Ex' :: (Element (WrappedPoly f a) -> Element (WrappedPoly f a) -> Element (WrappedPoly f a)) -> WrappedPoly f a -> Element (WrappedPoly f a) # headEx :: WrappedPoly f a -> Element (WrappedPoly f a) # lastEx :: WrappedPoly f a -> Element (WrappedPoly f a) # unsafeHead :: WrappedPoly f a -> Element (WrappedPoly f a) # unsafeLast :: WrappedPoly f a -> Element (WrappedPoly f a) # maximumByEx :: (Element (WrappedPoly f a) -> Element (WrappedPoly f a) -> Ordering) -> WrappedPoly f a -> Element (WrappedPoly f a) # minimumByEx :: (Element (WrappedPoly f a) -> Element (WrappedPoly f a) -> Ordering) -> WrappedPoly f a -> Element (WrappedPoly f a) # oelem :: Element (WrappedPoly f a) -> WrappedPoly f a -> Bool # onotElem :: Element (WrappedPoly f a) -> WrappedPoly f a -> Bool # | |
| MonoFoldable (Proxy a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Proxy a) -> m) -> Proxy a -> m # ofoldr :: (Element (Proxy a) -> b -> b) -> b -> Proxy a -> b # ofoldl' :: (a0 -> Element (Proxy a) -> a0) -> a0 -> Proxy a -> a0 # otoList :: Proxy a -> [Element (Proxy a)] # oall :: (Element (Proxy a) -> Bool) -> Proxy a -> Bool # oany :: (Element (Proxy a) -> Bool) -> Proxy a -> Bool # olength64 :: Proxy a -> Int64 # ocompareLength :: Integral i => Proxy a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Proxy a) -> f b) -> Proxy a -> f () # ofor_ :: Applicative f => Proxy a -> (Element (Proxy a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Proxy a) -> m ()) -> Proxy a -> m () # oforM_ :: Applicative m => Proxy a -> (Element (Proxy a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Proxy a) -> m a0) -> a0 -> Proxy a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Proxy a) -> m) -> Proxy a -> m # ofoldr1Ex :: (Element (Proxy a) -> Element (Proxy a) -> Element (Proxy a)) -> Proxy a -> Element (Proxy a) # ofoldl1Ex' :: (Element (Proxy a) -> Element (Proxy a) -> Element (Proxy a)) -> Proxy a -> Element (Proxy a) # headEx :: Proxy a -> Element (Proxy a) # lastEx :: Proxy a -> Element (Proxy a) # unsafeHead :: Proxy a -> Element (Proxy a) # unsafeLast :: Proxy a -> Element (Proxy a) # maximumByEx :: (Element (Proxy a) -> Element (Proxy a) -> Ordering) -> Proxy a -> Element (Proxy a) # minimumByEx :: (Element (Proxy a) -> Element (Proxy a) -> Ordering) -> Proxy a -> Element (Proxy a) # | |
| Foldable f => MonoFoldable (ListT f a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (ListT f a) -> m) -> ListT f a -> m # ofoldr :: (Element (ListT f a) -> b -> b) -> b -> ListT f a -> b # ofoldl' :: (a0 -> Element (ListT f a) -> a0) -> a0 -> ListT f a -> a0 # otoList :: ListT f a -> [Element (ListT f a)] # oall :: (Element (ListT f a) -> Bool) -> ListT f a -> Bool # oany :: (Element (ListT f a) -> Bool) -> ListT f a -> Bool # olength64 :: ListT f a -> Int64 # ocompareLength :: Integral i => ListT f a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (ListT f a) -> f0 b) -> ListT f a -> f0 () # ofor_ :: Applicative f0 => ListT f a -> (Element (ListT f a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (ListT f a) -> m ()) -> ListT f a -> m () # oforM_ :: Applicative m => ListT f a -> (Element (ListT f a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (ListT f a) -> m a0) -> a0 -> ListT f a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (ListT f a) -> m) -> ListT f a -> m # ofoldr1Ex :: (Element (ListT f a) -> Element (ListT f a) -> Element (ListT f a)) -> ListT f a -> Element (ListT f a) # ofoldl1Ex' :: (Element (ListT f a) -> Element (ListT f a) -> Element (ListT f a)) -> ListT f a -> Element (ListT f a) # headEx :: ListT f a -> Element (ListT f a) # lastEx :: ListT f a -> Element (ListT f a) # unsafeHead :: ListT f a -> Element (ListT f a) # unsafeLast :: ListT f a -> Element (ListT f a) # maximumByEx :: (Element (ListT f a) -> Element (ListT f a) -> Ordering) -> ListT f a -> Element (ListT f a) # minimumByEx :: (Element (ListT f a) -> Element (ListT f a) -> Ordering) -> ListT f a -> Element (ListT f a) # | |
| Foldable f => MonoFoldable (MaybeT f a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (MaybeT f a) -> m) -> MaybeT f a -> m # ofoldr :: (Element (MaybeT f a) -> b -> b) -> b -> MaybeT f a -> b # ofoldl' :: (a0 -> Element (MaybeT f a) -> a0) -> a0 -> MaybeT f a -> a0 # otoList :: MaybeT f a -> [Element (MaybeT f a)] # oall :: (Element (MaybeT f a) -> Bool) -> MaybeT f a -> Bool # oany :: (Element (MaybeT f a) -> Bool) -> MaybeT f a -> Bool # olength :: MaybeT f a -> Int # olength64 :: MaybeT f a -> Int64 # ocompareLength :: Integral i => MaybeT f a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (MaybeT f a) -> f0 b) -> MaybeT f a -> f0 () # ofor_ :: Applicative f0 => MaybeT f a -> (Element (MaybeT f a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (MaybeT f a) -> m ()) -> MaybeT f a -> m () # oforM_ :: Applicative m => MaybeT f a -> (Element (MaybeT f a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (MaybeT f a) -> m a0) -> a0 -> MaybeT f a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (MaybeT f a) -> m) -> MaybeT f a -> m # ofoldr1Ex :: (Element (MaybeT f a) -> Element (MaybeT f a) -> Element (MaybeT f a)) -> MaybeT f a -> Element (MaybeT f a) # ofoldl1Ex' :: (Element (MaybeT f a) -> Element (MaybeT f a) -> Element (MaybeT f a)) -> MaybeT f a -> Element (MaybeT f a) # headEx :: MaybeT f a -> Element (MaybeT f a) # lastEx :: MaybeT f a -> Element (MaybeT f a) # unsafeHead :: MaybeT f a -> Element (MaybeT f a) # unsafeLast :: MaybeT f a -> Element (MaybeT f a) # maximumByEx :: (Element (MaybeT f a) -> Element (MaybeT f a) -> Ordering) -> MaybeT f a -> Element (MaybeT f a) # minimumByEx :: (Element (MaybeT f a) -> Element (MaybeT f a) -> Ordering) -> MaybeT f a -> Element (MaybeT f a) # | |
| Foldable f => MonoFoldable (Rec1 f a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Rec1 f a) -> m) -> Rec1 f a -> m # ofoldr :: (Element (Rec1 f a) -> b -> b) -> b -> Rec1 f a -> b # ofoldl' :: (a0 -> Element (Rec1 f a) -> a0) -> a0 -> Rec1 f a -> a0 # otoList :: Rec1 f a -> [Element (Rec1 f a)] # oall :: (Element (Rec1 f a) -> Bool) -> Rec1 f a -> Bool # oany :: (Element (Rec1 f a) -> Bool) -> Rec1 f a -> Bool # olength64 :: Rec1 f a -> Int64 # ocompareLength :: Integral i => Rec1 f a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (Rec1 f a) -> f0 b) -> Rec1 f a -> f0 () # ofor_ :: Applicative f0 => Rec1 f a -> (Element (Rec1 f a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (Rec1 f a) -> m ()) -> Rec1 f a -> m () # oforM_ :: Applicative m => Rec1 f a -> (Element (Rec1 f a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Rec1 f a) -> m a0) -> a0 -> Rec1 f a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Rec1 f a) -> m) -> Rec1 f a -> m # ofoldr1Ex :: (Element (Rec1 f a) -> Element (Rec1 f a) -> Element (Rec1 f a)) -> Rec1 f a -> Element (Rec1 f a) # ofoldl1Ex' :: (Element (Rec1 f a) -> Element (Rec1 f a) -> Element (Rec1 f a)) -> Rec1 f a -> Element (Rec1 f a) # headEx :: Rec1 f a -> Element (Rec1 f a) # lastEx :: Rec1 f a -> Element (Rec1 f a) # unsafeHead :: Rec1 f a -> Element (Rec1 f a) # unsafeLast :: Rec1 f a -> Element (Rec1 f a) # maximumByEx :: (Element (Rec1 f a) -> Element (Rec1 f a) -> Ordering) -> Rec1 f a -> Element (Rec1 f a) # minimumByEx :: (Element (Rec1 f a) -> Element (Rec1 f a) -> Ordering) -> Rec1 f a -> Element (Rec1 f a) # | |
| Foldable f => MonoFoldable (WriterT w f a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (WriterT w f a) -> m) -> WriterT w f a -> m # ofoldr :: (Element (WriterT w f a) -> b -> b) -> b -> WriterT w f a -> b # ofoldl' :: (a0 -> Element (WriterT w f a) -> a0) -> a0 -> WriterT w f a -> a0 # otoList :: WriterT w f a -> [Element (WriterT w f a)] # oall :: (Element (WriterT w f a) -> Bool) -> WriterT w f a -> Bool # oany :: (Element (WriterT w f a) -> Bool) -> WriterT w f a -> Bool # onull :: WriterT w f a -> Bool # olength :: WriterT w f a -> Int # olength64 :: WriterT w f a -> Int64 # ocompareLength :: Integral i => WriterT w f a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (WriterT w f a) -> f0 b) -> WriterT w f a -> f0 () # ofor_ :: Applicative f0 => WriterT w f a -> (Element (WriterT w f a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (WriterT w f a) -> m ()) -> WriterT w f a -> m () # oforM_ :: Applicative m => WriterT w f a -> (Element (WriterT w f a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (WriterT w f a) -> m a0) -> a0 -> WriterT w f a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (WriterT w f a) -> m) -> WriterT w f a -> m # ofoldr1Ex :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Element (WriterT w f a)) -> WriterT w f a -> Element (WriterT w f a) # ofoldl1Ex' :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Element (WriterT w f a)) -> WriterT w f a -> Element (WriterT w f a) # headEx :: WriterT w f a -> Element (WriterT w f a) # lastEx :: WriterT w f a -> Element (WriterT w f a) # unsafeHead :: WriterT w f a -> Element (WriterT w f a) # unsafeLast :: WriterT w f a -> Element (WriterT w f a) # maximumByEx :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Ordering) -> WriterT w f a -> Element (WriterT w f a) # minimumByEx :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Ordering) -> WriterT w f a -> Element (WriterT w f a) # oelem :: Element (WriterT w f a) -> WriterT w f a -> Bool # onotElem :: Element (WriterT w f a) -> WriterT w f a -> Bool # | |
| Foldable f => MonoFoldable (IdentityT f a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (IdentityT f a) -> m) -> IdentityT f a -> m # ofoldr :: (Element (IdentityT f a) -> b -> b) -> b -> IdentityT f a -> b # ofoldl' :: (a0 -> Element (IdentityT f a) -> a0) -> a0 -> IdentityT f a -> a0 # otoList :: IdentityT f a -> [Element (IdentityT f a)] # oall :: (Element (IdentityT f a) -> Bool) -> IdentityT f a -> Bool # oany :: (Element (IdentityT f a) -> Bool) -> IdentityT f a -> Bool # onull :: IdentityT f a -> Bool # olength :: IdentityT f a -> Int # olength64 :: IdentityT f a -> Int64 # ocompareLength :: Integral i => IdentityT f a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (IdentityT f a) -> f0 b) -> IdentityT f a -> f0 () # ofor_ :: Applicative f0 => IdentityT f a -> (Element (IdentityT f a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (IdentityT f a) -> m ()) -> IdentityT f a -> m () # oforM_ :: Applicative m => IdentityT f a -> (Element (IdentityT f a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (IdentityT f a) -> m a0) -> a0 -> IdentityT f a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (IdentityT f a) -> m) -> IdentityT f a -> m # ofoldr1Ex :: (Element (IdentityT f a) -> Element (IdentityT f a) -> Element (IdentityT f a)) -> IdentityT f a -> Element (IdentityT f a) # ofoldl1Ex' :: (Element (IdentityT f a) -> Element (IdentityT f a) -> Element (IdentityT f a)) -> IdentityT f a -> Element (IdentityT f a) # headEx :: IdentityT f a -> Element (IdentityT f a) # lastEx :: IdentityT f a -> Element (IdentityT f a) # unsafeHead :: IdentityT f a -> Element (IdentityT f a) # unsafeLast :: IdentityT f a -> Element (IdentityT f a) # maximumByEx :: (Element (IdentityT f a) -> Element (IdentityT f a) -> Ordering) -> IdentityT f a -> Element (IdentityT f a) # minimumByEx :: (Element (IdentityT f a) -> Element (IdentityT f a) -> Ordering) -> IdentityT f a -> Element (IdentityT f a) # oelem :: Element (IdentityT f a) -> IdentityT f a -> Bool # onotElem :: Element (IdentityT f a) -> IdentityT f a -> Bool # | |
| MonoFoldable (Const m a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m0 => (Element (Const m a) -> m0) -> Const m a -> m0 # ofoldr :: (Element (Const m a) -> b -> b) -> b -> Const m a -> b # ofoldl' :: (a0 -> Element (Const m a) -> a0) -> a0 -> Const m a -> a0 # otoList :: Const m a -> [Element (Const m a)] # oall :: (Element (Const m a) -> Bool) -> Const m a -> Bool # oany :: (Element (Const m a) -> Bool) -> Const m a -> Bool # olength64 :: Const m a -> Int64 # ocompareLength :: Integral i => Const m a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Const m a) -> f b) -> Const m a -> f () # ofor_ :: Applicative f => Const m a -> (Element (Const m a) -> f b) -> f () # omapM_ :: Applicative m0 => (Element (Const m a) -> m0 ()) -> Const m a -> m0 () # oforM_ :: Applicative m0 => Const m a -> (Element (Const m a) -> m0 ()) -> m0 () # ofoldlM :: Monad m0 => (a0 -> Element (Const m a) -> m0 a0) -> a0 -> Const m a -> m0 a0 # ofoldMap1Ex :: Semigroup m0 => (Element (Const m a) -> m0) -> Const m a -> m0 # ofoldr1Ex :: (Element (Const m a) -> Element (Const m a) -> Element (Const m a)) -> Const m a -> Element (Const m a) # ofoldl1Ex' :: (Element (Const m a) -> Element (Const m a) -> Element (Const m a)) -> Const m a -> Element (Const m a) # headEx :: Const m a -> Element (Const m a) # lastEx :: Const m a -> Element (Const m a) # unsafeHead :: Const m a -> Element (Const m a) # unsafeLast :: Const m a -> Element (Const m a) # maximumByEx :: (Element (Const m a) -> Element (Const m a) -> Ordering) -> Const m a -> Element (Const m a) # minimumByEx :: (Element (Const m a) -> Element (Const m a) -> Ordering) -> Const m a -> Element (Const m a) # | |
| Foldable f => MonoFoldable (WriterT w f a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (WriterT w f a) -> m) -> WriterT w f a -> m # ofoldr :: (Element (WriterT w f a) -> b -> b) -> b -> WriterT w f a -> b # ofoldl' :: (a0 -> Element (WriterT w f a) -> a0) -> a0 -> WriterT w f a -> a0 # otoList :: WriterT w f a -> [Element (WriterT w f a)] # oall :: (Element (WriterT w f a) -> Bool) -> WriterT w f a -> Bool # oany :: (Element (WriterT w f a) -> Bool) -> WriterT w f a -> Bool # onull :: WriterT w f a -> Bool # olength :: WriterT w f a -> Int # olength64 :: WriterT w f a -> Int64 # ocompareLength :: Integral i => WriterT w f a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (WriterT w f a) -> f0 b) -> WriterT w f a -> f0 () # ofor_ :: Applicative f0 => WriterT w f a -> (Element (WriterT w f a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (WriterT w f a) -> m ()) -> WriterT w f a -> m () # oforM_ :: Applicative m => WriterT w f a -> (Element (WriterT w f a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (WriterT w f a) -> m a0) -> a0 -> WriterT w f a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (WriterT w f a) -> m) -> WriterT w f a -> m # ofoldr1Ex :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Element (WriterT w f a)) -> WriterT w f a -> Element (WriterT w f a) # ofoldl1Ex' :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Element (WriterT w f a)) -> WriterT w f a -> Element (WriterT w f a) # headEx :: WriterT w f a -> Element (WriterT w f a) # lastEx :: WriterT w f a -> Element (WriterT w f a) # unsafeHead :: WriterT w f a -> Element (WriterT w f a) # unsafeLast :: WriterT w f a -> Element (WriterT w f a) # maximumByEx :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Ordering) -> WriterT w f a -> Element (WriterT w f a) # minimumByEx :: (Element (WriterT w f a) -> Element (WriterT w f a) -> Ordering) -> WriterT w f a -> Element (WriterT w f a) # oelem :: Element (WriterT w f a) -> WriterT w f a -> Bool # onotElem :: Element (WriterT w f a) -> WriterT w f a -> Bool # | |
| MonoFoldable (K1 i c a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (K1 i c a) -> m) -> K1 i c a -> m # ofoldr :: (Element (K1 i c a) -> b -> b) -> b -> K1 i c a -> b # ofoldl' :: (a0 -> Element (K1 i c a) -> a0) -> a0 -> K1 i c a -> a0 # otoList :: K1 i c a -> [Element (K1 i c a)] # oall :: (Element (K1 i c a) -> Bool) -> K1 i c a -> Bool # oany :: (Element (K1 i c a) -> Bool) -> K1 i c a -> Bool # olength64 :: K1 i c a -> Int64 # ocompareLength :: Integral i0 => K1 i c a -> i0 -> Ordering # otraverse_ :: Applicative f => (Element (K1 i c a) -> f b) -> K1 i c a -> f () # ofor_ :: Applicative f => K1 i c a -> (Element (K1 i c a) -> f b) -> f () # omapM_ :: Applicative m => (Element (K1 i c a) -> m ()) -> K1 i c a -> m () # oforM_ :: Applicative m => K1 i c a -> (Element (K1 i c a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (K1 i c a) -> m a0) -> a0 -> K1 i c a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (K1 i c a) -> m) -> K1 i c a -> m # ofoldr1Ex :: (Element (K1 i c a) -> Element (K1 i c a) -> Element (K1 i c a)) -> K1 i c a -> Element (K1 i c a) # ofoldl1Ex' :: (Element (K1 i c a) -> Element (K1 i c a) -> Element (K1 i c a)) -> K1 i c a -> Element (K1 i c a) # headEx :: K1 i c a -> Element (K1 i c a) # lastEx :: K1 i c a -> Element (K1 i c a) # unsafeHead :: K1 i c a -> Element (K1 i c a) # unsafeLast :: K1 i c a -> Element (K1 i c a) # maximumByEx :: (Element (K1 i c a) -> Element (K1 i c a) -> Ordering) -> K1 i c a -> Element (K1 i c a) # minimumByEx :: (Element (K1 i c a) -> Element (K1 i c a) -> Ordering) -> K1 i c a -> Element (K1 i c a) # | |
| (Foldable f, Foldable g) => MonoFoldable ((f :+: g) a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element ((f :+: g) a) -> m) -> (f :+: g) a -> m # ofoldr :: (Element ((f :+: g) a) -> b -> b) -> b -> (f :+: g) a -> b # ofoldl' :: (a0 -> Element ((f :+: g) a) -> a0) -> a0 -> (f :+: g) a -> a0 # otoList :: (f :+: g) a -> [Element ((f :+: g) a)] # oall :: (Element ((f :+: g) a) -> Bool) -> (f :+: g) a -> Bool # oany :: (Element ((f :+: g) a) -> Bool) -> (f :+: g) a -> Bool # onull :: (f :+: g) a -> Bool # olength :: (f :+: g) a -> Int # olength64 :: (f :+: g) a -> Int64 # ocompareLength :: Integral i => (f :+: g) a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element ((f :+: g) a) -> f0 b) -> (f :+: g) a -> f0 () # ofor_ :: Applicative f0 => (f :+: g) a -> (Element ((f :+: g) a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element ((f :+: g) a) -> m ()) -> (f :+: g) a -> m () # oforM_ :: Applicative m => (f :+: g) a -> (Element ((f :+: g) a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element ((f :+: g) a) -> m a0) -> a0 -> (f :+: g) a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element ((f :+: g) a) -> m) -> (f :+: g) a -> m # ofoldr1Ex :: (Element ((f :+: g) a) -> Element ((f :+: g) a) -> Element ((f :+: g) a)) -> (f :+: g) a -> Element ((f :+: g) a) # ofoldl1Ex' :: (Element ((f :+: g) a) -> Element ((f :+: g) a) -> Element ((f :+: g) a)) -> (f :+: g) a -> Element ((f :+: g) a) # headEx :: (f :+: g) a -> Element ((f :+: g) a) # lastEx :: (f :+: g) a -> Element ((f :+: g) a) # unsafeHead :: (f :+: g) a -> Element ((f :+: g) a) # unsafeLast :: (f :+: g) a -> Element ((f :+: g) a) # maximumByEx :: (Element ((f :+: g) a) -> Element ((f :+: g) a) -> Ordering) -> (f :+: g) a -> Element ((f :+: g) a) # minimumByEx :: (Element ((f :+: g) a) -> Element ((f :+: g) a) -> Ordering) -> (f :+: g) a -> Element ((f :+: g) a) # | |
| (Foldable f, Foldable g) => MonoFoldable ((f :*: g) a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element ((f :*: g) a) -> m) -> (f :*: g) a -> m # ofoldr :: (Element ((f :*: g) a) -> b -> b) -> b -> (f :*: g) a -> b # ofoldl' :: (a0 -> Element ((f :*: g) a) -> a0) -> a0 -> (f :*: g) a -> a0 # otoList :: (f :*: g) a -> [Element ((f :*: g) a)] # oall :: (Element ((f :*: g) a) -> Bool) -> (f :*: g) a -> Bool # oany :: (Element ((f :*: g) a) -> Bool) -> (f :*: g) a -> Bool # onull :: (f :*: g) a -> Bool # olength :: (f :*: g) a -> Int # olength64 :: (f :*: g) a -> Int64 # ocompareLength :: Integral i => (f :*: g) a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element ((f :*: g) a) -> f0 b) -> (f :*: g) a -> f0 () # ofor_ :: Applicative f0 => (f :*: g) a -> (Element ((f :*: g) a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element ((f :*: g) a) -> m ()) -> (f :*: g) a -> m () # oforM_ :: Applicative m => (f :*: g) a -> (Element ((f :*: g) a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element ((f :*: g) a) -> m a0) -> a0 -> (f :*: g) a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element ((f :*: g) a) -> m) -> (f :*: g) a -> m # ofoldr1Ex :: (Element ((f :*: g) a) -> Element ((f :*: g) a) -> Element ((f :*: g) a)) -> (f :*: g) a -> Element ((f :*: g) a) # ofoldl1Ex' :: (Element ((f :*: g) a) -> Element ((f :*: g) a) -> Element ((f :*: g) a)) -> (f :*: g) a -> Element ((f :*: g) a) # headEx :: (f :*: g) a -> Element ((f :*: g) a) # lastEx :: (f :*: g) a -> Element ((f :*: g) a) # unsafeHead :: (f :*: g) a -> Element ((f :*: g) a) # unsafeLast :: (f :*: g) a -> Element ((f :*: g) a) # maximumByEx :: (Element ((f :*: g) a) -> Element ((f :*: g) a) -> Ordering) -> (f :*: g) a -> Element ((f :*: g) a) # minimumByEx :: (Element ((f :*: g) a) -> Element ((f :*: g) a) -> Ordering) -> (f :*: g) a -> Element ((f :*: g) a) # | |
| (Foldable f, Foldable g) => MonoFoldable (Product f g a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Product f g a) -> m) -> Product f g a -> m # ofoldr :: (Element (Product f g a) -> b -> b) -> b -> Product f g a -> b # ofoldl' :: (a0 -> Element (Product f g a) -> a0) -> a0 -> Product f g a -> a0 # otoList :: Product f g a -> [Element (Product f g a)] # oall :: (Element (Product f g a) -> Bool) -> Product f g a -> Bool # oany :: (Element (Product f g a) -> Bool) -> Product f g a -> Bool # onull :: Product f g a -> Bool # olength :: Product f g a -> Int # olength64 :: Product f g a -> Int64 # ocompareLength :: Integral i => Product f g a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (Product f g a) -> f0 b) -> Product f g a -> f0 () # ofor_ :: Applicative f0 => Product f g a -> (Element (Product f g a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (Product f g a) -> m ()) -> Product f g a -> m () # oforM_ :: Applicative m => Product f g a -> (Element (Product f g a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Product f g a) -> m a0) -> a0 -> Product f g a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Product f g a) -> m) -> Product f g a -> m # ofoldr1Ex :: (Element (Product f g a) -> Element (Product f g a) -> Element (Product f g a)) -> Product f g a -> Element (Product f g a) # ofoldl1Ex' :: (Element (Product f g a) -> Element (Product f g a) -> Element (Product f g a)) -> Product f g a -> Element (Product f g a) # headEx :: Product f g a -> Element (Product f g a) # lastEx :: Product f g a -> Element (Product f g a) # unsafeHead :: Product f g a -> Element (Product f g a) # unsafeLast :: Product f g a -> Element (Product f g a) # maximumByEx :: (Element (Product f g a) -> Element (Product f g a) -> Ordering) -> Product f g a -> Element (Product f g a) # minimumByEx :: (Element (Product f g a) -> Element (Product f g a) -> Ordering) -> Product f g a -> Element (Product f g a) # oelem :: Element (Product f g a) -> Product f g a -> Bool # onotElem :: Element (Product f g a) -> Product f g a -> Bool # | |
| Foldable f => MonoFoldable (M1 i c f a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (M1 i c f a) -> m) -> M1 i c f a -> m # ofoldr :: (Element (M1 i c f a) -> b -> b) -> b -> M1 i c f a -> b # ofoldl' :: (a0 -> Element (M1 i c f a) -> a0) -> a0 -> M1 i c f a -> a0 # otoList :: M1 i c f a -> [Element (M1 i c f a)] # oall :: (Element (M1 i c f a) -> Bool) -> M1 i c f a -> Bool # oany :: (Element (M1 i c f a) -> Bool) -> M1 i c f a -> Bool # olength :: M1 i c f a -> Int # olength64 :: M1 i c f a -> Int64 # ocompareLength :: Integral i0 => M1 i c f a -> i0 -> Ordering # otraverse_ :: Applicative f0 => (Element (M1 i c f a) -> f0 b) -> M1 i c f a -> f0 () # ofor_ :: Applicative f0 => M1 i c f a -> (Element (M1 i c f a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (M1 i c f a) -> m ()) -> M1 i c f a -> m () # oforM_ :: Applicative m => M1 i c f a -> (Element (M1 i c f a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (M1 i c f a) -> m a0) -> a0 -> M1 i c f a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (M1 i c f a) -> m) -> M1 i c f a -> m # ofoldr1Ex :: (Element (M1 i c f a) -> Element (M1 i c f a) -> Element (M1 i c f a)) -> M1 i c f a -> Element (M1 i c f a) # ofoldl1Ex' :: (Element (M1 i c f a) -> Element (M1 i c f a) -> Element (M1 i c f a)) -> M1 i c f a -> Element (M1 i c f a) # headEx :: M1 i c f a -> Element (M1 i c f a) # lastEx :: M1 i c f a -> Element (M1 i c f a) # unsafeHead :: M1 i c f a -> Element (M1 i c f a) # unsafeLast :: M1 i c f a -> Element (M1 i c f a) # maximumByEx :: (Element (M1 i c f a) -> Element (M1 i c f a) -> Ordering) -> M1 i c f a -> Element (M1 i c f a) # minimumByEx :: (Element (M1 i c f a) -> Element (M1 i c f a) -> Ordering) -> M1 i c f a -> Element (M1 i c f a) # | |
| (Foldable f, Foldable g) => MonoFoldable ((f :.: g) a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element ((f :.: g) a) -> m) -> (f :.: g) a -> m # ofoldr :: (Element ((f :.: g) a) -> b -> b) -> b -> (f :.: g) a -> b # ofoldl' :: (a0 -> Element ((f :.: g) a) -> a0) -> a0 -> (f :.: g) a -> a0 # otoList :: (f :.: g) a -> [Element ((f :.: g) a)] # oall :: (Element ((f :.: g) a) -> Bool) -> (f :.: g) a -> Bool # oany :: (Element ((f :.: g) a) -> Bool) -> (f :.: g) a -> Bool # onull :: (f :.: g) a -> Bool # olength :: (f :.: g) a -> Int # olength64 :: (f :.: g) a -> Int64 # ocompareLength :: Integral i => (f :.: g) a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element ((f :.: g) a) -> f0 b) -> (f :.: g) a -> f0 () # ofor_ :: Applicative f0 => (f :.: g) a -> (Element ((f :.: g) a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element ((f :.: g) a) -> m ()) -> (f :.: g) a -> m () # oforM_ :: Applicative m => (f :.: g) a -> (Element ((f :.: g) a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element ((f :.: g) a) -> m a0) -> a0 -> (f :.: g) a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element ((f :.: g) a) -> m) -> (f :.: g) a -> m # ofoldr1Ex :: (Element ((f :.: g) a) -> Element ((f :.: g) a) -> Element ((f :.: g) a)) -> (f :.: g) a -> Element ((f :.: g) a) # ofoldl1Ex' :: (Element ((f :.: g) a) -> Element ((f :.: g) a) -> Element ((f :.: g) a)) -> (f :.: g) a -> Element ((f :.: g) a) # headEx :: (f :.: g) a -> Element ((f :.: g) a) # lastEx :: (f :.: g) a -> Element ((f :.: g) a) # unsafeHead :: (f :.: g) a -> Element ((f :.: g) a) # unsafeLast :: (f :.: g) a -> Element ((f :.: g) a) # maximumByEx :: (Element ((f :.: g) a) -> Element ((f :.: g) a) -> Ordering) -> (f :.: g) a -> Element ((f :.: g) a) # minimumByEx :: (Element ((f :.: g) a) -> Element ((f :.: g) a) -> Ordering) -> (f :.: g) a -> Element ((f :.: g) a) # | |
| (Foldable f, Foldable g) => MonoFoldable (Compose f g a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Compose f g a) -> m) -> Compose f g a -> m # ofoldr :: (Element (Compose f g a) -> b -> b) -> b -> Compose f g a -> b # ofoldl' :: (a0 -> Element (Compose f g a) -> a0) -> a0 -> Compose f g a -> a0 # otoList :: Compose f g a -> [Element (Compose f g a)] # oall :: (Element (Compose f g a) -> Bool) -> Compose f g a -> Bool # oany :: (Element (Compose f g a) -> Bool) -> Compose f g a -> Bool # onull :: Compose f g a -> Bool # olength :: Compose f g a -> Int # olength64 :: Compose f g a -> Int64 # ocompareLength :: Integral i => Compose f g a -> i -> Ordering # otraverse_ :: Applicative f0 => (Element (Compose f g a) -> f0 b) -> Compose f g a -> f0 () # ofor_ :: Applicative f0 => Compose f g a -> (Element (Compose f g a) -> f0 b) -> f0 () # omapM_ :: Applicative m => (Element (Compose f g a) -> m ()) -> Compose f g a -> m () # oforM_ :: Applicative m => Compose f g a -> (Element (Compose f g a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Compose f g a) -> m a0) -> a0 -> Compose f g a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Compose f g a) -> m) -> Compose f g a -> m # ofoldr1Ex :: (Element (Compose f g a) -> Element (Compose f g a) -> Element (Compose f g a)) -> Compose f g a -> Element (Compose f g a) # ofoldl1Ex' :: (Element (Compose f g a) -> Element (Compose f g a) -> Element (Compose f g a)) -> Compose f g a -> Element (Compose f g a) # headEx :: Compose f g a -> Element (Compose f g a) # lastEx :: Compose f g a -> Element (Compose f g a) # unsafeHead :: Compose f g a -> Element (Compose f g a) # unsafeLast :: Compose f g a -> Element (Compose f g a) # maximumByEx :: (Element (Compose f g a) -> Element (Compose f g a) -> Ordering) -> Compose f g a -> Element (Compose f g a) # minimumByEx :: (Element (Compose f g a) -> Element (Compose f g a) -> Ordering) -> Compose f g a -> Element (Compose f g a) # oelem :: Element (Compose f g a) -> Compose f g a -> Bool # onotElem :: Element (Compose f g a) -> Compose f g a -> Bool # | |
class MonoFunctor mono where #
Minimal complete definition
Nothing
Instances
Instances
| type Element ByteString | |
Defined in Data.MonoTraversable | |
| type Element ByteString | |
Defined in Data.MonoTraversable | |
| type Element Text | |
Defined in Data.MonoTraversable | |
| type Element IntSet | |
Defined in Data.MonoTraversable | |
| type Element Text | |
Defined in Data.MonoTraversable | |
| type Element [a] | |
Defined in Data.MonoTraversable type Element [a] = a | |
| type Element (Maybe a) | |
Defined in Data.MonoTraversable | |
| type Element (IO a) | |
Defined in Data.MonoTraversable | |
| type Element (Par1 a) | |
Defined in Data.MonoTraversable type Element (Par1 a) = a | |
| type Element (NonNull mono) | |
Defined in Data.NonNull | |
| type Element (Identity a) | |
Defined in Data.MonoTraversable | |
| type Element (DList a) | |
Defined in Data.MonoTraversable.Instances | |
| type Element (HashSet e) | |
Defined in Data.MonoTraversable | |
| type Element (Vector a) | |
Defined in Data.MonoTraversable | |
| type Element (Set e) | |
Defined in Data.MonoTraversable | |
| type Element (IntMap a) | |
Defined in Data.MonoTraversable | |
| type Element (Seq a) | |
Defined in Data.MonoTraversable | |
| type Element (NonEmpty a) | |
Defined in Data.MonoTraversable type Element (NonEmpty a) = a | |
| type Element (Tree a) | |
Defined in Data.MonoTraversable type Element (Tree a) = a | |
| type Element (Option a) | |
Defined in Data.MonoTraversable type Element (Option a) = a | |
| type Element (Vector a) | |
Defined in Data.MonoTraversable type Element (Vector a) = a | |
| type Element (Vector a) | |
Defined in Data.MonoTraversable type Element (Vector a) = a | |
| type Element (ZipList a) | |
Defined in Data.MonoTraversable type Element (ZipList a) = a | |
| type Element (ViewL a) | |
Defined in Data.MonoTraversable type Element (ViewL a) = a | |
| type Element (ViewR a) | |
Defined in Data.MonoTraversable type Element (ViewR a) = a | |
| type Element (r -> a) | |
Defined in Data.MonoTraversable type Element (r -> a) = a | |
| type Element (Either a b) | |
Defined in Data.MonoTraversable | |
| type Element (V1 a) | |
Defined in Data.MonoTraversable type Element (V1 a) = a | |
| type Element (U1 a) | |
Defined in Data.MonoTraversable type Element (U1 a) = a | |
| type Element (a, b) | |
Defined in Data.MonoTraversable type Element (a, b) = b | |
| type Element (HashMap k v) | |
Defined in Data.MonoTraversable | |
| type Element (Map k v) | |
Defined in Data.MonoTraversable | |
| type Element (WrappedMono mono a) | |
Defined in Data.MonoTraversable | |
| type Element (WrappedPoly f a) | |
Defined in Data.MonoTraversable | |
| type Element (Arg a b) | |
Defined in Data.MonoTraversable type Element (Arg a b) = b | |
| type Element (MaybeApply f a) | |
Defined in Data.MonoTraversable.Instances type Element (MaybeApply f a) = a | |
| type Element (WrappedApplicative f a) | |
Defined in Data.MonoTraversable.Instances type Element (WrappedApplicative f a) = a | |
| type Element (WrappedMonad m a) | |
Defined in Data.MonoTraversable type Element (WrappedMonad m a) = a | |
| type Element (Proxy a) | |
Defined in Data.MonoTraversable type Element (Proxy a) = a | |
| type Element (ListT m a) | |
Defined in Data.MonoTraversable type Element (ListT m a) = a | |
| type Element (MaybeT m a) | |
Defined in Data.MonoTraversable type Element (MaybeT m a) = a | |
| type Element (Rec1 f a) | |
Defined in Data.MonoTraversable type Element (Rec1 f a) = a | |
| type Element (ReaderT r m a) | |
Defined in Data.MonoTraversable | |
| type Element (WriterT w m a) | |
Defined in Data.MonoTraversable type Element (WriterT w m a) = a | |
| type Element (EnvT e w a) | |
Defined in Data.MonoTraversable.Instances type Element (EnvT e w a) = a | |
| type Element (IdentityT m a) | |
Defined in Data.MonoTraversable type Element (IdentityT m a) = a | |
| type Element (StoreT s w a) | |
Defined in Data.MonoTraversable.Instances type Element (StoreT s w a) = a | |
| type Element (TracedT m w a) | |
Defined in Data.MonoTraversable.Instances type Element (TracedT m w a) = a | |
| type Element (Static f a b) | |
Defined in Data.MonoTraversable.Instances type Element (Static f a b) = b | |
| type Element (Const m a) | |
Defined in Data.MonoTraversable type Element (Const m a) = a | |
| type Element (StateT s m a) | |
Defined in Data.MonoTraversable type Element (StateT s m a) = a | |
| type Element (WrappedArrow a b c) | |
Defined in Data.MonoTraversable type Element (WrappedArrow a b c) = c | |
| type Element (WriterT w m a) | |
Defined in Data.MonoTraversable type Element (WriterT w m a) = a | |
| type Element (StateT s m a) | |
Defined in Data.MonoTraversable type Element (StateT s m a) = a | |
| type Element (K1 i c a) | |
Defined in Data.MonoTraversable type Element (K1 i c a) = a | |
| type Element ((f :+: g) a) | |
Defined in Data.MonoTraversable type Element ((f :+: g) a) = a | |
| type Element ((f :*: g) a) | |
Defined in Data.MonoTraversable type Element ((f :*: g) a) = a | |
| type Element (Cokleisli w a b) | |
Defined in Data.MonoTraversable.Instances type Element (Cokleisli w a b) = b | |
| type Element (Product f g a) | |
Defined in Data.MonoTraversable type Element (Product f g a) = a | |
| type Element (ContT r m a) | |
Defined in Data.MonoTraversable type Element (ContT r m a) = a | |
| type Element (M1 i c f a) | |
Defined in Data.MonoTraversable type Element (M1 i c f a) = a | |
| type Element ((f :.: g) a) | |
Defined in Data.MonoTraversable type Element ((f :.: g) a) = a | |
| type Element (Compose f g a) | |
Defined in Data.MonoTraversable type Element (Compose f g a) = a | |
| type Element (RWST r w s m a) | |
Defined in Data.MonoTraversable type Element (RWST r w s m a) = a | |
| type Element (RWST r w s m a) | |
Defined in Data.MonoTraversable type Element (RWST r w s m a) = a | |
replaceElem :: (MonoFunctor mono, Eq (Element mono)) => Element mono -> Element mono -> mono -> mono #
replaceElemLazyText :: Char -> Char -> Text -> Text #
headMay :: MonoFoldable mono => mono -> Maybe (Element mono) #
lastMay :: MonoFoldable mono => mono -> Maybe (Element mono) #
oconcatMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> m #
ofoldM :: (MonoFoldable mono, Monad m) => (a -> Element mono -> m a) -> a -> mono -> m a #
osequence_ :: (Applicative m, MonoFoldable mono, Element mono ~ m ()) => mono -> m () #
maximumMay :: (MonoFoldable mono, Ord (Element mono)) => mono -> Maybe (Element mono) #
maximumByMay :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> mono -> Maybe (Element mono) #
minimumMay :: (MonoFoldable mono, Ord (Element mono)) => mono -> Maybe (Element mono) #
minimumByMay :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> mono -> Maybe (Element mono) #
ofor :: (MonoTraversable mono, Applicative f) => mono -> (Element mono -> f (Element mono)) -> f mono #
oforM :: (MonoTraversable mono, Applicative f) => mono -> (Element mono -> f (Element mono)) -> f mono #
ofoldlUnwrap :: MonoFoldable mono => (x -> Element mono -> x) -> x -> (x -> b) -> mono -> b #
ofoldMUnwrap :: (Monad m, MonoFoldable mono) => (x -> Element mono -> m x) -> m x -> (x -> m b) -> mono -> m b #
ointercalate :: (MonoFoldable mono, Monoid (Element mono)) => Element mono -> mono -> Element mono #
unwrapMono :: WrappedMono mono a -> mono #
class SetContainer set => HasKeysSet set where #
Instances
| HasKeysSet (IntMap v) | |
| (Hashable k, Eq k) => HasKeysSet (HashMap k v) | |
| Ord k => HasKeysSet (Map k v) | |
class MonoFunctor mono => MonoZip mono where #
Methods
ozipWith :: (Element mono -> Element mono -> Element mono) -> mono -> mono -> mono #
Instances
| MonoZip ByteString | |
Defined in Data.Containers Methods ozipWith :: (Element ByteString -> Element ByteString -> Element ByteString) -> ByteString -> ByteString -> ByteString # ozip :: ByteString -> ByteString -> [(Element ByteString, Element ByteString)] # ounzip :: [(Element ByteString, Element ByteString)] -> (ByteString, ByteString) # | |
| MonoZip ByteString | |
Defined in Data.Containers | |
| MonoZip Text | |
| MonoZip Text | |
class (SetContainer set, Element set ~ ContainerKey set) => IsSet set where #
Minimal complete definition
Methods
insertSet :: Element set -> set -> set #
deleteSet :: Element set -> set -> set #
singletonSet :: Element set -> set #
setFromList :: [Element set] -> set #
Instances
| IsSet IntSet | |
Defined in Data.Containers | |
| (Eq element, Hashable element) => IsSet (HashSet element) | |
Defined in Data.Containers Methods insertSet :: Element (HashSet element) -> HashSet element -> HashSet element # deleteSet :: Element (HashSet element) -> HashSet element -> HashSet element # singletonSet :: Element (HashSet element) -> HashSet element # setFromList :: [Element (HashSet element)] -> HashSet element # setToList :: HashSet element -> [Element (HashSet element)] # filterSet :: (Element (HashSet element) -> Bool) -> HashSet element -> HashSet element # | |
| Ord element => IsSet (Set element) | |
Defined in Data.Containers Methods insertSet :: Element (Set element) -> Set element -> Set element # deleteSet :: Element (Set element) -> Set element -> Set element # singletonSet :: Element (Set element) -> Set element # setFromList :: [Element (Set element)] -> Set element # setToList :: Set element -> [Element (Set element)] # filterSet :: (Element (Set element) -> Bool) -> Set element -> Set element # | |
class (MonoTraversable map, SetContainer map) => IsMap map where #
Minimal complete definition
lookup, insertMap, deleteMap, singletonMap, mapFromList, mapToList
Methods
lookup :: ContainerKey map -> map -> Maybe (MapValue map) #
insertMap :: ContainerKey map -> MapValue map -> map -> map #
deleteMap :: ContainerKey map -> map -> map #
singletonMap :: ContainerKey map -> MapValue map -> map #
mapFromList :: [(ContainerKey map, MapValue map)] -> map #
mapToList :: map -> [(ContainerKey map, MapValue map)] #
findWithDefault :: MapValue map -> ContainerKey map -> map -> MapValue map #
insertWith :: (MapValue map -> MapValue map -> MapValue map) -> ContainerKey map -> MapValue map -> map -> map #
insertWithKey :: (ContainerKey map -> MapValue map -> MapValue map -> MapValue map) -> ContainerKey map -> MapValue map -> map -> map #
insertLookupWithKey :: (ContainerKey map -> MapValue map -> MapValue map -> MapValue map) -> ContainerKey map -> MapValue map -> map -> (Maybe (MapValue map), map) #
adjustMap :: (MapValue map -> MapValue map) -> ContainerKey map -> map -> map #
adjustWithKey :: (ContainerKey map -> MapValue map -> MapValue map) -> ContainerKey map -> map -> map #
updateMap :: (MapValue map -> Maybe (MapValue map)) -> ContainerKey map -> map -> map #
updateWithKey :: (ContainerKey map -> MapValue map -> Maybe (MapValue map)) -> ContainerKey map -> map -> map #
updateLookupWithKey :: (ContainerKey map -> MapValue map -> Maybe (MapValue map)) -> ContainerKey map -> map -> (Maybe (MapValue map), map) #
alterMap :: (Maybe (MapValue map) -> Maybe (MapValue map)) -> ContainerKey map -> map -> map #
unionWith :: (MapValue map -> MapValue map -> MapValue map) -> map -> map -> map #
unionWithKey :: (ContainerKey map -> MapValue map -> MapValue map -> MapValue map) -> map -> map -> map #
unionsWith :: (MapValue map -> MapValue map -> MapValue map) -> [map] -> map #
mapWithKey :: (ContainerKey map -> MapValue map -> MapValue map) -> map -> map #
omapKeysWith :: (MapValue map -> MapValue map -> MapValue map) -> (ContainerKey map -> ContainerKey map) -> map -> map #
Instances
| Eq key => IsMap [(key, value)] | |
Defined in Data.Containers Methods lookup :: ContainerKey [(key, value)] -> [(key, value)] -> Maybe (MapValue [(key, value)]) # insertMap :: ContainerKey [(key, value)] -> MapValue [(key, value)] -> [(key, value)] -> [(key, value)] # deleteMap :: ContainerKey [(key, value)] -> [(key, value)] -> [(key, value)] # singletonMap :: ContainerKey [(key, value)] -> MapValue [(key, value)] -> [(key, value)] # mapFromList :: [(ContainerKey [(key, value)], MapValue [(key, value)])] -> [(key, value)] # mapToList :: [(key, value)] -> [(ContainerKey [(key, value)], MapValue [(key, value)])] # findWithDefault :: MapValue [(key, value)] -> ContainerKey [(key, value)] -> [(key, value)] -> MapValue [(key, value)] # insertWith :: (MapValue [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> ContainerKey [(key, value)] -> MapValue [(key, value)] -> [(key, value)] -> [(key, value)] # insertWithKey :: (ContainerKey [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> ContainerKey [(key, value)] -> MapValue [(key, value)] -> [(key, value)] -> [(key, value)] # insertLookupWithKey :: (ContainerKey [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> ContainerKey [(key, value)] -> MapValue [(key, value)] -> [(key, value)] -> (Maybe (MapValue [(key, value)]), [(key, value)]) # adjustMap :: (MapValue [(key, value)] -> MapValue [(key, value)]) -> ContainerKey [(key, value)] -> [(key, value)] -> [(key, value)] # adjustWithKey :: (ContainerKey [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> ContainerKey [(key, value)] -> [(key, value)] -> [(key, value)] # updateMap :: (MapValue [(key, value)] -> Maybe (MapValue [(key, value)])) -> ContainerKey [(key, value)] -> [(key, value)] -> [(key, value)] # updateWithKey :: (ContainerKey [(key, value)] -> MapValue [(key, value)] -> Maybe (MapValue [(key, value)])) -> ContainerKey [(key, value)] -> [(key, value)] -> [(key, value)] # updateLookupWithKey :: (ContainerKey [(key, value)] -> MapValue [(key, value)] -> Maybe (MapValue [(key, value)])) -> ContainerKey [(key, value)] -> [(key, value)] -> (Maybe (MapValue [(key, value)]), [(key, value)]) # alterMap :: (Maybe (MapValue [(key, value)]) -> Maybe (MapValue [(key, value)])) -> ContainerKey [(key, value)] -> [(key, value)] -> [(key, value)] # unionWith :: (MapValue [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> [(key, value)] -> [(key, value)] -> [(key, value)] # unionWithKey :: (ContainerKey [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> [(key, value)] -> [(key, value)] -> [(key, value)] # unionsWith :: (MapValue [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> [[(key, value)]] -> [(key, value)] # mapWithKey :: (ContainerKey [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> [(key, value)] -> [(key, value)] # omapKeysWith :: (MapValue [(key, value)] -> MapValue [(key, value)] -> MapValue [(key, value)]) -> (ContainerKey [(key, value)] -> ContainerKey [(key, value)]) -> [(key, value)] -> [(key, value)] # filterMap :: (MapValue [(key, value)] -> Bool) -> [(key, value)] -> [(key, value)] # | |
| IsMap (IntMap value) | |
Defined in Data.Containers Methods lookup :: ContainerKey (IntMap value) -> IntMap value -> Maybe (MapValue (IntMap value)) # insertMap :: ContainerKey (IntMap value) -> MapValue (IntMap value) -> IntMap value -> IntMap value # deleteMap :: ContainerKey (IntMap value) -> IntMap value -> IntMap value # singletonMap :: ContainerKey (IntMap value) -> MapValue (IntMap value) -> IntMap value # mapFromList :: [(ContainerKey (IntMap value), MapValue (IntMap value))] -> IntMap value # mapToList :: IntMap value -> [(ContainerKey (IntMap value), MapValue (IntMap value))] # findWithDefault :: MapValue (IntMap value) -> ContainerKey (IntMap value) -> IntMap value -> MapValue (IntMap value) # insertWith :: (MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> ContainerKey (IntMap value) -> MapValue (IntMap value) -> IntMap value -> IntMap value # insertWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> ContainerKey (IntMap value) -> MapValue (IntMap value) -> IntMap value -> IntMap value # insertLookupWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> ContainerKey (IntMap value) -> MapValue (IntMap value) -> IntMap value -> (Maybe (MapValue (IntMap value)), IntMap value) # adjustMap :: (MapValue (IntMap value) -> MapValue (IntMap value)) -> ContainerKey (IntMap value) -> IntMap value -> IntMap value # adjustWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> ContainerKey (IntMap value) -> IntMap value -> IntMap value # updateMap :: (MapValue (IntMap value) -> Maybe (MapValue (IntMap value))) -> ContainerKey (IntMap value) -> IntMap value -> IntMap value # updateWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> Maybe (MapValue (IntMap value))) -> ContainerKey (IntMap value) -> IntMap value -> IntMap value # updateLookupWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> Maybe (MapValue (IntMap value))) -> ContainerKey (IntMap value) -> IntMap value -> (Maybe (MapValue (IntMap value)), IntMap value) # alterMap :: (Maybe (MapValue (IntMap value)) -> Maybe (MapValue (IntMap value))) -> ContainerKey (IntMap value) -> IntMap value -> IntMap value # unionWith :: (MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> IntMap value -> IntMap value -> IntMap value # unionWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> IntMap value -> IntMap value -> IntMap value # unionsWith :: (MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> [IntMap value] -> IntMap value # mapWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> IntMap value -> IntMap value # omapKeysWith :: (MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> (ContainerKey (IntMap value) -> ContainerKey (IntMap value)) -> IntMap value -> IntMap value # filterMap :: (MapValue (IntMap value) -> Bool) -> IntMap value -> IntMap value # | |
| (Eq key, Hashable key) => IsMap (HashMap key value) | |
Defined in Data.Containers Methods lookup :: ContainerKey (HashMap key value) -> HashMap key value -> Maybe (MapValue (HashMap key value)) # insertMap :: ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> HashMap key value # deleteMap :: ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # singletonMap :: ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value # mapFromList :: [(ContainerKey (HashMap key value), MapValue (HashMap key value))] -> HashMap key value # mapToList :: HashMap key value -> [(ContainerKey (HashMap key value), MapValue (HashMap key value))] # findWithDefault :: MapValue (HashMap key value) -> ContainerKey (HashMap key value) -> HashMap key value -> MapValue (HashMap key value) # insertWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> HashMap key value # insertWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> HashMap key value # insertLookupWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> HashMap key value -> (Maybe (MapValue (HashMap key value)), HashMap key value) # adjustMap :: (MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # adjustWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # updateMap :: (MapValue (HashMap key value) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # updateWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # updateLookupWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> (Maybe (MapValue (HashMap key value)), HashMap key value) # alterMap :: (Maybe (MapValue (HashMap key value)) -> Maybe (MapValue (HashMap key value))) -> ContainerKey (HashMap key value) -> HashMap key value -> HashMap key value # unionWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> HashMap key value -> HashMap key value -> HashMap key value # unionWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> HashMap key value -> HashMap key value -> HashMap key value # unionsWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> [HashMap key value] -> HashMap key value # mapWithKey :: (ContainerKey (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> HashMap key value -> HashMap key value # omapKeysWith :: (MapValue (HashMap key value) -> MapValue (HashMap key value) -> MapValue (HashMap key value)) -> (ContainerKey (HashMap key value) -> ContainerKey (HashMap key value)) -> HashMap key value -> HashMap key value # filterMap :: (MapValue (HashMap key value) -> Bool) -> HashMap key value -> HashMap key value # | |
| Ord key => IsMap (Map key value) | |
Defined in Data.Containers Methods lookup :: ContainerKey (Map key value) -> Map key value -> Maybe (MapValue (Map key value)) # insertMap :: ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> Map key value # deleteMap :: ContainerKey (Map key value) -> Map key value -> Map key value # singletonMap :: ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value # mapFromList :: [(ContainerKey (Map key value), MapValue (Map key value))] -> Map key value # mapToList :: Map key value -> [(ContainerKey (Map key value), MapValue (Map key value))] # findWithDefault :: MapValue (Map key value) -> ContainerKey (Map key value) -> Map key value -> MapValue (Map key value) # insertWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> Map key value # insertWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> Map key value # insertLookupWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> MapValue (Map key value) -> Map key value -> (Maybe (MapValue (Map key value)), Map key value) # adjustMap :: (MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> Map key value -> Map key value # adjustWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> ContainerKey (Map key value) -> Map key value -> Map key value # updateMap :: (MapValue (Map key value) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> Map key value # updateWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> Map key value # updateLookupWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> (Maybe (MapValue (Map key value)), Map key value) # alterMap :: (Maybe (MapValue (Map key value)) -> Maybe (MapValue (Map key value))) -> ContainerKey (Map key value) -> Map key value -> Map key value # unionWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> Map key value -> Map key value -> Map key value # unionWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> Map key value -> Map key value -> Map key value # unionsWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> [Map key value] -> Map key value # mapWithKey :: (ContainerKey (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> Map key value -> Map key value # omapKeysWith :: (MapValue (Map key value) -> MapValue (Map key value) -> MapValue (Map key value)) -> (ContainerKey (Map key value) -> ContainerKey (Map key value)) -> Map key value -> Map key value # filterMap :: (MapValue (Map key value) -> Bool) -> Map key value -> Map key value # | |
Instances
| type MapValue [(key, value)] | |
Defined in Data.Containers type MapValue [(key, value)] = value | |
| type MapValue (IntMap value) | |
Defined in Data.Containers | |
| type MapValue (HashMap key value) | |
Defined in Data.Containers | |
| type MapValue (Map key value) | |
Defined in Data.Containers | |
class BiPolyMap (map :: Type -> Type -> Type) where #
Associated Types
type BPMKeyConstraint (map :: Type -> Type -> Type) key #
Methods
mapKeysWith :: (BPMKeyConstraint map k1, BPMKeyConstraint map k2) => (v -> v -> v) -> (k1 -> k2) -> map k1 v -> map k2 v #
Instances
| BiPolyMap HashMap | |
Defined in Data.Containers Associated Types type BPMKeyConstraint HashMap key # Methods mapKeysWith :: (BPMKeyConstraint HashMap k1, BPMKeyConstraint HashMap k2) => (v -> v -> v) -> (k1 -> k2) -> HashMap k1 v -> HashMap k2 v # | |
| BiPolyMap Map | |
Defined in Data.Containers Associated Types type BPMKeyConstraint Map key # Methods mapKeysWith :: (BPMKeyConstraint Map k1, BPMKeyConstraint Map k2) => (v -> v -> v) -> (k1 -> k2) -> Map k1 v -> Map k2 v # | |
type family BPMKeyConstraint (map :: Type -> Type -> Type) key #
Instances
| type BPMKeyConstraint HashMap key | |
Defined in Data.Containers | |
| type BPMKeyConstraint Map key | |
Defined in Data.Containers | |
class PolyMap (map :: Type -> Type) where #
Methods
differenceMap :: map value1 -> map value2 -> map value1 #
intersectionMap :: map value1 -> map value2 -> map value1 #
intersectionWithMap :: (value1 -> value2 -> value3) -> map value1 -> map value2 -> map value3 #
Instances
| PolyMap IntMap | |
Defined in Data.Containers Methods differenceMap :: IntMap value1 -> IntMap value2 -> IntMap value1 # intersectionMap :: IntMap value1 -> IntMap value2 -> IntMap value1 # intersectionWithMap :: (value1 -> value2 -> value3) -> IntMap value1 -> IntMap value2 -> IntMap value3 # | |
| (Eq key, Hashable key) => PolyMap (HashMap key) | |
Defined in Data.Containers Methods differenceMap :: HashMap key value1 -> HashMap key value2 -> HashMap key value1 # intersectionMap :: HashMap key value1 -> HashMap key value2 -> HashMap key value1 # intersectionWithMap :: (value1 -> value2 -> value3) -> HashMap key value1 -> HashMap key value2 -> HashMap key value3 # | |
| Ord key => PolyMap (Map key) | |
Defined in Data.Containers Methods differenceMap :: Map key value1 -> Map key value2 -> Map key value1 # intersectionMap :: Map key value1 -> Map key value2 -> Map key value1 # intersectionWithMap :: (value1 -> value2 -> value3) -> Map key value1 -> Map key value2 -> Map key value3 # | |
class (Monoid set, Semigroup set, MonoFoldable set, Eq (ContainerKey set), GrowingAppend set) => SetContainer set where #
Minimal complete definition
Associated Types
type ContainerKey set #
Methods
member :: ContainerKey set -> set -> Bool #
notMember :: ContainerKey set -> set -> Bool #
unions :: (MonoFoldable mono, Element mono ~ set) => mono -> set #
difference :: set -> set -> set #
intersection :: set -> set -> set #
keys :: set -> [ContainerKey set] #
Instances
| SetContainer IntSet | |
Defined in Data.Containers Associated Types type ContainerKey IntSet # Methods member :: ContainerKey IntSet -> IntSet -> Bool # notMember :: ContainerKey IntSet -> IntSet -> Bool # union :: IntSet -> IntSet -> IntSet # unions :: (MonoFoldable mono, Element mono ~ IntSet) => mono -> IntSet # difference :: IntSet -> IntSet -> IntSet # intersection :: IntSet -> IntSet -> IntSet # keys :: IntSet -> [ContainerKey IntSet] # | |
| Eq key => SetContainer [(key, value)] | |
Defined in Data.Containers Associated Types type ContainerKey [(key, value)] # Methods member :: ContainerKey [(key, value)] -> [(key, value)] -> Bool # notMember :: ContainerKey [(key, value)] -> [(key, value)] -> Bool # union :: [(key, value)] -> [(key, value)] -> [(key, value)] # unions :: (MonoFoldable mono, Element mono ~ [(key, value)]) => mono -> [(key, value)] # difference :: [(key, value)] -> [(key, value)] -> [(key, value)] # intersection :: [(key, value)] -> [(key, value)] -> [(key, value)] # keys :: [(key, value)] -> [ContainerKey [(key, value)]] # | |
| (Eq element, Hashable element) => SetContainer (HashSet element) | |
Defined in Data.Containers Associated Types type ContainerKey (HashSet element) # Methods member :: ContainerKey (HashSet element) -> HashSet element -> Bool # notMember :: ContainerKey (HashSet element) -> HashSet element -> Bool # union :: HashSet element -> HashSet element -> HashSet element # unions :: (MonoFoldable mono, Element mono ~ HashSet element) => mono -> HashSet element # difference :: HashSet element -> HashSet element -> HashSet element # intersection :: HashSet element -> HashSet element -> HashSet element # keys :: HashSet element -> [ContainerKey (HashSet element)] # | |
| Ord element => SetContainer (Set element) | |
Defined in Data.Containers Associated Types type ContainerKey (Set element) # Methods member :: ContainerKey (Set element) -> Set element -> Bool # notMember :: ContainerKey (Set element) -> Set element -> Bool # union :: Set element -> Set element -> Set element # unions :: (MonoFoldable mono, Element mono ~ Set element) => mono -> Set element # difference :: Set element -> Set element -> Set element # intersection :: Set element -> Set element -> Set element # keys :: Set element -> [ContainerKey (Set element)] # | |
| SetContainer (IntMap value) | |
Defined in Data.Containers Associated Types type ContainerKey (IntMap value) # Methods member :: ContainerKey (IntMap value) -> IntMap value -> Bool # notMember :: ContainerKey (IntMap value) -> IntMap value -> Bool # union :: IntMap value -> IntMap value -> IntMap value # unions :: (MonoFoldable mono, Element mono ~ IntMap value) => mono -> IntMap value # difference :: IntMap value -> IntMap value -> IntMap value # intersection :: IntMap value -> IntMap value -> IntMap value # keys :: IntMap value -> [ContainerKey (IntMap value)] # | |
| (Eq key, Hashable key) => SetContainer (HashMap key value) | |
Defined in Data.Containers Associated Types type ContainerKey (HashMap key value) # Methods member :: ContainerKey (HashMap key value) -> HashMap key value -> Bool # notMember :: ContainerKey (HashMap key value) -> HashMap key value -> Bool # union :: HashMap key value -> HashMap key value -> HashMap key value # unions :: (MonoFoldable mono, Element mono ~ HashMap key value) => mono -> HashMap key value # difference :: HashMap key value -> HashMap key value -> HashMap key value # intersection :: HashMap key value -> HashMap key value -> HashMap key value # keys :: HashMap key value -> [ContainerKey (HashMap key value)] # | |
| Ord k => SetContainer (Map k v) | |
Defined in Data.Containers Associated Types type ContainerKey (Map k v) # Methods member :: ContainerKey (Map k v) -> Map k v -> Bool # notMember :: ContainerKey (Map k v) -> Map k v -> Bool # union :: Map k v -> Map k v -> Map k v # unions :: (MonoFoldable mono, Element mono ~ Map k v) => mono -> Map k v # difference :: Map k v -> Map k v -> Map k v # intersection :: Map k v -> Map k v -> Map k v # keys :: Map k v -> [ContainerKey (Map k v)] # | |
type family ContainerKey set #
Instances
| type ContainerKey IntSet | |
Defined in Data.Containers | |
| type ContainerKey [(key, value)] | |
Defined in Data.Containers type ContainerKey [(key, value)] = key | |
| type ContainerKey (HashSet element) | |
Defined in Data.Containers | |
| type ContainerKey (Set element) | |
Defined in Data.Containers | |
| type ContainerKey (IntMap value) | |
Defined in Data.Containers | |
| type ContainerKey (HashMap key value) | |
Defined in Data.Containers | |
| type ContainerKey (Map k v) | |
Defined in Data.Containers | |
foldMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> m #
foldr :: MonoFoldable mono => (Element mono -> b -> b) -> b -> mono -> b #
foldl' :: MonoFoldable mono => (a -> Element mono -> a) -> a -> mono -> a #
toList :: MonoFoldable mono => mono -> [Element mono] #
null :: MonoFoldable mono => mono -> Bool #
length :: MonoFoldable mono => mono -> Int #
length64 :: MonoFoldable mono => mono -> Int64 #
compareLength :: (MonoFoldable mono, Integral i) => mono -> i -> Ordering #
traverse_ :: (MonoFoldable mono, Applicative f) => (Element mono -> f b) -> mono -> f () #
for_ :: (MonoFoldable mono, Applicative f) => mono -> (Element mono -> f b) -> f () #
mapM_ :: (MonoFoldable mono, Applicative m) => (Element mono -> m ()) -> mono -> m () #
forM_ :: (MonoFoldable mono, Applicative m) => mono -> (Element mono -> m ()) -> m () #
foldlM :: (MonoFoldable mono, Monad m) => (a -> Element mono -> m a) -> a -> mono -> m a #
foldMap1Ex :: (MonoFoldable mono, Semigroup m) => (Element mono -> m) -> mono -> m #
foldr1Ex :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> mono -> Element mono #
foldl1Ex' :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> mono -> Element mono #
concatMap :: (MonoFoldable mono, Monoid m) => (Element mono -> m) -> mono -> m #
point :: MonoPointed mono => Element mono -> mono #
intercalate :: (MonoFoldable mono, Monoid (Element mono)) => Element mono -> mono -> Element mono #
foldM :: (MonoFoldable mono, Monad m) => (a -> Element mono -> m a) -> a -> mono -> m a #
sequence_ :: (Applicative m, MonoFoldable mono, Element mono ~ m ()) => mono -> m () #
class (Textual textual, IsSequence binary) => Utf8 textual binary | textual -> binary, binary -> textual where #
Instances
| Utf8 Text ByteString | |
Defined in Data.Sequences | |
| Utf8 Text ByteString | |
Defined in Data.Sequences | |
| (c ~ Char, w ~ Word8) => Utf8 [c] [w] | |
Defined in Data.Sequences | |
class (IsSequence lazy, IsSequence strict) => LazySequence lazy strict | lazy -> strict, strict -> lazy where #
Instances
| LazySequence ByteString ByteString | |
Defined in Data.Sequences Methods toChunks :: ByteString -> [ByteString0] # fromChunks :: [ByteString0] -> ByteString # toStrict :: ByteString -> ByteString0 # fromStrict :: ByteString0 -> ByteString # | |
| LazySequence Text Text | |
Defined in Data.Sequences | |
class (IsSequence t, IsString t, Element t ~ Char) => Textual t where #
Methods
unwords :: (Element seq ~ t, MonoFoldable seq) => seq -> t #
unlines :: (Element seq ~ t, MonoFoldable seq) => seq -> t #
toCaseFold :: t -> t #
Instances
| Textual Text | |
| Textual Text | |
Defined in Data.Sequences Methods unwords :: (Element seq ~ Text, MonoFoldable seq) => seq -> Text # unlines :: (Element seq ~ Text, MonoFoldable seq) => seq -> Text # toCaseFold :: Text -> Text # | |
| c ~ Char => Textual [c] | |
Defined in Data.Sequences Methods unwords :: (Element seq ~ [c], MonoFoldable seq) => seq -> [c] # unlines :: (Element seq ~ [c], MonoFoldable seq) => seq -> [c] # toCaseFold :: [c] -> [c] # | |
class (Monoid seq, MonoTraversable seq, SemiSequence seq, MonoPointed seq) => IsSequence seq where #
Minimal complete definition
Nothing
Methods
fromList :: [Element seq] -> seq #
lengthIndex :: seq -> Index seq #
break :: (Element seq -> Bool) -> seq -> (seq, seq) #
span :: (Element seq -> Bool) -> seq -> (seq, seq) #
dropWhile :: (Element seq -> Bool) -> seq -> seq #
takeWhile :: (Element seq -> Bool) -> seq -> seq #
splitAt :: Index seq -> seq -> (seq, seq) #
unsafeSplitAt :: Index seq -> seq -> (seq, seq) #
take :: Index seq -> seq -> seq #
unsafeTake :: Index seq -> seq -> seq #
drop :: Index seq -> seq -> seq #
unsafeDrop :: Index seq -> seq -> seq #
dropEnd :: Index seq -> seq -> seq #
partition :: (Element seq -> Bool) -> seq -> (seq, seq) #
uncons :: seq -> Maybe (Element seq, seq) #
unsnoc :: seq -> Maybe (seq, Element seq) #
filter :: (Element seq -> Bool) -> seq -> seq #
filterM :: Monad m => (Element seq -> m Bool) -> seq -> m seq #
replicate :: Index seq -> Element seq -> seq #
replicateM :: Monad m => Index seq -> m (Element seq) -> m seq #
groupBy :: (Element seq -> Element seq -> Bool) -> seq -> [seq] #
groupAllOn :: Eq b => (Element seq -> b) -> seq -> [seq] #
subsequences :: seq -> [seq] #
permutations :: seq -> [seq] #
unsafeTail :: seq -> seq #
unsafeInit :: seq -> seq #
index :: seq -> Index seq -> Maybe (Element seq) #
indexEx :: seq -> Index seq -> Element seq #
unsafeIndex :: seq -> Index seq -> Element seq #
Instances
| IsSequence ByteString | |
Defined in Data.Sequences Methods fromList :: [Element ByteString] -> ByteString # lengthIndex :: ByteString -> Index ByteString # break :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) # span :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) # dropWhile :: (Element ByteString -> Bool) -> ByteString -> ByteString # takeWhile :: (Element ByteString -> Bool) -> ByteString -> ByteString # splitAt :: Index ByteString -> ByteString -> (ByteString, ByteString) # unsafeSplitAt :: Index ByteString -> ByteString -> (ByteString, ByteString) # take :: Index ByteString -> ByteString -> ByteString # unsafeTake :: Index ByteString -> ByteString -> ByteString # drop :: Index ByteString -> ByteString -> ByteString # unsafeDrop :: Index ByteString -> ByteString -> ByteString # dropEnd :: Index ByteString -> ByteString -> ByteString # partition :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) # uncons :: ByteString -> Maybe (Element ByteString, ByteString) # unsnoc :: ByteString -> Maybe (ByteString, Element ByteString) # filter :: (Element ByteString -> Bool) -> ByteString -> ByteString # filterM :: Monad m => (Element ByteString -> m Bool) -> ByteString -> m ByteString # replicate :: Index ByteString -> Element ByteString -> ByteString # replicateM :: Monad m => Index ByteString -> m (Element ByteString) -> m ByteString # groupBy :: (Element ByteString -> Element ByteString -> Bool) -> ByteString -> [ByteString] # groupAllOn :: Eq b => (Element ByteString -> b) -> ByteString -> [ByteString] # subsequences :: ByteString -> [ByteString] # permutations :: ByteString -> [ByteString] # tailEx :: ByteString -> ByteString # tailMay :: ByteString -> Maybe ByteString # initEx :: ByteString -> ByteString # initMay :: ByteString -> Maybe ByteString # unsafeTail :: ByteString -> ByteString # unsafeInit :: ByteString -> ByteString # index :: ByteString -> Index ByteString -> Maybe (Element ByteString) # indexEx :: ByteString -> Index ByteString -> Element ByteString # unsafeIndex :: ByteString -> Index ByteString -> Element ByteString # splitWhen :: (Element ByteString -> Bool) -> ByteString -> [ByteString] # | |
| IsSequence ByteString | |
Defined in Data.Sequences Methods fromList :: [Element ByteString] -> ByteString # lengthIndex :: ByteString -> Index ByteString # break :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) # span :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) # dropWhile :: (Element ByteString -> Bool) -> ByteString -> ByteString # takeWhile :: (Element ByteString -> Bool) -> ByteString -> ByteString # splitAt :: Index ByteString -> ByteString -> (ByteString, ByteString) # unsafeSplitAt :: Index ByteString -> ByteString -> (ByteString, ByteString) # take :: Index ByteString -> ByteString -> ByteString # unsafeTake :: Index ByteString -> ByteString -> ByteString # drop :: Index ByteString -> ByteString -> ByteString # unsafeDrop :: Index ByteString -> ByteString -> ByteString # dropEnd :: Index ByteString -> ByteString -> ByteString # partition :: (Element ByteString -> Bool) -> ByteString -> (ByteString, ByteString) # uncons :: ByteString -> Maybe (Element ByteString, ByteString) # unsnoc :: ByteString -> Maybe (ByteString, Element ByteString) # filter :: (Element ByteString -> Bool) -> ByteString -> ByteString # filterM :: Monad m => (Element ByteString -> m Bool) -> ByteString -> m ByteString # replicate :: Index ByteString -> Element ByteString -> ByteString # replicateM :: Monad m => Index ByteString -> m (Element ByteString) -> m ByteString # groupBy :: (Element ByteString -> Element ByteString -> Bool) -> ByteString -> [ByteString] # groupAllOn :: Eq b => (Element ByteString -> b) -> ByteString -> [ByteString] # subsequences :: ByteString -> [ByteString] # permutations :: ByteString -> [ByteString] # tailEx :: ByteString -> ByteString # tailMay :: ByteString -> Maybe ByteString # initEx :: ByteString -> ByteString # initMay :: ByteString -> Maybe ByteString # unsafeTail :: ByteString -> ByteString # unsafeInit :: ByteString -> ByteString # index :: ByteString -> Index ByteString -> Maybe (Element ByteString) # indexEx :: ByteString -> Index ByteString -> Element ByteString # unsafeIndex :: ByteString -> Index ByteString -> Element ByteString # splitWhen :: (Element ByteString -> Bool) -> ByteString -> [ByteString] # | |
| IsSequence Text | |
Defined in Data.Sequences Methods fromList :: [Element Text] -> Text # lengthIndex :: Text -> Index Text # break :: (Element Text -> Bool) -> Text -> (Text, Text) # span :: (Element Text -> Bool) -> Text -> (Text, Text) # dropWhile :: (Element Text -> Bool) -> Text -> Text # takeWhile :: (Element Text -> Bool) -> Text -> Text # splitAt :: Index Text -> Text -> (Text, Text) # unsafeSplitAt :: Index Text -> Text -> (Text, Text) # take :: Index Text -> Text -> Text # unsafeTake :: Index Text -> Text -> Text # drop :: Index Text -> Text -> Text # unsafeDrop :: Index Text -> Text -> Text # dropEnd :: Index Text -> Text -> Text # partition :: (Element Text -> Bool) -> Text -> (Text, Text) # uncons :: Text -> Maybe (Element Text, Text) # unsnoc :: Text -> Maybe (Text, Element Text) # filter :: (Element Text -> Bool) -> Text -> Text # filterM :: Monad m => (Element Text -> m Bool) -> Text -> m Text # replicate :: Index Text -> Element Text -> Text # replicateM :: Monad m => Index Text -> m (Element Text) -> m Text # groupBy :: (Element Text -> Element Text -> Bool) -> Text -> [Text] # groupAllOn :: Eq b => (Element Text -> b) -> Text -> [Text] # subsequences :: Text -> [Text] # permutations :: Text -> [Text] # tailMay :: Text -> Maybe Text # initMay :: Text -> Maybe Text # unsafeTail :: Text -> Text # unsafeInit :: Text -> Text # index :: Text -> Index Text -> Maybe (Element Text) # indexEx :: Text -> Index Text -> Element Text # | |
| IsSequence Text | |
Defined in Data.Sequences Methods fromList :: [Element Text] -> Text # lengthIndex :: Text -> Index Text # break :: (Element Text -> Bool) -> Text -> (Text, Text) # span :: (Element Text -> Bool) -> Text -> (Text, Text) # dropWhile :: (Element Text -> Bool) -> Text -> Text # takeWhile :: (Element Text -> Bool) -> Text -> Text # splitAt :: Index Text -> Text -> (Text, Text) # unsafeSplitAt :: Index Text -> Text -> (Text, Text) # take :: Index Text -> Text -> Text # unsafeTake :: Index Text -> Text -> Text # drop :: Index Text -> Text -> Text # unsafeDrop :: Index Text -> Text -> Text # dropEnd :: Index Text -> Text -> Text # partition :: (Element Text -> Bool) -> Text -> (Text, Text) # uncons :: Text -> Maybe (Element Text, Text) # unsnoc :: Text -> Maybe (Text, Element Text) # filter :: (Element Text -> Bool) -> Text -> Text # filterM :: Monad m => (Element Text -> m Bool) -> Text -> m Text # replicate :: Index Text -> Element Text -> Text # replicateM :: Monad m => Index Text -> m (Element Text) -> m Text # groupBy :: (Element Text -> Element Text -> Bool) -> Text -> [Text] # groupAllOn :: Eq b => (Element Text -> b) -> Text -> [Text] # subsequences :: Text -> [Text] # permutations :: Text -> [Text] # tailMay :: Text -> Maybe Text # initMay :: Text -> Maybe Text # unsafeTail :: Text -> Text # unsafeInit :: Text -> Text # index :: Text -> Index Text -> Maybe (Element Text) # indexEx :: Text -> Index Text -> Element Text # unsafeIndex :: Text -> Index Text -> Element Text # | |
| IsSequence [a] | |
Defined in Data.Sequences Methods fromList :: [Element [a]] -> [a] # lengthIndex :: [a] -> Index [a] # break :: (Element [a] -> Bool) -> [a] -> ([a], [a]) # span :: (Element [a] -> Bool) -> [a] -> ([a], [a]) # dropWhile :: (Element [a] -> Bool) -> [a] -> [a] # takeWhile :: (Element [a] -> Bool) -> [a] -> [a] # splitAt :: Index [a] -> [a] -> ([a], [a]) # unsafeSplitAt :: Index [a] -> [a] -> ([a], [a]) # take :: Index [a] -> [a] -> [a] # unsafeTake :: Index [a] -> [a] -> [a] # drop :: Index [a] -> [a] -> [a] # unsafeDrop :: Index [a] -> [a] -> [a] # dropEnd :: Index [a] -> [a] -> [a] # partition :: (Element [a] -> Bool) -> [a] -> ([a], [a]) # uncons :: [a] -> Maybe (Element [a], [a]) # unsnoc :: [a] -> Maybe ([a], Element [a]) # filter :: (Element [a] -> Bool) -> [a] -> [a] # filterM :: Monad m => (Element [a] -> m Bool) -> [a] -> m [a] # replicate :: Index [a] -> Element [a] -> [a] # replicateM :: Monad m => Index [a] -> m (Element [a]) -> m [a] # groupBy :: (Element [a] -> Element [a] -> Bool) -> [a] -> [[a]] # groupAllOn :: Eq b => (Element [a] -> b) -> [a] -> [[a]] # subsequences :: [a] -> [[a]] # permutations :: [a] -> [[a]] # unsafeTail :: [a] -> [a] # unsafeInit :: [a] -> [a] # index :: [a] -> Index [a] -> Maybe (Element [a]) # indexEx :: [a] -> Index [a] -> Element [a] # unsafeIndex :: [a] -> Index [a] -> Element [a] # | |
| IsSequence (Vector a) | |
Defined in Data.Sequences Methods fromList :: [Element (Vector a)] -> Vector a # lengthIndex :: Vector a -> Index (Vector a) # break :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # span :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # dropWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # takeWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # splitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # unsafeSplitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # take :: Index (Vector a) -> Vector a -> Vector a # unsafeTake :: Index (Vector a) -> Vector a -> Vector a # drop :: Index (Vector a) -> Vector a -> Vector a # unsafeDrop :: Index (Vector a) -> Vector a -> Vector a # dropEnd :: Index (Vector a) -> Vector a -> Vector a # partition :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # uncons :: Vector a -> Maybe (Element (Vector a), Vector a) # unsnoc :: Vector a -> Maybe (Vector a, Element (Vector a)) # filter :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # filterM :: Monad m => (Element (Vector a) -> m Bool) -> Vector a -> m (Vector a) # replicate :: Index (Vector a) -> Element (Vector a) -> Vector a # replicateM :: Monad m => Index (Vector a) -> m (Element (Vector a)) -> m (Vector a) # groupBy :: (Element (Vector a) -> Element (Vector a) -> Bool) -> Vector a -> [Vector a] # groupAllOn :: Eq b => (Element (Vector a) -> b) -> Vector a -> [Vector a] # subsequences :: Vector a -> [Vector a] # permutations :: Vector a -> [Vector a] # tailEx :: Vector a -> Vector a # tailMay :: Vector a -> Maybe (Vector a) # initEx :: Vector a -> Vector a # initMay :: Vector a -> Maybe (Vector a) # unsafeTail :: Vector a -> Vector a # unsafeInit :: Vector a -> Vector a # index :: Vector a -> Index (Vector a) -> Maybe (Element (Vector a)) # indexEx :: Vector a -> Index (Vector a) -> Element (Vector a) # unsafeIndex :: Vector a -> Index (Vector a) -> Element (Vector a) # splitWhen :: (Element (Vector a) -> Bool) -> Vector a -> [Vector a] # | |
| IsSequence (Seq a) | |
Defined in Data.Sequences Methods fromList :: [Element (Seq a)] -> Seq a # lengthIndex :: Seq a -> Index (Seq a) # break :: (Element (Seq a) -> Bool) -> Seq a -> (Seq a, Seq a) # span :: (Element (Seq a) -> Bool) -> Seq a -> (Seq a, Seq a) # dropWhile :: (Element (Seq a) -> Bool) -> Seq a -> Seq a # takeWhile :: (Element (Seq a) -> Bool) -> Seq a -> Seq a # splitAt :: Index (Seq a) -> Seq a -> (Seq a, Seq a) # unsafeSplitAt :: Index (Seq a) -> Seq a -> (Seq a, Seq a) # take :: Index (Seq a) -> Seq a -> Seq a # unsafeTake :: Index (Seq a) -> Seq a -> Seq a # drop :: Index (Seq a) -> Seq a -> Seq a # unsafeDrop :: Index (Seq a) -> Seq a -> Seq a # dropEnd :: Index (Seq a) -> Seq a -> Seq a # partition :: (Element (Seq a) -> Bool) -> Seq a -> (Seq a, Seq a) # uncons :: Seq a -> Maybe (Element (Seq a), Seq a) # unsnoc :: Seq a -> Maybe (Seq a, Element (Seq a)) # filter :: (Element (Seq a) -> Bool) -> Seq a -> Seq a # filterM :: Monad m => (Element (Seq a) -> m Bool) -> Seq a -> m (Seq a) # replicate :: Index (Seq a) -> Element (Seq a) -> Seq a # replicateM :: Monad m => Index (Seq a) -> m (Element (Seq a)) -> m (Seq a) # groupBy :: (Element (Seq a) -> Element (Seq a) -> Bool) -> Seq a -> [Seq a] # groupAllOn :: Eq b => (Element (Seq a) -> b) -> Seq a -> [Seq a] # subsequences :: Seq a -> [Seq a] # permutations :: Seq a -> [Seq a] # tailMay :: Seq a -> Maybe (Seq a) # initMay :: Seq a -> Maybe (Seq a) # unsafeTail :: Seq a -> Seq a # unsafeInit :: Seq a -> Seq a # index :: Seq a -> Index (Seq a) -> Maybe (Element (Seq a)) # indexEx :: Seq a -> Index (Seq a) -> Element (Seq a) # unsafeIndex :: Seq a -> Index (Seq a) -> Element (Seq a) # splitWhen :: (Element (Seq a) -> Bool) -> Seq a -> [Seq a] # | |
| Storable a => IsSequence (Vector a) | |
Defined in Data.Sequences Methods fromList :: [Element (Vector a)] -> Vector a # lengthIndex :: Vector a -> Index (Vector a) # break :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # span :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # dropWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # takeWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # splitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # unsafeSplitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # take :: Index (Vector a) -> Vector a -> Vector a # unsafeTake :: Index (Vector a) -> Vector a -> Vector a # drop :: Index (Vector a) -> Vector a -> Vector a # unsafeDrop :: Index (Vector a) -> Vector a -> Vector a # dropEnd :: Index (Vector a) -> Vector a -> Vector a # partition :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # uncons :: Vector a -> Maybe (Element (Vector a), Vector a) # unsnoc :: Vector a -> Maybe (Vector a, Element (Vector a)) # filter :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # filterM :: Monad m => (Element (Vector a) -> m Bool) -> Vector a -> m (Vector a) # replicate :: Index (Vector a) -> Element (Vector a) -> Vector a # replicateM :: Monad m => Index (Vector a) -> m (Element (Vector a)) -> m (Vector a) # groupBy :: (Element (Vector a) -> Element (Vector a) -> Bool) -> Vector a -> [Vector a] # groupAllOn :: Eq b => (Element (Vector a) -> b) -> Vector a -> [Vector a] # subsequences :: Vector a -> [Vector a] # permutations :: Vector a -> [Vector a] # tailEx :: Vector a -> Vector a # tailMay :: Vector a -> Maybe (Vector a) # initEx :: Vector a -> Vector a # initMay :: Vector a -> Maybe (Vector a) # unsafeTail :: Vector a -> Vector a # unsafeInit :: Vector a -> Vector a # index :: Vector a -> Index (Vector a) -> Maybe (Element (Vector a)) # indexEx :: Vector a -> Index (Vector a) -> Element (Vector a) # unsafeIndex :: Vector a -> Index (Vector a) -> Element (Vector a) # splitWhen :: (Element (Vector a) -> Bool) -> Vector a -> [Vector a] # | |
| Unbox a => IsSequence (Vector a) | |
Defined in Data.Sequences Methods fromList :: [Element (Vector a)] -> Vector a # lengthIndex :: Vector a -> Index (Vector a) # break :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # span :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # dropWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # takeWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # splitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # unsafeSplitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # take :: Index (Vector a) -> Vector a -> Vector a # unsafeTake :: Index (Vector a) -> Vector a -> Vector a # drop :: Index (Vector a) -> Vector a -> Vector a # unsafeDrop :: Index (Vector a) -> Vector a -> Vector a # dropEnd :: Index (Vector a) -> Vector a -> Vector a # partition :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # uncons :: Vector a -> Maybe (Element (Vector a), Vector a) # unsnoc :: Vector a -> Maybe (Vector a, Element (Vector a)) # filter :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # filterM :: Monad m => (Element (Vector a) -> m Bool) -> Vector a -> m (Vector a) # replicate :: Index (Vector a) -> Element (Vector a) -> Vector a # replicateM :: Monad m => Index (Vector a) -> m (Element (Vector a)) -> m (Vector a) # groupBy :: (Element (Vector a) -> Element (Vector a) -> Bool) -> Vector a -> [Vector a] # groupAllOn :: Eq b => (Element (Vector a) -> b) -> Vector a -> [Vector a] # subsequences :: Vector a -> [Vector a] # permutations :: Vector a -> [Vector a] # tailEx :: Vector a -> Vector a # tailMay :: Vector a -> Maybe (Vector a) # initEx :: Vector a -> Vector a # initMay :: Vector a -> Maybe (Vector a) # unsafeTail :: Vector a -> Vector a # unsafeInit :: Vector a -> Vector a # index :: Vector a -> Index (Vector a) -> Maybe (Element (Vector a)) # indexEx :: Vector a -> Index (Vector a) -> Element (Vector a) # unsafeIndex :: Vector a -> Index (Vector a) -> Element (Vector a) # splitWhen :: (Element (Vector a) -> Bool) -> Vector a -> [Vector a] # | |
class (Integral (Index seq), GrowingAppend seq) => SemiSequence seq where #
Methods
intersperse :: Element seq -> seq -> seq #
find :: (Element seq -> Bool) -> seq -> Maybe (Element seq) #
sortBy :: (Element seq -> Element seq -> Ordering) -> seq -> seq #
Instances
| SemiSequence ByteString | |
Defined in Data.Sequences Associated Types type Index ByteString # Methods intersperse :: Element ByteString -> ByteString -> ByteString # reverse :: ByteString -> ByteString # find :: (Element ByteString -> Bool) -> ByteString -> Maybe (Element ByteString) # sortBy :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> ByteString # cons :: Element ByteString -> ByteString -> ByteString # snoc :: ByteString -> Element ByteString -> ByteString # | |
| SemiSequence ByteString | |
Defined in Data.Sequences Methods intersperse :: Element ByteString -> ByteString -> ByteString # reverse :: ByteString -> ByteString # find :: (Element ByteString -> Bool) -> ByteString -> Maybe (Element ByteString) # sortBy :: (Element ByteString -> Element ByteString -> Ordering) -> ByteString -> ByteString # | |
| SemiSequence Text | |
Defined in Data.Sequences | |
| SemiSequence Text | |
Defined in Data.Sequences | |
| SemiSequence [a] | |
Defined in Data.Sequences | |
| SemiSequence seq => SemiSequence (NonNull seq) | |
Defined in Data.NonNull Methods intersperse :: Element (NonNull seq) -> NonNull seq -> NonNull seq # reverse :: NonNull seq -> NonNull seq # find :: (Element (NonNull seq) -> Bool) -> NonNull seq -> Maybe (Element (NonNull seq)) # sortBy :: (Element (NonNull seq) -> Element (NonNull seq) -> Ordering) -> NonNull seq -> NonNull seq # cons :: Element (NonNull seq) -> NonNull seq -> NonNull seq # snoc :: NonNull seq -> Element (NonNull seq) -> NonNull seq # | |
| SemiSequence (Vector a) | |
Defined in Data.Sequences Methods intersperse :: Element (Vector a) -> Vector a -> Vector a # reverse :: Vector a -> Vector a # find :: (Element (Vector a) -> Bool) -> Vector a -> Maybe (Element (Vector a)) # sortBy :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Vector a # | |
| SemiSequence (Seq a) | |
| SemiSequence (NonEmpty a) | |
Defined in Data.Sequences Methods intersperse :: Element (NonEmpty a) -> NonEmpty a -> NonEmpty a # reverse :: NonEmpty a -> NonEmpty a # find :: (Element (NonEmpty a) -> Bool) -> NonEmpty a -> Maybe (Element (NonEmpty a)) # sortBy :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Ordering) -> NonEmpty a -> NonEmpty a # | |
| Storable a => SemiSequence (Vector a) | |
Defined in Data.Sequences Methods intersperse :: Element (Vector a) -> Vector a -> Vector a # reverse :: Vector a -> Vector a # find :: (Element (Vector a) -> Bool) -> Vector a -> Maybe (Element (Vector a)) # sortBy :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Vector a # | |
| Unbox a => SemiSequence (Vector a) | |
Defined in Data.Sequences Methods intersperse :: Element (Vector a) -> Vector a -> Vector a # reverse :: Vector a -> Vector a # find :: (Element (Vector a) -> Bool) -> Vector a -> Maybe (Element (Vector a)) # sortBy :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Vector a # | |
Instances
| type Index ByteString | |
Defined in Data.Sequences | |
| type Index ByteString | |
Defined in Data.Sequences | |
| type Index Text | |
Defined in Data.Sequences | |
| type Index Text | |
Defined in Data.Sequences | |
| type Index [a] | |
Defined in Data.Sequences | |
| type Index (NonNull seq) | |
Defined in Data.NonNull | |
| type Index (DList a) | |
Defined in Data.MonoTraversable.Instances | |
| type Index (Vector a) | |
Defined in Data.Sequences | |
| type Index (Seq a) | |
Defined in Data.Sequences | |
| type Index (NonEmpty a) | |
Defined in Data.Sequences | |
| type Index (Vector a) | |
Defined in Data.Sequences | |
| type Index (Vector a) | |
Defined in Data.Sequences | |
singleton :: MonoPointed seq => Element seq -> seq #
defaultFind :: MonoFoldable seq => (Element seq -> Bool) -> seq -> Maybe (Element seq) #
defaultIntersperse :: IsSequence seq => Element seq -> seq -> seq #
defaultReverse :: IsSequence seq => seq -> seq #
defaultSortBy :: IsSequence seq => (Element seq -> Element seq -> Ordering) -> seq -> seq #
defaultSplitWhen :: IsSequence seq => (Element seq -> Bool) -> seq -> [seq] #
vectorSortBy :: Vector v e => (e -> e -> Ordering) -> v e -> v e #
vectorSort :: (Vector v e, Ord e) => v e -> v e #
defaultCons :: IsSequence seq => Element seq -> seq -> seq #
defaultSnoc :: IsSequence seq => seq -> Element seq -> seq #
tailDef :: IsSequence seq => seq -> seq #
initDef :: IsSequence seq => seq -> seq #
splitSeq :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> [seq] #
replaceSeq :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> seq -> seq #
stripPrefix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Maybe seq #
stripSuffix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Maybe seq #
dropPrefix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> seq #
dropSuffix :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> seq #
ensurePrefix :: (Eq (Element seq), IsSequence seq) => seq -> seq -> seq #
ensureSuffix :: (Eq (Element seq), IsSequence seq) => seq -> seq -> seq #
isPrefixOf :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Bool #
isSuffixOf :: (IsSequence seq, Eq (Element seq)) => seq -> seq -> Bool #
group :: (IsSequence seq, Eq (Element seq)) => seq -> [seq] #
groupAll :: (IsSequence seq, Eq (Element seq)) => seq -> [seq] #
splitElemStrictBS :: Word8 -> ByteString -> [ByteString] #
stripPrefixStrictBS :: ByteString -> ByteString -> Maybe ByteString #
stripSuffixStrictBS :: ByteString -> ByteString -> Maybe ByteString #
splitSeqLazyBS :: Word8 -> ByteString -> [ByteString] #
stripPrefixLazyBS :: ByteString -> ByteString -> Maybe ByteString #
stripSuffixLazyBS :: ByteString -> ByteString -> Maybe ByteString #
splitSeqStrictText :: Text -> Text -> [Text] #
splitSeqLazyText :: Text -> Text -> [Text] #
replaceSeqLazyText :: Text -> Text -> Text -> Text #
sort :: (SemiSequence seq, Ord (Element seq)) => seq -> seq #
catMaybes :: (IsSequence (f (Maybe t)), Functor f, Element (f (Maybe t)) ~ Maybe t) => f (Maybe t) -> f t #
sortOn :: (Ord o, SemiSequence seq) => (Element seq -> o) -> seq -> seq #
pack :: IsSequence seq => [Element seq] -> seq #
unpack :: MonoFoldable mono => mono -> [Element mono] #
repack :: (MonoFoldable a, IsSequence b, Element a ~ Element b) => a -> b #
Instances
| Eq mono => Eq (NonNull mono) | |
| Data mono => Data (NonNull mono) | |
Defined in Data.NonNull Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NonNull mono -> c (NonNull mono) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (NonNull mono) toConstr :: NonNull mono -> Constr dataTypeOf :: NonNull mono -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (NonNull mono)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (NonNull mono)) gmapT :: (forall b. Data b => b -> b) -> NonNull mono -> NonNull mono gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NonNull mono -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NonNull mono -> r gmapQ :: (forall d. Data d => d -> u) -> NonNull mono -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> NonNull mono -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> NonNull mono -> m (NonNull mono) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NonNull mono -> m (NonNull mono) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NonNull mono -> m (NonNull mono) | |
| Ord mono => Ord (NonNull mono) | |
Defined in Data.NonNull | |
| Read mono => Read (NonNull mono) | |
Defined in Data.NonNull | |
| Show mono => Show (NonNull mono) | |
| (Semigroup mono, GrowingAppend mono) => Semigroup (NonNull mono) | |
| GrowingAppend mono => GrowingAppend (NonNull mono) | |
Defined in Data.NonNull | |
| IsSequence mono => MonoComonad (NonNull mono) | |
| MonoPointed mono => MonoPointed (NonNull mono) | |
| MonoTraversable mono => MonoTraversable (NonNull mono) | |
| MonoFoldable mono => MonoFoldable (NonNull mono) | |
Defined in Data.NonNull Methods ofoldMap :: Monoid m => (Element (NonNull mono) -> m) -> NonNull mono -> m # ofoldr :: (Element (NonNull mono) -> b -> b) -> b -> NonNull mono -> b # ofoldl' :: (a -> Element (NonNull mono) -> a) -> a -> NonNull mono -> a # otoList :: NonNull mono -> [Element (NonNull mono)] # oall :: (Element (NonNull mono) -> Bool) -> NonNull mono -> Bool # oany :: (Element (NonNull mono) -> Bool) -> NonNull mono -> Bool # onull :: NonNull mono -> Bool # olength :: NonNull mono -> Int # olength64 :: NonNull mono -> Int64 # ocompareLength :: Integral i => NonNull mono -> i -> Ordering # otraverse_ :: Applicative f => (Element (NonNull mono) -> f b) -> NonNull mono -> f () # ofor_ :: Applicative f => NonNull mono -> (Element (NonNull mono) -> f b) -> f () # omapM_ :: Applicative m => (Element (NonNull mono) -> m ()) -> NonNull mono -> m () # oforM_ :: Applicative m => NonNull mono -> (Element (NonNull mono) -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element (NonNull mono) -> m a) -> a -> NonNull mono -> m a # ofoldMap1Ex :: Semigroup m => (Element (NonNull mono) -> m) -> NonNull mono -> m # ofoldr1Ex :: (Element (NonNull mono) -> Element (NonNull mono) -> Element (NonNull mono)) -> NonNull mono -> Element (NonNull mono) # ofoldl1Ex' :: (Element (NonNull mono) -> Element (NonNull mono) -> Element (NonNull mono)) -> NonNull mono -> Element (NonNull mono) # headEx :: NonNull mono -> Element (NonNull mono) # lastEx :: NonNull mono -> Element (NonNull mono) # unsafeHead :: NonNull mono -> Element (NonNull mono) # unsafeLast :: NonNull mono -> Element (NonNull mono) # maximumByEx :: (Element (NonNull mono) -> Element (NonNull mono) -> Ordering) -> NonNull mono -> Element (NonNull mono) # minimumByEx :: (Element (NonNull mono) -> Element (NonNull mono) -> Ordering) -> NonNull mono -> Element (NonNull mono) # oelem :: Element (NonNull mono) -> NonNull mono -> Bool # onotElem :: Element (NonNull mono) -> NonNull mono -> Bool # | |
| MonoFunctor mono => MonoFunctor (NonNull mono) | |
| SemiSequence seq => SemiSequence (NonNull seq) | |
Defined in Data.NonNull Methods intersperse :: Element (NonNull seq) -> NonNull seq -> NonNull seq # reverse :: NonNull seq -> NonNull seq # find :: (Element (NonNull seq) -> Bool) -> NonNull seq -> Maybe (Element (NonNull seq)) # sortBy :: (Element (NonNull seq) -> Element (NonNull seq) -> Ordering) -> NonNull seq -> NonNull seq # cons :: Element (NonNull seq) -> NonNull seq -> NonNull seq # snoc :: NonNull seq -> Element (NonNull seq) -> NonNull seq # | |
| type Element (NonNull mono) | |
Defined in Data.NonNull | |
| type Index (NonNull seq) | |
Defined in Data.NonNull | |
fromNullable :: MonoFoldable mono => mono -> Maybe (NonNull mono) #
impureNonNull :: MonoFoldable mono => mono -> NonNull mono #
nonNull :: MonoFoldable mono => mono -> NonNull mono #
fromNonEmpty :: IsSequence seq => NonEmpty (Element seq) -> NonNull seq #
toNonEmpty :: MonoFoldable mono => NonNull mono -> NonEmpty (Element mono) #
ncons :: SemiSequence seq => Element seq -> seq -> NonNull seq #
splitFirst :: IsSequence seq => NonNull seq -> (Element seq, seq) #
nReplicate :: IsSequence seq => Index seq -> Element seq -> NonNull seq #
tail :: IsSequence seq => NonNull seq -> seq #
init :: IsSequence seq => NonNull seq -> seq #
head :: MonoFoldable mono => NonNull mono -> Element mono #
last :: MonoFoldable mono => NonNull mono -> Element mono #
ofoldr1 :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> NonNull mono -> Element mono #
ofoldl1' :: MonoFoldable mono => (Element mono -> Element mono -> Element mono) -> NonNull mono -> Element mono #
maximumBy :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> NonNull mono -> Element mono #
minimumBy :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> NonNull mono -> Element mono #
mapNonNull :: (Functor f, MonoFoldable (f b)) => (a -> b) -> NonNull (f a) -> NonNull (f b) #
class ToBuilder value builder where #
Instances
| ToBuilder Char Builder | |
Defined in Data.Builder | |
| ToBuilder Char Builder | |
Defined in Data.Builder | |
| ToBuilder ByteString Builder | |
Defined in Data.Builder Methods toBuilder :: ByteString -> Builder # | |
| ToBuilder ByteString Builder | |
Defined in Data.Builder | |
| ToBuilder Builder Builder | |
Defined in Data.Builder | |
| ToBuilder Builder Builder | |
Defined in Data.Builder | |
| ToBuilder Text Builder | |
Defined in Data.Builder | |
| ToBuilder Text Builder | |
Defined in Data.Builder | |
| ToBuilder Text Builder | |
Defined in Data.Builder | |
| ToBuilder Text Builder | |
Defined in Data.Builder | |
| a ~ Char => ToBuilder [a] Builder | |
Defined in Data.Builder | |
| a ~ Char => ToBuilder [a] Builder | |
Defined in Data.Builder | |
class Monoid builder => Builder builder lazy | builder -> lazy, lazy -> builder where #
Instances
| Builder Builder Text | |
Defined in Data.Builder | |
| Builder Builder ByteString | |
Defined in Data.Builder | |
type ByteStringBuilder = Builder #
type BlazeBuilder = Builder #
type TextBuilder = Builder #
textToBuilder :: ToBuilder Text builder => Text -> builder #
class Bifunctor (p :: Type -> Type -> Type) where #
Instances
| Bifunctor Either | |
| Bifunctor (,) | |
| Bifunctor Arg | |
| Bifunctor ((,,) x1) | |
| Bifunctor (Const :: Type -> Type -> Type) | |
| Bifunctor (Tagged :: Type -> Type -> Type) | |
| Functor f => Bifunctor (FreeF f) | |
| Bifunctor (K1 i :: Type -> Type -> Type) | |
| Bifunctor ((,,,) x1 x2) | |
| Bifunctor ((,,,,) x1 x2 x3) | |
| Functor f => Bifunctor (Clown f :: Type -> Type -> Type) | |
| Bifunctor p => Bifunctor (Flip p) | |
| Functor g => Bifunctor (Joker g :: Type -> Type -> Type) | |
| Bifunctor p => Bifunctor (WrappedBifunctor p) | |
| Bifunctor ((,,,,,) x1 x2 x3 x4) | |
| (Bifunctor f, Bifunctor g) => Bifunctor (Product f g) | |
| (Bifunctor p, Bifunctor q) => Bifunctor (Sum p q) | |
| Bifunctor ((,,,,,,) x1 x2 x3 x4 x5) | |
| (Functor f, Bifunctor p) => Bifunctor (Tannen f p) | |
| (Bifunctor p, Functor f, Functor g) => Bifunctor (Biff p f g) | |
Instances
| Functor Async | |
| Eq (Async a) | |
| Ord (Async a) | |
Defined in Control.Concurrent.Async | |
| Hashable (Async a) | |
Defined in Control.Concurrent.Async | |
waitAnyCatchSTM :: [Async a] -> STM (Async a, Either SomeException a) #
waitAnySTM :: [Async a] -> STM (Async a, a) #
waitEitherCatchSTM :: Async a -> Async b -> STM (Either (Either SomeException a) (Either SomeException b)) #
waitEitherSTM_ :: Async a -> Async b -> STM () #
waitBothSTM :: Async a -> Async b -> STM (a, b) #
waitCatchSTM :: Async a -> STM (Either SomeException a) #
interact :: MonadIO m => (LText -> LText) -> m () Source #
Takes a function of type 'LText -> LText' and passes all input on stdin to it, then prints result to stdout
Uses lazy IO Uses system locale settings
Since: classy-prelude-1.3.1
getContents :: MonadIO m => m LText Source #
Read all input from stdin into a lazy Text (LText)
Uses system locale settings
Since: classy-prelude-1.3.1
getLine :: MonadIO m => m Text Source #
Read a line from stdin
Uses system locale settings
Since: classy-prelude-1.3.1
getChar :: MonadIO m => m Char Source #
Read a character from stdin
Uses system locale settings
Since: classy-prelude-1.3.1
putStrLn :: MonadIO m => Text -> m () Source #
Write a Text followed by a newline to stdout
Uses system locale settings
Since: classy-prelude-1.3.1
putStr :: MonadIO m => Text -> m () Source #
Write a Text to stdout
Uses system locale settings
Since: classy-prelude-1.3.1
putChar :: MonadIO m => Char -> m () Source #
Write a character to stdout
Uses system locale settings
Since: classy-prelude-1.3.1
hGetChunk :: MonadIO m => Handle -> m ByteString Source #
Read a single chunk of data as a ByteString from the given
Handle.
Under the surface, this uses hGetSome with the
default chunk size.
Since: classy-prelude-1.2.0
hPut :: MonadIO m => Handle -> ByteString -> m () Source #
Write a ByteString to the given Handle.
Since: classy-prelude-1.2.0
hGetContents :: MonadIO m => Handle -> m ByteString Source #
Strictly read the contents of the given Handle into a
ByteString.
Since: classy-prelude-1.2.0
writeFileUtf8 :: MonadIO m => FilePath -> Text -> m () Source #
Write a Text to a file using a UTF-8 character encoding.
Since: classy-prelude-1.2.0
writeFile :: MonadIO m => FilePath -> ByteString -> m () Source #
Write a ByteString to a file.
Since: classy-prelude-1.2.0
readFileUtf8 :: MonadIO m => FilePath -> m Text Source #
Strictly read a file into a Text using a UTF-8 character
encoding. In the event of a character encoding error, a Unicode
replacement character will be used (a.k.a., lenientDecode).
Since: classy-prelude-1.2.0
readFile :: MonadIO m => FilePath -> m ByteString Source #
Strictly read a file into a ByteString.
Since: classy-prelude-1.2.0
waitCatchAsync :: MonadIO m => Async a -> m (Either SomeException a) Source #
waitCatchSTM for any MonadIO
Since: classy-prelude-1.0.0
fromByteVector :: SVector Word8 -> ByteString Source #
Convert a storable Vector into a ByteString.
toByteVector :: ByteString -> SVector Word8 Source #
Convert a ByteString into a storable Vector.
(<||>) :: Applicative a => a Bool -> a Bool -> a Bool infixr 2 Source #
|| lifted to an Applicative.
Since: classy-prelude-0.12.8
(<&&>) :: Applicative a => a Bool -> a Bool -> a Bool infixr 3 Source #
&& lifted to an Applicative.
Since: classy-prelude-0.12.8
applyDList :: DList a -> [a] -> [a] Source #
Synonym for apply
Since 0.11.0
unlessM :: Monad m => m Bool -> m () -> m () Source #
Only perform the action if the predicate returns False.
Since 0.9.2
whenM :: Monad m => m Bool -> m () -> m () Source #
Only perform the action if the predicate returns True.
Since 0.9.2
ordNubBy :: Ord b => (a -> b) -> (a -> a -> Bool) -> [a] -> [a] Source #
yieldThread :: MonadIO m => m () Source #
Originally yield.
traceShowM :: (Show a, Monad m) => a -> m () Source #
Since 0.5.9
traceShowId :: Show a => a -> a Source #
Since 0.5.9
trace :: String -> a -> a Source #
We define our own trace (and also its variants) which provides a warning
when used. So that tracing is available during development, but the compiler
reminds you to not leave them in the code for production.
undefined :: HasCallStack => a Source #
We define our own undefined which is marked as deprecated. This makes it
useful to use during development, but lets you more easily get
notifications if you accidentally ship partial code in production.
The classy prelude recommendation for when you need to really have a partial
function in production is to use error with a very descriptive message so
that, in case an exception is thrown, you get more information than
Prelude..undefined
Since 0.5.5
sortWith :: (Ord a, IsSequence c) => (Element c -> a) -> c -> c Source #
Sort elements using the user supplied function to project something out of each element. Inspired by http://hackage.haskell.org/packages/archive/base/latest/doc/html/GHC-Exts.html#v:sortWith.
asByteString :: ByteString -> ByteString Source #
intersect :: SetContainer a => a -> a -> a Source #
An alias for intersection.
(\\) :: SetContainer a => a -> a -> a infixl 9 Source #
An alias for difference.
charToUpper :: Char -> Char Source #
Convert a character to upper case.
Character-based case conversion is lossy in comparison to string-based toUpper.
For instance, ß won't be converted to SS.
charToLower :: Char -> Char Source #
Convert a character to lower case.
Character-based case conversion is lossy in comparison to string-based toLower.
For instance, İ will be converted to i, instead of i̇.
class Monad m => MonadReader r (m :: Type -> Type) | m -> r where #
Minimal complete definition
(ask | reader), local
Instances
| MonadReader e m => MonadReader e (CatchT m) | |
Defined in Control.Monad.Catch.Pure | |
| MonadReader r m => MonadReader r (ResourceT m) | |
| MonadReader r m => MonadReader r (MaybeT m) | |
Defined in Control.Monad.Reader.Class | |
| MonadReader r m => MonadReader r (ListT m) | |
Defined in Control.Monad.Reader.Class | |
| MonadReader r m => MonadReader r (NoLoggingT m) | |
Defined in Control.Monad.Logger | |
| MonadReader r m => MonadReader r (LoggingT m) | |
Defined in Control.Monad.Logger | |
| (Functor m, MonadReader e m) => MonadReader e (Free m) | |
Defined in Control.Monad.Free | |
| (Representable f, Rep f ~ a) => MonadReader a (Co f) | |
Defined in Data.Functor.Rep | |
| (Monoid w, MonadReader r m) => MonadReader r (WriterT w m) | |
Defined in Control.Monad.Reader.Class | |
| (Monoid w, MonadReader r m) => MonadReader r (WriterT w m) | |
Defined in Control.Monad.Reader.Class | |
| MonadReader r m => MonadReader r (StateT s m) | |
Defined in Control.Monad.Reader.Class | |
| MonadReader r m => MonadReader r (StateT s m) | |
Defined in Control.Monad.Reader.Class | |
| Monad m => MonadReader r (ReaderT r m) | |
| MonadReader r m => MonadReader r (IdentityT m) | |
Defined in Control.Monad.Reader.Class | |
| MonadReader r m => MonadReader r (ExceptT e m) | |
Defined in Control.Monad.Reader.Class | |
| (Error e, MonadReader r m) => MonadReader r (ErrorT e m) | |
Defined in Control.Monad.Reader.Class | |
| (Functor f, MonadReader r m) => MonadReader r (FreeT f m) | |
Defined in Control.Monad.Trans.Free | |
| MonadReader r m => MonadReader r (ConduitT i o m) | |
| MonadReader r ((->) r :: Type -> Type) | |
Defined in Control.Monad.Reader.Class | |
| MonadReader r' m => MonadReader r' (ContT r m) | |
Defined in Control.Monad.Reader.Class | |
| (Monad m, Monoid w) => MonadReader r (RWST r w s m) | |
Defined in Control.Monad.Reader.Class | |
| (Monad m, Monoid w) => MonadReader r (RWST r w s m) | |
Defined in Control.Monad.Reader.Class | |
| MonadReader r m => MonadReader r (Pipe l i o u m) | |
Defined in Data.Conduit.Internal.Pipe | |
| MonadReader (WidgetData site) (WidgetFor site) | |
| MonadReader (HandlerData site site) (HandlerFor site) | |
Defined in Yesod.Core.Types Methods ask :: HandlerFor site (HandlerData site site) # local :: (HandlerData site site -> HandlerData site site) -> HandlerFor site a -> HandlerFor site a reader :: (HandlerData site site -> a) -> HandlerFor site a | |
| MonadReader (HandlerData child master) (SubHandlerFor child master) | |
Defined in Yesod.Core.Types Methods ask :: SubHandlerFor child master (HandlerData child master) # local :: (HandlerData child master -> HandlerData child master) -> SubHandlerFor child master a -> SubHandlerFor child master a reader :: (HandlerData child master -> a) -> SubHandlerFor child master a | |
asks :: MonadReader r m => (r -> a) -> m a #
Constructors
| ModifiedJulianDay | |
Fields | |
Instances
| Enum Day | |
| Eq Day | |
| Data Day | |
Defined in Data.Time.Calendar.Days Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Day -> c Day gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Day dataTypeOf :: Day -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Day) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Day) gmapT :: (forall b. Data b => b -> b) -> Day -> Day gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Day -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Day -> r gmapQ :: (forall d. Data d => d -> u) -> Day -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Day -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Day -> m Day gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Day -> m Day gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Day -> m Day | |
| Ord Day | |
| Ix Day | |
| ToJSON Day | |
| ToJSONKey Day | |
Defined in Data.Aeson.Types.ToJSON | |
| FromJSON Day | |
| FromJSONKey Day | |
Defined in Data.Aeson.Types.FromJSON Methods | |
| NFData Day | |
Defined in Data.Time.Calendar.Days | |
| PersistField Day | |
Defined in Database.Persist.Class.PersistField Methods toPersistValue :: Day -> PersistValue Source # fromPersistValue :: PersistValue -> Either Text Day Source # | |
| PathPiece Day | |
Defined in Web.PathPieces | |
parseTimeM :: (MonadFail m, ParseTime t) => Bool -> TimeLocale -> String -> String -> m t #
defaultTimeLocale :: TimeLocale #
formatTime :: FormatTime t => TimeLocale -> String -> t -> String #
getCurrentTime :: IO UTCTime #
newtype ReaderT r (m :: Type -> Type) a #
Constructors
| ReaderT | |
Fields
| |
Instances
| Monad m => MonadReader r (ReaderT r m) | |
| MonadBaseControl b m => MonadBaseControl b (ReaderT r m) | |
Defined in Control.Monad.Trans.Control Associated Types type StM (ReaderT r m) a | |
| MonadTrans (ReaderT r) | |
Defined in Control.Monad.Trans.Reader | |
| MonadTransControl (ReaderT r) | |
| Monad m => Monad (ReaderT r m) | |
| Functor m => Functor (ReaderT r m) | |
| MonadFix m => MonadFix (ReaderT r m) | |
Defined in Control.Monad.Trans.Reader | |
| MonadFail m => MonadFail (ReaderT r m) | |
Defined in Control.Monad.Trans.Reader | |
| Applicative m => Applicative (ReaderT r m) | |
Defined in Control.Monad.Trans.Reader | |
| MonadUnliftIO m => MonadUnliftIO (ReaderT r m) | |
Defined in Control.Monad.IO.Unlift | |
| PrimMonad m => PrimMonad (ReaderT r m) | |
| Alternative m => Alternative (ReaderT r m) | |
| MonadPlus m => MonadPlus (ReaderT r m) | |
| MonadIO m => MonadIO (ReaderT r m) | |
Defined in Control.Monad.Trans.Reader | |
| MonadThrow m => MonadThrow (ReaderT r m) | |
Defined in Control.Monad.Catch | |
| MonadResource m => MonadResource (ReaderT r m) | |
Defined in Control.Monad.Trans.Resource.Internal Methods liftResourceT :: ResourceT IO a -> ReaderT r m a # | |
| MonadWidget m => MonadWidget (ReaderT r m) | |
Defined in Yesod.Core.Class.Handler Methods liftWidget :: WidgetFor (HandlerSite (ReaderT r m)) a -> ReaderT r m a # | |
| MonadHandler m => MonadHandler (ReaderT r m) | |
Defined in Yesod.Core.Class.Handler Methods liftHandler :: HandlerFor (HandlerSite (ReaderT r m)) a -> ReaderT r m a # liftSubHandler :: SubHandlerFor (SubHandlerSite (ReaderT r m)) (HandlerSite (ReaderT r m)) a -> ReaderT r m a # | |
| MonadLogger m => MonadLogger (ReaderT r m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> ReaderT r m () | |
| Zip m => Zip (ReaderT e m) | |
| Indexable m => Indexable (ReaderT e m) | |
| Keyed m => Keyed (ReaderT e m) | |
Defined in Data.Key Methods mapWithKey :: (Key (ReaderT e m) -> a -> b) -> ReaderT e m a -> ReaderT e m b | |
| Lookup m => Lookup (ReaderT e m) | |
| Zip m => Zip (ReaderT e m) | |
| ZipWithKey m => ZipWithKey (ReaderT e m) | |
| Contravariant m => Contravariant (ReaderT r m) | |
| Representable m => Representable (ReaderT e m) | |
| MonadZip m => MonadZip (ReaderT r m) | |
| MonadCatch m => MonadCatch (ReaderT r m) | |
| MonadLoggerIO m => MonadLoggerIO (ReaderT r m) | |
Defined in Control.Monad.Logger Methods askLoggerIO :: ReaderT r m (Loc -> LogSource -> LogLevel -> LogStr -> IO ()) | |
| MonadMask m => MonadMask (ReaderT r m) | |
Defined in Control.Monad.Catch Methods mask :: ((forall a. ReaderT r m a -> ReaderT r m a) -> ReaderT r m b) -> ReaderT r m b uninterruptibleMask :: ((forall a. ReaderT r m a -> ReaderT r m a) -> ReaderT r m b) -> ReaderT r m b generalBracket :: ReaderT r m a -> (a -> ExitCase b -> ReaderT r m c) -> (a -> ReaderT r m b) -> ReaderT r m (b, c) | |
| Applicative m => MonoPointed (ReaderT r m a) | |
| Functor m => MonoFunctor (ReaderT r m a) | |
| type StT (ReaderT r) a | |
Defined in Control.Monad.Trans.Control type StT (ReaderT r) a = a | |
| type PrimState (ReaderT r m) | |
Defined in Control.Monad.Primitive | |
| type HandlerSite (ReaderT r m) | |
Defined in Yesod.Core.Class.Handler | |
| type SubHandlerSite (ReaderT r m) | |
Defined in Yesod.Core.Class.Handler | |
| type Key (ReaderT e m) | |
| type Rep (ReaderT e m) | |
Defined in Data.Functor.Rep type Rep (ReaderT e m) = (e, Rep m) | |
| type StM (ReaderT r m) a | |
Defined in Control.Monad.Trans.Control | |
| type Element (ReaderT r m a) | |
Defined in Data.MonoTraversable | |
data WrappedMonoid m #
Instances
liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d #
liftA :: Applicative f => (a -> b) -> f a -> f b #
(<**>) :: Applicative f => f a -> f (a -> b) -> f b #
optional :: Alternative f => f a -> f (Maybe a) #
Minimal complete definition
Nothing
Instances
class Applicative f => Alternative (f :: Type -> Type) where #
Instances
primToPrim :: (PrimBase m1, PrimMonad m2, PrimState m1 ~ PrimState m2) => m1 a -> m2 a #
Constructors
| Identity | |
Fields
| |
Instances
Instances
| Monad DList | |
| Functor DList | |
| MonadFail DList | |
Defined in Data.DList | |
| Applicative DList | |
| Foldable DList | |
Defined in Data.DList Methods fold :: Monoid m => DList m -> m foldMap :: Monoid m => (a -> m) -> DList a -> m foldMap' :: Monoid m => (a -> m) -> DList a -> m foldr :: (a -> b -> b) -> b -> DList a -> b foldr' :: (a -> b -> b) -> b -> DList a -> b foldl :: (b -> a -> b) -> b -> DList a -> b foldl' :: (b -> a -> b) -> b -> DList a -> b foldr1 :: (a -> a -> a) -> DList a -> a foldl1 :: (a -> a -> a) -> DList a -> a elem :: Eq a => a -> DList a -> Bool maximum :: Ord a => DList a -> a | |
| ToJSON1 DList | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> DList a -> Value Source # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [DList a] -> Value Source # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> DList a -> Encoding Source # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [DList a] -> Encoding Source # | |
| FromJSON1 DList | |
| Alternative DList | |
| MonadPlus DList | |
| FromPairs Value (DList Pair) | |
Defined in Data.Aeson.Types.ToJSON | |
| v ~ Value => KeyValuePair v (DList Pair) | |
Defined in Data.Aeson.Types.ToJSON | |
| IsList (DList a) | |
| Eq a => Eq (DList a) | |
| Ord a => Ord (DList a) | |
| Read a => Read (DList a) | |
Defined in Data.DList | |
| Show a => Show (DList a) | |
| a ~ Char => IsString (DList a) | |
Defined in Data.DList Methods fromString :: String -> DList a # | |
| Semigroup (DList a) | |
| Monoid (DList a) | |
| ToJSON a => ToJSON (DList a) | |
| FromJSON a => FromJSON (DList a) | |
| NFData a => NFData (DList a) | |
Defined in Data.DList | |
| type Element (DList a) | |
Defined in Data.MonoTraversable.Instances | |
| type Index (DList a) | |
Defined in Data.MonoTraversable.Instances | |
| type Item (DList a) | |
Defined in Data.DList type Item (DList a) = a | |
Instances
| Foldable HashSet | |
Defined in Data.HashSet.Base Methods fold :: Monoid m => HashSet m -> m foldMap :: Monoid m => (a -> m) -> HashSet a -> m foldMap' :: Monoid m => (a -> m) -> HashSet a -> m foldr :: (a -> b -> b) -> b -> HashSet a -> b foldr' :: (a -> b -> b) -> b -> HashSet a -> b foldl :: (b -> a -> b) -> b -> HashSet a -> b foldl' :: (b -> a -> b) -> b -> HashSet a -> b foldr1 :: (a -> a -> a) -> HashSet a -> a foldl1 :: (a -> a -> a) -> HashSet a -> a elem :: Eq a => a -> HashSet a -> Bool maximum :: Ord a => HashSet a -> a minimum :: Ord a => HashSet a -> a | |
| ToJSON1 HashSet | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> HashSet a -> Value Source # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [HashSet a] -> Value Source # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> HashSet a -> Encoding Source # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [HashSet a] -> Encoding Source # | |
| Eq1 HashSet | |
| Ord1 HashSet | |
Defined in Data.HashSet.Base Methods liftCompare :: (a -> b -> Ordering) -> HashSet a -> HashSet b -> Ordering | |
| Show1 HashSet | |
Defined in Data.HashSet.Base Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> HashSet a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [HashSet a] -> ShowS | |
| Hashable1 HashSet | |
Defined in Data.HashSet.Base | |
| (Eq a, Hashable a) => IsList (HashSet a) | |
| Eq a => Eq (HashSet a) | |
| (Data a, Eq a, Hashable a) => Data (HashSet a) | |
Defined in Data.HashSet.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HashSet a -> c (HashSet a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HashSet a) toConstr :: HashSet a -> Constr dataTypeOf :: HashSet a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HashSet a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HashSet a)) gmapT :: (forall b. Data b => b -> b) -> HashSet a -> HashSet a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HashSet a -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HashSet a -> r gmapQ :: (forall d. Data d => d -> u) -> HashSet a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> HashSet a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> HashSet a -> m (HashSet a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HashSet a -> m (HashSet a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HashSet a -> m (HashSet a) | |
| Ord a => Ord (HashSet a) | |
| (Eq a, Hashable a, Read a) => Read (HashSet a) | |
Defined in Data.HashSet.Base | |
| Show a => Show (HashSet a) | |
| (Hashable a, Eq a) => Semigroup (HashSet a) | |
| (Hashable a, Eq a) => Monoid (HashSet a) | |
| Hashable a => Hashable (HashSet a) | |
Defined in Data.HashSet.Base | |
| ToJSON a => ToJSON (HashSet a) | |
| (Eq a, Hashable a, FromJSON a) => FromJSON (HashSet a) | |
| (Eq v, Hashable v) => GrowingAppend (HashSet v) | |
Defined in Data.MonoTraversable | |
| Hashable a => MonoPointed (HashSet a) | |
| MonoFoldable (HashSet e) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (HashSet e) -> m) -> HashSet e -> m # ofoldr :: (Element (HashSet e) -> b -> b) -> b -> HashSet e -> b # ofoldl' :: (a -> Element (HashSet e) -> a) -> a -> HashSet e -> a # otoList :: HashSet e -> [Element (HashSet e)] # oall :: (Element (HashSet e) -> Bool) -> HashSet e -> Bool # oany :: (Element (HashSet e) -> Bool) -> HashSet e -> Bool # olength64 :: HashSet e -> Int64 # ocompareLength :: Integral i => HashSet e -> i -> Ordering # otraverse_ :: Applicative f => (Element (HashSet e) -> f b) -> HashSet e -> f () # ofor_ :: Applicative f => HashSet e -> (Element (HashSet e) -> f b) -> f () # omapM_ :: Applicative m => (Element (HashSet e) -> m ()) -> HashSet e -> m () # oforM_ :: Applicative m => HashSet e -> (Element (HashSet e) -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element (HashSet e) -> m a) -> a -> HashSet e -> m a # ofoldMap1Ex :: Semigroup m => (Element (HashSet e) -> m) -> HashSet e -> m # ofoldr1Ex :: (Element (HashSet e) -> Element (HashSet e) -> Element (HashSet e)) -> HashSet e -> Element (HashSet e) # ofoldl1Ex' :: (Element (HashSet e) -> Element (HashSet e) -> Element (HashSet e)) -> HashSet e -> Element (HashSet e) # headEx :: HashSet e -> Element (HashSet e) # lastEx :: HashSet e -> Element (HashSet e) # unsafeHead :: HashSet e -> Element (HashSet e) # unsafeLast :: HashSet e -> Element (HashSet e) # maximumByEx :: (Element (HashSet e) -> Element (HashSet e) -> Ordering) -> HashSet e -> Element (HashSet e) # minimumByEx :: (Element (HashSet e) -> Element (HashSet e) -> Ordering) -> HashSet e -> Element (HashSet e) # | |
| (Eq element, Hashable element) => IsSet (HashSet element) | |
Defined in Data.Containers Methods insertSet :: Element (HashSet element) -> HashSet element -> HashSet element # deleteSet :: Element (HashSet element) -> HashSet element -> HashSet element # singletonSet :: Element (HashSet element) -> HashSet element # setFromList :: [Element (HashSet element)] -> HashSet element # setToList :: HashSet element -> [Element (HashSet element)] # filterSet :: (Element (HashSet element) -> Bool) -> HashSet element -> HashSet element # | |
| (Eq element, Hashable element) => SetContainer (HashSet element) | |
Defined in Data.Containers Associated Types type ContainerKey (HashSet element) # Methods member :: ContainerKey (HashSet element) -> HashSet element -> Bool # notMember :: ContainerKey (HashSet element) -> HashSet element -> Bool # union :: HashSet element -> HashSet element -> HashSet element # unions :: (MonoFoldable mono, Element mono ~ HashSet element) => mono -> HashSet element # difference :: HashSet element -> HashSet element -> HashSet element # intersection :: HashSet element -> HashSet element -> HashSet element # keys :: HashSet element -> [ContainerKey (HashSet element)] # | |
| NFData a => NFData (HashSet a) | |
Defined in Data.HashSet.Base | |
| type Element (HashSet e) | |
Defined in Data.MonoTraversable | |
| type ContainerKey (HashSet element) | |
Defined in Data.Containers | |
| type Item (HashSet a) | |
Defined in Data.HashSet.Base type Item (HashSet a) = a | |
class (Vector Vector a, MVector MVector a) => Unbox a #
Instances
Instances
| Monad Vector | |
| Functor Vector | |
| MonadFail Vector | |
Defined in Data.Vector | |
| Applicative Vector | |
| Foldable Vector | |
Defined in Data.Vector Methods fold :: Monoid m => Vector m -> m foldMap :: Monoid m => (a -> m) -> Vector a -> m foldMap' :: Monoid m => (a -> m) -> Vector a -> m foldr :: (a -> b -> b) -> b -> Vector a -> b foldr' :: (a -> b -> b) -> b -> Vector a -> b foldl :: (b -> a -> b) -> b -> Vector a -> b foldl' :: (b -> a -> b) -> b -> Vector a -> b foldr1 :: (a -> a -> a) -> Vector a -> a foldl1 :: (a -> a -> a) -> Vector a -> a elem :: Eq a => a -> Vector a -> Bool maximum :: Ord a => Vector a -> a | |
| Traversable Vector | |
| ToJSON1 Vector | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Vector a -> Value Source # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Vector a] -> Value Source # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Vector a -> Encoding Source # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Vector a] -> Encoding Source # | |
| FromJSON1 Vector | |
| Alternative Vector | |
| MonadPlus Vector | |
| Zip Vector | |
| Zip3 Vector | |
Defined in Data.ChunkedZip | |
| Zip4 Vector | |
Defined in Data.ChunkedZip Methods zipWith4 :: (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e # zip4 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector (a, b, c, d) # zap4 :: Vector (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d unzip4 :: Vector (a, b, c, d) -> (Vector a, Vector b, Vector c, Vector d) # | |
| Zip5 Vector | |
Defined in Data.ChunkedZip Methods zipWith5 :: (a -> b -> c -> d -> e -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector g # zip5 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector (a, b, c, d, e) # zap5 :: Vector (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e unzip5 :: Vector (a, b, c, d, e) -> (Vector a, Vector b, Vector c, Vector d, Vector e) # | |
| Zip6 Vector | |
Defined in Data.ChunkedZip Methods zipWith6 :: (a -> b -> c -> d -> e -> g -> h) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector g -> Vector h # zip6 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector g -> Vector (a, b, c, d, e, g) # zap6 :: Vector (a -> b -> c -> d -> e -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector g unzip6 :: Vector (a, b, c, d, e, g) -> (Vector a, Vector b, Vector c, Vector d, Vector e, Vector g) # | |
| Eq1 Vector | |
| Ord1 Vector | |
Defined in Data.Vector Methods liftCompare :: (a -> b -> Ordering) -> Vector a -> Vector b -> Ordering | |
| Read1 Vector | |
Defined in Data.Vector Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Vector a) liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Vector a] liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Vector a) liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Vector a] | |
| Show1 Vector | |
Defined in Data.Vector Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Vector a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Vector a] -> ShowS | |
| MonadZip Vector | |
| NFData1 Vector | |
Defined in Data.Vector | |
| Vector Vector a | |
Defined in Data.Vector Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) a -> m (Vector a) basicUnsafeThaw :: PrimMonad m => Vector a -> m (Mutable Vector (PrimState m) a) basicLength :: Vector a -> Int basicUnsafeSlice :: Int -> Int -> Vector a -> Vector a basicUnsafeIndexM :: Monad m => Vector a -> Int -> m a basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) a -> Vector a -> m () | |
| IsList (Vector a) | |
| Eq a => Eq (Vector a) | |
| Data a => Data (Vector a) | |
Defined in Data.Vector Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Vector a -> c (Vector a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Vector a) toConstr :: Vector a -> Constr dataTypeOf :: Vector a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Vector a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Vector a)) gmapT :: (forall b. Data b => b -> b) -> Vector a -> Vector a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Vector a -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Vector a -> r gmapQ :: (forall d. Data d => d -> u) -> Vector a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Vector a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a) | |
| Ord a => Ord (Vector a) | |
Defined in Data.Vector | |
| Read a => Read (Vector a) | |
Defined in Data.Vector | |
| Show a => Show (Vector a) | |
| Semigroup (Vector a) | |
| Monoid (Vector a) | |
| ToJSON a => ToJSON (Vector a) | |
| FromJSON a => FromJSON (Vector a) | |
| GrowingAppend (Vector a) | |
Defined in Data.MonoTraversable | |
| MonoPointed (Vector a) | |
| MonoTraversable (Vector a) | |
| MonoFoldable (Vector a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr :: (Element (Vector a) -> b -> b) -> b -> Vector a -> b # ofoldl' :: (a0 -> Element (Vector a) -> a0) -> a0 -> Vector a -> a0 # otoList :: Vector a -> [Element (Vector a)] # oall :: (Element (Vector a) -> Bool) -> Vector a -> Bool # oany :: (Element (Vector a) -> Bool) -> Vector a -> Bool # olength64 :: Vector a -> Int64 # ocompareLength :: Integral i => Vector a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Vector a) -> f b) -> Vector a -> f () # ofor_ :: Applicative f => Vector a -> (Element (Vector a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Vector a) -> m ()) -> Vector a -> m () # oforM_ :: Applicative m => Vector a -> (Element (Vector a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Vector a) -> m a0) -> a0 -> Vector a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Vector a) -> m) -> Vector a -> m # ofoldr1Ex :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # ofoldl1Ex' :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # headEx :: Vector a -> Element (Vector a) # lastEx :: Vector a -> Element (Vector a) # unsafeHead :: Vector a -> Element (Vector a) # unsafeLast :: Vector a -> Element (Vector a) # maximumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # minimumByEx :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Element (Vector a) # | |
| MonoFunctor (Vector a) | |
| IsSequence (Vector a) | |
Defined in Data.Sequences Methods fromList :: [Element (Vector a)] -> Vector a # lengthIndex :: Vector a -> Index (Vector a) # break :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # span :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # dropWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # takeWhile :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # splitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # unsafeSplitAt :: Index (Vector a) -> Vector a -> (Vector a, Vector a) # take :: Index (Vector a) -> Vector a -> Vector a # unsafeTake :: Index (Vector a) -> Vector a -> Vector a # drop :: Index (Vector a) -> Vector a -> Vector a # unsafeDrop :: Index (Vector a) -> Vector a -> Vector a # dropEnd :: Index (Vector a) -> Vector a -> Vector a # partition :: (Element (Vector a) -> Bool) -> Vector a -> (Vector a, Vector a) # uncons :: Vector a -> Maybe (Element (Vector a), Vector a) # unsnoc :: Vector a -> Maybe (Vector a, Element (Vector a)) # filter :: (Element (Vector a) -> Bool) -> Vector a -> Vector a # filterM :: Monad m => (Element (Vector a) -> m Bool) -> Vector a -> m (Vector a) # replicate :: Index (Vector a) -> Element (Vector a) -> Vector a # replicateM :: Monad m => Index (Vector a) -> m (Element (Vector a)) -> m (Vector a) # groupBy :: (Element (Vector a) -> Element (Vector a) -> Bool) -> Vector a -> [Vector a] # groupAllOn :: Eq b => (Element (Vector a) -> b) -> Vector a -> [Vector a] # subsequences :: Vector a -> [Vector a] # permutations :: Vector a -> [Vector a] # tailEx :: Vector a -> Vector a # tailMay :: Vector a -> Maybe (Vector a) # initEx :: Vector a -> Vector a # initMay :: Vector a -> Maybe (Vector a) # unsafeTail :: Vector a -> Vector a # unsafeInit :: Vector a -> Vector a # index :: Vector a -> Index (Vector a) -> Maybe (Element (Vector a)) # indexEx :: Vector a -> Index (Vector a) -> Element (Vector a) # unsafeIndex :: Vector a -> Index (Vector a) -> Element (Vector a) # splitWhen :: (Element (Vector a) -> Bool) -> Vector a -> [Vector a] # | |
| SemiSequence (Vector a) | |
Defined in Data.Sequences Methods intersperse :: Element (Vector a) -> Vector a -> Vector a # reverse :: Vector a -> Vector a # find :: (Element (Vector a) -> Bool) -> Vector a -> Maybe (Element (Vector a)) # sortBy :: (Element (Vector a) -> Element (Vector a) -> Ordering) -> Vector a -> Vector a # | |
| NFData a => NFData (Vector a) | |
Defined in Data.Vector | |
| PersistField a => PersistField (Vector a) | |
Defined in Database.Persist.Class.PersistField Methods toPersistValue :: Vector a -> PersistValue Source # fromPersistValue :: PersistValue -> Either Text (Vector a) Source # | |
| type Key Vector | |
Defined in Data.Vector.Instances | |
| type Mutable Vector | |
Defined in Data.Vector type Mutable Vector = MVector | |
| type Element (Vector a) | |
Defined in Data.MonoTraversable | |
| type Index (Vector a) | |
Defined in Data.Sequences | |
| type Item (Vector a) | |
Defined in Data.Vector type Item (Vector a) = a | |
Minimal complete definition
sizeOf, alignment, (peek | peekElemOff | peekByteOff), (poke | pokeElemOff | pokeByteOff)
Instances
| Storable Bool | |
Defined in Foreign.Storable | |
| Storable Char | |
Defined in Foreign.Storable | |
| Storable Double | |
Defined in Foreign.Storable | |
| Storable Float | |
Defined in Foreign.Storable | |
| Storable Int | |
| Storable Int8 | |
Defined in Foreign.Storable Methods peekElemOff :: Ptr Int8 -> Int -> IO Int8 pokeElemOff :: Ptr Int8 -> Int -> Int8 -> IO () peekByteOff :: Ptr b -> Int -> IO Int8 pokeByteOff :: Ptr b -> Int -> Int8 -> IO () | |
| Storable Int16 | |
Defined in Foreign.Storable Methods peekElemOff :: Ptr Int16 -> Int -> IO Int16 pokeElemOff :: Ptr Int16 -> Int -> Int16 -> IO () peekByteOff :: Ptr b -> Int -> IO Int16 pokeByteOff :: Ptr b -> Int -> Int16 -> IO () | |
| Storable Int32 | |
Defined in Foreign.Storable | |
| Storable Int64 | |
Defined in Foreign.Storable | |
| Storable Word | |
Defined in Foreign.Storable | |
| Storable Word8 | |
Defined in Foreign.Storable | |
| Storable Word16 | |
Defined in Foreign.Storable Methods peekElemOff :: Ptr Word16 -> Int -> IO Word16 pokeElemOff :: Ptr Word16 -> Int -> Word16 -> IO () peekByteOff :: Ptr b -> Int -> IO Word16 pokeByteOff :: Ptr b -> Int -> Word16 -> IO () | |
| Storable Word32 | |
Defined in Foreign.Storable | |
| Storable Word64 | |
Defined in Foreign.Storable | |
| Storable () | |
Defined in Foreign.Storable Methods peekElemOff :: Ptr () -> Int -> IO () pokeElemOff :: Ptr () -> Int -> () -> IO () peekByteOff :: Ptr b -> Int -> IO () pokeByteOff :: Ptr b -> Int -> () -> IO () | |
| Storable CTime | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CTime -> Int -> IO CTime pokeElemOff :: Ptr CTime -> Int -> CTime -> IO () peekByteOff :: Ptr b -> Int -> IO CTime pokeByteOff :: Ptr b -> Int -> CTime -> IO () | |
| Storable AddrInfo | |
Defined in Network.Socket.Info Methods peekElemOff :: Ptr AddrInfo -> Int -> IO AddrInfo pokeElemOff :: Ptr AddrInfo -> Int -> AddrInfo -> IO () peekByteOff :: Ptr b -> Int -> IO AddrInfo pokeByteOff :: Ptr b -> Int -> AddrInfo -> IO () | |
| Storable CInt | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CInt -> Int -> IO CInt pokeElemOff :: Ptr CInt -> Int -> CInt -> IO () peekByteOff :: Ptr b -> Int -> IO CInt pokeByteOff :: Ptr b -> Int -> CInt -> IO () | |
| Storable CChar | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CChar -> Int -> IO CChar pokeElemOff :: Ptr CChar -> Int -> CChar -> IO () peekByteOff :: Ptr b -> Int -> IO CChar pokeByteOff :: Ptr b -> Int -> CChar -> IO () | |
| Storable CSize | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CSize -> Int -> IO CSize pokeElemOff :: Ptr CSize -> Int -> CSize -> IO () peekByteOff :: Ptr b -> Int -> IO CSize pokeByteOff :: Ptr b -> Int -> CSize -> IO () | |
| Storable CBool | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CBool -> Int -> IO CBool pokeElemOff :: Ptr CBool -> Int -> CBool -> IO () peekByteOff :: Ptr b -> Int -> IO CBool pokeByteOff :: Ptr b -> Int -> CBool -> IO () | |
| Storable CClock | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CClock -> Int -> IO CClock pokeElemOff :: Ptr CClock -> Int -> CClock -> IO () peekByteOff :: Ptr b -> Int -> IO CClock pokeByteOff :: Ptr b -> Int -> CClock -> IO () | |
| Storable CDouble | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CDouble -> Int -> IO CDouble pokeElemOff :: Ptr CDouble -> Int -> CDouble -> IO () peekByteOff :: Ptr b -> Int -> IO CDouble pokeByteOff :: Ptr b -> Int -> CDouble -> IO () | |
| Storable CFloat | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CFloat -> Int -> IO CFloat pokeElemOff :: Ptr CFloat -> Int -> CFloat -> IO () peekByteOff :: Ptr b -> Int -> IO CFloat pokeByteOff :: Ptr b -> Int -> CFloat -> IO () | |
| Storable CIntMax | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CIntMax -> Int -> IO CIntMax pokeElemOff :: Ptr CIntMax -> Int -> CIntMax -> IO () peekByteOff :: Ptr b -> Int -> IO CIntMax pokeByteOff :: Ptr b -> Int -> CIntMax -> IO () | |
| Storable CIntPtr | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CIntPtr -> Int -> IO CIntPtr pokeElemOff :: Ptr CIntPtr -> Int -> CIntPtr -> IO () peekByteOff :: Ptr b -> Int -> IO CIntPtr pokeByteOff :: Ptr b -> Int -> CIntPtr -> IO () | |
| Storable CLLong | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CLLong -> Int -> IO CLLong pokeElemOff :: Ptr CLLong -> Int -> CLLong -> IO () peekByteOff :: Ptr b -> Int -> IO CLLong pokeByteOff :: Ptr b -> Int -> CLLong -> IO () | |
| Storable CLong | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CLong -> Int -> IO CLong pokeElemOff :: Ptr CLong -> Int -> CLong -> IO () peekByteOff :: Ptr b -> Int -> IO CLong pokeByteOff :: Ptr b -> Int -> CLong -> IO () | |
| Storable CPtrdiff | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CPtrdiff -> Int -> IO CPtrdiff pokeElemOff :: Ptr CPtrdiff -> Int -> CPtrdiff -> IO () peekByteOff :: Ptr b -> Int -> IO CPtrdiff pokeByteOff :: Ptr b -> Int -> CPtrdiff -> IO () | |
| Storable CSChar | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CSChar -> Int -> IO CSChar pokeElemOff :: Ptr CSChar -> Int -> CSChar -> IO () peekByteOff :: Ptr b -> Int -> IO CSChar pokeByteOff :: Ptr b -> Int -> CSChar -> IO () | |
| Storable CSUSeconds | |
Defined in Foreign.C.Types Methods alignment :: CSUSeconds -> Int peekElemOff :: Ptr CSUSeconds -> Int -> IO CSUSeconds pokeElemOff :: Ptr CSUSeconds -> Int -> CSUSeconds -> IO () peekByteOff :: Ptr b -> Int -> IO CSUSeconds pokeByteOff :: Ptr b -> Int -> CSUSeconds -> IO () | |
| Storable CShort | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CShort -> Int -> IO CShort pokeElemOff :: Ptr CShort -> Int -> CShort -> IO () peekByteOff :: Ptr b -> Int -> IO CShort pokeByteOff :: Ptr b -> Int -> CShort -> IO () | |
| Storable CSigAtomic | |
Defined in Foreign.C.Types Methods alignment :: CSigAtomic -> Int peekElemOff :: Ptr CSigAtomic -> Int -> IO CSigAtomic pokeElemOff :: Ptr CSigAtomic -> Int -> CSigAtomic -> IO () peekByteOff :: Ptr b -> Int -> IO CSigAtomic pokeByteOff :: Ptr b -> Int -> CSigAtomic -> IO () | |
| Storable CUChar | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CUChar -> Int -> IO CUChar pokeElemOff :: Ptr CUChar -> Int -> CUChar -> IO () peekByteOff :: Ptr b -> Int -> IO CUChar pokeByteOff :: Ptr b -> Int -> CUChar -> IO () | |
| Storable CUInt | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CUInt -> Int -> IO CUInt pokeElemOff :: Ptr CUInt -> Int -> CUInt -> IO () peekByteOff :: Ptr b -> Int -> IO CUInt pokeByteOff :: Ptr b -> Int -> CUInt -> IO () | |
| Storable CUIntMax | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CUIntMax -> Int -> IO CUIntMax pokeElemOff :: Ptr CUIntMax -> Int -> CUIntMax -> IO () peekByteOff :: Ptr b -> Int -> IO CUIntMax pokeByteOff :: Ptr b -> Int -> CUIntMax -> IO () | |
| Storable CUIntPtr | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CUIntPtr -> Int -> IO CUIntPtr pokeElemOff :: Ptr CUIntPtr -> Int -> CUIntPtr -> IO () peekByteOff :: Ptr b -> Int -> IO CUIntPtr pokeByteOff :: Ptr b -> Int -> CUIntPtr -> IO () | |
| Storable CULLong | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CULLong -> Int -> IO CULLong pokeElemOff :: Ptr CULLong -> Int -> CULLong -> IO () peekByteOff :: Ptr b -> Int -> IO CULLong pokeByteOff :: Ptr b -> Int -> CULLong -> IO () | |
| Storable CULong | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CULong -> Int -> IO CULong pokeElemOff :: Ptr CULong -> Int -> CULong -> IO () peekByteOff :: Ptr b -> Int -> IO CULong pokeByteOff :: Ptr b -> Int -> CULong -> IO () | |
| Storable CUSeconds | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CUSeconds -> Int -> IO CUSeconds pokeElemOff :: Ptr CUSeconds -> Int -> CUSeconds -> IO () peekByteOff :: Ptr b -> Int -> IO CUSeconds pokeByteOff :: Ptr b -> Int -> CUSeconds -> IO () | |
| Storable CUShort | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CUShort -> Int -> IO CUShort pokeElemOff :: Ptr CUShort -> Int -> CUShort -> IO () peekByteOff :: Ptr b -> Int -> IO CUShort pokeByteOff :: Ptr b -> Int -> CUShort -> IO () | |
| Storable CWchar | |
Defined in Foreign.C.Types Methods peekElemOff :: Ptr CWchar -> Int -> IO CWchar pokeElemOff :: Ptr CWchar -> Int -> CWchar -> IO () peekByteOff :: Ptr b -> Int -> IO CWchar pokeByteOff :: Ptr b -> Int -> CWchar -> IO () | |
| Storable UUID | |
Defined in Data.UUID.Types.Internal Methods peekElemOff :: Ptr UUID -> Int -> IO UUID pokeElemOff :: Ptr UUID -> Int -> UUID -> IO () peekByteOff :: Ptr b -> Int -> IO UUID pokeByteOff :: Ptr b -> Int -> UUID -> IO () | |
| Storable PortNumber | |
Defined in Network.Socket.Types Methods alignment :: PortNumber -> Int peekElemOff :: Ptr PortNumber -> Int -> IO PortNumber pokeElemOff :: Ptr PortNumber -> Int -> PortNumber -> IO () peekByteOff :: Ptr b -> Int -> IO PortNumber pokeByteOff :: Ptr b -> Int -> PortNumber -> IO () | |
| Storable Fingerprint | |
Defined in Foreign.Storable Methods alignment :: Fingerprint -> Int peekElemOff :: Ptr Fingerprint -> Int -> IO Fingerprint pokeElemOff :: Ptr Fingerprint -> Int -> Fingerprint -> IO () peekByteOff :: Ptr b -> Int -> IO Fingerprint pokeByteOff :: Ptr b -> Int -> Fingerprint -> IO () | |
| Storable In6Addr | |
Defined in Network.Socket.Types Methods peekElemOff :: Ptr In6Addr -> Int -> IO In6Addr pokeElemOff :: Ptr In6Addr -> Int -> In6Addr -> IO () peekByteOff :: Ptr b -> Int -> IO In6Addr pokeByteOff :: Ptr b -> Int -> In6Addr -> IO () | |
| (Storable a, Integral a) => Storable (Ratio a) | |
Defined in Foreign.Storable Methods peekElemOff :: Ptr (Ratio a) -> Int -> IO (Ratio a) pokeElemOff :: Ptr (Ratio a) -> Int -> Ratio a -> IO () peekByteOff :: Ptr b -> Int -> IO (Ratio a) pokeByteOff :: Ptr b -> Int -> Ratio a -> IO () | |
| Storable (StablePtr a) | |
Defined in Foreign.Storable Methods alignment :: StablePtr a -> Int peekElemOff :: Ptr (StablePtr a) -> Int -> IO (StablePtr a) pokeElemOff :: Ptr (StablePtr a) -> Int -> StablePtr a -> IO () peekByteOff :: Ptr b -> Int -> IO (StablePtr a) pokeByteOff :: Ptr b -> Int -> StablePtr a -> IO () | |
| Storable (Ptr a) | |
Defined in Foreign.Storable Methods peekElemOff :: Ptr (Ptr a) -> Int -> IO (Ptr a) pokeElemOff :: Ptr (Ptr a) -> Int -> Ptr a -> IO () peekByteOff :: Ptr b -> Int -> IO (Ptr a) pokeByteOff :: Ptr b -> Int -> Ptr a -> IO () | |
| Storable (FunPtr a) | |
Defined in Foreign.Storable Methods peekElemOff :: Ptr (FunPtr a) -> Int -> IO (FunPtr a) pokeElemOff :: Ptr (FunPtr a) -> Int -> FunPtr a -> IO () peekByteOff :: Ptr b -> Int -> IO (FunPtr a) pokeByteOff :: Ptr b -> Int -> FunPtr a -> IO () | |
| Storable a => Storable (Identity a) | |
Defined in Data.Functor.Identity | |
| Prim a => Storable (PrimStorable a) | |
Defined in Data.Primitive.Types Methods sizeOf :: PrimStorable a -> Int alignment :: PrimStorable a -> Int peekElemOff :: Ptr (PrimStorable a) -> Int -> IO (PrimStorable a) pokeElemOff :: Ptr (PrimStorable a) -> Int -> PrimStorable a -> IO () peekByteOff :: Ptr b -> Int -> IO (PrimStorable a) pokeByteOff :: Ptr b -> Int -> PrimStorable a -> IO () | |
| Storable a => Storable (Tagged s a) | |
Defined in Data.Tagged Methods alignment :: Tagged s a -> Int peekElemOff :: Ptr (Tagged s a) -> Int -> IO (Tagged s a) pokeElemOff :: Ptr (Tagged s a) -> Int -> Tagged s a -> IO () peekByteOff :: Ptr b -> Int -> IO (Tagged s a) pokeByteOff :: Ptr b -> Int -> Tagged s a -> IO () | |
(^^) :: (Fractional a, Integral b) => a -> b -> a #
class (Alternative m, Monad m) => MonadPlus (m :: Type -> Type) where #
Minimal complete definition
Nothing
Instances
forever :: Applicative f => f a -> f b #
replicateM_ :: Applicative m => Int -> m a -> m () #
unless :: Applicative f => Bool -> f () -> f () #
forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b) #
liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r #
when :: Applicative f => Bool -> f () -> f () #
class (Typeable e, Show e) => Exception e where #
Minimal complete definition
Nothing
Methods
toException :: e -> SomeException #
fromException :: SomeException -> Maybe e #
displayException :: e -> String #
Instances
data SomeException #
Constructors
| Exception e => SomeException e |
Instances
| Show SomeException | |
Defined in GHC.Exception.Type Methods showsPrec :: Int -> SomeException -> ShowS # show :: SomeException -> String # showList :: [SomeException] -> ShowS # | |
| Exception SomeException | |
Defined in GHC.Exception.Type Methods toException :: SomeException -> SomeException # fromException :: SomeException -> Maybe SomeException # displayException :: SomeException -> String # | |
data IOException #
Instances
| Eq IOException | |
Defined in GHC.IO.Exception | |
| Show IOException | |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOException -> ShowS # show :: IOException -> String # showList :: [IOException] -> ShowS # | |
| Exception IOException | |
Defined in GHC.IO.Exception Methods toException :: IOException -> SomeException # fromException :: SomeException -> Maybe IOException # displayException :: IOException -> String # | |
| Error IOException | |
Defined in Control.Monad.Trans.Error | |
asum :: (Foldable t, Alternative f) => t (f a) -> f a #
Constructors
| Down a |
Instances
| Monad Down | |
| Functor Down | |
| Applicative Down | |
| Foldable Down | |
Defined in Data.Foldable Methods fold :: Monoid m => Down m -> m foldMap :: Monoid m => (a -> m) -> Down a -> m foldMap' :: Monoid m => (a -> m) -> Down a -> m foldr :: (a -> b -> b) -> b -> Down a -> b foldr' :: (a -> b -> b) -> b -> Down a -> b foldl :: (b -> a -> b) -> b -> Down a -> b foldl' :: (b -> a -> b) -> b -> Down a -> b foldr1 :: (a -> a -> a) -> Down a -> a foldl1 :: (a -> a -> a) -> Down a -> a elem :: Eq a => a -> Down a -> Bool maximum :: Ord a => Down a -> a | |
| Traversable Down | |
| NFData1 Down | |
Defined in Control.DeepSeq | |
| Unbox a => MVector MVector (Down a) | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (Down a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (Down a) -> MVector s (Down a) basicOverlaps :: MVector s (Down a) -> MVector s (Down a) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Down a)) basicInitialize :: PrimMonad m => MVector (PrimState m) (Down a) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Down a -> m (MVector (PrimState m) (Down a)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Down a) -> Int -> m (Down a) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Down a) -> Int -> Down a -> m () basicClear :: PrimMonad m => MVector (PrimState m) (Down a) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (Down a) -> Down a -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Down a) -> MVector (PrimState m) (Down a) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Down a) -> MVector (PrimState m) (Down a) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Down a) -> Int -> m (MVector (PrimState m) (Down a)) | |
| Unbox a => Vector Vector (Down a) | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Down a) -> m (Vector (Down a)) basicUnsafeThaw :: PrimMonad m => Vector (Down a) -> m (Mutable Vector (PrimState m) (Down a)) basicLength :: Vector (Down a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (Down a) -> Vector (Down a) basicUnsafeIndexM :: Monad m => Vector (Down a) -> Int -> m (Down a) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Down a) -> Vector (Down a) -> m () | |
| Eq a => Eq (Down a) | |
| Num a => Num (Down a) | |
| Ord a => Ord (Down a) | |
| Read a => Read (Down a) | |
| Show a => Show (Down a) | |
| Generic (Down a) | |
| Semigroup a => Semigroup (Down a) | |
| Monoid a => Monoid (Down a) | |
| Prim a => Prim (Down a) | |
Defined in Data.Primitive.Types Methods alignment# :: Down a -> Int# indexByteArray# :: ByteArray# -> Int# -> Down a readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Down a #) writeByteArray# :: MutableByteArray# s -> Int# -> Down a -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Down a -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Down a readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Down a #) writeOffAddr# :: Addr# -> Int# -> Down a -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Down a -> State# s -> State# s | |
| NFData a => NFData (Down a) | |
Defined in Control.DeepSeq | |
| Unbox a => Unbox (Down a) | |
Defined in Data.Vector.Unboxed.Base | |
| Generic1 Down | |
| newtype MVector s (Down a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Rep (Down a) | |
| newtype Vector (Down a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Rep1 Down | |
for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b) #
listToMaybe :: [a] -> Maybe a #
maybeToList :: Maybe a -> [a] #
partitionEithers :: [Either a b] -> ([a], [b]) #
class Monad m => MonadIO (m :: Type -> Type) where #
Instances
Instances
| Foldable Set | |
Defined in Data.Set.Internal Methods fold :: Monoid m => Set m -> m foldMap :: Monoid m => (a -> m) -> Set a -> m foldMap' :: Monoid m => (a -> m) -> Set a -> m foldr :: (a -> b -> b) -> b -> Set a -> b foldr' :: (a -> b -> b) -> b -> Set a -> b foldl :: (b -> a -> b) -> b -> Set a -> b foldl' :: (b -> a -> b) -> b -> Set a -> b foldr1 :: (a -> a -> a) -> Set a -> a foldl1 :: (a -> a -> a) -> Set a -> a elem :: Eq a => a -> Set a -> Bool maximum :: Ord a => Set a -> a | |
| ToJSON1 Set | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Set a -> Value Source # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Set a] -> Value Source # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Set a -> Encoding Source # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Set a] -> Encoding Source # | |
| Eq1 Set | |
| Ord1 Set | |
Defined in Data.Set.Internal Methods liftCompare :: (a -> b -> Ordering) -> Set a -> Set b -> Ordering | |
| Show1 Set | |
Defined in Data.Set.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Set a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Set a] -> ShowS | |
| Ord a => IsList (Set a) | |
| Eq a => Eq (Set a) | |
| (Data a, Ord a) => Data (Set a) | |
Defined in Data.Set.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Set a -> c (Set a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Set a) dataTypeOf :: Set a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Set a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Set a)) gmapT :: (forall b. Data b => b -> b) -> Set a -> Set a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r gmapQ :: (forall d. Data d => d -> u) -> Set a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Set a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) | |
| Ord a => Ord (Set a) | |
| (Read a, Ord a) => Read (Set a) | |
Defined in Data.Set.Internal | |
| Show a => Show (Set a) | |
| Ord a => Semigroup (Set a) | |
| Ord a => Monoid (Set a) | |
| ToJSON a => ToJSON (Set a) | |
| (Ord a, FromJSON a) => FromJSON (Set a) | |
| Ord v => GrowingAppend (Set v) | |
Defined in Data.MonoTraversable | |
| MonoPointed (Set a) | |
| Ord e => MonoFoldable (Set e) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Set e) -> m) -> Set e -> m # ofoldr :: (Element (Set e) -> b -> b) -> b -> Set e -> b # ofoldl' :: (a -> Element (Set e) -> a) -> a -> Set e -> a # otoList :: Set e -> [Element (Set e)] # oall :: (Element (Set e) -> Bool) -> Set e -> Bool # oany :: (Element (Set e) -> Bool) -> Set e -> Bool # ocompareLength :: Integral i => Set e -> i -> Ordering # otraverse_ :: Applicative f => (Element (Set e) -> f b) -> Set e -> f () # ofor_ :: Applicative f => Set e -> (Element (Set e) -> f b) -> f () # omapM_ :: Applicative m => (Element (Set e) -> m ()) -> Set e -> m () # oforM_ :: Applicative m => Set e -> (Element (Set e) -> m ()) -> m () # ofoldlM :: Monad m => (a -> Element (Set e) -> m a) -> a -> Set e -> m a # ofoldMap1Ex :: Semigroup m => (Element (Set e) -> m) -> Set e -> m # ofoldr1Ex :: (Element (Set e) -> Element (Set e) -> Element (Set e)) -> Set e -> Element (Set e) # ofoldl1Ex' :: (Element (Set e) -> Element (Set e) -> Element (Set e)) -> Set e -> Element (Set e) # headEx :: Set e -> Element (Set e) # lastEx :: Set e -> Element (Set e) # unsafeHead :: Set e -> Element (Set e) # unsafeLast :: Set e -> Element (Set e) # maximumByEx :: (Element (Set e) -> Element (Set e) -> Ordering) -> Set e -> Element (Set e) # minimumByEx :: (Element (Set e) -> Element (Set e) -> Ordering) -> Set e -> Element (Set e) # | |
| Ord element => IsSet (Set element) | |
Defined in Data.Containers Methods insertSet :: Element (Set element) -> Set element -> Set element # deleteSet :: Element (Set element) -> Set element -> Set element # singletonSet :: Element (Set element) -> Set element # setFromList :: [Element (Set element)] -> Set element # setToList :: Set element -> [Element (Set element)] # filterSet :: (Element (Set element) -> Bool) -> Set element -> Set element # | |
| Ord element => SetContainer (Set element) | |
Defined in Data.Containers Associated Types type ContainerKey (Set element) # Methods member :: ContainerKey (Set element) -> Set element -> Bool # notMember :: ContainerKey (Set element) -> Set element -> Bool # union :: Set element -> Set element -> Set element # unions :: (MonoFoldable mono, Element mono ~ Set element) => mono -> Set element # difference :: Set element -> Set element -> Set element # intersection :: Set element -> Set element -> Set element # keys :: Set element -> [ContainerKey (Set element)] # | |
| NFData a => NFData (Set a) | |
Defined in Data.Set.Internal | |
| (Ord a, PersistField a) => PersistField (Set a) | |
Defined in Database.Persist.Class.PersistField Methods toPersistValue :: Set a -> PersistValue Source # fromPersistValue :: PersistValue -> Either Text (Set a) Source # | |
| type Element (Set e) | |
Defined in Data.MonoTraversable | |
| type ContainerKey (Set element) | |
Defined in Data.Containers | |
| type Item (Set a) | |
Defined in Data.Set.Internal type Item (Set a) = a | |
Instances
| Functor IntMap | |
| Foldable IntMap | |
Defined in Data.IntMap.Internal Methods fold :: Monoid m => IntMap m -> m foldMap :: Monoid m => (a -> m) -> IntMap a -> m foldMap' :: Monoid m => (a -> m) -> IntMap a -> m foldr :: (a -> b -> b) -> b -> IntMap a -> b foldr' :: (a -> b -> b) -> b -> IntMap a -> b foldl :: (b -> a -> b) -> b -> IntMap a -> b foldl' :: (b -> a -> b) -> b -> IntMap a -> b foldr1 :: (a -> a -> a) -> IntMap a -> a foldl1 :: (a -> a -> a) -> IntMap a -> a elem :: Eq a => a -> IntMap a -> Bool maximum :: Ord a => IntMap a -> a | |
| Traversable IntMap | |
| ToJSON1 IntMap | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> IntMap a -> Value Source # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [IntMap a] -> Value Source # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> IntMap a -> Encoding Source # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [IntMap a] -> Encoding Source # | |
| FromJSON1 IntMap | |
| PolyMap IntMap | |
Defined in Data.Containers Methods differenceMap :: IntMap value1 -> IntMap value2 -> IntMap value1 # intersectionMap :: IntMap value1 -> IntMap value2 -> IntMap value1 # intersectionWithMap :: (value1 -> value2 -> value3) -> IntMap value1 -> IntMap value2 -> IntMap value3 # | |
| Zip IntMap | |
| Adjustable IntMap | |
| FoldableWithKey IntMap | |
Defined in Data.Key Methods toKeyedList :: IntMap a -> [(Key IntMap, a)] foldMapWithKey :: Monoid m => (Key IntMap -> a -> m) -> IntMap a -> m foldrWithKey :: (Key IntMap -> a -> b -> b) -> b -> IntMap a -> b foldlWithKey :: (b -> Key IntMap -> a -> b) -> b -> IntMap a -> b | |
| Indexable IntMap | |
| Keyed IntMap | |
Defined in Data.Key Methods mapWithKey :: (Key IntMap -> a -> b) -> IntMap a -> IntMap b | |
| Lookup IntMap | |
| TraversableWithKey IntMap | |
Defined in Data.Key Methods traverseWithKey :: Applicative f => (Key IntMap -> a -> f b) -> IntMap a -> f (IntMap b) mapWithKeyM :: Monad m => (Key IntMap -> a -> m b) -> IntMap a -> m (IntMap b) | |
| Zip IntMap | |
| ZipWithKey IntMap | |
| Eq1 IntMap | |
| Ord1 IntMap | |
Defined in Data.IntMap.Internal Methods liftCompare :: (a -> b -> Ordering) -> IntMap a -> IntMap b -> Ordering | |
| Read1 IntMap | |
Defined in Data.IntMap.Internal Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (IntMap a) liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [IntMap a] liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (IntMap a) liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [IntMap a] | |
| Show1 IntMap | |
Defined in Data.IntMap.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> IntMap a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [IntMap a] -> ShowS | |
| IsList (IntMap a) | |
| Eq a => Eq (IntMap a) | |
| Data a => Data (IntMap a) | |
Defined in Data.IntMap.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IntMap a -> c (IntMap a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (IntMap a) toConstr :: IntMap a -> Constr dataTypeOf :: IntMap a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (IntMap a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (IntMap a)) gmapT :: (forall b. Data b => b -> b) -> IntMap a -> IntMap a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IntMap a -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IntMap a -> r gmapQ :: (forall d. Data d => d -> u) -> IntMap a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> IntMap a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> IntMap a -> m (IntMap a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IntMap a -> m (IntMap a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IntMap a -> m (IntMap a) | |
| Ord a => Ord (IntMap a) | |
Defined in Data.IntMap.Internal | |
| Read e => Read (IntMap e) | |
Defined in Data.IntMap.Internal | |
| Show a => Show (IntMap a) | |
| Semigroup (IntMap a) | |
| Monoid (IntMap a) | |
| ToJSON a => ToJSON (IntMap a) | |
| FromJSON a => FromJSON (IntMap a) | |
| GrowingAppend (IntMap v) | |
Defined in Data.MonoTraversable | |
| MonoTraversable (IntMap a) | |
| MonoFoldable (IntMap a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (IntMap a) -> m) -> IntMap a -> m # ofoldr :: (Element (IntMap a) -> b -> b) -> b -> IntMap a -> b # ofoldl' :: (a0 -> Element (IntMap a) -> a0) -> a0 -> IntMap a -> a0 # otoList :: IntMap a -> [Element (IntMap a)] # oall :: (Element (IntMap a) -> Bool) -> IntMap a -> Bool # oany :: (Element (IntMap a) -> Bool) -> IntMap a -> Bool # olength64 :: IntMap a -> Int64 # ocompareLength :: Integral i => IntMap a -> i -> Ordering # otraverse_ :: Applicative f => (Element (IntMap a) -> f b) -> IntMap a -> f () # ofor_ :: Applicative f => IntMap a -> (Element (IntMap a) -> f b) -> f () # omapM_ :: Applicative m => (Element (IntMap a) -> m ()) -> IntMap a -> m () # oforM_ :: Applicative m => IntMap a -> (Element (IntMap a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (IntMap a) -> m a0) -> a0 -> IntMap a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (IntMap a) -> m) -> IntMap a -> m # ofoldr1Ex :: (Element (IntMap a) -> Element (IntMap a) -> Element (IntMap a)) -> IntMap a -> Element (IntMap a) # ofoldl1Ex' :: (Element (IntMap a) -> Element (IntMap a) -> Element (IntMap a)) -> IntMap a -> Element (IntMap a) # headEx :: IntMap a -> Element (IntMap a) # lastEx :: IntMap a -> Element (IntMap a) # unsafeHead :: IntMap a -> Element (IntMap a) # unsafeLast :: IntMap a -> Element (IntMap a) # maximumByEx :: (Element (IntMap a) -> Element (IntMap a) -> Ordering) -> IntMap a -> Element (IntMap a) # minimumByEx :: (Element (IntMap a) -> Element (IntMap a) -> Ordering) -> IntMap a -> Element (IntMap a) # | |
| MonoFunctor (IntMap a) | |
| HasKeysSet (IntMap v) | |
| IsMap (IntMap value) | |
Defined in Data.Containers Methods lookup :: ContainerKey (IntMap value) -> IntMap value -> Maybe (MapValue (IntMap value)) # insertMap :: ContainerKey (IntMap value) -> MapValue (IntMap value) -> IntMap value -> IntMap value # deleteMap :: ContainerKey (IntMap value) -> IntMap value -> IntMap value # singletonMap :: ContainerKey (IntMap value) -> MapValue (IntMap value) -> IntMap value # mapFromList :: [(ContainerKey (IntMap value), MapValue (IntMap value))] -> IntMap value # mapToList :: IntMap value -> [(ContainerKey (IntMap value), MapValue (IntMap value))] # findWithDefault :: MapValue (IntMap value) -> ContainerKey (IntMap value) -> IntMap value -> MapValue (IntMap value) # insertWith :: (MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> ContainerKey (IntMap value) -> MapValue (IntMap value) -> IntMap value -> IntMap value # insertWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> ContainerKey (IntMap value) -> MapValue (IntMap value) -> IntMap value -> IntMap value # insertLookupWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> ContainerKey (IntMap value) -> MapValue (IntMap value) -> IntMap value -> (Maybe (MapValue (IntMap value)), IntMap value) # adjustMap :: (MapValue (IntMap value) -> MapValue (IntMap value)) -> ContainerKey (IntMap value) -> IntMap value -> IntMap value # adjustWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> ContainerKey (IntMap value) -> IntMap value -> IntMap value # updateMap :: (MapValue (IntMap value) -> Maybe (MapValue (IntMap value))) -> ContainerKey (IntMap value) -> IntMap value -> IntMap value # updateWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> Maybe (MapValue (IntMap value))) -> ContainerKey (IntMap value) -> IntMap value -> IntMap value # updateLookupWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> Maybe (MapValue (IntMap value))) -> ContainerKey (IntMap value) -> IntMap value -> (Maybe (MapValue (IntMap value)), IntMap value) # alterMap :: (Maybe (MapValue (IntMap value)) -> Maybe (MapValue (IntMap value))) -> ContainerKey (IntMap value) -> IntMap value -> IntMap value # unionWith :: (MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> IntMap value -> IntMap value -> IntMap value # unionWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> IntMap value -> IntMap value -> IntMap value # unionsWith :: (MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> [IntMap value] -> IntMap value # mapWithKey :: (ContainerKey (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> IntMap value -> IntMap value # omapKeysWith :: (MapValue (IntMap value) -> MapValue (IntMap value) -> MapValue (IntMap value)) -> (ContainerKey (IntMap value) -> ContainerKey (IntMap value)) -> IntMap value -> IntMap value # filterMap :: (MapValue (IntMap value) -> Bool) -> IntMap value -> IntMap value # | |
| SetContainer (IntMap value) | |
Defined in Data.Containers Associated Types type ContainerKey (IntMap value) # Methods member :: ContainerKey (IntMap value) -> IntMap value -> Bool # notMember :: ContainerKey (IntMap value) -> IntMap value -> Bool # union :: IntMap value -> IntMap value -> IntMap value # unions :: (MonoFoldable mono, Element mono ~ IntMap value) => mono -> IntMap value # difference :: IntMap value -> IntMap value -> IntMap value # intersection :: IntMap value -> IntMap value -> IntMap value # keys :: IntMap value -> [ContainerKey (IntMap value)] # | |
| NFData a => NFData (IntMap a) | |
Defined in Data.IntMap.Internal | |
| PersistField v => PersistField (IntMap v) | |
Defined in Database.Persist.Class.PersistField Methods toPersistValue :: IntMap v -> PersistValue Source # fromPersistValue :: PersistValue -> Either Text (IntMap v) Source # | |
| type Key IntMap | |
| type Element (IntMap a) | |
Defined in Data.MonoTraversable | |
| type KeySet (IntMap v) | |
Defined in Data.Containers | |
| type MapValue (IntMap value) | |
Defined in Data.Containers | |
| type ContainerKey (IntMap value) | |
Defined in Data.Containers | |
| type Item (IntMap a) | |
Defined in Data.IntMap.Internal type Item (IntMap a) = (Key, a) | |
Instances
Instances
| Monad Seq | |
| Functor Seq | |
| MonadFix Seq | |
Defined in Data.Sequence.Internal | |
| Applicative Seq | |
| Foldable Seq | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Seq m -> m foldMap :: Monoid m => (a -> m) -> Seq a -> m foldMap' :: Monoid m => (a -> m) -> Seq a -> m foldr :: (a -> b -> b) -> b -> Seq a -> b foldr' :: (a -> b -> b) -> b -> Seq a -> b foldl :: (b -> a -> b) -> b -> Seq a -> b foldl' :: (b -> a -> b) -> b -> Seq a -> b foldr1 :: (a -> a -> a) -> Seq a -> a foldl1 :: (a -> a -> a) -> Seq a -> a elem :: Eq a => a -> Seq a -> Bool maximum :: Ord a => Seq a -> a | |
| Traversable Seq | |
| ToJSON1 Seq | |
Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Seq a -> Value Source # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Seq a] -> Value Source # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Seq a -> Encoding Source # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Seq a] -> Encoding Source # | |
| FromJSON1 Seq | |
| Alternative Seq | |
| MonadPlus Seq | |
| Zip Seq | |
| Zip3 Seq | |
| Zip4 Seq | |
Defined in Data.ChunkedZip | |
| Adjustable Seq | |
| FoldableWithKey Seq | |
Defined in Data.Key Methods toKeyedList :: Seq a -> [(Key Seq, a)] foldMapWithKey :: Monoid m => (Key Seq -> a -> m) -> Seq a -> m foldrWithKey :: (Key Seq -> a -> b -> b) -> b -> Seq a -> b foldlWithKey :: (b -> Key Seq -> a -> b) -> b -> Seq a -> b | |
| Indexable Seq | |
| Keyed Seq | |
Defined in Data.Key Methods mapWithKey :: (Key Seq -> a -> b) -> Seq a -> Seq b | |
| Lookup Seq | |
| TraversableWithKey Seq | |
Defined in Data.Key Methods traverseWithKey :: Applicative f => (Key Seq -> a -> f b) -> Seq a -> f (Seq b) mapWithKeyM :: Monad m => (Key Seq -> a -> m b) -> Seq a -> m (Seq b) | |
| Zip Seq | |
| ZipWithKey Seq | |
| Eq1 Seq | |
| Ord1 Seq | |
Defined in Data.Sequence.Internal Methods liftCompare :: (a -> b -> Ordering) -> Seq a -> Seq b -> Ordering | |
| Read1 Seq | |
Defined in Data.Sequence.Internal Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Seq a) liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Seq a] liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Seq a) liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Seq a] | |
| Show1 Seq | |
Defined in Data.Sequence.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Seq a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Seq a] -> ShowS | |
| MonadZip Seq | |
| UnzipWith Seq | |
Defined in Data.Sequence.Internal Methods unzipWith' :: (x -> (a, b)) -> Seq x -> (Seq a, Seq b) | |
| IsList (Seq a) | |
| Eq a => Eq (Seq a) | |
| Data a => Data (Seq a) | |
Defined in Data.Sequence.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Seq a -> c (Seq a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Seq a) dataTypeOf :: Seq a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Seq a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Seq a)) gmapT :: (forall b. Data b => b -> b) -> Seq a -> Seq a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Seq a -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Seq a -> r gmapQ :: (forall d. Data d => d -> u) -> Seq a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Seq a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a) | |
| Ord a => Ord (Seq a) | |
| Read a => Read (Seq a) | |
Defined in Data.Sequence.Internal | |
| Show a => Show (Seq a) | |
| a ~ Char => IsString (Seq a) | |
Defined in Data.Sequence.Internal Methods fromString :: String -> Seq a # | |
| Semigroup (Seq a) | |
| Monoid (Seq a) | |
| ToJSON a => ToJSON (Seq a) | |
| FromJSON a => FromJSON (Seq a) | |
| GrowingAppend (Seq a) | |
Defined in Data.MonoTraversable | |
| MonoPointed (Seq a) | |
| MonoTraversable (Seq a) | |
| MonoFoldable (Seq a) | |
Defined in Data.MonoTraversable Methods ofoldMap :: Monoid m => (Element (Seq a) -> m) -> Seq a -> m # ofoldr :: (Element (Seq a) -> b -> b) -> b -> Seq a -> b # ofoldl' :: (a0 -> Element (Seq a) -> a0) -> a0 -> Seq a -> a0 # otoList :: Seq a -> [Element (Seq a)] # oall :: (Element (Seq a) -> Bool) -> Seq a -> Bool # oany :: (Element (Seq a) -> Bool) -> Seq a -> Bool # ocompareLength :: Integral i => Seq a -> i -> Ordering # otraverse_ :: Applicative f => (Element (Seq a) -> f b) -> Seq a -> f () # ofor_ :: Applicative f => Seq a -> (Element (Seq a) -> f b) -> f () # omapM_ :: Applicative m => (Element (Seq a) -> m ()) -> Seq a -> m () # oforM_ :: Applicative m => Seq a -> (Element (Seq a) -> m ()) -> m () # ofoldlM :: Monad m => (a0 -> Element (Seq a) -> m a0) -> a0 -> Seq a -> m a0 # ofoldMap1Ex :: Semigroup m => (Element (Seq a) -> m) -> Seq a -> m # ofoldr1Ex :: (Element (Seq a) -> Element (Seq a) -> Element (Seq a)) -> Seq a -> Element (Seq a) # ofoldl1Ex' :: (Element (Seq a) -> Element (Seq a) -> Element (Seq a)) -> Seq a -> Element (Seq a) # headEx :: Seq a -> Element (Seq a) # lastEx :: Seq a -> Element (Seq a) # unsafeHead :: Seq a -> Element (Seq a) # unsafeLast :: Seq a -> Element (Seq a) # maximumByEx :: (Element (Seq a) -> Element (Seq a) -> Ordering) -> Seq a -> Element (Seq a) # minimumByEx :: (Element (Seq a) -> Element (Seq a) -> Ordering) -> Seq a -> Element (Seq a) # | |
| MonoFunctor (Seq a) | |
| IsSequence (Seq a) | |
Defined in Data.Sequences Methods fromList :: [Element (Seq a)] -> Seq a # lengthIndex :: Seq a -> Index (Seq a) # break :: (Element (Seq a) -> Bool) -> Seq a -> (Seq a, Seq a) # span :: (Element (Seq a) -> Bool) -> Seq a -> (Seq a, Seq a) # dropWhile :: (Element (Seq a) -> Bool) -> Seq a -> Seq a # takeWhile :: (Element (Seq a) -> Bool) -> Seq a -> Seq a # splitAt :: Index (Seq a) -> Seq a -> (Seq a, Seq a) # unsafeSplitAt :: Index (Seq a) -> Seq a -> (Seq a, Seq a) # take :: Index (Seq a) -> Seq a -> Seq a # unsafeTake :: Index (Seq a) -> Seq a -> Seq a # drop :: Index (Seq a) -> Seq a -> Seq a # unsafeDrop :: Index (Seq a) -> Seq a -> Seq a # dropEnd :: Index (Seq a) -> Seq a -> Seq a # partition :: (Element (Seq a) -> Bool) -> Seq a -> (Seq a, Seq a) # uncons :: Seq a -> Maybe (Element (Seq a), Seq a) # unsnoc :: Seq a -> Maybe (Seq a, Element (Seq a)) # filter :: (Element (Seq a) -> Bool) -> Seq a -> Seq a # filterM :: Monad m => (Element (Seq a) -> m Bool) -> Seq a -> m (Seq a) # replicate :: Index (Seq a) -> Element (Seq a) -> Seq a # replicateM :: Monad m => Index (Seq a) -> m (Element (Seq a)) -> m (Seq a) # groupBy :: (Element (Seq a) -> Element (Seq a) -> Bool) -> Seq a -> [Seq a] # groupAllOn :: Eq b => (Element (Seq a) -> b) -> Seq a -> [Seq a] # subsequences :: Seq a -> [Seq a] # permutations :: Seq a -> [Seq a] # tailMay :: Seq a -> Maybe (Seq a) # initMay :: Seq a -> Maybe (Seq a) # unsafeTail :: Seq a -> Seq a # unsafeInit :: Seq a -> Seq a # index :: Seq a -> Index (Seq a) -> Maybe (Element (Seq a)) # indexEx :: Seq a -> Index (Seq a) -> Element (Seq a) # unsafeIndex :: Seq a -> Index (Seq a) -> Element (Seq a) # splitWhen :: (Element (Seq a) -> Bool) -> Seq a -> [Seq a] # | |
| SemiSequence (Seq a) | |
| NFData a => NFData (Seq a) | |
Defined in Data.Sequence.Internal | |
| type Key Seq | |
| type Element (Seq a) | |
Defined in Data.MonoTraversable | |
| type Index (Seq a) | |
Defined in Data.Sequences | |
| type Item (Seq a) | |
Defined in Data.Sequence.Internal type Item (Seq a) = a | |
type LByteString = ByteString #
type IOError = IOException #
data IOErrorType #
Instances
| Eq IOErrorType | |
Defined in GHC.IO.Exception | |
| Show IOErrorType | |
Defined in GHC.IO.Exception Methods showsPrec :: Int -> IOErrorType -> ShowS # show :: IOErrorType -> String # showList :: [IOErrorType] -> ShowS # | |
ioeGetErrorString :: IOError -> String #
ioeGetErrorType :: IOError -> IOErrorType #
ioeGetFileName :: IOError -> Maybe FilePath #
ioeGetHandle :: IOError -> Maybe Handle #
ioeGetLocation :: IOError -> String #
ioeSetErrorString :: IOError -> String -> IOError #
ioeSetErrorType :: IOError -> IOErrorType -> IOError #
ioeSetFileName :: IOError -> FilePath -> IOError #
ioeSetHandle :: IOError -> Handle -> IOError #
ioeSetLocation :: IOError -> String -> IOError #
isAlreadyExistsError :: IOError -> Bool #
isAlreadyInUseError :: IOError -> Bool #
isDoesNotExistError :: IOError -> Bool #
isEOFError :: IOError -> Bool #
isEOFErrorType :: IOErrorType -> Bool #
isFullError :: IOError -> Bool #
isFullErrorType :: IOErrorType -> Bool #
isIllegalOperation :: IOError -> Bool #
isPermissionError :: IOError -> Bool #
isUserError :: IOError -> Bool #
isUserErrorType :: IOErrorType -> Bool #
class Monad m => MonadThrow (m :: Type -> Type) #
Minimal complete definition
throwM
Instances
runResourceT :: MonadUnliftIO m => ResourceT m a -> m a #
withAcquire :: MonadUnliftIO m => Acquire a -> (a -> m b) -> m b #
allocateAcquire :: MonadResource m => Acquire a -> m (ReleaseKey, a) #
class MonadIO m => MonadResource (m :: Type -> Type) where #
Methods
liftResourceT :: ResourceT IO a -> m a #
Instances
data ResourceT (m :: Type -> Type) a #
Instances
mkAcquireType :: IO a -> (a -> ReleaseType -> IO ()) -> Acquire a #
data ReleaseType #
Constructors
| ReleaseEarly | |
| ReleaseNormal | |
| ReleaseException |
Instances
Instances
class MonadTrans (t :: (Type -> Type) -> Type -> Type) where #
Instances
Instances
| Eq Void | |
| Data Void | |
Defined in Data.Void Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Void -> c Void gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Void dataTypeOf :: Void -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Void) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Void) gmapT :: (forall b. Data b => b -> b) -> Void -> Void gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Void -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Void -> r gmapQ :: (forall d. Data d => d -> u) -> Void -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Void -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Void -> m Void gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Void -> m Void gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Void -> m Void | |
| Ord Void | |
| Read Void | |
| Show Void | |
| Ix Void | |
| Generic Void | |
| Semigroup Void | |
| Lift Void | |
Defined in Language.Haskell.TH.Syntax | |
| Hashable Void | |
Defined in Data.Hashable.Class | |
| ToJSON Void | |
| FromJSON Void | |
| NFData Void | |
Defined in Control.DeepSeq | |
| Exception Void | |
Defined in Data.Void Methods toException :: Void -> SomeException # fromException :: SomeException -> Maybe Void # displayException :: Void -> String # | |
| type Rep Void | |
newtype ZipConduit i o (m :: Type -> Type) r #
Constructors
| ZipConduit | |
Fields
| |
Instances
| Functor (ZipConduit i o m) | |
Defined in Data.Conduit.Internal.Conduit Methods fmap :: (a -> b) -> ZipConduit i o m a -> ZipConduit i o m b # (<$) :: a -> ZipConduit i o m b -> ZipConduit i o m a # | |
| Monad m => Applicative (ZipConduit i o m) | |
Defined in Data.Conduit.Internal.Conduit Methods pure :: a -> ZipConduit i o m a # (<*>) :: ZipConduit i o m (a -> b) -> ZipConduit i o m a -> ZipConduit i o m b # liftA2 :: (a -> b -> c) -> ZipConduit i o m a -> ZipConduit i o m b -> ZipConduit i o m c # (*>) :: ZipConduit i o m a -> ZipConduit i o m b -> ZipConduit i o m b # (<*) :: ZipConduit i o m a -> ZipConduit i o m b -> ZipConduit i o m a # | |
newtype ZipSink i (m :: Type -> Type) r #
Constructors
| ZipSink | |
Fields
| |
Instances
| Monad m => Functor (ZipSink i m) | |
| Monad m => Applicative (ZipSink i m) | |
Defined in Data.Conduit.Internal.Conduit | |
newtype ZipSource (m :: Type -> Type) o #
Constructors
| ZipSource | |
Fields
| |
Instances
| Monad m => Functor (ZipSource m) | |
| Monad m => Applicative (ZipSource m) | |
Defined in Data.Conduit.Internal.Conduit | |
Instances
| Functor Flush | |
| Eq a => Eq (Flush a) | |
| Ord a => Ord (Flush a) | |
Defined in Data.Conduit.Internal.Conduit | |
| Show a => Show (Flush a) | |
| ToFlushBuilder (Flush ByteString) | |
Defined in Yesod.Core.Content Methods toFlushBuilder :: Flush ByteString -> Flush Builder # | |
| ToFlushBuilder (Flush ByteString) | |
Defined in Yesod.Core.Content Methods toFlushBuilder :: Flush ByteString -> Flush Builder # | |
| ToFlushBuilder (Flush Builder) | |
Defined in Yesod.Core.Content Methods toFlushBuilder :: Flush Builder -> Flush Builder # | |
| ToFlushBuilder (Flush String) | |
Defined in Yesod.Core.Content Methods toFlushBuilder :: Flush String -> Flush Builder # | |
| ToFlushBuilder (Flush Text) | |
Defined in Yesod.Core.Content Methods toFlushBuilder :: Flush Text -> Flush Builder # | |
| ToFlushBuilder (Flush Html) | |
Defined in Yesod.Core.Content Methods toFlushBuilder :: Flush Html -> Flush Builder # | |
| ToFlushBuilder (Flush Text) | |
Defined in Yesod.Core.Content Methods toFlushBuilder :: Flush Text -> Flush Builder # | |
data SealedConduitT i o (m :: Type -> Type) r #
Instances
| ToFlushBuilder builder => ToContent (SealedConduitT () builder (ResourceT IO) ()) | |
Defined in Yesod.Core.Content | |
data ConduitT i o (m :: Type -> Type) r #
Instances
sealConduitT :: forall i o (m :: Type -> Type) r. ConduitT i o m r -> SealedConduitT i o m r #
unsealConduitT :: forall (m :: Type -> Type) i o r. Monad m => SealedConduitT i o m r -> ConduitT i o m r #
toProducer :: forall (m :: Type -> Type) a. Monad m => Source m a -> Producer m a #
toConsumer :: forall (m :: Type -> Type) a b. Monad m => Sink a m b -> Consumer a m b #
catchC :: forall (m :: Type -> Type) e i o r. (MonadUnliftIO m, Exception e) => ConduitT i o m r -> (e -> ConduitT i o m r) -> ConduitT i o m r #
handleC :: forall (m :: Type -> Type) e i o r. (MonadUnliftIO m, Exception e) => (e -> ConduitT i o m r) -> ConduitT i o m r -> ConduitT i o m r #
tryC :: forall (m :: Type -> Type) e i o r. (MonadUnliftIO m, Exception e) => ConduitT i o m r -> ConduitT i o m (Either e r) #
fuseReturnLeftovers :: forall (m :: Type -> Type) a b c r. Monad m => ConduitT a b m () -> ConduitT b c m r -> ConduitT a c m (r, [b]) #
fuseLeftovers :: forall (m :: Type -> Type) b a c r. Monad m => ([b] -> [a]) -> ConduitT a b m () -> ConduitT b c m r -> ConduitT a c m r #
mergeSource :: forall (m :: Type -> Type) i a. Monad m => Source m i -> Conduit a m (i, a) #
passthroughSink :: Monad m => Sink i m r -> (r -> m ()) -> Conduit i m i #
sourceToList :: Monad m => Source m a -> m [a] #
fuse :: forall (m :: Type -> Type) a b c r. Monad m => Conduit a m b -> ConduitM b c m r -> ConduitM a c m r #
(.|) :: forall (m :: Type -> Type) a b c r. Monad m => ConduitM a b m () -> ConduitM b c m r -> ConduitM a c m r #
($=) :: forall (m :: Type -> Type) a b c r. Monad m => Conduit a m b -> ConduitT b c m r -> ConduitT a c m r #
(=$) :: forall (m :: Type -> Type) a b c r. Monad m => Conduit a m b -> ConduitT b c m r -> ConduitT a c m r #
(=$=) :: forall (m :: Type -> Type) a b c r. Monad m => Conduit a m b -> ConduitT b c m r -> ConduitT a c m r #
runConduit :: Monad m => ConduitT () Void m r -> m r #
bracketP :: forall (m :: Type -> Type) a i o r. MonadResource m => IO a -> (a -> IO ()) -> (a -> ConduitT i o m r) -> ConduitT i o m r #
awaitForever :: forall (m :: Type -> Type) i o r. Monad m => (i -> ConduitT i o m r) -> ConduitT i o m () #
mapOutput :: forall (m :: Type -> Type) o1 o2 i r. Monad m => (o1 -> o2) -> ConduitT i o1 m r -> ConduitT i o2 m r #
mapOutputMaybe :: forall (m :: Type -> Type) o1 o2 i r. Monad m => (o1 -> Maybe o2) -> ConduitT i o1 m r -> ConduitT i o2 m r #
mapInput :: forall (m :: Type -> Type) i1 i2 o r. Monad m => (i1 -> i2) -> (i2 -> Maybe i1) -> ConduitT i2 o m r -> ConduitT i1 o m r #
mapInputM :: Monad m => (i1 -> m i2) -> (i2 -> m (Maybe i1)) -> ConduitT i2 o m r -> ConduitT i1 o m r #
($$++) :: Monad m => SealedConduitT () a m () -> Sink a m b -> m (SealedConduitT () a m (), b) #
($$+-) :: Monad m => SealedConduitT () a m () -> Sink a m b -> m b #
($=+) :: forall (m :: Type -> Type) a b. Monad m => SealedConduitT () a m () -> Conduit a m b -> SealedConduitT () b m () #
sequenceSources :: forall f (m :: Type -> Type) o. (Traversable f, Monad m) => f (Source m o) -> Source m (f o) #
sequenceSinks :: forall f (m :: Type -> Type) i r. (Traversable f, Monad m) => f (Sink i m r) -> Sink i m (f r) #
(=$$+) :: forall (m :: Type -> Type) a b r. Monad m => ConduitT a b m () -> ConduitT b Void m r -> ConduitT a Void m (SealedConduitT a b m (), r) #
(=$$++) :: forall (m :: Type -> Type) i o r. Monad m => SealedConduitT i o m () -> ConduitT o Void m r -> ConduitT i Void m (SealedConduitT i o m (), r) #
(=$$+-) :: forall (m :: Type -> Type) i o r. Monad m => SealedConduitT i o m () -> ConduitT o Void m r -> ConduitT i Void m r #
sequenceConduits :: forall f (m :: Type -> Type) i o r. (Traversable f, Monad m) => f (ConduitT i o m r) -> ConduitT i o m (f r) #
fuseBoth :: forall (m :: Type -> Type) a b r1 c r2. Monad m => ConduitT a b m r1 -> ConduitT b c m r2 -> ConduitT a c m (r1, r2) #
fuseBothMaybe :: forall (m :: Type -> Type) a b r1 c r2. Monad m => ConduitT a b m r1 -> ConduitT b c m r2 -> ConduitT a c m (Maybe r1, r2) #
fuseUpstream :: forall (m :: Type -> Type) a b r c. Monad m => ConduitT a b m r -> Conduit b m c -> ConduitT a c m r #
runConduitPure :: ConduitT () Void Identity r -> r #
runConduitRes :: MonadUnliftIO m => ConduitT () Void (ResourceT m) r -> m r #
exceptC :: forall (m :: Type -> Type) i o e a. Monad m => ConduitT i o m (Either e a) -> ConduitT i o (ExceptT e m) a #
runExceptC :: forall (m :: Type -> Type) i o e r. Monad m => ConduitT i o (ExceptT e m) r -> ConduitT i o m (Either e r) #
catchExceptC :: forall (m :: Type -> Type) i o e r. Monad m => ConduitT i o (ExceptT e m) r -> (e -> ConduitT i o (ExceptT e m) r) -> ConduitT i o (ExceptT e m) r #
runCatchC :: forall (m :: Type -> Type) i o r. Monad m => ConduitT i o (CatchT m) r -> ConduitT i o m (Either SomeException r) #
catchCatchC :: forall (m :: Type -> Type) i o r. Monad m => ConduitT i o (CatchT m) r -> (SomeException -> ConduitT i o (CatchT m) r) -> ConduitT i o (CatchT m) r #
maybeC :: forall (m :: Type -> Type) i o a. Monad m => ConduitT i o m (Maybe a) -> ConduitT i o (MaybeT m) a #
runMaybeC :: forall (m :: Type -> Type) i o r. Monad m => ConduitT i o (MaybeT m) r -> ConduitT i o m (Maybe r) #
readerC :: forall (m :: Type -> Type) r i o a. Monad m => (r -> ConduitT i o m a) -> ConduitT i o (ReaderT r m) a #
runReaderC :: forall (m :: Type -> Type) r i o res. Monad m => r -> ConduitT i o (ReaderT r m) res -> ConduitT i o m res #
stateLC :: forall (m :: Type -> Type) s i o a. Monad m => (s -> ConduitT i o m (a, s)) -> ConduitT i o (StateT s m) a #
runStateLC :: forall (m :: Type -> Type) s i o r. Monad m => s -> ConduitT i o (StateT s m) r -> ConduitT i o m (r, s) #
evalStateLC :: forall (m :: Type -> Type) s i o r. Monad m => s -> ConduitT i o (StateT s m) r -> ConduitT i o m r #
execStateLC :: forall (m :: Type -> Type) s i o r. Monad m => s -> ConduitT i o (StateT s m) r -> ConduitT i o m s #
stateC :: forall (m :: Type -> Type) s i o a. Monad m => (s -> ConduitT i o m (a, s)) -> ConduitT i o (StateT s m) a #
runStateC :: forall (m :: Type -> Type) s i o r. Monad m => s -> ConduitT i o (StateT s m) r -> ConduitT i o m (r, s) #
evalStateC :: forall (m :: Type -> Type) s i o r. Monad m => s -> ConduitT i o (StateT s m) r -> ConduitT i o m r #
execStateC :: forall (m :: Type -> Type) s i o r. Monad m => s -> ConduitT i o (StateT s m) r -> ConduitT i o m s #
writerLC :: forall (m :: Type -> Type) w i o b. (Monad m, Monoid w) => ConduitT i o m (b, w) -> ConduitT i o (WriterT w m) b #
runWriterLC :: forall (m :: Type -> Type) w i o r. (Monad m, Monoid w) => ConduitT i o (WriterT w m) r -> ConduitT i o m (r, w) #
execWriterLC :: forall (m :: Type -> Type) w i o r. (Monad m, Monoid w) => ConduitT i o (WriterT w m) r -> ConduitT i o m w #
writerC :: forall (m :: Type -> Type) w i o b. (Monad m, Monoid w) => ConduitT i o m (b, w) -> ConduitT i o (WriterT w m) b #
runWriterC :: forall (m :: Type -> Type) w i o r. (Monad m, Monoid w) => ConduitT i o (WriterT w m) r -> ConduitT i o m (r, w) #
execWriterC :: forall (m :: Type -> Type) w i o r. (Monad m, Monoid w) => ConduitT i o (WriterT w m) r -> ConduitT i o m w #
rwsLC :: forall (m :: Type -> Type) w r s i o a. (Monad m, Monoid w) => (r -> s -> ConduitT i o m (a, s, w)) -> ConduitT i o (RWST r w s m) a #
runRWSLC :: forall (m :: Type -> Type) w r s i o res. (Monad m, Monoid w) => r -> s -> ConduitT i o (RWST r w s m) res -> ConduitT i o m (res, s, w) #
evalRWSLC :: forall (m :: Type -> Type) w r s i o res. (Monad m, Monoid w) => r -> s -> ConduitT i o (RWST r w s m) res -> ConduitT i o m (res, w) #
execRWSLC :: forall (m :: Type -> Type) w r s i o res. (Monad m, Monoid w) => r -> s -> ConduitT i o (RWST r w s m) res -> ConduitT i o m (s, w) #
rwsC :: forall (m :: Type -> Type) w r s i o a. (Monad m, Monoid w) => (r -> s -> ConduitT i o m (a, s, w)) -> ConduitT i o (RWST r w s m) a #
runRWSC :: forall (m :: Type -> Type) w r s i o res. (Monad m, Monoid w) => r -> s -> ConduitT i o (RWST r w s m) res -> ConduitT i o m (res, s, w) #
evalRWSC :: forall (m :: Type -> Type) w r s i o res. (Monad m, Monoid w) => r -> s -> ConduitT i o (RWST r w s m) res -> ConduitT i o m (res, w) #
execRWSC :: forall (m :: Type -> Type) w r s i o res. (Monad m, Monoid w) => r -> s -> ConduitT i o (RWST r w s m) res -> ConduitT i o m (s, w) #
yieldMany :: forall (m :: Type -> Type) mono i. (Monad m, MonoFoldable mono) => mono -> ConduitT i (Element mono) m () #
sourceLazy :: forall (m :: Type -> Type) lazy strict i. (Monad m, LazySequence lazy strict) => lazy -> ConduitT i strict m () #
sourceFile :: forall (m :: Type -> Type) i. MonadResource m => FilePath -> ConduitT i ByteString m () #
sourceHandle :: forall (m :: Type -> Type) i. MonadIO m => Handle -> ConduitT i ByteString m () #
sourceHandleUnsafe :: forall (m :: Type -> Type) i. MonadIO m => Handle -> ConduitT i ByteString m () #
sourceIOHandle :: forall (m :: Type -> Type) i. MonadResource m => IO Handle -> ConduitT i ByteString m () #
sourceFileBS :: forall (m :: Type -> Type) i. MonadResource m => FilePath -> ConduitT i ByteString m () #
sinkFile :: forall (m :: Type -> Type) o. MonadResource m => FilePath -> ConduitT ByteString o m () #
sinkFileCautious :: forall (m :: Type -> Type) o. MonadResource m => FilePath -> ConduitM ByteString o m () #
withSinkFileCautious :: forall m (n :: Type -> Type) o a. (MonadUnliftIO m, MonadIO n) => FilePath -> (ConduitM ByteString o n () -> m a) -> m a #
sinkTempFile :: forall (m :: Type -> Type) o. MonadResource m => FilePath -> String -> ConduitM ByteString o m FilePath #
sinkSystemTempFile :: forall (m :: Type -> Type) o. MonadResource m => String -> ConduitM ByteString o m FilePath #
sinkHandle :: forall (m :: Type -> Type) o. MonadIO m => Handle -> ConduitT ByteString o m () #
sinkHandleBuilder :: forall (m :: Type -> Type) o. MonadIO m => Handle -> ConduitM Builder o m () #
sinkHandleFlush :: forall (m :: Type -> Type) o. MonadIO m => Handle -> ConduitM (Flush ByteString) o m () #
sinkIOHandle :: forall (m :: Type -> Type) o. MonadResource m => IO Handle -> ConduitT ByteString o m () #
withSourceFile :: forall m (n :: Type -> Type) i a. (MonadUnliftIO m, MonadIO n) => FilePath -> (ConduitM i ByteString n () -> m a) -> m a #
withSinkFile :: forall m (n :: Type -> Type) o a. (MonadUnliftIO m, MonadIO n) => FilePath -> (ConduitM ByteString o n () -> m a) -> m a #
withSinkFileBuilder :: forall m (n :: Type -> Type) o a. (MonadUnliftIO m, MonadIO n) => FilePath -> (ConduitM Builder o n () -> m a) -> m a #
sourceDirectory :: forall (m :: Type -> Type) i. MonadResource m => FilePath -> ConduitT i FilePath m () #
sourceDirectoryDeep :: forall (m :: Type -> Type) i. MonadResource m => Bool -> FilePath -> ConduitT i FilePath m () #
sinkLazy :: forall (m :: Type -> Type) lazy strict o. (Monad m, LazySequence lazy strict) => ConduitT strict o m lazy #
sinkVector :: forall v a (m :: Type -> Type) o. (Vector v a, PrimMonad m) => ConduitT a o m (v a) #
sinkVectorN :: forall v a (m :: Type -> Type) o. (Vector v a, PrimMonad m) => Int -> ConduitT a o m (v a) #
sinkLazyBuilder :: forall (m :: Type -> Type) o. Monad m => ConduitT Builder o m ByteString #
awaitNonNull :: forall (m :: Type -> Type) a o. (Monad m, MonoFoldable a) => ConduitT a o m (Maybe (NonNull a)) #
sinkFileBS :: forall (m :: Type -> Type) o. MonadResource m => FilePath -> ConduitT ByteString o m () #
builderToByteString :: forall (m :: Type -> Type). PrimMonad m => ConduitT Builder ByteString m () #
builderToByteStringFlush :: forall (m :: Type -> Type). PrimMonad m => ConduitT (Flush Builder) (Flush ByteString) m () #
unsafeBuilderToByteString :: forall (m :: Type -> Type). PrimMonad m => ConduitT Builder ByteString m () #
builderToByteStringWith :: forall (m :: Type -> Type). PrimMonad m => BufferAllocStrategy -> ConduitT Builder ByteString m () #
builderToByteStringWithFlush :: forall (m :: Type -> Type). PrimMonad m => BufferAllocStrategy -> ConduitT (Flush Builder) (Flush ByteString) m () #
reuseBufferStrategy :: IO Buffer -> BufferAllocStrategy #
mapAccumS :: forall (m :: Type -> Type) a s b. Monad m => (a -> s -> ConduitT b Void m s) -> s -> ConduitT () b m () -> ConduitT a Void m s #
peekForever :: forall (m :: Type -> Type) i o. Monad m => ConduitT i o m () -> ConduitT i o m () #
peekForeverE :: forall (m :: Type -> Type) i o. (Monad m, MonoFoldable i) => ConduitT i o m () -> ConduitT i o m () #
unfoldC :: forall (m :: Type -> Type) b a i. Monad m => (b -> Maybe (a, b)) -> b -> ConduitT i a m () #
enumFromToC :: forall (m :: Type -> Type) a i. (Monad m, Enum a, Ord a) => a -> a -> ConduitT i a m () #
replicateC :: forall (m :: Type -> Type) a i. Monad m => Int -> a -> ConduitT i a m () #
repeatWhileMC :: Monad m => m a -> (a -> Bool) -> ConduitT i a m () #
replicateMC :: Monad m => Int -> m a -> ConduitT i a m () #
stdinC :: forall (m :: Type -> Type) i. MonadIO m => ConduitT i ByteString m () #
dropCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq) => Index seq -> ConduitT seq o m () #
dropWhileC :: forall (m :: Type -> Type) a o. Monad m => (a -> Bool) -> ConduitT a o m () #
dropWhileCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq) => (Element seq -> Bool) -> ConduitT seq o m () #
foldCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono, Monoid (Element mono)) => ConduitT mono o m (Element mono) #
foldlCE :: forall (m :: Type -> Type) mono a o. (Monad m, MonoFoldable mono) => (a -> Element mono -> a) -> a -> ConduitT mono o m a #
foldMapCE :: forall (m :: Type -> Type) mono w o. (Monad m, MonoFoldable mono, Monoid w) => (Element mono -> w) -> ConduitT mono o m w #
allCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono) => (Element mono -> Bool) -> ConduitT mono o m Bool #
anyCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono) => (Element mono -> Bool) -> ConduitT mono o m Bool #
andCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono, Element mono ~ Bool) => ConduitT mono o m Bool #
orCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono, Element mono ~ Bool) => ConduitT mono o m Bool #
asumC :: forall (m :: Type -> Type) f a o. (Monad m, Alternative f) => ConduitT (f a) o m (f a) #
elemCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq, Eq (Element seq)) => Element seq -> ConduitT seq o m Bool #
notElemCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq, Eq (Element seq)) => Element seq -> ConduitT seq o m Bool #
headCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq) => ConduitT seq o m (Maybe (Element seq)) #
peekCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono) => ConduitT mono o m (Maybe (Element mono)) #
lastCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq) => ConduitT seq o m (Maybe (Element seq)) #
lengthCE :: forall (m :: Type -> Type) len mono o. (Monad m, Num len, MonoFoldable mono) => ConduitT mono o m len #
lengthIfC :: forall (m :: Type -> Type) len a o. (Monad m, Num len) => (a -> Bool) -> ConduitT a o m len #
lengthIfCE :: forall (m :: Type -> Type) len mono o. (Monad m, Num len, MonoFoldable mono) => (Element mono -> Bool) -> ConduitT mono o m len #
maximumCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq, Ord (Element seq)) => ConduitT seq o m (Maybe (Element seq)) #
minimumCE :: forall (m :: Type -> Type) seq o. (Monad m, IsSequence seq, Ord (Element seq)) => ConduitT seq o m (Maybe (Element seq)) #
nullCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono) => ConduitT mono o m Bool #
sumCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono, Num (Element mono)) => ConduitT mono o m (Element mono) #
productCE :: forall (m :: Type -> Type) mono o. (Monad m, MonoFoldable mono, Num (Element mono)) => ConduitT mono o m (Element mono) #
foldMapMCE :: (Monad m, MonoFoldable mono, Monoid w) => (Element mono -> m w) -> ConduitT mono o m w #
stdoutC :: forall (m :: Type -> Type) o. MonadIO m => ConduitT ByteString o m () #
stderrC :: forall (m :: Type -> Type) o. MonadIO m => ConduitT ByteString o m () #
mapCE :: forall (m :: Type -> Type) f a b. (Monad m, Functor f) => (a -> b) -> ConduitT (f a) (f b) m () #
omapCE :: forall (m :: Type -> Type) mono. (Monad m, MonoFunctor mono) => (Element mono -> Element mono) -> ConduitT mono mono m () #
concatMapC :: forall (m :: Type -> Type) mono a. (Monad m, MonoFoldable mono) => (a -> mono) -> ConduitT a (Element mono) m () #
concatMapCE :: forall (m :: Type -> Type) mono w. (Monad m, MonoFoldable mono, Monoid w) => (Element mono -> w) -> ConduitT mono w m () #
takeCE :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq) => Index seq -> ConduitT seq seq m () #
takeWhileC :: forall (m :: Type -> Type) a. Monad m => (a -> Bool) -> ConduitT a a m () #
takeWhileCE :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq) => (Element seq -> Bool) -> ConduitT seq seq m () #
takeExactlyC :: forall (m :: Type -> Type) a b r. Monad m => Int -> ConduitT a b m r -> ConduitT a b m r #
takeExactlyCE :: forall (m :: Type -> Type) a b r. (Monad m, IsSequence a) => Index a -> ConduitT a b m r -> ConduitT a b m r #
concatC :: forall (m :: Type -> Type) mono. (Monad m, MonoFoldable mono) => ConduitT mono (Element mono) m () #
filterCE :: forall seq (m :: Type -> Type). (IsSequence seq, Monad m) => (Element seq -> Bool) -> ConduitT seq seq m () #
conduitVector :: forall v a (m :: Type -> Type). (Vector v a, PrimMonad m) => Int -> ConduitT a (v a) m () #
mapAccumWhileC :: forall (m :: Type -> Type) a s b. Monad m => (a -> s -> Either s (s, b)) -> s -> ConduitT a b m s #
concatMapAccumC :: forall (m :: Type -> Type) a accum b. Monad m => (a -> accum -> (accum, [b])) -> accum -> ConduitT a b m () #
intersperseC :: forall (m :: Type -> Type) a. Monad m => a -> ConduitT a a m () #
slidingWindowC :: forall (m :: Type -> Type) seq a. (Monad m, IsSequence seq, Element seq ~ a) => Int -> ConduitT a seq m () #
chunksOfCE :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq) => Index seq -> ConduitT seq seq m () #
chunksOfExactlyCE :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq) => Index seq -> ConduitT seq seq m () #
mapMCE :: (Monad m, Traversable f) => (a -> m b) -> ConduitT (f a) (f b) m () #
omapMCE :: (Monad m, MonoTraversable mono) => (Element mono -> m (Element mono)) -> ConduitT mono mono m () #
concatMapMC :: (Monad m, MonoFoldable mono) => (a -> m mono) -> ConduitT a (Element mono) m () #
mapAccumWhileMC :: Monad m => (a -> s -> m (Either s (s, b))) -> s -> ConduitT a b m s #
concatMapAccumMC :: Monad m => (a -> accum -> m (accum, [b])) -> accum -> ConduitT a b m () #
encodeUtf8C :: forall (m :: Type -> Type) text binary. (Monad m, Utf8 text binary) => ConduitT text binary m () #
decodeUtf8C :: forall (m :: Type -> Type). MonadThrow m => ConduitT ByteString Text m () #
decodeUtf8LenientC :: forall (m :: Type -> Type). Monad m => ConduitT ByteString Text m () #
lineC :: forall (m :: Type -> Type) seq o r. (Monad m, IsSequence seq, Element seq ~ Char) => ConduitT seq o m r -> ConduitT seq o m r #
lineAsciiC :: forall (m :: Type -> Type) seq o r. (Monad m, IsSequence seq, Element seq ~ Word8) => ConduitT seq o m r -> ConduitT seq o m r #
unlinesC :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq, Element seq ~ Char) => ConduitT seq seq m () #
unlinesAsciiC :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq, Element seq ~ Word8) => ConduitT seq seq m () #
linesUnboundedC :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq, Element seq ~ Char) => ConduitT seq seq m () #
linesUnboundedAsciiC :: forall (m :: Type -> Type) seq. (Monad m, IsSequence seq, Element seq ~ Word8) => ConduitT seq seq m () #
vectorBuilderC :: forall (m :: Type -> Type) v e n i r. (PrimMonad m, Vector v e, PrimMonad n, PrimState m ~ PrimState n) => Int -> ((e -> n ()) -> ConduitT i Void m r) -> ConduitT i (v e) m r #
Minimal complete definition
Nothing
Instances
httpSource :: forall (m :: Type -> Type) (n :: Type -> Type) env r. (MonadResource m, MonadIO n, MonadReader env m, HasHttpManager env) => Request -> (Response (ConduitM () ByteString n ()) -> ConduitM () r m ()) -> ConduitM () r m () Source #
Same as httpSource, but uses Manager
from Reader environment instead of the global one.
Since 2.3.6
httpNoBody :: (MonadIO m, HasHttpManager env, MonadReader env m) => Request -> m (Response ()) Source #
Same as httpNoBody, except it uses the Manager in the reader environment.
This can be more convenient that using withManager as it avoids the need
to specify the base monad for the response body.
Since 2.1.2
httpLbs :: (MonadIO m, HasHttpManager env, MonadReader env m) => Request -> m (Response ByteString) Source #
Same as httpLbs, except it uses the Manager in the reader environment.
Since 2.1.1
requestBodySourceChunked :: ConduitM () ByteString IO () -> RequestBody Source #
requestBodySource :: Int64 -> ConduitM () ByteString IO () -> RequestBody Source #
bodyReaderSource :: forall (m :: Type -> Type) i. MonadIO m => BodyReader -> ConduitM i ByteString m () Source #
responseClose :: MonadIO m => Response body -> m () Source #
Generalized version of responseClose.
Since 2.1.0
responseOpen :: forall m (n :: Type -> Type) env i. (MonadIO m, MonadIO n, MonadReader env m, HasHttpManager env) => Request -> m (Response (ConduitM i ByteString n ())) Source #
Conduit-powered version of responseOpen.
See withResponse for the differences with responseOpen.
Since 2.1.0
newManagerSettings :: MonadIO m => ManagerSettings -> m Manager Source #
Get a new manager using the given settings.
Since 2.1.0
newManager :: MonadIO m => m Manager Source #
Get a new manager using defaultManagerSettings.
Since 2.1.0
defaultManagerSettings :: ManagerSettings Source #
TLS-powered manager settings.
Since 2.1.0
acquireResponse :: forall (n :: Type -> Type) env m i. (MonadIO n, MonadReader env m, HasHttpManager env) => Request -> m (Acquire (Response (ConduitM i ByteString n ()))) Source #
An Acquire for getting a Response.
Since 2.1.0
withResponse :: forall m (n :: Type -> Type) env i a. (MonadUnliftIO m, MonadIO n, MonadReader env m, HasHttpManager env) => Request -> (Response (ConduitM i ByteString n ()) -> m a) -> m a Source #
Conduit powered version of withResponse. Differences are:
- Response body is represented as a
Producer. - Generalized to any instance of
MonadUnliftIO, not justIO. - The
Manageris contained by aMonadReadercontext.
Since 2.1.0
type ResponseHeaders = [Header] Source #
Response Headers
type RequestHeaders = [Header] Source #
Request Headers
type Header = (HeaderName, ByteString) Source #
Header
type Query = [QueryItem] Source #
Query.
General form: a=b&c=d, but if the value is Nothing, it becomes
a&c=d.
type QueryItem = (ByteString, Maybe ByteString) Source #
Query item
data StreamFileStatus #
Constructors
| StreamFileStatus | |
Instances
| Eq StreamFileStatus | |
Defined in Network.HTTP.Client.Types Methods (==) :: StreamFileStatus -> StreamFileStatus -> Bool # (/=) :: StreamFileStatus -> StreamFileStatus -> Bool # | |
| Ord StreamFileStatus | |
Defined in Network.HTTP.Client.Types Methods compare :: StreamFileStatus -> StreamFileStatus -> Ordering # (<) :: StreamFileStatus -> StreamFileStatus -> Bool # (<=) :: StreamFileStatus -> StreamFileStatus -> Bool # (>) :: StreamFileStatus -> StreamFileStatus -> Bool # (>=) :: StreamFileStatus -> StreamFileStatus -> Bool # max :: StreamFileStatus -> StreamFileStatus -> StreamFileStatus # min :: StreamFileStatus -> StreamFileStatus -> StreamFileStatus # | |
| Show StreamFileStatus | |
Defined in Network.HTTP.Client.Types Methods showsPrec :: Int -> StreamFileStatus -> ShowS # show :: StreamFileStatus -> String # showList :: [StreamFileStatus] -> ShowS # | |
class HasHttpManager a where #
Methods
getHttpManager :: a -> Manager #
Instances
| HasHttpManager Manager | |
Defined in Network.HTTP.Client.Types Methods getHttpManager :: Manager -> Manager # | |
Instances
| HasHttpManager Manager | |
Defined in Network.HTTP.Client.Types Methods getHttpManager :: Manager -> Manager # | |
data ProxyOverride #
data ManagerSettings #
Instances
| Functor Response | |
| Foldable Response | |
Defined in Network.HTTP.Client.Types Methods fold :: Monoid m => Response m -> m foldMap :: Monoid m => (a -> m) -> Response a -> m foldMap' :: Monoid m => (a -> m) -> Response a -> m foldr :: (a -> b -> b) -> b -> Response a -> b foldr' :: (a -> b -> b) -> b -> Response a -> b foldl :: (b -> a -> b) -> b -> Response a -> b foldl' :: (b -> a -> b) -> b -> Response a -> b foldr1 :: (a -> a -> a) -> Response a -> a foldl1 :: (a -> a -> a) -> Response a -> a elem :: Eq a => a -> Response a -> Bool maximum :: Ord a => Response a -> a minimum :: Ord a => Response a -> a | |
| Traversable Response | |
Defined in Network.HTTP.Client.Types | |
| Eq body => Eq (Response body) | |
| Show body => Show (Response body) | |
data ResponseTimeout #
Instances
| Eq ResponseTimeout | |
Defined in Network.HTTP.Client.Types Methods (==) :: ResponseTimeout -> ResponseTimeout -> Bool # (/=) :: ResponseTimeout -> ResponseTimeout -> Bool # | |
| Show ResponseTimeout | |
Defined in Network.HTTP.Client.Types Methods showsPrec :: Int -> ResponseTimeout -> ShowS # show :: ResponseTimeout -> String # showList :: [ResponseTimeout] -> ShowS # | |
type GivesPopper a = NeedsPopper a -> IO a #
type NeedsPopper a = Popper -> IO a #
type Popper = IO ByteString #
data RequestBody #
Constructors
| RequestBodyLBS ByteString | |
| RequestBodyBS ByteString | |
| RequestBodyBuilder Int64 Builder | |
| RequestBodyStream Int64 (GivesPopper ()) | |
| RequestBodyStreamChunked (GivesPopper ()) | |
| RequestBodyIO (IO RequestBody) |
Instances
| IsString RequestBody | |
Defined in Network.HTTP.Client.Types Methods fromString :: String -> RequestBody # | |
| Semigroup RequestBody | |
Defined in Network.HTTP.Client.Types Methods (<>) :: RequestBody -> RequestBody -> RequestBody # sconcat :: NonEmpty RequestBody -> RequestBody # stimes :: Integral b => b -> RequestBody -> RequestBody # | |
| Monoid RequestBody | |
Defined in Network.HTTP.Client.Types Methods mempty :: RequestBody # mappend :: RequestBody -> RequestBody -> RequestBody # mconcat :: [RequestBody] -> RequestBody # | |
Constructors
| Proxy | |
Fields
| |
Constructors
data HttpExceptionContent #
Constructors
Instances
| Show HttpExceptionContent | |
Defined in Network.HTTP.Client.Types Methods showsPrec :: Int -> HttpExceptionContent -> ShowS # show :: HttpExceptionContent -> String # showList :: [HttpExceptionContent] -> ShowS # | |
data HttpException #
Instances
| Show HttpException | |
Defined in Network.HTTP.Client.Types Methods showsPrec :: Int -> HttpException -> ShowS # show :: HttpException -> String # showList :: [HttpException] -> ShowS # | |
| Exception HttpException | |
Defined in Network.HTTP.Client.Types Methods toException :: HttpException -> SomeException # fromException :: SomeException -> Maybe HttpException # displayException :: HttpException -> String # | |
makeConnection :: IO ByteString -> (ByteString -> IO ()) -> IO () -> IO Connection #
socketConnection :: Socket -> Int -> IO Connection #
brReadSome :: BodyReader -> Int -> IO ByteString #
parseUrl :: MonadThrow m => String -> m Request #
parseUrlThrow :: MonadThrow m => String -> m Request #
throwErrorStatusCodes :: MonadIO m => Request -> Response BodyReader -> m () #
parseRequest :: MonadThrow m => String -> m Request #
parseRequest_ :: String -> Request #
requestFromURI :: MonadThrow m => URI -> m Request #
requestFromURI_ :: URI -> Request #
applyBasicAuth :: ByteString -> ByteString -> Request -> Request #
applyBasicProxyAuth :: ByteString -> ByteString -> Request -> Request #
urlEncodedBody :: [(ByteString, ByteString)] -> Request -> Request #
setRequestCheckStatus :: Request -> Request #
setQueryString :: [(ByteString, Maybe ByteString)] -> Request -> Request #
setQueryStringPartialEscape :: [(ByteString, [EscapeItem])] -> Request -> Request #
streamFile :: FilePath -> IO RequestBody #
observedStreamFile :: (StreamFileStatus -> IO ()) -> FilePath -> IO RequestBody #
rawConnectionModifySocket :: (Socket -> IO ()) -> IO (Maybe HostAddress -> String -> Int -> IO Connection) #
rawConnectionModifySocketSize :: (Socket -> IO ()) -> IO (Int -> Maybe HostAddress -> String -> Int -> IO Connection) #
withManager :: ManagerSettings -> (Manager -> IO a) -> IO a #
useProxy :: Proxy -> ProxyOverride #
proxyEnvironment :: Maybe Proxy -> ProxyOverride #
proxyEnvironmentNamed :: Text -> Maybe Proxy -> ProxyOverride #
isIpAddress :: ByteString -> Bool #
domainMatches :: ByteString -> ByteString -> Bool #
defaultPath :: Request -> ByteString #
pathMatches :: ByteString -> ByteString -> Bool #
createCookieJar :: [Cookie] -> CookieJar #
destroyCookieJar :: CookieJar -> [Cookie] #
evictExpiredCookies :: CookieJar -> UTCTime -> CookieJar #
computeCookieString :: Request -> CookieJar -> UTCTime -> Bool -> (ByteString, CookieJar) #
data HistoriedResponse body #
Instances
| Functor HistoriedResponse | |
Defined in Network.HTTP.Client Methods fmap :: (a -> b) -> HistoriedResponse a -> HistoriedResponse b # (<$) :: a -> HistoriedResponse b -> HistoriedResponse a # | |
| Foldable HistoriedResponse | |
Defined in Network.HTTP.Client Methods fold :: Monoid m => HistoriedResponse m -> m foldMap :: Monoid m => (a -> m) -> HistoriedResponse a -> m foldMap' :: Monoid m => (a -> m) -> HistoriedResponse a -> m foldr :: (a -> b -> b) -> b -> HistoriedResponse a -> b foldr' :: (a -> b -> b) -> b -> HistoriedResponse a -> b foldl :: (b -> a -> b) -> b -> HistoriedResponse a -> b foldl' :: (b -> a -> b) -> b -> HistoriedResponse a -> b foldr1 :: (a -> a -> a) -> HistoriedResponse a -> a foldl1 :: (a -> a -> a) -> HistoriedResponse a -> a toList :: HistoriedResponse a -> [a] null :: HistoriedResponse a -> Bool length :: HistoriedResponse a -> Int elem :: Eq a => a -> HistoriedResponse a -> Bool maximum :: Ord a => HistoriedResponse a -> a minimum :: Ord a => HistoriedResponse a -> a sum :: Num a => HistoriedResponse a -> a product :: Num a => HistoriedResponse a -> a | |
| Traversable HistoriedResponse | |
Defined in Network.HTTP.Client Methods traverse :: Applicative f => (a -> f b) -> HistoriedResponse a -> f (HistoriedResponse b) # sequenceA :: Applicative f => HistoriedResponse (f a) -> f (HistoriedResponse a) # mapM :: Monad m => (a -> m b) -> HistoriedResponse a -> m (HistoriedResponse b) # sequence :: Monad m => HistoriedResponse (m a) -> m (HistoriedResponse a) # | |
| Show body => Show (HistoriedResponse body) | |
Defined in Network.HTTP.Client Methods showsPrec :: Int -> HistoriedResponse body -> ShowS # show :: HistoriedResponse body -> String # showList :: [HistoriedResponse body] -> ShowS # | |
| Generic (HistoriedResponse body) | |
Defined in Network.HTTP.Client Associated Types type Rep (HistoriedResponse body) :: Type -> Type Methods from :: HistoriedResponse body -> Rep (HistoriedResponse body) x to :: Rep (HistoriedResponse body) x -> HistoriedResponse body | |
| type Rep (HistoriedResponse body) | |
Defined in Network.HTTP.Client type Rep (HistoriedResponse body) = D1 ('MetaData "HistoriedResponse" "Network.HTTP.Client" "http-client-0.6.4.1-DMdlogaeUWRHQOBv1s47E" 'False) (C1 ('MetaCons "HistoriedResponse" 'PrefixI 'True) (S1 ('MetaSel ('Just "hrRedirects") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(Request, Response ByteString)]) :*: (S1 ('MetaSel ('Just "hrFinalRequest") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Request) :*: S1 ('MetaSel ('Just "hrFinalResponse") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Response body))))) | |
responseOpenHistory :: Request -> Manager -> IO (HistoriedResponse BodyReader) #
withResponseHistory :: Request -> Manager -> (HistoriedResponse BodyReader -> IO a) -> IO a #
http20 :: HttpVersion Source #
HTTP 2.0
http11 :: HttpVersion Source #
HTTP 1.1
http10 :: HttpVersion Source #
HTTP 1.0
http09 :: HttpVersion Source #
HTTP 0.9
data HttpVersion Source #
HTTP Version.
Note that the Show instance is intended merely for debugging.
Constructors
| HttpVersion | |
Instances
| Eq HttpVersion | |
Defined in Network.HTTP.Types.Version | |
| Ord HttpVersion | |
Defined in Network.HTTP.Types.Version Methods compare :: HttpVersion -> HttpVersion -> Ordering # (<) :: HttpVersion -> HttpVersion -> Bool # (<=) :: HttpVersion -> HttpVersion -> Bool # (>) :: HttpVersion -> HttpVersion -> Bool # (>=) :: HttpVersion -> HttpVersion -> Bool # max :: HttpVersion -> HttpVersion -> HttpVersion # min :: HttpVersion -> HttpVersion -> HttpVersion # | |
| Show HttpVersion | |
Defined in Network.HTTP.Types.Version Methods showsPrec :: Int -> HttpVersion -> ShowS # show :: HttpVersion -> String # showList :: [HttpVersion] -> ShowS # | |
class QueryLike a where Source #
Types which can, and commonly are, converted to Query are in this class.
You can use lists of simple key value pairs, with ByteString (strict, or lazy:
ByteString), Text, or String as the key/value types. You can also have the value
type lifted into a Maybe to support keys without values; and finally it is possible to put
each pair into a Maybe for key-value pairs that aren't always present.
Instances
| (QueryKeyLike k, QueryValueLike v) => QueryLike [Maybe (k, v)] | |
| (QueryKeyLike k, QueryValueLike v) => QueryLike [(k, v)] | |
Defined in Network.HTTP.Types.QueryLike | |
renderQueryBuilderPartialEscape Source #
Arguments
| :: Bool | prepend a question mark? |
| -> PartialEscapeQuery | |
| -> Builder |
Convert PartialEscapeQuery to a Builder.
renderQueryPartialEscape Source #
Arguments
| :: Bool | prepend question mark? |
| -> PartialEscapeQuery | |
| -> ByteString |
Convert PartialEscapeQuery to ByteString.
decodePath :: ByteString -> ([Text], Query) Source #
Decode a whole path (path segments + query).
encodePath :: [Text] -> Query -> Builder Source #
Encode a whole path (path segments + query).
extractPath :: ByteString -> ByteString Source #
Extract whole path (path segments + query) from a RFC 2616 Request-URI.
>>>extractPath "/path""/path"
>>>extractPath "http://example.com:8080/path""/path"
>>>extractPath "http://example.com""/"
>>>extractPath """/"
decodePathSegments :: ByteString -> [Text] Source #
Parse a list of path segments from a valid URL fragment.
encodePathSegmentsRelative :: [Text] -> Builder Source #
Like encodePathSegments, but without the initial slash.
encodePathSegments :: [Text] -> Builder Source #
Encodes a list of path segments into a valid URL fragment.
This function takes the following three steps:
- UTF-8 encodes the characters.
- Performs percent encoding on all unreserved characters, as well as
:@=+$, - Prepends each segment with a slash.
For example:
encodePathSegments [\"foo\", \"bar\", \"baz\"]
"/foo/bar/baz"
encodePathSegments [\"foo bar\", \"baz\/bin\"]
"/foo%20bar/baz%2Fbin"
encodePathSegments [\"שלום\"]
"/%D7%A9%D7%9C%D7%95%D7%9D"
Huge thanks to Jeremy Shaw who created the original implementation of this function in web-routes and did such thorough research to determine all correct escaping procedures.
Arguments
| :: Bool | Whether to decode |
| -> ByteString | |
| -> ByteString |
Percent-decoding.
Arguments
| :: Bool | Whether to decode |
| -> ByteString | The ByteString to encode as URL |
| -> ByteString | The encoded URL |
Percent-encoding for URLs.
Arguments
| :: Bool | Whether input is in query string. True: Query string, False: Path element |
| -> ByteString | |
| -> Builder |
Percent-encoding for URLs (using Builder).
parseSimpleQuery :: ByteString -> SimpleQuery Source #
Parse SimpleQuery from a ByteString.
parseQuery :: ByteString -> Query Source #
Split out the query string into a list of keys and values. A few importants points:
- The result returned is still bytestrings, since we perform no character decoding here. Most likely, you will want to use UTF-8 decoding, but this is left to the user of the library.
- Percent decoding errors are ignored. In particular,
"%Q"will be output as"%Q". - It decodes
'+'characters to' '
Arguments
| :: Bool | prepend question mark? |
| -> SimpleQuery | |
| -> ByteString |
Convert SimpleQuery to ByteString.
Arguments
| :: Bool | prepend question mark? |
| -> Query | |
| -> ByteString |
Convert Query to ByteString.
Convert Query to a Builder.
simpleQueryToQuery :: SimpleQuery -> Query Source #
Convert SimpleQuery to Query.
parseQueryText :: ByteString -> QueryText Source #
Parse QueryText from a ByteString. See parseQuery for details.
queryToQueryText :: Query -> QueryText Source #
Convert QueryText to a Builder.
type QueryText = [(Text, Maybe Text)] Source #
Like Query, but with Text instead of ByteString (UTF8-encoded).
type SimpleQueryItem = (ByteString, ByteString) Source #
Simplified Query item type without support for parameter-less items.
type SimpleQuery = [SimpleQueryItem] Source #
Simplified Query type without support for parameter-less items.
data EscapeItem Source #
For some URIs characters must not be URI encoded,
e.g. '+' or ':' in q=a+language:haskell+created:2009-01-01..2009-02-01&sort=stars
The character list unreservedPI instead of unreservedQS would solve this.
But we explicitly decide what part to encode.
This is mandatory when searching for '+': q=%2B+language:haskell.
Constructors
| QE ByteString | |
| QN ByteString |
Instances
| Eq EscapeItem | |
Defined in Network.HTTP.Types.URI | |
| Ord EscapeItem | |
Defined in Network.HTTP.Types.URI Methods compare :: EscapeItem -> EscapeItem -> Ordering # (<) :: EscapeItem -> EscapeItem -> Bool # (<=) :: EscapeItem -> EscapeItem -> Bool # (>) :: EscapeItem -> EscapeItem -> Bool # (>=) :: EscapeItem -> EscapeItem -> Bool # max :: EscapeItem -> EscapeItem -> EscapeItem # min :: EscapeItem -> EscapeItem -> EscapeItem # | |
| Show EscapeItem | |
Defined in Network.HTTP.Types.URI Methods showsPrec :: Int -> EscapeItem -> ShowS # show :: EscapeItem -> String # showList :: [EscapeItem] -> ShowS # | |
type PartialEscapeQueryItem = (ByteString, [EscapeItem]) Source #
Query item
type PartialEscapeQuery = [PartialEscapeQueryItem] Source #
Query with some chars that should not be escaped.
General form: a=b&c=d:e+f&g=h
statusIsServerError :: Status -> Bool Source #
Server Error class
statusIsClientError :: Status -> Bool Source #
Client Error class
statusIsRedirection :: Status -> Bool Source #
Redirection class
statusIsSuccessful :: Status -> Bool Source #
Successful class
statusIsInformational :: Status -> Bool Source #
Informational class
networkAuthenticationRequired511 :: Status Source #
Network Authentication Required 511 (RFC 6585)
httpVersionNotSupported505 :: Status Source #
HTTP Version Not Supported 505
gatewayTimeout504 :: Status Source #
Gateway Timeout 504
serviceUnavailable503 :: Status Source #
Service Unavailable 503
badGateway502 :: Status Source #
Bad Gateway 502
notImplemented501 :: Status Source #
Not Implemented 501
internalServerError500 :: Status Source #
Internal Server Error 500
requestHeaderFieldsTooLarge431 :: Status Source #
Request Header Fields Too Large 431 (RFC 6585)
tooManyRequests429 :: Status Source #
Too Many Requests 429 (RFC 6585)
preconditionRequired428 :: Status Source #
Precondition Required 428 (RFC 6585)
unprocessableEntity422 :: Status Source #
Unprocessable Entity 422 (RFC 4918)
imATeapot418 :: Status Source #
I'm a teapot 418
expectationFailed417 :: Status Source #
Expectation Failed 417
requestedRangeNotSatisfiable416 :: Status Source #
Requested Range Not Satisfiable 416
unsupportedMediaType415 :: Status Source #
Unsupported Media Type 415
requestURITooLong414 :: Status Source #
Request-URI Too Long 414
requestEntityTooLarge413 :: Status Source #
Request Entity Too Large 413
preconditionFailed412 :: Status Source #
Precondition Failed 412
lengthRequired411 :: Status Source #
Length Required 411
conflict409 :: Status Source #
Conflict 409
requestTimeout408 :: Status Source #
Request Timeout 408
proxyAuthenticationRequired407 :: Status Source #
Proxy Authentication Required 407
notAcceptable406 :: Status Source #
Not Acceptable 406
methodNotAllowed405 :: Status Source #
Method Not Allowed 405
notFound404 :: Status Source #
Not Found 404
forbidden403 :: Status Source #
Forbidden 403
paymentRequired402 :: Status Source #
Payment Required 402
unauthorized401 :: Status Source #
Unauthorized 401
badRequest400 :: Status Source #
Bad Request 400
permanentRedirect308 :: Status Source #
Permanent Redirect 308
temporaryRedirect307 :: Status Source #
Temporary Redirect 307
useProxy305 :: Status Source #
Use Proxy 305
notModified304 :: Status Source #
Not Modified 304
seeOther303 :: Status Source #
See Other 303
movedPermanently301 :: Status Source #
Moved Permanently 301
multipleChoices300 :: Status Source #
Multiple Choices 300
partialContent206 :: Status Source #
Partial Content 206
resetContent205 :: Status Source #
Reset Content 205
noContent204 :: Status Source #
No Content 204
nonAuthoritative203 :: Status Source #
Non-Authoritative Information 203
accepted202 :: Status Source #
Accepted 202
created201 :: Status Source #
Created 201
switchingProtocols101 :: Status Source #
Switching Protocols 101
continue100 :: Status Source #
Continue 100
HTTP Status.
Only the statusCode is used for comparisons.
Please use mkStatus to create status codes from code and message, or the Enum instance or the
status code constants (like ok200). There might be additional record members in the future.
Note that the Show instance is only for debugging.
Constructors
| Status | |
Fields
| |
renderMethod :: Either ByteString StdMethod -> Method Source #
Convert an algebraic method to a ByteString.
parseMethod :: Method -> Either ByteString StdMethod Source #
Convert a method ByteString to a StdMethod if possible.
methodPatch :: Method Source #
HTTP Method constants.
methodOptions :: Method Source #
HTTP Method constants.
methodConnect :: Method Source #
HTTP Method constants.
methodTrace :: Method Source #
HTTP Method constants.
methodDelete :: Method Source #
HTTP Method constants.
methodHead :: Method Source #
HTTP Method constants.
methodPost :: Method Source #
HTTP Method constants.
type Method = ByteString Source #
HTTP method (flat string type).
HTTP standard method (as defined by RFC 2616, and PATCH which is defined by RFC 5789).
Instances
| Bounded StdMethod | |
| Enum StdMethod | |
Defined in Network.HTTP.Types.Method Methods succ :: StdMethod -> StdMethod # pred :: StdMethod -> StdMethod # fromEnum :: StdMethod -> Int # enumFrom :: StdMethod -> [StdMethod] # enumFromThen :: StdMethod -> StdMethod -> [StdMethod] # enumFromTo :: StdMethod -> StdMethod -> [StdMethod] # enumFromThenTo :: StdMethod -> StdMethod -> StdMethod -> [StdMethod] # | |
| Eq StdMethod | |
| Ord StdMethod | |
| Read StdMethod | |
Defined in Network.HTTP.Types.Method | |
| Show StdMethod | |
| Ix StdMethod | |
Defined in Network.HTTP.Types.Method Methods range :: (StdMethod, StdMethod) -> [StdMethod] index :: (StdMethod, StdMethod) -> StdMethod -> Int unsafeIndex :: (StdMethod, StdMethod) -> StdMethod -> Int inRange :: (StdMethod, StdMethod) -> StdMethod -> Bool rangeSize :: (StdMethod, StdMethod) -> Int unsafeRangeSize :: (StdMethod, StdMethod) -> Int | |
parseByteRanges :: ByteString -> Maybe ByteRanges Source #
Parse the value of a Range header into a ByteRanges.
>>>parseByteRanges "error"Nothing>>>parseByteRanges "bytes=0-499"Just [ByteRangeFromTo 0 499]>>>parseByteRanges "bytes=500-999"Just [ByteRangeFromTo 500 999]>>>parseByteRanges "bytes=-500"Just [ByteRangeSuffix 500]>>>parseByteRanges "bytes=9500-"Just [ByteRangeFrom 9500]>>>parseByteRanges "bytes=0-0,-1"Just [ByteRangeFromTo 0 0,ByteRangeSuffix 1]>>>parseByteRanges "bytes=500-600,601-999"Just [ByteRangeFromTo 500 600,ByteRangeFromTo 601 999]>>>parseByteRanges "bytes=500-700,601-999"Just [ByteRangeFromTo 500 700,ByteRangeFromTo 601 999]
renderByteRangesBuilder :: ByteRanges -> Builder Source #
renderByteRangeBuilder :: ByteRange -> Builder Source #
hCookie :: HeaderName Source #
HTTP Header names according to https://tools.ietf.org/html/rfc6265#section-4
hUserAgent :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hServer :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hReferer :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hRange :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hLocation :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hLastModified :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hIfRange :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hIfModifiedSince :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hDate :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hContentType :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hContentMD5 :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hContentLength :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hContentEncoding :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hConnection :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hCacheControl :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hAuthorization :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hAcceptLanguage :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
hAccept :: HeaderName Source #
HTTP Header names according to http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html
type HeaderName = CI ByteString Source #
Header name
RFC 2616 Byte range (individual).
Negative indices are not allowed!
Constructors
| ByteRangeFrom !Integer | |
| ByteRangeFromTo !Integer !Integer | |
| ByteRangeSuffix !Integer |
Instances
| Eq ByteRange | |
| Data ByteRange | |
Defined in Network.HTTP.Types.Header Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ByteRange -> c ByteRange gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ByteRange toConstr :: ByteRange -> Constr dataTypeOf :: ByteRange -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ByteRange) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ByteRange) gmapT :: (forall b. Data b => b -> b) -> ByteRange -> ByteRange gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ByteRange -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ByteRange -> r gmapQ :: (forall d. Data d => d -> u) -> ByteRange -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ByteRange -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ByteRange -> m ByteRange gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ByteRange -> m ByteRange gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ByteRange -> m ByteRange | |
| Ord ByteRange | |
| Show ByteRange | |
type ByteRanges = [ByteRange] Source #
RFC 2616 Byte ranges (set).
runMigration :: forall (m :: Type -> Type). MonadIO m => Migration -> ReaderT SqlBackend m () Source #
Runs a migration. If the migration fails to parse or if any of the
migrations are unsafe, then this calls error to halt the program.
limitOffsetOrder :: PersistEntity val => [SelectOpt val] -> (Int, Int, [SelectOpt val]) Source #
FIXME What's this exactly?
toJsonText :: ToJSON j => j -> Text Source #
mapToJSON :: [(Text, PersistValue)] -> Text Source #
Convert map (list of tuples) into textual representation of JSON
object. This is a type-constrained synonym for toJsonText.
listToJSON :: [PersistValue] -> Text Source #
Convert list of PersistValues into textual representation of JSON
object. This is a type-constrained synonym for toJsonText.
(||.) :: [Filter v] -> [Filter v] -> [Filter v] infixl 3 Source #
The OR of two lists of filters. For example:
selectList
([ PersonAge >. 25
, PersonAge <. 30 ] ||.
[ PersonIncome >. 15000
, PersonIncome <. 25000 ])
[]will filter records where a person's age is between 25 and 30 or a person's income is between (15000 and 25000).
If you are looking for an (&&.) operator to do (A AND B AND (C OR D))
you can use the (++) operator instead as there is no (&&.). For
example:
selectList
([ PersonAge >. 25
, PersonAge <. 30 ] ++
([PersonCategory ==. 1] ||.
[PersonCategory ==. 5]))
[]will filter records where a person's age is between 25 and 30 and (person's category is either 1 or 5).
(/<-.) :: forall v typ. PersistField typ => EntityField v typ -> [typ] -> Filter v infix 4 Source #
Check if value is not in given list.
Example usage
selectSimon :: MonadIO m => ReaderT SqlBackend m [Entity User] selectSimon = selectList [UserAge /<-. [40]] []
The above query when applied on dataset-1, will produce this:
+-----+-----+-----+ |id |name |age | +-----+-----+-----+ |2 |Simon|41 | +-----+-----+-----+
(<-.) :: forall v typ. PersistField typ => EntityField v typ -> [typ] -> Filter v infix 4 Source #
Check if value is in given list.
Example usage
selectUsers :: MonadIO m => ReaderT SqlBackend m [Entity User] selectUsers = selectList [UserAge <-. [40, 41]] []
The above query when applied on dataset-1, will produce this:
+-----+-----+-----+ |id |name |age | +-----+-----+-----+ |1 |SPJ |40 | +-----+-----+-----+ |2 |Simon|41 | +-----+-----+-----+
selectSPJ :: MonadIO m => ReaderT SqlBackend m [Entity User] selectSPJ = selectList [UserAge <-. [40]] []
The above query when applied on dataset-1, will produce this:
+-----+-----+-----+ |id |name |age | +-----+-----+-----+ |1 |SPJ |40 | +-----+-----+-----+
(>=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Filter v infix 4 Source #
Greater-than or equal check.
Example usage
selectGreaterEqualAge :: MonadIO m => ReaderT SqlBackend m [Entity User] selectGreaterEqualAge = selectList [UserAge >=. 41 ] []
The above query when applied on dataset-1, will produce this:
+-----+-----+-----+ |id |name |age | +-----+-----+-----+ |2 |Simon|41 | +-----+-----+-----+
(>.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Filter v infix 4 Source #
Greater-than check.
Example usage
selectGreaterAge :: MonadIO m => ReaderT SqlBackend m [Entity User] selectGreaterAge = selectList [UserAge >. 40 ] []
The above query when applied on dataset-1, will produce this:
+-----+-----+-----+ |id |name |age | +-----+-----+-----+ |2 |Simon|41 | +-----+-----+-----+
(<=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Filter v infix 4 Source #
Less-than or equal check.
Example usage
selectLessEqualAge :: MonadIO m => ReaderT SqlBackend m [Entity User] selectLessEqualAge = selectList [UserAge <=. 40 ] []
The above query when applied on dataset-1, will produce this:
+-----+-----+-----+ |id |name |age | +-----+-----+-----+ |1 |SPJ |40 | +-----+-----+-----+
(<.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Filter v infix 4 Source #
Less-than check.
Example usage
selectLessAge :: MonadIO m => ReaderT SqlBackend m [Entity User] selectLessAge = selectList [UserAge <. 41 ] []
The above query when applied on dataset-1, will produce this:
+-----+-----+-----+ |id |name |age | +-----+-----+-----+ |1 |SPJ |40 | +-----+-----+-----+
(!=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Filter v infix 4 Source #
Non-equality check.
Example usage
selectSimon :: MonadIO m => ReaderT SqlBackend m [Entity User] selectSimon = selectList [UserName !=. "SPJ" ] []
The above query when applied on dataset-1, will produce this:
+-----+-----+-----+ |id |name |age | +-----+-----+-----+ |2 |Simon|41 | +-----+-----+-----+
(==.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Filter v infix 4 Source #
Check for equality.
Example usage
selectSPJ :: MonadIO m => ReaderT SqlBackend m [Entity User] selectSPJ = selectList [UserName ==. "SPJ" ] []
The above query when applied on dataset-1, will produce this:
+-----+-----+-----+ |id |name |age | +-----+-----+-----+ |1 |SPJ |40 | +-----+-----+-----+
(/=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Update v infixr 3 Source #
Assign a field by division (/=).
Example usage
divideAge :: MonadIO m => ReaderT SqlBackend m () divideAge = updateWhere [UserName ==. "SPJ" ] [UserAge /=. 2]
The above query when applied on dataset-1, will produce this:
+-----+-----+---------+ |id |name |age | +-----+-----+---------+ |1 |SPJ |40 -> 20 | +-----+-----+---------+ |2 |Simon|41 | +-----+-----+---------+
(*=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Update v infixr 3 Source #
Assign a field by multiplication (*=).
Example usage
multiplyAge :: MonadIO m => ReaderT SqlBackend m () multiplyAge = updateWhere [UserName ==. "SPJ" ] [UserAge *=. 2]
The above query when applied on dataset-1, will produce this:
+-----+-----+--------+ |id |name |age | +-----+-----+--------+ |1 |SPJ |40 -> 80| +-----+-----+--------+ |2 |Simon|41 | +-----+-----+--------+
(-=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Update v infixr 3 Source #
Assign a field by subtraction (-=).
Example usage
subtractAge :: MonadIO m => ReaderT SqlBackend m () subtractAge = updateWhere [UserName ==. "SPJ" ] [UserAge -=. 1]
The above query when applied on dataset-1, will produce this:
+-----+-----+---------+ |id |name |age | +-----+-----+---------+ |1 |SPJ |40 -> 39 | +-----+-----+---------+ |2 |Simon|41 | +-----+-----+---------+
(+=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Update v infixr 3 Source #
Assign a field by addition (+=).
Example usage
addAge :: MonadIO m => ReaderT SqlBackend m () addAge = updateWhere [UserName ==. "SPJ" ] [UserAge +=. 1]
The above query when applied on dataset-1, will produce this:
+-----+-----+---------+ |id |name |age | +-----+-----+---------+ |1 |SPJ |40 -> 41 | +-----+-----+---------+ |2 |Simon|41 | +-----+-----+---------+
(=.) :: forall v typ. PersistField typ => EntityField v typ -> typ -> Update v infixr 3 Source #
Assign a field a value.
Example usage
updateAge :: MonadIO m => ReaderT SqlBackend m () updateAge = updateWhere [UserName ==. "SPJ" ] [UserAge =. 45]
Similar to updateWhere which is shown in the above example you can use other functions present in the module Database.Persist.Class. Note that the first parameter of updateWhere is [Filter val] and second parameter is [Update val]. By comparing this with the type of ==. and =., you can see that they match up in the above usage.
The above query when applied on dataset-1, will produce this:
+-----+-----+--------+ |id |name |age | +-----+-----+--------+ |1 |SPJ |40 -> 45| +-----+-----+--------+ |2 |Simon|41 | +-----+-----+--------+
type SqlPersistT = ReaderT SqlBackend Source #
data SqlBackend Source #
Instances
| HasPersistBackend SqlBackend | |
Defined in Database.Persist.Sql.Types.Internal Associated Types type BaseBackend SqlBackend Source # Methods persistBackend :: SqlBackend -> BaseBackend SqlBackend Source # | |
| IsPersistBackend SqlBackend | |
Defined in Database.Persist.Sql.Types.Internal Methods mkPersistBackend :: BaseBackend SqlBackend -> SqlBackend Source # | |
| type BaseBackend SqlBackend | |
Defined in Database.Persist.Sql.Types.Internal | |
| newtype BackendKey SqlBackend | |
Defined in Database.Persist.Sql.Orphan.PersistStore | |
type PersistUnique a = PersistUniqueWrite a Source #
A backwards-compatible alias for those that don't care about distinguishing between read and write queries. It signifies the assumption that, by default, a backend can write as well as read.
type PersistQuery a = PersistQueryWrite a Source #
A backwards-compatible alias for those that don't care about distinguishing between read and write queries. It signifies the assumption that, by default, a backend can write as well as read.
type PersistStore a = PersistStoreWrite a Source #
A backwards-compatible alias for those that don't care about distinguishing between read and write queries. It signifies the assumption that, by default, a backend can write as well as read.
deleteCascadeWhere :: forall (m :: Type -> Type) record backend. (MonadIO m, DeleteCascade record backend, PersistQueryWrite backend) => [Filter record] -> ReaderT backend m () Source #
Cascade-deletion of entries satisfying given filters.
class (PersistStoreWrite backend, PersistEntity record, BaseBackend backend ~ PersistEntityBackend record) => DeleteCascade record backend where Source #
For combinations of backends and entities that support cascade-deletion. “Cascade-deletion” means that entries that depend on other entries to be deleted will be deleted as well.
selectKeysList :: forall (m :: Type -> Type) backend record. (MonadIO m, PersistQueryRead backend, PersistRecordBackend record backend) => [Filter record] -> [SelectOpt record] -> ReaderT backend m [Key record] Source #
Call selectKeys but return the result as a list.
selectList :: forall (m :: Type -> Type) backend record. (MonadIO m, PersistQueryRead backend, PersistRecordBackend record backend) => [Filter record] -> [SelectOpt record] -> ReaderT backend m [Entity record] Source #
Call selectSource but return the result as a list.
selectKeys :: forall backend (m :: Type -> Type) record. (PersistQueryRead backend, MonadResource m, PersistRecordBackend record backend, MonadReader backend m) => [Filter record] -> [SelectOpt record] -> ConduitM () (Key record) m () Source #
Get the Keys of all records matching the given criterion.
selectSource :: forall backend (m :: Type -> Type) record. (PersistQueryRead backend, MonadResource m, PersistRecordBackend record backend, MonadReader backend m) => [Filter record] -> [SelectOpt record] -> ConduitM () (Entity record) m () Source #
Get all records matching the given criterion in the specified order. Returns also the identifiers.
class (PersistCore backend, PersistStoreRead backend) => PersistQueryRead backend where Source #
Backends supporting conditional read operations.
Minimal complete definition
Methods
selectSourceRes :: forall record (m1 :: Type -> Type) (m2 :: Type -> Type). (PersistRecordBackend record backend, MonadIO m1, MonadIO m2) => [Filter record] -> [SelectOpt record] -> ReaderT backend m1 (Acquire (ConduitM () (Entity record) m2 ())) Source #
Get all records matching the given criterion in the specified order. Returns also the identifiers.
selectFirst :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [Filter record] -> [SelectOpt record] -> ReaderT backend m (Maybe (Entity record)) Source #
Get just the first record for the criterion.
selectKeysRes :: forall (m1 :: Type -> Type) (m2 :: Type -> Type) record. (MonadIO m1, MonadIO m2, PersistRecordBackend record backend) => [Filter record] -> [SelectOpt record] -> ReaderT backend m1 (Acquire (ConduitM () (Key record) m2 ())) Source #
Get the Keys of all records matching the given criterion.
count :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [Filter record] -> ReaderT backend m Int Source #
The total number of records fulfilling the given criterion.
class (PersistQueryRead backend, PersistStoreWrite backend) => PersistQueryWrite backend where Source #
Backends supporting conditional write operations
Methods
updateWhere :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [Filter record] -> [Update record] -> ReaderT backend m () Source #
Update individual fields on any record matching the given criterion.
deleteWhere :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [Filter record] -> ReaderT backend m () Source #
Delete all records matching the given criterion.
checkUnique :: forall (m :: Type -> Type) record backend. (MonadIO m, PersistRecordBackend record backend, PersistUniqueRead backend) => record -> ReaderT backend m (Maybe (Unique record)) Source #
Check whether there are any conflicts for unique keys with this entity and existing entities in the database.
Returns Nothing if the entity would be unique, and could thus safely be inserted.
on a conflict returns the conflicting key
Example usage
replaceUnique :: forall (m :: Type -> Type) record backend. (MonadIO m, Eq (Unique record), PersistRecordBackend record backend, PersistUniqueWrite backend) => Key record -> record -> ReaderT backend m (Maybe (Unique record)) Source #
Attempt to replace the record of the given key with the given new record. First query the unique fields to make sure the replacement maintains uniqueness constraints.
Return Nothing if the replacement was made.
If uniqueness is violated, return a Just with the Unique violation
Since: persistent-1.2.2.0
getByValue :: forall record (m :: Type -> Type) backend. (MonadIO m, PersistUniqueRead backend, PersistRecordBackend record backend, AtLeastOneUniqueKey record) => record -> ReaderT backend m (Maybe (Entity record)) Source #
A modification of getBy, which takes the PersistEntity itself instead
of a Unique record. Returns a record matching one of the unique keys. This
function makes the most sense on entities with a single Unique
constructor.
Example usage
onlyUnique :: forall (m :: Type -> Type) backend record. (MonadIO m, PersistUniqueWrite backend, PersistRecordBackend record backend, OnlyOneUniqueKey record) => record -> ReaderT backend m (Unique record) Source #
Return the single unique key for a record.
Example usage
We use shcema-1 and dataset-1 here.
onlySimonConst :: MonadIO m => ReaderT SqlBackend m (Unique User) onlySimonConst = onlyUnique $ User "Simon" 999
mSimonConst <- onlySimonConst
mSimonConst would be Simon's uniqueness constraint. Note that
onlyUnique doesn't work if there're more than two constraints. It will
fail with a type error instead.
insertUniqueEntity :: forall (m :: Type -> Type) record backend. (MonadIO m, PersistRecordBackend record backend, PersistUniqueWrite backend) => record -> ReaderT backend m (Maybe (Entity record)) Source #
Like insertEntity, but returns Nothing when the record
couldn't be inserted because of a uniqueness constraint.
Example usage
We use schema-2 and dataset-1 here.
insertUniqueSpjEntity :: MonadIO m => ReaderT SqlBackend m (Maybe (Entity User)) insertUniqueSpjEntity = insertUniqueEntity $ User "SPJ" 50
mSpjEnt <- insertUniqueSpjEntity
The above query results Nothing as SPJ already exists.
insertUniqueAlexaEntity :: MonadIO m => ReaderT SqlBackend m (Maybe (Entity User)) insertUniqueAlexaEntity = insertUniqueEntity $ User "Alexa" 3
mAlexaEnt <- insertUniqueSpjEntity
Because there's no such unique keywords of the given record, the above query when applied on dataset-1, will produce this:
+----+-------+-----+ | id | name | age | +----+-------+-----+ | 1 | SPJ | 40 | +----+-------+-----+ | 2 | Simon | 41 | +----+-------+-----+ | 3 | Alexa | 3 | +----+-------+-----+
Since: persistent-2.7.1
insertBy :: forall (m :: Type -> Type) backend record. (MonadIO m, PersistUniqueWrite backend, PersistRecordBackend record backend, AtLeastOneUniqueKey record) => record -> ReaderT backend m (Either (Entity record) (Key record)) Source #
Insert a value, checking for conflicts with any unique constraints. If a
duplicate exists in the database, it is returned as Left. Otherwise, the
new 'Key is returned as Right.
Example usage
With schema-2 and dataset-1, we have following lines of code:
l1 <- insertBy $ User "SPJ" 20 l2 <- insertBy $ User "XXX" 41 l3 <- insertBy $ User "SPJ" 40 r1 <- insertBy $ User "XXX" 100
First three lines return Left because there're duplicates in given record's uniqueness constraints. While the last line returns a new key as Right.
class (PersistCore backend, PersistStoreRead backend) => PersistUniqueRead backend where Source #
Queries against Unique keys (other than the id Key).
Please read the general Persistent documentation to learn how to create
Unique keys.
Using this with an Entity without a Unique key leads to undefined
behavior. A few of these functions require a single Unique, so using
an Entity with multiple Uniques is also undefined. In these cases
persistent's goal is to throw an exception as soon as possible, but
persistent is still transitioning to that.
SQL backends automatically create uniqueness constraints, but for MongoDB you must manually place a unique index on a field to have a uniqueness constraint.
Methods
getBy :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Unique record -> ReaderT backend m (Maybe (Entity record)) Source #
Get a record by unique key, if available. Returns also the identifier.
Example usage
getBySpjName :: MonadIO m => ReaderT SqlBackend m (Maybe (Entity User)) getBySpjName = getBy $ UniqueUserName "SPJ"
mSpjEnt <- getBySpjName
The above query when applied on dataset-1, will get this entity:
+----+------+-----+ | id | name | age | +----+------+-----+ | 1 | SPJ | 40 | +----+------+-----+
class (PersistUniqueRead backend, PersistStoreWrite backend) => PersistUniqueWrite backend where Source #
Some functions in this module (insertUnique, insertBy, and
replaceUnique) first query the unique indexes to check for
conflicts. You could instead optimistically attempt to perform the
operation (e.g. replace instead of replaceUnique). However,
- there is some fragility to trying to catch the correct exception and determing the column of failure;
- an exception will automatically abort the current SQL transaction.
Minimal complete definition
Methods
deleteBy :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Unique record -> ReaderT backend m () Source #
Delete a specific record by unique key. Does nothing if no record matches.
Example usage
insertUnique :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => record -> ReaderT backend m (Maybe (Key record)) Source #
Like insert, but returns Nothing when the record
couldn't be inserted because of a uniqueness constraint.
Example usage
With schema-1 and dataset-1, we try to insert the following two records:
linusId <- insertUnique $ User "Linus" 48 spjId <- insertUnique $ User "SPJ" 90
+-----+------+-----+ |id |name |age | +-----+------+-----+ |1 |SPJ |40 | +-----+------+-----+ |2 |Simon |41 | +-----+------+-----+ |3 |Linus |48 | +-----+------+-----+
Linus's record was inserted to dataset-1, while SPJ wasn't because SPJ already exists in dataset-1.
Arguments
| :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend, OnlyOneUniqueKey record) | |
| => record | new record to insert |
| -> [Update record] | updates to perform if the record already exists |
| -> ReaderT backend m (Entity record) | the record in the database after the operation |
Update based on a uniqueness constraint or insert:
- insert the new record if it does not exist;
- If the record exists (matched via it's uniqueness constraint), then update the existing record with the parameters which is passed on as list to the function.
Example usage
First, we try to explain upsert using schema-1 and dataset-1.
upsertSpj :: MonadIO m => [Update User] -> ReaderT SqlBackend m (Maybe (Entity User)) upsertSpj updates = upsert (User "SPJ" 999) upadtes
mSpjEnt <- upsertSpj [UserAge +=. 15]
The above query when applied on dataset-1, will produce this:
+-----+-----+--------+ |id |name |age | +-----+-----+--------+ |1 |SPJ |40 -> 55| +-----+-----+--------+ |2 |Simon|41 | +-----+-----+--------+
upsertX :: MonadIO m => [Update User] -> ReaderT SqlBackend m (Maybe (Entity User)) upsertX updates = upsert (User "X" 999) updates
mXEnt <- upsertX [UserAge +=. 15]
The above query when applied on dataset-1, will produce this:
+-----+-----+--------+ |id |name |age | +-----+-----+--------+ |1 |SPJ |40 | +-----+-----+--------+ |2 |Simon|41 | +-----+-----+--------+ |3 |X |999 | +-----+-----+--------+
Next, what if the schema has two uniqueness constraints? Let's check it out using schema-2:
mSpjEnt <- upsertSpj [UserAge +=. 15]
This fails with a compile-time type error alerting us to the fact
that this record has multiple unique keys, and suggests that we look for
upsertBy to select the unique key we want.
Arguments
| :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) | |
| => Unique record | uniqueness constraint to find by |
| -> record | new record to insert |
| -> [Update record] | updates to perform if the record already exists |
| -> ReaderT backend m (Entity record) | the record in the database after the operation |
Update based on a given uniqueness constraint or insert:
- insert the new record if it does not exist;
- update the existing record that matches the given uniqueness constraint.
Example usage
We try to explain upsertBy using schema-2 and dataset-1.
upsertBySpjName :: MonadIO m => User -> [Update User] -> ReaderT SqlBackend m (Entity User) upsertBySpjName record updates = upsertBy (UniqueUserName "SPJ") record updates
mSpjEnt <- upsertBySpjName (Person "X" 999) [PersonAge += .15]
The above query will alter dataset-1 to:
+-----+-----+--------+ |id |name |age | +-----+-----+--------+ |1 |SPJ |40 -> 55| +-----+-----+--------+ |2 |Simon|41 | +-----+-----+--------+
upsertBySimonAge :: MonadIO m => User -> [Update User] -> ReaderT SqlBackend m (Entity User) upsertBySimonAge record updates = upsertBy (UniqueUserName "SPJ") record updates
mPhilipEnt <- upsertBySimonAge (User "X" 999) [UserName =. "Philip"]
The above query will alter dataset-1 to:
+----+-----------------+-----+ | id | name | age | +----+-----------------+-----+ | 1 | SPJ | 40 | +----+-----------------+-----+ | 2 | Simon -> Philip | 41 | +----+-----------------+-----+
upsertByUnknownName :: MonadIO m => User -> [Update User] -> ReaderT SqlBackend m (Entity User) upsertByUnknownName record updates = upsertBy (UniqueUserName "Unknown") record updates
mXEnt <- upsertByUnknownName (User "X" 999) [UserAge +=. 15]
This query will alter dataset-1 to:
+-----+-----+-----+ |id |name |age | +-----+-----+-----+ |1 |SPJ |40 | +-----+-----+-----+ |2 |Simon|41 | +-----+-----+-----+ |3 |X |999 | +-----+-----+-----+
Arguments
| :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) | |
| => [record] | A list of the records you want to insert or replace. |
| -> ReaderT backend m () |
Put many records into db
- insert new records that do not exist (or violate any unique constraints)
- replace existing records (matching any unique constraint)
Since: persistent-2.8.1
class PersistEntity record => OnlyOneUniqueKey record where Source #
This class is used to ensure that upsert is only called on records
that have a single Unique key. The quasiquoter automatically generates
working instances for appropriate records, and generates TypeError
instances for records that have 0 or multiple unique keys.
Since: persistent-2.10.0
Methods
onlyUniqueP :: record -> Unique record Source #
type NoUniqueKeysError ty = (('Text "The entity " :<>: 'ShowType ty) :<>: 'Text " does not have any unique keys.") :$$: ('Text "The function you are trying to call requires a unique key " :<>: 'Text "to be defined on the entity.") Source #
This is an error message. It is used when writing instances of
OnlyOneUniqueKey for an entity that has no unique keys.
Since: persistent-2.10.0
type MultipleUniqueKeysError ty = ((('Text "The entity " :<>: 'ShowType ty) :<>: 'Text " has multiple unique keys.") :$$: ('Text "The function you are trying to call requires only a single " :<>: 'Text "unique key.")) :$$: (('Text "There is probably a variant of the function with 'By' " :<>: 'Text "appended that will allow you to select a unique key ") :<>: 'Text "for the operation.") Source #
This is an error message. It is used when an entity has multiple unique keys, and the function expects a single unique key.
Since: persistent-2.10.0
class PersistEntity record => AtLeastOneUniqueKey record where Source #
This class is used to ensure that functions requring at least one
unique key are not called with records that have 0 unique keys. The
quasiquoter automatically writes working instances for appropriate
entities, and generates TypeError instances for records that have
0 unique keys.
Since: persistent-2.10.0
Methods
requireUniquesP :: record -> NonEmpty (Unique record) Source #
insertRecord :: forall record backend (m :: Type -> Type). (PersistEntityBackend record ~ BaseBackend backend, PersistEntity record, MonadIO m, PersistStoreWrite backend) => record -> ReaderT backend m record Source #
Like insertEntity but just returns the record instead of Entity.
Example usage
insertDaveRecord :: MonadIO m => ReaderT SqlBackend m User insertDaveRecord = insertRecord $ User "Dave" 50
dave <- insertDaveRecord
The above query when applied on dataset-1, will produce this:
+-----+------+-----+ |id |name |age | +-----+------+-----+ |1 |SPJ |40 | +-----+------+-----+ |2 |Simon |41 | +-----+------+-----+ |3 |Dave |50 | +-----+------+-----+
Since: persistent-2.6.1
getEntity :: forall backend e (m :: Type -> Type). (PersistStoreRead backend, PersistRecordBackend e backend, MonadIO m) => Key e -> ReaderT backend m (Maybe (Entity e)) Source #
Like get, but returns the complete Entity.
Example usage
getSpjEntity :: MonadIO m => ReaderT SqlBackend m (Maybe (Entity User)) getSpjEntity = getEntity spjId
mSpjEnt <- getSpjEntity
The above query when applied on dataset-1, will get this entity:
+----+------+-----+ | id | name | age | +----+------+-----+ | 1 | SPJ | 40 | +----+------+-----+
insertEntity :: forall backend e (m :: Type -> Type). (PersistStoreWrite backend, PersistRecordBackend e backend, MonadIO m) => e -> ReaderT backend m (Entity e) Source #
Like insert, but returns the complete Entity.
Example usage
insertHaskellEntity :: MonadIO m => ReaderT SqlBackend m (Entity User) insertHaskellEntity = insertEntity $ User "Haskell" 81
haskellEnt <- insertHaskellEntity
The above query when applied on dataset-1, will produce this:
+----+---------+-----+ | id | name | age | +----+---------+-----+ | 1 | SPJ | 40 | +----+---------+-----+ | 2 | Simon | 41 | +----+---------+-----+ | 3 | Haskell | 81 | +----+---------+-----+
belongsToJust :: forall backend ent1 ent2 (m :: Type -> Type). (PersistStoreRead backend, PersistEntity ent1, PersistRecordBackend ent2 backend, MonadIO m) => (ent1 -> Key ent2) -> ent1 -> ReaderT backend m ent2 Source #
Same as belongsTo, but uses getJust and therefore is similarly unsafe.
belongsTo :: forall backend ent1 ent2 (m :: Type -> Type). (PersistStoreRead backend, PersistEntity ent1, PersistRecordBackend ent2 backend, MonadIO m) => (ent1 -> Maybe (Key ent2)) -> ent1 -> ReaderT backend m (Maybe ent2) Source #
Curry this to make a convenience function that loads an associated model.
foreign = belongsTo foreignId
getJustEntity :: forall record backend (m :: Type -> Type). (PersistEntityBackend record ~ BaseBackend backend, MonadIO m, PersistEntity record, PersistStoreRead backend) => Key record -> ReaderT backend m (Entity record) Source #
Same as getJust, but returns an Entity instead of just the record.
Example usage
getJustEntitySpj :: MonadIO m => ReaderT SqlBackend m (Entity User) getJustEntitySpj = getJustEntity spjId
spjEnt <- getJustEntitySpj
The above query when applied on dataset-1, will get this entity:
+----+------+-----+ | id | name | age | +----+------+-----+ | 1 | SPJ | 40 | +----+------+-----+
Since: persistent-2.6.1
getJust :: forall backend record (m :: Type -> Type). (PersistStoreRead backend, PersistRecordBackend record backend, MonadIO m) => Key record -> ReaderT backend m record Source #
Same as get, but for a non-null (not Maybe) foreign key.
Unsafe unless your database is enforcing that the foreign key is valid.
Example usage
getJustSpj :: MonadIO m => ReaderT SqlBackend m User getJustSpj = getJust spjId
spj <- getJust spjId
The above query when applied on dataset-1, will get this record:
+----+------+-----+ | id | name | age | +----+------+-----+ | 1 | SPJ | 40 | +----+------+-----+
getJustUnknown :: MonadIO m => ReaderT SqlBackend m User getJustUnknown = getJust unknownId
mrx <- getJustUnknown
This just throws an error.
liftPersist :: (MonadIO m, MonadReader backend m) => ReaderT backend IO b -> m b Source #
type family BaseBackend backend Source #
Instances
| type BaseBackend SqlBackend | |
Defined in Database.Persist.Sql.Types.Internal | |
| type BaseBackend SqlReadBackend | |
Defined in Database.Persist.Sql.Types.Internal | |
| type BaseBackend SqlWriteBackend | |
Defined in Database.Persist.Sql.Types.Internal | |
class HasPersistBackend backend where Source #
Class which allows the plucking of a BaseBackend backend from some larger type.
For example,
instance HasPersistBackend (SqlReadBackend, Int) where
type BaseBackend (SqlReadBackend, Int) = SqlBackend
persistBackend = unSqlReadBackend . fst
Associated Types
type BaseBackend backend Source #
Methods
persistBackend :: backend -> BaseBackend backend Source #
Instances
| HasPersistBackend SqlBackend | |
Defined in Database.Persist.Sql.Types.Internal Associated Types type BaseBackend SqlBackend Source # Methods persistBackend :: SqlBackend -> BaseBackend SqlBackend Source # | |
| HasPersistBackend SqlReadBackend | |
Defined in Database.Persist.Sql.Types.Internal Associated Types type BaseBackend SqlReadBackend Source # Methods persistBackend :: SqlReadBackend -> BaseBackend SqlReadBackend Source # | |
| HasPersistBackend SqlWriteBackend | |
Defined in Database.Persist.Sql.Types.Internal Associated Types Methods persistBackend :: SqlWriteBackend -> BaseBackend SqlWriteBackend Source # | |
class HasPersistBackend backend => IsPersistBackend backend Source #
Class which witnesses that backend is essentially the same as BaseBackend backend.
That is, they're isomorphic and backend is just some wrapper over BaseBackend backend.
Minimal complete definition
Instances
| IsPersistBackend SqlBackend | |
Defined in Database.Persist.Sql.Types.Internal Methods mkPersistBackend :: BaseBackend SqlBackend -> SqlBackend Source # | |
| IsPersistBackend SqlReadBackend | |
Defined in Database.Persist.Sql.Types.Internal Methods mkPersistBackend :: BaseBackend SqlReadBackend -> SqlReadBackend Source # | |
| IsPersistBackend SqlWriteBackend | |
Defined in Database.Persist.Sql.Types.Internal Methods mkPersistBackend :: BaseBackend SqlWriteBackend -> SqlWriteBackend Source # | |
class BackendCompatible sup sub where Source #
This class witnesses that two backend are compatible, and that you can
convert from the sub backend into the sup backend. This is similar
to the HasPersistBackend and IsPersistBackend classes, but where you
don't want to fix the type associated with the PersistEntityBackend of
a record.
Generally speaking, where you might have:
foo :: (PersistEntityrecord ,PeristEntityBackendrecord ~BaseBackendbackend ,IsSqlBackendbackend )
this can be replaced with:
foo :: (PersistEntityrecord, ,PersistEntityBackendrecord ~ backend ,BackendCompatibleSqlBackendbackend )
This works for SqlReadBackend because of the instance , without needing to go through the BackendCompatible SqlBackend SqlReadBackendBaseBackend type family.
Likewise, functions that are currently hardcoded to use SqlBackend can be generalized:
-- before: asdf ::ReaderTSqlBackendm () asdf = pure () -- after: asdf' ::BackendCompatibleSqlBackend backend => ReaderT backend m () asdf' = withReaderTprojectBackendasdf
Since: persistent-2.7.1
Methods
projectBackend :: sub -> sup Source #
type PersistRecordBackend record backend = (PersistEntity record, PersistEntityBackend record ~ BaseBackend backend) Source #
A convenient alias for common type signatures
class (PersistEntity record, PersistEntityBackend record ~ backend, PersistCore backend) => ToBackendKey backend record where Source #
ToBackendKey converts a PersistEntity Key into a BackendKey
This can be used by each backend to convert between a Key and a plain
Haskell type. For Sql, that is done with toSqlKey and fromSqlKey.
By default, a PersistEntity uses the default BackendKey for its Key
and is an instance of ToBackendKey
A Key that instead uses a custom type will not be an instance of
ToBackendKey.
Methods
toBackendKey :: Key record -> BackendKey backend Source #
fromBackendKey :: BackendKey backend -> Key record Source #
data family BackendKey backend Source #
Instances
| newtype BackendKey SqlBackend | |
Defined in Database.Persist.Sql.Orphan.PersistStore | |
| newtype BackendKey SqlReadBackend | |
Defined in Database.Persist.Sql.Orphan.PersistStore | |
| newtype BackendKey SqlWriteBackend | |
Defined in Database.Persist.Sql.Orphan.PersistStore | |
class PersistCore backend Source #
Associated Types
data BackendKey backend Source #
class (Show (BackendKey backend), Read (BackendKey backend), Eq (BackendKey backend), Ord (BackendKey backend), PersistCore backend, PersistField (BackendKey backend), ToJSON (BackendKey backend), FromJSON (BackendKey backend)) => PersistStoreRead backend where Source #
Minimal complete definition
Methods
get :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Key record -> ReaderT backend m (Maybe record) Source #
Get a record by identifier, if available.
Example usage
getMany :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [Key record] -> ReaderT backend m (Map (Key record) record) Source #
Get many records by their respective identifiers, if available.
Example usage
getUsers :: MonadIO m => ReaderT SqlBackend m (Map (Key User) User) getUsers = getMany allkeys
musers <- getUsers
The above query when applied on dataset-1, will get these records:
+----+-------+-----+ | id | name | age | +----+-------+-----+ | 1 | SPJ | 40 | +----+-------+-----+ | 2 | Simon | 41 | +----+-------+-----+
Since: persistent-2.8.1
class (Show (BackendKey backend), Read (BackendKey backend), Eq (BackendKey backend), Ord (BackendKey backend), PersistStoreRead backend, PersistField (BackendKey backend), ToJSON (BackendKey backend), FromJSON (BackendKey backend)) => PersistStoreWrite backend where Source #
Methods
insert :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => record -> ReaderT backend m (Key record) Source #
Create a new record in the database, returning an automatically created key (in SQL an auto-increment id).
Example usage
Using schema-1 and dataset-1, let's insert a new user John.
insertJohn :: MonadIO m => ReaderT SqlBackend m (Key User) insertJohn = insert $ User "John" 30
johnId <- insertJohn
The above query when applied on dataset-1, will produce this:
+-----+------+-----+ |id |name |age | +-----+------+-----+ |1 |SPJ |40 | +-----+------+-----+ |2 |Simon |41 | +-----+------+-----+ |3 |John |30 | +-----+------+-----+
insert_ :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => record -> ReaderT backend m () Source #
Same as insert, but doesn't return a Key.
Example usage
insertJohn :: MonadIO m => ReaderT SqlBackend m (Key User) insertJohn = insert_ $ User "John" 30
The above query when applied on dataset-1, will produce this:
+-----+------+-----+ |id |name |age | +-----+------+-----+ |1 |SPJ |40 | +-----+------+-----+ |2 |Simon |41 | +-----+------+-----+ |3 |John |30 | +-----+------+-----+
insertMany :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [record] -> ReaderT backend m [Key record] Source #
Create multiple records in the database and return their Keys.
If you don't need the inserted Keys, use insertMany_.
The MongoDB and PostgreSQL backends insert all records and retrieve their keys in one database query.
The SQLite and MySQL backends use the slow, default implementation of
mapM insert.
Example usage
insertUsers :: MonadIO m => ReaderT SqlBackend m [Key User] insertUsers = insertMany [User "John" 30, User "Nick" 32, User "Jane" 20]
userIds <- insertUsers
The above query when applied on dataset-1, will produce this:
+-----+------+-----+ |id |name |age | +-----+------+-----+ |1 |SPJ |40 | +-----+------+-----+ |2 |Simon |41 | +-----+------+-----+ |3 |John |30 | +-----+------+-----+ |4 |Nick |32 | +-----+------+-----+ |5 |Jane |20 | +-----+------+-----+
insertMany_ :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [record] -> ReaderT backend m () Source #
Same as insertMany, but doesn't return any Keys.
The MongoDB, PostgreSQL, SQLite and MySQL backends insert all records in one database query.
Example usage
insertUsers_ :: MonadIO m => ReaderT SqlBackend m () insertUsers_ = insertMany_ [User "John" 30, User "Nick" 32, User "Jane" 20]
The above query when applied on dataset-1, will produce this:
+-----+------+-----+ |id |name |age | +-----+------+-----+ |1 |SPJ |40 | +-----+------+-----+ |2 |Simon |41 | +-----+------+-----+ |3 |John |30 | +-----+------+-----+ |4 |Nick |32 | +-----+------+-----+ |5 |Jane |20 | +-----+------+-----+
insertEntityMany :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [Entity record] -> ReaderT backend m () Source #
Same as insertMany_, but takes an Entity instead of just a record.
Useful when migrating data from one entity to another and want to preserve ids.
The MongoDB, PostgreSQL, SQLite and MySQL backends insert all records in one database query.
Example usage
insertUserEntityMany :: MonadIO m => ReaderT SqlBackend m () insertUserEntityMany = insertEntityMany [SnakeEntity, EvaEntity]
The above query when applied on dataset-1, will produce this:
+-----+------+-----+ |id |name |age | +-----+------+-----+ |1 |SPJ |40 | +-----+------+-----+ |2 |Simon |41 | +-----+------+-----+ |3 |Snake |38 | +-----+------+-----+ |4 |Eva |38 | +-----+------+-----+
insertKey :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Key record -> record -> ReaderT backend m () Source #
Create a new record in the database using the given key.
Example usage
insertAliceKey :: MonadIO m => Key User -> ReaderT SqlBackend m () insertAliceKey key = insertKey key $ User "Alice" 20
insertAliceKey $ UserKey {unUserKey = SqlBackendKey {unSqlBackendKey = 3}}The above query when applied on dataset-1, will produce this:
+-----+------+-----+ |id |name |age | +-----+------+-----+ |1 |SPJ |40 | +-----+------+-----+ |2 |Simon |41 | +-----+------+-----+ |3 |Alice |20 | +-----+------+-----+
repsert :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Key record -> record -> ReaderT backend m () Source #
Put the record in the database with the given key.
Unlike replace, if a record with the given key does not
exist then a new record will be inserted.
Example usage
We try to explain upsertBy using schema-1 and dataset-1.
First, we insert Philip to dataset-1.
insertPhilip :: MonadIO m => ReaderT SqlBackend m (Key User) insertPhilip = insert $ User "Philip" 42
philipId <- insertPhilip
This query will produce:
+-----+------+-----+ |id |name |age | +-----+------+-----+ |1 |SPJ |40 | +-----+------+-----+ |2 |Simon |41 | +-----+------+-----+ |3 |Philip|42 | +-----+------+-----+
repsertHaskell :: MonadIO m => Key record -> ReaderT SqlBackend m () repsertHaskell id = repsert id $ User "Haskell" 81
repsertHaskell philipId
This query will replace Philip's record with Haskell's one:
+-----+-----------------+--------+ |id |name |age | +-----+-----------------+--------+ |1 |SPJ |40 | +-----+-----------------+--------+ |2 |Simon |41 | +-----+-----------------+--------+ |3 |Philip -> Haskell|42 -> 81| +-----+-----------------+--------+
repsert inserts the given record if the key doesn't exist.
repsertXToUnknown :: MonadIO m => ReaderT SqlBackend m () repsertXToUnknown = repsert unknownId $ User "X" 999
For example, applying the above query to dataset-1 will produce this:
+-----+------+-----+ |id |name |age | +-----+------+-----+ |1 |SPJ |40 | +-----+------+-----+ |2 |Simon |41 | +-----+------+-----+ |3 |X |999 | +-----+------+-----+
repsertMany :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => [(Key record, record)] -> ReaderT backend m () Source #
Put many entities into the database.
Batch version of repsert for SQL backends.
Useful when migrating data from one entity to another and want to preserve ids.
Example usage
repsertManyUsers :: MonadIO m =>ReaderT SqlBackend m () repsertManyusers = repsertMany [(simonId, User "Philip" 20), (unknownId999, User "Mr. X" 999)]
The above query when applied on dataset-1, will produce this:
+-----+----------------+---------+ |id |name |age | +-----+----------------+---------+ |1 |SPJ |40 | +-----+----------------+---------+ |2 |Simon -> Philip |41 -> 20 | +-----+----------------+---------+ |999 |Mr. X |999 | +-----+----------------+---------+
Since: persistent-2.8.1
replace :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Key record -> record -> ReaderT backend m () Source #
Replace the record in the database with the given
key. Note that the result is undefined if such record does
not exist, so you must use insertKey or repsert in
these cases.
Example usage
With schema-1 schama-1 and dataset-1,
replaceSpj :: MonadIO m => User -> ReaderT SqlBackend m () replaceSpj record = replace spjId record
The above query when applied on dataset-1, will produce this:
+-----+------+-----+ |id |name |age | +-----+------+-----+ |1 |Mike |45 | +-----+------+-----+ |2 |Simon |41 | +-----+------+-----+
delete :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Key record -> ReaderT backend m () Source #
Delete a specific record by identifier. Does nothing if record does not exist.
Example usage
update :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Key record -> [Update record] -> ReaderT backend m () Source #
Update individual fields on a specific record.
Example usage
updateSpj :: MonadIO m => [Update User] -> ReaderT SqlBackend m () updateSpj updates = update spjId updates
updateSpj [UserAge +=. 100]
The above query when applied on dataset-1, will produce this:
+-----+------+-----+ |id |name |age | +-----+------+-----+ |1 |SPJ |140 | +-----+------+-----+ |2 |Simon |41 | +-----+------+-----+
updateGet :: forall (m :: Type -> Type) record. (MonadIO m, PersistRecordBackend record backend) => Key record -> [Update record] -> ReaderT backend m record Source #
Update individual fields on a specific record, and retrieve the updated value from the database.
Note that this function will throw an exception if the given key is not found in the database.
Example usage
updateGetSpj :: MonadIO m => [Update User] -> ReaderT SqlBackend m User updateGetSpj updates = updateGet spjId updates
spj <- updateGetSpj [UserAge +=. 100]
The above query when applied on dataset-1, will produce this:
+-----+------+-----+ |id |name |age | +-----+------+-----+ |1 |SPJ |140 | +-----+------+-----+ |2 |Simon |41 | +-----+------+-----+
fromPersistValueJSON :: FromJSON a => PersistValue -> Either Text a Source #
Convenience function for getting a free PersistField instance
from a type with JSON instances. The JSON parser used will accept JSON
values other that object and arrays. So, if your instance serializes the
data to a JSON string, this will still work.
Example usage in combination with toPersistValueJSON:
instance PersistField MyData where fromPersistValue = fromPersistValueJSON toPersistValue = toPersistValueJSON
toPersistValueJSON :: ToJSON a => a -> PersistValue Source #
Convenience function for getting a free PersistField instance
from a type with JSON instances.
Example usage in combination with fromPersistValueJSON:
instance PersistField MyData where fromPersistValue = fromPersistValueJSON toPersistValue = toPersistValueJSON
entityIdFromJSON :: (PersistEntity record, FromJSON record) => Value -> Parser (Entity record) Source #
Predefined parseJSON. The input JSON looks like
{"id": 1, "name": ...}.
The typical usage is:
instance FromJSON (Entity User) where
parseJSON = entityIdFromJSON
entityIdToJSON :: (PersistEntity record, ToJSON record) => Entity record -> Value Source #
Predefined toJSON. The resulting JSON looks like
{"id": 1, "name": ...}.
The typical usage is:
instance ToJSON (Entity User) where
toJSON = entityIdToJSON
keyValueEntityFromJSON :: (PersistEntity record, FromJSON record) => Value -> Parser (Entity record) Source #
Predefined parseJSON. The input JSON looks like
{"key": 1, "value": {"name": ...}}.
The typical usage is:
instance FromJSON (Entity User) where
parseJSON = keyValueEntityFromJSON
keyValueEntityToJSON :: (PersistEntity record, ToJSON record) => Entity record -> Value Source #
Predefined toJSON. The resulting JSON looks like
{"key": 1, "value": {"name": ...}}.
The typical usage is:
instance ToJSON (Entity User) where
toJSON = keyValueEntityToJSON
entityValues :: PersistEntity record => Entity record -> [PersistValue] Source #
Get list of values corresponding to given entity.
data family EntityField record :: Type -> Type Source #
An EntityField is parameterised by the Haskell record it belongs to
and the additional type of that field.
data family Key record Source #
By default, a backend will automatically generate the key Instead you can specify a Primary key made up of unique values.
type family PersistEntityBackend record Source #
Persistent allows multiple different backends (databases).
class (PersistField (Key record), ToJSON (Key record), FromJSON (Key record), Show (Key record), Read (Key record), Eq (Key record), Ord (Key record)) => PersistEntity record where Source #
Persistent serialized Haskell records to the database.
A Database Entity (A row in SQL, a document in MongoDB, etc)
corresponds to a Key plus a Haskell record.
For every Haskell record type stored in the database there is a
corresponding PersistEntity instance. An instance of PersistEntity
contains meta-data for the record. PersistEntity also helps abstract
over different record types. That way the same query interface can return
a PersistEntity, with each query returning different types of Haskell
records.
Some advanced type system capabilities are used to make this process type-safe. Persistent users usually don't need to understand the class associated data and functions.
Associated Types
type PersistEntityBackend record Source #
Persistent allows multiple different backends (databases).
By default, a backend will automatically generate the key Instead you can specify a Primary key made up of unique values.
data EntityField record :: Type -> Type Source #
An EntityField is parameterised by the Haskell record it belongs to
and the additional type of that field.
Unique keys besides the Key.
Methods
keyToValues :: Key record -> [PersistValue] Source #
A lower-level key operation.
keyFromValues :: [PersistValue] -> Either Text (Key record) Source #
A lower-level key operation.
persistIdField :: EntityField record (Key record) Source #
A meta-operation to retrieve the Key EntityField.
entityDef :: Monad m => m record -> EntityDef Source #
Retrieve the EntityDef meta-data for the record.
persistFieldDef :: EntityField record typ -> FieldDef Source #
Return meta-data for a given EntityField.
toPersistFields :: record -> [SomePersistField] Source #
A meta-operation to get the database fields of a record.
fromPersistValues :: [PersistValue] -> Either Text record Source #
A lower-level operation to convert from database values to a Haskell record.
persistUniqueKeys :: record -> [Unique record] Source #
A meta operation to retrieve all the Unique keys.
persistUniqueToFieldNames :: Unique record -> [(HaskellName, DBName)] Source #
A lower level operation.
persistUniqueToValues :: Unique record -> [PersistValue] Source #
A lower level operation.
fieldLens :: EntityField record field -> forall (f :: Type -> Type). Functor f => (field -> f field) -> Entity record -> f (Entity record) Source #
Use a PersistField as a lens.
type family BackendSpecificUpdate backend record Source #
Updating a database entity.
Persistent users use combinators to create these.
Constructors
| PersistField typ => Update | |
Fields
| |
| BackendUpdate (BackendSpecificUpdate (PersistEntityBackend record) record) | |
data SelectOpt record Source #
Query options.
Persistent users use these directly.
Constructors
| Asc (EntityField record typ) | |
| Desc (EntityField record typ) | |
| OffsetBy Int | |
| LimitTo Int |
type family BackendSpecificFilter backend record Source #
Filters which are available for select, updateWhere and
deleteWhere. Each filter constructor specifies the field being
filtered on, the type of comparison applied (equals, not equals, etc)
and the argument for the comparison.
Persistent users use combinators to create these.
Note that it's important to be careful about the PersistFilter that
you are using, if you use this directly. For example, using the In
PersistFilter requires that you have an array- or list-shaped
EntityField. It is possible to construct values using this that will
create malformed runtime values.
Constructors
| PersistField typ => Filter | |
Fields
| |
| FilterAnd [Filter record] | convenient for internal use, not needed for the API |
| FilterOr [Filter record] | |
| BackendFilter (BackendSpecificFilter (PersistEntityBackend record) record) | |
data FilterValue typ where Source #
Value to filter with. Highly dependant on the type of filter used.
Since: persistent-2.10.0
Constructors
| FilterValue :: forall typ. typ -> FilterValue typ | |
| FilterValues :: forall typ. [typ] -> FilterValue typ | |
| UnsafeValue :: forall a typ. PersistField a => a -> FilterValue typ |
Datatype that represents an entity, with both its Key and
its Haskell record representation.
When using a SQL-based backend (such as SQLite or
PostgreSQL), an Entity may take any number of columns
depending on how many fields it has. In order to reconstruct
your entity on the Haskell side, persistent needs all of
your entity columns and in the right order. Note that you
don't need to worry about this when using persistent's API
since everything is handled correctly behind the scenes.
However, if you want to issue a raw SQL command that returns
an Entity, then you have to be careful with the column
order. While you could use SELECT Entity.* WHERE ... and
that would work most of the time, there are times when the
order of the columns on your database is different from the
order that persistent expects (for example, if you add a new
field in the middle of you entity definition and then use the
migration code -- persistent will expect the column to be in
the middle, but your DBMS will put it as the last column).
So, instead of using a query like the one above, you may use
rawSql (from the
Database.Persist.GenericSql module) with its /entity
selection placeholder/ (a double question mark ??). Using
rawSql the query above must be written as SELECT ?? WHERE
... Then rawSql will replace ?? with the list of all
columns that we need from your entity in the right order. If
your query returns two entities (i.e. (Entity backend a,
Entity backend b)), then you must you use SELECT ??, ??
WHERE ..., and so on.
Instances
| (Eq (Key record), Eq record) => Eq (Entity record) | |
| (Ord (Key record), Ord record) => Ord (Entity record) | |
Defined in Database.Persist.Class.PersistEntity Methods compare :: Entity record -> Entity record -> Ordering # (<) :: Entity record -> Entity record -> Bool # (<=) :: Entity record -> Entity record -> Bool # (>) :: Entity record -> Entity record -> Bool # (>=) :: Entity record -> Entity record -> Bool # | |
| (Read (Key record), Read record) => Read (Entity record) | |
Defined in Database.Persist.Class.PersistEntity | |
| (Show (Key record), Show record) => Show (Entity record) | |
| (Generic (Key record), Generic record) => Generic (Entity record) | |
| (PersistEntity record, PersistField record, PersistField (Key record)) => PersistField (Entity record) | |
Defined in Database.Persist.Class.PersistEntity Methods toPersistValue :: Entity record -> PersistValue Source # fromPersistValue :: PersistValue -> Either Text (Entity record) Source # | |
| type Rep (Entity record) | |
Defined in Database.Persist.Class.PersistEntity type Rep (Entity record) = D1 ('MetaData "Entity" "Database.Persist.Class.PersistEntity" "persistent-2.10.5.2-B3aI9buw7wl9OKysmX6tK5" 'False) (C1 ('MetaCons "Entity" 'PrefixI 'True) (S1 ('MetaSel ('Just "entityKey") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Key record)) :*: S1 ('MetaSel ('Just "entityVal") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 record))) | |
getPersistMap :: PersistValue -> Either Text [(Text, PersistValue)] Source #
FIXME Add documentation to that.
class PersistField a where Source #
This class teaches Persistent how to take a custom type and marshal it to and from a PersistValue, allowing it to be stored in a database.
Examples
Simple Newtype
You can use newtype to add more type safety/readability to a basis type like ByteString. In these cases, just derive PersistField and PersistFieldSql:
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
newtype HashedPassword = HashedPassword ByteString
deriving (Eq, Show, PersistField, PersistFieldSql)
Smart Constructor Newtype
In this example, we create a PersistField instance for a newtype following the "Smart Constructor" pattern.
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
import qualified Data.Text as T
import qualified Data.Char as C
-- | An American Social Security Number
newtype SSN = SSN Text
deriving (Eq, Show, PersistFieldSql)
mkSSN :: Text -> Either Text SSN
mkSSN t = if (T.length t == 9) && (T.all C.isDigit t)
then Right $ SSN t
else Left $ "Invalid SSN: " <> t
instance PersistField SSN where
toPersistValue (SSN t) = PersistText t
fromPersistValue (PersistText t) = mkSSN t
-- Handle cases where the database does not give us PersistText
fromPersistValue x = Left $ "File.hs: When trying to deserialize an SSN: expected PersistText, received: " <> T.pack (show x)
Tips:
- This file contain dozens of
PersistFieldinstances you can look at for examples. - Typically custom
PersistFieldinstances will only accept a singlePersistValueconstructor infromPersistValue. - Internal
PersistFieldinstances accept a wide variety ofPersistValues to accomodate e.g. storing booleans as integers, booleans or strings. - If you're making a custom instance and using a SQL database, you'll also need
PersistFieldSqlto specify the type of the database column.
Methods
toPersistValue :: a -> PersistValue Source #
fromPersistValue :: PersistValue -> Either Text a Source #
Instances
keyAndEntityFields :: EntityDef -> [FieldDef] Source #
entityKeyFields :: EntityDef -> [FieldDef] Source #
A Checkmark should be used as a field type whenever a
uniqueness constraint should guarantee that a certain kind of
record may appear at most once, but other kinds of records may
appear any number of times.
NOTE: You need to mark any Checkmark fields as nullable
(see the following example).
For example, suppose there's a Location entity that
represents where a user has lived:
Location
user UserId
name Text
current Checkmark nullable
UniqueLocation user current
The UniqueLocation constraint allows any number of
Inactive Locations to be current. However, there may be
at most one current Location per user (i.e., either zero
or one per user).
This data type works because of the way that SQL treats
NULLable fields within uniqueness constraints. The SQL
standard says that NULL values should be considered
different, so we represent Inactive as SQL NULL, thus
allowing any number of Inactive records. On the other hand,
we represent Active as TRUE, so the uniqueness constraint
will disallow more than one Active record.
Note: There may be DBMSs that do not respect the SQL
standard's treatment of NULL values on uniqueness
constraints, please check if this data type works before
relying on it.
The SQL BOOLEAN type is used because it's the smallest data
type available. Note that we never use FALSE, just TRUE
and NULL. Provides the same behavior Maybe () would if
() was a valid PersistField.
Constructors
| Active | When used on a uniqueness constraint, there
may be at most one |
| Inactive | When used on a uniqueness constraint, there
may be any number of |
Instances
data IsNullable Source #
Constructors
| Nullable !WhyNullable | |
| NotNullable |
Instances
| Eq IsNullable | |
Defined in Database.Persist.Types.Base | |
| Show IsNullable | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> IsNullable -> ShowS # show :: IsNullable -> String # showList :: [IsNullable] -> ShowS # | |
data WhyNullable Source #
The reason why a field is nullable is very important. A
field that is nullable because of a Maybe tag will have its
type changed from A to Maybe A. OTOH, a field that is
nullable because of a nullable tag will remain with the same
type.
Constructors
| ByMaybeAttr | |
| ByNullableAttr |
Instances
| Eq WhyNullable | |
Defined in Database.Persist.Types.Base | |
| Show WhyNullable | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> WhyNullable -> ShowS # show :: WhyNullable -> String # showList :: [WhyNullable] -> ShowS # | |
An EntityDef represents the information that persistent knows
about an Entity. It uses this information to generate the Haskell
datatype, the SQL migrations, and other relevant conversions.
Constructors
| EntityDef | |
Fields
| |
Instances
| Eq EntityDef | |
| Ord EntityDef | |
| Read EntityDef | |
Defined in Database.Persist.Types.Base | |
| Show EntityDef | |
newtype HaskellName Source #
Constructors
| HaskellName | |
Fields | |
Instances
| Eq HaskellName | |
Defined in Database.Persist.Types.Base | |
| Ord HaskellName | |
Defined in Database.Persist.Types.Base Methods compare :: HaskellName -> HaskellName -> Ordering # (<) :: HaskellName -> HaskellName -> Bool # (<=) :: HaskellName -> HaskellName -> Bool # (>) :: HaskellName -> HaskellName -> Bool # (>=) :: HaskellName -> HaskellName -> Bool # max :: HaskellName -> HaskellName -> HaskellName # min :: HaskellName -> HaskellName -> HaskellName # | |
| Read HaskellName | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS HaskellName readList :: ReadS [HaskellName] readPrec :: ReadPrec HaskellName readListPrec :: ReadPrec [HaskellName] | |
| Show HaskellName | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> HaskellName -> ShowS # show :: HaskellName -> String # showList :: [HaskellName] -> ShowS # | |
Constructors
| FTTypeCon (Maybe Text) Text | Optional module and name. |
| FTApp FieldType FieldType | |
| FTList FieldType |
Instances
| Eq FieldType | |
| Ord FieldType | |
| Read FieldType | |
Defined in Database.Persist.Types.Base | |
| Show FieldType | |
A FieldDef represents the inormation that persistent knows about
a field of a datatype. This includes information used to parse the field
out of the database and what the field corresponds to.
Constructors
| FieldDef | |
Fields
| |
Instances
| Eq FieldDef | |
| Ord FieldDef | |
Defined in Database.Persist.Types.Base | |
| Read FieldDef | |
Defined in Database.Persist.Types.Base | |
| Show FieldDef | |
data ReferenceDef Source #
There are 3 kinds of references 1) composite (to fields that exist in the record) 2) single field 3) embedded
Constructors
| NoReference | |
| ForeignRef !HaskellName !FieldType | A ForeignRef has a late binding to the EntityDef it references via HaskellName and has the Haskell type of the foreign key in the form of FieldType |
| EmbedRef EmbedEntityDef | |
| CompositeRef CompositeDef | |
| SelfReference | A SelfReference stops an immediate cycle which causes non-termination at compile-time (issue #311). |
Instances
| Eq ReferenceDef | |
Defined in Database.Persist.Types.Base | |
| Ord ReferenceDef | |
Defined in Database.Persist.Types.Base Methods compare :: ReferenceDef -> ReferenceDef -> Ordering # (<) :: ReferenceDef -> ReferenceDef -> Bool # (<=) :: ReferenceDef -> ReferenceDef -> Bool # (>) :: ReferenceDef -> ReferenceDef -> Bool # (>=) :: ReferenceDef -> ReferenceDef -> Bool # max :: ReferenceDef -> ReferenceDef -> ReferenceDef # min :: ReferenceDef -> ReferenceDef -> ReferenceDef # | |
| Read ReferenceDef | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS ReferenceDef readList :: ReadS [ReferenceDef] readPrec :: ReadPrec ReferenceDef readListPrec :: ReadPrec [ReferenceDef] | |
| Show ReferenceDef | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> ReferenceDef -> ShowS # show :: ReferenceDef -> String # showList :: [ReferenceDef] -> ShowS # | |
data EmbedEntityDef Source #
An EmbedEntityDef is the same as an EntityDef But it is only used for fieldReference so it only has data needed for embedding
Constructors
| EmbedEntityDef | |
Fields | |
Instances
data EmbedFieldDef Source #
An EmbedFieldDef is the same as a FieldDef But it is only used for embeddedFields so it only has data needed for embedding
Constructors
| EmbedFieldDef | |
Fields
| |
Instances
| Eq EmbedFieldDef | |
Defined in Database.Persist.Types.Base Methods (==) :: EmbedFieldDef -> EmbedFieldDef -> Bool # (/=) :: EmbedFieldDef -> EmbedFieldDef -> Bool # | |
| Ord EmbedFieldDef | |
Defined in Database.Persist.Types.Base Methods compare :: EmbedFieldDef -> EmbedFieldDef -> Ordering # (<) :: EmbedFieldDef -> EmbedFieldDef -> Bool # (<=) :: EmbedFieldDef -> EmbedFieldDef -> Bool # (>) :: EmbedFieldDef -> EmbedFieldDef -> Bool # (>=) :: EmbedFieldDef -> EmbedFieldDef -> Bool # max :: EmbedFieldDef -> EmbedFieldDef -> EmbedFieldDef # min :: EmbedFieldDef -> EmbedFieldDef -> EmbedFieldDef # | |
| Read EmbedFieldDef | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS EmbedFieldDef readList :: ReadS [EmbedFieldDef] readPrec :: ReadPrec EmbedFieldDef readListPrec :: ReadPrec [EmbedFieldDef] | |
| Show EmbedFieldDef | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> EmbedFieldDef -> ShowS # show :: EmbedFieldDef -> String # showList :: [EmbedFieldDef] -> ShowS # | |
Constructors
| UniqueDef | |
Fields
| |
Instances
| Eq UniqueDef | |
| Ord UniqueDef | |
| Read UniqueDef | |
Defined in Database.Persist.Types.Base | |
| Show UniqueDef | |
data CompositeDef Source #
Constructors
| CompositeDef | |
Fields
| |
Instances
| Eq CompositeDef | |
Defined in Database.Persist.Types.Base | |
| Ord CompositeDef | |
Defined in Database.Persist.Types.Base Methods compare :: CompositeDef -> CompositeDef -> Ordering # (<) :: CompositeDef -> CompositeDef -> Bool # (<=) :: CompositeDef -> CompositeDef -> Bool # (>) :: CompositeDef -> CompositeDef -> Bool # (>=) :: CompositeDef -> CompositeDef -> Bool # max :: CompositeDef -> CompositeDef -> CompositeDef # min :: CompositeDef -> CompositeDef -> CompositeDef # | |
| Read CompositeDef | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS CompositeDef readList :: ReadS [CompositeDef] readPrec :: ReadPrec CompositeDef readListPrec :: ReadPrec [CompositeDef] | |
| Show CompositeDef | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> CompositeDef -> ShowS # show :: CompositeDef -> String # showList :: [CompositeDef] -> ShowS # | |
type ForeignFieldDef = (HaskellName, DBName) Source #
Used instead of FieldDef to generate a smaller amount of code
data ForeignDef Source #
Constructors
| ForeignDef | |
Fields | |
Instances
| Eq ForeignDef | |
Defined in Database.Persist.Types.Base | |
| Ord ForeignDef | |
Defined in Database.Persist.Types.Base Methods compare :: ForeignDef -> ForeignDef -> Ordering # (<) :: ForeignDef -> ForeignDef -> Bool # (<=) :: ForeignDef -> ForeignDef -> Bool # (>) :: ForeignDef -> ForeignDef -> Bool # (>=) :: ForeignDef -> ForeignDef -> Bool # max :: ForeignDef -> ForeignDef -> ForeignDef # min :: ForeignDef -> ForeignDef -> ForeignDef # | |
| Read ForeignDef | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS ForeignDef readList :: ReadS [ForeignDef] readPrec :: ReadPrec ForeignDef readListPrec :: ReadPrec [ForeignDef] | |
| Show ForeignDef | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> ForeignDef -> ShowS # show :: ForeignDef -> String # showList :: [ForeignDef] -> ShowS # | |
data PersistException Source #
Constructors
| PersistError Text | Generic Exception |
| PersistMarshalError Text | |
| PersistInvalidField Text | |
| PersistForeignConstraintUnmet Text | |
| PersistMongoDBError Text | |
| PersistMongoDBUnsupported Text |
Instances
| Show PersistException | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> PersistException -> ShowS # show :: PersistException -> String # showList :: [PersistException] -> ShowS # | |
| Exception PersistException | |
Defined in Database.Persist.Types.Base Methods toException :: PersistException -> SomeException # | |
| Error PersistException | |
Defined in Database.Persist.Types.Base | |
data PersistValue Source #
A raw value which can be stored in any backend and can be marshalled to
and from a PersistField.
Constructors
| PersistText Text | |
| PersistByteString ByteString | |
| PersistInt64 Int64 | |
| PersistDouble Double | |
| PersistRational Rational | |
| PersistBool Bool | |
| PersistDay Day | |
| PersistTimeOfDay TimeOfDay | |
| PersistUTCTime UTCTime | |
| PersistNull | |
| PersistList [PersistValue] | |
| PersistMap [(Text, PersistValue)] | |
| PersistObjectId ByteString | Intended especially for MongoDB backend |
| PersistArray [PersistValue] | Intended especially for PostgreSQL backend for text arrays |
| PersistDbSpecific ByteString | Using data Geo = Geo ByteString
instance PersistField Geo where
toPersistValue (Geo t) = PersistDbSpecific t
fromPersistValue (PersistDbSpecific t) = Right $ Geo $ Data.ByteString.concat ["'", t, "'"]
fromPersistValue _ = Left "Geo values must be converted from PersistDbSpecific"
instance PersistFieldSql Geo where
sqlType _ = SqlOther "GEOGRAPHY(POINT,4326)"
toPoint :: Double -> Double -> Geo
toPoint lat lon = Geo $ Data.ByteString.concat ["'POINT(", ps $ lon, " ", ps $ lat, ")'"]
where ps = Data.Text.pack . show
If Foo has a geography field, we can then perform insertions like the following: insert $ Foo (toPoint 44 44) |
Instances
A SQL data type. Naming attempts to reflect the underlying Haskell datatypes, eg SqlString instead of SqlVarchar. Different SQL databases may have different translations for these types.
Constructors
| SqlString | |
| SqlInt32 | |
| SqlInt64 | |
| SqlReal | |
| SqlNumeric Word32 Word32 | |
| SqlBool | |
| SqlDay | |
| SqlTime | |
| SqlDayTime | Always uses UTC timezone |
| SqlBlob | |
| SqlOther Text | a backend-specific name |
Instances
| Eq SqlType | |
| Ord SqlType | |
Defined in Database.Persist.Types.Base | |
| Read SqlType | |
Defined in Database.Persist.Types.Base | |
| Show SqlType | |
data PersistFilter Source #
Instances
| Read PersistFilter | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS PersistFilter readList :: ReadS [PersistFilter] readPrec :: ReadPrec PersistFilter readListPrec :: ReadPrec [PersistFilter] | |
| Show PersistFilter | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> PersistFilter -> ShowS # show :: PersistFilter -> String # showList :: [PersistFilter] -> ShowS # | |
data UpdateException Source #
Constructors
| KeyNotFound String | |
| UpsertError String |
Instances
| Show UpdateException | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> UpdateException -> ShowS # show :: UpdateException -> String # showList :: [UpdateException] -> ShowS # | |
| Exception UpdateException | |
Defined in Database.Persist.Types.Base Methods toException :: UpdateException -> SomeException # | |
data OnlyUniqueException Source #
Constructors
| OnlyUniqueException String |
Instances
| Show OnlyUniqueException | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> OnlyUniqueException -> ShowS # show :: OnlyUniqueException -> String # showList :: [OnlyUniqueException] -> ShowS # | |
| Exception OnlyUniqueException | |
Defined in Database.Persist.Types.Base Methods toException :: OnlyUniqueException -> SomeException # fromException :: SomeException -> Maybe OnlyUniqueException # | |
data PersistUpdate Source #
Instances
| Read PersistUpdate | |
Defined in Database.Persist.Types.Base Methods readsPrec :: Int -> ReadS PersistUpdate readList :: ReadS [PersistUpdate] readPrec :: ReadPrec PersistUpdate readListPrec :: ReadPrec [PersistUpdate] | |
| Show PersistUpdate | |
Defined in Database.Persist.Types.Base Methods showsPrec :: Int -> PersistUpdate -> ShowS # show :: PersistUpdate -> String # showList :: [PersistUpdate] -> ShowS # | |
type family PersistConfigPool c Source #
Instances
| type PersistConfigPool (Either c1 c2) | |
Defined in Database.Persist.Class.PersistConfig | |
type family PersistConfigBackend c :: (Type -> Type) -> Type -> Type Source #
Instances
| type PersistConfigBackend (Either c1 c2) | |
Defined in Database.Persist.Class.PersistConfig | |
class PersistConfig c where Source #
Represents a value containing all the configuration options for a specific backend. This abstraction makes it easier to write code that can easily swap backends.
Minimal complete definition
Associated Types
type PersistConfigBackend c :: (Type -> Type) -> Type -> Type Source #
type PersistConfigPool c Source #
Methods
loadConfig :: Value -> Parser c Source #
Load the config settings from a Value, most likely taken from a YAML
config file.
applyEnv :: c -> IO c Source #
Modify the config settings based on environment variables.
createPoolConfig :: c -> IO (PersistConfigPool c) Source #
Create a new connection pool based on the given config settings.
runPool :: MonadUnliftIO m => c -> PersistConfigBackend c m a -> PersistConfigPool c -> m a Source #
Run a database action by taking a connection from the pool.
Instances
| (PersistConfig c1, PersistConfig c2, PersistConfigPool c1 ~ PersistConfigPool c2, PersistConfigBackend c1 ~ PersistConfigBackend c2) => PersistConfig (Either c1 c2) | |
Defined in Database.Persist.Class.PersistConfig Associated Types type PersistConfigBackend (Either c1 c2) :: (Type -> Type) -> Type -> Type Source # type PersistConfigPool (Either c1 c2) Source # Methods loadConfig :: Value -> Parser (Either c1 c2) Source # applyEnv :: Either c1 c2 -> IO (Either c1 c2) Source # createPoolConfig :: Either c1 c2 -> IO (PersistConfigPool (Either c1 c2)) Source # runPool :: MonadUnliftIO m => Either c1 c2 -> PersistConfigBackend (Either c1 c2) m a -> PersistConfigPool (Either c1 c2) -> m a Source # | |
Constructors
| DBRunner | |
Fields
| |
class YesodPersist site => YesodPersistRunner site where #
Methods
getDBRunner :: HandlerFor site (DBRunner site, HandlerFor site ()) #
class Monad (YesodDB site) => YesodPersist site where #
Associated Types
type YesodPersistBackend site #
Methods
runDB :: YesodDB site a -> HandlerFor site a #
type family YesodPersistBackend site #
type YesodDB site = ReaderT (YesodPersistBackend site) (HandlerFor site) #
defaultRunDB :: PersistConfig c => (site -> c) -> (site -> PersistConfigPool c) -> PersistConfigBackend c (HandlerFor site) a -> HandlerFor site a #
defaultGetDBRunner :: (IsSqlBackend backend, YesodPersistBackend site ~ backend) => (site -> Pool backend) -> HandlerFor site (DBRunner site, HandlerFor site ()) #
runDBSource :: YesodPersistRunner site => ConduitT () a (YesodDB site) () -> ConduitT () a (HandlerFor site) () #
respondSourceDB :: YesodPersistRunner site => ContentType -> ConduitT () (Flush Builder) (YesodDB site) () -> HandlerFor site TypedContent #
get404 :: forall (m :: Type -> Type) backend val. (MonadIO m, PersistStoreRead backend, PersistRecordBackend val backend) => Key val -> ReaderT backend m val #
getBy404 :: forall backend val (m :: Type -> Type). (PersistUniqueRead backend, PersistRecordBackend val backend, MonadIO m) => Unique val -> ReaderT backend m (Entity val) #
insert400 :: forall (m :: Type -> Type) backend val. (MonadIO m, PersistUniqueWrite backend, PersistRecordBackend val backend) => val -> ReaderT backend m (Key val) #
insert400_ :: forall (m :: Type -> Type) backend val. (MonadIO m, PersistUniqueWrite backend, PersistRecordBackend val backend) => val -> ReaderT backend m () #
derivePersistFieldJSON :: String -> Q [Dec] #
derivePersistField :: String -> Q [Dec] #
mkEntityDefList :: String -> [EntityDef] -> Q [Dec] #
mkDeleteCascade :: MkPersistSettings -> [EntityDef] -> Q [Dec] #
persistFieldFromEntity :: MkPersistSettings -> EntityDef -> Q [Dec] #
mkPersistSettings :: Type -> MkPersistSettings #
mkPersist :: MkPersistSettings -> [EntityDef] -> Q [Dec] #
parseReferences :: PersistSettings -> Text -> Q Exp #
embedEntityDefs :: [EntityDef] -> [EntityDef] #
persistManyFileWith :: PersistSettings -> [FilePath] -> Q Exp #
persistFileWith :: PersistSettings -> FilePath -> Q Exp #
persistLowerCase :: QuasiQuoter #
persistUpperCase :: QuasiQuoter #
persistWith :: PersistSettings -> QuasiQuoter #
data MkPersistSettings #
data EntityJSON #
Constructors
| EntityJSON | |
Fields
| |
data FormMessage #
Constructors
Instances
| Eq FormMessage | |
Defined in Yesod.Form.Types | |
| Read FormMessage | |
Defined in Yesod.Form.Types Methods readsPrec :: Int -> ReadS FormMessage readList :: ReadS [FormMessage] readPrec :: ReadPrec FormMessage readListPrec :: ReadPrec [FormMessage] | |
| Show FormMessage | |
Defined in Yesod.Form.Types Methods showsPrec :: Int -> FormMessage -> ShowS # show :: FormMessage -> String # showList :: [FormMessage] -> ShowS # | |
data Field (m :: Type -> Type) a #
Constructors
| Field | |
Fields
| |
type FieldViewFunc (m :: Type -> Type) a = Text -> Text -> [(Text, Text)] -> Either Text a -> Bool -> WidgetFor (HandlerSite m) () #
data FieldSettings master #
Constructors
| FieldSettings | |
Instances
| IsString (FieldSettings a) | |
Defined in Yesod.Form.Types Methods fromString :: String -> FieldSettings a # | |
newtype AForm (m :: Type -> Type) a #
Constructors
| AForm | |
Fields
| |
type MForm (m :: Type -> Type) a = RWST (Maybe (Env, FileEnv), HandlerSite m, [Lang]) Enctype Ints m a #
type WForm (m :: Type -> Type) a = MForm (WriterT [FieldView (HandlerSite m)] m) a #
Constructors
| UrlEncoded | |
| Multipart |
Instances
| Bounded Enctype | |
| Enum Enctype | |
| Eq Enctype | |
| Semigroup Enctype | |
| Monoid Enctype | |
| ToMarkup Enctype | |
Defined in Yesod.Form.Types | |
| ToValue Enctype | |
Defined in Yesod.Form.Types | |
data FormResult a #
Constructors
| FormMissing | |
| FormFailure [Text] | |
| FormSuccess a |
Instances
newtype FormInput (m :: Type -> Type) a #
Constructors
| FormInput | |
Fields
| |
Instances
| Monad m => Functor (FormInput m) | |
| Monad m => Applicative (FormInput m) | |
Defined in Yesod.Form.Input | |
ireq :: forall (m :: Type -> Type) a. (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m a -> Text -> FormInput m a #
runInputGet :: MonadHandler m => FormInput m a -> m a #
runInputGetResult :: MonadHandler m => FormInput m a -> m (FormResult a) #
runInputPost :: MonadHandler m => FormInput m a -> m a #
runInputPostResult :: MonadHandler m => FormInput m a -> m (FormResult a) #
type FormRender (m :: Type -> Type) a = AForm m a -> Markup -> MForm m (FormResult a, WidgetFor (HandlerSite m) ()) #
newFormIdent :: forall (m :: Type -> Type). Monad m => MForm m Text #
formToAForm :: forall (m :: Type -> Type) site a. (HandlerSite m ~ site, Monad m) => MForm m (FormResult a, [FieldView site]) -> AForm m a #
aFormToForm :: forall (m :: Type -> Type) site a. (Monad m, HandlerSite m ~ site) => AForm m a -> MForm m (FormResult a, [FieldView site] -> [FieldView site]) #
wreq :: forall site (m :: Type -> Type) a. (RenderMessage site FormMessage, HandlerSite m ~ site, MonadHandler m) => Field m a -> FieldSettings site -> Maybe a -> WForm m (FormResult a) #
wreqMsg :: forall site msg (m :: Type -> Type) a. (RenderMessage site msg, HandlerSite m ~ site, MonadHandler m) => Field m a -> FieldSettings site -> msg -> Maybe a -> WForm m (FormResult a) #
wopt :: forall (m :: Type -> Type) site a. (MonadHandler m, HandlerSite m ~ site) => Field m a -> FieldSettings site -> Maybe (Maybe a) -> WForm m (FormResult (Maybe a)) #
wFormToAForm :: forall (m :: Type -> Type) a. MonadHandler m => WForm m (FormResult a) -> AForm m a #
wFormToMForm :: forall (m :: Type -> Type) site a. (MonadHandler m, HandlerSite m ~ site) => WForm m a -> MForm m (a, [FieldView site]) #
mFormToWForm :: forall (m :: Type -> Type) site a. (MonadHandler m, HandlerSite m ~ site) => MForm m (a, FieldView site) -> WForm m a #
mreq :: forall site (m :: Type -> Type) a. (RenderMessage site FormMessage, HandlerSite m ~ site, MonadHandler m) => Field m a -> FieldSettings site -> Maybe a -> MForm m (FormResult a, FieldView site) #
mreqMsg :: forall site msg (m :: Type -> Type) a. (RenderMessage site msg, HandlerSite m ~ site, MonadHandler m) => Field m a -> FieldSettings site -> msg -> Maybe a -> MForm m (FormResult a, FieldView site) #
mopt :: forall site (m :: Type -> Type) a. (site ~ HandlerSite m, MonadHandler m) => Field m a -> FieldSettings site -> Maybe (Maybe a) -> MForm m (FormResult (Maybe a), FieldView site) #
areq :: forall site (m :: Type -> Type) a. (RenderMessage site FormMessage, HandlerSite m ~ site, MonadHandler m) => Field m a -> FieldSettings site -> Maybe a -> AForm m a #
areqMsg :: forall site msg (m :: Type -> Type) a. (RenderMessage site msg, HandlerSite m ~ site, MonadHandler m) => Field m a -> FieldSettings site -> msg -> Maybe a -> AForm m a #
aopt :: forall (m :: Type -> Type) a. MonadHandler m => Field m a -> FieldSettings (HandlerSite m) -> Maybe (Maybe a) -> AForm m (Maybe a) #
runFormPost :: (RenderMessage (HandlerSite m) FormMessage, MonadResource m, MonadHandler m) => (Markup -> MForm m (FormResult a, xml)) -> m ((FormResult a, xml), Enctype) #
generateFormPost :: (RenderMessage (HandlerSite m) FormMessage, MonadHandler m) => (Markup -> MForm m (FormResult a, xml)) -> m (xml, Enctype) #
runFormPostNoToken :: MonadHandler m => (Markup -> MForm m a) -> m (a, Enctype) #
runFormGet :: MonadHandler m => (Markup -> MForm m a) -> m (a, Enctype) #
generateFormGet' :: MonadHandler m => (Markup -> MForm m (FormResult a, xml)) -> m (xml, Enctype) #
generateFormGet :: MonadHandler m => (Markup -> MForm m a) -> m (a, Enctype) #
identifyForm :: forall (m :: Type -> Type) a. Monad m => Text -> (Markup -> MForm m (FormResult a, WidgetFor (HandlerSite m) ())) -> Markup -> MForm m (FormResult a, WidgetFor (HandlerSite m) ()) #
renderTable :: forall (m :: Type -> Type) a. Monad m => FormRender m a #
renderDivs :: forall (m :: Type -> Type) a. Monad m => FormRender m a #
renderDivsNoLabels :: forall (m :: Type -> Type) a. Monad m => FormRender m a #
renderBootstrap2 :: forall (m :: Type -> Type) a. Monad m => FormRender m a #
renderBootstrap :: forall (m :: Type -> Type) a. Monad m => FormRender m a #
check :: forall (m :: Type -> Type) msg a. (Monad m, RenderMessage (HandlerSite m) msg) => (a -> Either msg a) -> Field m a -> Field m a #
checkBool :: forall (m :: Type -> Type) msg a. (Monad m, RenderMessage (HandlerSite m) msg) => (a -> Bool) -> msg -> Field m a -> Field m a #
checkM :: (Monad m, RenderMessage (HandlerSite m) msg) => (a -> m (Either msg a)) -> Field m a -> Field m a #
checkMMap :: (Monad m, RenderMessage (HandlerSite m) msg) => (a -> m (Either msg b)) -> (b -> a) -> Field m a -> Field m b #
customErrorMessage :: forall (m :: Type -> Type) a. Monad m => SomeMessage (HandlerSite m) -> Field m a -> Field m a #
fieldSettingsLabel :: RenderMessage site msg => msg -> FieldSettings site #
parseHelper :: (Monad m, RenderMessage site FormMessage) => (Text -> Either FormMessage a) -> [Text] -> [FileInfo] -> m (Either (SomeMessage site) (Maybe a)) #
parseHelperGen :: (Monad m, RenderMessage site msg) => (Text -> Either msg a) -> [Text] -> [FileInfo] -> m (Either (SomeMessage site) (Maybe a)) #
convertField :: forall (m :: Type -> Type) a b. Functor m => (a -> b) -> (b -> a) -> Field m a -> Field m b #
Constructors
| Option | |
Fields
| |
data OptionList a #
Constructors
| OptionList | |
Fields
| |
Instances
| Functor OptionList | |
Defined in Yesod.Form.Fields Methods fmap :: (a -> b) -> OptionList a -> OptionList b # (<$) :: a -> OptionList b -> OptionList a # | |
Constructors
| Textarea | |
Fields
| |
Instances
| Eq Textarea | |
| Ord Textarea | |
Defined in Yesod.Form.Fields | |
| Read Textarea | |
Defined in Yesod.Form.Fields | |
| Show Textarea | |
| IsString Textarea | |
Defined in Yesod.Form.Fields Methods fromString :: String -> Textarea # | |
| ToJSON Textarea | |
| FromJSON Textarea | |
| PersistFieldSql Textarea | |
| PersistField Textarea | |
Defined in Yesod.Form.Fields Methods toPersistValue :: Textarea -> PersistValue Source # fromPersistValue :: PersistValue -> Either Text Textarea Source # | |
| ToMarkup Textarea | |
Defined in Yesod.Form.Fields | |
defaultFormMessage :: FormMessage -> Text #
intField :: forall (m :: Type -> Type) i. (Monad m, Integral i, RenderMessage (HandlerSite m) FormMessage) => Field m i #
doubleField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Double #
dayField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Day #
timeField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m TimeOfDay #
timeFieldTypeTime :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m TimeOfDay #
timeFieldTypeText :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m TimeOfDay #
htmlField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Html #
textareaField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Textarea #
:: forall (m :: Type -> Type) p. (Monad m, PathPiece p, RenderMessage (HandlerSite m) FormMessage) => Field m p #
textField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Text #
passwordField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Text #
emailField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Text #
multiEmailField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m [Text] #
searchField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => AutoFocus -> Field m Text #
urlField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Text #
selectFieldList :: (Eq a, RenderMessage site FormMessage, RenderMessage site msg) => [(msg, a)] -> Field (HandlerFor site) a #
selectField :: (Eq a, RenderMessage site FormMessage) => HandlerFor site (OptionList a) -> Field (HandlerFor site) a #
multiSelectFieldList :: (Eq a, RenderMessage site msg) => [(msg, a)] -> Field (HandlerFor site) [a] #
multiSelectField :: Eq a => HandlerFor site (OptionList a) -> Field (HandlerFor site) [a] #
radioFieldList :: (Eq a, RenderMessage site FormMessage, RenderMessage site msg) => [(msg, a)] -> Field (HandlerFor site) a #
checkboxesFieldList :: (Eq a, RenderMessage site msg) => [(msg, a)] -> Field (HandlerFor site) [a] #
checkboxesField :: Eq a => HandlerFor site (OptionList a) -> Field (HandlerFor site) [a] #
radioField :: (Eq a, RenderMessage site FormMessage) => HandlerFor site (OptionList a) -> Field (HandlerFor site) a #
boolField :: forall (m :: Type -> Type). (Monad m, RenderMessage (HandlerSite m) FormMessage) => Field m Bool #
checkBoxField :: forall (m :: Type -> Type). Monad m => Field m Bool #
mkOptionList :: [Option a] -> OptionList a #
optionsPairs :: (MonadHandler m, RenderMessage (HandlerSite m) msg) => [(msg, a)] -> m (OptionList a) #
optionsEnum :: (MonadHandler m, Show a, Enum a, Bounded a) => m (OptionList a) #
optionsPersist :: (YesodPersist site, PersistQueryRead backend, PathPiece (Key a), RenderMessage site msg, YesodPersistBackend site ~ backend, PersistRecordBackend a backend) => [Filter a] -> [SelectOpt a] -> (a -> msg) -> HandlerFor site (OptionList (Entity a)) #
optionsPersistKey :: (YesodPersist site, PersistQueryRead backend, PathPiece (Key a), RenderMessage site msg, backend ~ YesodPersistBackend site, PersistRecordBackend a backend) => [Filter a] -> [SelectOpt a] -> (a -> msg) -> HandlerFor site (OptionList (Key a)) #
selectFieldHelper :: (Eq a, RenderMessage site FormMessage) => (Text -> Text -> [(Text, Text)] -> WidgetFor site () -> WidgetFor site ()) -> (Text -> Text -> Bool -> WidgetFor site ()) -> (Text -> Text -> [(Text, Text)] -> Text -> Bool -> Text -> WidgetFor site ()) -> HandlerFor site (OptionList a) -> Field (HandlerFor site) a #
fileAFormReq :: forall (m :: Type -> Type). (MonadHandler m, RenderMessage (HandlerSite m) FormMessage) => FieldSettings (HandlerSite m) -> AForm m FileInfo #
fileAFormOpt :: forall (m :: Type -> Type). MonadHandler m => FieldSettings (HandlerSite m) -> AForm m (Maybe FileInfo) #
Instances
| PathPiece Bool | |
Defined in Web.PathPieces | |
| PathPiece Int | |
Defined in Web.PathPieces | |
| PathPiece Int8 | |
Defined in Web.PathPieces | |
| PathPiece Int16 | |
Defined in Web.PathPieces | |
| PathPiece Int32 | |
Defined in Web.PathPieces | |
| PathPiece Int64 | |
Defined in Web.PathPieces | |
| PathPiece Integer | |
Defined in Web.PathPieces | |
| PathPiece Word | |
Defined in Web.PathPieces | |
| PathPiece Word8 | |
Defined in Web.PathPieces | |
| PathPiece Word16 | |
Defined in Web.PathPieces | |
| PathPiece Word32 | |
Defined in Web.PathPieces | |
| PathPiece Word64 | |
Defined in Web.PathPieces | |
| PathPiece () | |
Defined in Web.PathPieces | |
| PathPiece String | |
Defined in Web.PathPieces | |
| PathPiece Text | |
Defined in Web.PathPieces | |
| PathPiece Day | |
Defined in Web.PathPieces | |
| PathPiece Checkmark | |
Defined in Database.Persist.Types.Base | |
| PathPiece PersistValue | |
Defined in Database.Persist.Types.Base | |
| PathPiece Text | |
Defined in Web.PathPieces | |
| PathPiece a => PathPiece (Maybe a) | |
Defined in Web.PathPieces | |
class PathMultiPiece s where #
Instances
| PathPiece a => PathMultiPiece [a] | |
Defined in Web.PathPieces | |
formatRFC1123 :: UTCTime -> Text #
formatRFC822 :: UTCTime -> Text #
class RenderRoute a => RouteAttrs a where #
Methods
routeAttrs :: Route a -> Set Text #
class RenderRoute a => ParseRoute a where #
Instances
| ParseRoute WaiSubsiteWithAuth | |
Defined in Yesod.Core.Types Methods parseRoute :: ([Text], [(Text, Text)]) -> Maybe (Route WaiSubsiteWithAuth) # | |
| ParseRoute WaiSubsite | |
Defined in Yesod.Core.Types Methods parseRoute :: ([Text], [(Text, Text)]) -> Maybe (Route WaiSubsite) # | |
| ParseRoute LiteApp | |
Defined in Yesod.Core.Internal.LiteApp | |
| ParseRoute Static | |
Defined in Yesod.Static | |
class Eq (Route a) => RenderRoute a where #
Instances
| RenderRoute WaiSubsiteWithAuth | |
Defined in Yesod.Core.Types Associated Types data Route WaiSubsiteWithAuth # Methods renderRoute :: Route WaiSubsiteWithAuth -> ([Text], [(Text, Text)]) # | |
| RenderRoute WaiSubsite | |
Defined in Yesod.Core.Types Associated Types data Route WaiSubsite # Methods renderRoute :: Route WaiSubsite -> ([Text], [(Text, Text)]) # | |
| RenderRoute LiteApp | |
| RenderRoute Static | |
Instances
data SubHandlerFor sub master a #
Instances
| Monad (SubHandlerFor child master) | |
Defined in Yesod.Core.Types Methods (>>=) :: SubHandlerFor child master a -> (a -> SubHandlerFor child master b) -> SubHandlerFor child master b # (>>) :: SubHandlerFor child master a -> SubHandlerFor child master b -> SubHandlerFor child master b # return :: a -> SubHandlerFor child master a # | |
| Functor (SubHandlerFor sub master) | |
Defined in Yesod.Core.Types Methods fmap :: (a -> b) -> SubHandlerFor sub master a -> SubHandlerFor sub master b # (<$) :: a -> SubHandlerFor sub master b -> SubHandlerFor sub master a # | |
| Applicative (SubHandlerFor child master) | |
Defined in Yesod.Core.Types Methods pure :: a -> SubHandlerFor child master a # (<*>) :: SubHandlerFor child master (a -> b) -> SubHandlerFor child master a -> SubHandlerFor child master b # liftA2 :: (a -> b -> c) -> SubHandlerFor child master a -> SubHandlerFor child master b -> SubHandlerFor child master c # (*>) :: SubHandlerFor child master a -> SubHandlerFor child master b -> SubHandlerFor child master b # (<*) :: SubHandlerFor child master a -> SubHandlerFor child master b -> SubHandlerFor child master a # | |
| MonadUnliftIO (SubHandlerFor child master) | |
Defined in Yesod.Core.Types Methods askUnliftIO :: SubHandlerFor child master (UnliftIO (SubHandlerFor child master)) # withRunInIO :: ((forall a. SubHandlerFor child master a -> IO a) -> IO b) -> SubHandlerFor child master b # | |
| MonadIO (SubHandlerFor child master) | |
Defined in Yesod.Core.Types Methods liftIO :: IO a -> SubHandlerFor child master a # | |
| MonadThrow (SubHandlerFor child master) | |
Defined in Yesod.Core.Types Methods throwM :: Exception e => e -> SubHandlerFor child master a | |
| MonadResource (SubHandlerFor child master) | |
Defined in Yesod.Core.Types Methods liftResourceT :: ResourceT IO a -> SubHandlerFor child master a # | |
| MonadHandler (SubHandlerFor sub master) | |
Defined in Yesod.Core.Class.Handler Associated Types type HandlerSite (SubHandlerFor sub master) # type SubHandlerSite (SubHandlerFor sub master) # Methods liftHandler :: HandlerFor (HandlerSite (SubHandlerFor sub master)) a -> SubHandlerFor sub master a # liftSubHandler :: SubHandlerFor (SubHandlerSite (SubHandlerFor sub master)) (HandlerSite (SubHandlerFor sub master)) a -> SubHandlerFor sub master a # | |
| MonadLogger (SubHandlerFor child master) | |
Defined in Yesod.Core.Types Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> SubHandlerFor child master () | |
| MonadLoggerIO (SubHandlerFor child master) | |
Defined in Yesod.Core.Types Methods askLoggerIO :: SubHandlerFor child master (Loc -> LogSource -> LogLevel -> LogStr -> IO ()) | |
| MonadReader (HandlerData child master) (SubHandlerFor child master) | |
Defined in Yesod.Core.Types Methods ask :: SubHandlerFor child master (HandlerData child master) # local :: (HandlerData child master -> HandlerData child master) -> SubHandlerFor child master a -> SubHandlerFor child master a reader :: (HandlerData child master -> a) -> SubHandlerFor child master a | |
| type HandlerSite (SubHandlerFor sub master) | |
Defined in Yesod.Core.Class.Handler | |
| type SubHandlerSite (SubHandlerFor sub master) | |
Defined in Yesod.Core.Class.Handler | |
pattern DeleteCookie :: !ByteString -> !ByteString -> Header #
data ErrorResponse #
Constructors
| NotFound | |
| InternalError !Text | |
| InvalidArgs ![Text] | |
| NotAuthenticated | |
| PermissionDenied !Text | |
| BadMethod !Method |
Instances
| Eq ErrorResponse | |
Defined in Yesod.Core.Types Methods (==) :: ErrorResponse -> ErrorResponse -> Bool # (/=) :: ErrorResponse -> ErrorResponse -> Bool # | |
| Show ErrorResponse | |
Defined in Yesod.Core.Types Methods showsPrec :: Int -> ErrorResponse -> ShowS # show :: ErrorResponse -> String # showList :: [ErrorResponse] -> ShowS # | |
| Generic ErrorResponse | |
Defined in Yesod.Core.Types Associated Types type Rep ErrorResponse :: Type -> Type | |
| NFData ErrorResponse | |
Defined in Yesod.Core.Types Methods rnf :: ErrorResponse -> () # | |
| type Rep ErrorResponse | |
Defined in Yesod.Core.Types type Rep ErrorResponse = D1 ('MetaData "ErrorResponse" "Yesod.Core.Types" "yesod-core-1.6.18-891P6IXfcLgLuPmk8mRVs1" 'False) ((C1 ('MetaCons "NotFound" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "InternalError" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Text)) :+: C1 ('MetaCons "InvalidArgs" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 [Text])))) :+: (C1 ('MetaCons "NotAuthenticated" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PermissionDenied" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Text)) :+: C1 ('MetaCons "BadMethod" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Method))))) | |
newtype DontFullyEvaluate a #
Constructors
| DontFullyEvaluate | |
Fields
| |
Instances
| ToTypedContent a => ToTypedContent (DontFullyEvaluate a) | |
Defined in Yesod.Core.Content Methods toTypedContent :: DontFullyEvaluate a -> TypedContent # | |
| HasContentType a => HasContentType (DontFullyEvaluate a) | |
Defined in Yesod.Core.Content Methods getContentType :: Monad m => m (DontFullyEvaluate a) -> ContentType # | |
| ToContent a => ToContent (DontFullyEvaluate a) | |
Defined in Yesod.Core.Content Methods toContent :: DontFullyEvaluate a -> Content # | |
type ContentType = ByteString #
Instances
| ToTypedContent RepXml | |
Defined in Yesod.Core.Content Methods toTypedContent :: RepXml -> TypedContent # | |
| HasContentType RepXml | |
Defined in Yesod.Core.Content Methods getContentType :: Monad m => m RepXml -> ContentType # | |
| ToContent RepXml | |
Defined in Yesod.Core.Content | |
Instances
| ToTypedContent RepPlain | |
Defined in Yesod.Core.Content Methods toTypedContent :: RepPlain -> TypedContent # | |
| HasContentType RepPlain | |
Defined in Yesod.Core.Content Methods getContentType :: Monad m => m RepPlain -> ContentType # | |
| ToContent RepPlain | |
Defined in Yesod.Core.Content | |
Instances
| ToTypedContent RepJson | |
Defined in Yesod.Core.Content Methods toTypedContent :: RepJson -> TypedContent # | |
| HasContentType RepJson | |
Defined in Yesod.Core.Content Methods getContentType :: Monad m => m RepJson -> ContentType # | |
| ToContent RepJson | |
Defined in Yesod.Core.Content | |
data TypedContent #
Constructors
| TypedContent !ContentType !Content |
Instances
| ToTypedContent TypedContent | |
Defined in Yesod.Core.Content Methods | |
| ToContent TypedContent | |
Defined in Yesod.Core.Content Methods toContent :: TypedContent -> Content # | |
Constructors
| ContentBuilder !Builder !(Maybe Int) | |
| ContentSource !(ConduitT () (Flush Builder) (ResourceT IO) ()) | |
| ContentFile !FilePath !(Maybe FilePart) | |
| ContentDontEvaluate !Content |
Instances
| IsString Content | |
Defined in Yesod.Core.Types Methods fromString :: String -> Content # | |
| ToContent Content | |
Defined in Yesod.Core.Content | |
| ToTypedContent (ContentType, Content) | |
Defined in Yesod.Core.Content Methods toTypedContent :: (ContentType, Content) -> TypedContent # | |
| ToContent (ContentType, Content) | |
Defined in Yesod.Core.Content Methods toContent :: (ContentType, Content) -> Content # | |
data PageContent url #
newtype CssBuilder #
Constructors
| CssBuilder | |
Fields
| |
Instances
| ToWidgetHead site CssBuilder | |
Defined in Yesod.Core.Widget Methods toWidgetHead :: (MonadWidget m, HandlerSite m ~ site) => CssBuilder -> m () # | |
| ToWidgetMedia site CssBuilder | |
Defined in Yesod.Core.Widget Methods toWidgetMedia :: (MonadWidget m, HandlerSite m ~ site) => Text -> CssBuilder -> m () # | |
| ToWidget site CssBuilder | |
Defined in Yesod.Core.Widget Methods toWidget :: (MonadWidget m, HandlerSite m ~ site) => CssBuilder -> m () # | |
| render ~ RY site => ToWidgetHead site (render -> CssBuilder) | |
Defined in Yesod.Core.Widget Methods toWidgetHead :: (MonadWidget m, HandlerSite m ~ site) => (render -> CssBuilder) -> m () # | |
| render ~ RY site => ToWidgetMedia site (render -> CssBuilder) | |
Defined in Yesod.Core.Widget Methods toWidgetMedia :: (MonadWidget m, HandlerSite m ~ site) => Text -> (render -> CssBuilder) -> m () # | |
| render ~ RY site => ToWidget site (render -> CssBuilder) | |
Defined in Yesod.Core.Widget Methods toWidget :: (MonadWidget m, HandlerSite m ~ site) => (render -> CssBuilder) -> m () # | |
Instances
data HandlerFor site a #
Instances
| Monad (HandlerFor site) | |
Defined in Yesod.Core.Types Methods (>>=) :: HandlerFor site a -> (a -> HandlerFor site b) -> HandlerFor site b # (>>) :: HandlerFor site a -> HandlerFor site b -> HandlerFor site b # return :: a -> HandlerFor site a # | |
| Functor (HandlerFor site) | |
Defined in Yesod.Core.Types Methods fmap :: (a -> b) -> HandlerFor site a -> HandlerFor site b # (<$) :: a -> HandlerFor site b -> HandlerFor site a # | |
| Applicative (HandlerFor site) | |
Defined in Yesod.Core.Types Methods pure :: a -> HandlerFor site a # (<*>) :: HandlerFor site (a -> b) -> HandlerFor site a -> HandlerFor site b # liftA2 :: (a -> b -> c) -> HandlerFor site a -> HandlerFor site b -> HandlerFor site c # (*>) :: HandlerFor site a -> HandlerFor site b -> HandlerFor site b # (<*) :: HandlerFor site a -> HandlerFor site b -> HandlerFor site a # | |
| MonadUnliftIO (HandlerFor site) | |
Defined in Yesod.Core.Types Methods askUnliftIO :: HandlerFor site (UnliftIO (HandlerFor site)) # withRunInIO :: ((forall a. HandlerFor site a -> IO a) -> IO b) -> HandlerFor site b # | |
| PrimMonad (HandlerFor site) | |
Defined in Yesod.Core.Types Associated Types type PrimState (HandlerFor site) # Methods primitive :: (State# (PrimState (HandlerFor site)) -> (# State# (PrimState (HandlerFor site)), a #)) -> HandlerFor site a # | |
| MonadIO (HandlerFor site) | |
Defined in Yesod.Core.Types Methods liftIO :: IO a -> HandlerFor site a # | |
| MonadThrow (HandlerFor site) | |
Defined in Yesod.Core.Types Methods throwM :: Exception e => e -> HandlerFor site a | |
| MonadResource (HandlerFor site) | |
Defined in Yesod.Core.Types Methods liftResourceT :: ResourceT IO a -> HandlerFor site a # | |
| MonadHandler (HandlerFor site) | |
Defined in Yesod.Core.Class.Handler Methods liftHandler :: HandlerFor (HandlerSite (HandlerFor site)) a -> HandlerFor site a # liftSubHandler :: SubHandlerFor (SubHandlerSite (HandlerFor site)) (HandlerSite (HandlerFor site)) a -> HandlerFor site a # | |
| MonadLogger (HandlerFor site) | |
Defined in Yesod.Core.Types Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> HandlerFor site () | |
| MonadLoggerIO (HandlerFor site) | |
Defined in Yesod.Core.Types Methods askLoggerIO :: HandlerFor site (Loc -> LogSource -> LogLevel -> LogStr -> IO ()) | |
| MonadReader (HandlerData site site) (HandlerFor site) | |
Defined in Yesod.Core.Types Methods ask :: HandlerFor site (HandlerData site site) # local :: (HandlerData site site -> HandlerData site site) -> HandlerFor site a -> HandlerFor site a reader :: (HandlerData site site -> a) -> HandlerFor site a | |
| type PrimState (HandlerFor site) | |
Defined in Yesod.Core.Types | |
| type HandlerSite (HandlerFor site) | |
Defined in Yesod.Core.Class.Handler | |
| type SubHandlerSite (HandlerFor site) | |
Defined in Yesod.Core.Class.Handler | |
newtype WaiSubsiteWithAuth #
Constructors
| WaiSubsiteWithAuth | |
Fields | |
Instances
newtype WaiSubsite #
Constructors
| WaiSubsite | |
Fields | |
Instances
type BottomOfHeadAsync master = [Text] -> Maybe (HtmlUrl (Route master)) -> HtmlUrl (Route master) #
data ScriptLoadPosition master #
Constructors
| BottomOfBody | |
| BottomOfHeadBlocking | |
| BottomOfHeadAsync !(BottomOfHeadAsync master) |
data AuthResult #
Constructors
| Authorized | |
| AuthenticationRequired | |
| Unauthorized !Text |
Instances
| Eq AuthResult | |
Defined in Yesod.Core.Types | |
| Read AuthResult | |
Defined in Yesod.Core.Types Methods readsPrec :: Int -> ReadS AuthResult readList :: ReadS [AuthResult] readPrec :: ReadPrec AuthResult readListPrec :: ReadPrec [AuthResult] | |
| Show AuthResult | |
Defined in Yesod.Core.Types Methods showsPrec :: Int -> AuthResult -> ShowS # show :: AuthResult -> String # showList :: [AuthResult] -> ShowS # | |
Constructors
| ApprootRelative | |
| ApprootStatic !Text | |
| ApprootMaster !(master -> Text) | |
| ApprootRequest !(master -> Request -> Text) |
data FileUpload #
Constructors
| FileUploadMemory !(BackEnd ByteString) | |
| FileUploadDisk !(InternalState -> BackEnd FilePath) | |
| FileUploadSource !(BackEnd (ConduitT () ByteString (ResourceT IO) ())) |
data YesodRequest #
Constructors
| YesodRequest | |
Fields
| |
newtype SessionBackend #
Constructors
| SessionBackend | |
Fields
| |
type SessionMap = Map Text ByteString #
clientSessionDateCacher :: NominalDiffTime -> IO (IO ClientSessionDateCache, IO ()) #
class ToContent a => ToTypedContent a where #
Methods
toTypedContent :: a -> TypedContent #
Instances
class ToTypedContent a => HasContentType a where #
Methods
getContentType :: Monad m => m a -> ContentType #
Instances
class ToFlushBuilder a where #
Methods
toFlushBuilder :: a -> Flush Builder #
Instances
Instances
emptyContent :: Content #
typeHtml :: ContentType #
typeJson :: ContentType #
typeXml :: ContentType #
typeAtom :: ContentType #
typeRss :: ContentType #
typeJpeg :: ContentType #
typePng :: ContentType #
typeGif :: ContentType #
typeSvg :: ContentType #
typeCss :: ContentType #
typeFlv :: ContentType #
typeOgv :: ContentType #
contentTypeTypes :: ContentType -> (ByteString, ByteString) #
class MonadHandler m => MonadWidget (m :: Type -> Type) where #
Methods
liftWidget :: WidgetFor (HandlerSite m) a -> m a #
Instances
class (MonadResource m, MonadLogger m) => MonadHandler (m :: Type -> Type) where #
Methods
liftHandler :: HandlerFor (HandlerSite m) a -> m a #
liftSubHandler :: SubHandlerFor (SubHandlerSite m) (HandlerSite m) a -> m a #
Instances
type family HandlerSite (m :: Type -> Type) #
Instances
type family SubHandlerSite (m :: Type -> Type) #
Instances
data ProvidedRep (m :: Type -> Type) #
Constructors
| a :#: b |
Instances
| (RedirectUrl master a, PathPiece b) => RedirectUrl master (Fragment a b) | |
Defined in Yesod.Core.Handler Methods toTextUrl :: (MonadHandler m, HandlerSite m ~ master) => Fragment a b -> m Text # | |
| (Show a, Show b) => Show (Fragment a b) | |
class RedirectUrl master a where #
Methods
toTextUrl :: (MonadHandler m, HandlerSite m ~ master) => a -> m Text #
Instances
| RedirectUrl master String | |
Defined in Yesod.Core.Handler Methods toTextUrl :: (MonadHandler m, HandlerSite m ~ master) => String -> m Text # | |
| RedirectUrl master Text | |
Defined in Yesod.Core.Handler Methods toTextUrl :: (MonadHandler m, HandlerSite m ~ master) => Text -> m Text # | |
| RedirectUrl master (Route master) | |
Defined in Yesod.Core.Handler Methods toTextUrl :: (MonadHandler m, HandlerSite m ~ master) => Route master -> m Text # | |
| (RedirectUrl master a, PathPiece b) => RedirectUrl master (Fragment a b) | |
Defined in Yesod.Core.Handler Methods toTextUrl :: (MonadHandler m, HandlerSite m ~ master) => Fragment a b -> m Text # | |
| (key ~ Text, val ~ Text) => RedirectUrl master (Route master, [(key, val)]) | |
Defined in Yesod.Core.Handler Methods toTextUrl :: (MonadHandler m, HandlerSite m ~ master) => (Route master, [(key, val)]) -> m Text # | |
| (key ~ Text, val ~ Text) => RedirectUrl master (Route master, Map key val) | |
Defined in Yesod.Core.Handler Methods toTextUrl :: (MonadHandler m, HandlerSite m ~ master) => (Route master, Map key val) -> m Text # | |
type HandlerT site (m :: Type -> Type) = HandlerFor site #
getRequest :: MonadHandler m => m YesodRequest #
runRequestBody :: MonadHandler m => m RequestBodyContents #
getYesod :: MonadHandler m => m (HandlerSite m) #
getsYesod :: MonadHandler m => (HandlerSite m -> a) -> m a #
getUrlRender :: MonadHandler m => m (Route (HandlerSite m) -> Text) #
getUrlRenderParams :: MonadHandler m => m (Route (HandlerSite m) -> [(Text, Text)] -> Text) #
getPostParams :: MonadHandler m => m [(Text, Text)] #
getCurrentRoute :: MonadHandler m => m (Maybe (Route (HandlerSite m))) #
handlerToIO :: MonadIO m => HandlerFor site (HandlerFor site a -> m a) #
forkHandler :: (SomeException -> HandlerFor site ()) -> HandlerFor site () -> HandlerFor site () #
redirect :: (MonadHandler m, RedirectUrl (HandlerSite m) url) => url -> m a #
redirectWith :: (MonadHandler m, RedirectUrl (HandlerSite m) url) => Status -> url -> m a #
setUltDest :: (MonadHandler m, RedirectUrl (HandlerSite m) url) => url -> m () #
setUltDestCurrent :: MonadHandler m => m () #
setUltDestReferer :: MonadHandler m => m () #
redirectUltDest :: (RedirectUrl (HandlerSite m) url, MonadHandler m) => url -> m a #
clearUltDest :: MonadHandler m => m () #
addMessage :: MonadHandler m => Text -> Html -> m () #
addMessageI :: (MonadHandler m, RenderMessage (HandlerSite m) msg) => Text -> msg -> m () #
getMessages :: MonadHandler m => m [(Text, Html)] #
setMessage :: MonadHandler m => Html -> m () #
setMessageI :: (MonadHandler m, RenderMessage (HandlerSite m) msg) => msg -> m () #
getMessage :: MonadHandler m => m (Maybe Html) #
sendFile :: MonadHandler m => ContentType -> FilePath -> m a #
sendFilePart :: MonadHandler m => ContentType -> FilePath -> Integer -> Integer -> m a #
sendResponse :: (MonadHandler m, ToTypedContent c) => c -> m a #
sendResponseStatus :: (MonadHandler m, ToTypedContent c) => Status -> c -> m a #
sendStatusJSON :: (MonadHandler m, ToJSON c) => Status -> c -> m a #
sendResponseCreated :: MonadHandler m => Route (HandlerSite m) -> m a #
sendResponseNoContent :: MonadHandler m => m a #
sendWaiResponse :: MonadHandler m => Response -> m b #
sendWaiApplication :: MonadHandler m => Application -> m b #
sendRawResponseNoConduit :: (MonadHandler m, MonadUnliftIO m) => (IO ByteString -> (ByteString -> IO ()) -> m ()) -> m a #
sendRawResponse :: (MonadHandler m, MonadUnliftIO m) => (ConduitT () ByteString IO () -> ConduitT ByteString Void IO () -> m ()) -> m a #
notModified :: MonadHandler m => m a #
notFound :: MonadHandler m => m a #
badMethod :: MonadHandler m => m a #
notAuthenticated :: MonadHandler m => m a #
permissionDenied :: MonadHandler m => Text -> m a #
permissionDeniedI :: (RenderMessage (HandlerSite m) msg, MonadHandler m) => msg -> m a #
invalidArgs :: MonadHandler m => [Text] -> m a #
invalidArgsI :: (MonadHandler m, RenderMessage (HandlerSite m) msg) => [msg] -> m a #
setCookie :: MonadHandler m => SetCookie -> m () #
getExpires :: MonadIO m => Int -> m UTCTime #
deleteCookie :: MonadHandler m => Text -> Text -> m () #
setLanguage :: MonadHandler m => Text -> m () #
addContentDispositionFileName :: MonadHandler m => Text -> m () #
addHeader :: MonadHandler m => Text -> Text -> m () #
setHeader :: MonadHandler m => Text -> Text -> m () #
replaceOrAddHeader :: MonadHandler m => Text -> Text -> m () #
cacheSeconds :: MonadHandler m => Int -> m () #
neverExpires :: MonadHandler m => m () #
alreadyExpired :: MonadHandler m => m () #
expiresAt :: MonadHandler m => UTCTime -> m () #
setEtag :: MonadHandler m => Text -> m () #
setWeakEtag :: MonadHandler m => Text -> m () #
setSession :: MonadHandler m => Text -> Text -> m () #
setSessionBS :: MonadHandler m => Text -> ByteString -> m () #
deleteSession :: MonadHandler m => Text -> m () #
clearSession :: MonadHandler m => m () #
lookupSession :: MonadHandler m => Text -> m (Maybe Text) #
lookupSessionBS :: MonadHandler m => Text -> m (Maybe ByteString) #
getSession :: MonadHandler m => m SessionMap #
newIdent :: MonadHandler m => m Text #
redirectToPost :: (MonadHandler m, RedirectUrl (HandlerSite m) url) => url -> m a #
hamletToRepHtml :: MonadHandler m => HtmlUrl (Route (HandlerSite m)) -> m Html #
giveUrlRenderer :: MonadHandler m => ((Route (HandlerSite m) -> [(Text, Text)] -> Text) -> output) -> m output #
withUrlRenderer :: MonadHandler m => ((Route (HandlerSite m) -> [(Text, Text)] -> Text) -> output) -> m output #
waiRequest :: MonadHandler m => m Request #
getMessageRender :: (MonadHandler m, RenderMessage (HandlerSite m) message) => m (message -> Text) #
cached :: (MonadHandler m, Typeable a) => m a -> m a #
cacheGet :: (MonadHandler m, Typeable a) => m (Maybe a) #
cacheSet :: (MonadHandler m, Typeable a) => a -> m () #
cachedBy :: (MonadHandler m, Typeable a) => ByteString -> m a -> m a #
cacheByGet :: (MonadHandler m, Typeable a) => ByteString -> m (Maybe a) #
cacheBySet :: (MonadHandler m, Typeable a) => ByteString -> a -> m () #
languages :: MonadHandler m => m [Text] #
lookupHeader :: MonadHandler m => CI ByteString -> m (Maybe ByteString) #
lookupHeaders :: MonadHandler m => CI ByteString -> m [ByteString] #
lookupBasicAuth :: MonadHandler m => m (Maybe (Text, Text)) #
lookupBearerAuth :: MonadHandler m => m (Maybe Text) #
lookupGetParams :: MonadHandler m => Text -> m [Text] #
lookupGetParam :: MonadHandler m => Text -> m (Maybe Text) #
lookupPostParams :: (MonadResource m, MonadHandler m) => Text -> m [Text] #
lookupPostParam :: (MonadResource m, MonadHandler m) => Text -> m (Maybe Text) #
lookupFile :: MonadHandler m => Text -> m (Maybe FileInfo) #
lookupFiles :: MonadHandler m => Text -> m [FileInfo] #
lookupCookie :: MonadHandler m => Text -> m (Maybe Text) #
lookupCookies :: MonadHandler m => Text -> m [Text] #
selectRep :: MonadHandler m => Writer (Endo [ProvidedRep m]) () -> m TypedContent #
provideRep :: (Monad m, HasContentType a) => m a -> Writer (Endo [ProvidedRep m]) () #
provideRepType :: (Monad m, ToContent a) => ContentType -> m a -> Writer (Endo [ProvidedRep m]) () #
rawRequestBody :: forall (m :: Type -> Type) i. MonadHandler m => ConduitT i ByteString m () #
fileSource :: forall (m :: Type -> Type). MonadResource m => FileInfo -> ConduitT () ByteString m () #
fileSourceByteString :: MonadResource m => FileInfo -> m ByteString #
respond :: (Monad m, ToContent a) => ContentType -> a -> m TypedContent #
respondSource :: ContentType -> ConduitT () (Flush Builder) (HandlerFor site) () -> HandlerFor site TypedContent #
sendChunk :: forall (m :: Type -> Type) a i. (Monad m, ToFlushBuilder a) => a -> ConduitT i (Flush Builder) m () #
sendChunkBS :: forall (m :: Type -> Type) i. Monad m => ByteString -> ConduitT i (Flush Builder) m () #
sendChunkLBS :: forall (m :: Type -> Type) i. Monad m => ByteString -> ConduitT i (Flush Builder) m () #
sendChunkLazyText :: forall (m :: Type -> Type) i. Monad m => Text -> ConduitT i (Flush Builder) m () #
setCsrfCookie :: MonadHandler m => m () #
setCsrfCookieWithCookie :: MonadHandler m => SetCookie -> m () #
defaultCsrfHeaderName :: CI ByteString #
checkCsrfHeaderNamed :: MonadHandler m => CI ByteString -> m () #
hasValidCsrfHeaderNamed :: MonadHandler m => CI ByteString -> m Bool #
checkCsrfParamNamed :: MonadHandler m => Text -> m () #
hasValidCsrfParamNamed :: MonadHandler m => Text -> m Bool #
checkCsrfHeaderOrParam :: (MonadHandler m, MonadLogger m) => CI ByteString -> Text -> m () #
getSubYesod :: MonadHandler m => m (SubHandlerSite m) #
getRouteToParent :: MonadHandler m => m (Route (SubHandlerSite m) -> Route (HandlerSite m)) #
getSubCurrentRoute :: MonadHandler m => m (Maybe (Route (SubHandlerSite m))) #
class ToWidgetHead site a where #
Methods
toWidgetHead :: (MonadWidget m, HandlerSite m ~ site) => a -> m () #
Instances
| ToWidgetHead site Html | |
Defined in Yesod.Core.Widget Methods toWidgetHead :: (MonadWidget m, HandlerSite m ~ site) => Html -> m () # | |
| ToWidgetHead site Javascript | |
Defined in Yesod.Core.Widget Methods toWidgetHead :: (MonadWidget m, HandlerSite m ~ site) => Javascript -> m () # | |
| ToWidgetHead site CssBuilder | |
Defined in Yesod.Core.Widget Methods toWidgetHead :: (MonadWidget m, HandlerSite m ~ site) => CssBuilder -> m () # | |
| ToWidgetHead site Css | |
Defined in Yesod.Core.Widget Methods toWidgetHead :: (MonadWidget m, HandlerSite m ~ site) => Css -> m () # | |
| render ~ RY site => ToWidgetHead site (render -> Html) | |
Defined in Yesod.Core.Widget Methods toWidgetHead :: (MonadWidget m, HandlerSite m ~ site) => (render -> Html) -> m () # | |
| render ~ RY site => ToWidgetHead site (render -> Css) | |
Defined in Yesod.Core.Widget Methods toWidgetHead :: (MonadWidget m, HandlerSite m ~ site) => (render -> Css) -> m () # | |
| render ~ RY site => ToWidgetHead site (render -> CssBuilder) | |
Defined in Yesod.Core.Widget Methods toWidgetHead :: (MonadWidget m, HandlerSite m ~ site) => (render -> CssBuilder) -> m () # | |
| render ~ RY site => ToWidgetHead site (render -> Javascript) | |
Defined in Yesod.Core.Widget Methods toWidgetHead :: (MonadWidget m, HandlerSite m ~ site) => (render -> Javascript) -> m () # | |
class ToWidgetBody site a where #
Methods
toWidgetBody :: (MonadWidget m, HandlerSite m ~ site) => a -> m () #
Instances
| ToWidgetBody site Html | |
Defined in Yesod.Core.Widget Methods toWidgetBody :: (MonadWidget m, HandlerSite m ~ site) => Html -> m () # | |
| ToWidgetBody site Javascript | |
Defined in Yesod.Core.Widget Methods toWidgetBody :: (MonadWidget m, HandlerSite m ~ site) => Javascript -> m () # | |
| render ~ RY site => ToWidgetBody site (render -> Html) | |
Defined in Yesod.Core.Widget Methods toWidgetBody :: (MonadWidget m, HandlerSite m ~ site) => (render -> Html) -> m () # | |
| render ~ RY site => ToWidgetBody site (render -> Javascript) | |
Defined in Yesod.Core.Widget Methods toWidgetBody :: (MonadWidget m, HandlerSite m ~ site) => (render -> Javascript) -> m () # | |
class ToWidgetMedia site a where #
Methods
toWidgetMedia :: (MonadWidget m, HandlerSite m ~ site) => Text -> a -> m () #
Instances
| ToWidgetMedia site CssBuilder | |
Defined in Yesod.Core.Widget Methods toWidgetMedia :: (MonadWidget m, HandlerSite m ~ site) => Text -> CssBuilder -> m () # | |
| ToWidgetMedia site Css | |
Defined in Yesod.Core.Widget Methods toWidgetMedia :: (MonadWidget m, HandlerSite m ~ site) => Text -> Css -> m () # | |
| render ~ RY site => ToWidgetMedia site (render -> Css) | |
Defined in Yesod.Core.Widget Methods toWidgetMedia :: (MonadWidget m, HandlerSite m ~ site) => Text -> (render -> Css) -> m () # | |
| render ~ RY site => ToWidgetMedia site (render -> CssBuilder) | |
Defined in Yesod.Core.Widget Methods toWidgetMedia :: (MonadWidget m, HandlerSite m ~ site) => Text -> (render -> CssBuilder) -> m () # | |
Methods
toWidget :: (MonadWidget m, HandlerSite m ~ site) => a -> m () #
Instances
| ToWidget site Text | |
Defined in Yesod.Core.Widget Methods toWidget :: (MonadWidget m, HandlerSite m ~ site) => Text -> m () # | |
| ToWidget site Text | |
Defined in Yesod.Core.Widget Methods toWidget :: (MonadWidget m, HandlerSite m ~ site) => Text -> m () # | |
| ToWidget site Html | |
Defined in Yesod.Core.Widget Methods toWidget :: (MonadWidget m, HandlerSite m ~ site) => Html -> m () # | |
| ToWidget site Javascript | |
Defined in Yesod.Core.Widget Methods toWidget :: (MonadWidget m, HandlerSite m ~ site) => Javascript -> m () # | |
| ToWidget site CssBuilder | |
Defined in Yesod.Core.Widget Methods toWidget :: (MonadWidget m, HandlerSite m ~ site) => CssBuilder -> m () # | |
| ToWidget site Css | |
Defined in Yesod.Core.Widget Methods toWidget :: (MonadWidget m, HandlerSite m ~ site) => Css -> m () # | |
| ToWidget site Builder | |
Defined in Yesod.Core.Widget Methods toWidget :: (MonadWidget m, HandlerSite m ~ site) => Builder -> m () # | |
| render ~ RY site => ToWidget site (render -> Html) | |
Defined in Yesod.Core.Widget Methods toWidget :: (MonadWidget m, HandlerSite m ~ site) => (render -> Html) -> m () # | |
| render ~ RY site => ToWidget site (render -> Css) | |
Defined in Yesod.Core.Widget Methods toWidget :: (MonadWidget m, HandlerSite m ~ site) => (render -> Css) -> m () # | |
| render ~ RY site => ToWidget site (render -> CssBuilder) | |
Defined in Yesod.Core.Widget Methods toWidget :: (MonadWidget m, HandlerSite m ~ site) => (render -> CssBuilder) -> m () # | |
| render ~ RY site => ToWidget site (render -> Javascript) | |
Defined in Yesod.Core.Widget Methods toWidget :: (MonadWidget m, HandlerSite m ~ site) => (render -> Javascript) -> m () # | |
| (site' ~ site, a ~ ()) => ToWidget site' (WidgetFor site a) | |
Defined in Yesod.Core.Widget Methods toWidget :: (MonadWidget m, HandlerSite m ~ site') => WidgetFor site a -> m () # | |
setTitle :: MonadWidget m => Html -> m () #
setTitleI :: (MonadWidget m, RenderMessage (HandlerSite m) msg) => msg -> m () #
setDescription :: MonadWidget m => Text -> m () #
setDescriptionI :: (MonadWidget m, RenderMessage (HandlerSite m) msg) => msg -> m () #
setOGType :: MonadWidget m => Text -> m () #
setOGImage :: MonadWidget m => Text -> m () #
addStylesheet :: MonadWidget m => Route (HandlerSite m) -> m () #
addStylesheetAttrs :: MonadWidget m => Route (HandlerSite m) -> [(Text, Text)] -> m () #
addStylesheetRemote :: MonadWidget m => Text -> m () #
addStylesheetRemoteAttrs :: MonadWidget m => Text -> [(Text, Text)] -> m () #
addStylesheetEither :: MonadWidget m => Either (Route (HandlerSite m)) Text -> m () #
addScriptEither :: MonadWidget m => Either (Route (HandlerSite m)) Text -> m () #
addScript :: MonadWidget m => Route (HandlerSite m) -> m () #
addScriptAttrs :: MonadWidget m => Route (HandlerSite m) -> [(Text, Text)] -> m () #
addScriptRemote :: MonadWidget m => Text -> m () #
addScriptRemoteAttrs :: MonadWidget m => Text -> [(Text, Text)] -> m () #
whamletFile :: FilePath -> Q Exp #
whamletFileWithSettings :: HamletSettings -> FilePath -> Q Exp #
ihamletToRepHtml :: (MonadHandler m, RenderMessage (HandlerSite m) message) => HtmlUrlI18n message (Route (HandlerSite m)) -> m Html #
ihamletToHtml :: (MonadHandler m, RenderMessage (HandlerSite m) message) => HtmlUrlI18n message (Route (HandlerSite m)) -> m Html #
handlerToWidget :: HandlerFor site a -> WidgetFor site a #
class RenderRoute site => Yesod site where #
Minimal complete definition
Nothing
Methods
errorHandler :: ErrorResponse -> HandlerFor site TypedContent #
defaultLayout :: WidgetFor site () -> HandlerFor site Html #
urlParamRenderOverride :: site -> Route site -> [(Text, Text)] -> Maybe Builder #
isAuthorized :: Route site -> Bool -> HandlerFor site AuthResult #
isWriteRequest :: Route site -> HandlerFor site Bool #
authRoute :: site -> Maybe (Route site) #
cleanPath :: site -> [Text] -> Either [Text] [Text] #
joinPath :: site -> Text -> [Text] -> [(Text, Text)] -> Builder #
addStaticContent :: Text -> Text -> ByteString -> HandlerFor site (Maybe (Either Text (Route site, [(Text, Text)]))) #
maximumContentLength :: site -> Maybe (Route site) -> Maybe Word64 #
maximumContentLengthIO :: site -> Maybe (Route site) -> IO (Maybe Word64) #
makeLogger :: site -> IO Logger #
messageLoggerSource :: site -> Logger -> Loc -> LogSource -> LogLevel -> LogStr -> IO () #
jsLoader :: site -> ScriptLoadPosition site #
jsAttributes :: site -> [(Text, Text)] #
jsAttributesHandler :: HandlerFor site [(Text, Text)] #
makeSessionBackend :: site -> IO (Maybe SessionBackend) #
fileUpload :: site -> RequestBodyLength -> FileUpload #
shouldLogIO :: site -> LogSource -> LogLevel -> IO Bool #
yesodMiddleware :: ToTypedContent res => HandlerFor site res -> HandlerFor site res #
yesodWithInternalState :: site -> Maybe (Route site) -> (InternalState -> IO a) -> IO a #
defaultMessageWidget :: Html -> HtmlUrl (Route site) -> WidgetFor site () #
Instances
defaultMakeLogger :: IO Logger #
defaultMessageLoggerSource :: (LogSource -> LogLevel -> IO Bool) -> Logger -> Loc -> LogSource -> LogLevel -> LogStr -> IO () #
defaultShouldLogIO :: LogSource -> LogLevel -> IO Bool #
defaultYesodMiddleware :: Yesod site => HandlerFor site res -> HandlerFor site res #
sslOnlySessions :: IO (Maybe SessionBackend) -> IO (Maybe SessionBackend) #
laxSameSiteSessions :: IO (Maybe SessionBackend) -> IO (Maybe SessionBackend) #
strictSameSiteSessions :: IO (Maybe SessionBackend) -> IO (Maybe SessionBackend) #
sslOnlyMiddleware :: Int -> HandlerFor site res -> HandlerFor site res #
authorizationCheck :: Yesod site => HandlerFor site () #
defaultCsrfCheckMiddleware :: Yesod site => HandlerFor site res -> HandlerFor site res #
csrfCheckMiddleware :: HandlerFor site res -> HandlerFor site Bool -> CI ByteString -> Text -> HandlerFor site res #
defaultCsrfSetCookieMiddleware :: HandlerFor site res -> HandlerFor site res #
csrfSetCookieMiddleware :: HandlerFor site res -> SetCookie -> HandlerFor site res #
defaultCsrfMiddleware :: Yesod site => HandlerFor site res -> HandlerFor site res #
widgetToPageContent :: Yesod site => WidgetFor site () -> HandlerFor site (PageContent (Route site)) #
defaultErrorHandler :: Yesod site => ErrorResponse -> HandlerFor site TypedContent #
formatLogMessage :: IO ZonedDate -> Loc -> LogSource -> LogLevel -> LogStr -> IO LogStr #
customizeSessionCookies :: (SetCookie -> SetCookie) -> SessionBackend -> SessionBackend #
defaultClientSessionBackend :: Int -> FilePath -> IO SessionBackend #
envClientSessionBackend :: Int -> String -> IO SessionBackend #
clientSessionBackend :: Key -> IO ClientSessionDateCache -> SessionBackend #
loadClientSession :: Key -> IO ClientSessionDateCache -> ByteString -> Request -> IO (SessionMap, SaveSession) #
guessApproot :: Approot site #
guessApprootOr :: Approot site -> Approot site #
getApprootText :: Approot site -> site -> Request -> Text #
defaultLayoutJson :: (Yesod site, ToJSON a) => WidgetFor site () -> HandlerFor site a -> HandlerFor site TypedContent #
jsonToRepJson :: (Monad m, ToJSON a) => a -> m Value #
returnJson :: (Monad m, ToJSON a) => a -> m Value #
returnJsonEncoding :: (Monad m, ToJSON a) => a -> m Encoding #
provideJson :: forall (m :: Type -> Type) a. (Monad m, ToJSON a) => a -> Writer (Endo [ProvidedRep m]) () #
parseJsonBody :: (MonadHandler m, FromJSON a) => m (Result a) #
parseInsecureJsonBody :: (MonadHandler m, FromJSON a) => m (Result a) #
parseCheckJsonBody :: (MonadHandler m, FromJSON a) => m (Result a) #
parseJsonBody_ :: (MonadHandler m, FromJSON a) => m a #
requireJsonBody :: (MonadHandler m, FromJSON a) => m a #
requireInsecureJsonBody :: (MonadHandler m, FromJSON a) => m a #
requireCheckJsonBody :: (MonadHandler m, FromJSON a) => m a #
jsonOrRedirect :: (MonadHandler m, ToJSON a) => Route (HandlerSite m) -> a -> m Value #
jsonEncodingOrRedirect :: (MonadHandler m, ToJSON a) => Route (HandlerSite m) -> a -> m Encoding #
acceptsJson :: MonadHandler m => m Bool #
yesodRunner :: (ToTypedContent res, Yesod site) => HandlerFor site res -> YesodRunnerEnv site -> Maybe (Route site) -> Application #
class YesodSubDispatch sub master where #
Methods
yesodSubDispatch :: YesodSubRunnerEnv sub master -> Application #
Instances
| YesodSubDispatch WaiSubsiteWithAuth master | |
Defined in Yesod.Core.Class.Dispatch Methods yesodSubDispatch :: YesodSubRunnerEnv WaiSubsiteWithAuth master -> Application # | |
| YesodSubDispatch WaiSubsite master | |
Defined in Yesod.Core.Class.Dispatch Methods yesodSubDispatch :: YesodSubRunnerEnv WaiSubsite master -> Application # | |
| YesodSubDispatch Static master | |
Defined in Yesod.Static Methods yesodSubDispatch :: YesodSubRunnerEnv Static master -> Application # | |
class Yesod site => YesodDispatch site where #
Methods
yesodDispatch :: YesodRunnerEnv site -> Application #
Instances
| YesodDispatch LiteApp | |
Defined in Yesod.Core.Internal.LiteApp Methods yesodDispatch :: YesodRunnerEnv LiteApp -> Application # | |
type LiteWidget = WidgetFor LiteApp #
type LiteHandler = HandlerFor LiteApp #
Constructors
| LiteApp | |
Fields
| |
Instances
dispatchTo :: ToTypedContent a => LiteHandler a -> Writer LiteApp () #
withDynamic :: PathPiece p => (p -> Writer LiteApp ()) -> Writer LiteApp () #
withDynamicMulti :: PathMultiPiece ps => (ps -> Writer LiteApp ()) -> Writer LiteApp () #
class YesodBreadcrumbs site where #
Methods
breadcrumb :: Route site -> HandlerFor site (Text, Maybe (Route site)) #
breadcrumbs :: YesodBreadcrumbs site => HandlerFor site (Text, [(Route site, Text)]) #
parseRoutes :: QuasiQuoter #
parseRoutesFile :: FilePath -> Q Exp #
parseRoutesFileNoCheck :: FilePath -> Q Exp #
parseRoutesNoCheck :: QuasiQuoter #
mkYesodData :: String -> [ResourceTree String] -> Q [Dec] #
mkYesodSubData :: String -> [ResourceTree String] -> Q [Dec] #
mkYesodDispatch :: String -> [ResourceTree String] -> Q [Dec] #
mkYesodSubDispatch :: [ResourceTree a] -> Q Exp #
toWaiAppPlain :: YesodDispatch site => site -> IO Application #
toWaiAppYre :: YesodDispatch site => YesodRunnerEnv site -> Application #
toWaiApp :: YesodDispatch site => site -> IO Application #
warp :: YesodDispatch site => Int -> site -> IO () #
mkDefaultMiddlewares :: Logger -> IO Middleware #
defaultMiddlewaresNoLogging :: Middleware #
warpDebug :: YesodDispatch site => Int -> site -> IO () #
warpEnv :: YesodDispatch site => site -> IO () #
getGetMaxExpires :: IO (IO Text) #
runFakeHandler :: (Yesod site, MonadIO m) => SessionMap -> (site -> Logger) -> site -> HandlerT site IO a -> m (Either ErrorResponse a) #
unauthorizedI :: (MonadHandler m, RenderMessage (HandlerSite m) msg) => msg -> m AuthResult #
yesodVersion :: String #
showIntegral :: Integral a => a -> String #
readIntegral :: Num a => String -> Maybe a #
type Application = Request -> (Response -> IO ResponseReceived) -> IO ResponseReceived #
type JavascriptUrl url = (url -> [(Text, Text)] -> Text) -> Javascript #
renderJavascriptUrl :: (url -> [(Text, Text)] -> Text) -> JavascriptUrl url -> Text #
data SomeMessage master #
Constructors
| RenderMessage master msg => SomeMessage msg |
Instances
| master ~ master' => RenderMessage master (SomeMessage master') | |
Defined in Text.Shakespeare.I18N Methods renderMessage :: master -> [Lang] -> SomeMessage master' -> Text # | |
| IsString (SomeMessage master) | |
Defined in Text.Shakespeare.I18N Methods fromString :: String -> SomeMessage master # | |
class RenderMessage master message where #
Methods
renderMessage :: master -> [Lang] -> message -> Text #
Instances
| RenderMessage master Text | |
Defined in Text.Shakespeare.I18N Methods renderMessage :: master -> [Lang] -> Text -> Text # | |
| master ~ master' => RenderMessage master (SomeMessage master') | |
Defined in Text.Shakespeare.I18N Methods renderMessage :: master -> [Lang] -> SomeMessage master' -> Text # | |
class Monad m => MonadLogger (m :: Type -> Type) #
Instances
| MonadLogger m => MonadLogger (ResourceT m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> ResourceT m () | |
| MonadLogger (WidgetFor site) | |
Defined in Yesod.Core.Types Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> WidgetFor site () | |
| MonadLogger (HandlerFor site) | |
Defined in Yesod.Core.Types Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> HandlerFor site () | |
| MonadLogger m => MonadLogger (ListT m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> ListT m () | |
| MonadLogger m => MonadLogger (MaybeT m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> MaybeT m () | |
| MonadIO m => MonadLogger (LoggingT m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> LoggingT m () | |
| Monad m => MonadLogger (NoLoggingT m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> NoLoggingT m () | |
| Monad m => MonadLogger (WriterLoggingT m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> WriterLoggingT m () | |
| MonadLogger m => MonadLogger (ReaderT r m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> ReaderT r m () | |
| (MonadLogger m, Monoid w) => MonadLogger (WriterT w m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> WriterT w m () | |
| MonadLogger (SubHandlerFor child master) | |
Defined in Yesod.Core.Types Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> SubHandlerFor child master () | |
| MonadLogger m => MonadLogger (IdentityT m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> IdentityT m () | |
| MonadLogger m => MonadLogger (StateT s m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> StateT s m () | |
| (MonadLogger m, Error e) => MonadLogger (ErrorT e m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> ErrorT e m () | |
| (MonadLogger m, Monoid w) => MonadLogger (WriterT w m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> WriterT w m () | |
| MonadLogger m => MonadLogger (StateT s m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> StateT s m () | |
| MonadLogger m => MonadLogger (ExceptT e m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> ExceptT e m () | |
| MonadLogger m => MonadLogger (ConduitM i o m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> ConduitM i o m () | |
| MonadLogger m => MonadLogger (ContT r m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> ContT r m () | |
| (MonadLogger m, Monoid w) => MonadLogger (RWST r w s m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> RWST r w s m () | |
| (MonadLogger m, Monoid w) => MonadLogger (RWST r w s m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> RWST r w s m () | |
| MonadLogger m => MonadLogger (Pipe l i o u m) | |
Defined in Control.Monad.Logger Methods monadLoggerLog :: ToLogStr msg => Loc -> LogSource -> LogLevel -> msg -> Pipe l i o u m () | |
Constructors
| LevelDebug | |
| LevelInfo | |
| LevelWarn | |
| LevelError | |
| LevelOther Text |
Instances
| Eq LogLevel | |
| Ord LogLevel | |
Defined in Control.Monad.Logger | |
| Read LogLevel | |
Defined in Control.Monad.Logger | |
| Show LogLevel | |
| Lift LogLevel | |
Defined in Control.Monad.Logger | |
newsFeedText :: MonadHandler m => Feed Text -> m TypedContent Source #
Same as newsFeed'Feed Text'. Useful for cases where you are
generating a feed of external links.
newsFeed :: MonadHandler m => Feed (Route (HandlerSite m)) -> m TypedContent Source #
The overall feed
Constructors
| Feed | |
Fields
| |
data EntryEnclosure url Source #
RSS and Atom allow for linked content to be enclosed in a feed entry. This represents the enclosed content.
Atom feeds ignore enclosedSize and enclosedMimeType.
Since: yesod-newsfeed-1.6
Constructors
| EntryEnclosure | |
Fields
| |
data EntryCategory Source #
RSS 2.0 and Atom allow category in a feed entry.
RSS feeds ignore categoryLabel
Since: yesod-newsfeed-1.7
Constructors
| EntryCategory | |
Fields
| |
Each feed entry
Constructors
| FeedEntry | |
Fields
| |
Arguments
| :: Bool | development? if so, perform no combining |
| -> CombineSettings | |
| -> Name | Static route constructor name, e.g. 'StaticR |
| -> [Route Static] | files to combine |
| -> Q Exp |
Combine multiple JS files together. Common usage would be:
>>>combineScripts' development def 'StaticR [script1_js, script2_js]
Where development is a variable in your site indicated whether you are in
development or production mode.
Since 1.2.0
Arguments
| :: Bool | development? if so, perform no combining |
| -> CombineSettings | |
| -> Name | Static route constructor name, e.g. 'StaticR |
| -> [Route Static] | files to combine |
| -> Q Exp |
Combine multiple CSS files together. Common usage would be:
>>>combineStylesheets' development def 'StaticR [style1_css, style2_css]
Where development is a variable in your site indicated whether you are in
development or production mode.
Since 1.2.0
staticFilesMergeMap :: FilePath -> Map FilePath FilePath -> Q [Dec] Source #
Similar to staticFilesMergeMap, but also generates identifiers
for all files in the specified directory that don't have a
fingerprinted version.
Since: yesod-static-1.5.3
staticFilesMap :: FilePath -> Map FilePath FilePath -> Q [Dec] Source #
Similar to staticFilesList, but takes a mapping of
unmunged names to fingerprinted file names.
Since: yesod-static-1.5.3
publicFiles :: FilePath -> Q [Dec] Source #
Same as staticFiles, but doesn't append an ETag to the
query string.
Using publicFiles will speed up the compilation, since there
won't be any need for hashing files during compile-time.
However, since the ETag ceases to be part of the URL, the
Static subsite won't be able to set the expire date too far
on the future. Browsers still will be able to cache the
contents, however they'll need send a request to the server to
see if their copy is up-to-date.
staticFilesList :: FilePath -> [FilePath] -> Q [Dec] Source #
Same as staticFiles, but takes an explicit list of files
to create identifiers for. The files path given are relative
to the static folder. For example, to create routes for the
files "static/js/jquery.js" and
"static/css/normalize.css", you would use:
staticFilesList "static" ["js/jquery.js", "css/normalize.css"]
This can be useful when you have a very large number of static files, but only need to refer to a few of them from Haskell.
staticFiles :: FilePath -> Q [Dec] Source #
Template Haskell function that automatically creates routes for all of your static files.
For example, if you used
staticFiles "static/"
and you had files "static/style.css" and
"static/js/script.js", then the following top-level
definitions would be created:
style_css = StaticRoute ["style.css"] [] js_script_js = StaticRoute ["js", "script.js"] []
Note that dots (.), dashes (-) and slashes (/) are
replaced by underscores (_) to create valid Haskell
identifiers.
embed :: FilePath -> Q Exp Source #
Produce a Static based on embedding all of the static files' contents in the
executable at compile time.
You should use Yesod.EmbeddedStatic instead, it is much more powerful.
Nota Bene: if you replace the scaffolded static call in Settings/StaticFiles.hs
you will need to change the scaffolded addStaticContent. Otherwise, some of your
assets will be 404'ed. This is because by default yesod will generate compile those
assets to static/tmp which for static is fine since they are served out of the
directory itself. With embedded static, that will not work.
You can easily change addStaticContent to _ _ _ -> return Nothing as a workaround.
This will cause yesod to embed those assets into the generated HTML file itself.
staticDevel :: FilePath -> IO Static Source #
Same as static, but does not assumes that the files do not
change and checks their modification time whenever a request
is made.
static :: FilePath -> IO Static Source #
Produce a default value of Static for a given file
folder.
Does not have index files or directory listings. The static files' contents must not change, however new files can be added.
Type used for the subsite with static contents.
Constructors
| Static StaticSettings |
Instances
| ParseRoute Static | |
Defined in Yesod.Static | |
| RenderRoute Static | |
| YesodSubDispatch Static master | |
Defined in Yesod.Static Methods yesodSubDispatch :: YesodSubRunnerEnv Static master -> Application # | |
| Eq (Route Static) | |
| Read (Route Static) | |
| Show (Route Static) | |
| data Route Static | |
Defined in Yesod.Static | |
type StaticRoute = Route Static Source #
data CombineSettings Source #
Data type for holding all settings for combining files.
This data type is a settings type. For more information, see:
http://www.yesodweb.com/book/settings-types
Since 1.2.0
Instances
| Default CombineSettings | |
Defined in Yesod.Static Methods def :: CombineSettings # | |
zipWith6 :: Zip6 f => (a -> b -> c -> d -> e -> g -> h) -> f a -> f b -> f c -> f d -> f e -> f g -> f h #
zipWith7 :: Zip7 f => (a -> b -> c -> d -> e -> g -> h -> i) -> f a -> f b -> f c -> f d -> f e -> f g -> f h -> f i #
preEscapedToMarkup :: ToMarkup a => a -> Markup #