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. freq :: Histogram -> Histogram

    numhask-space NumHask.Space.Histogram

    normalize a histogram

    \h -> sum (values $ freq h) == one
    
    >>> freq $ fill [0,50,100] [0..99]
    Histogram {cuts = [0.0,50.0,100.0], values = fromList [(1,0.5),(2,0.5)]}
    

  2. requireExtensions :: String -> [[Extension]] -> Q ()

    optics-th Optics.TH.Internal.Utils

    Pass in a list of lists of extensions, where any of the given extensions will satisfy it. For example, you might need either GADTs or ExistentialQuantification, so you'd write:

    requireExtensions [[GADTs, ExistentialQuantification]]
    
    But if you need TypeFamilies and MultiParamTypeClasses, then you'd write:
    requireExtensions [[TypeFamilies], [MultiParamTypeClasses]]
    

  3. requireExtensionsForFields :: Q ()

    optics-th Optics.TH.Internal.Utils

    No documentation available.

  4. requireExtensionsForLabels :: Q ()

    optics-th Optics.TH.Internal.Utils

    No documentation available.

  5. copyUnlessEq :: PersistField typ => EntityField record typ -> typ -> HandleUpdateCollision record

    persistent-postgresql Database.Persist.Postgresql

    Copy the field into the database only if the field is not equal to the provided value. This is useful to avoid copying weird nullary data into the database. The resulting HandleUpdateCollision type is useful for the upsertMany function. @since 2.12.1.0

  6. excludeNotEqualToOriginal :: (PersistField typ, PersistEntity rec) => EntityField rec typ -> Filter rec

    persistent-postgresql Database.Persist.Postgresql

    Exclude any record field if it doesn't match the filter record. Used only in upsertWhere and upsertManyWhere TODO: we could probably make a sum type for the Filter record that's passed into the upsertWhere and upsertManyWhere methods that has similar behavior to the HandleCollisionUpdate type.

  7. executeQQ :: QuasiQuoter

    persistent-qq Database.Persist.Sql.Raw.QQ

    Analoguous to rawExecute

  8. subsequences :: [a] -> [[a]]

    prelude-compat Data.List2010

    No documentation available.

  9. seq :: a -> b -> b

    prelude-compat Prelude2010

    The value of seq a b is bottom if a is bottom, and otherwise equal to b. In other words, it evaluates the first argument a to weak head normal form (WHNF). seq is usually introduced to improve performance by avoiding unneeded laziness. A note on evaluation order: the expression seq a b does not guarantee that a will be evaluated before b. The only guarantee given by seq is that the both a and b will be evaluated before seq returns a value. In particular, this means that b may be evaluated before a. If you need to guarantee a specific order of evaluation, you must use the function pseq from the "parallel" package.

  10. sequence :: (Traversable t, Monad m) => t (m a) -> m (t a)

    prelude-compat Prelude2010

    Evaluate each monadic action in the structure from left to right, and collect the results. For a version that ignores the results see sequence_.

    Examples

    Basic usage: The first two examples are instances where the input and and output of sequence are isomorphic.
    >>> sequence $ Right [1,2,3,4]
    [Right 1,Right 2,Right 3,Right 4]
    
    >>> sequence $ [Right 1,Right 2,Right 3,Right 4]
    Right [1,2,3,4]
    
    The following examples demonstrate short circuit behavior for sequence.
    >>> sequence $ Left [1,2,3,4]
    Left [1,2,3,4]
    
    >>> sequence $ [Left 0, Right 1,Right 2,Right 3,Right 4]
    Left 0
    

Page 499 of many | Previous | Next