Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. deriveAll0Options :: Options -> Name -> Q [Dec]

    generic-deriving Generics.Deriving.TH

    Like deriveAll0, but takes an Options argument.

  2. deriveAll1 :: Name -> Q [Dec]

    generic-deriving Generics.Deriving.TH

    Given the type and the name (as string) for the type to derive, generate the Data instance, the Constructor instances, the Selector instances, and the Representable1 instance.

  3. deriveAll1Options :: Options -> Name -> Q [Dec]

    generic-deriving Generics.Deriving.TH

    Like deriveAll1, but takes an Options argument.

  4. lookupAll :: Routable k => AddrRange k -> IPRTable k a -> [(AddrRange k, a)]

    iproute Data.IP.RouteTable

    lookupAll is a version of lookup that returns all entries matching the given key, not just the longest match.

    >>> :set -XOverloadedStrings
    
    >>> let rt = fromList ([("192.168.0.0/24", 1), ("10.10.0.0/16", 2), ("10.0.0.0/8", 3)] :: [(AddrRange IPv4, Int)])
    
    >>> lookupAll "127.0.0.1" rt
    []
    
    >>> lookupAll "192.168.0.1" rt
    [(192.168.0.0/24,1)]
    
    >>> lookupAll "10.10.0.1" rt
    [(10.10.0.0/16,2),(10.0.0.0/8,3)]
    

  5. lookupAll :: Routable k => AddrRange k -> IPRTable k a -> [(AddrRange k, a)]

    iproute Data.IP.RouteTable.Internal

    lookupAll is a version of lookup that returns all entries matching the given key, not just the longest match.

    >>> :set -XOverloadedStrings
    
    >>> let rt = fromList ([("192.168.0.0/24", 1), ("10.10.0.0/16", 2), ("10.0.0.0/8", 3)] :: [(AddrRange IPv4, Int)])
    
    >>> lookupAll "127.0.0.1" rt
    []
    
    >>> lookupAll "192.168.0.1" rt
    [(192.168.0.0/24,1)]
    
    >>> lookupAll "10.10.0.1" rt
    [(10.10.0.0/16,2),(10.0.0.0/8,3)]
    

  6. parallel :: Epsilon a => Plucker a -> Plucker a -> Bool

    linear Linear.Plucker

    Checks if two lines are parallel.

  7. iallOf :: forall k (is :: IxList) i s a . (Is k A_Fold, HasSingleIndex is i) => Optic' k is s a -> (i -> a -> Bool) -> s -> Bool

    optics-core Optics.IxFold

    Return whether or not all elements viewed through an IxFold satisfy a predicate, with access to the i. When you don't need access to the index then allOf is more flexible in what it accepts.

    allOf o ≡ iallOf o . const
    

  8. finally :: MonadUnliftIO m => m a -> IO () -> m a

    typed-process System.Process.Typed.Internal

    No documentation available.

  9. liftCallCC :: CallCC m (a, g) (b, g) -> CallCC (RandT g m) a b

    MonadRandom Control.Monad.Trans.Random.Lazy

    Uniform lifting of a callCC operation to the new monad. This version rolls back to the original state on entering the continuation.

  10. liftCallCC' :: CallCC m (a, g) (b, g) -> CallCC (RandT g m) a b

    MonadRandom Control.Monad.Trans.Random.Lazy

    In-situ lifting of a callCC operation to the new monad. This version uses the current state on entering the continuation. It does not satisfy the uniformity property (see Control.Monad.Signatures).

Page 357 of many | Previous | Next