Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

1. glyphWidth :: IsFont f => f -> FontSize -> GlyphCode -> PDFFloat

   HPDF	Graphics.PDF.Fonts.Font

   No documentation available.

2. widthData :: FontStructure -> Map GlyphCode GlyphSize

   HPDF	Graphics.PDF.Fonts.FontTypes

   No documentation available.

3. setWidth :: MonadPath m => PDFFloat -> m ()

   HPDF	Graphics.PDF.Shapes

   Set pen width

4. textWidth :: PDFFont -> Text -> PDFFloat

   HPDF	Graphics.PDF.Text

   No documentation available.

5. boxWidth :: Box a => a -> PDFFloat

   HPDF	Graphics.PDF.Typesetting

   Box width

6. containerWidth :: Container ps s -> PDFFloat

   HPDF	Graphics.PDF.Typesetting

   Get the width of the container

7. lineWidth :: ParagraphStyle a s => a -> PDFFloat -> Int -> PDFFloat

   HPDF	Graphics.PDF.Typesetting

   Width of the line of the paragraph

8. penWidth :: TextStyle -> !PDFFloat

   HPDF	Graphics.PDF.Typesetting

   No documentation available.

9. class Semigroup a => Monoid a

   HaTeX	Text.LaTeX.Base

   The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following:

   • Right identity x <> mempty = x
   • Left identity mempty <> x = x
   • Associativity x <> (y <> z) = (x <> y) <> z (Semigroup law)
   • Concatenation mconcat = foldr (<>) mempty
   You can alternatively define mconcat instead of mempty, in which case the laws are:
   • Unit mconcat (pure x) = x
   • Multiplication mconcat (join xss) = mconcat (fmap mconcat xss)
   • Subclass mconcat (toList xs) = sconcat xs
   The method names refer to the monoid of lists under concatenation, but there are many other instances. Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define newtypes and make those instances of Monoid, e.g. Sum and Product. NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.

10. class Semigroup a => Monoid a

    HaTeX	Text.LaTeX.Base.Class

    The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following:

    • Right identity x <> mempty = x
    • Left identity mempty <> x = x
    • Associativity x <> (y <> z) = (x <> y) <> z (Semigroup law)
    • Concatenation mconcat = foldr (<>) mempty
    You can alternatively define mconcat instead of mempty, in which case the laws are:
    • Unit mconcat (pure x) = x
    • Multiplication mconcat (join xss) = mconcat (fmap mconcat xss)
    • Subclass mconcat (toList xs) = sconcat xs
    The method names refer to the monoid of lists under concatenation, but there are many other instances. Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define newtypes and make those instances of Monoid, e.g. Sum and Product. NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.

Page 1441 of many | Previous | Next