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. getFontMapItemType :: (MonadIO m, IsFontMap o) => o -> m GType

   gi-pango	GI.Pango.Objects.FontMap

   Get the value of the “item-type” property. When overloading is enabled, this is equivalent to

   get fontMap #itemType
   

2. getFontMapNItems :: (MonadIO m, IsFontMap o) => o -> m Word32

   gi-pango	GI.Pango.Objects.FontMap

   Get the value of the “n-items” property. When overloading is enabled, this is equivalent to

   get fontMap #nItems
   

3. toFontMap :: (MonadIO m, IsFontMap o) => o -> m FontMap

   gi-pango	GI.Pango.Objects.FontMap

   Cast to FontMap, for types for which this is known to be safe. For general casts, use castTo.

4. glyphItemApplyAttrs :: (HasCallStack, MonadIO m) => GlyphItem -> Text -> AttrList -> m [GlyphItem]

   gi-pango	GI.Pango.Structs.GlyphItem

   Splits a shaped item (PangoGlyphItem) into multiple items based on an attribute list. The idea is that if you have attributes that don't affect shaping, such as color or underline, to avoid affecting shaping, you filter them out (attrListFilter), apply the shaping process and then reapply them to the result using this function. All attributes that start or end inside a cluster are applied to that cluster; for instance, if half of a cluster is underlined and the other-half strikethrough, then the cluster will end up with both underline and strikethrough attributes. In these cases, it may happen that item->extra_attrs for some of the result items can have multiple attributes of the same type. This function takes ownership of glyphItem; it will be reused as one of the elements in the list. Since: 1.2

5. itemApplyAttrs :: (HasCallStack, MonadIO m) => Item -> AttrIterator -> m ()

   gi-pango	GI.Pango.Structs.Item

   Add attributes to a PangoItem. The idea is that you have attributes that don't affect itemization, such as font features, so you filter them out using attrListFilter, itemize your text, then reapply the attributes to the resulting items using this function. The iter should be positioned before the range of the item, and will be advanced past it. This function is meant to be called in a loop over the items resulting from itemization, while passing the iter to each call. Since: 1.44

6. concatMap :: (a -> NonEmpty b) -> Infinite a -> Infinite b

   infinite-list	Data.List.Infinite

   First map every element, then concat. The peculiar type with NonEmpty is to guarantee that concatMap is productive and results in an infinite list. Otherwise the concatenation of infinitely many [b] could still be a finite list.

7. imap :: forall r ix e a . (Index ix, Source r e) => (ix -> e -> a) -> Array r ix e -> Array D ix a

   massiv	Data.Massiv.Array

   Map an index aware function over an array

8. imapIO :: forall r ix b r' a m . (Size r', Load r' ix a, Manifest r b, MonadUnliftIO m) => (ix -> a -> m b) -> Array r' ix a -> m (Array r ix b)

   massiv	Data.Massiv.Array

   Same as mapIO but map an index aware action instead. Respects computation strategy.

9. imapIO_ :: forall r ix e a m . (Load r ix e, MonadUnliftIO m) => (ix -> e -> m a) -> Array r ix e -> m ()

   massiv	Data.Massiv.Array

   Same as mapIO_, but map an index aware action instead.

10. imapM :: forall r ix b r' a m . (Source r' a, Manifest r b, Index ix, Monad m) => (ix -> a -> m b) -> Array r' ix a -> m (Array r ix b)

    massiv	Data.Massiv.Array

    Map an index aware monadic action over an array sequentially.

Page 567 of many | Previous | Next