Hoogle Search
Within LTS Haskell 24.58 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
diagrams-lib Diagrams.Trail Convert a list of fixed segments into a located trail. Note that this may lose information: it throws away the locations of all but the first FixedSegment. This does not matter precisely when each FixedSegment begins where the previous one ends. This is almost left inverse to fixTrail, that is, unfixTrail . fixTrail == id, except for the fact that unfixTrail will never yield a Loop. In the case of a loop, we instead have glueTrail . unfixTrail . fixTrail == id. On the other hand, it is not the case that fixTrail . unfixTrail == id since unfixTrail may lose information.
module Diagrams.Transform.
Matrix Functions for converting between Transformations and matricies.
splitPrimePrefix :: FactorialMonoid m => m -> Maybe (m, m)monoid-subclasses Data.Monoid.Factorial Splits the argument into its prime prefix and the remaining suffix. Returns Nothing for mempty.
splitPrimeSuffix :: FactorialMonoid m => m -> Maybe (m, m)monoid-subclasses Data.Monoid.Factorial Splits the argument into its prime suffix and the remaining prefix. Returns Nothing for mempty.
commonPrefix :: LeftGCDMonoid m => m -> m -> mmonoid-subclasses Data.Monoid.GCD No documentation available.
commonSuffix :: RightGCDMonoid m => m -> m -> mmonoid-subclasses Data.Monoid.GCD No documentation available.
stripCommonPrefix :: LeftGCDMonoid m => m -> m -> (m, m, m)monoid-subclasses Data.Monoid.GCD No documentation available.
stripCommonSuffix :: RightGCDMonoid m => m -> m -> (m, m, m)monoid-subclasses Data.Monoid.GCD No documentation available.
stripPrefixOverlap :: OverlappingGCDMonoid m => m -> m -> mmonoid-subclasses Data.Monoid.GCD No documentation available.
stripSuffixOverlap :: OverlappingGCDMonoid m => m -> m -> mmonoid-subclasses Data.Monoid.GCD No documentation available.