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.

  1. _width :: DiagramOpts -> Maybe Int

    diagrams-lib Diagrams.Backend.CmdLine

    Final output width of diagram.

  2. width :: Lens' DiagramOpts (Maybe Int)

    diagrams-lib Diagrams.Backend.CmdLine

    No documentation available.

  3. boxGrid :: forall (v :: Type -> Type) n . (Traversable v, Additive v, Num n, Enum n) => n -> BoundingBox v n -> [Point v n]

    diagrams-lib Diagrams.BoundingBox

    boxGrid f box returns a grid of regularly spaced points inside the box, such that there are (1/f) points along each dimension. For example, for a 3D box with corners at (0,0,0) and (2,2,2), boxGrid 0.1 would yield a grid of approximately 1000 points (it might actually be 11^3 instead of 10^3) spaced 0.2 units apart.

  4. inside :: forall (v :: Type -> Type) n . (Additive v, Foldable v, Ord n) => BoundingBox v n -> BoundingBox v n -> Bool

    diagrams-lib Diagrams.BoundingBox

    Test whether the first bounding box is contained inside the second.

  5. inside' :: forall (v :: Type -> Type) n . (Additive v, Foldable v, Ord n) => BoundingBox v n -> BoundingBox v n -> Bool

    diagrams-lib Diagrams.BoundingBox

    Test whether the first bounding box is strictly contained inside the second.

  6. outside :: forall (v :: Type -> Type) n . (Additive v, Foldable v, Ord n) => BoundingBox v n -> BoundingBox v n -> Bool

    diagrams-lib Diagrams.BoundingBox

    Test whether the first bounding box lies outside the second (although they may intersect in their boundaries).

  7. outside' :: forall (v :: Type -> Type) n . (Additive v, Foldable v, Ord n) => BoundingBox v n -> BoundingBox v n -> Bool

    diagrams-lib Diagrams.BoundingBox

    Test whether the first bounding box lies strictly outside the second (they do not intersect at all).

  8. beside :: (Juxtaposable a, Semigroup a) => Vn a -> a -> a -> a

    diagrams-lib Diagrams.Combinators

    Place two monoidal objects (i.e. diagrams, paths, animations...) next to each other along the given vector. In particular, place the second object so that the vector points from the local origin of the first object to the local origin of the second object, at a distance so that their envelopes are just tangent. The local origin of the new, combined object is the local origin of the first object (unless the first object is the identity element, in which case the second object is returned unchanged). 

    besideEx = beside (r2 (20,30))
(circle 1 # fc orange)
(circle 1.5 # fc purple)
# showOrigin
# centerXY # pad 1.1
    Note that beside v is associative, so objects under beside v form a semigroup for any given vector v. In fact, they also form a monoid: mempty is clearly a right identity (beside v d1 mempty === d1), and there should also be a special case to make it a left identity, as described above. In older versions of diagrams, beside put the local origin of the result at the point of tangency between the two inputs. That semantics can easily be recovered by performing an alignment on the first input before combining. That is, if beside' denotes the old semantics, 
    beside' v x1 x2 = beside v (x1 # align v) x2
    To get something like beside v x1 x2 whose local origin is identified with that of x2 instead of x1, use beside (negateV v) x2 x1.

  9. data AdjustSide

    diagrams-lib Diagrams.Parametric.Adjust

    Which side of a segment, trail, or path should be adjusted?

  10. adjSide :: forall n f . Functor f => (AdjustSide -> f AdjustSide) -> AdjustOpts n -> f (AdjustOpts n)

    diagrams-lib Diagrams.Parametric.Adjust

    Which end(s) of the object should be adjusted?

Page 471 of many | Previous | Next