Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

  1. attrListInsertBefore :: (HasCallStack, MonadIO m) => AttrList -> Attribute -> m ()

    gi-pango GI.Pango.Structs.AttrList

    Insert the given attribute into the PangoAttrList. It will be inserted before all other attributes with a matching startIndex.

  2. matrixTransformDistance :: (HasCallStack, MonadIO m) => Maybe Matrix -> Double -> Double -> m (Double, Double)

    gi-pango GI.Pango.Structs.Matrix

    Transforms the distance vector (dx,dy) by matrix. This is similar to matrixTransformPoint, except that the translation components of the transformation are ignored. The calculation of the returned vector is as follows: 

    dx2 = dx1 * xx + dy1 * xy;
dy2 = dx1 * yx + dy1 * yy;
    Affine transformations are position invariant, so the same vector always transforms to the same vector. If (x1,y1) transforms to (x2,y2) then (x1+dx1,y1+dy1) will transform to (x1+dx2,y1+dy2) for all values of x1 and x2. Since: 1.16

  3. matrixTransformPixelRectangle :: (HasCallStack, MonadIO m) => Maybe Matrix -> Maybe Rectangle -> m ()

    gi-pango GI.Pango.Structs.Matrix

    First transforms the rect using matrix, then calculates the bounding box of the transformed rectangle. This function is useful for example when you want to draw a rotated pangoLayout to an image buffer, and want to know how large the image should be and how much you should shift the layout when rendering. For better accuracy, you should use matrixTransformRectangle on original rectangle in Pango units and convert to pixels afterward using [funcextentsToPixels]'s first argument. Since: 1.16

  4. matrixTransformPoint :: (HasCallStack, MonadIO m) => Maybe Matrix -> Double -> Double -> m (Double, Double)

    gi-pango GI.Pango.Structs.Matrix

    Transforms the point (x, y) by matrix. Since: 1.16

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

    massiv Data.Massiv.Array

    Same as imapIO but with arguments flipped.

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

    massiv Data.Massiv.Array

    Same as imapIO_ but with arguments flipped.

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

    massiv Data.Massiv.Array

    Same as forM, except with an index aware action.

  8. iforM_ :: (Source r a, Index ix, Monad m) => Array r ix a -> (ix -> a -> m b) -> m ()

    massiv Data.Massiv.Array

    Just like imapM_, except with flipped arguments.

  9. iforSchedulerM_ :: (Index ix, Source r e, MonadPrimBase s m) => Scheduler s () -> Array r ix e -> (ix -> e -> m a) -> m ()

    massiv Data.Massiv.Array

    Same as imapM_, but will use the supplied scheduler.

  10. iforWS :: forall r ix b r' a s m . (Source r' a, Manifest r b, Index ix, MonadUnliftIO m, PrimMonad m) => WorkerStates s -> Array r' ix a -> (ix -> a -> s -> m b) -> m (Array r ix b)

    massiv Data.Massiv.Array

    Same as imapWS, but with source array and mapping action arguments flipped.

Page 632 of many | Previous | Next