Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

Exact lookup

1. pattern JulianYearMonthDay :: Year -> MonthOfYear -> DayOfMonth -> Day

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

   Bidirectional abstract constructor for the proleptic Julian calendar. Invalid values will be clipped to the correct range, month first, then day.

2. addJulianYearsClip :: Integer -> Day -> Day

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

   Add years, matching month and day, with Feb 29th clipped to Feb 28th if necessary. For instance, 2004-02-29 + 2 years = 2006-02-28.

3. 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.

4. 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).

5. 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

6. showJulianYearAndDay :: Day -> String

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

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

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

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

   Convert to proleptic Julian year and day format.

8. 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.

   any ≡ iany . const
   

9. 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
   

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

    Cabal-syntax	Distribution.Compat.Parsing

    No documentation available.

Page 130 of many | Previous | Next