Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. class GObjectClass o => FontMapClass o

   pango	Graphics.Rendering.Pango.Font

   No documentation available.

2. pangoFontMapListFamilies :: FontMap -> IO [FontFamily]

   pango	Graphics.Rendering.Pango.Font

   Ask for the different font families that a particular back-end supports.

   • The FontMap can be acquired by calling cairoFontMapGetDefault.

3. foldMapU :: Monoid m => (a -> m) -> MaxQueue a -> m

   pqueue	Data.PQueue.Max

   Unordered monoidal fold on a priority queue.

4. foldMapU :: Monoid m => (a -> m) -> MinQueue a -> m

   pqueue	Data.PQueue.Min

   Unordered monoidal fold on a priority queue.

5. foldMapWithKeyU :: Monoid m => (k -> a -> m) -> MaxPQueue k a -> m

   pqueue	Data.PQueue.Prio.Max

   An unordered monoidal fold over the elements of the queue, in no particular order.

6. foldMapWithKeyU :: Monoid m => (k -> a -> m) -> MinPQueue k a -> m

   pqueue	Data.PQueue.Prio.Min

   An unordered monoidal fold over the elements of the queue, in no particular order.

7. ErrorIOMmap :: Error

   sqlite-simple	Database.SQLite.Simple

   No documentation available.

8. ErrorIOShmMap :: Error

   sqlite-simple	Database.SQLite.Simple

   No documentation available.

9. module Text.Trifecta.Util.IntervalMap

   Interval maps implemented using the FingerTree type, following section 4.8 of

   • Ralf Hinze and Ross Paterson, "Finger trees: a simple general-purpose data structure", Journal of Functional Programming 16:2 (2006) pp 197-217. http://www.soi.city.ac.uk/~ross/papers/FingerTree.html
   An amortized running time is given for each operation, with n referring to the size of the priority queue. These bounds hold even in a persistent (shared) setting. Note: Many of these operations have the same names as similar operations on lists in the Prelude. The ambiguity may be resolved using either qualification or the hiding clause. Unlike Data.IntervalMap.FingerTree, this version sorts things so that the largest interval from a given point comes first. This way if you have nested intervals, you get the outermost interval before the contained intervals.

10. newtype IntervalMap v a

    trifecta	Text.Trifecta.Util.IntervalMap

    Map of closed intervals, possibly with duplicates. The Foldable and Traversable instances process the intervals in lexicographical order.

Page 622 of many | Previous | Next