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.
concatMap :: (Storable a, Storable b) => (a -> Vector b) -> Vector a -> Vector bstorablevector Data.StorableVector Map a function over a Vector and concatenate the results
foldMap :: (Storable a, Monoid m) => (a -> m) -> Vector a -> mstorablevector Data.StorableVector This is like mconcat . map f, but in many cases the result of f will not be storable.
monoidConcatMap :: (Storable a, Monoid m) => (a -> m) -> Vector a -> mstorablevector Data.StorableVector Deprecated: Use foldMap instead.
foldMap :: (Storable a, Monoid m) => (a -> m) -> Vector a -> mstorablevector Data.StorableVector.Lazy No documentation available.
monoidConcatMap :: (Storable a, Monoid m) => (a -> m) -> Vector a -> mstorablevector Data.StorableVector.Lazy Deprecated: Use foldMap instead.
foldMap :: (Size size, Storable a, Monoid m) => (a -> m) -> Vector size a -> mstorablevector Data.StorableVector.Lazy.Typed No documentation available.
type
LeapSecondMap = Day -> Maybe Inttime-compat Data.Time.Clock.TAI.Compat TAI - UTC during this day. No table is provided, as any program compiled with it would become out of date in six months.
-
Linear maps. Unlike Transformations these are not restricted to the same space. In practice these are used for projections in Diagrams.ThreeD.Projection. Unless you want to work with projections you're probably better off using Transform. Currently only path-like things can be projected. In the future we hope to support projecting diagrams.
data
AffineMap (v :: Type -> Type) (u :: Type -> Type) ndiagrams-lib Diagrams.LinearMap Affine linear maps. Unlike Transformation these do not have to be invertible so we can map between spaces.
AffineMap :: LinearMap v u n -> u n -> AffineMap (v :: Type -> Type) (u :: Type -> Type) ndiagrams-lib Diagrams.LinearMap No documentation available.