Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

  1. addJulianYearsRollOver :: Integer -> Day -> Day

    time-compat Data.Time.Calendar.Julian.Compat

    Add years, matching month and day, with Feb 29th rolled over to Mar 1st if necessary. For instance, 2004-02-29 + 2 years = 2006-03-01.

  2. fromJulianYearAndDay :: Year -> DayOfYear -> Day

    time-compat Data.Time.Calendar.Julian.Compat

    Convert from proleptic Julian year and day format. Invalid day numbers will be clipped to the correct range (1 to 365 or 366).

  3. fromJulianYearAndDayValid :: Year -> DayOfYear -> Maybe Day

    time-compat Data.Time.Calendar.Julian.Compat

    Convert from proleptic Julian year and day format. Invalid day numbers will return Nothing

  4. showJulianYearAndDay :: Day -> String

    time-compat Data.Time.Calendar.Julian.Compat

    Show in proleptic Julian year and day format (yyyy-ddd)

  5. toJulianYearAndDay :: Day -> (Year, DayOfYear)

    time-compat Data.Time.Calendar.Julian.Compat

    Convert to proleptic Julian year and day format.

  6. iany :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Bool

    diagrams-lib Diagrams.Prelude

    Return whether or not any element in a container satisfies a predicate, with access to the index i. When you don't need access to the index then any is more flexible in what it accepts.

    anyiany . const
    

  7. ianyOf :: IndexedGetting i Any s a -> (i -> a -> Bool) -> s -> Bool

    diagrams-lib Diagrams.Prelude

    Return whether or not any element viewed through an IndexedFold or IndexedTraversal satisfy a predicate, with access to the i. When you don't need access to the index then anyOf is more flexible in what it accepts.

    anyOf l ≡ ianyOf l . const
    
    ianyOf :: IndexedGetter i s a     -> (i -> a -> Bool) -> s -> Bool
    ianyOf :: IndexedFold i s a       -> (i -> a -> Bool) -> s -> Bool
    ianyOf :: IndexedLens' i s a      -> (i -> a -> Bool) -> s -> Bool
    ianyOf :: IndexedTraversal' i s a -> (i -> a -> Bool) -> s -> Bool
    

  8. many :: Alternative f => f a -> f [a]

    Cabal-syntax Distribution.Compat.Parsing

    No documentation available.

  9. manyTill :: Alternative m => m a -> m end -> m [a]

    Cabal-syntax Distribution.Compat.Parsing

    manyTill p end applies parser p zero or more times until parser end succeeds. Returns the list of values returned by p. This parser can be used to scan comments:

    simpleComment   = do{ string "<!--"
    ; manyTill anyChar (try (string "-->"))
    }
    
    Note the overlapping parsers anyChar and string "-->", and therefore the use of the try combinator.

  10. skipMany :: Parsing m => m a -> m ()

    Cabal-syntax Distribution.Compat.Parsing

    A version of many that discards its input. Specialized because it can often be implemented more cheaply.

Page 129 of many | Previous | Next