Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

Exact lookup

1. pathCentroid :: forall (v :: Type -> Type) n . (Metric v, OrderedField n) => Path v n -> Point v n

   diagrams-lib	Diagrams.Path

   Compute the centroid of a path (i.e. the average location of its vertices; see pathVertices).

2. centroid :: forall (v :: Type -> Type) n . (Additive v, Fractional n) => [Point v n] -> Point v n

   diagrams-lib	Diagrams.Points

   The centroid of a set of n points is their sum divided by n. Returns the origin for an empty list of points.

3. _Void :: forall s a p f . (Choice p, Applicative f) => p a (f Void) -> p s (f s)

   diagrams-lib	Diagrams.Prelude

   Void is a logically uninhabited data type. This is a Prism that will always fail to match.

4. alongside :: LensLike (AlongsideLeft f b') s t a b -> LensLike (AlongsideRight f t) s' t' a' b' -> LensLike f (s, s') (t, t') (a, a') (b, b')

   diagrams-lib	Diagrams.Prelude

   alongside makes a Lens from two other lenses or a Getter from two other getters by executing them on their respective halves of a product.

   >>> (Left a, Right b)^.alongside chosen chosen
   (a,b)
   

   >>> (Left a, Right b) & alongside chosen chosen .~ (c,d)
   (Left c,Right d)
   

   alongside :: Lens   s t a b -> Lens   s' t' a' b' -> Lens   (s,s') (t,t') (a,a') (b,b')
   alongside :: Getter s   a   -> Getter s'    a'    -> Getter (s,s')        (a,a')
   

5. aside :: APrism s t a b -> Prism (e, s) (e, t) (e, a) (e, b)

   diagrams-lib	Diagrams.Prelude

   Use a Prism to work over part of a structure.

6. classIdFields :: LensRules

   diagrams-lib	Diagrams.Prelude

   Field rules for fields whose names are to be used verbatim, with no prefixes, no underscores, no transformations of any kind.

7. classIdNamer :: FieldNamer

   diagrams-lib	Diagrams.Prelude

   A FieldNamer for classIdFields.

8. darkorchid :: (Ord a, Floating a) => Colour a

   diagrams-lib	Diagrams.Prelude

   No documentation available.

9. makeFieldsId :: Name -> DecsQ

   diagrams-lib	Diagrams.Prelude

   Generate overloaded field accessors, using exactly the same names as the underlying fields. Intended for use with the NoFieldSelectors and DuplicateRecordFields language extensions. As an example:

   data Foo a  = Foo { x :: Int, y :: a }
   newtype Bar = Bar { x :: Char }
   makeFieldsId ''Foo
   makeFieldsId ''Bar
   

   will create classes

   class HasX s a | s -> a where
   x :: Lens' s a
   class HasY s a | s -> a where
   y :: Lens' s a
   

   together with instances

   instance HasX (Foo a) Int
   instance HasY (Foo a) a where
   instance HasX Bar Char where
   

   makeFieldsId = makeLensesWith classIdFields
   

10. mediumorchid :: (Ord a, Floating a) => Colour a

    diagrams-lib	Diagrams.Prelude

    No documentation available.

Page 472 of many | Previous | Next