Copyright	(c) Adam Conner-Sax 2019
License	BSD-3-Clause
Maintainer	adam_conner_sax@yahoo.com
Stability	experimental
Safe Haskell	None
Language	Haskell2010

Knit.Report.Input.Visualization.Diagrams

Contents

Add Diagrams Inputs
re-exports

Description

Functions to Diagrams (from the Diagrams library) to the current Pandoc document.

Synopsis

addDiagramAsSVG :: (PandocEffects effs, Member ToPandoc effs, Member UnusedId effs) => Maybe Text -> Maybe Text -> Double -> Double -> QDiagram SVG V2 Double Any -> Sem effs Text
(<$) :: Functor f => a -> f b -> f a
class Functor f => Applicative (f :: Type -> Type) where
- pure :: a -> f a
- (<*>) :: f (a -> b) -> f a -> f b
- liftA2 :: (a -> b -> c) -> f a -> f b -> f c
- (*>) :: f a -> f b -> f b
- (<*) :: f a -> f b -> f a
class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where
- traverse :: Applicative f => (a -> f b) -> t a -> f (t b)
class Semigroup a where
- (<>) :: a -> a -> a
- sconcat :: NonEmpty a -> a
- stimes :: Integral b => b -> a -> a
class Contravariant (f :: Type -> Type) where
- contramap :: (a -> b) -> f b -> f a
- (>$) :: b -> f b -> f a
option :: b -> (a -> b) -> Option a -> b
mtimesDefault :: (Integral b, Monoid a) => b -> a -> a
diff :: Semigroup m => m -> Endo m
cycle1 :: Semigroup m => m -> m
newtype Min a = Min {
- getMin :: a
}
newtype Max a = Max {
- getMax :: a
}
data Arg a b = Arg a b
type ArgMin a b = Min (Arg a b)
type ArgMax a b = Max (Arg a b)
newtype First a = First {
- getFirst :: a
}
newtype Last a = Last {
- getLast :: a
}
newtype WrappedMonoid m = WrapMonoid {
- unwrapMonoid :: m
}
newtype Option a = Option {
- getOption :: Maybe a
}
class Bifunctor (p :: Type -> Type -> Type) where
- bimap :: (a -> b) -> (c -> d) -> p a c -> p b d
newtype Identity a = Identity {
- runIdentity :: a
}
newtype Const a (b :: k) :: forall k. Type -> k -> Type = Const {
- getConst :: a
}
stimesMonoid :: (Integral b, Monoid a) => b -> a -> a
stimesIdempotent :: Integral b => b -> a -> a
newtype Dual a = Dual {
- getDual :: a
}
newtype Endo a = Endo {
- appEndo :: a -> a
}
newtype All = All {
- getAll :: Bool
}
newtype Any = Any {
- getAny :: Bool
}
newtype Sum a = Sum {
- getSum :: a
}
newtype Product a = Product {
- getProduct :: a
}
(&) :: a -> (a -> b) -> b
(<&>) :: Functor f => f a -> (a -> b) -> f b
(<$>) :: Functor f => (a -> b) -> f a -> f b
liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d
liftA :: Applicative f => (a -> b) -> f a -> f b
stimesIdempotentMonoid :: (Integral b, Monoid a) => b -> a -> a
class Default a where
- def :: a
alphaChannel :: AlphaColour a -> a
alphaColourConvert :: (Fractional b, Real a) => AlphaColour a -> AlphaColour b
black :: Num a => Colour a
blend :: (Num a, AffineSpace f) => a -> f a -> f a -> f a
colourConvert :: (Fractional b, Real a) => Colour a -> Colour b
dissolve :: Num a => a -> AlphaColour a -> AlphaColour a
opaque :: Num a => Colour a -> AlphaColour a
transparent :: Num a => AlphaColour a
withOpacity :: Num a => Colour a -> a -> AlphaColour a
data AlphaColour a
data Colour a
class ColourOps (f :: Type -> Type) where
- darken :: Num a => a -> f a -> f a
data family MVector s a :: Type
data family Vector a :: Type
sRGBBounded :: (Ord b, Floating b, Integral a, Bounded a) => a -> a -> a -> Colour b
data RGB a = RGB {
- channelRed :: !a
- channelGreen :: !a
- channelBlue :: !a
}
toSRGBBounded :: (RealFrac b, Floating b, Integral a, Bounded a) => Colour b -> RGB a
class Profunctor (p :: Type -> Type -> Type) where
- dimap :: (a -> b) -> (c -> d) -> p b c -> p a d
- lmap :: (a -> b) -> p b c -> p a c
- rmap :: (b -> c) -> p a b -> p a c
aliceblue :: (Ord a, Floating a) => Colour a
antiquewhite :: (Ord a, Floating a) => Colour a
aqua :: (Ord a, Floating a) => Colour a
aquamarine :: (Ord a, Floating a) => Colour a
azure :: (Ord a, Floating a) => Colour a
beige :: (Ord a, Floating a) => Colour a
bisque :: (Ord a, Floating a) => Colour a
blanchedalmond :: (Ord a, Floating a) => Colour a
blue :: (Ord a, Floating a) => Colour a
blueviolet :: (Ord a, Floating a) => Colour a
brown :: (Ord a, Floating a) => Colour a
burlywood :: (Ord a, Floating a) => Colour a
cadetblue :: (Ord a, Floating a) => Colour a
chartreuse :: (Ord a, Floating a) => Colour a
chocolate :: (Ord a, Floating a) => Colour a
coral :: (Ord a, Floating a) => Colour a
cornflowerblue :: (Ord a, Floating a) => Colour a
cornsilk :: (Ord a, Floating a) => Colour a
crimson :: (Ord a, Floating a) => Colour a
cyan :: (Ord a, Floating a) => Colour a
darkblue :: (Ord a, Floating a) => Colour a
darkcyan :: (Ord a, Floating a) => Colour a
darkgoldenrod :: (Ord a, Floating a) => Colour a
darkgray :: (Ord a, Floating a) => Colour a
darkgreen :: (Ord a, Floating a) => Colour a
darkgrey :: (Ord a, Floating a) => Colour a
darkkhaki :: (Ord a, Floating a) => Colour a
darkmagenta :: (Ord a, Floating a) => Colour a
darkolivegreen :: (Ord a, Floating a) => Colour a
darkorange :: (Ord a, Floating a) => Colour a
darkorchid :: (Ord a, Floating a) => Colour a
darkred :: (Ord a, Floating a) => Colour a
darksalmon :: (Ord a, Floating a) => Colour a
darkseagreen :: (Ord a, Floating a) => Colour a
darkslateblue :: (Ord a, Floating a) => Colour a
darkslategray :: (Ord a, Floating a) => Colour a
darkslategrey :: (Ord a, Floating a) => Colour a
darkturquoise :: (Ord a, Floating a) => Colour a
darkviolet :: (Ord a, Floating a) => Colour a
deeppink :: (Ord a, Floating a) => Colour a
deepskyblue :: (Ord a, Floating a) => Colour a
dimgray :: (Ord a, Floating a) => Colour a
dimgrey :: (Ord a, Floating a) => Colour a
dodgerblue :: (Ord a, Floating a) => Colour a
firebrick :: (Ord a, Floating a) => Colour a
floralwhite :: (Ord a, Floating a) => Colour a
forestgreen :: (Ord a, Floating a) => Colour a
fuchsia :: (Ord a, Floating a) => Colour a
gainsboro :: (Ord a, Floating a) => Colour a
ghostwhite :: (Ord a, Floating a) => Colour a
gold :: (Ord a, Floating a) => Colour a
goldenrod :: (Ord a, Floating a) => Colour a
gray :: (Ord a, Floating a) => Colour a
green :: (Ord a, Floating a) => Colour a
greenyellow :: (Ord a, Floating a) => Colour a
grey :: (Ord a, Floating a) => Colour a
honeydew :: (Ord a, Floating a) => Colour a
hotpink :: (Ord a, Floating a) => Colour a
indianred :: (Ord a, Floating a) => Colour a
indigo :: (Ord a, Floating a) => Colour a
ivory :: (Ord a, Floating a) => Colour a
khaki :: (Ord a, Floating a) => Colour a
lavender :: (Ord a, Floating a) => Colour a
lavenderblush :: (Ord a, Floating a) => Colour a
lawngreen :: (Ord a, Floating a) => Colour a
lemonchiffon :: (Ord a, Floating a) => Colour a
lightblue :: (Ord a, Floating a) => Colour a
lightcoral :: (Ord a, Floating a) => Colour a
lightcyan :: (Ord a, Floating a) => Colour a
lightgoldenrodyellow :: (Ord a, Floating a) => Colour a
lightgray :: (Ord a, Floating a) => Colour a
lightgreen :: (Ord a, Floating a) => Colour a
lightgrey :: (Ord a, Floating a) => Colour a
lightpink :: (Ord a, Floating a) => Colour a
lightsalmon :: (Ord a, Floating a) => Colour a
lightseagreen :: (Ord a, Floating a) => Colour a
lightskyblue :: (Ord a, Floating a) => Colour a
lightslategray :: (Ord a, Floating a) => Colour a
lightslategrey :: (Ord a, Floating a) => Colour a
lightsteelblue :: (Ord a, Floating a) => Colour a
lightyellow :: (Ord a, Floating a) => Colour a
lime :: (Ord a, Floating a) => Colour a
limegreen :: (Ord a, Floating a) => Colour a
linen :: (Ord a, Floating a) => Colour a
magenta :: (Ord a, Floating a) => Colour a
maroon :: (Ord a, Floating a) => Colour a
mediumaquamarine :: (Ord a, Floating a) => Colour a
mediumblue :: (Ord a, Floating a) => Colour a
mediumorchid :: (Ord a, Floating a) => Colour a
mediumpurple :: (Ord a, Floating a) => Colour a
mediumseagreen :: (Ord a, Floating a) => Colour a
mediumslateblue :: (Ord a, Floating a) => Colour a
mediumspringgreen :: (Ord a, Floating a) => Colour a
mediumturquoise :: (Ord a, Floating a) => Colour a
mediumvioletred :: (Ord a, Floating a) => Colour a
midnightblue :: (Ord a, Floating a) => Colour a
mintcream :: (Ord a, Floating a) => Colour a
mistyrose :: (Ord a, Floating a) => Colour a
moccasin :: (Ord a, Floating a) => Colour a
navajowhite :: (Ord a, Floating a) => Colour a
navy :: (Ord a, Floating a) => Colour a
oldlace :: (Ord a, Floating a) => Colour a
olive :: (Ord a, Floating a) => Colour a
olivedrab :: (Ord a, Floating a) => Colour a
orange :: (Ord a, Floating a) => Colour a
orangered :: (Ord a, Floating a) => Colour a
orchid :: (Ord a, Floating a) => Colour a
palegoldenrod :: (Ord a, Floating a) => Colour a
palegreen :: (Ord a, Floating a) => Colour a
paleturquoise :: (Ord a, Floating a) => Colour a
palevioletred :: (Ord a, Floating a) => Colour a
papayawhip :: (Ord a, Floating a) => Colour a
peachpuff :: (Ord a, Floating a) => Colour a
peru :: (Ord a, Floating a) => Colour a
pink :: (Ord a, Floating a) => Colour a
plum :: (Ord a, Floating a) => Colour a
powderblue :: (Ord a, Floating a) => Colour a
purple :: (Ord a, Floating a) => Colour a
readColourName :: (MonadFail m, Monad m, Ord a, Floating a) => String -> m (Colour a)
red :: (Ord a, Floating a) => Colour a
rosybrown :: (Ord a, Floating a) => Colour a
royalblue :: (Ord a, Floating a) => Colour a
saddlebrown :: (Ord a, Floating a) => Colour a
salmon :: (Ord a, Floating a) => Colour a
sandybrown :: (Ord a, Floating a) => Colour a
seagreen :: (Ord a, Floating a) => Colour a
seashell :: (Ord a, Floating a) => Colour a
sienna :: (Ord a, Floating a) => Colour a
silver :: (Ord a, Floating a) => Colour a
skyblue :: (Ord a, Floating a) => Colour a
slateblue :: (Ord a, Floating a) => Colour a
slategray :: (Ord a, Floating a) => Colour a
slategrey :: (Ord a, Floating a) => Colour a
snow :: (Ord a, Floating a) => Colour a
springgreen :: (Ord a, Floating a) => Colour a
steelblue :: (Ord a, Floating a) => Colour a
teal :: (Ord a, Floating a) => Colour a
thistle :: (Ord a, Floating a) => Colour a
tomato :: (Ord a, Floating a) => Colour a
turquoise :: (Ord a, Floating a) => Colour a
violet :: (Ord a, Floating a) => Colour a
wheat :: (Ord a, Floating a) => Colour a
white :: (Ord a, Floating a) => Colour a
whitesmoke :: (Ord a, Floating a) => Colour a
yellow :: (Ord a, Floating a) => Colour a
yellowgreen :: (Ord a, Floating a) => Colour a
sRGB :: (Ord b, Floating b) => b -> b -> b -> Colour b
sRGB24 :: (Ord b, Floating b) => Word8 -> Word8 -> Word8 -> Colour b
sRGB24read :: (Ord b, Floating b) => String -> Colour b
sRGB24reads :: (Ord b, Floating b) => ReadS (Colour b)
sRGB24show :: (RealFrac b, Floating b) => Colour b -> String
sRGB24shows :: (RealFrac b, Floating b) => Colour b -> ShowS
sRGBSpace :: (Ord a, Floating a) => RGBSpace a
toSRGB :: (Ord b, Floating b) => Colour b -> RGB b
toSRGB24 :: (RealFrac b, Floating b) => Colour b -> RGB Word8
(->>) :: Semigroup a => Active a -> Active a -> Active a
activeEnd :: Active a -> a
activeEra :: Active a -> Maybe (Era Rational)
activeStart :: Active a -> a
after :: Active a -> Active a -> Active a
atTime :: Time Rational -> Active a -> Active a
backwards :: Active a -> Active a
clamp :: Active a -> Active a
clampAfter :: Active a -> Active a
clampBefore :: Active a -> Active a
discrete :: [a] -> Active a
duration :: Num n => Era n -> Duration n
during :: Active a -> Active a -> Active a
end :: Era n -> Time n
fromDuration :: Duration n -> n
fromDynamic :: Dynamic a -> Active a
fromTime :: Time n -> n
interval :: Fractional a => Time Rational -> Time Rational -> Active a
isConstant :: Active a -> Bool
isDynamic :: Active a -> Bool
mkActive :: Time Rational -> Time Rational -> (Time Rational -> a) -> Active a
mkDynamic :: Time Rational -> Time Rational -> (Time Rational -> a) -> Dynamic a
mkEra :: Time n -> Time n -> Era n
modActive :: (a -> b) -> (Dynamic a -> Dynamic b) -> Active a -> Active b
movie :: [Active a] -> Active a
onActive :: (a -> b) -> (Dynamic a -> b) -> Active a -> b
onDynamic :: (Time Rational -> Time Rational -> (Time Rational -> a) -> b) -> Dynamic a -> b
runActive :: Active a -> Time Rational -> a
setEra :: Era Rational -> Active a -> Active a
shift :: Duration Rational -> Active a -> Active a
shiftDynamic :: Duration Rational -> Dynamic a -> Dynamic a
simulate :: Rational -> Active a -> [a]
snapshot :: Time Rational -> Active a -> Active a
start :: Era n -> Time n
stretch :: Rational -> Active a -> Active a
stretchTo :: Duration Rational -> Active a -> Active a
toDuration :: n -> Duration n
toTime :: n -> Time n
trim :: Monoid a => Active a -> Active a
trimAfter :: Monoid a => Active a -> Active a
trimBefore :: Monoid a => Active a -> Active a
ui :: Fractional a => Active a
(|>>) :: Active a -> Active a -> Active a
renderDia :: (Backend b v n, HasLinearMap v, Metric v, Typeable n, OrderedField n, Monoid' m) => b -> Options b v n -> QDiagram b v n m -> Result b v n
renderDiaT :: (Backend b v n, HasLinearMap v, Metric v, Typeable n, OrderedField n, Monoid' m) => b -> Options b v n -> QDiagram b v n m -> (Transformation v n, Result b v n)
appEnvelope :: Envelope v n -> Maybe (v n -> n)
diameter :: (V a ~ v, N a ~ n, Enveloped a) => v n -> a -> n
envelopeP :: (V a ~ v, N a ~ n, Enveloped a) => v n -> a -> Point v n
envelopePMay :: (V a ~ v, N a ~ n, Enveloped a) => v n -> a -> Maybe (Point v n)
envelopeV :: Enveloped a => Vn a -> a -> Vn a
envelopeVMay :: Enveloped a => Vn a -> a -> Maybe (Vn a)
mkEnvelope :: (v n -> n) -> Envelope v n
onEnvelope :: ((v n -> n) -> v n -> n) -> Envelope v n -> Envelope v n
radius :: (V a ~ v, N a ~ n, Enveloped a) => v n -> a -> n
size :: (V a ~ v, N a ~ n, Enveloped a, HasBasis v) => a -> v n
moveOriginBy :: (V t ~ v, N t ~ n, HasOrigin t) => v n -> t -> t
moveTo :: (InSpace v n t, HasOrigin t) => Point v n -> t -> t
place :: (InSpace v n t, HasOrigin t) => t -> Point v n -> t
juxtaposeDefault :: (Enveloped a, HasOrigin a) => Vn a -> a -> a -> a
atLeast :: Ord n => Measure n -> Measure n -> Measure n
atMost :: Ord n => Measure n -> Measure n -> Measure n
fromMeasured :: Num n => n -> n -> Measured n a -> a
global :: Num n => n -> Measure n
local :: Num n => n -> Measure n
normalized :: Num n => n -> Measure n
output :: n -> Measure n
scaleLocal :: Num n => n -> Measured n a -> Measured n a
(.>) :: (IsName a1, IsName a2) => a1 -> a2 -> Name
eachName :: (Typeable a, Ord a, Show a) => Traversal' Name a
(*.) :: (Functor v, Num n) => n -> Point v n -> Point v n
applyAttr :: (AttributeClass a, HasStyle d) => a -> d -> d
applyMAttr :: (AttributeClass a, N d ~ n, HasStyle d) => Measured n a -> d -> d
applyTAttr :: (AttributeClass a, Transformable a, V a ~ V d, N a ~ N d, HasStyle d) => a -> d -> d
atAttr :: AttributeClass a => Lens' (Style v n) (Maybe a)
atMAttr :: (AttributeClass a, Typeable n) => Lens' (Style v n) (Maybe (Measured n a))
atTAttr :: (V a ~ v, N a ~ n, AttributeClass a, Transformable a) => Lens' (Style v n) (Maybe a)
getAttr :: AttributeClass a => Style v n -> Maybe a
getSortedList :: SortedList a -> [a]
maxRayTraceP :: (n ~ N a, Traced a, Num n) => Point (V a) n -> V a n -> a -> Maybe (Point (V a) n)
maxRayTraceV :: (n ~ N a, Traced a, Num n) => Point (V a) n -> V a n -> a -> Maybe (V a n)
maxTraceP :: (n ~ N a, Num n, Traced a) => Point (V a) n -> V a n -> a -> Maybe (Point (V a) n)
maxTraceV :: (n ~ N a, Num n, Traced a) => Point (V a) n -> V a n -> a -> Maybe (V a n)
mkSortedList :: Ord a => [a] -> SortedList a
mkTrace :: (Point v n -> v n -> SortedList n) -> Trace v n
rayTraceP :: (n ~ N a, Traced a, Num n) => Point (V a) n -> V a n -> a -> Maybe (Point (V a) n)
rayTraceV :: (n ~ N a, Traced a, Num n) => Point (V a) n -> V a n -> a -> Maybe (V a n)
traceP :: (n ~ N a, Traced a, Num n) => Point (V a) n -> V a n -> a -> Maybe (Point (V a) n)
traceV :: (n ~ N a, Num n, Traced a) => Point (V a) n -> V a n -> a -> Maybe (V a n)
(<->) :: (u -> v) -> (v -> u) -> u :-: v
apply :: Transformation v n -> v n -> v n
avgScale :: (Additive v, Traversable v, Floating n) => Transformation v n -> n
determinant :: (Additive v, Traversable v, Num n) => Transformation v n -> n
dimension :: (Additive (V a), Traversable (V a)) => a -> Int
dropTransl :: (Additive v, Num n) => Transformation v n -> Transformation v n
eye :: (HasBasis v, Num n) => v (v n)
fromLinear :: (Additive v, Num n) => (v n :-: v n) -> (v n :-: v n) -> Transformation v n
inv :: (Functor v, Num n) => Transformation v n -> Transformation v n
isReflection :: (Additive v, Traversable v, Num n, Ord n) => Transformation v n -> Bool
lapp :: (u :-: v) -> u -> v
linv :: (u :-: v) -> v :-: u
papply :: (Additive v, Num n) => Transformation v n -> Point v n -> Point v n
scale :: (InSpace v n a, Eq n, Fractional n, Transformable a) => n -> a -> a
scaling :: (Additive v, Fractional n) => n -> Transformation v n
transl :: Transformation v n -> v n
translate :: Transformable t => Vn t -> t -> t
translation :: v n -> Transformation v n
transp :: Transformation v n -> v n :-: v n
atop :: (OrderedField n, Metric v, Semigroup m) => QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m
envelope :: (OrderedField n, Metric v, Monoid' m) => Lens' (QDiagram b v n m) (Envelope v n)
fromNames :: IsName a => [(a, Subdiagram b v n m)] -> SubMap b v n m
getSub :: (Metric v, OrderedField n, Semigroup m) => Subdiagram b v n m -> QDiagram b v n m
groupOpacity :: (Metric v, OrderedField n, Semigroup m) => Double -> QDiagram b v n m -> QDiagram b v n m
href :: (Metric v, OrderedField n, Semigroup m) => String -> QDiagram b v n m -> QDiagram b v n m
localize :: (Metric v, OrderedField n, Semigroup m) => QDiagram b v n m -> QDiagram b v n m
location :: (Additive v, Num n) => Subdiagram b v n m -> Point v n
lookupName :: (IsName nm, Metric v, Semigroup m, OrderedField n) => nm -> QDiagram b v n m -> Maybe (Subdiagram b v n m)
lookupSub :: IsName nm => nm -> SubMap b v n m -> Maybe [Subdiagram b v n m]
mkQD :: Prim b v n -> Envelope v n -> Trace v n -> SubMap b v n m -> Query v n m -> QDiagram b v n m
mkSubdiagram :: QDiagram b v n m -> Subdiagram b v n m
nameSub :: (IsName nm, Metric v, OrderedField n, Semigroup m) => (QDiagram b v n m -> Subdiagram b v n m) -> nm -> QDiagram b v n m -> QDiagram b v n m
names :: (Metric v, Semigroup m, OrderedField n) => QDiagram b v n m -> [(Name, [Point v n])]
opacityGroup :: (Metric v, OrderedField n, Semigroup m) => Double -> QDiagram b v n m -> QDiagram b v n m
pointDiagram :: (Metric v, Fractional n) => Point v n -> QDiagram b v n m
query :: Monoid m => QDiagram b v n m -> Query v n m
rawSub :: Subdiagram b v n m -> QDiagram b v n m
rememberAs :: IsName a => a -> QDiagram b v n m -> SubMap b v n m -> SubMap b v n m
setEnvelope :: (OrderedField n, Metric v, Monoid' m) => Envelope v n -> QDiagram b v n m -> QDiagram b v n m
setTrace :: (OrderedField n, Metric v, Semigroup m) => Trace v n -> QDiagram b v n m -> QDiagram b v n m
subMap :: (Metric v, Semigroup m, OrderedField n) => Lens' (QDiagram b v n m) (SubMap b v n m)
subPoint :: (Metric v, OrderedField n) => Point v n -> Subdiagram b v n m
withName :: (IsName nm, Metric v, Semigroup m, OrderedField n) => nm -> (Subdiagram b v n m -> QDiagram b v n m -> QDiagram b v n m) -> QDiagram b v n m -> QDiagram b v n m
withNameAll :: (IsName nm, Metric v, Semigroup m, OrderedField n) => nm -> ([Subdiagram b v n m] -> QDiagram b v n m -> QDiagram b v n m) -> QDiagram b v n m -> QDiagram b v n m
withNames :: (IsName nm, Metric v, Semigroup m, OrderedField n) => [nm] -> ([Subdiagram b v n m] -> QDiagram b v n m -> QDiagram b v n m) -> QDiagram b v n m -> QDiagram b v n m
align :: (InSpace v n a, Fractional n, Alignable a, HasOrigin a) => v n -> a -> a
alignBy'Default :: (InSpace v n a, Fractional n, HasOrigin a) => (v n -> a -> Point v n) -> v n -> n -> a -> a
center :: (InSpace v n a, Fractional n, Traversable v, Alignable a, HasOrigin a) => a -> a
centerV :: (InSpace v n a, Fractional n, Alignable a, HasOrigin a) => v n -> a -> a
envelopeBoundary :: (V a ~ v, N a ~ n, Enveloped a) => v n -> a -> Point v n
snug :: (InSpace v n a, Fractional n, Alignable a, Traced a, HasOrigin a) => v n -> a -> a
snugBy :: (InSpace v n a, Fractional n, Alignable a, Traced a, HasOrigin a) => v n -> n -> a -> a
snugCenter :: (InSpace v n a, Traversable v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a
snugCenterV :: (InSpace v n a, Fractional n, Alignable a, Traced a, HasOrigin a) => v n -> a -> a
traceBoundary :: (V a ~ v, N a ~ n, Num n, Traced a) => v n -> a -> Point v n
(@@) :: b -> AReview a b -> a
acosA :: Floating n => n -> Angle n
angleBetween :: (Metric v, Floating n, Ord n) => v n -> v n -> Angle n
angleRatio :: Floating n => Angle n -> Angle n -> n
asinA :: Floating n => n -> Angle n
atan2A :: RealFloat n => n -> n -> Angle n
atan2A' :: OrderedField n => n -> n -> Angle n
atanA :: Floating n => n -> Angle n
cosA :: Floating n => Angle n -> n
deg :: Floating n => Iso' (Angle n) n
fullTurn :: Floating v => Angle v
halfTurn :: Floating v => Angle v
normalizeAngle :: (Floating n, Real n) => Angle n -> Angle n
quarterTurn :: Floating v => Angle v
rad :: Iso' (Angle n) n
rotate :: (InSpace V2 n t, Transformable t, Floating n) => Angle n -> t -> t
rotation :: Floating n => Angle n -> Transformation V2 n
sinA :: Floating n => Angle n -> n
tanA :: Floating n => Angle n -> n
turn :: Floating n => Iso' (Angle n) n
animEnvelope :: (OrderedField n, Metric v, Monoid' m) => QAnimation b v n m -> QAnimation b v n m
animEnvelope' :: (OrderedField n, Metric v, Monoid' m) => Rational -> QAnimation b v n m -> QAnimation b v n m
animRect :: (InSpace V2 n t, Monoid' m, TrailLike t, Enveloped t, Transformable t, Monoid t) => QAnimation b V2 n m -> t
animRect' :: (InSpace V2 n t, Monoid' m, TrailLike t, Enveloped t, Transformable t, Monoid t) => Rational -> QAnimation b V2 n m -> t
_Commit :: Prism' (Recommend a) a
_FillOpacity :: Iso' FillOpacity Double
_LineMiterLimit :: Iso' LineMiterLimit Double
_LineWidth :: Iso' (LineWidth n) n
_LineWidthM :: Iso' (LineWidthM n) (Measure n)
_Opacity :: Iso' Opacity Double
_Recommend :: Prism' (Recommend a) a
_SomeColor :: Iso' SomeColor (AlphaColour Double)
_StrokeOpacity :: Iso' StrokeOpacity Double
_dashing :: Typeable n => Lens' (Style v n) (Maybe (Measured n (Dashing n)))
_dashingU :: Typeable n => Lens' (Style v n) (Maybe (Dashing n))
_fillOpacity :: Lens' (Style v n) Double
_lineCap :: Lens' (Style v n) LineCap
_lineJoin :: Lens' (Style v n) LineJoin
_lineMiterLimit :: Lens' (Style v n) Double
_lineWidth :: (Typeable n, OrderedField n) => Lens' (Style v n) (Measure n)
_lineWidthU :: Typeable n => Lens' (Style v n) (Maybe n)
_lw :: (Typeable n, OrderedField n) => Lens' (Style v n) (Measure n)
_opacity :: Lens' (Style v n) Double
_recommend :: Lens (Recommend a) (Recommend b) a b
_strokeOpacity :: Lens' (Style v n) Double
colorToRGBA :: Color c => c -> (Double, Double, Double, Double)
colorToSRGBA :: Color c => c -> (Double, Double, Double, Double)
committed :: Iso (Recommend a) (Recommend b) a b
dashing :: (N a ~ n, HasStyle a, Typeable n) => [Measure n] -> Measure n -> a -> a
dashingG :: (N a ~ n, HasStyle a, Typeable n, Num n) => [n] -> n -> a -> a
dashingL :: (N a ~ n, HasStyle a, Typeable n, Num n) => [n] -> n -> a -> a
dashingN :: (N a ~ n, HasStyle a, Typeable n, Num n) => [n] -> n -> a -> a
dashingO :: (N a ~ n, HasStyle a, Typeable n) => [n] -> n -> a -> a
fillOpacity :: HasStyle a => Double -> a -> a
getDashing :: Dashing n -> Dashing n
getFillOpacity :: FillOpacity -> Double
getLineCap :: LineCap -> LineCap
getLineJoin :: LineJoin -> LineJoin
getLineMiterLimit :: LineMiterLimit -> Double
getLineWidth :: LineWidth n -> n
getOpacity :: Opacity -> Double
getStrokeOpacity :: StrokeOpacity -> Double
huge :: OrderedField n => Measure n
isCommitted :: Lens' (Recommend a) Bool
large :: OrderedField n => Measure n
lineCap :: HasStyle a => LineCap -> a -> a
lineJoin :: HasStyle a => LineJoin -> a -> a
lineMiterLimit :: HasStyle a => Double -> a -> a
lineMiterLimitA :: HasStyle a => LineMiterLimit -> a -> a
lineWidth :: (N a ~ n, HasStyle a, Typeable n) => Measure n -> a -> a
lineWidthM :: (N a ~ n, HasStyle a, Typeable n) => LineWidthM n -> a -> a
lw :: (N a ~ n, HasStyle a, Typeable n) => Measure n -> a -> a
lwG :: (N a ~ n, HasStyle a, Typeable n, Num n) => n -> a -> a
lwL :: (N a ~ n, HasStyle a, Typeable n, Num n) => n -> a -> a
lwN :: (N a ~ n, HasStyle a, Typeable n, Num n) => n -> a -> a
lwO :: (N a ~ n, HasStyle a, Typeable n) => n -> a -> a
medium :: OrderedField n => Measure n
none :: OrderedField n => Measure n
normal :: OrderedField n => Measure n
opacity :: HasStyle a => Double -> a -> a
small :: OrderedField n => Measure n
someToAlpha :: SomeColor -> AlphaColour Double
strokeOpacity :: HasStyle a => Double -> a -> a
thick :: OrderedField n => Measure n
thin :: OrderedField n => Measure n
tiny :: OrderedField n => Measure n
ultraThick :: OrderedField n => Measure n
ultraThin :: OrderedField n => Measure n
veryLarge :: OrderedField n => Measure n
verySmall :: OrderedField n => Measure n
veryThick :: OrderedField n => Measure n
veryThin :: OrderedField n => Measure n
boundingBox :: (InSpace v n a, HasBasis v, Enveloped a) => a -> BoundingBox v n
boxCenter :: (Additive v, Fractional n) => BoundingBox v n -> Maybe (Point v n)
boxExtents :: (Additive v, Num n) => BoundingBox v n -> v n
boxFit :: (InSpace v n a, HasBasis v, Enveloped a, Transformable a, Monoid a) => BoundingBox v n -> a -> a
boxGrid :: (Traversable v, Additive v, Num n, Enum n) => n -> BoundingBox v n -> [Point v n]
boxTransform :: (Additive v, Fractional n) => BoundingBox v n -> BoundingBox v n -> Maybe (Transformation v n)
centerPoint :: (InSpace v n a, HasBasis v, Enveloped a) => a -> Point v n
contains' :: (Additive v, Foldable v, Ord n) => BoundingBox v n -> Point v n -> Bool
emptyBox :: BoundingBox v n
fromCorners :: (Additive v, Foldable v, Ord n) => Point v n -> Point v n -> BoundingBox v n
fromPoint :: Point v n -> BoundingBox v n
fromPoints :: (Additive v, Ord n) => [Point v n] -> BoundingBox v n
getAllCorners :: (Additive v, Traversable v) => BoundingBox v n -> [Point v n]
getCorners :: BoundingBox v n -> Maybe (Point v n, Point v n)
inside' :: (Additive v, Foldable v, Ord n) => BoundingBox v n -> BoundingBox v n -> Bool
isEmptyBox :: BoundingBox v n -> Bool
mCenterPoint :: (InSpace v n a, HasBasis v, Enveloped a) => a -> Maybe (Point v n)
outside' :: (Additive v, Foldable v, Ord n) => BoundingBox v n -> BoundingBox v n -> Bool
appends :: (Juxtaposable a, Monoid' a) => a -> [(Vn a, a)] -> a
atDirection :: (InSpace v n a, Metric v, Floating n, Juxtaposable a, Semigroup a) => Direction v n -> a -> a -> a
atPoints :: (InSpace v n a, HasOrigin a, Monoid' a) => [Point v n] -> [a] -> a
beneath :: (Metric v, OrderedField n, Monoid' m) => QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m
beside :: (Juxtaposable a, Semigroup a) => Vn a -> a -> a -> a
cat :: (InSpace v n a, Metric v, Floating n, Juxtaposable a, Monoid' a, HasOrigin a) => v n -> [a] -> a
cat' :: (InSpace v n a, Metric v, Floating n, Juxtaposable a, Monoid' a, HasOrigin a) => v n -> CatOpts n -> [a] -> a
catMethod :: Lens' (CatOpts n) CatMethod
composeAligned :: (Monoid' m, Floating n, Ord n, Metric v) => (QDiagram b v n m -> QDiagram b v n m) -> ([QDiagram b v n m] -> QDiagram b v n m) -> [QDiagram b v n m] -> QDiagram b v n m
extrudeEnvelope :: (Metric v, OrderedField n, Monoid' m) => v n -> QDiagram b v n m -> QDiagram b v n m
frame :: (Metric v, OrderedField n, Monoid' m) => n -> QDiagram b v n m -> QDiagram b v n m
intrudeEnvelope :: (Metric v, OrderedField n, Monoid' m) => v n -> QDiagram b v n m -> QDiagram b v n m
pad :: (Metric v, OrderedField n, Monoid' m) => n -> QDiagram b v n m -> QDiagram b v n m
phantom :: (InSpace v n a, Monoid' m, Enveloped a, Traced a) => a -> QDiagram b v n m
position :: (InSpace v n a, HasOrigin a, Monoid' a) => [(Point v n, a)] -> a
sep :: Lens' (CatOpts n) n
strut :: (Metric v, OrderedField n) => v n -> QDiagram b v n m
withEnvelope :: (InSpace v n a, Monoid' m, Enveloped a) => a -> QDiagram b v n m -> QDiagram b v n m
withTrace :: (InSpace v n a, Metric v, OrderedField n, Monoid' m, Traced a) => a -> QDiagram b v n m -> QDiagram b v n m
cubicSpline :: (V t ~ v, N t ~ n, TrailLike t, Fractional (v n)) => Bool -> [Point v n] -> t
bspline :: (TrailLike t, V t ~ v, N t ~ n) => BSpline v n -> t
asDeformation :: (Additive v, Num n) => Transformation v n -> Deformation v v n
_Dir :: Iso' (Direction v n) (v n)
angleBetweenDirs :: (Metric v, Floating n, Ord n) => Direction v n -> Direction v n -> Angle n
dirBetween :: (Additive v, Num n) => Point v n -> Point v n -> Direction v n
direction :: v n -> Direction v n
fromDir :: (Metric v, Floating n) => Direction v n -> v n
fromDirection :: (Metric v, Floating n) => Direction v n -> v n
_loc :: Lens' (Located a) (Point (V a) (N a))
at :: a -> Point (V a) (N a) -> Located a
located :: SameSpace a b => Lens (Located a) (Located b) a b
mapLoc :: SameSpace a b => (a -> b) -> Located a -> Located b
viewLoc :: Located a -> (Point (V a) (N a), a)
namePoint :: (IsName nm, Metric v, OrderedField n, Semigroup m) => (QDiagram b v n m -> Point v n) -> nm -> QDiagram b v n m -> QDiagram b v n m
named :: (IsName nm, Metric v, OrderedField n, Semigroup m) => nm -> QDiagram b v n m -> QDiagram b v n m
domainBounds :: DomainBounds p => p -> (N p, N p)
stdTolerance :: Fractional a => a
adjEps :: Lens' (AdjustOpts n) n
adjMethod :: Lens' (AdjustOpts n) (AdjustMethod n)
adjSide :: Lens' (AdjustOpts n) AdjustSide
adjust :: (N t ~ n, Sectionable t, HasArcLength t, Fractional n) => t -> AdjustOpts n -> t
explodePath :: (V t ~ v, N t ~ n, TrailLike t) => Path v n -> [[t]]
fixPath :: (Metric v, OrderedField n) => Path v n -> [[FixedSegment v n]]
partitionPath :: (Located (Trail v n) -> Bool) -> Path v n -> (Path v n, Path v n)
pathCentroid :: (Metric v, OrderedField n) => Path v n -> Point v n
pathFromLocTrail :: (Metric v, OrderedField n) => Located (Trail v n) -> Path v n
pathFromTrail :: (Metric v, OrderedField n) => Trail v n -> Path v n
pathFromTrailAt :: (Metric v, OrderedField n) => Trail v n -> Point v n -> Path v n
pathLocSegments :: (Metric v, OrderedField n) => Path v n -> [[Located (Segment Closed v n)]]
pathOffsets :: (Metric v, OrderedField n) => Path v n -> [v n]
pathTrails :: Path v n -> [Located (Trail v n)]
pathVertices :: (Metric v, OrderedField n) => Path v n -> [[Point v n]]
pathVertices' :: (Metric v, OrderedField n) => n -> Path v n -> [[Point v n]]
reversePath :: (Metric v, OrderedField n) => Path v n -> Path v n
scalePath :: (HasLinearMap v, Metric v, OrderedField n) => n -> Path v n -> Path v n
centroid :: (Additive v, Fractional n) => [Point v n] -> Point v n
clearValue :: QDiagram b v n m -> QDiagram b v n Any
inquire :: HasQuery t Any => t -> Point (V t) (N t) -> Bool
resetValue :: (Eq m, Monoid m) => QDiagram b v n m -> QDiagram b v n Any
sample :: HasQuery t m => t -> Point (V t) (N t) -> m
value :: Monoid m => m -> QDiagram b v n Any -> QDiagram b v n m
bezier3 :: v n -> v n -> v n -> Segment Closed v n
bézier3 :: v n -> v n -> v n -> Segment Closed v n
fixedSegIso :: (Num n, Additive v) => Iso' (FixedSegment v n) (Located (Segment Closed v n))
fromFixedSeg :: (Num n, Additive v) => FixedSegment v n -> Located (Segment Closed v n)
getArcLengthBounded :: (Num n, Ord n) => n -> ArcLength n -> Interval n
getArcLengthCached :: ArcLength n -> Interval n
getArcLengthFun :: ArcLength n -> n -> Interval n
mapSegmentVectors :: (v n -> v' n') -> Segment c v n -> Segment c v' n'
mkFixedSeg :: (Num n, Additive v) => Located (Segment Closed v n) -> FixedSegment v n
oeEnvelope :: Lens' (OffsetEnvelope v n) (Envelope v n)
oeOffset :: Lens' (OffsetEnvelope v n) (TotalOffset v n)
openCubic :: v n -> v n -> Segment Open v n
openLinear :: Segment Open v n
reverseSegment :: (Num n, Additive v) => Segment Closed v n -> Segment Closed v n
segOffset :: Segment Closed v n -> v n
straight :: v n -> Segment Closed v n
absolute :: (Additive v, Num n) => SizeSpec v n
dims :: v n -> SizeSpec v n
getSpec :: (Functor v, Num n, Ord n) => SizeSpec v n -> v (Maybe n)
mkSizeSpec :: (Functor v, Num n) => v (Maybe n) -> SizeSpec v n
requiredScale :: (Additive v, Foldable v, Fractional n, Ord n) => SizeSpec v n -> v n -> n
requiredScaling :: (Additive v, Foldable v, Fractional n, Ord n) => SizeSpec v n -> v n -> Transformation v n
sizeAdjustment :: (Additive v, Foldable v, OrderedField n) => SizeSpec v n -> BoundingBox v n -> (v n, Transformation v n)
sized :: (InSpace v n a, HasLinearMap v, Transformable a, Enveloped a) => SizeSpec v n -> a -> a
sizedAs :: (InSpace v n a, SameSpace a b, HasLinearMap v, Transformable a, Enveloped a, Enveloped b) => b -> a -> a
specToSize :: (Foldable v, Functor v, Num n, Ord n) => n -> SizeSpec v n -> v n
normalAtEnd :: (InSpace V2 n t, EndValues (Tangent t), Floating n) => t -> V2 n
normalAtParam :: (InSpace V2 n t, Parametric (Tangent t), Floating n) => t -> n -> V2 n
normalAtStart :: (InSpace V2 n t, EndValues (Tangent t), Floating n) => t -> V2 n
tangentAtEnd :: EndValues (Tangent t) => t -> Vn t
tangentAtParam :: Parametric (Tangent t) => t -> N t -> Vn t
tangentAtStart :: EndValues (Tangent t) => t -> Vn t
alignXMax :: (InSpace v n a, R1 v, Fractional n, Alignable a, HasOrigin a) => a -> a
alignXMin :: (InSpace v n a, R1 v, Fractional n, Alignable a, HasOrigin a) => a -> a
alignYMax :: (InSpace v n a, R2 v, Fractional n, Alignable a, HasOrigin a) => a -> a
alignYMin :: (InSpace v n a, R2 v, Fractional n, Alignable a, HasOrigin a) => a -> a
alignZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a) => n -> a -> a
alignZMax :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a) => a -> a
alignZMin :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a) => a -> a
centerXYZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a) => a -> a
centerXZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a) => a -> a
centerYZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a) => a -> a
centerZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a) => a -> a
snugCenterXYZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a
snugCenterXZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a
snugCenterYZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a
snugCenterZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a
snugXMax :: (InSpace v n a, R1 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a
snugXMin :: (InSpace v n a, R1 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a
snugYMax :: (InSpace v n a, R2 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a
snugYMin :: (InSpace v n a, R2 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a
snugZ :: (V a ~ v, N a ~ n, Alignable a, Traced a, HasOrigin a, R3 v, Fractional n) => n -> a -> a
snugZMax :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a
snugZMin :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a
_Ambient :: Iso' Ambient Double
_Diffuse :: Iso' Diffuse Double
_Highlight :: Iso' Highlight Specular
_SurfaceColor :: Iso' SurfaceColor (Colour Double)
_ambient :: Lens' (Style v n) (Maybe Double)
_diffuse :: Lens' (Style v n) (Maybe Double)
_highlight :: Lens' (Style v n) (Maybe Specular)
_sc :: Lens' (Style v n) (Maybe (Colour Double))
ambient :: HasStyle d => Double -> d -> d
diffuse :: HasStyle d => Double -> d -> d
highlight :: HasStyle d => Specular -> d -> d
highlightIntensity :: Traversal' (Style v n) Double
highlightSize :: Traversal' (Style v n) Double
sc :: HasStyle d => Colour Double -> d -> d
specularIntensity :: Lens' Specular Double
specularSize :: Lens' Specular Double
camAspect :: (Floating n, CameraLens l) => Camera l n -> n
camForward :: Camera l n -> Direction V3 n
camLens :: Camera l n -> l n
camRight :: Fractional n => Camera l n -> Direction V3 n
camUp :: Camera l n -> Direction V3 n
facing_ZCamera :: (Floating n, Ord n, Typeable n, CameraLens l, Renderable (Camera l n) b) => l n -> QDiagram b V3 n Any
horizontalFieldOfView :: Lens' (PerspectiveLens n) (Angle n)
mm50 :: Floating n => PerspectiveLens n
mm50Camera :: (Typeable n, Floating n, Ord n, Renderable (Camera PerspectiveLens n) b) => QDiagram b V3 n Any
mm50Narrow :: Floating n => PerspectiveLens n
mm50Wide :: Floating n => PerspectiveLens n
orthoHeight :: Lens' (OrthoLens n) n
orthoWidth :: Lens' (OrthoLens n) n
verticalFieldOfView :: Lens' (PerspectiveLens n) (Angle n)
facingZ :: (R3 v, Functor v, Fractional n) => Deformation v v n
parallelZ0 :: (R3 v, Num n) => Deformation v v n
perspectiveZ1 :: (R3 v, Functor v, Fractional n) => Deformation v v n
parallelLight :: (Typeable n, OrderedField n, Renderable (ParallelLight n) b) => Direction V3 n -> Colour Double -> QDiagram b V3 n Any
pointLight :: (Typeable n, Num n, Ord n, Renderable (PointLight n) b) => Colour Double -> QDiagram b V3 n Any
cone :: Num n => Frustum n
cube :: Num n => Box n
cylinder :: Num n => Frustum n
difference :: (CsgPrim a, CsgPrim b) => a n -> b n -> CSG n
frustum :: Num n => n -> n -> Frustum n
intersection :: (CsgPrim a, CsgPrim b) => a n -> b n -> CSG n
sphere :: Num n => Ellipsoid n
union :: (CsgPrim a, CsgPrim b) => a n -> b n -> CSG n
aboutX :: Floating n => Angle n -> Transformation V3 n
aboutY :: Floating n => Angle n -> Transformation V3 n
aboutZ :: Floating n => Angle n -> Transformation V3 n
pointAt :: (Floating n, Ord n) => Direction V3 n -> Direction V3 n -> Direction V3 n -> Transformation V3 n
pointAt' :: (Floating n, Ord n) => V3 n -> V3 n -> V3 n -> Transformation V3 n
reflectAcross :: (InSpace v n t, Metric v, Fractional n, Transformable t) => Point v n -> v n -> t -> t
reflectZ :: (InSpace v n t, R3 v, Transformable t) => t -> t
reflectionAcross :: (Metric v, Fractional n) => Point v n -> v n -> Transformation v n
reflectionZ :: (Additive v, R3 v, Num n) => Transformation v n
rotateAbout :: (InSpace V3 n t, Floating n, Transformable t) => Point V3 n -> Direction V3 n -> Angle n -> t -> t
rotationAbout :: Floating n => Point V3 n -> Direction V3 n -> Angle n -> Transformation V3 n
scaleZ :: (InSpace v n t, R3 v, Fractional n, Transformable t) => n -> t -> t
scalingZ :: (Additive v, R3 v, Fractional n) => n -> Transformation v n
translateZ :: (InSpace v n t, R3 v, Transformable t) => n -> t -> t
translationZ :: (Additive v, R3 v, Num n) => n -> Transformation v n
mkP3 :: n -> n -> n -> P3 n
mkR3 :: n -> n -> n -> V3 n
p3 :: (n, n, n) -> P3 n
p3Iso :: Iso' (P3 n) (n, n, n)
r3 :: (n, n, n) -> V3 n
r3CylindricalIso :: RealFloat n => Iso' (V3 n) (n, Angle n, n)
r3Iso :: Iso' (V3 n) (n, n, n)
r3SphericalIso :: RealFloat n => Iso' (V3 n) (n, Angle n, Angle n)
unp3 :: P3 n -> (n, n, n)
unr3 :: V3 n -> (n, n, n)
unitZ :: (R3 v, Additive v, Num n) => v n
unit_Z :: (R3 v, Additive v, Num n) => v n
zDir :: (R3 v, Additive v, Num n) => Direction v n
boundaryFrom :: (OrderedField n, Metric v, Semigroup m) => Subdiagram b v n m -> v n -> Point v n
boundaryFromMay :: (Metric v, OrderedField n, Semigroup m) => Subdiagram b v n m -> v n -> Maybe (Point v n)
_Line :: Prism' (Trail v n) (Trail' Line v n)
_LocLine :: Prism' (Located (Trail v n)) (Located (Trail' Line v n))
_LocLoop :: Prism' (Located (Trail v n)) (Located (Trail' Loop v n))
_Loop :: Prism' (Trail v n) (Trail' Loop v n)
closeLine :: Trail' Line v n -> Trail' Loop v n
closeTrail :: Trail v n -> Trail v n
cutLoop :: (Metric v, OrderedField n) => Trail' Loop v n -> Trail' Line v n
cutTrail :: (Metric v, OrderedField n) => Trail v n -> Trail v n
emptyLine :: (Metric v, OrderedField n) => Trail' Line v n
emptyTrail :: (Metric v, OrderedField n) => Trail v n
fixTrail :: (Metric v, OrderedField n) => Located (Trail v n) -> [FixedSegment v n]
getSegment :: t -> GetSegment t
glueLine :: (Metric v, OrderedField n) => Trail' Line v n -> Trail' Loop v n
glueTrail :: (Metric v, OrderedField n) => Trail v n -> Trail v n
isLine :: Trail v n -> Bool
isLineEmpty :: (Metric v, OrderedField n) => Trail' Line v n -> Bool
isLoop :: Trail v n -> Bool
isTrailEmpty :: (Metric v, OrderedField n) => Trail v n -> Bool
lineFromOffsets :: (Metric v, OrderedField n) => [v n] -> Trail' Line v n
lineFromSegments :: (Metric v, OrderedField n) => [Segment Closed v n] -> Trail' Line v n
lineFromVertices :: (Metric v, OrderedField n) => [Point v n] -> Trail' Line v n
lineOffset :: (Metric v, OrderedField n) => Trail' Line v n -> v n
lineOffsets :: Trail' Line v n -> [v n]
lineSegments :: Trail' Line v n -> [Segment Closed v n]
lineVertices :: (Metric v, OrderedField n) => Located (Trail' Line v n) -> [Point v n]
lineVertices' :: (Metric v, OrderedField n) => n -> Located (Trail' Line v n) -> [Point v n]
loopFromSegments :: (Metric v, OrderedField n) => [Segment Closed v n] -> Segment Open v n -> Trail' Loop v n
loopOffsets :: (Metric v, OrderedField n) => Trail' Loop v n -> [v n]
loopSegments :: Trail' Loop v n -> ([Segment Closed v n], Segment Open v n)
loopVertices :: (Metric v, OrderedField n) => Located (Trail' Loop v n) -> [Point v n]
loopVertices' :: (Metric v, OrderedField n) => n -> Located (Trail' Loop v n) -> [Point v n]
numSegs :: (Num c, Measured (SegMeasure v n) a) => a -> c
offset :: (OrderedField n, Metric v, Measured (SegMeasure v n) t) => t -> v n
onLine :: (Metric v, OrderedField n) => (Trail' Line v n -> Trail' Line v n) -> Trail v n -> Trail v n
onLineSegments :: (Metric v, OrderedField n) => ([Segment Closed v n] -> [Segment Closed v n]) -> Trail' Line v n -> Trail' Line v n
onTrail :: (Trail' Line v n -> Trail' l1 v n) -> (Trail' Loop v n -> Trail' l2 v n) -> Trail v n -> Trail v n
reverseLine :: (Metric v, OrderedField n) => Trail' Line v n -> Trail' Line v n
reverseLocLine :: (Metric v, OrderedField n) => Located (Trail' Line v n) -> Located (Trail' Line v n)
reverseLocLoop :: (Metric v, OrderedField n) => Located (Trail' Loop v n) -> Located (Trail' Loop v n)
reverseLocTrail :: (Metric v, OrderedField n) => Located (Trail v n) -> Located (Trail v n)
reverseLoop :: (Metric v, OrderedField n) => Trail' Loop v n -> Trail' Loop v n
reverseTrail :: (Metric v, OrderedField n) => Trail v n -> Trail v n
trailFromOffsets :: (Metric v, OrderedField n) => [v n] -> Trail v n
trailFromSegments :: (Metric v, OrderedField n) => [Segment Closed v n] -> Trail v n
trailFromVertices :: (Metric v, OrderedField n) => [Point v n] -> Trail v n
trailLocSegments :: (Metric v, OrderedField n) => Located (Trail v n) -> [Located (Segment Closed v n)]
trailMeasure :: (SegMeasure v n :>: m, Measured (SegMeasure v n) t) => a -> (m -> a) -> t -> a
trailOffset :: (Metric v, OrderedField n) => Trail v n -> v n
trailOffsets :: (Metric v, OrderedField n) => Trail v n -> [v n]
trailSegments :: (Metric v, OrderedField n) => Trail v n -> [Segment Closed v n]
trailVertices :: (Metric v, OrderedField n) => Located (Trail v n) -> [Point v n]
trailVertices' :: (Metric v, OrderedField n) => n -> Located (Trail v n) -> [Point v n]
unfixTrail :: (Metric v, Ord n, Floating n) => [FixedSegment v n] -> Located (Trail v n)
withLine :: (Metric v, OrderedField n) => (Trail' Line v n -> r) -> Trail v n -> r
withTrail :: (Trail' Line v n -> r) -> (Trail' Loop v n -> r) -> Trail v n -> r
withTrail' :: (Trail' Line v n -> r) -> (Trail' Loop v n -> r) -> Trail' l v n -> r
wrapLine :: Trail' Line v n -> Trail v n
wrapLoop :: Trail' Loop v n -> Trail v n
wrapTrail :: Trail' l v n -> Trail v n
explodeTrail :: (V t ~ v, N t ~ n, TrailLike t) => Located (Trail v n) -> [t]
fromLocOffsets :: (V t ~ v, N t ~ n, V (v n) ~ v, N (v n) ~ n, TrailLike t) => Located [v n] -> t
fromLocSegments :: TrailLike t => Located [Segment Closed (V t) (N t)] -> t
fromOffsets :: TrailLike t => [Vn t] -> t
fromSegments :: TrailLike t => [Segment Closed (V t) (N t)] -> t
fromVertices :: TrailLike t => [Point (V t) (N t)] -> t
(~~) :: (V t ~ v, N t ~ n, TrailLike t) => Point v n -> Point v n -> t
conjugate :: (Additive v, Num n) => Transformation v n -> Transformation v n -> Transformation v n
movedFrom :: (InSpace v n a, SameSpace a b, HasOrigin a, HasOrigin b) => Point v n -> Iso a b a b
movedTo :: (InSpace v n a, SameSpace a b, HasOrigin a, HasOrigin b) => Point v n -> Iso a b a b
transformed :: (InSpace v n a, SameSpace a b, Transformable a, Transformable b) => Transformation v n -> Iso a b a b
translated :: (InSpace v n a, SameSpace a b, Transformable a, Transformable b) => v n -> Iso a b a b
underT :: (InSpace v n a, SameSpace a b, Transformable a, Transformable b) => (a -> b) -> Transformation v n -> a -> b
alignB :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a
alignBL :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a
alignBR :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a
alignL :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a
alignR :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a
alignT :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a
alignTL :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a
alignTR :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a
alignX :: (InSpace v n a, R1 v, Fractional n, Alignable a, HasOrigin a) => n -> a -> a
alignY :: (InSpace v n a, R2 v, Fractional n, Alignable a, HasOrigin a) => n -> a -> a
centerX :: (InSpace v n a, R1 v, Fractional n, Alignable a, HasOrigin a) => a -> a
centerXY :: (InSpace v n a, R2 v, Fractional n, Alignable a, HasOrigin a) => a -> a
centerY :: (InSpace v n a, R2 v, Fractional n, Alignable a, HasOrigin a) => a -> a
snugB :: (InSpace V2 n a, Fractional n, Alignable a, Traced a, HasOrigin a) => a -> a
snugCenterX :: (InSpace v n a, R1 v, Fractional n, Alignable a, Traced a, HasOrigin a) => a -> a
snugCenterXY :: (InSpace v n a, R2 v, Fractional n, Alignable a, Traced a, HasOrigin a) => a -> a
snugCenterY :: (InSpace v n a, R2 v, Fractional n, Alignable a, Traced a, HasOrigin a) => a -> a
snugL :: (InSpace V2 n a, Fractional n, Alignable a, Traced a, HasOrigin a) => a -> a
snugR :: (InSpace V2 n a, Fractional n, Alignable a, Traced a, HasOrigin a) => a -> a
snugT :: (InSpace V2 n a, Fractional n, Alignable a, Traced a, HasOrigin a) => a -> a
snugX :: (InSpace v n a, R1 v, Fractional n, Alignable a, Traced a, HasOrigin a) => n -> a -> a
snugY :: (InSpace v n a, R2 v, Fractional n, Alignable a, Traced a, HasOrigin a) => n -> a -> a
annularWedge :: (TrailLike t, V t ~ V2, N t ~ n, RealFloat n) => n -> n -> Direction V2 n -> Angle n -> t
arc :: (InSpace V2 n t, OrderedField n, TrailLike t) => Direction V2 n -> Angle n -> t
arc' :: (InSpace V2 n t, OrderedField n, TrailLike t) => n -> Direction V2 n -> Angle n -> t
arcBetween :: (TrailLike t, V t ~ V2, N t ~ n, RealFloat n) => Point V2 n -> Point V2 n -> n -> t
arcCCW :: (InSpace V2 n t, RealFloat n, TrailLike t) => Direction V2 n -> Direction V2 n -> t
arcCW :: (InSpace V2 n t, RealFloat n, TrailLike t) => Direction V2 n -> Direction V2 n -> t
wedge :: (InSpace V2 n t, OrderedField n, TrailLike t) => n -> Direction V2 n -> Angle n -> t
arrow :: (TypeableFloat n, Renderable (Path V2 n) b) => n -> QDiagram b V2 n Any
arrow' :: (TypeableFloat n, Renderable (Path V2 n) b) => ArrowOpts n -> n -> QDiagram b V2 n Any
arrowAt :: (TypeableFloat n, Renderable (Path V2 n) b) => Point V2 n -> V2 n -> QDiagram b V2 n Any
arrowAt' :: (TypeableFloat n, Renderable (Path V2 n) b) => ArrowOpts n -> Point V2 n -> V2 n -> QDiagram b V2 n Any
arrowBetween :: (TypeableFloat n, Renderable (Path V2 n) b) => Point V2 n -> Point V2 n -> QDiagram b V2 n Any
arrowBetween' :: (TypeableFloat n, Renderable (Path V2 n) b) => ArrowOpts n -> Point V2 n -> Point V2 n -> QDiagram b V2 n Any
arrowHead :: Lens' (ArrowOpts n) (ArrowHT n)
arrowShaft :: Lens' (ArrowOpts n) (Trail V2 n)
arrowTail :: Lens' (ArrowOpts n) (ArrowHT n)
arrowV :: (TypeableFloat n, Renderable (Path V2 n) b) => V2 n -> QDiagram b V2 n Any
arrowV' :: (TypeableFloat n, Renderable (Path V2 n) b) => ArrowOpts n -> V2 n -> QDiagram b V2 n Any
connect :: (TypeableFloat n, Renderable (Path V2 n) b, IsName n1, IsName n2) => n1 -> n2 -> QDiagram b V2 n Any -> QDiagram b V2 n Any
connect' :: (TypeableFloat n, Renderable (Path V2 n) b, IsName n1, IsName n2) => ArrowOpts n -> n1 -> n2 -> QDiagram b V2 n Any -> QDiagram b V2 n Any
connectOutside :: (TypeableFloat n, Renderable (Path V2 n) b, IsName n1, IsName n2) => n1 -> n2 -> QDiagram b V2 n Any -> QDiagram b V2 n Any
connectOutside' :: (TypeableFloat n, Renderable (Path V2 n) b, IsName n1, IsName n2) => ArrowOpts n -> n1 -> n2 -> QDiagram b V2 n Any -> QDiagram b V2 n Any
connectPerim :: (TypeableFloat n, Renderable (Path V2 n) b, IsName n1, IsName n2) => n1 -> n2 -> Angle n -> Angle n -> QDiagram b V2 n Any -> QDiagram b V2 n Any
connectPerim' :: (TypeableFloat n, Renderable (Path V2 n) b, IsName n1, IsName n2) => ArrowOpts n -> n1 -> n2 -> Angle n -> Angle n -> QDiagram b V2 n Any -> QDiagram b V2 n Any
gap :: Traversal' (ArrowOpts n) (Measure n)
gaps :: Traversal' (ArrowOpts n) (Measure n)
headGap :: Lens' (ArrowOpts n) (Measure n)
headLength :: Lens' (ArrowOpts n) (Measure n)
headStyle :: Lens' (ArrowOpts n) (Style V2 n)
headTexture :: TypeableFloat n => Lens' (ArrowOpts n) (Texture n)
lengths :: Traversal' (ArrowOpts n) (Measure n)
shaftStyle :: Lens' (ArrowOpts n) (Style V2 n)
shaftTexture :: TypeableFloat n => Lens' (ArrowOpts n) (Texture n)
straightShaft :: OrderedField n => Trail V2 n
tailGap :: Lens' (ArrowOpts n) (Measure n)
tailLength :: Lens' (ArrowOpts n) (Measure n)
tailStyle :: Lens' (ArrowOpts n) (Style V2 n)
tailTexture :: TypeableFloat n => Lens' (ArrowOpts n) (Texture n)
arrowheadDart :: RealFloat n => Angle n -> ArrowHT n
arrowheadHalfDart :: RealFloat n => Angle n -> ArrowHT n
arrowheadSpike :: RealFloat n => Angle n -> ArrowHT n
arrowheadThorn :: RealFloat n => Angle n -> ArrowHT n
arrowheadTriangle :: RealFloat n => Angle n -> ArrowHT n
arrowtailBlock :: RealFloat n => Angle n -> ArrowHT n
arrowtailQuill :: OrderedField n => Angle n -> ArrowHT n
block :: RealFloat n => ArrowHT n
dart :: RealFloat n => ArrowHT n
dart' :: RealFloat n => ArrowHT n
halfDart :: RealFloat n => ArrowHT n
halfDart' :: RealFloat n => ArrowHT n
lineHead :: RealFloat n => ArrowHT n
lineTail :: RealFloat n => ArrowHT n
noHead :: ArrowHT n
noTail :: ArrowHT n
quill :: (Floating n, Ord n) => ArrowHT n
spike :: RealFloat n => ArrowHT n
spike' :: RealFloat n => ArrowHT n
thorn :: RealFloat n => ArrowHT n
thorn' :: RealFloat n => ArrowHT n
tri :: RealFloat n => ArrowHT n
tri' :: RealFloat n => ArrowHT n
_AC :: Prism' (Texture n) (AlphaColour Double)
_FillTexture :: Iso' (FillTexture n) (Recommend (Texture n))
_LG :: Prism' (Texture n) (LGradient n)
_LineTexture :: Iso (LineTexture n) (LineTexture n') (Texture n) (Texture n')
_RG :: Prism' (Texture n) (RGradient n)
_SC :: Prism' (Texture n) SomeColor
_fillTexture :: (Typeable n, Floating n) => Lens' (Style V2 n) (Texture n)
_lineTexture :: (Floating n, Typeable n) => Lens' (Style V2 n) (Texture n)
defaultLG :: Fractional n => Texture n
defaultRG :: Fractional n => Texture n
fc :: (InSpace V2 n a, Floating n, Typeable n, HasStyle a) => Colour Double -> a -> a
fcA :: (InSpace V2 n a, Floating n, Typeable n, HasStyle a) => AlphaColour Double -> a -> a
fillColor :: (InSpace V2 n a, Color c, Typeable n, Floating n, HasStyle a) => c -> a -> a
fillTexture :: (InSpace V2 n a, Typeable n, Floating n, HasStyle a) => Texture n -> a -> a
getFillTexture :: FillTexture n -> Texture n
getLineTexture :: LineTexture n -> Texture n
lGradEnd :: Lens' (LGradient n) (Point V2 n)
lGradSpreadMethod :: Lens' (LGradient n) SpreadMethod
lGradStart :: Lens' (LGradient n) (Point V2 n)
lGradStops :: Lens' (LGradient n) [GradientStop n]
lGradTrans :: Lens' (LGradient n) (Transformation V2 n)
lc :: (InSpace V2 n a, Typeable n, Floating n, HasStyle a) => Colour Double -> a -> a
lcA :: (InSpace V2 n a, Typeable n, Floating n, HasStyle a) => AlphaColour Double -> a -> a
lineColor :: (InSpace V2 n a, Color c, Typeable n, Floating n, HasStyle a) => c -> a -> a
lineTexture :: (InSpace V2 n a, Typeable n, Floating n, HasStyle a) => Texture n -> a -> a
lineTextureA :: (InSpace V2 n a, Typeable n, Floating n, HasStyle a) => LineTexture n -> a -> a
mkLinearGradient :: Num n => [GradientStop n] -> Point V2 n -> Point V2 n -> SpreadMethod -> Texture n
mkRadialGradient :: Num n => [GradientStop n] -> Point V2 n -> n -> Point V2 n -> n -> SpreadMethod -> Texture n
mkStops :: [(Colour Double, d, Double)] -> [GradientStop d]
rGradCenter0 :: Lens' (RGradient n) (Point V2 n)
rGradCenter1 :: Lens' (RGradient n) (Point V2 n)
rGradRadius0 :: Lens' (RGradient n) n
rGradRadius1 :: Lens' (RGradient n) n
rGradSpreadMethod :: Lens' (RGradient n) SpreadMethod
rGradStops :: Lens' (RGradient n) [GradientStop n]
rGradTrans :: Lens' (RGradient n) (Transformation V2 n)
recommendFillColor :: (InSpace V2 n a, Color c, Typeable n, Floating n, HasStyle a) => c -> a -> a
solid :: Color a => a -> Texture n
stopColor :: Lens' (GradientStop n) SomeColor
stopFraction :: Lens' (GradientStop n) n
(===) :: (InSpace V2 n a, Juxtaposable a, Semigroup a) => a -> a -> a
bg :: (TypeableFloat n, Renderable (Path V2 n) b) => Colour Double -> QDiagram b V2 n Any -> QDiagram b V2 n Any
bgFrame :: (TypeableFloat n, Renderable (Path V2 n) b) => n -> Colour Double -> QDiagram b V2 n Any -> QDiagram b V2 n Any
boundingRect :: (InSpace V2 n a, SameSpace a t, Enveloped t, Transformable t, TrailLike t, Monoid t, Enveloped a) => a -> t
extrudeBottom :: (OrderedField n, Monoid' m) => n -> QDiagram b V2 n m -> QDiagram b V2 n m
extrudeLeft :: (OrderedField n, Monoid' m) => n -> QDiagram b V2 n m -> QDiagram b V2 n m
extrudeRight :: (OrderedField n, Monoid' m) => n -> QDiagram b V2 n m -> QDiagram b V2 n m
extrudeTop :: (OrderedField n, Monoid' m) => n -> QDiagram b V2 n m -> QDiagram b V2 n m
hcat :: (InSpace V2 n a, Floating n, Juxtaposable a, HasOrigin a, Monoid' a) => [a] -> a
hcat' :: (InSpace V2 n a, Floating n, Juxtaposable a, HasOrigin a, Monoid' a) => CatOpts n -> [a] -> a
hsep :: (InSpace V2 n a, Floating n, Juxtaposable a, HasOrigin a, Monoid' a) => n -> [a] -> a
padX :: (Metric v, R2 v, OrderedField n, Monoid' m) => n -> QDiagram b v n m -> QDiagram b v n m
padY :: (Metric v, R2 v, Monoid' m, OrderedField n) => n -> QDiagram b v n m -> QDiagram b v n m
rectEnvelope :: (OrderedField n, Monoid' m) => Point V2 n -> V2 n -> QDiagram b V2 n m -> QDiagram b V2 n m
strutX :: (Metric v, R1 v, OrderedField n) => n -> QDiagram b v n m
strutY :: (Metric v, R2 v, OrderedField n) => n -> QDiagram b v n m
vcat :: (InSpace V2 n a, Floating n, Juxtaposable a, HasOrigin a, Monoid' a) => [a] -> a
vcat' :: (InSpace V2 n a, Floating n, Juxtaposable a, HasOrigin a, Monoid' a) => CatOpts n -> [a] -> a
vsep :: (InSpace V2 n a, Floating n, Juxtaposable a, HasOrigin a, Monoid' a) => n -> [a] -> a
(|||) :: (InSpace V2 n a, Juxtaposable a, Semigroup a) => a -> a -> a
facingX :: (R1 v, Functor v, Fractional n) => Deformation v v n
facingY :: (R2 v, Functor v, Fractional n) => Deformation v v n
parallelX0 :: (R1 v, Num n) => Deformation v v n
parallelY0 :: (R2 v, Num n) => Deformation v v n
perspectiveX1 :: (R1 v, Functor v, Fractional n) => Deformation v v n
perspectiveY1 :: (R2 v, Functor v, Floating n) => Deformation v v n
circle :: (TrailLike t, V t ~ V2, N t ~ n, Transformable t) => n -> t
ellipse :: (TrailLike t, V t ~ V2, N t ~ n, Transformable t) => n -> t
ellipseXY :: (TrailLike t, V t ~ V2, N t ~ n, Transformable t) => n -> n -> t
unitCircle :: (TrailLike t, V t ~ V2, N t ~ n) => t
image :: (TypeableFloat n, Typeable a, Renderable (DImage n a) b) => DImage n a -> QDiagram b V2 n Any
loadImageEmb :: Num n => FilePath -> IO (Either String (DImage n Embedded))
loadImageExt :: Num n => FilePath -> IO (Either String (DImage n External))
raster :: Num n => (Int -> Int -> AlphaColour Double) -> Int -> Int -> DImage n Embedded
rasterDia :: (TypeableFloat n, Renderable (DImage n Embedded) b) => (Int -> Int -> AlphaColour Double) -> Int -> Int -> QDiagram b V2 n Any
uncheckedImageRef :: Num n => FilePath -> Int -> Int -> DImage n External
eColor :: Lens' (EnvelopeOpts n) (Colour Double)
eLineWidth :: Lens (EnvelopeOpts n1) (EnvelopeOpts n2) (Measure n1) (Measure n2)
ePoints :: Lens' (EnvelopeOpts n) Int
oColor :: Lens' (OriginOpts n) (Colour Double)
oMinSize :: Lens' (OriginOpts n) n
oScale :: Lens' (OriginOpts n) n
showEnvelope :: (Enum n, TypeableFloat n, Renderable (Path V2 n) b) => QDiagram b V2 n Any -> QDiagram b V2 n Any
showEnvelope' :: (Enum n, TypeableFloat n, Renderable (Path V2 n) b) => EnvelopeOpts n -> QDiagram b V2 n Any -> QDiagram b V2 n Any
showLabels :: (TypeableFloat n, Renderable (Text n) b, Semigroup m) => QDiagram b V2 n m -> QDiagram b V2 n Any
showOrigin :: (TypeableFloat n, Renderable (Path V2 n) b, Monoid' m) => QDiagram b V2 n m -> QDiagram b V2 n m
showOrigin' :: (TypeableFloat n, Renderable (Path V2 n) b, Monoid' m) => OriginOpts n -> QDiagram b V2 n m -> QDiagram b V2 n m
showTrace :: (Enum n, TypeableFloat n, Renderable (Path V2 n) b) => QDiagram b V2 n Any -> QDiagram b V2 n Any
showTrace' :: (Enum n, TypeableFloat n, Renderable (Path V2 n) b) => TraceOpts n -> QDiagram b V2 n Any -> QDiagram b V2 n Any
tColor :: Lens' (TraceOpts n) (Colour Double)
tMinSize :: Lens' (TraceOpts n) n
tPoints :: Lens' (TraceOpts n) Int
tScale :: Lens' (TraceOpts n) n
_Clip :: Iso (Clip n) (Clip n') [Path V2 n] [Path V2 n']
_clip :: (Typeable n, OrderedField n) => Lens' (Style V2 n) [Path V2 n]
_fillRule :: Lens' (Style V2 n) FillRule
clipBy :: (HasStyle a, V a ~ V2, N a ~ n, TypeableFloat n) => Path V2 n -> a -> a
clipTo :: TypeableFloat n => Path V2 n -> QDiagram b V2 n Any -> QDiagram b V2 n Any
clipped :: TypeableFloat n => Path V2 n -> QDiagram b V2 n Any -> QDiagram b V2 n Any
fillRule :: HasStyle a => FillRule -> a -> a
intersectPoints :: (InSpace V2 n t, SameSpace t s, ToPath t, ToPath s, OrderedField n) => t -> s -> [P2 n]
intersectPoints' :: (InSpace V2 n t, SameSpace t s, ToPath t, ToPath s, OrderedField n) => n -> t -> s -> [P2 n]
intersectPointsP :: OrderedField n => Path V2 n -> Path V2 n -> [P2 n]
intersectPointsP' :: OrderedField n => n -> Path V2 n -> Path V2 n -> [P2 n]
intersectPointsT :: OrderedField n => Located (Trail V2 n) -> Located (Trail V2 n) -> [P2 n]
intersectPointsT' :: OrderedField n => n -> Located (Trail V2 n) -> Located (Trail V2 n) -> [P2 n]
queryFillRule :: Lens' (StrokeOpts a) FillRule
stroke :: (InSpace V2 n t, ToPath t, TypeableFloat n, Renderable (Path V2 n) b) => t -> QDiagram b V2 n Any
stroke' :: (InSpace V2 n t, ToPath t, TypeableFloat n, Renderable (Path V2 n) b, IsName a) => StrokeOpts a -> t -> QDiagram b V2 n Any
strokeLine :: (TypeableFloat n, Renderable (Path V2 n) b) => Trail' Line V2 n -> QDiagram b V2 n Any
strokeLocLine :: (TypeableFloat n, Renderable (Path V2 n) b) => Located (Trail' Line V2 n) -> QDiagram b V2 n Any
strokeLocLoop :: (TypeableFloat n, Renderable (Path V2 n) b) => Located (Trail' Loop V2 n) -> QDiagram b V2 n Any
strokeLocT :: (TypeableFloat n, Renderable (Path V2 n) b) => Located (Trail V2 n) -> QDiagram b V2 n Any
strokeLocTrail :: (TypeableFloat n, Renderable (Path V2 n) b) => Located (Trail V2 n) -> QDiagram b V2 n Any
strokeLoop :: (TypeableFloat n, Renderable (Path V2 n) b) => Trail' Loop V2 n -> QDiagram b V2 n Any
strokeP :: (TypeableFloat n, Renderable (Path V2 n) b) => Path V2 n -> QDiagram b V2 n Any
strokeP' :: (TypeableFloat n, Renderable (Path V2 n) b, IsName a) => StrokeOpts a -> Path V2 n -> QDiagram b V2 n Any
strokePath :: (TypeableFloat n, Renderable (Path V2 n) b) => Path V2 n -> QDiagram b V2 n Any
strokePath' :: (TypeableFloat n, Renderable (Path V2 n) b, IsName a) => StrokeOpts a -> Path V2 n -> QDiagram b V2 n Any
strokeT :: (TypeableFloat n, Renderable (Path V2 n) b) => Trail V2 n -> QDiagram b V2 n Any
strokeT' :: (TypeableFloat n, Renderable (Path V2 n) b, IsName a) => StrokeOpts a -> Trail V2 n -> QDiagram b V2 n Any
strokeTrail :: (TypeableFloat n, Renderable (Path V2 n) b) => Trail V2 n -> QDiagram b V2 n Any
strokeTrail' :: (TypeableFloat n, Renderable (Path V2 n) b, IsName a) => StrokeOpts a -> Trail V2 n -> QDiagram b V2 n Any
vertexNames :: Lens (StrokeOpts a) (StrokeOpts a') [[a]] [[a']]
polyCenter :: Lens' (PolygonOpts n) (Point V2 n)
polyOrient :: Lens' (PolygonOpts n) (PolyOrientation n)
polyTrail :: OrderedField n => PolygonOpts n -> Located (Trail V2 n)
polyType :: Lens' (PolygonOpts n) (PolyType n)
polygon :: (InSpace V2 n t, TrailLike t) => PolygonOpts n -> t
star :: OrderedField n => StarOpts -> [Point V2 n] -> Path V2 n
decagon :: (InSpace V2 n t, TrailLike t) => n -> t
dodecagon :: (InSpace V2 n t, TrailLike t) => n -> t
eqTriangle :: (InSpace V2 n t, TrailLike t) => n -> t
hendecagon :: (InSpace V2 n t, TrailLike t) => n -> t
heptagon :: (InSpace V2 n t, TrailLike t) => n -> t
hexagon :: (InSpace V2 n t, TrailLike t) => n -> t
hrule :: (InSpace V2 n t, TrailLike t) => n -> t
nonagon :: (InSpace V2 n t, TrailLike t) => n -> t
octagon :: (InSpace V2 n t, TrailLike t) => n -> t
pentagon :: (InSpace V2 n t, TrailLike t) => n -> t
radiusBL :: Lens' (RoundedRectOpts d) d
radiusBR :: Lens' (RoundedRectOpts d) d
radiusTL :: Lens' (RoundedRectOpts d) d
radiusTR :: Lens' (RoundedRectOpts d) d
rect :: (InSpace V2 n t, TrailLike t) => n -> n -> t
regPoly :: (InSpace V2 n t, TrailLike t) => Int -> n -> t
roundedRect :: (InSpace V2 n t, TrailLike t, RealFloat n) => n -> n -> n -> t
roundedRect' :: (InSpace V2 n t, TrailLike t, RealFloat n) => n -> n -> RoundedRectOpts n -> t
septagon :: (InSpace V2 n t, TrailLike t) => n -> t
square :: (InSpace V2 n t, TrailLike t) => n -> t
triangle :: (InSpace V2 n t, TrailLike t) => n -> t
unitSquare :: (InSpace V2 n t, TrailLike t) => t
vrule :: (InSpace V2 n t, TrailLike t) => n -> t
dims2D :: n -> n -> SizeSpec V2 n
extentX :: (InSpace v n a, R1 v, Enveloped a) => a -> Maybe (n, n)
extentY :: (InSpace v n a, R2 v, Enveloped a) => a -> Maybe (n, n)
height :: (InSpace V2 n a, Enveloped a) => a -> n
mkHeight :: Num n => n -> SizeSpec V2 n
mkSizeSpec2D :: Num n => Maybe n -> Maybe n -> SizeSpec V2 n
mkWidth :: Num n => n -> SizeSpec V2 n
width :: (InSpace V2 n a, Enveloped a) => a -> n
_font :: Lens' (Style v n) (Maybe String)
_fontSize :: (Typeable n, OrderedField n) => Lens' (Style v n) (Measure n)
_fontSizeR :: (Typeable n, OrderedField n) => Lens' (Style v n) (Measured n (Recommend n))
alignedText :: (TypeableFloat n, Renderable (Text n) b) => n -> n -> String -> QDiagram b V2 n Any
baselineText :: (TypeableFloat n, Renderable (Text n) b) => String -> QDiagram b V2 n Any
bold :: HasStyle a => a -> a
bolder :: HasStyle a => a -> a
font :: HasStyle a => String -> a -> a
fontSize :: (N a ~ n, Typeable n, HasStyle a) => Measure n -> a -> a
fontSizeG :: (N a ~ n, Typeable n, Num n, HasStyle a) => n -> a -> a
fontSizeL :: (N a ~ n, Typeable n, Num n, HasStyle a) => n -> a -> a
fontSizeN :: (N a ~ n, Typeable n, Num n, HasStyle a) => n -> a -> a
fontSizeO :: (N a ~ n, Typeable n, HasStyle a) => n -> a -> a
heavy :: HasStyle a => a -> a
italic :: HasStyle a => a -> a
light :: HasStyle a => a -> a
lighter :: HasStyle a => a -> a
mediumWeight :: HasStyle a => a -> a
oblique :: HasStyle a => a -> a
semiBold :: HasStyle a => a -> a
text :: (TypeableFloat n, Renderable (Text n) b) => String -> QDiagram b V2 n Any
thinWeight :: HasStyle a => a -> a
topLeftText :: (TypeableFloat n, Renderable (Text n) b) => String -> QDiagram b V2 n Any
ultraBold :: HasStyle a => a -> a
ultraLight :: HasStyle a => a -> a
reflectAbout :: (InSpace V2 n t, OrderedField n, Transformable t) => P2 n -> Direction V2 n -> t -> t
reflectX :: (InSpace v n t, R1 v, Transformable t) => t -> t
reflectXY :: (InSpace v n t, R2 v, Transformable t) => t -> t
reflectY :: (InSpace v n t, R2 v, Transformable t) => t -> t
reflectionAbout :: OrderedField n => P2 n -> Direction V2 n -> T2 n
reflectionX :: (Additive v, R1 v, Num n) => Transformation v n
reflectionXY :: (Additive v, R2 v, Num n) => Transformation v n
reflectionY :: (Additive v, R2 v, Num n) => Transformation v n
rotateAround :: (InSpace V2 n t, Transformable t, Floating n) => P2 n -> Angle n -> t -> t
rotateBy :: (InSpace V2 n t, Transformable t, Floating n) => n -> t -> t
rotateTo :: (InSpace V2 n t, OrderedField n, Transformable t) => Direction V2 n -> t -> t
rotated :: (InSpace V2 n a, Floating n, SameSpace a b, Transformable a, Transformable b) => Angle n -> Iso a b a b
rotationAround :: Floating n => P2 n -> Angle n -> T2 n
rotationTo :: OrderedField n => Direction V2 n -> T2 n
scaleRotateTo :: (InSpace V2 n t, Transformable t, Floating n) => V2 n -> t -> t
scaleToX :: (InSpace v n t, R2 v, Enveloped t, Transformable t) => n -> t -> t
scaleToY :: (InSpace v n t, R2 v, Enveloped t, Transformable t) => n -> t -> t
scaleUToX :: (InSpace v n t, R1 v, Enveloped t, Transformable t) => n -> t -> t
scaleUToY :: (InSpace v n t, R2 v, Enveloped t, Transformable t) => n -> t -> t
scaleX :: (InSpace v n t, R2 v, Fractional n, Transformable t) => n -> t -> t
scaleY :: (InSpace v n t, R2 v, Fractional n, Transformable t) => n -> t -> t
scalingRotationTo :: Floating n => V2 n -> T2 n
scalingX :: (Additive v, R1 v, Fractional n) => n -> Transformation v n
scalingY :: (Additive v, R2 v, Fractional n) => n -> Transformation v n
shearX :: (InSpace V2 n t, Transformable t) => n -> t -> t
shearY :: (InSpace V2 n t, Transformable t) => n -> t -> t
shearingX :: Num n => n -> T2 n
shearingY :: Num n => n -> T2 n
translateX :: (InSpace v n t, R1 v, Transformable t) => n -> t -> t
translateY :: (InSpace v n t, R2 v, Transformable t) => n -> t -> t
translationX :: (Additive v, R1 v, Num n) => n -> Transformation v n
translationY :: (Additive v, R2 v, Num n) => n -> Transformation v n
mkP2 :: n -> n -> P2 n
mkR2 :: n -> n -> V2 n
p2 :: (n, n) -> P2 n
r2 :: (n, n) -> V2 n
r2PolarIso :: RealFloat n => Iso' (V2 n) (n, Angle n)
unp2 :: P2 n -> (n, n)
unr2 :: V2 n -> (n, n)
angleDir :: Floating n => Angle n -> Direction V2 n
angleV :: Floating n => Angle n -> V2 n
leftTurn :: (Num n, Ord n) => V2 n -> V2 n -> Bool
signedAngleBetween :: RealFloat n => V2 n -> V2 n -> Angle n
signedAngleBetweenDirs :: RealFloat n => Direction V2 n -> Direction V2 n -> Angle n
unitX :: (R1 v, Additive v, Num n) => v n
unitY :: (R2 v, Additive v, Num n) => v n
unit_X :: (R1 v, Additive v, Num n) => v n
unit_Y :: (R2 v, Additive v, Num n) => v n
xDir :: (R1 v, Additive v, Num n) => Direction v n
yDir :: (R2 v, Additive v, Num n) => Direction v n
(#) :: a -> (a -> b) -> b
(##) :: AReview t b -> b -> t
applyAll :: [a -> a] -> a -> a
findHsFile :: FilePath -> IO (Maybe FilePath)
findSandbox :: [FilePath] -> IO (Maybe FilePath)
foldB :: (a -> a -> a) -> a -> [a] -> a
globalPackage :: IO FilePath
iterateN :: Int -> (a -> a) -> a -> [a]
tau :: Floating a => a
with :: Default d => d
(#.) :: Coercible c b => (b -> c) -> (a -> b) -> a -> c
(.#) :: Coercible b a => (b -> c) -> (a -> b) -> a -> c
_Point :: Iso' (Point f a) (f a)
distanceA :: (Floating a, Foldable (Diff p), Affine p) => p a -> p a -> a
lensP :: Lens' (Point g a) (g a)
origin :: (Additive f, Num a) => Point f a
qdA :: (Affine p, Foldable (Diff p), Num a) => p a -> p a -> a
relative :: (Additive f, Num a) => Point f a -> Iso' (Point f a) (f a)
unP :: Point f a -> f a
normalize :: (Floating a, Metric f, Epsilon a) => f a -> f a
project :: (Metric v, Fractional a) => v a -> v a -> v a
perp :: Num a => V2 a -> V2 a
(*^) :: (Functor f, Num a) => a -> f a -> f a
(^*) :: (Functor f, Num a) => f a -> a -> f a
(^/) :: (Functor f, Fractional a) => f a -> a -> f a
basis :: (Additive t, Traversable t, Num a) => [t a]
basisFor :: (Traversable t, Num a) => t b -> [t a]
negated :: (Functor f, Num a) => f a -> f a
outer :: (Functor f, Functor g, Num a) => f a -> g a -> f (g a)
scaled :: (Traversable t, Num a) => t a -> t (t a)
sumV :: (Foldable f, Additive v, Num a) => f (v a) -> v a
unit :: (Additive t, Num a) => ASetter' (t a) a -> t a
iat :: At m => Index m -> IndexedLens' (Index m) m (Maybe (IxValue m))
icontains :: Contains m => Index m -> IndexedLens' (Index m) m Bool
iix :: Ixed m => Index m -> IndexedTraversal' (Index m) m (IxValue m)
ixAt :: At m => Index m -> Traversal' m (IxValue m)
sans :: At m => Index m -> m -> m
pattern (:<) :: forall b a. Cons b b a a => a -> b -> b
pattern (:>) :: forall a b. Snoc a a b b => a -> b -> a
(<|) :: Cons s s a a => a -> s -> s
_head :: Cons s s a a => Traversal' s a
_init :: Snoc s s a a => Traversal' s s
_last :: Snoc s s a a => Traversal' s a
_tail :: Cons s s a a => Traversal' s s
cons :: Cons s s a a => a -> s -> s
snoc :: Snoc s s a a => s -> a -> s
uncons :: Cons s s a a => s -> Maybe (a, s)
unsnoc :: Snoc s s a a => s -> Maybe (s, a)
(|>) :: Snoc s s a a => s -> a -> s
pattern Empty :: forall s. AsEmpty s => s
fromEq :: AnEquality s t a b -> Equality b a t s
mapEq :: AnEquality s t a b -> f s -> f a
runEq :: AnEquality s t a b -> Identical s t a b
simple :: Equality' a a
simply :: (Optic' p f s a -> r) -> Optic' p f s a -> r
substEq :: AnEquality s t a b -> ((s ~ a) -> (t ~ b) -> r) -> r
(^..) :: s -> Getting (Endo [a]) s a -> [a]
(^?) :: s -> Getting (First a) s a -> Maybe a
(^?!) :: HasCallStack => s -> Getting (Endo a) s a -> a
(^@..) :: s -> IndexedGetting i (Endo [(i, a)]) s a -> [(i, a)]
(^@?) :: s -> IndexedGetting i (Endo (Maybe (i, a))) s a -> Maybe (i, a)
(^@?!) :: HasCallStack => s -> IndexedGetting i (Endo (i, a)) s a -> (i, a)
allOf :: Getting All s a -> (a -> Bool) -> s -> Bool
andOf :: Getting All s Bool -> s -> Bool
anyOf :: Getting Any s a -> (a -> Bool) -> s -> Bool
asumOf :: Alternative f => Getting (Endo (f a)) s (f a) -> s -> f a
concatMapOf :: Getting [r] s a -> (a -> [r]) -> s -> [r]
concatOf :: Getting [r] s [r] -> s -> [r]
cycled :: Apply f => LensLike f s t a b -> LensLike f s t a b
droppingWhile :: (Conjoined p, Profunctor q, Applicative f) => (a -> Bool) -> Optical p q (Compose (State Bool) f) s t a a -> Optical p q f s t a a
elemIndexOf :: Eq a => IndexedGetting i (First i) s a -> a -> s -> Maybe i
elemIndicesOf :: Eq a => IndexedGetting i (Endo [i]) s a -> a -> s -> [i]
elemOf :: Eq a => Getting Any s a -> a -> s -> Bool
filtered :: (Choice p, Applicative f) => (a -> Bool) -> Optic' p f a a
findIndexOf :: IndexedGetting i (First i) s a -> (a -> Bool) -> s -> Maybe i
findIndicesOf :: IndexedGetting i (Endo [i]) s a -> (a -> Bool) -> s -> [i]
findMOf :: Monad m => Getting (Endo (m (Maybe a))) s a -> (a -> m Bool) -> s -> m (Maybe a)
findOf :: Getting (Endo (Maybe a)) s a -> (a -> Bool) -> s -> Maybe a
first1Of :: Getting (First a) s a -> s -> a
firstOf :: Getting (Leftmost a) s a -> s -> Maybe a
foldByOf :: Fold s a -> (a -> a -> a) -> a -> s -> a
foldMapByOf :: Fold s a -> (r -> r -> r) -> r -> (a -> r) -> s -> r
foldMapOf :: Getting r s a -> (a -> r) -> s -> r
foldOf :: Getting a s a -> s -> a
folded :: Foldable f => IndexedFold Int (f a) a
folded64 :: Foldable f => IndexedFold Int64 (f a) a
folding :: Foldable f => (s -> f a) -> Fold s a
foldl1Of :: HasCallStack => Getting (Dual (Endo (Maybe a))) s a -> (a -> a -> a) -> s -> a
foldl1Of' :: HasCallStack => Getting (Endo (Endo (Maybe a))) s a -> (a -> a -> a) -> s -> a
foldlMOf :: Monad m => Getting (Endo (r -> m r)) s a -> (r -> a -> m r) -> r -> s -> m r
foldlOf :: Getting (Dual (Endo r)) s a -> (r -> a -> r) -> r -> s -> r
foldlOf' :: Getting (Endo (Endo r)) s a -> (r -> a -> r) -> r -> s -> r
foldr1Of :: HasCallStack => Getting (Endo (Maybe a)) s a -> (a -> a -> a) -> s -> a
foldr1Of' :: HasCallStack => Getting (Dual (Endo (Endo (Maybe a)))) s a -> (a -> a -> a) -> s -> a
foldrMOf :: Monad m => Getting (Dual (Endo (r -> m r))) s a -> (a -> r -> m r) -> r -> s -> m r
foldrOf :: Getting (Endo r) s a -> (a -> r -> r) -> r -> s -> r
foldrOf' :: Getting (Dual (Endo (Endo r))) s a -> (a -> r -> r) -> r -> s -> r
foldring :: (Contravariant f, Applicative f) => ((a -> f a -> f a) -> f a -> s -> f a) -> LensLike f s t a b
for1Of_ :: Functor f => Getting (TraversedF r f) s a -> s -> (a -> f r) -> f ()
forMOf_ :: Monad m => Getting (Sequenced r m) s a -> s -> (a -> m r) -> m ()
forOf_ :: Functor f => Getting (Traversed r f) s a -> s -> (a -> f r) -> f ()
has :: Getting Any s a -> s -> Bool
hasn't :: Getting All s a -> s -> Bool
iallOf :: IndexedGetting i All s a -> (i -> a -> Bool) -> s -> Bool
ianyOf :: IndexedGetting i Any s a -> (i -> a -> Bool) -> s -> Bool
iconcatMapOf :: IndexedGetting i [r] s a -> (i -> a -> [r]) -> s -> [r]
idroppingWhile :: (Indexable i p, Profunctor q, Applicative f) => (i -> a -> Bool) -> Optical (Indexed i) q (Compose (State Bool) f) s t a a -> Optical p q f s t a a
ifiltered :: (Indexable i p, Applicative f) => (i -> a -> Bool) -> Optical' p (Indexed i) f a a
ifindMOf :: Monad m => IndexedGetting i (Endo (m (Maybe a))) s a -> (i -> a -> m Bool) -> s -> m (Maybe a)
ifindOf :: IndexedGetting i (Endo (Maybe a)) s a -> (i -> a -> Bool) -> s -> Maybe a
ifoldMapOf :: IndexedGetting i m s a -> (i -> a -> m) -> s -> m
ifolding :: (Foldable f, Indexable i p, Contravariant g, Applicative g) => (s -> f (i, a)) -> Over p g s t a b
ifoldlMOf :: Monad m => IndexedGetting i (Endo (r -> m r)) s a -> (i -> r -> a -> m r) -> r -> s -> m r
ifoldlOf :: IndexedGetting i (Dual (Endo r)) s a -> (i -> r -> a -> r) -> r -> s -> r
ifoldlOf' :: IndexedGetting i (Endo (r -> r)) s a -> (i -> r -> a -> r) -> r -> s -> r
ifoldrMOf :: Monad m => IndexedGetting i (Dual (Endo (r -> m r))) s a -> (i -> a -> r -> m r) -> r -> s -> m r
ifoldrOf :: IndexedGetting i (Endo r) s a -> (i -> a -> r -> r) -> r -> s -> r
ifoldrOf' :: IndexedGetting i (Dual (Endo (r -> r))) s a -> (i -> a -> r -> r) -> r -> s -> r
ifoldring :: (Indexable i p, Contravariant f, Applicative f) => ((i -> a -> f a -> f a) -> f a -> s -> f a) -> Over p f s t a b
iforMOf_ :: Monad m => IndexedGetting i (Sequenced r m) s a -> s -> (i -> a -> m r) -> m ()
iforOf_ :: Functor f => IndexedGetting i (Traversed r f) s a -> s -> (i -> a -> f r) -> f ()
imapMOf_ :: Monad m => IndexedGetting i (Sequenced r m) s a -> (i -> a -> m r) -> s -> m ()
inoneOf :: IndexedGetting i Any s a -> (i -> a -> Bool) -> s -> Bool
ipre :: IndexedGetting i (First (i, a)) s a -> IndexPreservingGetter s (Maybe (i, a))
ipreuse :: MonadState s m => IndexedGetting i (First (i, a)) s a -> m (Maybe (i, a))
ipreuses :: MonadState s m => IndexedGetting i (First r) s a -> (i -> a -> r) -> m (Maybe r)
ipreview :: MonadReader s m => IndexedGetting i (First (i, a)) s a -> m (Maybe (i, a))
ipreviews :: MonadReader s m => IndexedGetting i (First r) s a -> (i -> a -> r) -> m (Maybe r)
itakingWhile :: (Indexable i p, Profunctor q, Contravariant f, Applicative f) => (i -> a -> Bool) -> Optical' (Indexed i) q (Const (Endo (f s)) :: Type -> Type) s a -> Optical' p q f s a
iterated :: Apply f => (a -> a) -> LensLike' f a a
itoListOf :: IndexedGetting i (Endo [(i, a)]) s a -> s -> [(i, a)]
itraverseOf_ :: Functor f => IndexedGetting i (Traversed r f) s a -> (i -> a -> f r) -> s -> f ()
last1Of :: Getting (Last a) s a -> s -> a
lastOf :: Getting (Rightmost a) s a -> s -> Maybe a
lengthOf :: Getting (Endo (Endo Int)) s a -> s -> Int
lined :: Applicative f => IndexedLensLike' Int f String String
lookupOf :: Eq k => Getting (Endo (Maybe v)) s (k, v) -> k -> s -> Maybe v
mapMOf_ :: Monad m => Getting (Sequenced r m) s a -> (a -> m r) -> s -> m ()
maximum1Of :: Ord a => Getting (Max a) s a -> s -> a
maximumByOf :: Getting (Endo (Endo (Maybe a))) s a -> (a -> a -> Ordering) -> s -> Maybe a
maximumOf :: Ord a => Getting (Endo (Endo (Maybe a))) s a -> s -> Maybe a
minimum1Of :: Ord a => Getting (Min a) s a -> s -> a
minimumByOf :: Getting (Endo (Endo (Maybe a))) s a -> (a -> a -> Ordering) -> s -> Maybe a
minimumOf :: Ord a => Getting (Endo (Endo (Maybe a))) s a -> s -> Maybe a
msumOf :: MonadPlus m => Getting (Endo (m a)) s (m a) -> s -> m a
noneOf :: Getting Any s a -> (a -> Bool) -> s -> Bool
notElemOf :: Eq a => Getting All s a -> a -> s -> Bool
notNullOf :: Getting Any s a -> s -> Bool
nullOf :: Getting All s a -> s -> Bool
orOf :: Getting Any s Bool -> s -> Bool
pre :: Getting (First a) s a -> IndexPreservingGetter s (Maybe a)
preuse :: MonadState s m => Getting (First a) s a -> m (Maybe a)
preuses :: MonadState s m => Getting (First r) s a -> (a -> r) -> m (Maybe r)
preview :: MonadReader s m => Getting (First a) s a -> m (Maybe a)
previews :: MonadReader s m => Getting (First r) s a -> (a -> r) -> m (Maybe r)
productOf :: Num a => Getting (Endo (Endo a)) s a -> s -> a
repeated :: Apply f => LensLike' f a a
replicated :: Int -> Fold a a
sequence1Of_ :: Functor f => Getting (TraversedF a f) s (f a) -> s -> f ()
sequenceAOf_ :: Functor f => Getting (Traversed a f) s (f a) -> s -> f ()
sequenceOf_ :: Monad m => Getting (Sequenced a m) s (m a) -> s -> m ()
sumOf :: Num a => Getting (Endo (Endo a)) s a -> s -> a
takingWhile :: (Conjoined p, Applicative f) => (a -> Bool) -> Over p (TakingWhile p f a a) s t a a -> Over p f s t a a
toListOf :: Getting (Endo [a]) s a -> s -> [a]
toNonEmptyOf :: Getting (NonEmptyDList a) s a -> s -> NonEmpty a
traverse1Of_ :: Functor f => Getting (TraversedF r f) s a -> (a -> f r) -> s -> f ()
traverseOf_ :: Functor f => Getting (Traversed r f) s a -> (a -> f r) -> s -> f ()
unfolded :: (b -> Maybe (a, b)) -> Fold b a
worded :: Applicative f => IndexedLensLike' Int f String String
(^.) :: s -> Getting a s a -> a
(^@.) :: s -> IndexedGetting i (i, a) s a -> (i, a)
getting :: (Profunctor p, Profunctor q, Functor f, Contravariant f) => Optical p q f s t a b -> Optical' p q f s a
ilike :: (Indexable i p, Contravariant f, Functor f) => i -> a -> Over' p f s a
ilistening :: MonadWriter w m => IndexedGetting i (i, u) w u -> m a -> m (a, (i, u))
ilistenings :: MonadWriter w m => IndexedGetting i v w u -> (i -> u -> v) -> m a -> m (a, v)
ito :: (Indexable i p, Contravariant f) => (s -> (i, a)) -> Over' p f s a
iuse :: MonadState s m => IndexedGetting i (i, a) s a -> m (i, a)
iuses :: MonadState s m => IndexedGetting i r s a -> (i -> a -> r) -> m r
iview :: MonadReader s m => IndexedGetting i (i, a) s a -> m (i, a)
iviews :: MonadReader s m => IndexedGetting i r s a -> (i -> a -> r) -> m r
like :: (Profunctor p, Contravariant f, Functor f) => a -> Optic' p f s a
listening :: MonadWriter w m => Getting u w u -> m a -> m (a, u)
listenings :: MonadWriter w m => Getting v w u -> (u -> v) -> m a -> m (a, v)
to :: (Profunctor p, Contravariant f) => (s -> a) -> Optic' p f s a
use :: MonadState s m => Getting a s a -> m a
uses :: MonadState s m => LensLike' (Const r :: Type -> Type) s a -> (a -> r) -> m r
view :: MonadReader s m => Getting a s a -> m a
views :: MonadReader s m => LensLike' (Const r :: Type -> Type) s a -> (a -> r) -> m r
(<.) :: Indexable i p => (Indexed i s t -> r) -> ((a -> b) -> s -> t) -> p a b -> r
iall :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Bool
iany :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Bool
icompose :: Indexable p c => (i -> j -> p) -> (Indexed i s t -> r) -> (Indexed j a b -> s -> t) -> c a b -> r
iconcatMap :: FoldableWithIndex i f => (i -> a -> [b]) -> f a -> [b]
ifind :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Maybe (i, a)
ifoldMapBy :: FoldableWithIndex i t => (r -> r -> r) -> r -> (i -> a -> r) -> t a -> r
ifoldMapByOf :: IndexedFold i t a -> (r -> r -> r) -> r -> (i -> a -> r) -> t -> r
ifoldlM :: (FoldableWithIndex i f, Monad m) => (i -> b -> a -> m b) -> b -> f a -> m b
ifoldrM :: (FoldableWithIndex i f, Monad m) => (i -> a -> b -> m b) -> b -> f a -> m b
ifor :: (TraversableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f (t b)
iforM :: (TraversableWithIndex i t, Monad m) => t a -> (i -> a -> m b) -> m (t b)
iforM_ :: (FoldableWithIndex i t, Monad m) => t a -> (i -> a -> m b) -> m ()
ifor_ :: (FoldableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f ()
imapAccumL :: TraversableWithIndex i t => (i -> s -> a -> (s, b)) -> s -> t a -> (s, t b)
imapAccumR :: TraversableWithIndex i t => (i -> s -> a -> (s, b)) -> s -> t a -> (s, t b)
imapM :: (TraversableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m (t b)
imapM_ :: (FoldableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m ()
index :: (Indexable i p, Eq i, Applicative f) => i -> Optical' p (Indexed i) f a a
inone :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Bool
itoList :: FoldableWithIndex i f => f a -> [(i, a)]
itraverseBy :: TraversableWithIndex i t => (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> t a -> f (t b)
itraverseByOf :: IndexedTraversal i s t a b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> s -> f t
itraverse_ :: (FoldableWithIndex i t, Applicative f) => (i -> a -> f b) -> t a -> f ()
reindexed :: Indexable j p => (i -> j) -> (Indexed i a b -> r) -> p a b -> r
selfIndex :: Indexable a p => p a fb -> a -> fb
asIndex :: (Indexable i p, Contravariant f, Functor f) => p i (f i) -> Indexed i s (f s)
indexing :: Indexable Int p => ((a -> Indexing f b) -> s -> Indexing f t) -> p a (f b) -> s -> f t
indexing64 :: Indexable Int64 p => ((a -> Indexing64 f b) -> s -> Indexing64 f t) -> p a (f b) -> s -> f t
withIndex :: (Indexable i p, Functor f) => p (i, s) (f (j, t)) -> Indexed i s (f t)
makeClassyPrisms :: Name -> DecsQ
makePrisms :: Name -> DecsQ
retagged :: (Profunctor p, Bifunctor p) => p a b -> p s b
pattern Lazy :: forall t s. Strict t s => t -> s
pattern List :: forall l. IsList l => [Item l] -> l
pattern Reversed :: forall t. Reversing t => t -> t
pattern Strict :: forall s t. Strict s t => t -> s
pattern Swapped :: forall (p :: Type -> Type -> Type) c d. Swapped p => p d c -> p c d
anon :: a -> (a -> Bool) -> Iso' (Maybe a) a
au :: Functor f => AnIso s t a b -> ((b -> t) -> f s) -> f a
auf :: Optic (Costar f) g s t a b -> (f a -> g b) -> f s -> g t
bimapping :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (f s s') (g t t') (f a a') (g b b')
cloneIso :: AnIso s t a b -> Iso s t a b
coerced :: (Coercible s a, Coercible t b) => Iso s t a b
contramapping :: Contravariant f => AnIso s t a b -> Iso (f a) (f b) (f s) (f t)
curried :: Iso ((a, b) -> c) ((d, e) -> f) (a -> b -> c) (d -> e -> f)
dimapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (p a s') (q b t') (p s a') (q t b')
enum :: Enum a => Iso' Int a
firsting :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f s x) (g t y) (f a x) (g b y)
flipped :: Iso (a -> b -> c) (a' -> b' -> c') (b -> a -> c) (b' -> a' -> c')
from :: AnIso s t a b -> Iso b a t s
imagma :: Over (Indexed i) (Molten i a b) s t a b -> Iso s t' (Magma i t b a) (Magma j t' c c)
involuted :: (a -> a) -> Iso' a a
iso :: (s -> a) -> (b -> t) -> Iso s t a b
lazy :: Strict lazy strict => Iso' strict lazy
lmapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p a x) (q b y) (p s x) (q t y)
magma :: LensLike (Mafic a b) s t a b -> Iso s u (Magma Int t b a) (Magma j u c c)
mapping :: (Functor f, Functor g) => AnIso s t a b -> Iso (f s) (g t) (f a) (g b)
non :: Eq a => a -> Iso' (Maybe a) a
non' :: APrism' a () -> Iso' (Maybe a) a
reversed :: Reversing a => Iso' a a
rmapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p x s) (q y t) (p x a) (q y b)
seconding :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f x s) (g y t) (f x a) (g y b)
uncurried :: Iso (a -> b -> c) (d -> e -> f) ((a, b) -> c) ((d, e) -> f)
under :: AnIso s t a b -> (t -> s) -> b -> a
withIso :: AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
(#%%=) :: MonadState s m => ALens s s a b -> (a -> (r, b)) -> m r
(#%%~) :: Functor f => ALens s t a b -> (a -> f b) -> s -> f t
(#%=) :: MonadState s m => ALens s s a b -> (a -> b) -> m ()
(#%~) :: ALens s t a b -> (a -> b) -> s -> t
(#=) :: MonadState s m => ALens s s a b -> b -> m ()
(#~) :: ALens s t a b -> b -> s -> t
(%%=) :: MonadState s m => Over p ((,) r) s s a b -> p a (r, b) -> m r
(%%@=) :: MonadState s m => Over (Indexed i) ((,) r) s s a b -> (i -> a -> (r, b)) -> m r
(%%@~) :: Over (Indexed i) f s t a b -> (i -> a -> f b) -> s -> f t
(%%~) :: LensLike f s t a b -> (a -> f b) -> s -> f t
(&~) :: s -> State s a -> s
(<#%=) :: MonadState s m => ALens s s a b -> (a -> b) -> m b
(<#%~) :: ALens s t a b -> (a -> b) -> s -> (b, t)
(<#=) :: MonadState s m => ALens s s a b -> b -> m b
(<#~) :: ALens s t a b -> b -> s -> (b, t)
(<%=) :: MonadState s m => LensLike ((,) b) s s a b -> (a -> b) -> m b
(<%@=) :: MonadState s m => Over (Indexed i) ((,) b) s s a b -> (i -> a -> b) -> m b
(<%@~) :: Over (Indexed i) ((,) b) s t a b -> (i -> a -> b) -> s -> (b, t)
(<%~) :: LensLike ((,) b) s t a b -> (a -> b) -> s -> (b, t)
(<&&=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool
(<&&~) :: LensLike ((,) Bool) s t Bool Bool -> Bool -> s -> (Bool, t)
(<**=) :: (MonadState s m, Floating a) => LensLike' ((,) a) s a -> a -> m a
(<**~) :: Floating a => LensLike ((,) a) s t a a -> a -> s -> (a, t)
(<*=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a
(<*~) :: Num a => LensLike ((,) a) s t a a -> a -> s -> (a, t)
(<+=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a
(<+~) :: Num a => LensLike ((,) a) s t a a -> a -> s -> (a, t)
(<-=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a
(<-~) :: Num a => LensLike ((,) a) s t a a -> a -> s -> (a, t)
(<//=) :: (MonadState s m, Fractional a) => LensLike' ((,) a) s a -> a -> m a
(<//~) :: Fractional a => LensLike ((,) a) s t a a -> a -> s -> (a, t)
(<<%=) :: (Strong p, MonadState s m) => Over p ((,) a) s s a b -> p a b -> m a
(<<%@=) :: MonadState s m => Over (Indexed i) ((,) a) s s a b -> (i -> a -> b) -> m a
(<<%@~) :: Over (Indexed i) ((,) a) s t a b -> (i -> a -> b) -> s -> (a, t)
(<<%~) :: LensLike ((,) a) s t a b -> (a -> b) -> s -> (a, t)
(<<&&=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool
(<<&&~) :: LensLike' ((,) Bool) s Bool -> Bool -> s -> (Bool, s)
(<<**=) :: (MonadState s m, Floating a) => LensLike' ((,) a) s a -> a -> m a
(<<**~) :: Floating a => LensLike' ((,) a) s a -> a -> s -> (a, s)
(<<*=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a
(<<*~) :: Num a => LensLike' ((,) a) s a -> a -> s -> (a, s)
(<<+=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a
(<<+~) :: Num a => LensLike' ((,) a) s a -> a -> s -> (a, s)
(<<-=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a
(<<-~) :: Num a => LensLike' ((,) a) s a -> a -> s -> (a, s)
(<<.=) :: MonadState s m => LensLike ((,) a) s s a b -> b -> m a
(<<.~) :: LensLike ((,) a) s t a b -> b -> s -> (a, t)
(<<//=) :: (MonadState s m, Fractional a) => LensLike' ((,) a) s a -> a -> m a
(<<//~) :: Fractional a => LensLike' ((,) a) s a -> a -> s -> (a, s)
(<<<>=) :: (MonadState s m, Monoid r) => LensLike' ((,) r) s r -> r -> m r
(<<<>~) :: Monoid r => LensLike' ((,) r) s r -> r -> s -> (r, s)
(<<>=) :: (MonadState s m, Monoid r) => LensLike' ((,) r) s r -> r -> m r
(<<>~) :: Monoid m => LensLike ((,) m) s t m m -> m -> s -> (m, t)
(<<?=) :: MonadState s m => LensLike ((,) a) s s a (Maybe b) -> b -> m a
(<<?~) :: LensLike ((,) a) s t a (Maybe b) -> b -> s -> (a, t)
(<<^=) :: (MonadState s m, Num a, Integral e) => LensLike' ((,) a) s a -> e -> m a
(<<^^=) :: (MonadState s m, Fractional a, Integral e) => LensLike' ((,) a) s a -> e -> m a
(<<^^~) :: (Fractional a, Integral e) => LensLike' ((,) a) s a -> e -> s -> (a, s)
(<<^~) :: (Num a, Integral e) => LensLike' ((,) a) s a -> e -> s -> (a, s)
(<<||=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool
(<<||~) :: LensLike' ((,) Bool) s Bool -> Bool -> s -> (Bool, s)
(<<~) :: MonadState s m => ALens s s a b -> m b -> m b
(<^=) :: (MonadState s m, Num a, Integral e) => LensLike' ((,) a) s a -> e -> m a
(<^^=) :: (MonadState s m, Fractional a, Integral e) => LensLike' ((,) a) s a -> e -> m a
(<^^~) :: (Fractional a, Integral e) => LensLike ((,) a) s t a a -> e -> s -> (a, t)
(<^~) :: (Num a, Integral e) => LensLike ((,) a) s t a a -> e -> s -> (a, t)
(<||=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool
(<||~) :: LensLike ((,) Bool) s t Bool Bool -> Bool -> s -> (Bool, t)
(??) :: Functor f => f (a -> b) -> a -> f b
(^#) :: s -> ALens s t a b -> a
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')
choosing :: Functor f => LensLike f s t a b -> LensLike f s' t' a b -> LensLike f (Either s s') (Either t t') a b
chosen :: IndexPreservingLens (Either a a) (Either b b) a b
cloneIndexPreservingLens :: ALens s t a b -> IndexPreservingLens s t a b
cloneIndexedLens :: AnIndexedLens i s t a b -> IndexedLens i s t a b
cloneLens :: ALens s t a b -> Lens s t a b
devoid :: Over p f Void Void a b
fusing :: Functor f => LensLike (Yoneda f) s t a b -> LensLike f s t a b
ilens :: (s -> (i, a)) -> (s -> b -> t) -> IndexedLens i s t a b
iplens :: (s -> a) -> (s -> b -> t) -> IndexPreservingLens s t a b
lens :: (s -> a) -> (s -> b -> t) -> Lens s t a b
locus :: IndexedComonadStore p => Lens (p a c s) (p b c s) a b
overA :: Arrow ar => LensLike (Context a b) s t a b -> ar a b -> ar s t
storing :: ALens s t a b -> b -> s -> t
united :: Lens' a ()
ilevels :: Applicative f => Traversing (Indexed i) f s t a b -> IndexedLensLike Int f s t (Level i a) (Level j b)
composOpFold :: Plated a => b -> (b -> b -> b) -> (a -> b) -> a -> b
contexts :: Plated a => a -> [Context a a a]
contextsOf :: ATraversal' a a -> a -> [Context a a a]
contextsOn :: Plated a => ATraversal s t a a -> s -> [Context a a t]
contextsOnOf :: ATraversal s t a a -> ATraversal' a a -> s -> [Context a a t]
cosmos :: Plated a => Fold a a
cosmosOf :: (Applicative f, Contravariant f) => LensLike' f a a -> LensLike' f a a
cosmosOn :: (Applicative f, Contravariant f, Plated a) => LensLike' f s a -> LensLike' f s a
cosmosOnOf :: (Applicative f, Contravariant f) => LensLike' f s a -> LensLike' f a a -> LensLike' f s a
deep :: (Conjoined p, Applicative f, Plated s) => Traversing p f s s a b -> Over p f s s a b
gplate :: (Generic a, GPlated a (Rep a)) => Traversal' a a
gplate1 :: (Generic1 f, GPlated1 f (Rep1 f)) => Traversal' (f a) (f a)
holes :: Plated a => a -> [Pretext ((->) :: Type -> Type -> Type) a a a]
holesOn :: Conjoined p => Over p (Bazaar p a a) s t a a -> s -> [Pretext p a a t]
holesOnOf :: Conjoined p => LensLike (Bazaar p r r) s t a b -> Over p (Bazaar p r r) a b r r -> s -> [Pretext p r r t]
para :: Plated a => (a -> [r] -> r) -> a -> r
paraOf :: Getting (Endo [a]) a a -> (a -> [r] -> r) -> a -> r
parts :: Plated a => Lens' a [a]
rewrite :: Plated a => (a -> Maybe a) -> a -> a
rewriteM :: (Monad m, Plated a) => (a -> m (Maybe a)) -> a -> m a
rewriteMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m (Maybe a)) -> a -> m b
rewriteMOn :: (Monad m, Plated a) => LensLike (WrappedMonad m) s t a a -> (a -> m (Maybe a)) -> s -> m t
rewriteMOnOf :: Monad m => LensLike (WrappedMonad m) s t a b -> LensLike (WrappedMonad m) a b a b -> (b -> m (Maybe a)) -> s -> m t
rewriteOf :: ASetter a b a b -> (b -> Maybe a) -> a -> b
rewriteOn :: Plated a => ASetter s t a a -> (a -> Maybe a) -> s -> t
rewriteOnOf :: ASetter s t a b -> ASetter a b a b -> (b -> Maybe a) -> s -> t
transformM :: (Monad m, Plated a) => (a -> m a) -> a -> m a
transformMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m b) -> a -> m b
transformMOn :: (Monad m, Plated a) => LensLike (WrappedMonad m) s t a a -> (a -> m a) -> s -> m t
transformMOnOf :: Monad m => LensLike (WrappedMonad m) s t a b -> LensLike (WrappedMonad m) a b a b -> (b -> m b) -> s -> m t
transformOf :: ASetter a b a b -> (b -> b) -> a -> b
transformOn :: Plated a => ASetter s t a a -> (a -> a) -> s -> t
transformOnOf :: ASetter s t a b -> ASetter a b a b -> (b -> b) -> s -> t
universe :: Plated a => a -> [a]
universeOf :: Getting [a] a a -> a -> [a]
universeOn :: Plated a => Getting [a] s a -> s -> [a]
universeOnOf :: Getting [a] s a -> Getting [a] a a -> s -> [a]
_Just :: Prism (Maybe a) (Maybe b) a b
_Left :: Prism (Either a c) (Either b c) a b
_Nothing :: Prism' (Maybe a) ()
_Right :: Prism (Either c a) (Either c b) a b
_Show :: (Read a, Show a) => Prism' String a
_Void :: Prism s s a Void
aside :: APrism s t a b -> Prism (e, s) (e, t) (e, a) (e, b)
below :: Traversable f => APrism' s a -> Prism' (f s) (f a)
clonePrism :: APrism s t a b -> Prism s t a b
isn't :: APrism s t a b -> s -> Bool
matching :: APrism s t a b -> s -> Either t a
nearly :: a -> (a -> Bool) -> Prism' a ()
only :: Eq a => a -> Prism' a ()
prism :: (b -> t) -> (s -> Either t a) -> Prism s t a b
prism' :: (b -> s) -> (s -> Maybe a) -> Prism s s a b
withPrism :: APrism s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r
without :: APrism s t a b -> APrism u v c d -> Prism (Either s u) (Either t v) (Either a c) (Either b d)
re :: AReview t b -> Getter b t
reuse :: MonadState b m => AReview t b -> m t
reuses :: MonadState b m => AReview t b -> (t -> r) -> m r
review :: MonadReader b m => AReview t b -> m t
reviews :: MonadReader b m => AReview t b -> (t -> r) -> m r
un :: (Profunctor p, Bifunctor p, Functor f) => Getting a s a -> Optic' p f a s
unto :: (Profunctor p, Bifunctor p, Functor f) => (b -> t) -> Optic p f s t a b
(%=) :: MonadState s m => ASetter s s a b -> (a -> b) -> m ()
(%@=) :: MonadState s m => AnIndexedSetter i s s a b -> (i -> a -> b) -> m ()
(%@~) :: AnIndexedSetter i s t a b -> (i -> a -> b) -> s -> t
(%~) :: ASetter s t a b -> (a -> b) -> s -> t
(&&=) :: MonadState s m => ASetter' s Bool -> Bool -> m ()
(&&~) :: ASetter s t Bool Bool -> Bool -> s -> t
(**=) :: (MonadState s m, Floating a) => ASetter' s a -> a -> m ()
(**~) :: Floating a => ASetter s t a a -> a -> s -> t
(*=) :: (MonadState s m, Num a) => ASetter' s a -> a -> m ()
(*~) :: Num a => ASetter s t a a -> a -> s -> t
(+=) :: (MonadState s m, Num a) => ASetter' s a -> a -> m ()
(+~) :: Num a => ASetter s t a a -> a -> s -> t
(-=) :: (MonadState s m, Num a) => ASetter' s a -> a -> m ()
(-~) :: Num a => ASetter s t a a -> a -> s -> t
(.=) :: MonadState s m => ASetter s s a b -> b -> m ()
(.@=) :: MonadState s m => AnIndexedSetter i s s a b -> (i -> b) -> m ()
(.@~) :: AnIndexedSetter i s t a b -> (i -> b) -> s -> t
(.~) :: ASetter s t a b -> b -> s -> t
(//=) :: (MonadState s m, Fractional a) => ASetter' s a -> a -> m ()
(//~) :: Fractional a => ASetter s t a a -> a -> s -> t
(<.=) :: MonadState s m => ASetter s s a b -> b -> m b
(<.~) :: ASetter s t a b -> b -> s -> (b, t)
(<>=) :: (MonadState s m, Monoid a) => ASetter' s a -> a -> m ()
(<>~) :: Monoid a => ASetter s t a a -> a -> s -> t
(<?=) :: MonadState s m => ASetter s s a (Maybe b) -> b -> m b
(<?~) :: ASetter s t a (Maybe b) -> b -> s -> (b, t)
(<~) :: MonadState s m => ASetter s s a b -> m b -> m ()
(?=) :: MonadState s m => ASetter s s a (Maybe b) -> b -> m ()
(?~) :: ASetter s t a (Maybe b) -> b -> s -> t
(^=) :: (MonadState s m, Num a, Integral e) => ASetter' s a -> e -> m ()
(^^=) :: (MonadState s m, Fractional a, Integral e) => ASetter' s a -> e -> m ()
(^^~) :: (Fractional a, Integral e) => ASetter s t a a -> e -> s -> t
(^~) :: (Num a, Integral e) => ASetter s t a a -> e -> s -> t
assign :: MonadState s m => ASetter s s a b -> b -> m ()
assignA :: Arrow p => ASetter s t a b -> p s b -> p s t
censoring :: MonadWriter w m => Setter w w u v -> (u -> v) -> m a -> m a
cloneIndexPreservingSetter :: ASetter s t a b -> IndexPreservingSetter s t a b
cloneIndexedSetter :: AnIndexedSetter i s t a b -> IndexedSetter i s t a b
cloneSetter :: ASetter s t a b -> Setter s t a b
contramapped :: Contravariant f => Setter (f b) (f a) a b
icensoring :: MonadWriter w m => IndexedSetter i w w u v -> (i -> u -> v) -> m a -> m a
ilocally :: MonadReader s m => AnIndexedSetter i s s a b -> (i -> a -> b) -> m r -> m r
imapOf :: AnIndexedSetter i s t a b -> (i -> a -> b) -> s -> t
imodifying :: MonadState s m => AnIndexedSetter i s s a b -> (i -> a -> b) -> m ()
iover :: AnIndexedSetter i s t a b -> (i -> a -> b) -> s -> t
ipassing :: MonadWriter w m => IndexedSetter i w w u v -> m (a, i -> u -> v) -> m a
iset :: AnIndexedSetter i s t a b -> (i -> b) -> s -> t
isets :: ((i -> a -> b) -> s -> t) -> IndexedSetter i s t a b
lifted :: Monad m => Setter (m a) (m b) a b
locally :: MonadReader s m => ASetter s s a b -> (a -> b) -> m r -> m r
mapOf :: ASetter s t a b -> (a -> b) -> s -> t
mapped :: Functor f => Setter (f a) (f b) a b
modifying :: MonadState s m => ASetter s s a b -> (a -> b) -> m ()
over :: ASetter s t a b -> (a -> b) -> s -> t
passing :: MonadWriter w m => Setter w w u v -> m (a, u -> v) -> m a
scribe :: (MonadWriter t m, Monoid s) => ASetter s t a b -> b -> m ()
set :: ASetter s t a b -> b -> s -> t
set' :: ASetter' s a -> a -> s -> s
sets :: (Profunctor p, Profunctor q, Settable f) => (p a b -> q s t) -> Optical p q f s t a b
setting :: ((a -> b) -> s -> t) -> IndexPreservingSetter s t a b
(||=) :: MonadState s m => ASetter' s Bool -> Bool -> m ()
(||~) :: ASetter s t Bool Bool -> Bool -> s -> t
abbreviatedFields :: LensRules
abbreviatedNamer :: FieldNamer
camelCaseFields :: LensRules
camelCaseNamer :: FieldNamer
classUnderscoreNoPrefixFields :: LensRules
classUnderscoreNoPrefixNamer :: FieldNamer
classyRules :: LensRules
classyRules_ :: LensRules
createClass :: Lens' LensRules Bool
declareClassy :: DecsQ -> DecsQ
declareClassyFor :: [(String, (String, String))] -> [(String, String)] -> DecsQ -> DecsQ
declareFields :: DecsQ -> DecsQ
declareLenses :: DecsQ -> DecsQ
declareLensesFor :: [(String, String)] -> DecsQ -> DecsQ
declareLensesWith :: LensRules -> DecsQ -> DecsQ
declarePrisms :: DecsQ -> DecsQ
declareWrapped :: DecsQ -> DecsQ
defaultFieldRules :: LensRules
generateLazyPatterns :: Lens' LensRules Bool
generateSignatures :: Lens' LensRules Bool
generateUpdateableOptics :: Lens' LensRules Bool
lensClass :: Lens' LensRules ClassyNamer
lensField :: Lens' LensRules FieldNamer
lensRules :: LensRules
lensRulesFor :: [(String, String)] -> LensRules
lookingupNamer :: [(String, String)] -> FieldNamer
makeClassy :: Name -> DecsQ
makeClassyFor :: String -> String -> [(String, String)] -> Name -> DecsQ
makeClassy_ :: Name -> DecsQ
makeFields :: Name -> DecsQ
makeFieldsNoPrefix :: Name -> DecsQ
makeLenses :: Name -> DecsQ
makeLensesFor :: [(String, String)] -> Name -> DecsQ
makeLensesWith :: LensRules -> Name -> DecsQ
makeWrapped :: Name -> DecsQ
mappingNamer :: (String -> [String]) -> FieldNamer
simpleLenses :: Lens' LensRules Bool
underscoreFields :: LensRules
underscoreNamer :: FieldNamer
underscoreNoPrefixNamer :: FieldNamer
both :: Bitraversable r => Traversal (r a a) (r b b) a b
both1 :: Bitraversable1 r => Traversal1 (r a a) (r b b) a b
cloneIndexPreservingTraversal :: ATraversal s t a b -> IndexPreservingTraversal s t a b
cloneIndexPreservingTraversal1 :: ATraversal1 s t a b -> IndexPreservingTraversal1 s t a b
cloneIndexedTraversal :: AnIndexedTraversal i s t a b -> IndexedTraversal i s t a b
cloneIndexedTraversal1 :: AnIndexedTraversal1 i s t a b -> IndexedTraversal1 i s t a b
cloneTraversal :: ATraversal s t a b -> Traversal s t a b
cloneTraversal1 :: ATraversal1 s t a b -> Traversal1 s t a b
confusing :: Applicative f => LensLike (Curried (Yoneda f) (Yoneda f)) s t a b -> LensLike f s t a b
deepOf :: (Conjoined p, Applicative f) => LensLike f s t s t -> Traversing p f s t a b -> Over p f s t a b
dropping :: (Conjoined p, Applicative f) => Int -> Over p (Indexing f) s t a a -> Over p f s t a a
element :: Traversable t => Int -> IndexedTraversal' Int (t a) a
elementOf :: Applicative f => LensLike (Indexing f) s t a a -> Int -> IndexedLensLike Int f s t a a
elements :: Traversable t => (Int -> Bool) -> IndexedTraversal' Int (t a) a
elementsOf :: Applicative f => LensLike (Indexing f) s t a a -> (Int -> Bool) -> IndexedLensLike Int f s t a a
failing :: (Conjoined p, Applicative f) => Traversing p f s t a b -> Over p f s t a b -> Over p f s t a b
failover :: Alternative m => LensLike ((,) Any) s t a b -> (a -> b) -> s -> m t
forMOf :: LensLike (WrappedMonad m) s t a b -> s -> (a -> m b) -> m t
forOf :: LensLike f s t a b -> s -> (a -> f b) -> f t
holes1Of :: Conjoined p => Over p (Bazaar1 p a a) s t a a -> s -> NonEmpty (Pretext p a a t)
holesOf :: Conjoined p => Over p (Bazaar p a a) s t a a -> s -> [Pretext p a a t]
ifailover :: Alternative m => Over (Indexed i) ((,) Any) s t a b -> (i -> a -> b) -> s -> m t
iforMOf :: (Indexed i a (WrappedMonad m b) -> s -> WrappedMonad m t) -> s -> (i -> a -> m b) -> m t
iforOf :: (Indexed i a (f b) -> s -> f t) -> s -> (i -> a -> f b) -> f t
ignored :: Applicative f => pafb -> s -> f s
iloci :: IndexedTraversal i (Bazaar (Indexed i) a c s) (Bazaar (Indexed i) b c s) a b
imapAccumLOf :: Over (Indexed i) (State acc) s t a b -> (i -> acc -> a -> (acc, b)) -> acc -> s -> (acc, t)
imapAccumROf :: Over (Indexed i) (Backwards (State acc)) s t a b -> (i -> acc -> a -> (acc, b)) -> acc -> s -> (acc, t)
imapMOf :: Over (Indexed i) (WrappedMonad m) s t a b -> (i -> a -> m b) -> s -> m t
ipartsOf :: (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a a -> Over p f s t [a] [a]
ipartsOf' :: (Indexable [i] p, Functor f) => Over (Indexed i) (Bazaar' (Indexed i) a) s t a a -> Over p f s t [a] [a]
itraverseOf :: (Indexed i a (f b) -> s -> f t) -> (i -> a -> f b) -> s -> f t
iunsafePartsOf :: (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a b -> Over p f s t [a] [b]
iunsafePartsOf' :: Over (Indexed i) (Bazaar (Indexed i) a b) s t a b -> IndexedLens [i] s t [a] [b]
loci :: Traversal (Bazaar ((->) :: Type -> Type -> Type) a c s) (Bazaar ((->) :: Type -> Type -> Type) b c s) a b
mapAccumLOf :: LensLike (State acc) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)
mapAccumROf :: LensLike (Backwards (State acc)) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)
mapMOf :: LensLike (WrappedMonad m) s t a b -> (a -> m b) -> s -> m t
partsOf :: Functor f => Traversing ((->) :: Type -> Type -> Type) f s t a a -> LensLike f s t [a] [a]
partsOf' :: ATraversal s t a a -> Lens s t [a] [a]
scanl1Of :: LensLike (State (Maybe a)) s t a a -> (a -> a -> a) -> s -> t
scanr1Of :: LensLike (Backwards (State (Maybe a))) s t a a -> (a -> a -> a) -> s -> t
sequenceAOf :: LensLike f s t (f b) b -> s -> f t
sequenceByOf :: Traversal s t (f b) b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> s -> f t
sequenceOf :: LensLike (WrappedMonad m) s t (m b) b -> s -> m t
taking :: (Conjoined p, Applicative f) => Int -> Traversing p f s t a a -> Over p f s t a a
transposeOf :: LensLike ZipList s t [a] a -> s -> [t]
traverseByOf :: Traversal s t a b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (a -> f b) -> s -> f t
traverseOf :: LensLike f s t a b -> (a -> f b) -> s -> f t
traversed :: Traversable f => IndexedTraversal Int (f a) (f b) a b
traversed1 :: Traversable1 f => IndexedTraversal1 Int (f a) (f b) a b
traversed64 :: Traversable f => IndexedTraversal Int64 (f a) (f b) a b
unsafePartsOf :: Functor f => Traversing ((->) :: Type -> Type -> Type) f s t a b -> LensLike f s t [a] [b]
unsafePartsOf' :: ATraversal s t a b -> Lens s t [a] [b]
unsafeSingular :: (HasCallStack, Conjoined p, Functor f) => Traversing p f s t a b -> Over p f s t a b
_1' :: Field1 s t a b => Lens s t a b
_10' :: Field10 s t a b => Lens s t a b
_11' :: Field11 s t a b => Lens s t a b
_12' :: Field12 s t a b => Lens s t a b
_13' :: Field13 s t a b => Lens s t a b
_14' :: Field14 s t a b => Lens s t a b
_15' :: Field15 s t a b => Lens s t a b
_16' :: Field16 s t a b => Lens s t a b
_17' :: Field17 s t a b => Lens s t a b
_18' :: Field18 s t a b => Lens s t a b
_19' :: Field19 s t a b => Lens s t a b
_2' :: Field2 s t a b => Lens s t a b
_3' :: Field3 s t a b => Lens s t a b
_4' :: Field4 s t a b => Lens s t a b
_5' :: Field5 s t a b => Lens s t a b
_6' :: Field6 s t a b => Lens s t a b
_7' :: Field7 s t a b => Lens s t a b
_8' :: Field8 s t a b => Lens s t a b
_9' :: Field9 s t a b => Lens s t a b
pattern Unwrapped :: forall t. Rewrapped t t => t -> Unwrapped t
pattern Wrapped :: forall s. Rewrapped s s => Unwrapped s -> s
_GWrapped' :: (Generic s, D1 d (C1 c (S1 s' (Rec0 a))) ~ Rep s, Unwrapped s ~ GUnwrapped (Rep s)) => Iso' s (Unwrapped s)
_Unwrapped :: Rewrapping s t => Iso (Unwrapped t) (Unwrapped s) t s
_Unwrapped' :: Wrapped s => Iso' (Unwrapped s) s
_Unwrapping :: Rewrapping s t => (Unwrapped s -> s) -> Iso (Unwrapped t) (Unwrapped s) t s
_Unwrapping' :: Wrapped s => (Unwrapped s -> s) -> Iso' (Unwrapped s) s
_Wrapped :: Rewrapping s t => Iso s t (Unwrapped s) (Unwrapped t)
_Wrapping :: Rewrapping s t => (Unwrapped s -> s) -> Iso s t (Unwrapped s) (Unwrapped t)
_Wrapping' :: Wrapped s => (Unwrapped s -> s) -> Iso' s (Unwrapped s)
ala :: (Functor f, Rewrapping s t) => (Unwrapped s -> s) -> ((Unwrapped t -> t) -> f s) -> f (Unwrapped s)
alaf :: (Functor f, Functor g, Rewrapping s t) => (Unwrapped s -> s) -> (f t -> g s) -> f (Unwrapped t) -> g (Unwrapped s)
op :: Wrapped s => (Unwrapped s -> s) -> s -> Unwrapped s
foldBy :: Foldable t => (a -> a -> a) -> a -> t a -> a
foldMapBy :: Foldable t => (r -> r -> r) -> r -> (a -> r) -> t a -> r
sequenceBy :: Traversable t => (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> t (f a) -> f (t a)
traverseBy :: Traversable t => (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (a -> f b) -> t a -> f (t b)
data Active a
data Duration n
data Dynamic a = Dynamic {
- era :: Era Rational
- runDynamic :: Time Rational -> a
}
data Era n
data Time n
newtype Envelope (v :: Type -> Type) n = Envelope (Option (v n -> Max n))
class (Metric (V a), OrderedField (N a)) => Enveloped a where
- getEnvelope :: a -> Envelope (V a) (N a)
type OrderedField s = (Floating s, Ord s)
class HasOrigin t where
- moveOriginTo :: Point (V t) (N t) -> t -> t
class Juxtaposable a where
- juxtapose :: Vn a -> a -> a -> a
type Measure n = Measured n n
data Measured n a
data AName
class (Typeable a, Ord a, Show a) => IsName a where
- toName :: a -> Name
data Name
class Qualifiable q where
- (.>>) :: IsName a => a -> q -> q
newtype Query (v :: Type -> Type) n m = Query {
- runQuery :: Point v n -> m
}
data Attribute (v :: Type -> Type) n where
- Attribute :: forall (v :: Type -> Type) n a. AttributeClass a => a -> Attribute v n
- MAttribute :: forall (v :: Type -> Type) n a. AttributeClass a => Measured n a -> Attribute v n
- TAttribute :: forall (v :: Type -> Type) n a. (AttributeClass a, Transformable a, V a ~ v, N a ~ n) => a -> Attribute v n
class (Typeable a, Semigroup a) => AttributeClass a
class HasStyle a where
- applyStyle :: Style (V a) (N a) -> a -> a
data Style (v :: Type -> Type) n
data SortedList a
newtype Trace (v :: Type -> Type) n = Trace {
- appTrace :: Point v n -> v n -> SortedList n
}
class (Additive (V a), Ord (N a)) => Traced a where
- getTrace :: a -> Trace (V a) (N a)
data u :-: v
type HasBasis (v :: Type -> Type) = (Additive v, Representable v, Rep v ~ E v)
type HasLinearMap (v :: Type -> Type) = (HasBasis v, Traversable v)
newtype TransInv t = TransInv t
class Transformable t where
- transform :: Transformation (V t) (N t) -> t -> t
data Transformation (v :: Type -> Type) n
class Backend b (v :: Type -> Type) n where
- data Render b (v :: Type -> Type) n :: Type
- type Result b (v :: Type -> Type) n :: Type
- data Options b (v :: Type -> Type) n :: Type
- adjustDia :: (Additive v, Monoid' m, Num n) => b -> Options b v n -> QDiagram b v n m -> (Options b v n, Transformation v n, QDiagram b v n m)
- renderRTree :: b -> Options b v n -> RTree b v n Annotation -> Result b v n
type D (v :: Type -> Type) n = QDiagram NullBackend v n Any
type Diagram b = QDiagram b (V b) (N b) Any
data NullBackend
data Prim b (v :: Type -> Type) n where
- Prim :: forall b (v :: Type -> Type) n p. (Transformable p, Typeable p, Renderable p b) => p -> Prim b (V p) (N p)
data QDiagram b (v :: Type -> Type) n m
class Transformable t => Renderable t b where
- render :: b -> t -> Render b (V t) (N t)
newtype SubMap b (v :: Type -> Type) n m = SubMap (Map Name [Subdiagram b v n m])
data Subdiagram b (v :: Type -> Type) n m = Subdiagram (QDiagram b v n m) (DownAnnots v n)
type TypeableFloat n = (Typeable n, RealFloat n)
type InSpace (v :: Type -> Type) n a = (V a ~ v, N a ~ n, Additive v, Num n)
type family N a :: Type
type SameSpace a b = (V a ~ V b, N a ~ N b)
type family V a :: Type -> Type
type Vn a = V a (N a)
class Alignable a where
- alignBy' :: (InSpace v n a, Fractional n, HasOrigin a) => (v n -> a -> Point v n) -> v n -> n -> a -> a
- defaultBoundary :: (V a ~ v, N a ~ n) => v n -> a -> Point v n
- alignBy :: (InSpace v n a, Fractional n, HasOrigin a) => v n -> n -> a -> a
data Angle n
class HasTheta t => HasPhi (t :: Type -> Type) where
- _phi :: RealFloat n => Lens' (t n) (Angle n)
class HasTheta (t :: Type -> Type) where
- _theta :: RealFloat n => Lens' (t n) (Angle n)
type Animation b (v :: Type -> Type) n = QAnimation b v n Any
type QAnimation b (v :: Type -> Type) n m = Active (QDiagram b v n m)
class Color c where
- toAlphaColour :: c -> AlphaColour Double
- fromAlphaColour :: AlphaColour Double -> c
data Dashing n = Dashing [n] n
data FillOpacity
data LineCap
- = LineCapButt
- | LineCapRound
- | LineCapSquare
data LineJoin
- = LineJoinMiter
- | LineJoinRound
- | LineJoinBevel
newtype LineMiterLimit = LineMiterLimit (Last Double)
data LineWidth n
data Opacity
data SomeColor where
- SomeColor :: forall c. Color c => c -> SomeColor
data StrokeOpacity
data BoundingBox (v :: Type -> Type) n
data CatMethod
- = Cat
- | Distrib
data CatOpts n
data a :& b = a :& b
class Coordinates c where
- type FinalCoord c :: Type
- type PrevDim c :: Type
- type Decomposition c :: Type
- (^&) :: PrevDim c -> FinalCoord c -> c
- pr :: PrevDim c -> FinalCoord c -> c
- coords :: c -> Decomposition c
type BSpline (v :: Type -> Type) n = [Point v n]
class Deformable a b where
- deform' :: N a -> Deformation (V a) (V b) (N a) -> a -> b
- deform :: Deformation (V a) (V b) (N a) -> a -> b
newtype Deformation (v :: Type -> Type) (u :: Type -> Type) n = Deformation (Point v n -> Point u n)
data Direction (v :: Type -> Type) n
data Located a = Loc {
- loc :: Point (V a) (N a)
- unLoc :: a
}
type family Codomain p :: Type -> Type
class DomainBounds p where
- domainLower :: p -> N p
- domainUpper :: p -> N p
class (Parametric p, DomainBounds p) => EndValues p where
- atStart :: p -> Codomain p (N p)
- atEnd :: p -> Codomain p (N p)
class Parametric p => HasArcLength p where
- arcLengthBounded :: N p -> p -> Interval (N p)
- arcLength :: N p -> p -> N p
- stdArcLength :: p -> N p
- arcLengthToParam :: N p -> p -> N p -> N p
- stdArcLengthToParam :: p -> N p -> N p
class Parametric p where
- atParam :: p -> N p -> Codomain p (N p)
class DomainBounds p => Sectionable p where
- splitAtParam :: p -> N p -> (p, p)
- section :: p -> N p -> N p -> p
- reverseDomain :: p -> p
data AdjustMethod n
- = ByParam n
- | ByAbsolute n
- | ToAbsolute n
data AdjustOpts n
data AdjustSide
- = Start
- | End
- | Both
newtype Path (v :: Type -> Type) n = Path [Located (Trail v n)]
class ToPath t where
- toPath :: t -> Path (V t) (N t)
class HasQuery t m | t -> m where
- getQuery :: t -> Query (V t) (N t) m
newtype ArcLength n = ArcLength (Sum (Interval n), n -> Sum (Interval n))
data Closed
data FixedSegment (v :: Type -> Type) n
- = FLinear (Point v n) (Point v n)
- | FCubic (Point v n) (Point v n) (Point v n) (Point v n)
data Offset c (v :: Type -> Type) n where
- OffsetOpen :: forall c (v :: Type -> Type) n. Offset Open v n
- OffsetClosed :: forall c (v :: Type -> Type) n. v n -> Offset Closed v n
data OffsetEnvelope (v :: Type -> Type) n = OffsetEnvelope {
- _oeOffset :: !(TotalOffset v n)
- _oeEnvelope :: Envelope v n
}
data Open
newtype SegCount = SegCount (Sum Int)
type SegMeasure (v :: Type -> Type) n = SegCount ::: (ArcLength n ::: (OffsetEnvelope v n ::: ()))
data Segment c (v :: Type -> Type) n
- = Linear !(Offset c v n)
- | Cubic !(v n) !(v n) !(Offset c v n)
newtype TotalOffset (v :: Type -> Type) n = TotalOffset (v n)
data SizeSpec (v :: Type -> Type) n
newtype Tangent t = Tangent t
newtype Ambient = Ambient (Last Double)
newtype Diffuse = Diffuse (Last Double)
newtype Highlight = Highlight (Last Specular)
data Specular = Specular {
- _specularIntensity :: Double
- _specularSize :: Double
}
newtype SurfaceColor = SurfaceColor (Last (Colour Double))
data Camera (l :: Type -> Type) n
aspect :: (CameraLens l, Floating n) => l n -> n
data OrthoLens n = OrthoLens {
- _orthoWidth :: n
- _orthoHeight :: n
}
data PerspectiveLens n = PerspectiveLens {
- _horizontalFieldOfView :: Angle n
- _verticalFieldOfView :: Angle n
}
data ParallelLight n = ParallelLight (V3 n) (Colour Double)
data PointLight n = PointLight (Point V3 n) (Colour Double)
data Box n = Box (Transformation V3 n)
data CSG n
- = CsgEllipsoid (Ellipsoid n)
- | CsgBox (Box n)
- | CsgFrustum (Frustum n)
- | CsgUnion [CSG n]
- | CsgIntersection [CSG n]
- | CsgDifference (CSG n) (CSG n)
data Ellipsoid n = Ellipsoid (Transformation V3 n)
data Frustum n = Frustum n n (Transformation V3 n)
class Skinned t where
- skin :: (Renderable t b, N t ~ n, TypeableFloat n) => t -> QDiagram b V3 n Any
type P3 = Point V3
type T3 = Transformation V3
newtype GetSegment t = GetSegment t
newtype GetSegmentCodomain (v :: Type -> Type) n = GetSegmentCodomain (Maybe (v n, Segment Closed v n, AnIso' n n))
data Line
data Loop
newtype SegTree (v :: Type -> Type) n = SegTree (FingerTree (SegMeasure v n) (Segment Closed v n))
data Trail (v :: Type -> Type) n where
- Trail :: forall (v :: Type -> Type) n l. Trail' l v n -> Trail v n
data Trail' l (v :: Type -> Type) n where
- Line :: forall l (v :: Type -> Type) n. SegTree v n -> Trail' Line v n
- Loop :: forall l (v :: Type -> Type) n. SegTree v n -> Segment Open v n -> Trail' Loop v n
class (Metric (V t), OrderedField (N t)) => TrailLike t where
- trailLike :: Located (Trail (V t) (N t)) -> t
data ArrowOpts n = ArrowOpts {
- _arrowHead :: ArrowHT n
- _arrowTail :: ArrowHT n
- _arrowShaft :: Trail V2 n
- _headGap :: Measure n
- _tailGap :: Measure n
- _headStyle :: Style V2 n
- _headLength :: Measure n
- _tailStyle :: Style V2 n
- _tailLength :: Measure n
- _shaftStyle :: Style V2 n
}
type ArrowHT n = n -> n -> (Path V2 n, Path V2 n)
data GradientStop d = GradientStop {
- _stopColor :: SomeColor
- _stopFraction :: d
}
data LGradient n = LGradient {
- _lGradStops :: [GradientStop n]
- _lGradStart :: Point V2 n
- _lGradEnd :: Point V2 n
- _lGradTrans :: Transformation V2 n
- _lGradSpreadMethod :: SpreadMethod
}
data RGradient n = RGradient {
- _rGradStops :: [GradientStop n]
- _rGradCenter0 :: Point V2 n
- _rGradRadius0 :: n
- _rGradCenter1 :: Point V2 n
- _rGradRadius1 :: n
- _rGradTrans :: Transformation V2 n
- _rGradSpreadMethod :: SpreadMethod
}
data SpreadMethod
- = GradPad
- | GradReflect
- | GradRepeat
data Texture n
- = SC SomeColor
- | LG (LGradient n)
- | RG (RGradient n)
data DImage a b = DImage (ImageData b) Int Int (Transformation V2 a)
data Embedded
data External
data ImageData a where
- ImageRaster :: forall a. DynamicImage -> ImageData Embedded
- ImageRef :: forall a. FilePath -> ImageData External
- ImageNative :: forall a t. t -> ImageData (Native t)
data Native t
data EnvelopeOpts n = EnvelopeOpts {
- _eColor :: Colour Double
- _eLineWidth :: Measure n
- _ePoints :: Int
}
data OriginOpts n = OriginOpts {
- _oColor :: Colour Double
- _oScale :: n
- _oMinSize :: n
}
data TraceOpts n = TraceOpts {
- _tColor :: Colour Double
- _tScale :: n
- _tMinSize :: n
- _tPoints :: Int
}
data FillRule
- = Winding
- | EvenOdd
data StrokeOpts a = StrokeOpts {
- _vertexNames :: [[a]]
- _queryFillRule :: FillRule
}
data PolyOrientation n
- = NoOrient
- | OrientH
- | OrientV
- | OrientTo (V2 n)
data PolyType n
- = PolyPolar [Angle n] [n]
- | PolySides [Angle n] [n]
- | PolyRegular Int n
data PolygonOpts n = PolygonOpts {
- _polyType :: PolyType n
- _polyOrient :: PolyOrientation n
- _polyCenter :: Point V2 n
}
data StarOpts
- = StarFun (Int -> Int)
- | StarSkip Int
data RoundedRectOpts d = RoundedRectOpts {
- _radiusTL :: d
- _radiusTR :: d
- _radiusBL :: d
- _radiusBR :: d
}
class HasR (t :: Type -> Type) where
- _r :: RealFloat n => Lens' (t n) n
type P2 = Point V2
type T2 = Transformation V2
class Additive (Diff p) => Affine (p :: Type -> Type) where
- type Diff (p :: Type -> Type) :: Type -> Type
- (.-.) :: Num a => p a -> p a -> Diff p a
- (.+^) :: Num a => p a -> Diff p a -> p a
- (.-^) :: Num a => p a -> Diff p a -> p a
newtype Point (f :: Type -> Type) a = P (f a)
class Additive f => Metric (f :: Type -> Type) where
- dot :: Num a => f a -> f a -> a
- quadrance :: Num a => f a -> a
- qd :: Num a => f a -> f a -> a
- distance :: Floating a => f a -> f a -> a
- norm :: Floating a => f a -> a
- signorm :: Floating a => f a -> f a
class R1 (t :: Type -> Type) where
- _x :: Lens' (t a) a
class R1 t => R2 (t :: Type -> Type) where
- _y :: Lens' (t a) a
- _xy :: Lens' (t a) (V2 a)
data V2 a = V2 !a !a
class R2 t => R3 (t :: Type -> Type) where
- _z :: Lens' (t a) a
- _xyz :: Lens' (t a) (V3 a)
data V3 a = V3 !a !a !a
class Functor f => Additive (f :: Type -> Type) where
- zero :: Num a => f a
- (^+^) :: Num a => f a -> f a -> f a
- (^-^) :: Num a => f a -> f a -> f a
- lerp :: Num a => a -> f a -> f a -> f a
- liftU2 :: (a -> a -> a) -> f a -> f a -> f a
- liftI2 :: (a -> b -> c) -> f a -> f b -> f c
newtype E (t :: Type -> Type) = E {
- el :: forall x. Lens' (t x) x
}
class Ixed m => At m
class Contains m
type family Index s :: Type
type family IxValue m :: Type
class Ixed m where
- ix :: Index m -> Traversal' m (IxValue m)
class Cons s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _Cons :: Prism s t (a, s) (b, t)
class Snoc s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _Snoc :: Prism s t (s, a) (t, b)
class Each s t a b | s -> a, t -> b, s b -> t, t a -> s where
- each :: Traversal s t a b
class AsEmpty a where
- _Empty :: Prism' a ()
type AnEquality (s :: k1) (t :: k2) (a :: k1) (b :: k2) = Identical a (Proxy b) a (Proxy b) -> Identical a (Proxy b) s (Proxy t)
type AnEquality' (s :: k2) (a :: k2) = AnEquality s s a a
data Identical (a :: k) (b :: k1) (s :: k) (t :: k1) :: forall k k1. k -> k1 -> k -> k1 -> Type where
- Identical :: forall k k1 (a :: k) (b :: k1) (s :: k) (t :: k1). Identical a b a b
type Accessing (p :: Type -> Type -> Type) m s a = p a (Const m a) -> s -> Const m s
type Getting r s a = (a -> Const r a) -> s -> Const r s
type IndexedGetting i m s a = Indexed i a (Const m a) -> s -> Const m s
class Foldable f => FoldableWithIndex i (f :: Type -> Type) | f -> i where
- ifoldMap :: Monoid m => (i -> a -> m) -> f a -> m
- ifolded :: IndexedFold i (f a) a
- ifoldr :: (i -> a -> b -> b) -> b -> f a -> b
- ifoldl :: (i -> b -> a -> b) -> b -> f a -> b
- ifoldr' :: (i -> a -> b -> b) -> b -> f a -> b
- ifoldl' :: (i -> b -> a -> b) -> b -> f a -> b
class Functor f => FunctorWithIndex i (f :: Type -> Type) | f -> i where
- imap :: (i -> a -> b) -> f a -> f b
- imapped :: IndexedSetter i (f a) (f b) a b
class (FunctorWithIndex i t, FoldableWithIndex i t, Traversable t) => TraversableWithIndex i (t :: Type -> Type) | t -> i where
- itraverse :: Applicative f => (i -> a -> f b) -> t a -> f (t b)
- itraversed :: IndexedTraversal i (t a) (t b) a b
newtype Bazaar (p :: Type -> Type -> Type) a b t = Bazaar {
- runBazaar :: forall (f :: Type -> Type). Applicative f => p a (f b) -> f t
}
type Bazaar' (p :: Type -> Type -> Type) a = Bazaar p a a
newtype Bazaar1 (p :: Type -> Type -> Type) a b t = Bazaar1 {
- runBazaar1 :: forall (f :: Type -> Type). Apply f => p a (f b) -> f t
}
type Bazaar1' (p :: Type -> Type -> Type) a = Bazaar1 p a a
data Context a b t = Context (b -> t) a
type Context' a = Context a a
type ClassyNamer = Name -> Maybe (Name, Name)
data DefName
- = TopName Name
- | MethodName Name Name
type FieldNamer = Name -> [Name] -> Name -> [DefName]
data LensRules
data Leftmost a
data Rightmost a
data Sequenced a (m :: Type -> Type)
data Traversed a (f :: Type -> Type)
class (Choice p, Corepresentable p, Comonad (Corep p), Traversable (Corep p), Strong p, Representable p, Monad (Rep p), MonadFix (Rep p), Distributive (Rep p), Costrong p, ArrowLoop p, ArrowApply p, ArrowChoice p, Closed p) => Conjoined (p :: Type -> Type -> Type) where
- distrib :: Functor f => p a b -> p (f a) (f b)
- conjoined :: ((p ~ ((->) :: Type -> Type -> Type)) -> q (a -> b) r) -> q (p a b) r -> q (p a b) r
class Conjoined p => Indexable i (p :: Type -> Type -> Type)
newtype Indexed i a b = Indexed {
- runIndexed :: i -> a -> b
}
class Reversing t where
- reversing :: t -> t
data Level i a
data Magma i t b a
class (Profunctor p, Bifunctor p) => Reviewable (p :: Type -> Type -> Type)
class (Applicative f, Distributive f, Traversable f) => Settable (f :: Type -> Type)
type AnIso s t a b = Exchange a b a (Identity b) -> Exchange a b s (Identity t)
type AnIso' s a = AnIso s s a a
class Strict lazy strict | lazy -> strict, strict -> lazy where
- strict :: Iso' lazy strict
class Bifunctor p => Swapped (p :: Type -> Type -> Type) where
- swapped :: Iso (p a b) (p c d) (p b a) (p d c)
type ALens s t a b = LensLike (Pretext ((->) :: Type -> Type -> Type) a b) s t a b
type ALens' s a = ALens s s a a
type AnIndexedLens i s t a b = Optical (Indexed i) ((->) :: Type -> Type -> Type) (Pretext (Indexed i) a b) s t a b
type AnIndexedLens' i s a = AnIndexedLens i s s a a
class GPlated a (g :: k -> Type)
class GPlated1 (f :: k -> Type) (g :: k -> Type)
class Plated a where
- plate :: Traversal' a a
type APrism s t a b = Market a b a (Identity b) -> Market a b s (Identity t)
type APrism' s a = APrism s s a a
newtype ReifiedFold s a = Fold {
- runFold :: Fold s a
}
newtype ReifiedGetter s a = Getter {
- runGetter :: Getter s a
}
newtype ReifiedIndexedFold i s a = IndexedFold {
- runIndexedFold :: IndexedFold i s a
}
newtype ReifiedIndexedGetter i s a = IndexedGetter {
- runIndexedGetter :: IndexedGetter i s a
}
newtype ReifiedIndexedLens i s t a b = IndexedLens {
- runIndexedLens :: IndexedLens i s t a b
}
type ReifiedIndexedLens' i s a = ReifiedIndexedLens i s s a a
newtype ReifiedIndexedSetter i s t a b = IndexedSetter {
- runIndexedSetter :: IndexedSetter i s t a b
}
type ReifiedIndexedSetter' i s a = ReifiedIndexedSetter i s s a a
newtype ReifiedIndexedTraversal i s t a b = IndexedTraversal {
- runIndexedTraversal :: IndexedTraversal i s t a b
}
type ReifiedIndexedTraversal' i s a = ReifiedIndexedTraversal i s s a a
newtype ReifiedIso s t a b = Iso {
- runIso :: Iso s t a b
}
type ReifiedIso' s a = ReifiedIso s s a a
newtype ReifiedLens s t a b = Lens {
- runLens :: Lens s t a b
}
type ReifiedLens' s a = ReifiedLens s s a a
newtype ReifiedPrism s t a b = Prism {
- runPrism :: Prism s t a b
}
type ReifiedPrism' s a = ReifiedPrism s s a a
newtype ReifiedSetter s t a b = Setter {
- runSetter :: Setter s t a b
}
type ReifiedSetter' s a = ReifiedSetter s s a a
newtype ReifiedTraversal s t a b = Traversal {
- runTraversal :: Traversal s t a b
}
type ReifiedTraversal' s a = ReifiedTraversal s s a a
type ASetter s t a b = (a -> Identity b) -> s -> Identity t
type ASetter' s a = ASetter s s a a
type AnIndexedSetter i s t a b = Indexed i a (Identity b) -> s -> Identity t
type AnIndexedSetter' i s a = AnIndexedSetter i s s a a
type Setting (p :: Type -> Type -> Type) s t a b = p a (Identity b) -> s -> Identity t
type Setting' (p :: Type -> Type -> Type) s a = Setting p s s a a
type ATraversal s t a b = LensLike (Bazaar ((->) :: Type -> Type -> Type) a b) s t a b
type ATraversal' s a = ATraversal s s a a
type ATraversal1 s t a b = LensLike (Bazaar1 ((->) :: Type -> Type -> Type) a b) s t a b
type ATraversal1' s a = ATraversal1 s s a a
type AnIndexedTraversal i s t a b = Over (Indexed i) (Bazaar (Indexed i) a b) s t a b
type AnIndexedTraversal' i s a = AnIndexedTraversal i s s a a
type AnIndexedTraversal1 i s t a b = Over (Indexed i) (Bazaar1 (Indexed i) a b) s t a b
type AnIndexedTraversal1' i s a = AnIndexedTraversal1 i s s a a
class Ord k => TraverseMax k (m :: Type -> Type) | m -> k where
- traverseMax :: IndexedTraversal' k (m v) v
class Ord k => TraverseMin k (m :: Type -> Type) | m -> k where
- traverseMin :: IndexedTraversal' k (m v) v
type Traversing (p :: Type -> Type -> Type) (f :: Type -> Type) s t a b = Over p (BazaarT p f a b) s t a b
type Traversing' (p :: Type -> Type -> Type) (f :: Type -> Type) s a = Traversing p f s s a a
type Traversing1 (p :: Type -> Type -> Type) (f :: Type -> Type) s t a b = Over p (BazaarT1 p f a b) s t a b
type Traversing1' (p :: Type -> Type -> Type) (f :: Type -> Type) s a = Traversing1 p f s s a a
class Field1 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _1 :: Lens s t a b
class Field10 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _10 :: Lens s t a b
class Field11 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _11 :: Lens s t a b
class Field12 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _12 :: Lens s t a b
class Field13 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _13 :: Lens s t a b
class Field14 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _14 :: Lens s t a b
class Field15 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _15 :: Lens s t a b
class Field16 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _16 :: Lens s t a b
class Field17 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _17 :: Lens s t a b
class Field18 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _18 :: Lens s t a b
class Field19 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _19 :: Lens s t a b
class Field2 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _2 :: Lens s t a b
class Field3 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _3 :: Lens s t a b
class Field4 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _4 :: Lens s t a b
class Field5 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _5 :: Lens s t a b
class Field6 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _6 :: Lens s t a b
class Field7 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _7 :: Lens s t a b
class Field8 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _8 :: Lens s t a b
class Field9 s t a b | s -> a, t -> b, s b -> t, t a -> s where
- _9 :: Lens s t a b
type AReview t b = Optic' (Tagged :: Type -> Type -> Type) Identity t b
type As (a :: k2) = Equality' a a
type Equality (s :: k1) (t :: k2) (a :: k1) (b :: k2) = forall k3 (p :: k1 -> k3 -> Type) (f :: k2 -> k3). p a (f b) -> p s (f t)
type Equality' (s :: k2) (a :: k2) = Equality s s a a
type Fold s a = forall (f :: Type -> Type). (Contravariant f, Applicative f) => (a -> f a) -> s -> f s
type Fold1 s a = forall (f :: Type -> Type). (Contravariant f, Apply f) => (a -> f a) -> s -> f s
type Getter s a = forall (f :: Type -> Type). (Contravariant f, Functor f) => (a -> f a) -> s -> f s
type IndexPreservingFold s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Contravariant f, Applicative f) => p a (f a) -> p s (f s)
type IndexPreservingFold1 s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Contravariant f, Apply f) => p a (f a) -> p s (f s)
type IndexPreservingGetter s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Contravariant f, Functor f) => p a (f a) -> p s (f s)
type IndexPreservingLens s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Functor f) => p a (f b) -> p s (f t)
type IndexPreservingLens' s a = IndexPreservingLens s s a a
type IndexPreservingSetter s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Settable f) => p a (f b) -> p s (f t)
type IndexPreservingSetter' s a = IndexPreservingSetter s s a a
type IndexPreservingTraversal s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Applicative f) => p a (f b) -> p s (f t)
type IndexPreservingTraversal' s a = IndexPreservingTraversal s s a a
type IndexPreservingTraversal1 s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Apply f) => p a (f b) -> p s (f t)
type IndexPreservingTraversal1' s a = IndexPreservingTraversal1 s s a a
type IndexedFold i s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Contravariant f, Applicative f) => p a (f a) -> s -> f s
type IndexedFold1 i s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Contravariant f, Apply f) => p a (f a) -> s -> f s
type IndexedGetter i s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Contravariant f, Functor f) => p a (f a) -> s -> f s
type IndexedLens i s t a b = forall (f :: Type -> Type) (p :: Type -> Type -> Type). (Indexable i p, Functor f) => p a (f b) -> s -> f t
type IndexedLens' i s a = IndexedLens i s s a a
type IndexedLensLike i (f :: k -> Type) s (t :: k) a (b :: k) = forall (p :: Type -> Type -> Type). Indexable i p => p a (f b) -> s -> f t
type IndexedLensLike' i (f :: Type -> Type) s a = IndexedLensLike i f s s a a
type IndexedSetter i s t a b = forall (f :: Type -> Type) (p :: Type -> Type -> Type). (Indexable i p, Settable f) => p a (f b) -> s -> f t
type IndexedSetter' i s a = IndexedSetter i s s a a
type IndexedTraversal i s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Applicative f) => p a (f b) -> s -> f t
type IndexedTraversal' i s a = IndexedTraversal i s s a a
type IndexedTraversal1 i s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Apply f) => p a (f b) -> s -> f t
type IndexedTraversal1' i s a = IndexedTraversal1 i s s a a
type Iso s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Profunctor p, Functor f) => p a (f b) -> p s (f t)
type Iso' s a = Iso s s a a
type Lens s t a b = forall (f :: Type -> Type). Functor f => (a -> f b) -> s -> f t
type Lens' s a = Lens s s a a
type LensLike (f :: k -> Type) s (t :: k) a (b :: k) = (a -> f b) -> s -> f t
type LensLike' (f :: Type -> Type) s a = LensLike f s s a a
type Optic (p :: k1 -> k -> Type) (f :: k2 -> k) (s :: k1) (t :: k2) (a :: k1) (b :: k2) = p a (f b) -> p s (f t)
type Optic' (p :: k1 -> k -> Type) (f :: k1 -> k) (s :: k1) (a :: k1) = Optic p f s s a a
type Optical (p :: k2 -> k -> Type) (q :: k1 -> k -> Type) (f :: k3 -> k) (s :: k1) (t :: k3) (a :: k2) (b :: k3) = p a (f b) -> q s (f t)
type Optical' (p :: k1 -> k -> Type) (q :: k1 -> k -> Type) (f :: k1 -> k) (s :: k1) (a :: k1) = Optical p q f s s a a
type Over (p :: k -> Type -> Type) (f :: k1 -> Type) s (t :: k1) (a :: k) (b :: k1) = p a (f b) -> s -> f t
type Over' (p :: Type -> Type -> Type) (f :: Type -> Type) s a = Over p f s s a a
type Prism s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Choice p, Applicative f) => p a (f b) -> p s (f t)
type Prism' s a = Prism s s a a
type Review t b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Choice p, Bifunctor p, Settable f) => Optic' p f t b
type Setter s t a b = forall (f :: Type -> Type). Settable f => (a -> f b) -> s -> f t
type Setter' s a = Setter s s a a
type Simple (f :: k -> k -> k1 -> k1 -> k2) (s :: k) (a :: k1) = f s s a a
type Traversal s t a b = forall (f :: Type -> Type). Applicative f => (a -> f b) -> s -> f t
type Traversal' s a = Traversal s s a a
type Traversal1 s t a b = forall (f :: Type -> Type). Apply f => (a -> f b) -> s -> f t
type Traversal1' s a = Traversal1 s s a a
class Wrapped s => Rewrapped s t
class (Rewrapped s t, Rewrapped t s) => Rewrapping s t
class Wrapped s where
- type Unwrapped s :: Type
- _Wrapped' :: Iso' s (Unwrapped s)
type family Magnified (m :: Type -> Type) :: Type -> Type -> Type
class (Magnified m ~ Magnified n, MonadReader b m, MonadReader a n) => Magnify (m :: Type -> Type) (n :: Type -> Type) b a | m -> b, n -> a, m a -> n, n b -> m where
- magnify :: LensLike' (Magnified m c) a b -> m c -> n c
class (MonadState s m, MonadState t n) => Zoom (m :: Type -> Type) (n :: Type -> Type) s t | m -> s, n -> t, m t -> n, n s -> m where
- zoom :: LensLike' (Zoomed m c) t s -> m c -> n c
type family Zoomed (m :: Type -> Type) :: Type -> Type -> Type
type Monoid' = Monoid
class Profunctor p => Choice (p :: Type -> Type -> Type) where
- left' :: p a b -> p (Either a c) (Either b c)
- right' :: p a b -> p (Either c a) (Either c b)
class (Foldable1 t, Traversable t) => Traversable1 (t :: Type -> Type) where
- traverse1 :: Apply f => (a -> f b) -> t a -> f (t b)

Add Diagrams Inputs

addDiagramAsSVG Source #

Arguments

:: (PandocEffects effs, Member ToPandoc effs, Member UnusedId effs)
=> Maybe Text	id attribute for figure. Will use next unused "figure" id if Nothing
-> Maybe Text	caption for figure
-> Double	width in pixels (?)
-> Double	height in pixels (?)
-> QDiagram SVG V2 Double Any	diagram
-> Sem effs Text

Add diagram (via svg inserted as html).

re-exports

(<$) :: Functor f => a -> f b -> f a infixl 4 #

Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

class Functor f => Applicative (f :: Type -> Type) where #

A functor with application, providing operations to

embed pure expressions (pure), and
sequence computations and combine their results (<*> and liftA2).

A minimal complete definition must include implementations of pure and of either <*> or liftA2. If it defines both, then they must behave the same as their default definitions:

(<*>) = liftA2 id

liftA2 f x y = f <$> x <*> y

Further, any definition must satisfy the following:

identity

pure id <*> v = v

composition

pure (.) <*> u <*> v <*> w = u <*> (v <*> w)

homomorphism

pure f <*> pure x = pure (f x)

interchange

u <*> pure y = pure ($ y) <*> u

The other methods have the following default definitions, which may be overridden with equivalent specialized implementations:

```
u *> v = (id <$ u) <*> v
```
```
u <* v = liftA2 const u v
```

As a consequence of these laws, the Functor instance for f will satisfy

```
fmap f x = pure f <*> x
```

It may be useful to note that supposing

forall x y. p (q x y) = f x . g y

it follows from the above that

liftA2 p (liftA2 q u v) = liftA2 f u . liftA2 g v

If f is also a Monad, it should satisfy

```
pure = return
```
```
(<*>) = ap
```
```
(*>) = (>>)
```

(which implies that pure and <*> satisfy the applicative functor laws).

Minimal complete definition

pure, ((<*>) | liftA2)

Methods

pure :: a -> f a #

Lift a value.

(<*>) :: f (a -> b) -> f a -> f b infixl 4 #

Sequential application.

A few functors support an implementation of <*> that is more efficient than the default one.

liftA2 :: (a -> b -> c) -> f a -> f b -> f c #

Lift a binary function to actions.

Some functors support an implementation of liftA2 that is more efficient than the default one. In particular, if fmap is an expensive operation, it is likely better to use liftA2 than to fmap over the structure and then use <*>.

(*>) :: f a -> f b -> f b infixl 4 #

Sequence actions, discarding the value of the first argument.

(<*) :: f a -> f b -> f a infixl 4 #

Sequence actions, discarding the value of the second argument.

Instances

Applicative []	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a -> [a] # (<>) :: [a -> b] -> [a] -> [b] # liftA2 :: (a -> b -> c) -> [a] -> [b] -> [c] # (>) :: [a] -> [b] -> [b] # (<*) :: [a] -> [b] -> [a] #
Applicative Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a -> Maybe a # (<>) :: Maybe (a -> b) -> Maybe a -> Maybe b # liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c # (>) :: Maybe a -> Maybe b -> Maybe b # (<*) :: Maybe a -> Maybe b -> Maybe a #
Applicative IO	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a -> IO a # (<>) :: IO (a -> b) -> IO a -> IO b # liftA2 :: (a -> b -> c) -> IO a -> IO b -> IO c # (>) :: IO a -> IO b -> IO b # (<*) :: IO a -> IO b -> IO a #
Applicative Par1	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> Par1 a # (<>) :: Par1 (a -> b) -> Par1 a -> Par1 b # liftA2 :: (a -> b -> c) -> Par1 a -> Par1 b -> Par1 c # (>) :: Par1 a -> Par1 b -> Par1 b # (<*) :: Par1 a -> Par1 b -> Par1 a #
Applicative Q
Instance details Defined in Language.Haskell.TH.Syntax Methods pure :: a -> Q a # (<>) :: Q (a -> b) -> Q a -> Q b # liftA2 :: (a -> b -> c) -> Q a -> Q b -> Q c # (>) :: Q a -> Q b -> Q b # (<*) :: Q a -> Q b -> Q a #
Applicative Complex	Since: base-4.9.0.0
Instance details Defined in Data.Complex Methods pure :: a -> Complex a # (<>) :: Complex (a -> b) -> Complex a -> Complex b # liftA2 :: (a -> b -> c) -> Complex a -> Complex b -> Complex c # (>) :: Complex a -> Complex b -> Complex b # (<*) :: Complex a -> Complex b -> Complex a #
Applicative Min	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Min a # (<>) :: Min (a -> b) -> Min a -> Min b # liftA2 :: (a -> b -> c) -> Min a -> Min b -> Min c # (>) :: Min a -> Min b -> Min b # (<*) :: Min a -> Min b -> Min a #
Applicative Max	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Max a # (<>) :: Max (a -> b) -> Max a -> Max b # liftA2 :: (a -> b -> c) -> Max a -> Max b -> Max c # (>) :: Max a -> Max b -> Max b # (<*) :: Max a -> Max b -> Max a #
Applicative First	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> First a # (<>) :: First (a -> b) -> First a -> First b # liftA2 :: (a -> b -> c) -> First a -> First b -> First c # (>) :: First a -> First b -> First b # (<*) :: First a -> First b -> First a #
Applicative Last	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Last a # (<>) :: Last (a -> b) -> Last a -> Last b # liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c # (>) :: Last a -> Last b -> Last b # (<*) :: Last a -> Last b -> Last a #
Applicative Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Option a # (<>) :: Option (a -> b) -> Option a -> Option b # liftA2 :: (a -> b -> c) -> Option a -> Option b -> Option c # (>) :: Option a -> Option b -> Option b # (<*) :: Option a -> Option b -> Option a #
Applicative ZipList	f '<$>' 'ZipList' xs1 '<>' ... '<>' 'ZipList' xsN = 'ZipList' (zipWithN f xs1 ... xsN) where `zipWithN` refers to the `zipWith` function of the appropriate arity (`zipWith`, `zipWith3`, `zipWith4`, ...). For example: (\a b c -> stimes c [a, b]) <$> ZipList "abcd" <> ZipList "567" <> ZipList [1..] = ZipList (zipWith3 (\a b c -> stimes c [a, b]) "abcd" "567" [1..]) = ZipList {getZipList = ["a5","b6b6","c7c7c7"]} Since: base-2.1
Instance details Defined in Control.Applicative Methods pure :: a -> ZipList a # (<>) :: ZipList (a -> b) -> ZipList a -> ZipList b # liftA2 :: (a -> b -> c) -> ZipList a -> ZipList b -> ZipList c # (>) :: ZipList a -> ZipList b -> ZipList b # (<*) :: ZipList a -> ZipList b -> ZipList a #
Applicative Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods pure :: a -> Identity a # (<>) :: Identity (a -> b) -> Identity a -> Identity b # liftA2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c # (>) :: Identity a -> Identity b -> Identity b # (<*) :: Identity a -> Identity b -> Identity a #
Applicative STM	Since: base-4.8.0.0
Instance details Defined in GHC.Conc.Sync Methods pure :: a -> STM a # (<>) :: STM (a -> b) -> STM a -> STM b # liftA2 :: (a -> b -> c) -> STM a -> STM b -> STM c # (>) :: STM a -> STM b -> STM b # (<*) :: STM a -> STM b -> STM a #
Applicative First	Since: base-4.8.0.0
Instance details Defined in Data.Monoid Methods pure :: a -> First a # (<>) :: First (a -> b) -> First a -> First b # liftA2 :: (a -> b -> c) -> First a -> First b -> First c # (>) :: First a -> First b -> First b # (<*) :: First a -> First b -> First a #
Applicative Last	Since: base-4.8.0.0
Instance details Defined in Data.Monoid Methods pure :: a -> Last a # (<>) :: Last (a -> b) -> Last a -> Last b # liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c # (>) :: Last a -> Last b -> Last b # (<*) :: Last a -> Last b -> Last a #
Applicative Dual	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Dual a # (<>) :: Dual (a -> b) -> Dual a -> Dual b # liftA2 :: (a -> b -> c) -> Dual a -> Dual b -> Dual c # (>) :: Dual a -> Dual b -> Dual b # (<*) :: Dual a -> Dual b -> Dual a #
Applicative Sum	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Sum a # (<>) :: Sum (a -> b) -> Sum a -> Sum b # liftA2 :: (a -> b -> c) -> Sum a -> Sum b -> Sum c # (>) :: Sum a -> Sum b -> Sum b # (<*) :: Sum a -> Sum b -> Sum a #
Applicative Product	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Product a # (<>) :: Product (a -> b) -> Product a -> Product b # liftA2 :: (a -> b -> c) -> Product a -> Product b -> Product c # (>) :: Product a -> Product b -> Product b # (<*) :: Product a -> Product b -> Product a #
Applicative Down	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods pure :: a -> Down a # (<>) :: Down (a -> b) -> Down a -> Down b # liftA2 :: (a -> b -> c) -> Down a -> Down b -> Down c # (>) :: Down a -> Down b -> Down b # (<*) :: Down a -> Down b -> Down a #
Applicative ReadP	Since: base-4.6.0.0
Instance details Defined in Text.ParserCombinators.ReadP Methods pure :: a -> ReadP a # (<>) :: ReadP (a -> b) -> ReadP a -> ReadP b # liftA2 :: (a -> b -> c) -> ReadP a -> ReadP b -> ReadP c # (>) :: ReadP a -> ReadP b -> ReadP b # (<*) :: ReadP a -> ReadP b -> ReadP a #
Applicative NonEmpty	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods pure :: a -> NonEmpty a # (<>) :: NonEmpty (a -> b) -> NonEmpty a -> NonEmpty b # liftA2 :: (a -> b -> c) -> NonEmpty a -> NonEmpty b -> NonEmpty c # (>) :: NonEmpty a -> NonEmpty b -> NonEmpty b # (<*) :: NonEmpty a -> NonEmpty b -> NonEmpty a #
Applicative Tree
Instance details Defined in Data.Tree Methods pure :: a -> Tree a # (<>) :: Tree (a -> b) -> Tree a -> Tree b # liftA2 :: (a -> b -> c) -> Tree a -> Tree b -> Tree c # (>) :: Tree a -> Tree b -> Tree b # (<*) :: Tree a -> Tree b -> Tree a #
Applicative Seq	Since: containers-0.5.4
Instance details Defined in Data.Sequence.Internal Methods pure :: a -> Seq a # (<>) :: Seq (a -> b) -> Seq a -> Seq b # liftA2 :: (a -> b -> c) -> Seq a -> Seq b -> Seq c # (>) :: Seq a -> Seq b -> Seq b # (<*) :: Seq a -> Seq b -> Seq a #
Applicative P	Since: base-4.5.0.0
Instance details Defined in Text.ParserCombinators.ReadP Methods pure :: a -> P a # (<>) :: P (a -> b) -> P a -> P b # liftA2 :: (a -> b -> c) -> P a -> P b -> P c # (>) :: P a -> P b -> P b # (<*) :: P a -> P b -> P a #
Applicative MarkupM
Instance details Defined in Text.Blaze.Internal Methods pure :: a -> MarkupM a # (<>) :: MarkupM (a -> b) -> MarkupM a -> MarkupM b # liftA2 :: (a -> b -> c) -> MarkupM a -> MarkupM b -> MarkupM c # (>) :: MarkupM a -> MarkupM b -> MarkupM b # (<*) :: MarkupM a -> MarkupM b -> MarkupM a #
Applicative PandocIO
Instance details Defined in Text.Pandoc.Class Methods pure :: a -> PandocIO a # (<>) :: PandocIO (a -> b) -> PandocIO a -> PandocIO b # liftA2 :: (a -> b -> c) -> PandocIO a -> PandocIO b -> PandocIO c # (>) :: PandocIO a -> PandocIO b -> PandocIO b # (<*) :: PandocIO a -> PandocIO b -> PandocIO a #
Applicative PandocPure
Instance details Defined in Text.Pandoc.Class Methods pure :: a -> PandocPure a # (<>) :: PandocPure (a -> b) -> PandocPure a -> PandocPure b # liftA2 :: (a -> b -> c) -> PandocPure a -> PandocPure b -> PandocPure c # (>) :: PandocPure a -> PandocPure b -> PandocPure b # (<*) :: PandocPure a -> PandocPure b -> PandocPure a #
Applicative Lua
Instance details Defined in Foreign.Lua.Core.Types Methods pure :: a -> Lua a # (<>) :: Lua (a -> b) -> Lua a -> Lua b # liftA2 :: (a -> b -> c) -> Lua a -> Lua b -> Lua c # (>) :: Lua a -> Lua b -> Lua b # (<*) :: Lua a -> Lua b -> Lua a #
Applicative DList
Instance details Defined in Data.DList Methods pure :: a -> DList a # (<>) :: DList (a -> b) -> DList a -> DList b # liftA2 :: (a -> b -> c) -> DList a -> DList b -> DList c # (>) :: DList a -> DList b -> DList b # (<*) :: DList a -> DList b -> DList a #
Applicative Stream
Instance details Defined in Codec.Compression.Zlib.Stream Methods pure :: a -> Stream a # (<>) :: Stream (a -> b) -> Stream a -> Stream b # liftA2 :: (a -> b -> c) -> Stream a -> Stream b -> Stream c # (>) :: Stream a -> Stream b -> Stream b # (<*) :: Stream a -> Stream b -> Stream a #
Applicative CryptoFailable
Instance details Defined in Crypto.Error.Types Methods pure :: a -> CryptoFailable a # (<>) :: CryptoFailable (a -> b) -> CryptoFailable a -> CryptoFailable b # liftA2 :: (a -> b -> c) -> CryptoFailable a -> CryptoFailable b -> CryptoFailable c # (>) :: CryptoFailable a -> CryptoFailable b -> CryptoFailable b # (<*) :: CryptoFailable a -> CryptoFailable b -> CryptoFailable a #
Applicative Parser
Instance details Defined in Data.Aeson.Types.Internal Methods pure :: a -> Parser a # (<>) :: Parser (a -> b) -> Parser a -> Parser b # liftA2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c # (>) :: Parser a -> Parser b -> Parser b # (<*) :: Parser a -> Parser b -> Parser a #
Applicative Vector
Instance details Defined in Data.Vector Methods pure :: a -> Vector a # (<>) :: Vector (a -> b) -> Vector a -> Vector b # liftA2 :: (a -> b -> c) -> Vector a -> Vector b -> Vector c # (>) :: Vector a -> Vector b -> Vector b # (<*) :: Vector a -> Vector b -> Vector a #
Applicative Array
Instance details Defined in Data.Primitive.Array Methods pure :: a -> Array a # (<>) :: Array (a -> b) -> Array a -> Array b # liftA2 :: (a -> b -> c) -> Array a -> Array b -> Array c # (>) :: Array a -> Array b -> Array b # (<*) :: Array a -> Array b -> Array a #
Applicative SmallArray
Instance details Defined in Data.Primitive.SmallArray Methods pure :: a -> SmallArray a # (<>) :: SmallArray (a -> b) -> SmallArray a -> SmallArray b # liftA2 :: (a -> b -> c) -> SmallArray a -> SmallArray b -> SmallArray c # (>) :: SmallArray a -> SmallArray b -> SmallArray b # (<*) :: SmallArray a -> SmallArray b -> SmallArray a #
Applicative RGB
Instance details Defined in Data.Colour.RGB Methods pure :: a -> RGB a # (<>) :: RGB (a -> b) -> RGB a -> RGB b # liftA2 :: (a -> b -> c) -> RGB a -> RGB b -> RGB c # (>) :: RGB a -> RGB b -> RGB b # (<*) :: RGB a -> RGB b -> RGB a #
Applicative IResult
Instance details Defined in Data.Aeson.Types.Internal Methods pure :: a -> IResult a # (<>) :: IResult (a -> b) -> IResult a -> IResult b # liftA2 :: (a -> b -> c) -> IResult a -> IResult b -> IResult c # (>) :: IResult a -> IResult b -> IResult b # (<*) :: IResult a -> IResult b -> IResult a #
Applicative Result
Instance details Defined in Data.Aeson.Types.Internal Methods pure :: a -> Result a # (<>) :: Result (a -> b) -> Result a -> Result b # liftA2 :: (a -> b -> c) -> Result a -> Result b -> Result c # (>) :: Result a -> Result b -> Result b # (<*) :: Result a -> Result b -> Result a #
Applicative Root
Instance details Defined in Numeric.RootFinding Methods pure :: a -> Root a # (<>) :: Root (a -> b) -> Root a -> Root b # liftA2 :: (a -> b -> c) -> Root a -> Root b -> Root c # (>) :: Root a -> Root b -> Root b # (<*) :: Root a -> Root b -> Root a #
Applicative Headed
Instance details Defined in Colonnade.Encode Methods pure :: a -> Headed a # (<>) :: Headed (a -> b) -> Headed a -> Headed b # liftA2 :: (a -> b -> c) -> Headed a -> Headed b -> Headed c # (>) :: Headed a -> Headed b -> Headed b # (<*) :: Headed a -> Headed b -> Headed a #
Applicative Headless
Instance details Defined in Colonnade.Encode Methods pure :: a -> Headless a # (<>) :: Headless (a -> b) -> Headless a -> Headless b # liftA2 :: (a -> b -> c) -> Headless a -> Headless b -> Headless c # (>) :: Headless a -> Headless b -> Headless b # (<*) :: Headless a -> Headless b -> Headless a #
Applicative Active
Instance details Defined in Data.Active Methods pure :: a -> Active a # (<>) :: Active (a -> b) -> Active a -> Active b # liftA2 :: (a -> b -> c) -> Active a -> Active b -> Active c # (>) :: Active a -> Active b -> Active b # (<*) :: Active a -> Active b -> Active a #
Applicative Duration
Instance details Defined in Data.Active Methods pure :: a -> Duration a # (<>) :: Duration (a -> b) -> Duration a -> Duration b # liftA2 :: (a -> b -> c) -> Duration a -> Duration b -> Duration c # (>) :: Duration a -> Duration b -> Duration b # (<*) :: Duration a -> Duration b -> Duration a #
Applicative Angle
Instance details Defined in Diagrams.Angle Methods pure :: a -> Angle a # (<>) :: Angle (a -> b) -> Angle a -> Angle b # liftA2 :: (a -> b -> c) -> Angle a -> Angle b -> Angle c # (>) :: Angle a -> Angle b -> Angle b # (<*) :: Angle a -> Angle b -> Angle a #
Applicative V2
Instance details Defined in Linear.V2 Methods pure :: a -> V2 a # (<>) :: V2 (a -> b) -> V2 a -> V2 b # liftA2 :: (a -> b -> c) -> V2 a -> V2 b -> V2 c # (>) :: V2 a -> V2 b -> V2 b # (<*) :: V2 a -> V2 b -> V2 a #
Applicative V3
Instance details Defined in Linear.V3 Methods pure :: a -> V3 a # (<>) :: V3 (a -> b) -> V3 a -> V3 b # liftA2 :: (a -> b -> c) -> V3 a -> V3 b -> V3 c # (>) :: V3 a -> V3 b -> V3 b # (<*) :: V3 a -> V3 b -> V3 a #
Applicative Interval
Instance details Defined in Numeric.Interval.Kaucher Methods pure :: a -> Interval a # (<>) :: Interval (a -> b) -> Interval a -> Interval b # liftA2 :: (a -> b -> c) -> Interval a -> Interval b -> Interval c # (>) :: Interval a -> Interval b -> Interval b # (<*) :: Interval a -> Interval b -> Interval a #
Applicative V4
Instance details Defined in Linear.V4 Methods pure :: a -> V4 a # (<>) :: V4 (a -> b) -> V4 a -> V4 b # liftA2 :: (a -> b -> c) -> V4 a -> V4 b -> V4 c # (>) :: V4 a -> V4 b -> V4 b # (<*) :: V4 a -> V4 b -> V4 a #
Applicative V1
Instance details Defined in Linear.V1 Methods pure :: a -> V1 a # (<>) :: V1 (a -> b) -> V1 a -> V1 b # liftA2 :: (a -> b -> c) -> V1 a -> V1 b -> V1 c # (>) :: V1 a -> V1 b -> V1 b # (<*) :: V1 a -> V1 b -> V1 a #
Applicative Plucker
Instance details Defined in Linear.Plucker Methods pure :: a -> Plucker a # (<>) :: Plucker (a -> b) -> Plucker a -> Plucker b # liftA2 :: (a -> b -> c) -> Plucker a -> Plucker b -> Plucker c # (>) :: Plucker a -> Plucker b -> Plucker b # (<*) :: Plucker a -> Plucker b -> Plucker a #
Applicative Quaternion
Instance details Defined in Linear.Quaternion Methods pure :: a -> Quaternion a # (<>) :: Quaternion (a -> b) -> Quaternion a -> Quaternion b # liftA2 :: (a -> b -> c) -> Quaternion a -> Quaternion b -> Quaternion c # (>) :: Quaternion a -> Quaternion b -> Quaternion b # (<*) :: Quaternion a -> Quaternion b -> Quaternion a #
Applicative V0
Instance details Defined in Linear.V0 Methods pure :: a -> V0 a # (<>) :: V0 (a -> b) -> V0 a -> V0 b # liftA2 :: (a -> b -> c) -> V0 a -> V0 b -> V0 c # (>) :: V0 a -> V0 b -> V0 b # (<*) :: V0 a -> V0 b -> V0 a #
Applicative (Either e)	Since: base-3.0
Instance details Defined in Data.Either Methods pure :: a -> Either e a # (<>) :: Either e (a -> b) -> Either e a -> Either e b # liftA2 :: (a -> b -> c) -> Either e a -> Either e b -> Either e c # (>) :: Either e a -> Either e b -> Either e b # (<*) :: Either e a -> Either e b -> Either e a #
Applicative (U1 :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> U1 a # (<>) :: U1 (a -> b) -> U1 a -> U1 b # liftA2 :: (a -> b -> c) -> U1 a -> U1 b -> U1 c # (>) :: U1 a -> U1 b -> U1 b # (<*) :: U1 a -> U1 b -> U1 a #
Monoid a => Applicative ((,) a)	For tuples, the `Monoid` constraint on `a` determines how the first values merge. For example, `String`s concatenate: ("hello ", (+15)) <> ("world!", 2002) ("hello world!",2017) Since: base-2.1*
Instance details Defined in GHC.Base Methods pure :: a0 -> (a, a0) # (<>) :: (a, a0 -> b) -> (a, a0) -> (a, b) # liftA2 :: (a0 -> b -> c) -> (a, a0) -> (a, b) -> (a, c) # (>) :: (a, a0) -> (a, b) -> (a, b) # (<*) :: (a, a0) -> (a, b) -> (a, a0) #
Monad m => Applicative (WrappedMonad m)	Since: base-2.1
Instance details Defined in Control.Applicative Methods pure :: a -> WrappedMonad m a # (<>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b # liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c # (>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b # (<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a #
Arrow a => Applicative (ArrowMonad a)	Since: base-4.6.0.0
Instance details Defined in Control.Arrow Methods pure :: a0 -> ArrowMonad a a0 # (<>) :: ArrowMonad a (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b # liftA2 :: (a0 -> b -> c) -> ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a c # (>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b # (<*) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a a0 #
Applicative (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods pure :: a -> Proxy a # (<>) :: Proxy (a -> b) -> Proxy a -> Proxy b # liftA2 :: (a -> b -> c) -> Proxy a -> Proxy b -> Proxy c # (>) :: Proxy a -> Proxy b -> Proxy b # (<*) :: Proxy a -> Proxy b -> Proxy a #
(Functor m, Monad m) => Applicative (MaybeT m)
Instance details Defined in Control.Monad.Trans.Maybe Methods pure :: a -> MaybeT m a # (<>) :: MaybeT m (a -> b) -> MaybeT m a -> MaybeT m b # liftA2 :: (a -> b -> c) -> MaybeT m a -> MaybeT m b -> MaybeT m c # (>) :: MaybeT m a -> MaybeT m b -> MaybeT m b # (<*) :: MaybeT m a -> MaybeT m b -> MaybeT m a #
Applicative m => Applicative (ListT m)
Instance details Defined in Control.Monad.Trans.List Methods pure :: a -> ListT m a # (<>) :: ListT m (a -> b) -> ListT m a -> ListT m b # liftA2 :: (a -> b -> c) -> ListT m a -> ListT m b -> ListT m c # (>) :: ListT m a -> ListT m b -> ListT m b # (<*) :: ListT m a -> ListT m b -> ListT m a #
Applicative (Sem f)
Instance details Defined in Polysemy.Internal Methods pure :: a -> Sem f a # (<>) :: Sem f (a -> b) -> Sem f a -> Sem f b # liftA2 :: (a -> b -> c) -> Sem f a -> Sem f b -> Sem f c # (>) :: Sem f a -> Sem f b -> Sem f b # (<*) :: Sem f a -> Sem f b -> Sem f a #
Applicative m => Applicative (HtmlT m)
Instance details Defined in Lucid.Base Methods pure :: a -> HtmlT m a # (<>) :: HtmlT m (a -> b) -> HtmlT m a -> HtmlT m b # liftA2 :: (a -> b -> c) -> HtmlT m a -> HtmlT m b -> HtmlT m c # (>) :: HtmlT m a -> HtmlT m b -> HtmlT m b # (<*) :: HtmlT m a -> HtmlT m b -> HtmlT m a #
Applicative (Parser i)
Instance details Defined in Data.Attoparsec.Internal.Types Methods pure :: a -> Parser i a # (<>) :: Parser i (a -> b) -> Parser i a -> Parser i b # liftA2 :: (a -> b -> c) -> Parser i a -> Parser i b -> Parser i c # (>) :: Parser i a -> Parser i b -> Parser i b # (<*) :: Parser i a -> Parser i b -> Parser i a #
Applicative (RVarT n)
Instance details Defined in Data.RVar Methods pure :: a -> RVarT n a # (<>) :: RVarT n (a -> b) -> RVarT n a -> RVarT n b # liftA2 :: (a -> b -> c) -> RVarT n a -> RVarT n b -> RVarT n c # (>) :: RVarT n a -> RVarT n b -> RVarT n b # (<*) :: RVarT n a -> RVarT n b -> RVarT n a #
Applicative (Prompt p)
Instance details Defined in Control.Monad.Prompt Methods pure :: a -> Prompt p a # (<>) :: Prompt p (a -> b) -> Prompt p a -> Prompt p b # liftA2 :: (a -> b -> c) -> Prompt p a -> Prompt p b -> Prompt p c # (>) :: Prompt p a -> Prompt p b -> Prompt p b # (<*) :: Prompt p a -> Prompt p b -> Prompt p a #
Applicative (RecPrompt p)
Instance details Defined in Control.Monad.Prompt Methods pure :: a -> RecPrompt p a # (<>) :: RecPrompt p (a -> b) -> RecPrompt p a -> RecPrompt p b # liftA2 :: (a -> b -> c) -> RecPrompt p a -> RecPrompt p b -> RecPrompt p c # (>) :: RecPrompt p a -> RecPrompt p b -> RecPrompt p b # (<*) :: RecPrompt p a -> RecPrompt p b -> RecPrompt p a #
Applicative (Measured n)
Instance details Defined in Diagrams.Core.Measure Methods pure :: a -> Measured n a # (<>) :: Measured n (a -> b) -> Measured n a -> Measured n b # liftA2 :: (a -> b -> c) -> Measured n a -> Measured n b -> Measured n c # (>) :: Measured n a -> Measured n b -> Measured n b # (<*) :: Measured n a -> Measured n b -> Measured n a #
Applicative f => Applicative (Point f)
Instance details Defined in Linear.Affine Methods pure :: a -> Point f a # (<>) :: Point f (a -> b) -> Point f a -> Point f b # liftA2 :: (a -> b -> c) -> Point f a -> Point f b -> Point f c # (>) :: Point f a -> Point f b -> Point f b # (<*) :: Point f a -> Point f b -> Point f a #
Applicative (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods pure :: a -> ReifiedFold s a # (<>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b # liftA2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c # (>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b # (<*) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a #
Applicative (ReifiedGetter s)
Instance details Defined in Control.Lens.Reified Methods pure :: a -> ReifiedGetter s a # (<>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b # liftA2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c # (>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b # (<*) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a #
Apply f => Applicative (MaybeApply f)
Instance details Defined in Data.Functor.Bind.Class Methods pure :: a -> MaybeApply f a # (<>) :: MaybeApply f (a -> b) -> MaybeApply f a -> MaybeApply f b # liftA2 :: (a -> b -> c) -> MaybeApply f a -> MaybeApply f b -> MaybeApply f c # (>) :: MaybeApply f a -> MaybeApply f b -> MaybeApply f b # (<*) :: MaybeApply f a -> MaybeApply f b -> MaybeApply f a #
Applicative f => Applicative (WrappedApplicative f)
Instance details Defined in Data.Functor.Bind.Class Methods pure :: a -> WrappedApplicative f a # (<>) :: WrappedApplicative f (a -> b) -> WrappedApplicative f a -> WrappedApplicative f b # liftA2 :: (a -> b -> c) -> WrappedApplicative f a -> WrappedApplicative f b -> WrappedApplicative f c # (>) :: WrappedApplicative f a -> WrappedApplicative f b -> WrappedApplicative f b # (<*) :: WrappedApplicative f a -> WrappedApplicative f b -> WrappedApplicative f a #
Representable f => Applicative (Co f)
Instance details Defined in Data.Functor.Rep Methods pure :: a -> Co f a # (<>) :: Co f (a -> b) -> Co f a -> Co f b # liftA2 :: (a -> b -> c) -> Co f a -> Co f b -> Co f c # (>) :: Co f a -> Co f b -> Co f b # (<*) :: Co f a -> Co f b -> Co f a #
Alternative f => Applicative (Cofree f)
Instance details Defined in Control.Comonad.Cofree Methods pure :: a -> Cofree f a # (<>) :: Cofree f (a -> b) -> Cofree f a -> Cofree f b # liftA2 :: (a -> b -> c) -> Cofree f a -> Cofree f b -> Cofree f c # (>) :: Cofree f a -> Cofree f b -> Cofree f b # (<*) :: Cofree f a -> Cofree f b -> Cofree f a #
Functor f => Applicative (Free f)
Instance details Defined in Control.Monad.Free Methods pure :: a -> Free f a # (<>) :: Free f (a -> b) -> Free f a -> Free f b # liftA2 :: (a -> b -> c) -> Free f a -> Free f b -> Free f c # (>) :: Free f a -> Free f b -> Free f b # (<*) :: Free f a -> Free f b -> Free f a #
Applicative f => Applicative (Yoneda f)
Instance details Defined in Data.Functor.Yoneda Methods pure :: a -> Yoneda f a # (<>) :: Yoneda f (a -> b) -> Yoneda f a -> Yoneda f b # liftA2 :: (a -> b -> c) -> Yoneda f a -> Yoneda f b -> Yoneda f c # (>) :: Yoneda f a -> Yoneda f b -> Yoneda f b # (<*) :: Yoneda f a -> Yoneda f b -> Yoneda f a #
Applicative f => Applicative (Indexing f)
Instance details Defined in Control.Lens.Internal.Indexed Methods pure :: a -> Indexing f a # (<>) :: Indexing f (a -> b) -> Indexing f a -> Indexing f b # liftA2 :: (a -> b -> c) -> Indexing f a -> Indexing f b -> Indexing f c # (>) :: Indexing f a -> Indexing f b -> Indexing f b # (<*) :: Indexing f a -> Indexing f b -> Indexing f a #
Applicative f => Applicative (Indexing64 f)
Instance details Defined in Control.Lens.Internal.Indexed Methods pure :: a -> Indexing64 f a # (<>) :: Indexing64 f (a -> b) -> Indexing64 f a -> Indexing64 f b # liftA2 :: (a -> b -> c) -> Indexing64 f a -> Indexing64 f b -> Indexing64 f c # (>) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f b # (<*) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f a #
(Applicative (Rep p), Representable p) => Applicative (Prep p)
Instance details Defined in Data.Profunctor.Rep Methods pure :: a -> Prep p a # (<>) :: Prep p (a -> b) -> Prep p a -> Prep p b # liftA2 :: (a -> b -> c) -> Prep p a -> Prep p b -> Prep p c # (>) :: Prep p a -> Prep p b -> Prep p b # (<*) :: Prep p a -> Prep p b -> Prep p a #
Applicative f => Applicative (Rec1 f)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> Rec1 f a # (<>) :: Rec1 f (a -> b) -> Rec1 f a -> Rec1 f b # liftA2 :: (a -> b -> c) -> Rec1 f a -> Rec1 f b -> Rec1 f c # (>) :: Rec1 f a -> Rec1 f b -> Rec1 f b # (<*) :: Rec1 f a -> Rec1 f b -> Rec1 f a #
Arrow a => Applicative (WrappedArrow a b)	Since: base-2.1
Instance details Defined in Control.Applicative Methods pure :: a0 -> WrappedArrow a b a0 # (<>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 # liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c # (>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 # (<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 #
Monoid m => Applicative (Const m :: Type -> Type)	Since: base-2.0.1
Instance details Defined in Data.Functor.Const Methods pure :: a -> Const m a # (<>) :: Const m (a -> b) -> Const m a -> Const m b # liftA2 :: (a -> b -> c) -> Const m a -> Const m b -> Const m c # (>) :: Const m a -> Const m b -> Const m b # (<*) :: Const m a -> Const m b -> Const m a #
Applicative f => Applicative (Ap f)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods pure :: a -> Ap f a # (<>) :: Ap f (a -> b) -> Ap f a -> Ap f b # liftA2 :: (a -> b -> c) -> Ap f a -> Ap f b -> Ap f c # (>) :: Ap f a -> Ap f b -> Ap f b # (<*) :: Ap f a -> Ap f b -> Ap f a #
Applicative f => Applicative (Alt f)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Alt f a # (<>) :: Alt f (a -> b) -> Alt f a -> Alt f b # liftA2 :: (a -> b -> c) -> Alt f a -> Alt f b -> Alt f c # (>) :: Alt f a -> Alt f b -> Alt f b # (<*) :: Alt f a -> Alt f b -> Alt f a #
(Applicative f, Monad f) => Applicative (WhenMissing f x)	Equivalent to `ReaderT k (ReaderT x (MaybeT f))`. Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods pure :: a -> WhenMissing f x a # (<>) :: WhenMissing f x (a -> b) -> WhenMissing f x a -> WhenMissing f x b # liftA2 :: (a -> b -> c) -> WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x c # (>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # (<*) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x a #
Applicative m => Applicative (IdentityT m)
Instance details Defined in Control.Monad.Trans.Identity Methods pure :: a -> IdentityT m a # (<>) :: IdentityT m (a -> b) -> IdentityT m a -> IdentityT m b # liftA2 :: (a -> b -> c) -> IdentityT m a -> IdentityT m b -> IdentityT m c # (>) :: IdentityT m a -> IdentityT m b -> IdentityT m b # (<*) :: IdentityT m a -> IdentityT m b -> IdentityT m a #
(Functor m, Monad m) => Applicative (ErrorT e m)
Instance details Defined in Control.Monad.Trans.Error Methods pure :: a -> ErrorT e m a # (<>) :: ErrorT e m (a -> b) -> ErrorT e m a -> ErrorT e m b # liftA2 :: (a -> b -> c) -> ErrorT e m a -> ErrorT e m b -> ErrorT e m c # (>) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m b # (<*) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m a #
(Functor m, Monad m) => Applicative (ExceptT e m)
Instance details Defined in Control.Monad.Trans.Except Methods pure :: a -> ExceptT e m a # (<>) :: ExceptT e m (a -> b) -> ExceptT e m a -> ExceptT e m b # liftA2 :: (a -> b -> c) -> ExceptT e m a -> ExceptT e m b -> ExceptT e m c # (>) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m b # (<*) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m a #
Applicative m => Applicative (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods pure :: a -> ReaderT r m a # (<>) :: ReaderT r m (a -> b) -> ReaderT r m a -> ReaderT r m b # liftA2 :: (a -> b -> c) -> ReaderT r m a -> ReaderT r m b -> ReaderT r m c # (>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b # (<*) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m a #
(Functor m, Monad m) => Applicative (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Lazy Methods pure :: a -> StateT s m a # (<>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b # liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c # (>) :: StateT s m a -> StateT s m b -> StateT s m b # (<*) :: StateT s m a -> StateT s m b -> StateT s m a #
(Functor m, Monad m) => Applicative (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Strict Methods pure :: a -> StateT s m a # (<>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b # liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c # (>) :: StateT s m a -> StateT s m b -> StateT s m b # (<*) :: StateT s m a -> StateT s m b -> StateT s m a #
(Monoid w, Applicative m) => Applicative (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods pure :: a -> WriterT w m a # (<>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b # liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c # (>) :: WriterT w m a -> WriterT w m b -> WriterT w m b # (<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a #
(Monoid w, Applicative m) => Applicative (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods pure :: a -> WriterT w m a # (<>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b # liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c # (>) :: WriterT w m a -> WriterT w m b -> WriterT w m b # (<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a #
Applicative f => Applicative (Reverse f)	Derived instance.
Instance details Defined in Data.Functor.Reverse Methods pure :: a -> Reverse f a # (<>) :: Reverse f (a -> b) -> Reverse f a -> Reverse f b # liftA2 :: (a -> b -> c) -> Reverse f a -> Reverse f b -> Reverse f c # (>) :: Reverse f a -> Reverse f b -> Reverse f b # (<*) :: Reverse f a -> Reverse f b -> Reverse f a #
Applicative f => Applicative (Backwards f)	Apply `f`-actions in the reverse order.
Instance details Defined in Control.Applicative.Backwards Methods pure :: a -> Backwards f a # (<>) :: Backwards f (a -> b) -> Backwards f a -> Backwards f b # liftA2 :: (a -> b -> c) -> Backwards f a -> Backwards f b -> Backwards f c # (>) :: Backwards f a -> Backwards f b -> Backwards f b # (<*) :: Backwards f a -> Backwards f b -> Backwards f a #
Applicative m => Applicative (DiscardLoggingT message m)
Instance details Defined in Control.Monad.Log Methods pure :: a -> DiscardLoggingT message m a # (<>) :: DiscardLoggingT message m (a -> b) -> DiscardLoggingT message m a -> DiscardLoggingT message m b # liftA2 :: (a -> b -> c) -> DiscardLoggingT message m a -> DiscardLoggingT message m b -> DiscardLoggingT message m c # (>) :: DiscardLoggingT message m a -> DiscardLoggingT message m b -> DiscardLoggingT message m b # (<*) :: DiscardLoggingT message m a -> DiscardLoggingT message m b -> DiscardLoggingT message m a #
Applicative m => Applicative (LoggingT message m)
Instance details Defined in Control.Monad.Log Methods pure :: a -> LoggingT message m a # (<>) :: LoggingT message m (a -> b) -> LoggingT message m a -> LoggingT message m b # liftA2 :: (a -> b -> c) -> LoggingT message m a -> LoggingT message m b -> LoggingT message m c # (>) :: LoggingT message m a -> LoggingT message m b -> LoggingT message m b # (<*) :: LoggingT message m a -> LoggingT message m b -> LoggingT message m a #
Monad m => Applicative (PureLoggingT log m)
Instance details Defined in Control.Monad.Log Methods pure :: a -> PureLoggingT log m a # (<>) :: PureLoggingT log m (a -> b) -> PureLoggingT log m a -> PureLoggingT log m b # liftA2 :: (a -> b -> c) -> PureLoggingT log m a -> PureLoggingT log m b -> PureLoggingT log m c # (>) :: PureLoggingT log m a -> PureLoggingT log m b -> PureLoggingT log m b # (<*) :: PureLoggingT log m a -> PureLoggingT log m b -> PureLoggingT log m a #
(Functor f, Monad m) => Applicative (FreeT f m)
Instance details Defined in Control.Monad.Trans.Free Methods pure :: a -> FreeT f m a # (<>) :: FreeT f m (a -> b) -> FreeT f m a -> FreeT f m b # liftA2 :: (a -> b -> c) -> FreeT f m a -> FreeT f m b -> FreeT f m c # (>) :: FreeT f m a -> FreeT f m b -> FreeT f m b # (<*) :: FreeT f m a -> FreeT f m b -> FreeT f m a #
Biapplicative p => Applicative (Join p)
Instance details Defined in Data.Bifunctor.Join Methods pure :: a -> Join p a # (<>) :: Join p (a -> b) -> Join p a -> Join p b # liftA2 :: (a -> b -> c) -> Join p a -> Join p b -> Join p c # (>) :: Join p a -> Join p b -> Join p b # (<*) :: Join p a -> Join p b -> Join p a #
Applicative (Tagged s)
Instance details Defined in Data.Tagged Methods pure :: a -> Tagged s a # (<>) :: Tagged s (a -> b) -> Tagged s a -> Tagged s b # liftA2 :: (a -> b -> c) -> Tagged s a -> Tagged s b -> Tagged s c # (>) :: Tagged s a -> Tagged s b -> Tagged s b # (<*) :: Tagged s a -> Tagged s b -> Tagged s a #
Applicative (Mag a b)
Instance details Defined in Data.Biapplicative Methods pure :: a0 -> Mag a b a0 # (<>) :: Mag a b (a0 -> b0) -> Mag a b a0 -> Mag a b b0 # liftA2 :: (a0 -> b0 -> c) -> Mag a b a0 -> Mag a b b0 -> Mag a b c # (>) :: Mag a b a0 -> Mag a b b0 -> Mag a b b0 # (<*) :: Mag a b a0 -> Mag a b b0 -> Mag a b a0 #
Monad m => Applicative (RandT g m)
Instance details Defined in Control.Monad.Trans.Random.Lazy Methods pure :: a -> RandT g m a # (<>) :: RandT g m (a -> b) -> RandT g m a -> RandT g m b # liftA2 :: (a -> b -> c) -> RandT g m a -> RandT g m b -> RandT g m c # (>) :: RandT g m a -> RandT g m b -> RandT g m b # (<*) :: RandT g m a -> RandT g m b -> RandT g m a #
Applicative (PromptT p m)
Instance details Defined in Control.Monad.Prompt Methods pure :: a -> PromptT p m a # (<>) :: PromptT p m (a -> b) -> PromptT p m a -> PromptT p m b # liftA2 :: (a -> b -> c) -> PromptT p m a -> PromptT p m b -> PromptT p m c # (>) :: PromptT p m a -> PromptT p m b -> PromptT p m b # (<*) :: PromptT p m a -> PromptT p m b -> PromptT p m a #
Applicative (RecPromptT p m)
Instance details Defined in Control.Monad.Prompt Methods pure :: a -> RecPromptT p m a # (<>) :: RecPromptT p m (a -> b) -> RecPromptT p m a -> RecPromptT p m b # liftA2 :: (a -> b -> c) -> RecPromptT p m a -> RecPromptT p m b -> RecPromptT p m c # (>) :: RecPromptT p m a -> RecPromptT p m b -> RecPromptT p m b # (<*) :: RecPromptT p m a -> RecPromptT p m b -> RecPromptT p m a #
Applicative (Query v n)
Instance details Defined in Diagrams.Core.Query Methods pure :: a -> Query v n a # (<>) :: Query v n (a -> b) -> Query v n a -> Query v n b # liftA2 :: (a -> b -> c) -> Query v n a -> Query v n b -> Query v n c # (>) :: Query v n a -> Query v n b -> Query v n b # (<*) :: Query v n a -> Query v n b -> Query v n a #
Applicative (Indexed i a)
Instance details Defined in Control.Lens.Internal.Indexed Methods pure :: a0 -> Indexed i a a0 # (<>) :: Indexed i a (a0 -> b) -> Indexed i a a0 -> Indexed i a b # liftA2 :: (a0 -> b -> c) -> Indexed i a a0 -> Indexed i a b -> Indexed i a c # (>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b # (<*) :: Indexed i a a0 -> Indexed i a b -> Indexed i a a0 #
Biapplicative p => Applicative (Fix p)
Instance details Defined in Data.Bifunctor.Fix Methods pure :: a -> Fix p a # (<>) :: Fix p (a -> b) -> Fix p a -> Fix p b # liftA2 :: (a -> b -> c) -> Fix p a -> Fix p b -> Fix p c # (>) :: Fix p a -> Fix p b -> Fix p b # (<*) :: Fix p a -> Fix p b -> Fix p a #
(Alternative f, Applicative w) => Applicative (CofreeT f w)
Instance details Defined in Control.Comonad.Trans.Cofree Methods pure :: a -> CofreeT f w a # (<>) :: CofreeT f w (a -> b) -> CofreeT f w a -> CofreeT f w b # liftA2 :: (a -> b -> c) -> CofreeT f w a -> CofreeT f w b -> CofreeT f w c # (>) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w b # (<*) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w a #
Applicative (Costar f a)
Instance details Defined in Data.Profunctor.Types Methods pure :: a0 -> Costar f a a0 # (<>) :: Costar f a (a0 -> b) -> Costar f a a0 -> Costar f a b # liftA2 :: (a0 -> b -> c) -> Costar f a a0 -> Costar f a b -> Costar f a c # (>) :: Costar f a a0 -> Costar f a b -> Costar f a b # (<*) :: Costar f a a0 -> Costar f a b -> Costar f a a0 #
Applicative f => Applicative (Star f a)
Instance details Defined in Data.Profunctor.Types Methods pure :: a0 -> Star f a a0 # (<>) :: Star f a (a0 -> b) -> Star f a a0 -> Star f a b # liftA2 :: (a0 -> b -> c) -> Star f a a0 -> Star f a b -> Star f a c # (>) :: Star f a a0 -> Star f a b -> Star f a b # (<*) :: Star f a a0 -> Star f a b -> Star f a a0 #
Applicative w => Applicative (TracedT m w)
Instance details Defined in Control.Comonad.Trans.Traced Methods pure :: a -> TracedT m w a # (<>) :: TracedT m w (a -> b) -> TracedT m w a -> TracedT m w b # liftA2 :: (a -> b -> c) -> TracedT m w a -> TracedT m w b -> TracedT m w c # (>) :: TracedT m w a -> TracedT m w b -> TracedT m w b # (<*) :: TracedT m w a -> TracedT m w b -> TracedT m w a #
(Applicative f, Applicative g) => Applicative (Day f g)
Instance details Defined in Data.Functor.Day Methods pure :: a -> Day f g a # (<>) :: Day f g (a -> b) -> Day f g a -> Day f g b # liftA2 :: (a -> b -> c) -> Day f g a -> Day f g b -> Day f g c # (>) :: Day f g a -> Day f g b -> Day f g b # (<*) :: Day f g a -> Day f g b -> Day f g a #
Dim n => Applicative (V n)
Instance details Defined in Linear.V Methods pure :: a -> V n a # (<>) :: V n (a -> b) -> V n a -> V n b # liftA2 :: (a -> b -> c) -> V n a -> V n b -> V n c # (>) :: V n a -> V n b -> V n b # (<*) :: V n a -> V n b -> V n a #
(Profunctor p, Arrow p) => Applicative (Tambara p a)
Instance details Defined in Data.Profunctor.Strong Methods pure :: a0 -> Tambara p a a0 # (<>) :: Tambara p a (a0 -> b) -> Tambara p a a0 -> Tambara p a b # liftA2 :: (a0 -> b -> c) -> Tambara p a a0 -> Tambara p a b -> Tambara p a c # (>) :: Tambara p a a0 -> Tambara p a b -> Tambara p a b # (<*) :: Tambara p a a0 -> Tambara p a b -> Tambara p a a0 #
Applicative (Mafic a b)
Instance details Defined in Control.Lens.Internal.Magma Methods pure :: a0 -> Mafic a b a0 # (<>) :: Mafic a b (a0 -> b0) -> Mafic a b a0 -> Mafic a b b0 # liftA2 :: (a0 -> b0 -> c) -> Mafic a b a0 -> Mafic a b b0 -> Mafic a b c # (>) :: Mafic a b a0 -> Mafic a b b0 -> Mafic a b b0 # (<*) :: Mafic a b a0 -> Mafic a b b0 -> Mafic a b a0 #
Applicative (Flows i b)
Instance details Defined in Control.Lens.Internal.Level Methods pure :: a -> Flows i b a # (<>) :: Flows i b (a -> b0) -> Flows i b a -> Flows i b b0 # liftA2 :: (a -> b0 -> c) -> Flows i b a -> Flows i b b0 -> Flows i b c # (>) :: Flows i b a -> Flows i b b0 -> Flows i b b0 # (<*) :: Flows i b a -> Flows i b b0 -> Flows i b a #
Monoid m => Applicative (Holes t m)
Instance details Defined in Control.Lens.Traversal Methods pure :: a -> Holes t m a # (<>) :: Holes t m (a -> b) -> Holes t m a -> Holes t m b # liftA2 :: (a -> b -> c) -> Holes t m a -> Holes t m b -> Holes t m c # (>) :: Holes t m a -> Holes t m b -> Holes t m b # (<*) :: Holes t m a -> Holes t m b -> Holes t m a #
(Functor g, g ~ h) => Applicative (Curried g h)
Instance details Defined in Data.Functor.Day.Curried Methods pure :: a -> Curried g h a # (<>) :: Curried g h (a -> b) -> Curried g h a -> Curried g h b # liftA2 :: (a -> b -> c) -> Curried g h a -> Curried g h b -> Curried g h c # (>) :: Curried g h a -> Curried g h b -> Curried g h b # (<*) :: Curried g h a -> Curried g h b -> Curried g h a #
Applicative ((->) a :: Type -> Type)	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a0 -> a -> a0 # (<>) :: (a -> (a0 -> b)) -> (a -> a0) -> a -> b # liftA2 :: (a0 -> b -> c) -> (a -> a0) -> (a -> b) -> a -> c # (>) :: (a -> a0) -> (a -> b) -> a -> b # (<*) :: (a -> a0) -> (a -> b) -> a -> a0 #
Monoid c => Applicative (K1 i c :: Type -> Type)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> K1 i c a # (<>) :: K1 i c (a -> b) -> K1 i c a -> K1 i c b # liftA2 :: (a -> b -> c0) -> K1 i c a -> K1 i c b -> K1 i c c0 # (>) :: K1 i c a -> K1 i c b -> K1 i c b # (<*) :: K1 i c a -> K1 i c b -> K1 i c a #
(Applicative f, Applicative g) => Applicative (f :*: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> (f :: g) a # (<>) :: (f :: g) (a -> b) -> (f :: g) a -> (f :: g) b # liftA2 :: (a -> b -> c) -> (f :: g) a -> (f :: g) b -> (f :: g) c # (>) :: (f :: g) a -> (f :: g) b -> (f :: g) b # (<) :: (f :: g) a -> (f :: g) b -> (f :: g) a #
(Applicative f, Applicative g) => Applicative (Product f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods pure :: a -> Product f g a # (<>) :: Product f g (a -> b) -> Product f g a -> Product f g b # liftA2 :: (a -> b -> c) -> Product f g a -> Product f g b -> Product f g c # (>) :: Product f g a -> Product f g b -> Product f g b # (<*) :: Product f g a -> Product f g b -> Product f g a #
(Monad f, Applicative f) => Applicative (WhenMatched f x y)	Equivalent to `ReaderT Key (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods pure :: a -> WhenMatched f x y a # (<>) :: WhenMatched f x y (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b # liftA2 :: (a -> b -> c) -> WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y c # (>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b # (<*) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y a #
(Applicative f, Monad f) => Applicative (WhenMissing f k x)	Equivalent to `ReaderT k (ReaderT x (MaybeT f))` . Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods pure :: a -> WhenMissing f k x a # (<>) :: WhenMissing f k x (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b # liftA2 :: (a -> b -> c) -> WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x c # (>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b # (<*) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x a #
Applicative (ContT r m)
Instance details Defined in Control.Monad.Trans.Cont Methods pure :: a -> ContT r m a # (<>) :: ContT r m (a -> b) -> ContT r m a -> ContT r m b # liftA2 :: (a -> b -> c) -> ContT r m a -> ContT r m b -> ContT r m c # (>) :: ContT r m a -> ContT r m b -> ContT r m b # (<*) :: ContT r m a -> ContT r m b -> ContT r m a #
Applicative (ParsecT s u m)
Instance details Defined in Text.Parsec.Prim Methods pure :: a -> ParsecT s u m a # (<>) :: ParsecT s u m (a -> b) -> ParsecT s u m a -> ParsecT s u m b # liftA2 :: (a -> b -> c) -> ParsecT s u m a -> ParsecT s u m b -> ParsecT s u m c # (>) :: ParsecT s u m a -> ParsecT s u m b -> ParsecT s u m b # (<*) :: ParsecT s u m a -> ParsecT s u m b -> ParsecT s u m a #
Applicative (Bazaar p a b)
Instance details Defined in Control.Lens.Internal.Bazaar Methods pure :: a0 -> Bazaar p a b a0 # (<>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 # liftA2 :: (a0 -> b0 -> c) -> Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b c # (>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0 # (<*) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #
Applicative (Molten i a b)
Instance details Defined in Control.Lens.Internal.Magma Methods pure :: a0 -> Molten i a b a0 # (<>) :: Molten i a b (a0 -> b0) -> Molten i a b a0 -> Molten i a b b0 # liftA2 :: (a0 -> b0 -> c) -> Molten i a b a0 -> Molten i a b b0 -> Molten i a b c # (>) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b b0 # (<*) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b a0 #
Applicative f => Applicative (M1 i c f)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> M1 i c f a # (<>) :: M1 i c f (a -> b) -> M1 i c f a -> M1 i c f b # liftA2 :: (a -> b -> c0) -> M1 i c f a -> M1 i c f b -> M1 i c f c0 # (>) :: M1 i c f a -> M1 i c f b -> M1 i c f b # (<*) :: M1 i c f a -> M1 i c f b -> M1 i c f a #
(Applicative f, Applicative g) => Applicative (f :.: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> (f :.: g) a # (<>) :: (f :.: g) (a -> b) -> (f :.: g) a -> (f :.: g) b # liftA2 :: (a -> b -> c) -> (f :.: g) a -> (f :.: g) b -> (f :.: g) c # (>) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) b # (<*) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) a #
(Applicative f, Applicative g) => Applicative (Compose f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods pure :: a -> Compose f g a # (<>) :: Compose f g (a -> b) -> Compose f g a -> Compose f g b # liftA2 :: (a -> b -> c) -> Compose f g a -> Compose f g b -> Compose f g c # (>) :: Compose f g a -> Compose f g b -> Compose f g b # (<*) :: Compose f g a -> Compose f g b -> Compose f g a #
(Monad f, Applicative f) => Applicative (WhenMatched f k x y)	Equivalent to `ReaderT k (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods pure :: a -> WhenMatched f k x y a # (<>) :: WhenMatched f k x y (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b # liftA2 :: (a -> b -> c) -> WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y c # (>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b # (<*) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y a #
(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods pure :: a -> RWST r w s m a # (<>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b # liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c # (>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b # (<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a #
(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods pure :: a -> RWST r w s m a # (<>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b # liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c # (>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b # (<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a #
Reifies s (ReifiedApplicative f) => Applicative (ReflectedApplicative f s)
Instance details Defined in Data.Reflection Methods pure :: a -> ReflectedApplicative f s a # (<>) :: ReflectedApplicative f s (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b # liftA2 :: (a -> b -> c) -> ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s c # (>) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s b # (<*) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s a #
Applicative (TakingWhile p f a b)
Instance details Defined in Control.Lens.Internal.Magma Methods pure :: a0 -> TakingWhile p f a b a0 # (<>) :: TakingWhile p f a b (a0 -> b0) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 # liftA2 :: (a0 -> b0 -> c) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b c # (>) :: TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b b0 # (<*) :: TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 #
Applicative (BazaarT p g a b)
Instance details Defined in Control.Lens.Internal.Bazaar Methods pure :: a0 -> BazaarT p g a b a0 # (<>) :: BazaarT p g a b (a0 -> b0) -> BazaarT p g a b a0 -> BazaarT p g a b b0 # liftA2 :: (a0 -> b0 -> c) -> BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b c # (>) :: BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b b0 # (<*) :: BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b a0 #
Monad state => Applicative (Builder collection mutCollection step state err)
Instance details Defined in Basement.MutableBuilder Methods pure :: a -> Builder collection mutCollection step state err a # (<>) :: Builder collection mutCollection step state err (a -> b) -> Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b # liftA2 :: (a -> b -> c) -> Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err c # (>) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err b # (<*) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err a #

class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where #

Functors representing data structures that can be traversed from left to right.

A definition of traverse must satisfy the following laws:

naturality: t . traverse f = traverse (t . f) for every applicative transformation t
identity: traverse Identity = Identity
composition: traverse (Compose . fmap g . f) = Compose . fmap (traverse g) . traverse f

A definition of sequenceA must satisfy the following laws:

naturality: t . sequenceA = sequenceA . fmap t for every applicative transformation t
identity: sequenceA . fmap Identity = Identity
composition: sequenceA . fmap Compose = Compose . fmap sequenceA . sequenceA

where an applicative transformation is a function

t :: (Applicative f, Applicative g) => f a -> g a

preserving the Applicative operations, i.e.

```
t (pure x) = pure x
```
```
t (x <*> y) = t x <*> t y
```

and the identity functor Identity and composition of functors Compose are defined as

  newtype Identity a = Identity a

  instance Functor Identity where
    fmap f (Identity x) = Identity (f x)

  instance Applicative Identity where
    pure x = Identity x
    Identity f <*> Identity x = Identity (f x)

  newtype Compose f g a = Compose (f (g a))

  instance (Functor f, Functor g) => Functor (Compose f g) where
    fmap f (Compose x) = Compose (fmap (fmap f) x)

  instance (Applicative f, Applicative g) => Applicative (Compose f g) where
    pure x = Compose (pure (pure x))
    Compose f <*> Compose x = Compose ((<*>) <$> f <*> x)

(The naturality law is implied by parametricity.)

Instances are similar to Functor, e.g. given a data type

data Tree a = Empty | Leaf a | Node (Tree a) a (Tree a)

a suitable instance would be

instance Traversable Tree where
   traverse f Empty = pure Empty
   traverse f (Leaf x) = Leaf <$> f x
   traverse f (Node l k r) = Node <$> traverse f l <*> f k <*> traverse f r

This is suitable even for abstract types, as the laws for <*> imply a form of associativity.

The superclass instances should satisfy the following:

In the Functor instance, fmap should be equivalent to traversal with the identity applicative functor (fmapDefault).
In the Foldable instance, foldMap should be equivalent to traversal with a constant applicative functor (foldMapDefault).

Minimal complete definition

traverse | sequenceA

Methods

traverse :: Applicative f => (a -> f b) -> t a -> f (t b) #

Map each element of a structure to an action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see traverse_.

Instances

Traversable []	Since: base-2.1
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> [a] -> f [b] # sequenceA :: Applicative f => [f a] -> f [a] # mapM :: Monad m => (a -> m b) -> [a] -> m [b] # sequence :: Monad m => [m a] -> m [a] #
Traversable Maybe	Since: base-2.1
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Maybe a -> f (Maybe b) # sequenceA :: Applicative f => Maybe (f a) -> f (Maybe a) # mapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b) # sequence :: Monad m => Maybe (m a) -> m (Maybe a) #
Traversable Par1	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Par1 a -> f (Par1 b) # sequenceA :: Applicative f => Par1 (f a) -> f (Par1 a) # mapM :: Monad m => (a -> m b) -> Par1 a -> m (Par1 b) # sequence :: Monad m => Par1 (m a) -> m (Par1 a) #
Traversable Complex	Since: base-4.9.0.0
Instance details Defined in Data.Complex Methods traverse :: Applicative f => (a -> f b) -> Complex a -> f (Complex b) # sequenceA :: Applicative f => Complex (f a) -> f (Complex a) # mapM :: Monad m => (a -> m b) -> Complex a -> m (Complex b) # sequence :: Monad m => Complex (m a) -> m (Complex a) #
Traversable Min	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> Min a -> f (Min b) # sequenceA :: Applicative f => Min (f a) -> f (Min a) # mapM :: Monad m => (a -> m b) -> Min a -> m (Min b) # sequence :: Monad m => Min (m a) -> m (Min a) #
Traversable Max	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> Max a -> f (Max b) # sequenceA :: Applicative f => Max (f a) -> f (Max a) # mapM :: Monad m => (a -> m b) -> Max a -> m (Max b) # sequence :: Monad m => Max (m a) -> m (Max a) #
Traversable First	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> First a -> f (First b) # sequenceA :: Applicative f => First (f a) -> f (First a) # mapM :: Monad m => (a -> m b) -> First a -> m (First b) # sequence :: Monad m => First (m a) -> m (First a) #
Traversable Last	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> Last a -> f (Last b) # sequenceA :: Applicative f => Last (f a) -> f (Last a) # mapM :: Monad m => (a -> m b) -> Last a -> m (Last b) # sequence :: Monad m => Last (m a) -> m (Last a) #
Traversable Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> Option a -> f (Option b) # sequenceA :: Applicative f => Option (f a) -> f (Option a) # mapM :: Monad m => (a -> m b) -> Option a -> m (Option b) # sequence :: Monad m => Option (m a) -> m (Option a) #
Traversable ZipList	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> ZipList a -> f (ZipList b) # sequenceA :: Applicative f => ZipList (f a) -> f (ZipList a) # mapM :: Monad m => (a -> m b) -> ZipList a -> m (ZipList b) # sequence :: Monad m => ZipList (m a) -> m (ZipList a) #
Traversable Identity	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Identity a -> f (Identity b) # sequenceA :: Applicative f => Identity (f a) -> f (Identity a) # mapM :: Monad m => (a -> m b) -> Identity a -> m (Identity b) # sequence :: Monad m => Identity (m a) -> m (Identity a) #
Traversable First	Since: base-4.8.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> First a -> f (First b) # sequenceA :: Applicative f => First (f a) -> f (First a) # mapM :: Monad m => (a -> m b) -> First a -> m (First b) # sequence :: Monad m => First (m a) -> m (First a) #
Traversable Last	Since: base-4.8.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Last a -> f (Last b) # sequenceA :: Applicative f => Last (f a) -> f (Last a) # mapM :: Monad m => (a -> m b) -> Last a -> m (Last b) # sequence :: Monad m => Last (m a) -> m (Last a) #
Traversable Dual	Since: base-4.8.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Dual a -> f (Dual b) # sequenceA :: Applicative f => Dual (f a) -> f (Dual a) # mapM :: Monad m => (a -> m b) -> Dual a -> m (Dual b) # sequence :: Monad m => Dual (m a) -> m (Dual a) #
Traversable Sum	Since: base-4.8.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Sum a -> f (Sum b) # sequenceA :: Applicative f => Sum (f a) -> f (Sum a) # mapM :: Monad m => (a -> m b) -> Sum a -> m (Sum b) # sequence :: Monad m => Sum (m a) -> m (Sum a) #
Traversable Product	Since: base-4.8.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Product a -> f (Product b) # sequenceA :: Applicative f => Product (f a) -> f (Product a) # mapM :: Monad m => (a -> m b) -> Product a -> m (Product b) # sequence :: Monad m => Product (m a) -> m (Product a) #
Traversable Down	Since: base-4.12.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Down a -> f (Down b) # sequenceA :: Applicative f => Down (f a) -> f (Down a) # mapM :: Monad m => (a -> m b) -> Down a -> m (Down b) # sequence :: Monad m => Down (m a) -> m (Down a) #
Traversable NonEmpty	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> NonEmpty a -> f (NonEmpty b) # sequenceA :: Applicative f => NonEmpty (f a) -> f (NonEmpty a) # mapM :: Monad m => (a -> m b) -> NonEmpty a -> m (NonEmpty b) # sequence :: Monad m => NonEmpty (m a) -> m (NonEmpty a) #
Traversable IntMap
Instance details Defined in Data.IntMap.Internal Methods traverse :: Applicative f => (a -> f b) -> IntMap a -> f (IntMap b) # sequenceA :: Applicative f => IntMap (f a) -> f (IntMap a) # mapM :: Monad m => (a -> m b) -> IntMap a -> m (IntMap b) # sequence :: Monad m => IntMap (m a) -> m (IntMap a) #
Traversable Tree
Instance details Defined in Data.Tree Methods traverse :: Applicative f => (a -> f b) -> Tree a -> f (Tree b) # sequenceA :: Applicative f => Tree (f a) -> f (Tree a) # mapM :: Monad m => (a -> m b) -> Tree a -> m (Tree b) # sequence :: Monad m => Tree (m a) -> m (Tree a) #
Traversable Seq
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> Seq a -> f (Seq b) # sequenceA :: Applicative f => Seq (f a) -> f (Seq a) # mapM :: Monad m => (a -> m b) -> Seq a -> m (Seq b) # sequence :: Monad m => Seq (m a) -> m (Seq a) #
Traversable FingerTree
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> FingerTree a -> f (FingerTree b) # sequenceA :: Applicative f => FingerTree (f a) -> f (FingerTree a) # mapM :: Monad m => (a -> m b) -> FingerTree a -> m (FingerTree b) # sequence :: Monad m => FingerTree (m a) -> m (FingerTree a) #
Traversable Digit
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> Digit a -> f (Digit b) # sequenceA :: Applicative f => Digit (f a) -> f (Digit a) # mapM :: Monad m => (a -> m b) -> Digit a -> m (Digit b) # sequence :: Monad m => Digit (m a) -> m (Digit a) #
Traversable Node
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> Node a -> f (Node b) # sequenceA :: Applicative f => Node (f a) -> f (Node a) # mapM :: Monad m => (a -> m b) -> Node a -> m (Node b) # sequence :: Monad m => Node (m a) -> m (Node a) #
Traversable Elem
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> Elem a -> f (Elem b) # sequenceA :: Applicative f => Elem (f a) -> f (Elem a) # mapM :: Monad m => (a -> m b) -> Elem a -> m (Elem b) # sequence :: Monad m => Elem (m a) -> m (Elem a) #
Traversable ViewL
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> ViewL a -> f (ViewL b) # sequenceA :: Applicative f => ViewL (f a) -> f (ViewL a) # mapM :: Monad m => (a -> m b) -> ViewL a -> m (ViewL b) # sequence :: Monad m => ViewL (m a) -> m (ViewL a) #
Traversable ViewR
Instance details Defined in Data.Sequence.Internal Methods traverse :: Applicative f => (a -> f b) -> ViewR a -> f (ViewR b) # sequenceA :: Applicative f => ViewR (f a) -> f (ViewR a) # mapM :: Monad m => (a -> m b) -> ViewR a -> m (ViewR b) # sequence :: Monad m => ViewR (m a) -> m (ViewR a) #
Traversable WithCallStack
Instance details Defined in Control.Monad.Log Methods traverse :: Applicative f => (a -> f b) -> WithCallStack a -> f (WithCallStack b) # sequenceA :: Applicative f => WithCallStack (f a) -> f (WithCallStack a) # mapM :: Monad m => (a -> m b) -> WithCallStack a -> m (WithCallStack b) # sequence :: Monad m => WithCallStack (m a) -> m (WithCallStack a) #
Traversable WithSeverity
Instance details Defined in Control.Monad.Log Methods traverse :: Applicative f => (a -> f b) -> WithSeverity a -> f (WithSeverity b) # sequenceA :: Applicative f => WithSeverity (f a) -> f (WithSeverity a) # mapM :: Monad m => (a -> m b) -> WithSeverity a -> m (WithSeverity b) # sequence :: Monad m => WithSeverity (m a) -> m (WithSeverity a) #
Traversable WithTimestamp
Instance details Defined in Control.Monad.Log Methods traverse :: Applicative f => (a -> f b) -> WithTimestamp a -> f (WithTimestamp b) # sequenceA :: Applicative f => WithTimestamp (f a) -> f (WithTimestamp a) # mapM :: Monad m => (a -> m b) -> WithTimestamp a -> m (WithTimestamp b) # sequence :: Monad m => WithTimestamp (m a) -> m (WithTimestamp a) #
Traversable SimpleDocStream
Instance details Defined in Data.Text.Prettyprint.Doc.Internal Methods traverse :: Applicative f => (a -> f b) -> SimpleDocStream a -> f (SimpleDocStream b) # sequenceA :: Applicative f => SimpleDocStream (f a) -> f (SimpleDocStream a) # mapM :: Monad m => (a -> m b) -> SimpleDocStream a -> m (SimpleDocStream b) # sequence :: Monad m => SimpleDocStream (m a) -> m (SimpleDocStream a) #
Traversable HistoriedResponse
Instance details Defined in Network.HTTP.Client Methods traverse :: Applicative f => (a -> f b) -> HistoriedResponse a -> f (HistoriedResponse b) # sequenceA :: Applicative f => HistoriedResponse (f a) -> f (HistoriedResponse a) # mapM :: Monad m => (a -> m b) -> HistoriedResponse a -> m (HistoriedResponse b) # sequence :: Monad m => HistoriedResponse (m a) -> m (HistoriedResponse a) #
Traversable Response
Instance details Defined in Network.HTTP.Client.Types Methods traverse :: Applicative f => (a -> f b) -> Response a -> f (Response b) # sequenceA :: Applicative f => Response (f a) -> f (Response a) # mapM :: Monad m => (a -> m b) -> Response a -> m (Response b) # sequence :: Monad m => Response (m a) -> m (Response a) #
Traversable Vector
Instance details Defined in Data.Vector Methods traverse :: Applicative f => (a -> f b) -> Vector a -> f (Vector b) # sequenceA :: Applicative f => Vector (f a) -> f (Vector a) # mapM :: Monad m => (a -> m b) -> Vector a -> m (Vector b) # sequence :: Monad m => Vector (m a) -> m (Vector a) #
Traversable Many
Instance details Defined in Text.Pandoc.Builder Methods traverse :: Applicative f => (a -> f b) -> Many a -> f (Many b) # sequenceA :: Applicative f => Many (f a) -> f (Many a) # mapM :: Monad m => (a -> m b) -> Many a -> m (Many b) # sequence :: Monad m => Many (m a) -> m (Many a) #
Traversable Array
Instance details Defined in Data.Primitive.Array Methods traverse :: Applicative f => (a -> f b) -> Array a -> f (Array b) # sequenceA :: Applicative f => Array (f a) -> f (Array a) # mapM :: Monad m => (a -> m b) -> Array a -> m (Array b) # sequence :: Monad m => Array (m a) -> m (Array a) #
Traversable SmallArray
Instance details Defined in Data.Primitive.SmallArray Methods traverse :: Applicative f => (a -> f b) -> SmallArray a -> f (SmallArray b) # sequenceA :: Applicative f => SmallArray (f a) -> f (SmallArray a) # mapM :: Monad m => (a -> m b) -> SmallArray a -> m (SmallArray b) # sequence :: Monad m => SmallArray (m a) -> m (SmallArray a) #
Traversable IResult
Instance details Defined in Data.Aeson.Types.Internal Methods traverse :: Applicative f => (a -> f b) -> IResult a -> f (IResult b) # sequenceA :: Applicative f => IResult (f a) -> f (IResult a) # mapM :: Monad m => (a -> m b) -> IResult a -> m (IResult b) # sequence :: Monad m => IResult (m a) -> m (IResult a) #
Traversable Result
Instance details Defined in Data.Aeson.Types.Internal Methods traverse :: Applicative f => (a -> f b) -> Result a -> f (Result b) # sequenceA :: Applicative f => Result (f a) -> f (Result a) # mapM :: Monad m => (a -> m b) -> Result a -> m (Result b) # sequence :: Monad m => Result (m a) -> m (Result a) #
Traversable Root
Instance details Defined in Numeric.RootFinding Methods traverse :: Applicative f => (a -> f b) -> Root a -> f (Root b) # sequenceA :: Applicative f => Root (f a) -> f (Root a) # mapM :: Monad m => (a -> m b) -> Root a -> m (Root b) # sequence :: Monad m => Root (m a) -> m (Root a) #
Traversable V2
Instance details Defined in Linear.V2 Methods traverse :: Applicative f => (a -> f b) -> V2 a -> f (V2 b) # sequenceA :: Applicative f => V2 (f a) -> f (V2 a) # mapM :: Monad m => (a -> m b) -> V2 a -> m (V2 b) # sequence :: Monad m => V2 (m a) -> m (V2 a) #
Traversable V3
Instance details Defined in Linear.V3 Methods traverse :: Applicative f => (a -> f b) -> V3 a -> f (V3 b) # sequenceA :: Applicative f => V3 (f a) -> f (V3 a) # mapM :: Monad m => (a -> m b) -> V3 a -> m (V3 b) # sequence :: Monad m => V3 (m a) -> m (V3 a) #
Traversable Interval
Instance details Defined in Numeric.Interval.Kaucher Methods traverse :: Applicative f => (a -> f b) -> Interval a -> f (Interval b) # sequenceA :: Applicative f => Interval (f a) -> f (Interval a) # mapM :: Monad m => (a -> m b) -> Interval a -> m (Interval b) # sequence :: Monad m => Interval (m a) -> m (Interval a) #
Traversable V4
Instance details Defined in Linear.V4 Methods traverse :: Applicative f => (a -> f b) -> V4 a -> f (V4 b) # sequenceA :: Applicative f => V4 (f a) -> f (V4 a) # mapM :: Monad m => (a -> m b) -> V4 a -> m (V4 b) # sequence :: Monad m => V4 (m a) -> m (V4 a) #
Traversable Recommend
Instance details Defined in Data.Monoid.Recommend Methods traverse :: Applicative f => (a -> f b) -> Recommend a -> f (Recommend b) # sequenceA :: Applicative f => Recommend (f a) -> f (Recommend a) # mapM :: Monad m => (a -> m b) -> Recommend a -> m (Recommend b) # sequence :: Monad m => Recommend (m a) -> m (Recommend a) #
Traversable V1
Instance details Defined in Linear.V1 Methods traverse :: Applicative f => (a -> f b) -> V1 a -> f (V1 b) # sequenceA :: Applicative f => V1 (f a) -> f (V1 a) # mapM :: Monad m => (a -> m b) -> V1 a -> m (V1 b) # sequence :: Monad m => V1 (m a) -> m (V1 a) #
Traversable Plucker
Instance details Defined in Linear.Plucker Methods traverse :: Applicative f => (a -> f b) -> Plucker a -> f (Plucker b) # sequenceA :: Applicative f => Plucker (f a) -> f (Plucker a) # mapM :: Monad m => (a -> m b) -> Plucker a -> m (Plucker b) # sequence :: Monad m => Plucker (m a) -> m (Plucker a) #
Traversable Quaternion
Instance details Defined in Linear.Quaternion Methods traverse :: Applicative f => (a -> f b) -> Quaternion a -> f (Quaternion b) # sequenceA :: Applicative f => Quaternion (f a) -> f (Quaternion a) # mapM :: Monad m => (a -> m b) -> Quaternion a -> m (Quaternion b) # sequence :: Monad m => Quaternion (m a) -> m (Quaternion a) #
Traversable V0
Instance details Defined in Linear.V0 Methods traverse :: Applicative f => (a -> f b) -> V0 a -> f (V0 b) # sequenceA :: Applicative f => V0 (f a) -> f (V0 a) # mapM :: Monad m => (a -> m b) -> V0 a -> m (V0 b) # sequence :: Monad m => V0 (m a) -> m (V0 a) #
Traversable (Either a)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a0 -> f b) -> Either a a0 -> f (Either a b) # sequenceA :: Applicative f => Either a (f a0) -> f (Either a a0) # mapM :: Monad m => (a0 -> m b) -> Either a a0 -> m (Either a b) # sequence :: Monad m => Either a (m a0) -> m (Either a a0) #
Traversable (V1 :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> V1 a -> f (V1 b) # sequenceA :: Applicative f => V1 (f a) -> f (V1 a) # mapM :: Monad m => (a -> m b) -> V1 a -> m (V1 b) # sequence :: Monad m => V1 (m a) -> m (V1 a) #
Traversable (U1 :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> U1 a -> f (U1 b) # sequenceA :: Applicative f => U1 (f a) -> f (U1 a) # mapM :: Monad m => (a -> m b) -> U1 a -> m (U1 b) # sequence :: Monad m => U1 (m a) -> m (U1 a) #
Traversable ((,) a)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a0 -> f b) -> (a, a0) -> f (a, b) # sequenceA :: Applicative f => (a, f a0) -> f (a, a0) # mapM :: Monad m => (a0 -> m b) -> (a, a0) -> m (a, b) # sequence :: Monad m => (a, m a0) -> m (a, a0) #
Ix i => Traversable (Array i)	Since: base-2.1
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Array i a -> f (Array i b) # sequenceA :: Applicative f => Array i (f a) -> f (Array i a) # mapM :: Monad m => (a -> m b) -> Array i a -> m (Array i b) # sequence :: Monad m => Array i (m a) -> m (Array i a) #
Traversable (Arg a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a0 -> f b) -> Arg a a0 -> f (Arg a b) # sequenceA :: Applicative f => Arg a (f a0) -> f (Arg a a0) # mapM :: Monad m => (a0 -> m b) -> Arg a a0 -> m (Arg a b) # sequence :: Monad m => Arg a (m a0) -> m (Arg a a0) #
Traversable (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Proxy a -> f (Proxy b) # sequenceA :: Applicative f => Proxy (f a) -> f (Proxy a) # mapM :: Monad m => (a -> m b) -> Proxy a -> m (Proxy b) # sequence :: Monad m => Proxy (m a) -> m (Proxy a) #
Traversable (Map k)
Instance details Defined in Data.Map.Internal Methods traverse :: Applicative f => (a -> f b) -> Map k a -> f (Map k b) # sequenceA :: Applicative f => Map k (f a) -> f (Map k a) # mapM :: Monad m => (a -> m b) -> Map k a -> m (Map k b) # sequence :: Monad m => Map k (m a) -> m (Map k a) #
Traversable f => Traversable (MaybeT f)
Instance details Defined in Control.Monad.Trans.Maybe Methods traverse :: Applicative f0 => (a -> f0 b) -> MaybeT f a -> f0 (MaybeT f b) # sequenceA :: Applicative f0 => MaybeT f (f0 a) -> f0 (MaybeT f a) # mapM :: Monad m => (a -> m b) -> MaybeT f a -> m (MaybeT f b) # sequence :: Monad m => MaybeT f (m a) -> m (MaybeT f a) #
Traversable f => Traversable (ListT f)
Instance details Defined in Control.Monad.Trans.List Methods traverse :: Applicative f0 => (a -> f0 b) -> ListT f a -> f0 (ListT f b) # sequenceA :: Applicative f0 => ListT f (f0 a) -> f0 (ListT f a) # mapM :: Monad m => (a -> m b) -> ListT f a -> m (ListT f b) # sequence :: Monad m => ListT f (m a) -> m (ListT f a) #
Traversable (DocWithInfo i) Source #
Instance details Defined in Knit.Effect.Docs Methods traverse :: Applicative f => (a -> f b) -> DocWithInfo i a -> f (DocWithInfo i b) # sequenceA :: Applicative f => DocWithInfo i (f a) -> f (DocWithInfo i a) # mapM :: Monad m => (a -> m b) -> DocWithInfo i a -> m (DocWithInfo i b) # sequence :: Monad m => DocWithInfo i (m a) -> m (DocWithInfo i a) #
Traversable (HashMap k)
Instance details Defined in Data.HashMap.Base Methods traverse :: Applicative f => (a -> f b) -> HashMap k a -> f (HashMap k b) # sequenceA :: Applicative f => HashMap k (f a) -> f (HashMap k a) # mapM :: Monad m => (a -> m b) -> HashMap k a -> m (HashMap k b) # sequence :: Monad m => HashMap k (m a) -> m (HashMap k a) #
Traversable f => Traversable (Point f)
Instance details Defined in Linear.Affine Methods traverse :: Applicative f0 => (a -> f0 b) -> Point f a -> f0 (Point f b) # sequenceA :: Applicative f0 => Point f (f0 a) -> f0 (Point f a) # mapM :: Monad m => (a -> m b) -> Point f a -> m (Point f b) # sequence :: Monad m => Point f (m a) -> m (Point f a) #
Traversable (Level i)
Instance details Defined in Control.Lens.Internal.Level Methods traverse :: Applicative f => (a -> f b) -> Level i a -> f (Level i b) # sequenceA :: Applicative f => Level i (f a) -> f (Level i a) # mapM :: Monad m => (a -> m b) -> Level i a -> m (Level i b) # sequence :: Monad m => Level i (m a) -> m (Level i a) #
Traversable f => Traversable (Cofree f)
Instance details Defined in Control.Comonad.Cofree Methods traverse :: Applicative f0 => (a -> f0 b) -> Cofree f a -> f0 (Cofree f b) # sequenceA :: Applicative f0 => Cofree f (f0 a) -> f0 (Cofree f a) # mapM :: Monad m => (a -> m b) -> Cofree f a -> m (Cofree f b) # sequence :: Monad m => Cofree f (m a) -> m (Cofree f a) #
Traversable f => Traversable (Free f)
Instance details Defined in Control.Monad.Free Methods traverse :: Applicative f0 => (a -> f0 b) -> Free f a -> f0 (Free f b) # sequenceA :: Applicative f0 => Free f (f0 a) -> f0 (Free f a) # mapM :: Monad m => (a -> m b) -> Free f a -> m (Free f b) # sequence :: Monad m => Free f (m a) -> m (Free f a) #
Traversable f => Traversable (Yoneda f)
Instance details Defined in Data.Functor.Yoneda Methods traverse :: Applicative f0 => (a -> f0 b) -> Yoneda f a -> f0 (Yoneda f b) # sequenceA :: Applicative f0 => Yoneda f (f0 a) -> f0 (Yoneda f a) # mapM :: Monad m => (a -> m b) -> Yoneda f a -> m (Yoneda f b) # sequence :: Monad m => Yoneda f (m a) -> m (Yoneda f a) #
Traversable f => Traversable (Rec1 f)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> Rec1 f a -> f0 (Rec1 f b) # sequenceA :: Applicative f0 => Rec1 f (f0 a) -> f0 (Rec1 f a) # mapM :: Monad m => (a -> m b) -> Rec1 f a -> m (Rec1 f b) # sequence :: Monad m => Rec1 f (m a) -> m (Rec1 f a) #
Traversable (URec Char :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec Char a -> f (URec Char b) # sequenceA :: Applicative f => URec Char (f a) -> f (URec Char a) # mapM :: Monad m => (a -> m b) -> URec Char a -> m (URec Char b) # sequence :: Monad m => URec Char (m a) -> m (URec Char a) #
Traversable (URec Double :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec Double a -> f (URec Double b) # sequenceA :: Applicative f => URec Double (f a) -> f (URec Double a) # mapM :: Monad m => (a -> m b) -> URec Double a -> m (URec Double b) # sequence :: Monad m => URec Double (m a) -> m (URec Double a) #
Traversable (URec Float :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec Float a -> f (URec Float b) # sequenceA :: Applicative f => URec Float (f a) -> f (URec Float a) # mapM :: Monad m => (a -> m b) -> URec Float a -> m (URec Float b) # sequence :: Monad m => URec Float (m a) -> m (URec Float a) #
Traversable (URec Int :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec Int a -> f (URec Int b) # sequenceA :: Applicative f => URec Int (f a) -> f (URec Int a) # mapM :: Monad m => (a -> m b) -> URec Int a -> m (URec Int b) # sequence :: Monad m => URec Int (m a) -> m (URec Int a) #
Traversable (URec Word :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec Word a -> f (URec Word b) # sequenceA :: Applicative f => URec Word (f a) -> f (URec Word a) # mapM :: Monad m => (a -> m b) -> URec Word a -> m (URec Word b) # sequence :: Monad m => URec Word (m a) -> m (URec Word a) #
Traversable (URec (Ptr ()) :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec (Ptr ()) a -> f (URec (Ptr ()) b) # sequenceA :: Applicative f => URec (Ptr ()) (f a) -> f (URec (Ptr ()) a) # mapM :: Monad m => (a -> m b) -> URec (Ptr ()) a -> m (URec (Ptr ()) b) # sequence :: Monad m => URec (Ptr ()) (m a) -> m (URec (Ptr ()) a) #
Traversable (Const m :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Const m a -> f (Const m b) # sequenceA :: Applicative f => Const m (f a) -> f (Const m a) # mapM :: Monad m0 => (a -> m0 b) -> Const m a -> m0 (Const m b) # sequence :: Monad m0 => Const m (m0 a) -> m0 (Const m a) #
Traversable f => Traversable (Ap f)	Since: base-4.12.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> Ap f a -> f0 (Ap f b) # sequenceA :: Applicative f0 => Ap f (f0 a) -> f0 (Ap f a) # mapM :: Monad m => (a -> m b) -> Ap f a -> m (Ap f b) # sequence :: Monad m => Ap f (m a) -> m (Ap f a) #
Traversable f => Traversable (Alt f)	Since: base-4.12.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> Alt f a -> f0 (Alt f b) # sequenceA :: Applicative f0 => Alt f (f0 a) -> f0 (Alt f a) # mapM :: Monad m => (a -> m b) -> Alt f a -> m (Alt f b) # sequence :: Monad m => Alt f (m a) -> m (Alt f a) #
Traversable f => Traversable (IdentityT f)
Instance details Defined in Control.Monad.Trans.Identity Methods traverse :: Applicative f0 => (a -> f0 b) -> IdentityT f a -> f0 (IdentityT f b) # sequenceA :: Applicative f0 => IdentityT f (f0 a) -> f0 (IdentityT f a) # mapM :: Monad m => (a -> m b) -> IdentityT f a -> m (IdentityT f b) # sequence :: Monad m => IdentityT f (m a) -> m (IdentityT f a) #
Traversable f => Traversable (ErrorT e f)
Instance details Defined in Control.Monad.Trans.Error Methods traverse :: Applicative f0 => (a -> f0 b) -> ErrorT e f a -> f0 (ErrorT e f b) # sequenceA :: Applicative f0 => ErrorT e f (f0 a) -> f0 (ErrorT e f a) # mapM :: Monad m => (a -> m b) -> ErrorT e f a -> m (ErrorT e f b) # sequence :: Monad m => ErrorT e f (m a) -> m (ErrorT e f a) #
Traversable f => Traversable (ExceptT e f)
Instance details Defined in Control.Monad.Trans.Except Methods traverse :: Applicative f0 => (a -> f0 b) -> ExceptT e f a -> f0 (ExceptT e f b) # sequenceA :: Applicative f0 => ExceptT e f (f0 a) -> f0 (ExceptT e f a) # mapM :: Monad m => (a -> m b) -> ExceptT e f a -> m (ExceptT e f b) # sequence :: Monad m => ExceptT e f (m a) -> m (ExceptT e f a) #
Traversable f => Traversable (WriterT w f)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods traverse :: Applicative f0 => (a -> f0 b) -> WriterT w f a -> f0 (WriterT w f b) # sequenceA :: Applicative f0 => WriterT w f (f0 a) -> f0 (WriterT w f a) # mapM :: Monad m => (a -> m b) -> WriterT w f a -> m (WriterT w f b) # sequence :: Monad m => WriterT w f (m a) -> m (WriterT w f a) #
Traversable f => Traversable (WriterT w f)
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods traverse :: Applicative f0 => (a -> f0 b) -> WriterT w f a -> f0 (WriterT w f b) # sequenceA :: Applicative f0 => WriterT w f (f0 a) -> f0 (WriterT w f a) # mapM :: Monad m => (a -> m b) -> WriterT w f a -> m (WriterT w f b) # sequence :: Monad m => WriterT w f (m a) -> m (WriterT w f a) #
Traversable f => Traversable (Reverse f)	Traverse from right to left.
Instance details Defined in Data.Functor.Reverse Methods traverse :: Applicative f0 => (a -> f0 b) -> Reverse f a -> f0 (Reverse f b) # sequenceA :: Applicative f0 => Reverse f (f0 a) -> f0 (Reverse f a) # mapM :: Monad m => (a -> m b) -> Reverse f a -> m (Reverse f b) # sequence :: Monad m => Reverse f (m a) -> m (Reverse f a) #
Traversable f => Traversable (Backwards f)	Derived instance.
Instance details Defined in Control.Applicative.Backwards Methods traverse :: Applicative f0 => (a -> f0 b) -> Backwards f a -> f0 (Backwards f b) # sequenceA :: Applicative f0 => Backwards f (f0 a) -> f0 (Backwards f a) # mapM :: Monad m => (a -> m b) -> Backwards f a -> m (Backwards f b) # sequence :: Monad m => Backwards f (m a) -> m (Backwards f a) #
(Monad m, Traversable m, Traversable f) => Traversable (FreeT f m)
Instance details Defined in Control.Monad.Trans.Free Methods traverse :: Applicative f0 => (a -> f0 b) -> FreeT f m a -> f0 (FreeT f m b) # sequenceA :: Applicative f0 => FreeT f m (f0 a) -> f0 (FreeT f m a) # mapM :: Monad m0 => (a -> m0 b) -> FreeT f m a -> m0 (FreeT f m b) # sequence :: Monad m0 => FreeT f m (m0 a) -> m0 (FreeT f m a) #
Traversable f => Traversable (FreeF f a)
Instance details Defined in Control.Monad.Trans.Free Methods traverse :: Applicative f0 => (a0 -> f0 b) -> FreeF f a a0 -> f0 (FreeF f a b) # sequenceA :: Applicative f0 => FreeF f a (f0 a0) -> f0 (FreeF f a a0) # mapM :: Monad m => (a0 -> m b) -> FreeF f a a0 -> m (FreeF f a b) # sequence :: Monad m => FreeF f a (m a0) -> m (FreeF f a a0) #
Bitraversable p => Traversable (Join p)
Instance details Defined in Data.Bifunctor.Join Methods traverse :: Applicative f => (a -> f b) -> Join p a -> f (Join p b) # sequenceA :: Applicative f => Join p (f a) -> f (Join p a) # mapM :: Monad m => (a -> m b) -> Join p a -> m (Join p b) # sequence :: Monad m => Join p (m a) -> m (Join p a) #
Traversable (Tagged s)
Instance details Defined in Data.Tagged Methods traverse :: Applicative f => (a -> f b) -> Tagged s a -> f (Tagged s b) # sequenceA :: Applicative f => Tagged s (f a) -> f (Tagged s a) # mapM :: Monad m => (a -> m b) -> Tagged s a -> m (Tagged s b) # sequence :: Monad m => Tagged s (m a) -> m (Tagged s a) #
Bitraversable p => Traversable (Fix p)
Instance details Defined in Data.Bifunctor.Fix Methods traverse :: Applicative f => (a -> f b) -> Fix p a -> f (Fix p b) # sequenceA :: Applicative f => Fix p (f a) -> f (Fix p a) # mapM :: Monad m => (a -> m b) -> Fix p a -> m (Fix p b) # sequence :: Monad m => Fix p (m a) -> m (Fix p a) #
(Traversable f, Traversable w) => Traversable (CofreeT f w)
Instance details Defined in Control.Comonad.Trans.Cofree Methods traverse :: Applicative f0 => (a -> f0 b) -> CofreeT f w a -> f0 (CofreeT f w b) # sequenceA :: Applicative f0 => CofreeT f w (f0 a) -> f0 (CofreeT f w a) # mapM :: Monad m => (a -> m b) -> CofreeT f w a -> m (CofreeT f w b) # sequence :: Monad m => CofreeT f w (m a) -> m (CofreeT f w a) #
Traversable f => Traversable (CofreeF f a)
Instance details Defined in Control.Comonad.Trans.Cofree Methods traverse :: Applicative f0 => (a0 -> f0 b) -> CofreeF f a a0 -> f0 (CofreeF f a b) # sequenceA :: Applicative f0 => CofreeF f a (f0 a0) -> f0 (CofreeF f a a0) # mapM :: Monad m => (a0 -> m b) -> CofreeF f a a0 -> m (CofreeF f a b) # sequence :: Monad m => CofreeF f a (m a0) -> m (CofreeF f a a0) #
Traversable (Forget r a)
Instance details Defined in Data.Profunctor.Types Methods traverse :: Applicative f => (a0 -> f b) -> Forget r a a0 -> f (Forget r a b) # sequenceA :: Applicative f => Forget r a (f a0) -> f (Forget r a a0) # mapM :: Monad m => (a0 -> m b) -> Forget r a a0 -> m (Forget r a b) # sequence :: Monad m => Forget r a (m a0) -> m (Forget r a a0) #
Traversable (V n)
Instance details Defined in Linear.V Methods traverse :: Applicative f => (a -> f b) -> V n a -> f (V n b) # sequenceA :: Applicative f => V n (f a) -> f (V n a) # mapM :: Monad m => (a -> m b) -> V n a -> m (V n b) # sequence :: Monad m => V n (m a) -> m (V n a) #
Traversable f => Traversable (AlongsideLeft f b)
Instance details Defined in Control.Lens.Internal.Getter Methods traverse :: Applicative f0 => (a -> f0 b0) -> AlongsideLeft f b a -> f0 (AlongsideLeft f b b0) # sequenceA :: Applicative f0 => AlongsideLeft f b (f0 a) -> f0 (AlongsideLeft f b a) # mapM :: Monad m => (a -> m b0) -> AlongsideLeft f b a -> m (AlongsideLeft f b b0) # sequence :: Monad m => AlongsideLeft f b (m a) -> m (AlongsideLeft f b a) #
Traversable f => Traversable (AlongsideRight f a)
Instance details Defined in Control.Lens.Internal.Getter Methods traverse :: Applicative f0 => (a0 -> f0 b) -> AlongsideRight f a a0 -> f0 (AlongsideRight f a b) # sequenceA :: Applicative f0 => AlongsideRight f a (f0 a0) -> f0 (AlongsideRight f a a0) # mapM :: Monad m => (a0 -> m b) -> AlongsideRight f a a0 -> m (AlongsideRight f a b) # sequence :: Monad m => AlongsideRight f a (m a0) -> m (AlongsideRight f a a0) #
Traversable (K1 i c :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> K1 i c a -> f (K1 i c b) # sequenceA :: Applicative f => K1 i c (f a) -> f (K1 i c a) # mapM :: Monad m => (a -> m b) -> K1 i c a -> m (K1 i c b) # sequence :: Monad m => K1 i c (m a) -> m (K1 i c a) #
(Traversable f, Traversable g) => Traversable (f :+: g)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) # sequenceA :: Applicative f0 => (f :+: g) (f0 a) -> f0 ((f :+: g) a) # mapM :: Monad m => (a -> m b) -> (f :+: g) a -> m ((f :+: g) b) # sequence :: Monad m => (f :+: g) (m a) -> m ((f :+: g) a) #
(Traversable f, Traversable g) => Traversable (f :*: g)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> (f :: g) a -> f0 ((f :: g) b) # sequenceA :: Applicative f0 => (f :: g) (f0 a) -> f0 ((f :: g) a) # mapM :: Monad m => (a -> m b) -> (f :: g) a -> m ((f :: g) b) # sequence :: Monad m => (f :: g) (m a) -> m ((f :: g) a) #
(Traversable f, Traversable g) => Traversable (Product f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods traverse :: Applicative f0 => (a -> f0 b) -> Product f g a -> f0 (Product f g b) # sequenceA :: Applicative f0 => Product f g (f0 a) -> f0 (Product f g a) # mapM :: Monad m => (a -> m b) -> Product f g a -> m (Product f g b) # sequence :: Monad m => Product f g (m a) -> m (Product f g a) #
Traversable (Magma i t b)
Instance details Defined in Control.Lens.Internal.Magma Methods traverse :: Applicative f => (a -> f b0) -> Magma i t b a -> f (Magma i t b b0) # sequenceA :: Applicative f => Magma i t b (f a) -> f (Magma i t b a) # mapM :: Monad m => (a -> m b0) -> Magma i t b a -> m (Magma i t b b0) # sequence :: Monad m => Magma i t b (m a) -> m (Magma i t b a) #
Traversable f => Traversable (M1 i c f)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> M1 i c f a -> f0 (M1 i c f b) # sequenceA :: Applicative f0 => M1 i c f (f0 a) -> f0 (M1 i c f a) # mapM :: Monad m => (a -> m b) -> M1 i c f a -> m (M1 i c f b) # sequence :: Monad m => M1 i c f (m a) -> m (M1 i c f a) #
(Traversable f, Traversable g) => Traversable (f :.: g)	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f0 => (a -> f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) # sequenceA :: Applicative f0 => (f :.: g) (f0 a) -> f0 ((f :.: g) a) # mapM :: Monad m => (a -> m b) -> (f :.: g) a -> m ((f :.: g) b) # sequence :: Monad m => (f :.: g) (m a) -> m ((f :.: g) a) #
(Traversable f, Traversable g) => Traversable (Compose f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods traverse :: Applicative f0 => (a -> f0 b) -> Compose f g a -> f0 (Compose f g b) # sequenceA :: Applicative f0 => Compose f g (f0 a) -> f0 (Compose f g a) # mapM :: Monad m => (a -> m b) -> Compose f g a -> m (Compose f g b) # sequence :: Monad m => Compose f g (m a) -> m (Compose f g a) #
Traversable (Clown f a :: Type -> Type)
Instance details Defined in Data.Bifunctor.Clown Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Clown f a a0 -> f0 (Clown f a b) # sequenceA :: Applicative f0 => Clown f a (f0 a0) -> f0 (Clown f a a0) # mapM :: Monad m => (a0 -> m b) -> Clown f a a0 -> m (Clown f a b) # sequence :: Monad m => Clown f a (m a0) -> m (Clown f a a0) #
Bitraversable p => Traversable (Flip p a)
Instance details Defined in Data.Bifunctor.Flip Methods traverse :: Applicative f => (a0 -> f b) -> Flip p a a0 -> f (Flip p a b) # sequenceA :: Applicative f => Flip p a (f a0) -> f (Flip p a a0) # mapM :: Monad m => (a0 -> m b) -> Flip p a a0 -> m (Flip p a b) # sequence :: Monad m => Flip p a (m a0) -> m (Flip p a a0) #
Traversable g => Traversable (Joker g a)
Instance details Defined in Data.Bifunctor.Joker Methods traverse :: Applicative f => (a0 -> f b) -> Joker g a a0 -> f (Joker g a b) # sequenceA :: Applicative f => Joker g a (f a0) -> f (Joker g a a0) # mapM :: Monad m => (a0 -> m b) -> Joker g a a0 -> m (Joker g a b) # sequence :: Monad m => Joker g a (m a0) -> m (Joker g a a0) #
Bitraversable p => Traversable (WrappedBifunctor p a)
Instance details Defined in Data.Bifunctor.Wrapped Methods traverse :: Applicative f => (a0 -> f b) -> WrappedBifunctor p a a0 -> f (WrappedBifunctor p a b) # sequenceA :: Applicative f => WrappedBifunctor p a (f a0) -> f (WrappedBifunctor p a a0) # mapM :: Monad m => (a0 -> m b) -> WrappedBifunctor p a a0 -> m (WrappedBifunctor p a b) # sequence :: Monad m => WrappedBifunctor p a (m a0) -> m (WrappedBifunctor p a a0) #
(Traversable f, Bitraversable p) => Traversable (Tannen f p a)
Instance details Defined in Data.Bifunctor.Tannen Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Tannen f p a a0 -> f0 (Tannen f p a b) # sequenceA :: Applicative f0 => Tannen f p a (f0 a0) -> f0 (Tannen f p a a0) # mapM :: Monad m => (a0 -> m b) -> Tannen f p a a0 -> m (Tannen f p a b) # sequence :: Monad m => Tannen f p a (m a0) -> m (Tannen f p a a0) #
(Bitraversable p, Traversable g) => Traversable (Biff p f g a)
Instance details Defined in Data.Bifunctor.Biff Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Biff p f g a a0 -> f0 (Biff p f g a b) # sequenceA :: Applicative f0 => Biff p f g a (f0 a0) -> f0 (Biff p f g a a0) # mapM :: Monad m => (a0 -> m b) -> Biff p f g a a0 -> m (Biff p f g a b) # sequence :: Monad m => Biff p f g a (m a0) -> m (Biff p f g a a0) #

class Semigroup a where #

The class of semigroups (types with an associative binary operation).

Instances should satisfy the associativity law:

```
x <> (y <> z) = (x <> y) <> z
```

Since: base-4.9.0.0

Minimal complete definition

(<>)

Methods

(<>) :: a -> a -> a infixr 6 #

An associative operation.

sconcat :: NonEmpty a -> a #

Reduce a non-empty list with <>

The default definition should be sufficient, but this can be overridden for efficiency.

stimes :: Integral b => b -> a -> a #

Repeat a value n times.

Given that this works on a Semigroup it is allowed to fail if you request 0 or fewer repetitions, and the default definition will do so.

By making this a member of the class, idempotent semigroups and monoids can upgrade this to execute in O(1) by picking stimes = stimesIdempotent or stimes = stimesIdempotentMonoid respectively.

Instances

Semigroup Ordering	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: Ordering -> Ordering -> Ordering # sconcat :: NonEmpty Ordering -> Ordering # stimes :: Integral b => b -> Ordering -> Ordering #
Semigroup ()	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: () -> () -> () # sconcat :: NonEmpty () -> () # stimes :: Integral b => b -> () -> () #
Semigroup Void	Since: base-4.9.0.0
Instance details Defined in Data.Void Methods (<>) :: Void -> Void -> Void # sconcat :: NonEmpty Void -> Void # stimes :: Integral b => b -> Void -> Void #
Semigroup All	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: All -> All -> All # sconcat :: NonEmpty All -> All # stimes :: Integral b => b -> All -> All #
Semigroup Any	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Any -> Any -> Any # sconcat :: NonEmpty Any -> Any # stimes :: Integral b => b -> Any -> Any #
Semigroup ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString #
Semigroup ByteString
Instance details Defined in Data.ByteString.Internal Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString #
Semigroup IntSet	Since: containers-0.5.7
Instance details Defined in Data.IntSet.Internal Methods (<>) :: IntSet -> IntSet -> IntSet # sconcat :: NonEmpty IntSet -> IntSet # stimes :: Integral b => b -> IntSet -> IntSet #
Semigroup Doc
Instance details Defined in Text.PrettyPrint.HughesPJ Methods (<>) :: Doc -> Doc -> Doc # sconcat :: NonEmpty Doc -> Doc # stimes :: Integral b => b -> Doc -> Doc #
Semigroup Builder
Instance details Defined in Data.Text.Internal.Builder Methods (<>) :: Builder -> Builder -> Builder # sconcat :: NonEmpty Builder -> Builder # stimes :: Integral b => b -> Builder -> Builder #
Semigroup Attribute
Instance details Defined in Text.Blaze.Internal Methods (<>) :: Attribute -> Attribute -> Attribute # sconcat :: NonEmpty Attribute -> Attribute # stimes :: Integral b => b -> Attribute -> Attribute #
Semigroup AttributeValue
Instance details Defined in Text.Blaze.Internal Methods (<>) :: AttributeValue -> AttributeValue -> AttributeValue # sconcat :: NonEmpty AttributeValue -> AttributeValue # stimes :: Integral b => b -> AttributeValue -> AttributeValue #
Semigroup ChoiceString
Instance details Defined in Text.Blaze.Internal Methods (<>) :: ChoiceString -> ChoiceString -> ChoiceString # sconcat :: NonEmpty ChoiceString -> ChoiceString # stimes :: Integral b => b -> ChoiceString -> ChoiceString #
Semigroup FileTree
Instance details Defined in Text.Pandoc.Class Methods (<>) :: FileTree -> FileTree -> FileTree # sconcat :: NonEmpty FileTree -> FileTree # stimes :: Integral b => b -> FileTree -> FileTree #
Semigroup Extensions
Instance details Defined in Text.Pandoc.Extensions Methods (<>) :: Extensions -> Extensions -> Extensions # sconcat :: NonEmpty Extensions -> Extensions # stimes :: Integral b => b -> Extensions -> Extensions #
Semigroup Translations
Instance details Defined in Text.Pandoc.Translations Methods (<>) :: Translations -> Translations -> Translations # sconcat :: NonEmpty Translations -> Translations # stimes :: Integral b => b -> Translations -> Translations #
Semigroup Meta
Instance details Defined in Text.Pandoc.Definition Methods (<>) :: Meta -> Meta -> Meta # sconcat :: NonEmpty Meta -> Meta # stimes :: Integral b => b -> Meta -> Meta #
Semigroup Pandoc
Instance details Defined in Text.Pandoc.Definition Methods (<>) :: Pandoc -> Pandoc -> Pandoc # sconcat :: NonEmpty Pandoc -> Pandoc # stimes :: Integral b => b -> Pandoc -> Pandoc #
Semigroup CookieJar
Instance details Defined in Network.HTTP.Client.Types Methods (<>) :: CookieJar -> CookieJar -> CookieJar # sconcat :: NonEmpty CookieJar -> CookieJar # stimes :: Integral b => b -> CookieJar -> CookieJar #
Semigroup RequestBody
Instance details Defined in Network.HTTP.Client.Types Methods (<>) :: RequestBody -> RequestBody -> RequestBody # sconcat :: NonEmpty RequestBody -> RequestBody # stimes :: Integral b => b -> RequestBody -> RequestBody #
Semigroup More
Instance details Defined in Data.Attoparsec.Internal.Types Methods (<>) :: More -> More -> More # sconcat :: NonEmpty More -> More # stimes :: Integral b => b -> More -> More #
Semigroup String
Instance details Defined in Basement.UTF8.Base Methods (<>) :: String -> String -> String # sconcat :: NonEmpty String -> String # stimes :: Integral b => b -> String -> String #
Semigroup Inlines
Instance details Defined in Text.Pandoc.Builder Methods (<>) :: Inlines -> Inlines -> Inlines # sconcat :: NonEmpty Inlines -> Inlines # stimes :: Integral b => b -> Inlines -> Inlines #
Semigroup ByteArray
Instance details Defined in Data.Primitive.ByteArray Methods (<>) :: ByteArray -> ByteArray -> ByteArray # sconcat :: NonEmpty ByteArray -> ByteArray # stimes :: Integral b => b -> ByteArray -> ByteArray #
Semigroup MimeBundle
Instance details Defined in Data.Ipynb Methods (<>) :: MimeBundle -> MimeBundle -> MimeBundle # sconcat :: NonEmpty MimeBundle -> MimeBundle # stimes :: Integral b => b -> MimeBundle -> MimeBundle #
Semigroup Source
Instance details Defined in Data.Ipynb Methods (<>) :: Source -> Source -> Source # sconcat :: NonEmpty Source -> Source # stimes :: Integral b => b -> Source -> Source #
Semigroup MediaBag
Instance details Defined in Text.Pandoc.MediaBag Methods (<>) :: MediaBag -> MediaBag -> MediaBag # sconcat :: NonEmpty MediaBag -> MediaBag # stimes :: Integral b => b -> MediaBag -> MediaBag #
Semigroup PandocWithRequirements Source #
Instance details Defined in Knit.Effect.Pandoc Methods (<>) :: PandocWithRequirements -> PandocWithRequirements -> PandocWithRequirements # sconcat :: NonEmpty PandocWithRequirements -> PandocWithRequirements # stimes :: Integral b => b -> PandocWithRequirements -> PandocWithRequirements #
Semigroup Cell
Instance details Defined in Text.Blaze.Colonnade Methods (<>) :: Cell -> Cell -> Cell # sconcat :: NonEmpty Cell -> Cell # stimes :: Integral b => b -> Cell -> Cell #
Semigroup Name
Instance details Defined in Diagrams.Core.Names Methods (<>) :: Name -> Name -> Name # sconcat :: NonEmpty Name -> Name # stimes :: Integral b => b -> Name -> Name #
Semigroup FillOpacity
Instance details Defined in Diagrams.Attributes Methods (<>) :: FillOpacity -> FillOpacity -> FillOpacity # sconcat :: NonEmpty FillOpacity -> FillOpacity # stimes :: Integral b => b -> FillOpacity -> FillOpacity #
Semigroup LineCap
Instance details Defined in Diagrams.Attributes Methods (<>) :: LineCap -> LineCap -> LineCap # sconcat :: NonEmpty LineCap -> LineCap # stimes :: Integral b => b -> LineCap -> LineCap #
Semigroup LineJoin
Instance details Defined in Diagrams.Attributes Methods (<>) :: LineJoin -> LineJoin -> LineJoin # sconcat :: NonEmpty LineJoin -> LineJoin # stimes :: Integral b => b -> LineJoin -> LineJoin #
Semigroup LineMiterLimit
Instance details Defined in Diagrams.Attributes Methods (<>) :: LineMiterLimit -> LineMiterLimit -> LineMiterLimit # sconcat :: NonEmpty LineMiterLimit -> LineMiterLimit # stimes :: Integral b => b -> LineMiterLimit -> LineMiterLimit #
Semigroup Opacity
Instance details Defined in Diagrams.Attributes Methods (<>) :: Opacity -> Opacity -> Opacity # sconcat :: NonEmpty Opacity -> Opacity # stimes :: Integral b => b -> Opacity -> Opacity #
Semigroup StrokeOpacity
Instance details Defined in Diagrams.Attributes Methods (<>) :: StrokeOpacity -> StrokeOpacity -> StrokeOpacity # sconcat :: NonEmpty StrokeOpacity -> StrokeOpacity # stimes :: Integral b => b -> StrokeOpacity -> StrokeOpacity #
Semigroup SegCount
Instance details Defined in Diagrams.Segment Methods (<>) :: SegCount -> SegCount -> SegCount # sconcat :: NonEmpty SegCount -> SegCount # stimes :: Integral b => b -> SegCount -> SegCount #
Semigroup Ambient
Instance details Defined in Diagrams.ThreeD.Attributes Methods (<>) :: Ambient -> Ambient -> Ambient # sconcat :: NonEmpty Ambient -> Ambient # stimes :: Integral b => b -> Ambient -> Ambient #
Semigroup Diffuse
Instance details Defined in Diagrams.ThreeD.Attributes Methods (<>) :: Diffuse -> Diffuse -> Diffuse # sconcat :: NonEmpty Diffuse -> Diffuse # stimes :: Integral b => b -> Diffuse -> Diffuse #
Semigroup Highlight
Instance details Defined in Diagrams.ThreeD.Attributes Methods (<>) :: Highlight -> Highlight -> Highlight # sconcat :: NonEmpty Highlight -> Highlight # stimes :: Integral b => b -> Highlight -> Highlight #
Semigroup SurfaceColor
Instance details Defined in Diagrams.ThreeD.Attributes Methods (<>) :: SurfaceColor -> SurfaceColor -> SurfaceColor # sconcat :: NonEmpty SurfaceColor -> SurfaceColor # stimes :: Integral b => b -> SurfaceColor -> SurfaceColor #
Semigroup FillRule
Instance details Defined in Diagrams.TwoD.Path Methods (<>) :: FillRule -> FillRule -> FillRule # sconcat :: NonEmpty FillRule -> FillRule # stimes :: Integral b => b -> FillRule -> FillRule #
Semigroup Element
Instance details Defined in Graphics.Svg.Core Methods (<>) :: Element -> Element -> Element # sconcat :: NonEmpty Element -> Element # stimes :: Integral b => b -> Element -> Element #
Semigroup Crossings
Instance details Defined in Diagrams.TwoD.Path Methods (<>) :: Crossings -> Crossings -> Crossings # sconcat :: NonEmpty Crossings -> Crossings # stimes :: Integral b => b -> Crossings -> Crossings #
Semigroup Font
Instance details Defined in Diagrams.TwoD.Text Methods (<>) :: Font -> Font -> Font # sconcat :: NonEmpty Font -> Font # stimes :: Integral b => b -> Font -> Font #
Semigroup FontSlant
Instance details Defined in Diagrams.TwoD.Text Methods (<>) :: FontSlant -> FontSlant -> FontSlant # sconcat :: NonEmpty FontSlant -> FontSlant # stimes :: Integral b => b -> FontSlant -> FontSlant #
Semigroup FontWeight
Instance details Defined in Diagrams.TwoD.Text Methods (<>) :: FontWeight -> FontWeight -> FontWeight # sconcat :: NonEmpty FontWeight -> FontWeight # stimes :: Integral b => b -> FontWeight -> FontWeight #
Semigroup [a]	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: [a] -> [a] -> [a] # sconcat :: NonEmpty [a] -> [a] # stimes :: Integral b => b -> [a] -> [a] #
Semigroup a => Semigroup (Maybe a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: Maybe a -> Maybe a -> Maybe a # sconcat :: NonEmpty (Maybe a) -> Maybe a # stimes :: Integral b => b -> Maybe a -> Maybe a #
Semigroup a => Semigroup (IO a)	Since: base-4.10.0.0
Instance details Defined in GHC.Base Methods (<>) :: IO a -> IO a -> IO a # sconcat :: NonEmpty (IO a) -> IO a # stimes :: Integral b => b -> IO a -> IO a #
Semigroup p => Semigroup (Par1 p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: Par1 p -> Par1 p -> Par1 p # sconcat :: NonEmpty (Par1 p) -> Par1 p # stimes :: Integral b => b -> Par1 p -> Par1 p #
Semigroup (Predicate a)
Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Predicate a -> Predicate a -> Predicate a # sconcat :: NonEmpty (Predicate a) -> Predicate a # stimes :: Integral b => b -> Predicate a -> Predicate a #
Semigroup (Comparison a)
Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Comparison a -> Comparison a -> Comparison a # sconcat :: NonEmpty (Comparison a) -> Comparison a # stimes :: Integral b => b -> Comparison a -> Comparison a #
Semigroup (Equivalence a)
Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Equivalence a -> Equivalence a -> Equivalence a # sconcat :: NonEmpty (Equivalence a) -> Equivalence a # stimes :: Integral b => b -> Equivalence a -> Equivalence a #
Ord a => Semigroup (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Min a -> Min a -> Min a # sconcat :: NonEmpty (Min a) -> Min a # stimes :: Integral b => b -> Min a -> Min a #
Ord a => Semigroup (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Max a -> Max a -> Max a # sconcat :: NonEmpty (Max a) -> Max a # stimes :: Integral b => b -> Max a -> Max a #
Semigroup (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: First a -> First a -> First a # sconcat :: NonEmpty (First a) -> First a # stimes :: Integral b => b -> First a -> First a #
Semigroup (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Last a -> Last a -> Last a # sconcat :: NonEmpty (Last a) -> Last a # stimes :: Integral b => b -> Last a -> Last a #
Monoid m => Semigroup (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # sconcat :: NonEmpty (WrappedMonoid m) -> WrappedMonoid m # stimes :: Integral b => b -> WrappedMonoid m -> WrappedMonoid m #
Semigroup a => Semigroup (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Option a -> Option a -> Option a # sconcat :: NonEmpty (Option a) -> Option a # stimes :: Integral b => b -> Option a -> Option a #
Semigroup a => Semigroup (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods (<>) :: Identity a -> Identity a -> Identity a # sconcat :: NonEmpty (Identity a) -> Identity a # stimes :: Integral b => b -> Identity a -> Identity a #
Semigroup (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Monoid Methods (<>) :: First a -> First a -> First a # sconcat :: NonEmpty (First a) -> First a # stimes :: Integral b => b -> First a -> First a #
Semigroup (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Monoid Methods (<>) :: Last a -> Last a -> Last a # sconcat :: NonEmpty (Last a) -> Last a # stimes :: Integral b => b -> Last a -> Last a #
Semigroup a => Semigroup (Dual a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Dual a -> Dual a -> Dual a # sconcat :: NonEmpty (Dual a) -> Dual a # stimes :: Integral b => b -> Dual a -> Dual a #
Semigroup (Endo a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Endo a -> Endo a -> Endo a # sconcat :: NonEmpty (Endo a) -> Endo a # stimes :: Integral b => b -> Endo a -> Endo a #
Num a => Semigroup (Sum a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Sum a -> Sum a -> Sum a # sconcat :: NonEmpty (Sum a) -> Sum a # stimes :: Integral b => b -> Sum a -> Sum a #
Num a => Semigroup (Product a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Product a -> Product a -> Product a # sconcat :: NonEmpty (Product a) -> Product a # stimes :: Integral b => b -> Product a -> Product a #
Semigroup a => Semigroup (Down a)	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods (<>) :: Down a -> Down a -> Down a # sconcat :: NonEmpty (Down a) -> Down a # stimes :: Integral b => b -> Down a -> Down a #
Semigroup (NonEmpty a)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: NonEmpty a -> NonEmpty a -> NonEmpty a # sconcat :: NonEmpty (NonEmpty a) -> NonEmpty a # stimes :: Integral b => b -> NonEmpty a -> NonEmpty a #
Semigroup (IntMap a)	Since: containers-0.5.7
Instance details Defined in Data.IntMap.Internal Methods (<>) :: IntMap a -> IntMap a -> IntMap a # sconcat :: NonEmpty (IntMap a) -> IntMap a # stimes :: Integral b => b -> IntMap a -> IntMap a #
Semigroup (Seq a)	Since: containers-0.5.7
Instance details Defined in Data.Sequence.Internal Methods (<>) :: Seq a -> Seq a -> Seq a # sconcat :: NonEmpty (Seq a) -> Seq a # stimes :: Integral b => b -> Seq a -> Seq a #
Ord a => Semigroup (Set a)	Since: containers-0.5.7
Instance details Defined in Data.Set.Internal Methods (<>) :: Set a -> Set a -> Set a # sconcat :: NonEmpty (Set a) -> Set a # stimes :: Integral b => b -> Set a -> Set a #
Semigroup (Doc a)
Instance details Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (<>) :: Doc a -> Doc a -> Doc a # sconcat :: NonEmpty (Doc a) -> Doc a # stimes :: Integral b => b -> Doc a -> Doc a #
(Hashable a, Eq a) => Semigroup (HashSet a)
Instance details Defined in Data.HashSet.Base Methods (<>) :: HashSet a -> HashSet a -> HashSet a # sconcat :: NonEmpty (HashSet a) -> HashSet a # stimes :: Integral b => b -> HashSet a -> HashSet a #
Monoid a => Semigroup (MarkupM a)
Instance details Defined in Text.Blaze.Internal Methods (<>) :: MarkupM a -> MarkupM a -> MarkupM a # sconcat :: NonEmpty (MarkupM a) -> MarkupM a # stimes :: Integral b => b -> MarkupM a -> MarkupM a #
Applicative m => Semigroup (Ap m)
Instance details Defined in Control.Monad.Log Methods (<>) :: Ap m -> Ap m -> Ap m # sconcat :: NonEmpty (Ap m) -> Ap m # stimes :: Integral b => b -> Ap m -> Ap m #
Semigroup (Doc ann)
Instance details Defined in Data.Text.Prettyprint.Doc.Internal Methods (<>) :: Doc ann -> Doc ann -> Doc ann # sconcat :: NonEmpty (Doc ann) -> Doc ann # stimes :: Integral b => b -> Doc ann -> Doc ann #
Semigroup s => Semigroup (CI s)
Instance details Defined in Data.CaseInsensitive.Internal Methods (<>) :: CI s -> CI s -> CI s # sconcat :: NonEmpty (CI s) -> CI s # stimes :: Integral b => b -> CI s -> CI s #
Semigroup (DList a)
Instance details Defined in Data.DList Methods (<>) :: DList a -> DList a -> DList a # sconcat :: NonEmpty (DList a) -> DList a # stimes :: Integral b => b -> DList a -> DList a #
Num a => Semigroup (AlphaColour a)
Instance details Defined in Data.Colour.Internal Methods (<>) :: AlphaColour a -> AlphaColour a -> AlphaColour a # sconcat :: NonEmpty (AlphaColour a) -> AlphaColour a # stimes :: Integral b => b -> AlphaColour a -> AlphaColour a #
Num a => Semigroup (Colour a)
Instance details Defined in Data.Colour.Internal Methods (<>) :: Colour a -> Colour a -> Colour a # sconcat :: NonEmpty (Colour a) -> Colour a # stimes :: Integral b => b -> Colour a -> Colour a #
PrimType ty => Semigroup (UArray ty)
Instance details Defined in Basement.UArray.Base Methods (<>) :: UArray ty -> UArray ty -> UArray ty # sconcat :: NonEmpty (UArray ty) -> UArray ty # stimes :: Integral b => b -> UArray ty -> UArray ty #
PrimType ty => Semigroup (Block ty)
Instance details Defined in Basement.Block.Base Methods (<>) :: Block ty -> Block ty -> Block ty # sconcat :: NonEmpty (Block ty) -> Block ty # stimes :: Integral b => b -> Block ty -> Block ty #
Semigroup (CountOf ty)
Instance details Defined in Basement.Types.OffsetSize Methods (<>) :: CountOf ty -> CountOf ty -> CountOf ty # sconcat :: NonEmpty (CountOf ty) -> CountOf ty # stimes :: Integral b => b -> CountOf ty -> CountOf ty #
Semigroup (Parser a)
Instance details Defined in Data.Aeson.Types.Internal Methods (<>) :: Parser a -> Parser a -> Parser a # sconcat :: NonEmpty (Parser a) -> Parser a # stimes :: Integral b => b -> Parser a -> Parser a #
Semigroup (Vector a)
Instance details Defined in Data.Vector Methods (<>) :: Vector a -> Vector a -> Vector a # sconcat :: NonEmpty (Vector a) -> Vector a # stimes :: Integral b => b -> Vector a -> Vector a #
Semigroup (Many Block)
Instance details Defined in Text.Pandoc.Builder Methods (<>) :: Many Block -> Many Block -> Many Block # sconcat :: NonEmpty (Many Block) -> Many Block # stimes :: Integral b => b -> Many Block -> Many Block #
Semigroup (Array a)
Instance details Defined in Data.Primitive.Array Methods (<>) :: Array a -> Array a -> Array a # sconcat :: NonEmpty (Array a) -> Array a # stimes :: Integral b => b -> Array a -> Array a #
Semigroup (PrimArray a)
Instance details Defined in Data.Primitive.PrimArray Methods (<>) :: PrimArray a -> PrimArray a -> PrimArray a # sconcat :: NonEmpty (PrimArray a) -> PrimArray a # stimes :: Integral b => b -> PrimArray a -> PrimArray a #
Semigroup (SmallArray a)
Instance details Defined in Data.Primitive.SmallArray Methods (<>) :: SmallArray a -> SmallArray a -> SmallArray a # sconcat :: NonEmpty (SmallArray a) -> SmallArray a # stimes :: Integral b => b -> SmallArray a -> SmallArray a #
Semigroup (Notebook a)
Instance details Defined in Data.Ipynb Methods (<>) :: Notebook a -> Notebook a -> Notebook a # sconcat :: NonEmpty (Notebook a) -> Notebook a # stimes :: Integral b => b -> Notebook a -> Notebook a #
Semigroup (IResult a)
Instance details Defined in Data.Aeson.Types.Internal Methods (<>) :: IResult a -> IResult a -> IResult a # sconcat :: NonEmpty (IResult a) -> IResult a # stimes :: Integral b => b -> IResult a -> IResult a #
Semigroup (Result a)
Instance details Defined in Data.Aeson.Types.Internal Methods (<>) :: Result a -> Result a -> Result a # sconcat :: NonEmpty (Result a) -> Result a # stimes :: Integral b => b -> Result a -> Result a #
Prim a => Semigroup (Vector a)
Instance details Defined in Data.Vector.Primitive Methods (<>) :: Vector a -> Vector a -> Vector a # sconcat :: NonEmpty (Vector a) -> Vector a # stimes :: Integral b => b -> Vector a -> Vector a #
Storable a => Semigroup (Vector a)
Instance details Defined in Data.Vector.Storable Methods (<>) :: Vector a -> Vector a -> Vector a # sconcat :: NonEmpty (Vector a) -> Vector a # stimes :: Integral b => b -> Vector a -> Vector a #
Semigroup (MergeSet a)
Instance details Defined in Data.Set.Internal Methods (<>) :: MergeSet a -> MergeSet a -> MergeSet a # sconcat :: NonEmpty (MergeSet a) -> MergeSet a # stimes :: Integral b => b -> MergeSet a -> MergeSet a #
Semigroup a => Semigroup (Active a)
Instance details Defined in Data.Active Methods (<>) :: Active a -> Active a -> Active a # sconcat :: NonEmpty (Active a) -> Active a # stimes :: Integral b => b -> Active a -> Active a #
Num n => Semigroup (Duration n)
Instance details Defined in Data.Active Methods (<>) :: Duration n -> Duration n -> Duration n # sconcat :: NonEmpty (Duration n) -> Duration n # stimes :: Integral b => b -> Duration n -> Duration n #
Semigroup a => Semigroup (Dynamic a)
Instance details Defined in Data.Active Methods (<>) :: Dynamic a -> Dynamic a -> Dynamic a # sconcat :: NonEmpty (Dynamic a) -> Dynamic a # stimes :: Integral b => b -> Dynamic a -> Dynamic a #
Ord n => Semigroup (Era n)
Instance details Defined in Data.Active Methods (<>) :: Era n -> Era n -> Era n # sconcat :: NonEmpty (Era n) -> Era n # stimes :: Integral b => b -> Era n -> Era n #
Ord a => Semigroup (SortedList a)
Instance details Defined in Diagrams.Core.Trace Methods (<>) :: SortedList a -> SortedList a -> SortedList a # sconcat :: NonEmpty (SortedList a) -> SortedList a # stimes :: Integral b => b -> SortedList a -> SortedList a #
Semigroup t => Semigroup (TransInv t)
Instance details Defined in Diagrams.Core.Transform Methods (<>) :: TransInv t -> TransInv t -> TransInv t # sconcat :: NonEmpty (TransInv t) -> TransInv t # stimes :: Integral b => b -> TransInv t -> TransInv t #
Num n => Semigroup (Angle n)
Instance details Defined in Diagrams.Angle Methods (<>) :: Angle n -> Angle n -> Angle n # sconcat :: NonEmpty (Angle n) -> Angle n # stimes :: Integral b => b -> Angle n -> Angle n #
Semigroup (Dashing n)
Instance details Defined in Diagrams.Attributes Methods (<>) :: Dashing n -> Dashing n -> Dashing n # sconcat :: NonEmpty (Dashing n) -> Dashing n # stimes :: Integral b => b -> Dashing n -> Dashing n #
Semigroup (LineWidth n)
Instance details Defined in Diagrams.Attributes Methods (<>) :: LineWidth n -> LineWidth n -> LineWidth n # sconcat :: NonEmpty (LineWidth n) -> LineWidth n # stimes :: Integral b => b -> LineWidth n -> LineWidth n #
(Num n, Ord n) => Semigroup (ArcLength n)
Instance details Defined in Diagrams.Segment Methods (<>) :: ArcLength n -> ArcLength n -> ArcLength n # sconcat :: NonEmpty (ArcLength n) -> ArcLength n # stimes :: Integral b => b -> ArcLength n -> ArcLength n #
Semigroup (Leftmost a)
Instance details Defined in Control.Lens.Internal.Fold Methods (<>) :: Leftmost a -> Leftmost a -> Leftmost a # sconcat :: NonEmpty (Leftmost a) -> Leftmost a # stimes :: Integral b => b -> Leftmost a -> Leftmost a #
Semigroup (Rightmost a)
Instance details Defined in Control.Lens.Internal.Fold Methods (<>) :: Rightmost a -> Rightmost a -> Rightmost a # sconcat :: NonEmpty (Rightmost a) -> Rightmost a # stimes :: Integral b => b -> Rightmost a -> Rightmost a #
Semigroup (Clip n)
Instance details Defined in Diagrams.TwoD.Path Methods (<>) :: Clip n -> Clip n -> Clip n # sconcat :: NonEmpty (Clip n) -> Clip n # stimes :: Integral b => b -> Clip n -> Clip n #
Semigroup (FillTexture n)
Instance details Defined in Diagrams.TwoD.Attributes Methods (<>) :: FillTexture n -> FillTexture n -> FillTexture n # sconcat :: NonEmpty (FillTexture n) -> FillTexture n # stimes :: Integral b => b -> FillTexture n -> FillTexture n #
Semigroup (LineTexture n)
Instance details Defined in Diagrams.TwoD.Attributes Methods (<>) :: LineTexture n -> LineTexture n -> LineTexture n # sconcat :: NonEmpty (LineTexture n) -> LineTexture n # stimes :: Integral b => b -> LineTexture n -> LineTexture n #
Semigroup a => Semigroup (Recommend a)
Instance details Defined in Data.Monoid.Recommend Methods (<>) :: Recommend a -> Recommend a -> Recommend a # sconcat :: NonEmpty (Recommend a) -> Recommend a # stimes :: Integral b => b -> Recommend a -> Recommend a #
Semigroup (FontSize n)
Instance details Defined in Diagrams.TwoD.Text Methods (<>) :: FontSize n -> FontSize n -> FontSize n # sconcat :: NonEmpty (FontSize n) -> FontSize n # stimes :: Integral b => b -> FontSize n -> FontSize n #
Num a => Semigroup (TransferFunction a)
Instance details Defined in Data.Colour.RGBSpace Methods (<>) :: TransferFunction a -> TransferFunction a -> TransferFunction a # sconcat :: NonEmpty (TransferFunction a) -> TransferFunction a # stimes :: Integral b => b -> TransferFunction a -> TransferFunction a #
Semigroup (NonEmptyDList a)
Instance details Defined in Control.Lens.Internal.Fold Methods (<>) :: NonEmptyDList a -> NonEmptyDList a -> NonEmptyDList a # sconcat :: NonEmpty (NonEmptyDList a) -> NonEmptyDList a # stimes :: Integral b => b -> NonEmptyDList a -> NonEmptyDList a #
Ord a => Semigroup (Max a)
Instance details Defined in Control.Lens.Internal.Fold Methods (<>) :: Max a -> Max a -> Max a # sconcat :: NonEmpty (Max a) -> Max a # stimes :: Integral b => b -> Max a -> Max a #
Ord a => Semigroup (Min a)
Instance details Defined in Control.Lens.Internal.Fold Methods (<>) :: Min a -> Min a -> Min a # sconcat :: NonEmpty (Min a) -> Min a # stimes :: Integral b => b -> Min a -> Min a #
Semigroup b => Semigroup (a -> b)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: (a -> b) -> (a -> b) -> a -> b # sconcat :: NonEmpty (a -> b) -> a -> b # stimes :: Integral b0 => b0 -> (a -> b) -> a -> b #
Semigroup (Either a b)	Since: base-4.9.0.0
Instance details Defined in Data.Either Methods (<>) :: Either a b -> Either a b -> Either a b # sconcat :: NonEmpty (Either a b) -> Either a b # stimes :: Integral b0 => b0 -> Either a b -> Either a b #
Semigroup (V1 p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: V1 p -> V1 p -> V1 p # sconcat :: NonEmpty (V1 p) -> V1 p # stimes :: Integral b => b -> V1 p -> V1 p #
Semigroup (U1 p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: U1 p -> U1 p -> U1 p # sconcat :: NonEmpty (U1 p) -> U1 p # stimes :: Integral b => b -> U1 p -> U1 p #
(Semigroup a, Semigroup b) => Semigroup (a, b)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: (a, b) -> (a, b) -> (a, b) # sconcat :: NonEmpty (a, b) -> (a, b) # stimes :: Integral b0 => b0 -> (a, b) -> (a, b) #
Semigroup a => Semigroup (Op a b)
Instance details Defined in Data.Functor.Contravariant Methods (<>) :: Op a b -> Op a b -> Op a b # sconcat :: NonEmpty (Op a b) -> Op a b # stimes :: Integral b0 => b0 -> Op a b -> Op a b #
Semigroup (Proxy s)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods (<>) :: Proxy s -> Proxy s -> Proxy s # sconcat :: NonEmpty (Proxy s) -> Proxy s # stimes :: Integral b => b -> Proxy s -> Proxy s #
Ord k => Semigroup (Map k v)
Instance details Defined in Data.Map.Internal Methods (<>) :: Map k v -> Map k v -> Map k v # sconcat :: NonEmpty (Map k v) -> Map k v # stimes :: Integral b => b -> Map k v -> Map k v #
(a ~ (), Applicative m) => Semigroup (HtmlT m a)
Instance details Defined in Lucid.Base Methods (<>) :: HtmlT m a -> HtmlT m a -> HtmlT m a # sconcat :: NonEmpty (HtmlT m a) -> HtmlT m a # stimes :: Integral b => b -> HtmlT m a -> HtmlT m a #
(Eq k, Hashable k) => Semigroup (HashMap k v)
Instance details Defined in Data.HashMap.Base Methods (<>) :: HashMap k v -> HashMap k v -> HashMap k v # sconcat :: NonEmpty (HashMap k v) -> HashMap k v # stimes :: Integral b => b -> HashMap k v -> HashMap k v #
Semigroup (Parser i a)
Instance details Defined in Data.Attoparsec.Internal.Types Methods (<>) :: Parser i a -> Parser i a -> Parser i a # sconcat :: NonEmpty (Parser i a) -> Parser i a # stimes :: Integral b => b -> Parser i a -> Parser i a #
Ord n => Semigroup (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope Methods (<>) :: Envelope v n -> Envelope v n -> Envelope v n # sconcat :: NonEmpty (Envelope v n) -> Envelope v n # stimes :: Integral b => b -> Envelope v n -> Envelope v n #
Semigroup a => Semigroup (Measured n a)
Instance details Defined in Diagrams.Core.Measure Methods (<>) :: Measured n a -> Measured n a -> Measured n a # sconcat :: NonEmpty (Measured n a) -> Measured n a # stimes :: Integral b => b -> Measured n a -> Measured n a #
Typeable n => Semigroup (Attribute v n)
Instance details Defined in Diagrams.Core.Style Methods (<>) :: Attribute v n -> Attribute v n -> Attribute v n # sconcat :: NonEmpty (Attribute v n) -> Attribute v n # stimes :: Integral b => b -> Attribute v n -> Attribute v n #
Typeable n => Semigroup (Style v n)
Instance details Defined in Diagrams.Core.Style Methods (<>) :: Style v n -> Style v n -> Style v n # sconcat :: NonEmpty (Style v n) -> Style v n # stimes :: Integral b => b -> Style v n -> Style v n #
Ord n => Semigroup (Trace v n)
Instance details Defined in Diagrams.Core.Trace Methods (<>) :: Trace v n -> Trace v n -> Trace v n # sconcat :: NonEmpty (Trace v n) -> Trace v n # stimes :: Integral b => b -> Trace v n -> Trace v n #
Semigroup (a :-: a)
Instance details Defined in Diagrams.Core.Transform Methods (<>) :: (a :-: a) -> (a :-: a) -> a :-: a # sconcat :: NonEmpty (a :-: a) -> a :-: a # stimes :: Integral b => b -> (a :-: a) -> a :-: a #
(Additive v, Num n) => Semigroup (Transformation v n)
Instance details Defined in Diagrams.Core.Transform Methods (<>) :: Transformation v n -> Transformation v n -> Transformation v n # sconcat :: NonEmpty (Transformation v n) -> Transformation v n # stimes :: Integral b => b -> Transformation v n -> Transformation v n #
(Additive v, Ord n) => Semigroup (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox Methods (<>) :: BoundingBox v n -> BoundingBox v n -> BoundingBox v n # sconcat :: NonEmpty (BoundingBox v n) -> BoundingBox v n # stimes :: Integral b => b -> BoundingBox v n -> BoundingBox v n #
Semigroup (Path v n)
Instance details Defined in Diagrams.Path Methods (<>) :: Path v n -> Path v n -> Path v n # sconcat :: NonEmpty (Path v n) -> Path v n # stimes :: Integral b => b -> Path v n -> Path v n #
(Metric v, OrderedField n) => Semigroup (OffsetEnvelope v n)
Instance details Defined in Diagrams.Segment Methods (<>) :: OffsetEnvelope v n -> OffsetEnvelope v n -> OffsetEnvelope v n # sconcat :: NonEmpty (OffsetEnvelope v n) -> OffsetEnvelope v n # stimes :: Integral b => b -> OffsetEnvelope v n -> OffsetEnvelope v n #
(Num n, Additive v) => Semigroup (TotalOffset v n)
Instance details Defined in Diagrams.Segment Methods (<>) :: TotalOffset v n -> TotalOffset v n -> TotalOffset v n # sconcat :: NonEmpty (TotalOffset v n) -> TotalOffset v n # stimes :: Integral b => b -> TotalOffset v n -> TotalOffset v n #
(Ord n, Floating n, Metric v) => Semigroup (SegTree v n)
Instance details Defined in Diagrams.Trail Methods (<>) :: SegTree v n -> SegTree v n -> SegTree v n # sconcat :: NonEmpty (SegTree v n) -> SegTree v n # stimes :: Integral b => b -> SegTree v n -> SegTree v n #
(OrderedField n, Metric v) => Semigroup (Trail v n)
Instance details Defined in Diagrams.Trail Methods (<>) :: Trail v n -> Trail v n -> Trail v n # sconcat :: NonEmpty (Trail v n) -> Trail v n # stimes :: Integral b => b -> Trail v n -> Trail v n #
Monad m => Semigroup (Sequenced a m)
Instance details Defined in Control.Lens.Internal.Fold Methods (<>) :: Sequenced a m -> Sequenced a m -> Sequenced a m # sconcat :: NonEmpty (Sequenced a m) -> Sequenced a m # stimes :: Integral b => b -> Sequenced a m -> Sequenced a m #
Applicative f => Semigroup (Traversed a f)
Instance details Defined in Control.Lens.Internal.Fold Methods (<>) :: Traversed a f -> Traversed a f -> Traversed a f # sconcat :: NonEmpty (Traversed a f) -> Traversed a f # stimes :: Integral b => b -> Traversed a f -> Traversed a f #
Semigroup (ReifiedFold s a)
Instance details Defined in Control.Lens.Reified Methods (<>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a # sconcat :: NonEmpty (ReifiedFold s a) -> ReifiedFold s a # stimes :: Integral b => b -> ReifiedFold s a -> ReifiedFold s a #
Measured v a => Semigroup (FingerTree v a)
Instance details Defined in Data.FingerTree Methods (<>) :: FingerTree v a -> FingerTree v a -> FingerTree v a # sconcat :: NonEmpty (FingerTree v a) -> FingerTree v a # stimes :: Integral b => b -> FingerTree v a -> FingerTree v a #
(Additive v, Ord n) => Semigroup (NonEmptyBoundingBox v n)
Instance details Defined in Diagrams.BoundingBox Methods (<>) :: NonEmptyBoundingBox v n -> NonEmptyBoundingBox v n -> NonEmptyBoundingBox v n # sconcat :: NonEmpty (NonEmptyBoundingBox v n) -> NonEmptyBoundingBox v n # stimes :: Integral b => b -> NonEmptyBoundingBox v n -> NonEmptyBoundingBox v n #
(Contravariant f, Applicative f) => Semigroup (Folding f a)
Instance details Defined in Control.Lens.Internal.Fold Methods (<>) :: Folding f a -> Folding f a -> Folding f a # sconcat :: NonEmpty (Folding f a) -> Folding f a # stimes :: Integral b => b -> Folding f a -> Folding f a #
Semigroup (f a) => Semigroup (Indexing f a)
Instance details Defined in Control.Lens.Internal.Indexed Methods (<>) :: Indexing f a -> Indexing f a -> Indexing f a # sconcat :: NonEmpty (Indexing f a) -> Indexing f a # stimes :: Integral b => b -> Indexing f a -> Indexing f a #
Apply f => Semigroup (TraversedF a f)
Instance details Defined in Control.Lens.Internal.Fold Methods (<>) :: TraversedF a f -> TraversedF a f -> TraversedF a f # sconcat :: NonEmpty (TraversedF a f) -> TraversedF a f # stimes :: Integral b => b -> TraversedF a f -> TraversedF a f #
Semigroup (Deepening i a)
Instance details Defined in Control.Lens.Internal.Level Methods (<>) :: Deepening i a -> Deepening i a -> Deepening i a # sconcat :: NonEmpty (Deepening i a) -> Deepening i a # stimes :: Integral b => b -> Deepening i a -> Deepening i a #
Semigroup (f p) => Semigroup (Rec1 f p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: Rec1 f p -> Rec1 f p -> Rec1 f p # sconcat :: NonEmpty (Rec1 f p) -> Rec1 f p # stimes :: Integral b => b -> Rec1 f p -> Rec1 f p #
(Semigroup a, Semigroup b, Semigroup c) => Semigroup (a, b, c)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: (a, b, c) -> (a, b, c) -> (a, b, c) # sconcat :: NonEmpty (a, b, c) -> (a, b, c) # stimes :: Integral b0 => b0 -> (a, b, c) -> (a, b, c) #
Semigroup a => Semigroup (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods (<>) :: Const a b -> Const a b -> Const a b # sconcat :: NonEmpty (Const a b) -> Const a b # stimes :: Integral b0 => b0 -> Const a b -> Const a b #
(Applicative f, Semigroup a) => Semigroup (Ap f a)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods (<>) :: Ap f a -> Ap f a -> Ap f a # sconcat :: NonEmpty (Ap f a) -> Ap f a # stimes :: Integral b => b -> Ap f a -> Ap f a #
Alternative f => Semigroup (Alt f a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Alt f a -> Alt f a -> Alt f a # sconcat :: NonEmpty (Alt f a) -> Alt f a # stimes :: Integral b => b -> Alt f a -> Alt f a #
Semigroup a => Semigroup (Tagged s a)
Instance details Defined in Data.Tagged Methods (<>) :: Tagged s a -> Tagged s a -> Tagged s a # sconcat :: NonEmpty (Tagged s a) -> Tagged s a # stimes :: Integral b => b -> Tagged s a -> Tagged s a #
Semigroup (Colonnade h a c)
Instance details Defined in Colonnade.Encode Methods (<>) :: Colonnade h a c -> Colonnade h a c -> Colonnade h a c # sconcat :: NonEmpty (Colonnade h a c) -> Colonnade h a c # stimes :: Integral b => b -> Colonnade h a c -> Colonnade h a c #
Semigroup m => Semigroup (Query v n m)
Instance details Defined in Diagrams.Core.Query Methods (<>) :: Query v n m -> Query v n m -> Query v n m # sconcat :: NonEmpty (Query v n m) -> Query v n m # stimes :: Integral b => b -> Query v n m -> Query v n m #
Semigroup (Render NullBackend v n)
Instance details Defined in Diagrams.Core.Types Methods (<>) :: Render NullBackend v n -> Render NullBackend v n -> Render NullBackend v n # sconcat :: NonEmpty (Render NullBackend v n) -> Render NullBackend v n # stimes :: Integral b => b -> Render NullBackend v n -> Render NullBackend v n #
Semigroup (Render SVG V2 n)
Instance details Defined in Diagrams.Backend.SVG Methods (<>) :: Render SVG V2 n -> Render SVG V2 n -> Render SVG V2 n # sconcat :: NonEmpty (Render SVG V2 n) -> Render SVG V2 n # stimes :: Integral b => b -> Render SVG V2 n -> Render SVG V2 n #
Semigroup (Deformation v v n)
Instance details Defined in Diagrams.Deform Methods (<>) :: Deformation v v n -> Deformation v v n -> Deformation v v n # sconcat :: NonEmpty (Deformation v v n) -> Deformation v v n # stimes :: Integral b => b -> Deformation v v n -> Deformation v v n #
(OrderedField n, Metric v) => Semigroup (Trail' Line v n)
Instance details Defined in Diagrams.Trail Methods (<>) :: Trail' Line v n -> Trail' Line v n -> Trail' Line v n # sconcat :: NonEmpty (Trail' Line v n) -> Trail' Line v n # stimes :: Integral b => b -> Trail' Line v n -> Trail' Line v n #
Semigroup (ReifiedIndexedFold i s a)
Instance details Defined in Control.Lens.Reified Methods (<>) :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a # sconcat :: NonEmpty (ReifiedIndexedFold i s a) -> ReifiedIndexedFold i s a # stimes :: Integral b => b -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #
Reifies s (ReifiedMonoid a) => Semigroup (ReflectedMonoid a s)
Instance details Defined in Data.Reflection Methods (<>) :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s # sconcat :: NonEmpty (ReflectedMonoid a s) -> ReflectedMonoid a s # stimes :: Integral b => b -> ReflectedMonoid a s -> ReflectedMonoid a s #
ArrowPlus p => Semigroup (Tambara p a b)
Instance details Defined in Data.Profunctor.Strong Methods (<>) :: Tambara p a b -> Tambara p a b -> Tambara p a b # sconcat :: NonEmpty (Tambara p a b) -> Tambara p a b # stimes :: Integral b0 => b0 -> Tambara p a b -> Tambara p a b #
Semigroup c => Semigroup (K1 i c p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: K1 i c p -> K1 i c p -> K1 i c p # sconcat :: NonEmpty (K1 i c p) -> K1 i c p # stimes :: Integral b => b -> K1 i c p -> K1 i c p #
(Semigroup (f p), Semigroup (g p)) => Semigroup ((f :*: g) p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: (f :: g) p -> (f :: g) p -> (f :: g) p # sconcat :: NonEmpty ((f :: g) p) -> (f :: g) p # stimes :: Integral b => b -> (f :: g) p -> (f :*: g) p #
(Semigroup a, Semigroup b, Semigroup c, Semigroup d) => Semigroup (a, b, c, d)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) # sconcat :: NonEmpty (a, b, c, d) -> (a, b, c, d) # stimes :: Integral b0 => b0 -> (a, b, c, d) -> (a, b, c, d) #
Semigroup a => Semigroup (ParsecT s u m a)	The `Semigroup` instance for `ParsecT` is used to append the result of several parsers, for example: (many $ char `a`) <> (many $ char `b`) The above will parse a string like `"aabbb"` and return a successful parse result `"aabbb"`. Compare against the below which will produce a result of `"bbb"` for the same input: (many $ char `a`) >> (many $ char `b`) (many $ char `a`) > (many $ char `b`) Since: parsec-3.1.12*
Instance details Defined in Text.Parsec.Prim Methods (<>) :: ParsecT s u m a -> ParsecT s u m a -> ParsecT s u m a # sconcat :: NonEmpty (ParsecT s u m a) -> ParsecT s u m a # stimes :: Integral b => b -> ParsecT s u m a -> ParsecT s u m a #
Semigroup (Cornice h p a c)
Instance details Defined in Colonnade.Encode Methods (<>) :: Cornice h p a c -> Cornice h p a c -> Cornice h p a c # sconcat :: NonEmpty (Cornice h p a c) -> Cornice h p a c # stimes :: Integral b => b -> Cornice h p a c -> Cornice h p a c #
(Metric v, OrderedField n, Semigroup m) => Semigroup (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods (<>) :: QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m # sconcat :: NonEmpty (QDiagram b v n m) -> QDiagram b v n m # stimes :: Integral b0 => b0 -> QDiagram b v n m -> QDiagram b v n m #
Semigroup (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types Methods (<>) :: SubMap b v n m -> SubMap b v n m -> SubMap b v n m # sconcat :: NonEmpty (SubMap b v n m) -> SubMap b v n m # stimes :: Integral b0 => b0 -> SubMap b v n m -> SubMap b v n m #
(Semigroup u, Action d u) => Semigroup (DUALTree d u a l)
Instance details Defined in Data.Tree.DUAL.Internal Methods (<>) :: DUALTree d u a l -> DUALTree d u a l -> DUALTree d u a l # sconcat :: NonEmpty (DUALTree d u a l) -> DUALTree d u a l # stimes :: Integral b => b -> DUALTree d u a l -> DUALTree d u a l #
(Semigroup u, Action d u) => Semigroup (DUALTreeU d u a l)
Instance details Defined in Data.Tree.DUAL.Internal Methods (<>) :: DUALTreeU d u a l -> DUALTreeU d u a l -> DUALTreeU d u a l # sconcat :: NonEmpty (DUALTreeU d u a l) -> DUALTreeU d u a l # stimes :: Integral b => b -> DUALTreeU d u a l -> DUALTreeU d u a l #
(Action d u, Semigroup u) => Semigroup (DUALTreeNE d u a l)
Instance details Defined in Data.Tree.DUAL.Internal Methods (<>) :: DUALTreeNE d u a l -> DUALTreeNE d u a l -> DUALTreeNE d u a l # sconcat :: NonEmpty (DUALTreeNE d u a l) -> DUALTreeNE d u a l # stimes :: Integral b => b -> DUALTreeNE d u a l -> DUALTreeNE d u a l #
Semigroup (f p) => Semigroup (M1 i c f p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: M1 i c f p -> M1 i c f p -> M1 i c f p # sconcat :: NonEmpty (M1 i c f p) -> M1 i c f p # stimes :: Integral b => b -> M1 i c f p -> M1 i c f p #
Semigroup (f (g p)) => Semigroup ((f :.: g) p)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods (<>) :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p # sconcat :: NonEmpty ((f :.: g) p) -> (f :.: g) p # stimes :: Integral b => b -> (f :.: g) p -> (f :.: g) p #
(Semigroup a, Semigroup b, Semigroup c, Semigroup d, Semigroup e) => Semigroup (a, b, c, d, e)	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods (<>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) # sconcat :: NonEmpty (a, b, c, d, e) -> (a, b, c, d, e) # stimes :: Integral b0 => b0 -> (a, b, c, d, e) -> (a, b, c, d, e) #
Contravariant g => Semigroup (BazaarT p g a b t)
Instance details Defined in Control.Lens.Internal.Bazaar Methods (<>) :: BazaarT p g a b t -> BazaarT p g a b t -> BazaarT p g a b t # sconcat :: NonEmpty (BazaarT p g a b t) -> BazaarT p g a b t # stimes :: Integral b0 => b0 -> BazaarT p g a b t -> BazaarT p g a b t #
Contravariant g => Semigroup (BazaarT1 p g a b t)
Instance details Defined in Control.Lens.Internal.Bazaar Methods (<>) :: BazaarT1 p g a b t -> BazaarT1 p g a b t -> BazaarT1 p g a b t # sconcat :: NonEmpty (BazaarT1 p g a b t) -> BazaarT1 p g a b t # stimes :: Integral b0 => b0 -> BazaarT1 p g a b t -> BazaarT1 p g a b t #

class Contravariant (f :: Type -> Type) where #

The class of contravariant functors.

Whereas in Haskell, one can think of a Functor as containing or producing values, a contravariant functor is a functor that can be thought of as consuming values.

As an example, consider the type of predicate functions a -> Bool. One such predicate might be negative x = x < 0, which classifies integers as to whether they are negative. However, given this predicate, we can re-use it in other situations, providing we have a way to map values to integers. For instance, we can use the negative predicate on a person's bank balance to work out if they are currently overdrawn:

newtype Predicate a = Predicate { getPredicate :: a -> Bool }

instance Contravariant Predicate where
  contramap f (Predicate p) = Predicate (p . f)
                                         |   `- First, map the input...
                                         `----- then apply the predicate.

overdrawn :: Predicate Person
overdrawn = contramap personBankBalance negative

Any instance should be subject to the following laws:

contramap id = id
contramap f . contramap g = contramap (g . f)

Note, that the second law follows from the free theorem of the type of contramap and the first law, so you need only check that the former condition holds.

Minimal complete definition

contramap

Methods

contramap :: (a -> b) -> f b -> f a #

(>$) :: b -> f b -> f a infixl 4 #

Replace all locations in the output with the same value. The default definition is contramap . const, but this may be overridden with a more efficient version.

Instances

Contravariant Predicate	A `Predicate` is a `Contravariant` `Functor`, because `contramap` can apply its function argument to the input of the predicate.
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> Predicate b -> Predicate a # (>$) :: b -> Predicate b -> Predicate a #
Contravariant Comparison	A `Comparison` is a `Contravariant` `Functor`, because `contramap` can apply its function argument to each input of the comparison function.
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> Comparison b -> Comparison a # (>$) :: b -> Comparison b -> Comparison a #
Contravariant Equivalence	Equivalence relations are `Contravariant`, because you can apply the contramapped function to each input to the equivalence relation.
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> Equivalence b -> Equivalence a # (>$) :: b -> Equivalence b -> Equivalence a #
Contravariant Headless
Instance details Defined in Colonnade.Encode Methods contramap :: (a -> b) -> Headless b -> Headless a # (>$) :: b -> Headless b -> Headless a #
Contravariant (V1 :: Type -> Type)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> V1 b -> V1 a # (>$) :: b -> V1 b -> V1 a #
Contravariant (U1 :: Type -> Type)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> U1 b -> U1 a # (>$) :: b -> U1 b -> U1 a #
Contravariant (Op a)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a0 -> b) -> Op a b -> Op a a0 # (>$) :: b -> Op a b -> Op a a0 #
Contravariant (Proxy :: Type -> Type)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> Proxy b -> Proxy a # (>$) :: b -> Proxy b -> Proxy a #
Contravariant m => Contravariant (MaybeT m)
Instance details Defined in Control.Monad.Trans.Maybe Methods contramap :: (a -> b) -> MaybeT m b -> MaybeT m a # (>$) :: b -> MaybeT m b -> MaybeT m a #
Contravariant m => Contravariant (ListT m)
Instance details Defined in Control.Monad.Trans.List Methods contramap :: (a -> b) -> ListT m b -> ListT m a # (>$) :: b -> ListT m b -> ListT m a #
Contravariant f => Contravariant (Indexing f)
Instance details Defined in Control.Lens.Internal.Indexed Methods contramap :: (a -> b) -> Indexing f b -> Indexing f a # (>$) :: b -> Indexing f b -> Indexing f a #
Contravariant f => Contravariant (Indexing64 f)
Instance details Defined in Control.Lens.Internal.Indexed Methods contramap :: (a -> b) -> Indexing64 f b -> Indexing64 f a # (>$) :: b -> Indexing64 f b -> Indexing64 f a #
Contravariant f => Contravariant (Rec1 f)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> Rec1 f b -> Rec1 f a # (>$) :: b -> Rec1 f b -> Rec1 f a #
Contravariant (Const a :: Type -> Type)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a0 -> b) -> Const a b -> Const a a0 # (>$) :: b -> Const a b -> Const a a0 #
Contravariant f => Contravariant (Alt f)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> Alt f b -> Alt f a # (>$) :: b -> Alt f b -> Alt f a #
Contravariant f => Contravariant (IdentityT f)
Instance details Defined in Control.Monad.Trans.Identity Methods contramap :: (a -> b) -> IdentityT f b -> IdentityT f a # (>$) :: b -> IdentityT f b -> IdentityT f a #
Contravariant m => Contravariant (ErrorT e m)
Instance details Defined in Control.Monad.Trans.Error Methods contramap :: (a -> b) -> ErrorT e m b -> ErrorT e m a # (>$) :: b -> ErrorT e m b -> ErrorT e m a #
Contravariant m => Contravariant (ExceptT e m)
Instance details Defined in Control.Monad.Trans.Except Methods contramap :: (a -> b) -> ExceptT e m b -> ExceptT e m a # (>$) :: b -> ExceptT e m b -> ExceptT e m a #
Contravariant m => Contravariant (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods contramap :: (a -> b) -> ReaderT r m b -> ReaderT r m a # (>$) :: b -> ReaderT r m b -> ReaderT r m a #
Contravariant m => Contravariant (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Lazy Methods contramap :: (a -> b) -> StateT s m b -> StateT s m a # (>$) :: b -> StateT s m b -> StateT s m a #
Contravariant m => Contravariant (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Strict Methods contramap :: (a -> b) -> StateT s m b -> StateT s m a # (>$) :: b -> StateT s m b -> StateT s m a #
Contravariant m => Contravariant (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods contramap :: (a -> b) -> WriterT w m b -> WriterT w m a # (>$) :: b -> WriterT w m b -> WriterT w m a #
Contravariant m => Contravariant (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods contramap :: (a -> b) -> WriterT w m b -> WriterT w m a # (>$) :: b -> WriterT w m b -> WriterT w m a #
Contravariant f => Contravariant (Reverse f)	Derived instance.
Instance details Defined in Data.Functor.Reverse Methods contramap :: (a -> b) -> Reverse f b -> Reverse f a # (>$) :: b -> Reverse f b -> Reverse f a #
Contravariant f => Contravariant (Backwards f)	Derived instance.
Instance details Defined in Control.Applicative.Backwards Methods contramap :: (a -> b) -> Backwards f b -> Backwards f a # (>$) :: b -> Backwards f b -> Backwards f a #
Contravariant f => Contravariant (AlongsideLeft f b)
Instance details Defined in Control.Lens.Internal.Getter Methods contramap :: (a -> b0) -> AlongsideLeft f b b0 -> AlongsideLeft f b a # (>$) :: b0 -> AlongsideLeft f b b0 -> AlongsideLeft f b a #
Contravariant f => Contravariant (AlongsideRight f a)
Instance details Defined in Control.Lens.Internal.Getter Methods contramap :: (a0 -> b) -> AlongsideRight f a b -> AlongsideRight f a a0 # (>$) :: b -> AlongsideRight f a b -> AlongsideRight f a a0 #
Contravariant (K1 i c :: Type -> Type)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> K1 i c b -> K1 i c a # (>$) :: b -> K1 i c b -> K1 i c a #
(Contravariant f, Contravariant g) => Contravariant (f :+: g)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> (f :+: g) b -> (f :+: g) a # (>$) :: b -> (f :+: g) b -> (f :+: g) a #
(Contravariant f, Contravariant g) => Contravariant (f :*: g)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> (f :: g) b -> (f :: g) a # (>$) :: b -> (f :: g) b -> (f :: g) a #
(Contravariant f, Contravariant g) => Contravariant (Product f g)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> Product f g b -> Product f g a # (>$) :: b -> Product f g b -> Product f g a #
(Contravariant f, Contravariant g) => Contravariant (Sum f g)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> Sum f g b -> Sum f g a # (>$) :: b -> Sum f g b -> Sum f g a #
Contravariant f => Contravariant (M1 i c f)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> M1 i c f b -> M1 i c f a # (>$) :: b -> M1 i c f b -> M1 i c f a #
(Functor f, Contravariant g) => Contravariant (f :.: g)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> (f :.: g) b -> (f :.: g) a # (>$) :: b -> (f :.: g) b -> (f :.: g) a #
(Functor f, Contravariant g) => Contravariant (Compose f g)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a -> b) -> Compose f g b -> Compose f g a # (>$) :: b -> Compose f g b -> Compose f g a #
Contravariant m => Contravariant (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods contramap :: (a -> b) -> RWST r w s m b -> RWST r w s m a # (>$) :: b -> RWST r w s m b -> RWST r w s m a #
Contravariant m => Contravariant (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods contramap :: (a -> b) -> RWST r w s m b -> RWST r w s m a # (>$) :: b -> RWST r w s m b -> RWST r w s m a #
Contravariant f => Contravariant (TakingWhile p f a b)
Instance details Defined in Control.Lens.Internal.Magma Methods contramap :: (a0 -> b0) -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 # (>$) :: b0 -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 #
(Profunctor p, Contravariant g) => Contravariant (PretextT p g a b)
Instance details Defined in Control.Lens.Internal.Context Methods contramap :: (a0 -> b0) -> PretextT p g a b b0 -> PretextT p g a b a0 # (>$) :: b0 -> PretextT p g a b b0 -> PretextT p g a b a0 #
(Profunctor p, Contravariant g) => Contravariant (BazaarT p g a b)
Instance details Defined in Control.Lens.Internal.Bazaar Methods contramap :: (a0 -> b0) -> BazaarT p g a b b0 -> BazaarT p g a b a0 # (>$) :: b0 -> BazaarT p g a b b0 -> BazaarT p g a b a0 #
(Profunctor p, Contravariant g) => Contravariant (BazaarT1 p g a b)
Instance details Defined in Control.Lens.Internal.Bazaar Methods contramap :: (a0 -> b0) -> BazaarT1 p g a b b0 -> BazaarT1 p g a b a0 # (>$) :: b0 -> BazaarT1 p g a b b0 -> BazaarT1 p g a b a0 #

option :: b -> (a -> b) -> Option a -> b #

Fold an Option case-wise, just like maybe.

mtimesDefault :: (Integral b, Monoid a) => b -> a -> a #

Repeat a value n times.

mtimesDefault n a = a <> a <> ... <> a  -- using <> (n-1) times

Implemented using stimes and mempty.

This is a suitable definition for an mtimes member of Monoid.

diff :: Semigroup m => m -> Endo m #

This lets you use a difference list of a Semigroup as a Monoid.

cycle1 :: Semigroup m => m -> m #

A generalization of cycle to an arbitrary Semigroup. May fail to terminate for some values in some semigroups.

newtype Min a #

Constructors

Min
Fields getMin :: a

Instances

Monad Min	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: Min a -> (a -> Min b) -> Min b # (>>) :: Min a -> Min b -> Min b # return :: a -> Min a # fail :: String -> Min a #
Functor Min	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> Min a -> Min b # (<$) :: a -> Min b -> Min a #
MonadFix Min	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mfix :: (a -> Min a) -> Min a #
Applicative Min	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Min a # (<>) :: Min (a -> b) -> Min a -> Min b # liftA2 :: (a -> b -> c) -> Min a -> Min b -> Min c # (>) :: Min a -> Min b -> Min b # (<*) :: Min a -> Min b -> Min a #
Foldable Min	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fold :: Monoid m => Min m -> m # foldMap :: Monoid m => (a -> m) -> Min a -> m # foldr :: (a -> b -> b) -> b -> Min a -> b # foldr' :: (a -> b -> b) -> b -> Min a -> b # foldl :: (b -> a -> b) -> b -> Min a -> b # foldl' :: (b -> a -> b) -> b -> Min a -> b # foldr1 :: (a -> a -> a) -> Min a -> a # foldl1 :: (a -> a -> a) -> Min a -> a # toList :: Min a -> [a] # null :: Min a -> Bool # length :: Min a -> Int # elem :: Eq a => a -> Min a -> Bool # maximum :: Ord a => Min a -> a # minimum :: Ord a => Min a -> a # sum :: Num a => Min a -> a # product :: Num a => Min a -> a #
Traversable Min	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> Min a -> f (Min b) # sequenceA :: Applicative f => Min (f a) -> f (Min a) # mapM :: Monad m => (a -> m b) -> Min a -> m (Min b) # sequence :: Monad m => Min (m a) -> m (Min a) #
Apply Min
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Min (a -> b) -> Min a -> Min b (.>) :: Min a -> Min b -> Min b (<.) :: Min a -> Min b -> Min a liftF2 :: (a -> b -> c) -> Min a -> Min b -> Min c
Bind Min
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Min a -> (a -> Min b) -> Min b join :: Min (Min a) -> Min a
Traversable1 Min
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Min a -> f (Min b) # sequence1 :: Apply f => Min (f b) -> f (Min b)
ToJSON1 Min
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Min a -> Value liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Min a] -> Value liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Min a -> Encoding liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Min a] -> Encoding
Bounded a => Bounded (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: Min a # maxBound :: Min a #
Enum a => Enum (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods succ :: Min a -> Min a # pred :: Min a -> Min a # toEnum :: Int -> Min a # fromEnum :: Min a -> Int # enumFrom :: Min a -> [Min a] # enumFromThen :: Min a -> Min a -> [Min a] # enumFromTo :: Min a -> Min a -> [Min a] # enumFromThenTo :: Min a -> Min a -> Min a -> [Min a] #
Eq a => Eq (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Min a -> Min a -> Bool # (/=) :: Min a -> Min a -> Bool #
Data a => Data (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Min a -> c (Min a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Min a) # toConstr :: Min a -> Constr # dataTypeOf :: Min a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Min a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Min a)) # gmapT :: (forall b. Data b => b -> b) -> Min a -> Min a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Min a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Min a -> r # gmapQ :: (forall d. Data d => d -> u) -> Min a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Min a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Min a -> m (Min a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Min a -> m (Min a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Min a -> m (Min a) #
Num a => Num (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (+) :: Min a -> Min a -> Min a # (-) :: Min a -> Min a -> Min a # (*) :: Min a -> Min a -> Min a # negate :: Min a -> Min a # abs :: Min a -> Min a # signum :: Min a -> Min a # fromInteger :: Integer -> Min a #
Ord a => Ord (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Min a -> Min a -> Ordering # (<) :: Min a -> Min a -> Bool # (<=) :: Min a -> Min a -> Bool # (>) :: Min a -> Min a -> Bool # (>=) :: Min a -> Min a -> Bool # max :: Min a -> Min a -> Min a # min :: Min a -> Min a -> Min a #
Read a => Read (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Min a) # readList :: ReadS [Min a] # readPrec :: ReadPrec (Min a) # readListPrec :: ReadPrec [Min a] #
Show a => Show (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Min a -> ShowS # show :: Min a -> String # showList :: [Min a] -> ShowS #
Generic (Min a)
Instance details Defined in Data.Semigroup Associated Types type Rep (Min a) :: Type -> Type # Methods from :: Min a -> Rep (Min a) x # to :: Rep (Min a) x -> Min a #
Ord a => Semigroup (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Min a -> Min a -> Min a # sconcat :: NonEmpty (Min a) -> Min a # stimes :: Integral b => b -> Min a -> Min a #
(Ord a, Bounded a) => Monoid (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: Min a # mappend :: Min a -> Min a -> Min a # mconcat :: [Min a] -> Min a #
ToJSON a => ToJSON (Min a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Min a -> Value toEncoding :: Min a -> Encoding toJSONList :: [Min a] -> Value toEncodingList :: [Min a] -> Encoding
Wrapped (Min a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Min a) :: Type # Methods _Wrapped' :: Iso' (Min a) (Unwrapped (Min a)) #
Newtype (Min a)
Instance details Defined in Control.Newtype.Generics Associated Types type O (Min a) :: Type Methods pack :: O (Min a) -> Min a unpack :: Min a -> O (Min a)
Generic1 Min
Instance details Defined in Data.Semigroup Associated Types type Rep1 Min :: k -> Type # Methods from1 :: Min a -> Rep1 Min a # to1 :: Rep1 Min a -> Min a #
t ~ Min b => Rewrapped (Min a) t
Instance details Defined in Control.Lens.Wrapped
type Rep (Min a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup type Rep (Min a) = D1 (MetaData "Min" "Data.Semigroup" "base" True) (C1 (MetaCons "Min" PrefixI True) (S1 (MetaSel (Just "getMin") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Unwrapped (Min a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Min a) = a
type O (Min a)
Instance details Defined in Control.Newtype.Generics type O (Min a) = a
type Rep1 Min	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup type Rep1 Min = D1 (MetaData "Min" "Data.Semigroup" "base" True) (C1 (MetaCons "Min" PrefixI True) (S1 (MetaSel (Just "getMin") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

newtype Max a #

Constructors

Max
Fields getMax :: a

Instances

Monad Max	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: Max a -> (a -> Max b) -> Max b # (>>) :: Max a -> Max b -> Max b # return :: a -> Max a # fail :: String -> Max a #
Functor Max	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> Max a -> Max b # (<$) :: a -> Max b -> Max a #
MonadFix Max	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mfix :: (a -> Max a) -> Max a #
Applicative Max	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Max a # (<>) :: Max (a -> b) -> Max a -> Max b # liftA2 :: (a -> b -> c) -> Max a -> Max b -> Max c # (>) :: Max a -> Max b -> Max b # (<*) :: Max a -> Max b -> Max a #
Foldable Max	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fold :: Monoid m => Max m -> m # foldMap :: Monoid m => (a -> m) -> Max a -> m # foldr :: (a -> b -> b) -> b -> Max a -> b # foldr' :: (a -> b -> b) -> b -> Max a -> b # foldl :: (b -> a -> b) -> b -> Max a -> b # foldl' :: (b -> a -> b) -> b -> Max a -> b # foldr1 :: (a -> a -> a) -> Max a -> a # foldl1 :: (a -> a -> a) -> Max a -> a # toList :: Max a -> [a] # null :: Max a -> Bool # length :: Max a -> Int # elem :: Eq a => a -> Max a -> Bool # maximum :: Ord a => Max a -> a # minimum :: Ord a => Max a -> a # sum :: Num a => Max a -> a # product :: Num a => Max a -> a #
Traversable Max	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> Max a -> f (Max b) # sequenceA :: Applicative f => Max (f a) -> f (Max a) # mapM :: Monad m => (a -> m b) -> Max a -> m (Max b) # sequence :: Monad m => Max (m a) -> m (Max a) #
Apply Max
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Max (a -> b) -> Max a -> Max b (.>) :: Max a -> Max b -> Max b (<.) :: Max a -> Max b -> Max a liftF2 :: (a -> b -> c) -> Max a -> Max b -> Max c
Bind Max
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Max a -> (a -> Max b) -> Max b join :: Max (Max a) -> Max a
Traversable1 Max
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Max a -> f (Max b) # sequence1 :: Apply f => Max (f b) -> f (Max b)
ToJSON1 Max
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Max a -> Value liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Max a] -> Value liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Max a -> Encoding liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Max a] -> Encoding
Bounded a => Bounded (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: Max a # maxBound :: Max a #
Enum a => Enum (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods succ :: Max a -> Max a # pred :: Max a -> Max a # toEnum :: Int -> Max a # fromEnum :: Max a -> Int # enumFrom :: Max a -> [Max a] # enumFromThen :: Max a -> Max a -> [Max a] # enumFromTo :: Max a -> Max a -> [Max a] # enumFromThenTo :: Max a -> Max a -> Max a -> [Max a] #
Eq a => Eq (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Max a -> Max a -> Bool # (/=) :: Max a -> Max a -> Bool #
Data a => Data (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Max a -> c (Max a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Max a) # toConstr :: Max a -> Constr # dataTypeOf :: Max a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Max a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Max a)) # gmapT :: (forall b. Data b => b -> b) -> Max a -> Max a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Max a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Max a -> r # gmapQ :: (forall d. Data d => d -> u) -> Max a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Max a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Max a -> m (Max a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Max a -> m (Max a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Max a -> m (Max a) #
Num a => Num (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (+) :: Max a -> Max a -> Max a # (-) :: Max a -> Max a -> Max a # (*) :: Max a -> Max a -> Max a # negate :: Max a -> Max a # abs :: Max a -> Max a # signum :: Max a -> Max a # fromInteger :: Integer -> Max a #
Ord a => Ord (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Max a -> Max a -> Ordering # (<) :: Max a -> Max a -> Bool # (<=) :: Max a -> Max a -> Bool # (>) :: Max a -> Max a -> Bool # (>=) :: Max a -> Max a -> Bool # max :: Max a -> Max a -> Max a # min :: Max a -> Max a -> Max a #
Read a => Read (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Max a) # readList :: ReadS [Max a] # readPrec :: ReadPrec (Max a) # readListPrec :: ReadPrec [Max a] #
Show a => Show (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Max a -> ShowS # show :: Max a -> String # showList :: [Max a] -> ShowS #
Generic (Max a)
Instance details Defined in Data.Semigroup Associated Types type Rep (Max a) :: Type -> Type # Methods from :: Max a -> Rep (Max a) x # to :: Rep (Max a) x -> Max a #
Ord a => Semigroup (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Max a -> Max a -> Max a # sconcat :: NonEmpty (Max a) -> Max a # stimes :: Integral b => b -> Max a -> Max a #
(Ord a, Bounded a) => Monoid (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: Max a # mappend :: Max a -> Max a -> Max a # mconcat :: [Max a] -> Max a #
ToJSON a => ToJSON (Max a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Max a -> Value toEncoding :: Max a -> Encoding toJSONList :: [Max a] -> Value toEncodingList :: [Max a] -> Encoding
Wrapped (Max a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Max a) :: Type # Methods _Wrapped' :: Iso' (Max a) (Unwrapped (Max a)) #
Newtype (Max a)
Instance details Defined in Control.Newtype.Generics Associated Types type O (Max a) :: Type Methods pack :: O (Max a) -> Max a unpack :: Max a -> O (Max a)
Generic1 Max
Instance details Defined in Data.Semigroup Associated Types type Rep1 Max :: k -> Type # Methods from1 :: Max a -> Rep1 Max a # to1 :: Rep1 Max a -> Max a #
t ~ Max b => Rewrapped (Max a) t
Instance details Defined in Control.Lens.Wrapped
type Rep (Max a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup type Rep (Max a) = D1 (MetaData "Max" "Data.Semigroup" "base" True) (C1 (MetaCons "Max" PrefixI True) (S1 (MetaSel (Just "getMax") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Unwrapped (Max a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Max a) = a
type O (Max a)
Instance details Defined in Control.Newtype.Generics type O (Max a) = a
type Rep1 Max	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup type Rep1 Max = D1 (MetaData "Max" "Data.Semigroup" "base" True) (C1 (MetaCons "Max" PrefixI True) (S1 (MetaSel (Just "getMax") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

data Arg a b #

Arg isn't itself a Semigroup in its own right, but it can be placed inside Min and Max to compute an arg min or arg max.

Constructors

Arg a b

Instances

Bitraversable Arg	Since: base-4.10.0.0
Instance details Defined in Data.Semigroup Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Arg a b -> f (Arg c d) #
Bifoldable Arg	Since: base-4.10.0.0
Instance details Defined in Data.Semigroup Methods bifold :: Monoid m => Arg m m -> m # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Arg a b -> m # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Arg a b -> c # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Arg a b -> c #
Bifunctor Arg	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods bimap :: (a -> b) -> (c -> d) -> Arg a c -> Arg b d # first :: (a -> b) -> Arg a c -> Arg b c # second :: (b -> c) -> Arg a b -> Arg a c #
Biapplicative Arg
Instance details Defined in Data.Biapplicative Methods bipure :: a -> b -> Arg a b (<<>>) :: Arg (a -> b) (c -> d) -> Arg a c -> Arg b d biliftA2 :: (a -> b -> c) -> (d -> e -> f) -> Arg a d -> Arg b e -> Arg c f (>>) :: Arg a b -> Arg c d -> Arg c d (<<*) :: Arg a b -> Arg c d -> Arg a b
Biapply Arg
Instance details Defined in Data.Functor.Bind.Class Methods (<<.>>) :: Arg (a -> b) (c -> d) -> Arg a c -> Arg b d (.>>) :: Arg a b -> Arg c d -> Arg c d (<<.) :: Arg a b -> Arg c d -> Arg a b
Bitraversable1 Arg
Instance details Defined in Data.Semigroup.Traversable.Class Methods bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Arg a c -> f (Arg b d) bisequence1 :: Apply f => Arg (f a) (f b) -> f (Arg a b)
Functor (Arg a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a0 -> b) -> Arg a a0 -> Arg a b # (<$) :: a0 -> Arg a b -> Arg a a0 #
Foldable (Arg a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fold :: Monoid m => Arg a m -> m # foldMap :: Monoid m => (a0 -> m) -> Arg a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Arg a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Arg a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Arg a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Arg a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 # toList :: Arg a a0 -> [a0] # null :: Arg a a0 -> Bool # length :: Arg a a0 -> Int # elem :: Eq a0 => a0 -> Arg a a0 -> Bool # maximum :: Ord a0 => Arg a a0 -> a0 # minimum :: Ord a0 => Arg a a0 -> a0 # sum :: Num a0 => Arg a a0 -> a0 # product :: Num a0 => Arg a a0 -> a0 #
Traversable (Arg a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a0 -> f b) -> Arg a a0 -> f (Arg a b) # sequenceA :: Applicative f => Arg a (f a0) -> f (Arg a a0) # mapM :: Monad m => (a0 -> m b) -> Arg a a0 -> m (Arg a b) # sequence :: Monad m => Arg a (m a0) -> m (Arg a a0) #
Generic1 (Arg a :: Type -> Type)
Instance details Defined in Data.Semigroup Associated Types type Rep1 (Arg a) :: k -> Type # Methods from1 :: Arg a a0 -> Rep1 (Arg a) a0 # to1 :: Rep1 (Arg a) a0 -> Arg a a0 #
Eq a => Eq (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Arg a b -> Arg a b -> Bool # (/=) :: Arg a b -> Arg a b -> Bool #
(Data a, Data b) => Data (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Arg a b -> c (Arg a b) # gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Arg a b) # toConstr :: Arg a b -> Constr # dataTypeOf :: Arg a b -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Arg a b)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Arg a b)) # gmapT :: (forall b0. Data b0 => b0 -> b0) -> Arg a b -> Arg a b # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Arg a b -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Arg a b -> r # gmapQ :: (forall d. Data d => d -> u) -> Arg a b -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Arg a b -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Arg a b -> m (Arg a b) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Arg a b -> m (Arg a b) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Arg a b -> m (Arg a b) #
Ord a => Ord (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Arg a b -> Arg a b -> Ordering # (<) :: Arg a b -> Arg a b -> Bool # (<=) :: Arg a b -> Arg a b -> Bool # (>) :: Arg a b -> Arg a b -> Bool # (>=) :: Arg a b -> Arg a b -> Bool # max :: Arg a b -> Arg a b -> Arg a b # min :: Arg a b -> Arg a b -> Arg a b #
(Read a, Read b) => Read (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Arg a b) # readList :: ReadS [Arg a b] # readPrec :: ReadPrec (Arg a b) # readListPrec :: ReadPrec [Arg a b] #
(Show a, Show b) => Show (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Arg a b -> ShowS # show :: Arg a b -> String # showList :: [Arg a b] -> ShowS #
Generic (Arg a b)
Instance details Defined in Data.Semigroup Associated Types type Rep (Arg a b) :: Type -> Type # Methods from :: Arg a b -> Rep (Arg a b) x # to :: Rep (Arg a b) x -> Arg a b #
type Rep1 (Arg a :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup type Rep1 (Arg a :: Type -> Type) = D1 (MetaData "Arg" "Data.Semigroup" "base" False) (C1 (MetaCons "Arg" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))
type Rep (Arg a b)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup type Rep (Arg a b) = D1 (MetaData "Arg" "Data.Semigroup" "base" False) (C1 (MetaCons "Arg" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 b)))

type ArgMin a b = Min (Arg a b) #

type ArgMax a b = Max (Arg a b) #

newtype First a #

Use Option (First a) to get the behavior of First from Data.Monoid.

Constructors

First
Fields getFirst :: a

Instances

Monad First	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: First a -> (a -> First b) -> First b # (>>) :: First a -> First b -> First b # return :: a -> First a # fail :: String -> First a #
Functor First	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> First a -> First b # (<$) :: a -> First b -> First a #
MonadFix First	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mfix :: (a -> First a) -> First a #
Applicative First	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> First a # (<>) :: First (a -> b) -> First a -> First b # liftA2 :: (a -> b -> c) -> First a -> First b -> First c # (>) :: First a -> First b -> First b # (<*) :: First a -> First b -> First a #
Foldable First	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # toList :: First a -> [a] # null :: First a -> Bool # length :: First a -> Int # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # sum :: Num a => First a -> a # product :: Num a => First a -> a #
Traversable First	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> First a -> f (First b) # sequenceA :: Applicative f => First (f a) -> f (First a) # mapM :: Monad m => (a -> m b) -> First a -> m (First b) # sequence :: Monad m => First (m a) -> m (First a) #
Apply First
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: First (a -> b) -> First a -> First b (.>) :: First a -> First b -> First b (<.) :: First a -> First b -> First a liftF2 :: (a -> b -> c) -> First a -> First b -> First c
Bind First
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: First a -> (a -> First b) -> First b join :: First (First a) -> First a
Traversable1 First
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> First a -> f (First b) # sequence1 :: Apply f => First (f b) -> f (First b)
ToJSON1 First
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> First a -> Value liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [First a] -> Value liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> First a -> Encoding liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [First a] -> Encoding
Bounded a => Bounded (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: First a # maxBound :: First a #
Enum a => Enum (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods succ :: First a -> First a # pred :: First a -> First a # toEnum :: Int -> First a # fromEnum :: First a -> Int # enumFrom :: First a -> [First a] # enumFromThen :: First a -> First a -> [First a] # enumFromTo :: First a -> First a -> [First a] # enumFromThenTo :: First a -> First a -> First a -> [First a] #
Eq a => Eq (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: First a -> First a -> Bool # (/=) :: First a -> First a -> Bool #
Data a => Data (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> First a -> c (First a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (First a) # toConstr :: First a -> Constr # dataTypeOf :: First a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (First a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (First a)) # gmapT :: (forall b. Data b => b -> b) -> First a -> First a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> First a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> First a -> r # gmapQ :: (forall d. Data d => d -> u) -> First a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> First a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> First a -> m (First a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> First a -> m (First a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> First a -> m (First a) #
Ord a => Ord (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: First a -> First a -> Ordering # (<) :: First a -> First a -> Bool # (<=) :: First a -> First a -> Bool # (>) :: First a -> First a -> Bool # (>=) :: First a -> First a -> Bool # max :: First a -> First a -> First a # min :: First a -> First a -> First a #
Read a => Read (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (First a) # readList :: ReadS [First a] # readPrec :: ReadPrec (First a) # readListPrec :: ReadPrec [First a] #
Show a => Show (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> First a -> ShowS # show :: First a -> String # showList :: [First a] -> ShowS #
Generic (First a)
Instance details Defined in Data.Semigroup Associated Types type Rep (First a) :: Type -> Type # Methods from :: First a -> Rep (First a) x # to :: Rep (First a) x -> First a #
Semigroup (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: First a -> First a -> First a # sconcat :: NonEmpty (First a) -> First a # stimes :: Integral b => b -> First a -> First a #
ToJSON a => ToJSON (First a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: First a -> Value toEncoding :: First a -> Encoding toJSONList :: [First a] -> Value toEncodingList :: [First a] -> Encoding
Wrapped (First a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (First a) :: Type # Methods _Wrapped' :: Iso' (First a) (Unwrapped (First a)) #
Newtype (First a)
Instance details Defined in Control.Newtype.Generics Associated Types type O (First a) :: Type Methods pack :: O (First a) -> First a unpack :: First a -> O (First a)
Generic1 First
Instance details Defined in Data.Semigroup Associated Types type Rep1 First :: k -> Type # Methods from1 :: First a -> Rep1 First a # to1 :: Rep1 First a -> First a #
t ~ First b => Rewrapped (First a) t
Instance details Defined in Control.Lens.Wrapped
type Rep (First a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup type Rep (First a) = D1 (MetaData "First" "Data.Semigroup" "base" True) (C1 (MetaCons "First" PrefixI True) (S1 (MetaSel (Just "getFirst") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Unwrapped (First a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (First a) = a
type O (First a)
Instance details Defined in Control.Newtype.Generics type O (First a) = a
type Rep1 First	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup type Rep1 First = D1 (MetaData "First" "Data.Semigroup" "base" True) (C1 (MetaCons "First" PrefixI True) (S1 (MetaSel (Just "getFirst") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

newtype Last a #

Use Option (Last a) to get the behavior of Last from Data.Monoid

Constructors

Last
Fields getLast :: a

Instances

Monad Last	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: Last a -> (a -> Last b) -> Last b # (>>) :: Last a -> Last b -> Last b # return :: a -> Last a # fail :: String -> Last a #
Functor Last	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> Last a -> Last b # (<$) :: a -> Last b -> Last a #
MonadFix Last	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mfix :: (a -> Last a) -> Last a #
Applicative Last	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Last a # (<>) :: Last (a -> b) -> Last a -> Last b # liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c # (>) :: Last a -> Last b -> Last b # (<*) :: Last a -> Last b -> Last a #
Foldable Last	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fold :: Monoid m => Last m -> m # foldMap :: Monoid m => (a -> m) -> Last a -> m # foldr :: (a -> b -> b) -> b -> Last a -> b # foldr' :: (a -> b -> b) -> b -> Last a -> b # foldl :: (b -> a -> b) -> b -> Last a -> b # foldl' :: (b -> a -> b) -> b -> Last a -> b # foldr1 :: (a -> a -> a) -> Last a -> a # foldl1 :: (a -> a -> a) -> Last a -> a # toList :: Last a -> [a] # null :: Last a -> Bool # length :: Last a -> Int # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # minimum :: Ord a => Last a -> a # sum :: Num a => Last a -> a # product :: Num a => Last a -> a #
Traversable Last	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> Last a -> f (Last b) # sequenceA :: Applicative f => Last (f a) -> f (Last a) # mapM :: Monad m => (a -> m b) -> Last a -> m (Last b) # sequence :: Monad m => Last (m a) -> m (Last a) #
Apply Last
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Last (a -> b) -> Last a -> Last b (.>) :: Last a -> Last b -> Last b (<.) :: Last a -> Last b -> Last a liftF2 :: (a -> b -> c) -> Last a -> Last b -> Last c
Bind Last
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Last a -> (a -> Last b) -> Last b join :: Last (Last a) -> Last a
Traversable1 Last
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Last a -> f (Last b) # sequence1 :: Apply f => Last (f b) -> f (Last b)
ToJSON1 Last
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Last a -> Value liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Last a] -> Value liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Last a -> Encoding liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Last a] -> Encoding
Bounded a => Bounded (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: Last a # maxBound :: Last a #
Enum a => Enum (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods succ :: Last a -> Last a # pred :: Last a -> Last a # toEnum :: Int -> Last a # fromEnum :: Last a -> Int # enumFrom :: Last a -> [Last a] # enumFromThen :: Last a -> Last a -> [Last a] # enumFromTo :: Last a -> Last a -> [Last a] # enumFromThenTo :: Last a -> Last a -> Last a -> [Last a] #
Eq a => Eq (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Last a -> Last a -> Bool # (/=) :: Last a -> Last a -> Bool #
Data a => Data (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Last a -> c (Last a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Last a) # toConstr :: Last a -> Constr # dataTypeOf :: Last a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Last a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Last a)) # gmapT :: (forall b. Data b => b -> b) -> Last a -> Last a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Last a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Last a -> r # gmapQ :: (forall d. Data d => d -> u) -> Last a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Last a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Last a -> m (Last a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Last a -> m (Last a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Last a -> m (Last a) #
Ord a => Ord (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Last a -> Last a -> Ordering # (<) :: Last a -> Last a -> Bool # (<=) :: Last a -> Last a -> Bool # (>) :: Last a -> Last a -> Bool # (>=) :: Last a -> Last a -> Bool # max :: Last a -> Last a -> Last a # min :: Last a -> Last a -> Last a #
Read a => Read (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Last a) # readList :: ReadS [Last a] # readPrec :: ReadPrec (Last a) # readListPrec :: ReadPrec [Last a] #
Show a => Show (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Last a -> ShowS # show :: Last a -> String # showList :: [Last a] -> ShowS #
Generic (Last a)
Instance details Defined in Data.Semigroup Associated Types type Rep (Last a) :: Type -> Type # Methods from :: Last a -> Rep (Last a) x # to :: Rep (Last a) x -> Last a #
Semigroup (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Last a -> Last a -> Last a # sconcat :: NonEmpty (Last a) -> Last a # stimes :: Integral b => b -> Last a -> Last a #
ToJSON a => ToJSON (Last a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Last a -> Value toEncoding :: Last a -> Encoding toJSONList :: [Last a] -> Value toEncodingList :: [Last a] -> Encoding
Wrapped (Last a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Last a) :: Type # Methods _Wrapped' :: Iso' (Last a) (Unwrapped (Last a)) #
Newtype (Last a)
Instance details Defined in Control.Newtype.Generics Associated Types type O (Last a) :: Type Methods pack :: O (Last a) -> Last a unpack :: Last a -> O (Last a)
Generic1 Last
Instance details Defined in Data.Semigroup Associated Types type Rep1 Last :: k -> Type # Methods from1 :: Last a -> Rep1 Last a # to1 :: Rep1 Last a -> Last a #
t ~ Last b => Rewrapped (Last a) t
Instance details Defined in Control.Lens.Wrapped
type Rep (Last a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup type Rep (Last a) = D1 (MetaData "Last" "Data.Semigroup" "base" True) (C1 (MetaCons "Last" PrefixI True) (S1 (MetaSel (Just "getLast") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Unwrapped (Last a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Last a) = a
type O (Last a)
Instance details Defined in Control.Newtype.Generics type O (Last a) = a
type Rep1 Last	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup type Rep1 Last = D1 (MetaData "Last" "Data.Semigroup" "base" True) (C1 (MetaCons "Last" PrefixI True) (S1 (MetaSel (Just "getLast") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

newtype WrappedMonoid m #

Provide a Semigroup for an arbitrary Monoid.

NOTE: This is not needed anymore since Semigroup became a superclass of Monoid in base-4.11 and this newtype be deprecated at some point in the future.

Constructors

WrapMonoid
Fields unwrapMonoid :: m

Instances

ToJSON1 WrappedMonoid
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> WrappedMonoid a -> Value liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [WrappedMonoid a] -> Value liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> WrappedMonoid a -> Encoding liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [WrappedMonoid a] -> Encoding
Bounded m => Bounded (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods minBound :: WrappedMonoid m # maxBound :: WrappedMonoid m #
Enum a => Enum (WrappedMonoid a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods succ :: WrappedMonoid a -> WrappedMonoid a # pred :: WrappedMonoid a -> WrappedMonoid a # toEnum :: Int -> WrappedMonoid a # fromEnum :: WrappedMonoid a -> Int # enumFrom :: WrappedMonoid a -> [WrappedMonoid a] # enumFromThen :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # enumFromTo :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # enumFromThenTo :: WrappedMonoid a -> WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] #
Eq m => Eq (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (/=) :: WrappedMonoid m -> WrappedMonoid m -> Bool #
Data m => Data (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> WrappedMonoid m -> c (WrappedMonoid m) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (WrappedMonoid m) # toConstr :: WrappedMonoid m -> Constr # dataTypeOf :: WrappedMonoid m -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (WrappedMonoid m)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (WrappedMonoid m)) # gmapT :: (forall b. Data b => b -> b) -> WrappedMonoid m -> WrappedMonoid m # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> WrappedMonoid m -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> WrappedMonoid m -> r # gmapQ :: (forall d. Data d => d -> u) -> WrappedMonoid m -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> WrappedMonoid m -> u # gmapM :: Monad m0 => (forall d. Data d => d -> m0 d) -> WrappedMonoid m -> m0 (WrappedMonoid m) # gmapMp :: MonadPlus m0 => (forall d. Data d => d -> m0 d) -> WrappedMonoid m -> m0 (WrappedMonoid m) # gmapMo :: MonadPlus m0 => (forall d. Data d => d -> m0 d) -> WrappedMonoid m -> m0 (WrappedMonoid m) #
Ord m => Ord (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: WrappedMonoid m -> WrappedMonoid m -> Ordering # (<) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (<=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # max :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # min :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m #
Read m => Read (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (WrappedMonoid m) # readList :: ReadS [WrappedMonoid m] # readPrec :: ReadPrec (WrappedMonoid m) # readListPrec :: ReadPrec [WrappedMonoid m] #
Show m => Show (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> WrappedMonoid m -> ShowS # show :: WrappedMonoid m -> String # showList :: [WrappedMonoid m] -> ShowS #
Generic (WrappedMonoid m)
Instance details Defined in Data.Semigroup Associated Types type Rep (WrappedMonoid m) :: Type -> Type # Methods from :: WrappedMonoid m -> Rep (WrappedMonoid m) x # to :: Rep (WrappedMonoid m) x -> WrappedMonoid m #
Monoid m => Semigroup (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # sconcat :: NonEmpty (WrappedMonoid m) -> WrappedMonoid m # stimes :: Integral b => b -> WrappedMonoid m -> WrappedMonoid m #
Monoid m => Monoid (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: WrappedMonoid m # mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # mconcat :: [WrappedMonoid m] -> WrappedMonoid m #
ToJSON a => ToJSON (WrappedMonoid a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: WrappedMonoid a -> Value toEncoding :: WrappedMonoid a -> Encoding toJSONList :: [WrappedMonoid a] -> Value toEncodingList :: [WrappedMonoid a] -> Encoding
Wrapped (WrappedMonoid a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (WrappedMonoid a) :: Type # Methods _Wrapped' :: Iso' (WrappedMonoid a) (Unwrapped (WrappedMonoid a)) #
Newtype (WrappedMonoid m)
Instance details Defined in Control.Newtype.Generics Associated Types type O (WrappedMonoid m) :: Type Methods pack :: O (WrappedMonoid m) -> WrappedMonoid m unpack :: WrappedMonoid m -> O (WrappedMonoid m)
Generic1 WrappedMonoid
Instance details Defined in Data.Semigroup Associated Types type Rep1 WrappedMonoid :: k -> Type # Methods from1 :: WrappedMonoid a -> Rep1 WrappedMonoid a # to1 :: Rep1 WrappedMonoid a -> WrappedMonoid a #
t ~ WrappedMonoid b => Rewrapped (WrappedMonoid a) t
Instance details Defined in Control.Lens.Wrapped
type Rep (WrappedMonoid m)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup type Rep (WrappedMonoid m) = D1 (MetaData "WrappedMonoid" "Data.Semigroup" "base" True) (C1 (MetaCons "WrapMonoid" PrefixI True) (S1 (MetaSel (Just "unwrapMonoid") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 m)))
type Unwrapped (WrappedMonoid a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (WrappedMonoid a) = a
type O (WrappedMonoid m)
Instance details Defined in Control.Newtype.Generics type O (WrappedMonoid m) = m
type Rep1 WrappedMonoid	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup type Rep1 WrappedMonoid = D1 (MetaData "WrappedMonoid" "Data.Semigroup" "base" True) (C1 (MetaCons "WrapMonoid" PrefixI True) (S1 (MetaSel (Just "unwrapMonoid") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

newtype Option a #

Option is effectively Maybe with a better instance of Monoid, built off of an underlying Semigroup instead of an underlying Monoid.

Ideally, this type would not exist at all and we would just fix the Monoid instance of Maybe.

In GHC 8.4 and higher, the Monoid instance for Maybe has been corrected to lift a Semigroup instance instead of a Monoid instance. Consequently, this type is no longer useful. It will be marked deprecated in GHC 8.8 and removed in GHC 8.10.

Constructors

Option
Fields getOption :: Maybe a

Instances

Monad Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (>>=) :: Option a -> (a -> Option b) -> Option b # (>>) :: Option a -> Option b -> Option b # return :: a -> Option a # fail :: String -> Option a #
Functor Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fmap :: (a -> b) -> Option a -> Option b # (<$) :: a -> Option b -> Option a #
MonadFix Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mfix :: (a -> Option a) -> Option a #
Applicative Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Option a # (<>) :: Option (a -> b) -> Option a -> Option b # liftA2 :: (a -> b -> c) -> Option a -> Option b -> Option c # (>) :: Option a -> Option b -> Option b # (<*) :: Option a -> Option b -> Option a #
Foldable Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods fold :: Monoid m => Option m -> m # foldMap :: Monoid m => (a -> m) -> Option a -> m # foldr :: (a -> b -> b) -> b -> Option a -> b # foldr' :: (a -> b -> b) -> b -> Option a -> b # foldl :: (b -> a -> b) -> b -> Option a -> b # foldl' :: (b -> a -> b) -> b -> Option a -> b # foldr1 :: (a -> a -> a) -> Option a -> a # foldl1 :: (a -> a -> a) -> Option a -> a # toList :: Option a -> [a] # null :: Option a -> Bool # length :: Option a -> Int # elem :: Eq a => a -> Option a -> Bool # maximum :: Ord a => Option a -> a # minimum :: Ord a => Option a -> a # sum :: Num a => Option a -> a # product :: Num a => Option a -> a #
Traversable Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods traverse :: Applicative f => (a -> f b) -> Option a -> f (Option b) # sequenceA :: Applicative f => Option (f a) -> f (Option a) # mapM :: Monad m => (a -> m b) -> Option a -> m (Option b) # sequence :: Monad m => Option (m a) -> m (Option a) #
Alternative Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods empty :: Option a # (<\|>) :: Option a -> Option a -> Option a # some :: Option a -> Option [a] # many :: Option a -> Option [a] #
MonadPlus Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mzero :: Option a # mplus :: Option a -> Option a -> Option a #
Apply Option
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Option (a -> b) -> Option a -> Option b (.>) :: Option a -> Option b -> Option b (<.) :: Option a -> Option b -> Option a liftF2 :: (a -> b -> c) -> Option a -> Option b -> Option c
Bind Option
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Option a -> (a -> Option b) -> Option b join :: Option (Option a) -> Option a
ToJSON1 Option
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Option a -> Value liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Option a] -> Value liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Option a -> Encoding liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Option a] -> Encoding
Eq a => Eq (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (==) :: Option a -> Option a -> Bool # (/=) :: Option a -> Option a -> Bool #
Data a => Data (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Option a -> c (Option a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Option a) # toConstr :: Option a -> Constr # dataTypeOf :: Option a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Option a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Option a)) # gmapT :: (forall b. Data b => b -> b) -> Option a -> Option a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Option a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Option a -> r # gmapQ :: (forall d. Data d => d -> u) -> Option a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Option a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Option a -> m (Option a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Option a -> m (Option a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Option a -> m (Option a) #
Ord a => Ord (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods compare :: Option a -> Option a -> Ordering # (<) :: Option a -> Option a -> Bool # (<=) :: Option a -> Option a -> Bool # (>) :: Option a -> Option a -> Bool # (>=) :: Option a -> Option a -> Bool # max :: Option a -> Option a -> Option a # min :: Option a -> Option a -> Option a #
Read a => Read (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (Option a) # readList :: ReadS [Option a] # readPrec :: ReadPrec (Option a) # readListPrec :: ReadPrec [Option a] #
Show a => Show (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods showsPrec :: Int -> Option a -> ShowS # show :: Option a -> String # showList :: [Option a] -> ShowS #
Generic (Option a)
Instance details Defined in Data.Semigroup Associated Types type Rep (Option a) :: Type -> Type # Methods from :: Option a -> Rep (Option a) x # to :: Rep (Option a) x -> Option a #
Semigroup a => Semigroup (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods (<>) :: Option a -> Option a -> Option a # sconcat :: NonEmpty (Option a) -> Option a # stimes :: Integral b => b -> Option a -> Option a #
Semigroup a => Monoid (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods mempty :: Option a # mappend :: Option a -> Option a -> Option a # mconcat :: [Option a] -> Option a #
ToJSON a => ToJSON (Option a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Option a -> Value toEncoding :: Option a -> Encoding toJSONList :: [Option a] -> Value toEncodingList :: [Option a] -> Encoding
Wrapped (Option a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Option a) :: Type # Methods _Wrapped' :: Iso' (Option a) (Unwrapped (Option a)) #
Newtype (Option a)
Instance details Defined in Control.Newtype.Generics Associated Types type O (Option a) :: Type Methods pack :: O (Option a) -> Option a unpack :: Option a -> O (Option a)
Generic1 Option
Instance details Defined in Data.Semigroup Associated Types type Rep1 Option :: k -> Type # Methods from1 :: Option a -> Rep1 Option a # to1 :: Rep1 Option a -> Option a #
t ~ Option b => Rewrapped (Option a) t
Instance details Defined in Control.Lens.Wrapped
(Action a a', Action (SM a) l) => Action (SM a) (Option a', l)
Instance details Defined in Data.Monoid.MList Methods act :: SM a -> (Option a', l) -> (Option a', l)
MList l => MList (a ::: l)
Instance details Defined in Data.Monoid.MList Methods empty :: a ::: l
MList t => (a ::: t) :>: a
Instance details Defined in Data.Monoid.MList Methods inj :: a -> a ::: t get :: (a ::: t) -> Option a alt :: (Option a -> Option a) -> (a ::: t) -> a ::: t
t :>: a => (b ::: t) :>: a
Instance details Defined in Data.Monoid.MList Methods inj :: a -> b ::: t get :: (b ::: t) -> Option a alt :: (Option a -> Option a) -> (b ::: t) -> b ::: t
(Metric v, OrderedField n) => Measured (SegMeasure v n) (SegMeasure v n)
Instance details Defined in Diagrams.Segment Methods measure :: SegMeasure v n -> SegMeasure v n
(Floating n, Ord n, Metric v) => Measured (SegMeasure v n) (SegTree v n)
Instance details Defined in Diagrams.Trail Methods measure :: SegTree v n -> SegMeasure v n
(OrderedField n, Metric v) => Measured (SegMeasure v n) (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods measure :: Segment Closed v n -> SegMeasure v n
type Rep (Option a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup type Rep (Option a) = D1 (MetaData "Option" "Data.Semigroup" "base" True) (C1 (MetaCons "Option" PrefixI True) (S1 (MetaSel (Just "getOption") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Maybe a))))
type N (Option a)
Instance details Defined in Diagrams.Core.V type N (Option a) = N a
type V (Option a)
Instance details Defined in Diagrams.Core.V type V (Option a) = V a
type Unwrapped (Option a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Option a) = Maybe a
type O (Option a)
Instance details Defined in Control.Newtype.Generics type O (Option a) = Maybe a
type Rep1 Option	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup type Rep1 Option = D1 (MetaData "Option" "Data.Semigroup" "base" True) (C1 (MetaCons "Option" PrefixI True) (S1 (MetaSel (Just "getOption") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 Maybe)))

class Bifunctor (p :: Type -> Type -> Type) where #

A bifunctor is a type constructor that takes two type arguments and is a functor in both arguments. That is, unlike with Functor, a type constructor such as Either does not need to be partially applied for a Bifunctor instance, and the methods in this class permit mapping functions over the Left value or the Right value, or both at the same time.

Formally, the class Bifunctor represents a bifunctor from Hask -> Hask.

Intuitively it is a bifunctor where both the first and second arguments are covariant.

You can define a Bifunctor by either defining bimap or by defining both first and second.

If you supply bimap, you should ensure that:

bimap id id ≡ id

If you supply first and second, ensure:

first id ≡ id
second id ≡ id

If you supply both, you should also ensure:

bimap f g ≡ first f . second g

These ensure by parametricity:

bimap  (f . g) (h . i) ≡ bimap f h . bimap g i
first  (f . g) ≡ first  f . first  g
second (f . g) ≡ second f . second g

Since: base-4.8.0.0

Minimal complete definition

bimap | first, second

Methods

bimap :: (a -> b) -> (c -> d) -> p a c -> p b d #

Map over both arguments at the same time.

bimap f g ≡ first f . second g

Examples

Expand

>>> bimap toUpper (+1) ('j', 3)
('J',4)

>>> bimap toUpper (+1) (Left 'j')
Left 'J'

>>> bimap toUpper (+1) (Right 3)
Right 4

Instances

Bifunctor Either	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> Either a c -> Either b d # first :: (a -> b) -> Either a c -> Either b c # second :: (b -> c) -> Either a b -> Either a c #
Bifunctor (,)	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> (a, c) -> (b, d) # first :: (a -> b) -> (a, c) -> (b, c) # second :: (b -> c) -> (a, b) -> (a, c) #
Bifunctor Arg	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods bimap :: (a -> b) -> (c -> d) -> Arg a c -> Arg b d # first :: (a -> b) -> Arg a c -> Arg b c # second :: (b -> c) -> Arg a b -> Arg a c #
Bifunctor ((,,) x1)	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> (x1, a, c) -> (x1, b, d) # first :: (a -> b) -> (x1, a, c) -> (x1, b, c) # second :: (b -> c) -> (x1, a, b) -> (x1, a, c) #
Bifunctor (Const :: Type -> Type -> Type)	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> Const a c -> Const b d # first :: (a -> b) -> Const a c -> Const b c # second :: (b -> c) -> Const a b -> Const a c #
Functor f => Bifunctor (FreeF f)
Instance details Defined in Control.Monad.Trans.Free Methods bimap :: (a -> b) -> (c -> d) -> FreeF f a c -> FreeF f b d # first :: (a -> b) -> FreeF f a c -> FreeF f b c # second :: (b -> c) -> FreeF f a b -> FreeF f a c #
Bifunctor (Tagged :: Type -> Type -> Type)
Instance details Defined in Data.Tagged Methods bimap :: (a -> b) -> (c -> d) -> Tagged a c -> Tagged b d # first :: (a -> b) -> Tagged a c -> Tagged b c # second :: (b -> c) -> Tagged a b -> Tagged a c #
Functor f => Bifunctor (CofreeF f)
Instance details Defined in Control.Comonad.Trans.Cofree Methods bimap :: (a -> b) -> (c -> d) -> CofreeF f a c -> CofreeF f b d # first :: (a -> b) -> CofreeF f a c -> CofreeF f b c # second :: (b -> c) -> CofreeF f a b -> CofreeF f a c #
Functor f => Bifunctor (AlongsideLeft f)
Instance details Defined in Control.Lens.Internal.Getter Methods bimap :: (a -> b) -> (c -> d) -> AlongsideLeft f a c -> AlongsideLeft f b d # first :: (a -> b) -> AlongsideLeft f a c -> AlongsideLeft f b c # second :: (b -> c) -> AlongsideLeft f a b -> AlongsideLeft f a c #
Functor f => Bifunctor (AlongsideRight f)
Instance details Defined in Control.Lens.Internal.Getter Methods bimap :: (a -> b) -> (c -> d) -> AlongsideRight f a c -> AlongsideRight f b d # first :: (a -> b) -> AlongsideRight f a c -> AlongsideRight f b c # second :: (b -> c) -> AlongsideRight f a b -> AlongsideRight f a c #
Bifunctor (K1 i :: Type -> Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> K1 i a c -> K1 i b d # first :: (a -> b) -> K1 i a c -> K1 i b c # second :: (b -> c) -> K1 i a b -> K1 i a c #
Bifunctor ((,,,) x1 x2)	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> (x1, x2, a, c) -> (x1, x2, b, d) # first :: (a -> b) -> (x1, x2, a, c) -> (x1, x2, b, c) # second :: (b -> c) -> (x1, x2, a, b) -> (x1, x2, a, c) #
Bifunctor ((,,,,) x1 x2 x3)	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> (x1, x2, x3, a, c) -> (x1, x2, x3, b, d) # first :: (a -> b) -> (x1, x2, x3, a, c) -> (x1, x2, x3, b, c) # second :: (b -> c) -> (x1, x2, x3, a, b) -> (x1, x2, x3, a, c) #
Functor f => Bifunctor (Clown f :: Type -> Type -> Type)
Instance details Defined in Data.Bifunctor.Clown Methods bimap :: (a -> b) -> (c -> d) -> Clown f a c -> Clown f b d # first :: (a -> b) -> Clown f a c -> Clown f b c # second :: (b -> c) -> Clown f a b -> Clown f a c #
Bifunctor p => Bifunctor (Flip p)
Instance details Defined in Data.Bifunctor.Flip Methods bimap :: (a -> b) -> (c -> d) -> Flip p a c -> Flip p b d # first :: (a -> b) -> Flip p a c -> Flip p b c # second :: (b -> c) -> Flip p a b -> Flip p a c #
Functor g => Bifunctor (Joker g :: Type -> Type -> Type)
Instance details Defined in Data.Bifunctor.Joker Methods bimap :: (a -> b) -> (c -> d) -> Joker g a c -> Joker g b d # first :: (a -> b) -> Joker g a c -> Joker g b c # second :: (b -> c) -> Joker g a b -> Joker g a c #
Bifunctor p => Bifunctor (WrappedBifunctor p)
Instance details Defined in Data.Bifunctor.Wrapped Methods bimap :: (a -> b) -> (c -> d) -> WrappedBifunctor p a c -> WrappedBifunctor p b d # first :: (a -> b) -> WrappedBifunctor p a c -> WrappedBifunctor p b c # second :: (b -> c) -> WrappedBifunctor p a b -> WrappedBifunctor p a c #
Bifunctor ((,,,,,) x1 x2 x3 x4)	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> (x1, x2, x3, x4, a, c) -> (x1, x2, x3, x4, b, d) # first :: (a -> b) -> (x1, x2, x3, x4, a, c) -> (x1, x2, x3, x4, b, c) # second :: (b -> c) -> (x1, x2, x3, x4, a, b) -> (x1, x2, x3, x4, a, c) #
(Bifunctor f, Bifunctor g) => Bifunctor (Product f g)
Instance details Defined in Data.Bifunctor.Product Methods bimap :: (a -> b) -> (c -> d) -> Product f g a c -> Product f g b d # first :: (a -> b) -> Product f g a c -> Product f g b c # second :: (b -> c) -> Product f g a b -> Product f g a c #
(Bifunctor p, Bifunctor q) => Bifunctor (Sum p q)
Instance details Defined in Data.Bifunctor.Sum Methods bimap :: (a -> b) -> (c -> d) -> Sum p q a c -> Sum p q b d # first :: (a -> b) -> Sum p q a c -> Sum p q b c # second :: (b -> c) -> Sum p q a b -> Sum p q a c #
Bifunctor ((,,,,,,) x1 x2 x3 x4 x5)	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> (x1, x2, x3, x4, x5, a, c) -> (x1, x2, x3, x4, x5, b, d) # first :: (a -> b) -> (x1, x2, x3, x4, x5, a, c) -> (x1, x2, x3, x4, x5, b, c) # second :: (b -> c) -> (x1, x2, x3, x4, x5, a, b) -> (x1, x2, x3, x4, x5, a, c) #
(Functor f, Bifunctor p) => Bifunctor (Tannen f p)
Instance details Defined in Data.Bifunctor.Tannen Methods bimap :: (a -> b) -> (c -> d) -> Tannen f p a c -> Tannen f p b d # first :: (a -> b) -> Tannen f p a c -> Tannen f p b c # second :: (b -> c) -> Tannen f p a b -> Tannen f p a c #
(Bifunctor p, Functor f, Functor g) => Bifunctor (Biff p f g)
Instance details Defined in Data.Bifunctor.Biff Methods bimap :: (a -> b) -> (c -> d) -> Biff p f g a c -> Biff p f g b d # first :: (a -> b) -> Biff p f g a c -> Biff p f g b c # second :: (b -> c) -> Biff p f g a b -> Biff p f g a c #

newtype Identity a #

Identity functor and monad. (a non-strict monad)

Since: base-4.8.0.0

Constructors

Identity
Fields runIdentity :: a

Instances

Monad Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods (>>=) :: Identity a -> (a -> Identity b) -> Identity b # (>>) :: Identity a -> Identity b -> Identity b # return :: a -> Identity a # fail :: String -> Identity a #
Functor Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods fmap :: (a -> b) -> Identity a -> Identity b # (<$) :: a -> Identity b -> Identity a #
MonadFix Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods mfix :: (a -> Identity a) -> Identity a #
Applicative Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods pure :: a -> Identity a # (<>) :: Identity (a -> b) -> Identity a -> Identity b # liftA2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c # (>) :: Identity a -> Identity b -> Identity b # (<*) :: Identity a -> Identity b -> Identity a #
Foldable Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods fold :: Monoid m => Identity m -> m # foldMap :: Monoid m => (a -> m) -> Identity a -> m # foldr :: (a -> b -> b) -> b -> Identity a -> b # foldr' :: (a -> b -> b) -> b -> Identity a -> b # foldl :: (b -> a -> b) -> b -> Identity a -> b # foldl' :: (b -> a -> b) -> b -> Identity a -> b # foldr1 :: (a -> a -> a) -> Identity a -> a # foldl1 :: (a -> a -> a) -> Identity a -> a # toList :: Identity a -> [a] # null :: Identity a -> Bool # length :: Identity a -> Int # elem :: Eq a => a -> Identity a -> Bool # maximum :: Ord a => Identity a -> a # minimum :: Ord a => Identity a -> a # sum :: Num a => Identity a -> a # product :: Num a => Identity a -> a #
Traversable Identity	Since: base-4.9.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Identity a -> f (Identity b) # sequenceA :: Applicative f => Identity (f a) -> f (Identity a) # mapM :: Monad m => (a -> m b) -> Identity a -> m (Identity b) # sequence :: Monad m => Identity (m a) -> m (Identity a) #
Apply Identity
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Identity (a -> b) -> Identity a -> Identity b (.>) :: Identity a -> Identity b -> Identity b (<.) :: Identity a -> Identity b -> Identity a liftF2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c
Bind Identity
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Identity a -> (a -> Identity b) -> Identity b join :: Identity (Identity a) -> Identity a
Affine Identity
Instance details Defined in Linear.Affine Associated Types type Diff Identity :: Type -> Type # Methods (.-.) :: Num a => Identity a -> Identity a -> Diff Identity a # (.+^) :: Num a => Identity a -> Diff Identity a -> Identity a # (.-^) :: Num a => Identity a -> Diff Identity a -> Identity a #
Metric Identity
Instance details Defined in Linear.Metric Methods dot :: Num a => Identity a -> Identity a -> a # quadrance :: Num a => Identity a -> a # qd :: Num a => Identity a -> Identity a -> a # distance :: Floating a => Identity a -> Identity a -> a # norm :: Floating a => Identity a -> a # signorm :: Floating a => Identity a -> Identity a #
R1 Identity
Instance details Defined in Linear.V1 Methods _x :: Lens' (Identity a) a #
Additive Identity
Instance details Defined in Linear.Vector Methods zero :: Num a => Identity a # (^+^) :: Num a => Identity a -> Identity a -> Identity a # (^-^) :: Num a => Identity a -> Identity a -> Identity a # lerp :: Num a => a -> Identity a -> Identity a -> Identity a # liftU2 :: (a -> a -> a) -> Identity a -> Identity a -> Identity a # liftI2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c #
Settable Identity
Instance details Defined in Control.Lens.Internal.Setter Methods untainted :: Identity a -> a untaintedDot :: Profunctor p => p a (Identity b) -> p a b taintedDot :: Profunctor p => p a b -> p a (Identity b)
Traversable1 Identity
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Identity a -> f (Identity b) # sequence1 :: Apply f => Identity (f b) -> f (Identity b)
Representable Identity
Instance details Defined in Data.Functor.Rep Associated Types type Rep Identity :: Type Methods tabulate :: (Rep Identity -> a) -> Identity a index :: Identity a -> Rep Identity -> a
ToJSON1 Identity
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Identity a -> Value liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Identity a] -> Value liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Identity a -> Encoding liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Identity a] -> Encoding
MonadBaseControl Identity Identity
Instance details Defined in Control.Monad.Trans.Control Associated Types type StM Identity a :: Type Methods liftBaseWith :: (RunInBase Identity Identity -> Identity a) -> Identity a restoreM :: StM Identity a -> Identity a
Monad m => Lift Identity m
Instance details Defined in Data.Random.Lift Methods lift :: Identity a -> m a
FoldableWithIndex () Identity
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (() -> a -> m) -> Identity a -> m # ifolded :: IndexedFold () (Identity a) a # ifoldr :: (() -> a -> b -> b) -> b -> Identity a -> b # ifoldl :: (() -> b -> a -> b) -> b -> Identity a -> b # ifoldr' :: (() -> a -> b -> b) -> b -> Identity a -> b # ifoldl' :: (() -> b -> a -> b) -> b -> Identity a -> b #
FunctorWithIndex () Identity
Instance details Defined in Control.Lens.Indexed Methods imap :: (() -> a -> b) -> Identity a -> Identity b # imapped :: IndexedSetter () (Identity a) (Identity b) a b #
TraversableWithIndex () Identity
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (() -> a -> f b) -> Identity a -> f (Identity b) # itraversed :: IndexedTraversal () (Identity a) (Identity b) a b #
Cosieve ReifiedGetter Identity
Instance details Defined in Control.Lens.Reified Methods cosieve :: ReifiedGetter a b -> Identity a -> b
Sieve ReifiedGetter Identity
Instance details Defined in Control.Lens.Reified Methods sieve :: ReifiedGetter a b -> a -> Identity b
MonadTrans t => Lift Identity (t Identity)
Instance details Defined in Data.Random.Lift Methods lift :: Identity a -> t Identity a
Bounded a => Bounded (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods minBound :: Identity a # maxBound :: Identity a #
Enum a => Enum (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods succ :: Identity a -> Identity a # pred :: Identity a -> Identity a # toEnum :: Int -> Identity a # fromEnum :: Identity a -> Int # enumFrom :: Identity a -> [Identity a] # enumFromThen :: Identity a -> Identity a -> [Identity a] # enumFromTo :: Identity a -> Identity a -> [Identity a] # enumFromThenTo :: Identity a -> Identity a -> Identity a -> [Identity a] #
Eq a => Eq (Identity a)	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods (==) :: Identity a -> Identity a -> Bool # (/=) :: Identity a -> Identity a -> Bool #
Floating a => Floating (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods pi :: Identity a # exp :: Identity a -> Identity a # log :: Identity a -> Identity a # sqrt :: Identity a -> Identity a # (**) :: Identity a -> Identity a -> Identity a # logBase :: Identity a -> Identity a -> Identity a # sin :: Identity a -> Identity a # cos :: Identity a -> Identity a # tan :: Identity a -> Identity a # asin :: Identity a -> Identity a # acos :: Identity a -> Identity a # atan :: Identity a -> Identity a # sinh :: Identity a -> Identity a # cosh :: Identity a -> Identity a # tanh :: Identity a -> Identity a # asinh :: Identity a -> Identity a # acosh :: Identity a -> Identity a # atanh :: Identity a -> Identity a # log1p :: Identity a -> Identity a # expm1 :: Identity a -> Identity a # log1pexp :: Identity a -> Identity a # log1mexp :: Identity a -> Identity a #
Fractional a => Fractional (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods (/) :: Identity a -> Identity a -> Identity a # recip :: Identity a -> Identity a # fromRational :: Rational -> Identity a #
Integral a => Integral (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods quot :: Identity a -> Identity a -> Identity a # rem :: Identity a -> Identity a -> Identity a # div :: Identity a -> Identity a -> Identity a # mod :: Identity a -> Identity a -> Identity a # quotRem :: Identity a -> Identity a -> (Identity a, Identity a) # divMod :: Identity a -> Identity a -> (Identity a, Identity a) # toInteger :: Identity a -> Integer #
Num a => Num (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods (+) :: Identity a -> Identity a -> Identity a # (-) :: Identity a -> Identity a -> Identity a # (*) :: Identity a -> Identity a -> Identity a # negate :: Identity a -> Identity a # abs :: Identity a -> Identity a # signum :: Identity a -> Identity a # fromInteger :: Integer -> Identity a #
Ord a => Ord (Identity a)	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods compare :: Identity a -> Identity a -> Ordering # (<) :: Identity a -> Identity a -> Bool # (<=) :: Identity a -> Identity a -> Bool # (>) :: Identity a -> Identity a -> Bool # (>=) :: Identity a -> Identity a -> Bool # max :: Identity a -> Identity a -> Identity a # min :: Identity a -> Identity a -> Identity a #
Read a => Read (Identity a)	This instance would be equivalent to the derived instances of the `Identity` newtype if the `runIdentity` field were removed Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods readsPrec :: Int -> ReadS (Identity a) # readList :: ReadS [Identity a] # readPrec :: ReadPrec (Identity a) # readListPrec :: ReadPrec [Identity a] #
Real a => Real (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods toRational :: Identity a -> Rational #
RealFloat a => RealFloat (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods floatRadix :: Identity a -> Integer # floatDigits :: Identity a -> Int # floatRange :: Identity a -> (Int, Int) # decodeFloat :: Identity a -> (Integer, Int) # encodeFloat :: Integer -> Int -> Identity a # exponent :: Identity a -> Int # significand :: Identity a -> Identity a # scaleFloat :: Int -> Identity a -> Identity a # isNaN :: Identity a -> Bool # isInfinite :: Identity a -> Bool # isDenormalized :: Identity a -> Bool # isNegativeZero :: Identity a -> Bool # isIEEE :: Identity a -> Bool # atan2 :: Identity a -> Identity a -> Identity a #
RealFrac a => RealFrac (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods properFraction :: Integral b => Identity a -> (b, Identity a) # truncate :: Integral b => Identity a -> b # round :: Integral b => Identity a -> b # ceiling :: Integral b => Identity a -> b # floor :: Integral b => Identity a -> b #
Show a => Show (Identity a)	This instance would be equivalent to the derived instances of the `Identity` newtype if the `runIdentity` field were removed Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods showsPrec :: Int -> Identity a -> ShowS # show :: Identity a -> String # showList :: [Identity a] -> ShowS #
Ix a => Ix (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods range :: (Identity a, Identity a) -> [Identity a] # index :: (Identity a, Identity a) -> Identity a -> Int # unsafeIndex :: (Identity a, Identity a) -> Identity a -> Int inRange :: (Identity a, Identity a) -> Identity a -> Bool # rangeSize :: (Identity a, Identity a) -> Int # unsafeRangeSize :: (Identity a, Identity a) -> Int
IsString a => IsString (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.String Methods fromString :: String -> Identity a #
Generic (Identity a)
Instance details Defined in Data.Functor.Identity Associated Types type Rep (Identity a) :: Type -> Type # Methods from :: Identity a -> Rep (Identity a) x # to :: Rep (Identity a) x -> Identity a #
Semigroup a => Semigroup (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods (<>) :: Identity a -> Identity a -> Identity a # sconcat :: NonEmpty (Identity a) -> Identity a # stimes :: Integral b => b -> Identity a -> Identity a #
Monoid a => Monoid (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods mempty :: Identity a # mappend :: Identity a -> Identity a -> Identity a # mconcat :: [Identity a] -> Identity a #
Storable a => Storable (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods sizeOf :: Identity a -> Int # alignment :: Identity a -> Int # peekElemOff :: Ptr (Identity a) -> Int -> IO (Identity a) # pokeElemOff :: Ptr (Identity a) -> Int -> Identity a -> IO () # peekByteOff :: Ptr b -> Int -> IO (Identity a) # pokeByteOff :: Ptr b -> Int -> Identity a -> IO () # peek :: Ptr (Identity a) -> IO (Identity a) # poke :: Ptr (Identity a) -> Identity a -> IO () #
Bits a => Bits (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods (.&.) :: Identity a -> Identity a -> Identity a # (.\|.) :: Identity a -> Identity a -> Identity a # xor :: Identity a -> Identity a -> Identity a # complement :: Identity a -> Identity a # shift :: Identity a -> Int -> Identity a # rotate :: Identity a -> Int -> Identity a # zeroBits :: Identity a # bit :: Int -> Identity a # setBit :: Identity a -> Int -> Identity a # clearBit :: Identity a -> Int -> Identity a # complementBit :: Identity a -> Int -> Identity a # testBit :: Identity a -> Int -> Bool # bitSizeMaybe :: Identity a -> Maybe Int # bitSize :: Identity a -> Int # isSigned :: Identity a -> Bool # shiftL :: Identity a -> Int -> Identity a # unsafeShiftL :: Identity a -> Int -> Identity a # shiftR :: Identity a -> Int -> Identity a # unsafeShiftR :: Identity a -> Int -> Identity a # rotateL :: Identity a -> Int -> Identity a # rotateR :: Identity a -> Int -> Identity a # popCount :: Identity a -> Int #
FiniteBits a => FiniteBits (Identity a)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Identity Methods finiteBitSize :: Identity a -> Int # countLeadingZeros :: Identity a -> Int # countTrailingZeros :: Identity a -> Int #
Pretty a => Pretty (Identity a)
Instance details Defined in Data.Text.Prettyprint.Doc.Internal Methods pretty :: Identity a -> Doc ann prettyList :: [Identity a] -> Doc ann
ToJSON a => ToJSON (Identity a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Identity a -> Value toEncoding :: Identity a -> Encoding toJSONList :: [Identity a] -> Value toEncodingList :: [Identity a] -> Encoding
ToJSONKey a => ToJSONKey (Identity a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSONKey :: ToJSONKeyFunction (Identity a) toJSONKeyList :: ToJSONKeyFunction [Identity a]
Ixed (Identity a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Identity a) -> Traversal' (Identity a) (IxValue (Identity a)) #
Wrapped (Identity a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Identity a) :: Type # Methods _Wrapped' :: Iso' (Identity a) (Unwrapped (Identity a)) #
Newtype (Identity a)
Instance details Defined in Control.Newtype.Generics Associated Types type O (Identity a) :: Type Methods pack :: O (Identity a) -> Identity a unpack :: Identity a -> O (Identity a)
Generic1 Identity
Instance details Defined in Data.Functor.Identity Associated Types type Rep1 Identity :: k -> Type # Methods from1 :: Identity a -> Rep1 Identity a # to1 :: Rep1 Identity a -> Identity a #
t ~ Identity b => Rewrapped (Identity a) t
Instance details Defined in Control.Lens.Wrapped
Lift (RVarT Identity) (RVarT m)
Instance details Defined in Data.Random.Lift Methods lift :: RVarT Identity a -> RVarT m a
Each (Identity a) (Identity b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (Identity a) (Identity b) a b #
Field1 (Identity a) (Identity b) a b
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (Identity a) (Identity b) a b #
type Diff Identity
Instance details Defined in Linear.Affine type Diff Identity = Identity
type Rep Identity
Instance details Defined in Data.Functor.Rep type Rep Identity = ()
type StM Identity a
Instance details Defined in Control.Monad.Trans.Control type StM Identity a = a
type Rep (Identity a)	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity type Rep (Identity a) = D1 (MetaData "Identity" "Data.Functor.Identity" "base" True) (C1 (MetaCons "Identity" PrefixI True) (S1 (MetaSel (Just "runIdentity") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Index (Identity a)
Instance details Defined in Control.Lens.At type Index (Identity a) = ()
type IxValue (Identity a)
Instance details Defined in Control.Lens.At type IxValue (Identity a) = a
type Unwrapped (Identity a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Identity a) = a
type O (Identity a)
Instance details Defined in Control.Newtype.Generics type O (Identity a) = a
type Rep1 Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity type Rep1 Identity = D1 (MetaData "Identity" "Data.Functor.Identity" "base" True) (C1 (MetaCons "Identity" PrefixI True) (S1 (MetaSel (Just "runIdentity") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

newtype Const a (b :: k) :: forall k. Type -> k -> Type #

The Const functor.

Constructors

Const
Fields getConst :: a

Instances

Generic1 (Const a :: k -> Type)
Instance details Defined in Data.Functor.Const Associated Types type Rep1 (Const a) :: k -> Type # Methods from1 :: Const a a0 -> Rep1 (Const a) a0 # to1 :: Rep1 (Const a) a0 -> Const a a0 #
Bitraversable (Const :: Type -> Type -> Type)	Since: base-4.10.0.0
Instance details Defined in Data.Bitraversable Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Const a b -> f (Const c d) #
Bifoldable (Const :: Type -> Type -> Type)	Since: base-4.10.0.0
Instance details Defined in Data.Bifoldable Methods bifold :: Monoid m => Const m m -> m # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Const a b -> m # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Const a b -> c # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Const a b -> c #
Bifunctor (Const :: Type -> Type -> Type)	Since: base-4.8.0.0
Instance details Defined in Data.Bifunctor Methods bimap :: (a -> b) -> (c -> d) -> Const a c -> Const b d # first :: (a -> b) -> Const a c -> Const b c # second :: (b -> c) -> Const a b -> Const a c #
Biapplicative (Const :: Type -> Type -> Type)
Instance details Defined in Data.Biapplicative Methods bipure :: a -> b -> Const a b (<<>>) :: Const (a -> b) (c -> d) -> Const a c -> Const b d biliftA2 :: (a -> b -> c) -> (d -> e -> f) -> Const a d -> Const b e -> Const c f (>>) :: Const a b -> Const c d -> Const c d (<<*) :: Const a b -> Const c d -> Const a b
Biapply (Const :: Type -> Type -> Type)
Instance details Defined in Data.Functor.Bind.Class Methods (<<.>>) :: Const (a -> b) (c -> d) -> Const a c -> Const b d (.>>) :: Const a b -> Const c d -> Const c d (<<.) :: Const a b -> Const c d -> Const a b
Bitraversable1 (Const :: Type -> Type -> Type)
Instance details Defined in Data.Semigroup.Traversable.Class Methods bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Const a c -> f (Const b d) bisequence1 :: Apply f => Const (f a) (f b) -> f (Const a b)
ToJSON2 (Const :: Type -> Type -> Type)
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON2 :: (a -> Value) -> ([a] -> Value) -> (b -> Value) -> ([b] -> Value) -> Const a b -> Value liftToJSONList2 :: (a -> Value) -> ([a] -> Value) -> (b -> Value) -> ([b] -> Value) -> [Const a b] -> Value liftToEncoding2 :: (a -> Encoding) -> ([a] -> Encoding) -> (b -> Encoding) -> ([b] -> Encoding) -> Const a b -> Encoding liftToEncodingList2 :: (a -> Encoding) -> ([a] -> Encoding) -> (b -> Encoding) -> ([b] -> Encoding) -> [Const a b] -> Encoding
Functor (Const m :: Type -> Type)	Since: base-2.1
Instance details Defined in Data.Functor.Const Methods fmap :: (a -> b) -> Const m a -> Const m b # (<$) :: a -> Const m b -> Const m a #
Monoid m => Applicative (Const m :: Type -> Type)	Since: base-2.0.1
Instance details Defined in Data.Functor.Const Methods pure :: a -> Const m a # (<>) :: Const m (a -> b) -> Const m a -> Const m b # liftA2 :: (a -> b -> c) -> Const m a -> Const m b -> Const m c # (>) :: Const m a -> Const m b -> Const m b # (<*) :: Const m a -> Const m b -> Const m a #
Foldable (Const m :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Functor.Const Methods fold :: Monoid m0 => Const m m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> Const m a -> m0 # foldr :: (a -> b -> b) -> b -> Const m a -> b # foldr' :: (a -> b -> b) -> b -> Const m a -> b # foldl :: (b -> a -> b) -> b -> Const m a -> b # foldl' :: (b -> a -> b) -> b -> Const m a -> b # foldr1 :: (a -> a -> a) -> Const m a -> a # foldl1 :: (a -> a -> a) -> Const m a -> a # toList :: Const m a -> [a] # null :: Const m a -> Bool # length :: Const m a -> Int # elem :: Eq a => a -> Const m a -> Bool # maximum :: Ord a => Const m a -> a # minimum :: Ord a => Const m a -> a # sum :: Num a => Const m a -> a # product :: Num a => Const m a -> a #
Traversable (Const m :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Const m a -> f (Const m b) # sequenceA :: Applicative f => Const m (f a) -> f (Const m a) # mapM :: Monad m0 => (a -> m0 b) -> Const m a -> m0 (Const m b) # sequence :: Monad m0 => Const m (m0 a) -> m0 (Const m a) #
Contravariant (Const a :: Type -> Type)
Instance details Defined in Data.Functor.Contravariant Methods contramap :: (a0 -> b) -> Const a b -> Const a a0 # (>$) :: b -> Const a b -> Const a a0 #
Semigroup m => Apply (Const m :: Type -> Type)
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Const m (a -> b) -> Const m a -> Const m b (.>) :: Const m a -> Const m b -> Const m b (<.) :: Const m a -> Const m b -> Const m a liftF2 :: (a -> b -> c) -> Const m a -> Const m b -> Const m c
ToJSON a => ToJSON1 (Const a :: Type -> Type)
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a0 -> Value) -> ([a0] -> Value) -> Const a a0 -> Value liftToJSONList :: (a0 -> Value) -> ([a0] -> Value) -> [Const a a0] -> Value liftToEncoding :: (a0 -> Encoding) -> ([a0] -> Encoding) -> Const a a0 -> Encoding liftToEncodingList :: (a0 -> Encoding) -> ([a0] -> Encoding) -> [Const a a0] -> Encoding
Bounded a => Bounded (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods minBound :: Const a b # maxBound :: Const a b #
Enum a => Enum (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods succ :: Const a b -> Const a b # pred :: Const a b -> Const a b # toEnum :: Int -> Const a b # fromEnum :: Const a b -> Int # enumFrom :: Const a b -> [Const a b] # enumFromThen :: Const a b -> Const a b -> [Const a b] # enumFromTo :: Const a b -> Const a b -> [Const a b] # enumFromThenTo :: Const a b -> Const a b -> Const a b -> [Const a b] #
Eq a => Eq (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods (==) :: Const a b -> Const a b -> Bool # (/=) :: Const a b -> Const a b -> Bool #
Floating a => Floating (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods pi :: Const a b # exp :: Const a b -> Const a b # log :: Const a b -> Const a b # sqrt :: Const a b -> Const a b # (**) :: Const a b -> Const a b -> Const a b # logBase :: Const a b -> Const a b -> Const a b # sin :: Const a b -> Const a b # cos :: Const a b -> Const a b # tan :: Const a b -> Const a b # asin :: Const a b -> Const a b # acos :: Const a b -> Const a b # atan :: Const a b -> Const a b # sinh :: Const a b -> Const a b # cosh :: Const a b -> Const a b # tanh :: Const a b -> Const a b # asinh :: Const a b -> Const a b # acosh :: Const a b -> Const a b # atanh :: Const a b -> Const a b # log1p :: Const a b -> Const a b # expm1 :: Const a b -> Const a b # log1pexp :: Const a b -> Const a b # log1mexp :: Const a b -> Const a b #
Fractional a => Fractional (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods (/) :: Const a b -> Const a b -> Const a b # recip :: Const a b -> Const a b # fromRational :: Rational -> Const a b #
Integral a => Integral (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods quot :: Const a b -> Const a b -> Const a b # rem :: Const a b -> Const a b -> Const a b # div :: Const a b -> Const a b -> Const a b # mod :: Const a b -> Const a b -> Const a b # quotRem :: Const a b -> Const a b -> (Const a b, Const a b) # divMod :: Const a b -> Const a b -> (Const a b, Const a b) # toInteger :: Const a b -> Integer #
Num a => Num (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods (+) :: Const a b -> Const a b -> Const a b # (-) :: Const a b -> Const a b -> Const a b # (*) :: Const a b -> Const a b -> Const a b # negate :: Const a b -> Const a b # abs :: Const a b -> Const a b # signum :: Const a b -> Const a b # fromInteger :: Integer -> Const a b #
Ord a => Ord (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods compare :: Const a b -> Const a b -> Ordering # (<) :: Const a b -> Const a b -> Bool # (<=) :: Const a b -> Const a b -> Bool # (>) :: Const a b -> Const a b -> Bool # (>=) :: Const a b -> Const a b -> Bool # max :: Const a b -> Const a b -> Const a b # min :: Const a b -> Const a b -> Const a b #
Read a => Read (Const a b)	This instance would be equivalent to the derived instances of the `Const` newtype if the `runConst` field were removed Since: base-4.8.0.0
Instance details Defined in Data.Functor.Const Methods readsPrec :: Int -> ReadS (Const a b) # readList :: ReadS [Const a b] # readPrec :: ReadPrec (Const a b) # readListPrec :: ReadPrec [Const a b] #
Real a => Real (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods toRational :: Const a b -> Rational #
RealFloat a => RealFloat (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods floatRadix :: Const a b -> Integer # floatDigits :: Const a b -> Int # floatRange :: Const a b -> (Int, Int) # decodeFloat :: Const a b -> (Integer, Int) # encodeFloat :: Integer -> Int -> Const a b # exponent :: Const a b -> Int # significand :: Const a b -> Const a b # scaleFloat :: Int -> Const a b -> Const a b # isNaN :: Const a b -> Bool # isInfinite :: Const a b -> Bool # isDenormalized :: Const a b -> Bool # isNegativeZero :: Const a b -> Bool # isIEEE :: Const a b -> Bool # atan2 :: Const a b -> Const a b -> Const a b #
RealFrac a => RealFrac (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods properFraction :: Integral b0 => Const a b -> (b0, Const a b) # truncate :: Integral b0 => Const a b -> b0 # round :: Integral b0 => Const a b -> b0 # ceiling :: Integral b0 => Const a b -> b0 # floor :: Integral b0 => Const a b -> b0 #
Show a => Show (Const a b)	This instance would be equivalent to the derived instances of the `Const` newtype if the `runConst` field were removed Since: base-4.8.0.0
Instance details Defined in Data.Functor.Const Methods showsPrec :: Int -> Const a b -> ShowS # show :: Const a b -> String # showList :: [Const a b] -> ShowS #
Ix a => Ix (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods range :: (Const a b, Const a b) -> [Const a b] # index :: (Const a b, Const a b) -> Const a b -> Int # unsafeIndex :: (Const a b, Const a b) -> Const a b -> Int inRange :: (Const a b, Const a b) -> Const a b -> Bool # rangeSize :: (Const a b, Const a b) -> Int # unsafeRangeSize :: (Const a b, Const a b) -> Int
IsString a => IsString (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.String Methods fromString :: String -> Const a b #
Generic (Const a b)
Instance details Defined in Data.Functor.Const Associated Types type Rep (Const a b) :: Type -> Type # Methods from :: Const a b -> Rep (Const a b) x # to :: Rep (Const a b) x -> Const a b #
Semigroup a => Semigroup (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods (<>) :: Const a b -> Const a b -> Const a b # sconcat :: NonEmpty (Const a b) -> Const a b # stimes :: Integral b0 => b0 -> Const a b -> Const a b #
Monoid a => Monoid (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods mempty :: Const a b # mappend :: Const a b -> Const a b -> Const a b # mconcat :: [Const a b] -> Const a b #
Storable a => Storable (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods sizeOf :: Const a b -> Int # alignment :: Const a b -> Int # peekElemOff :: Ptr (Const a b) -> Int -> IO (Const a b) # pokeElemOff :: Ptr (Const a b) -> Int -> Const a b -> IO () # peekByteOff :: Ptr b0 -> Int -> IO (Const a b) # pokeByteOff :: Ptr b0 -> Int -> Const a b -> IO () # peek :: Ptr (Const a b) -> IO (Const a b) # poke :: Ptr (Const a b) -> Const a b -> IO () #
Bits a => Bits (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods (.&.) :: Const a b -> Const a b -> Const a b # (.\|.) :: Const a b -> Const a b -> Const a b # xor :: Const a b -> Const a b -> Const a b # complement :: Const a b -> Const a b # shift :: Const a b -> Int -> Const a b # rotate :: Const a b -> Int -> Const a b # zeroBits :: Const a b # bit :: Int -> Const a b # setBit :: Const a b -> Int -> Const a b # clearBit :: Const a b -> Int -> Const a b # complementBit :: Const a b -> Int -> Const a b # testBit :: Const a b -> Int -> Bool # bitSizeMaybe :: Const a b -> Maybe Int # bitSize :: Const a b -> Int # isSigned :: Const a b -> Bool # shiftL :: Const a b -> Int -> Const a b # unsafeShiftL :: Const a b -> Int -> Const a b # shiftR :: Const a b -> Int -> Const a b # unsafeShiftR :: Const a b -> Int -> Const a b # rotateL :: Const a b -> Int -> Const a b # rotateR :: Const a b -> Int -> Const a b # popCount :: Const a b -> Int #
FiniteBits a => FiniteBits (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const Methods finiteBitSize :: Const a b -> Int # countLeadingZeros :: Const a b -> Int # countTrailingZeros :: Const a b -> Int #
Pretty a => Pretty (Const a b)
Instance details Defined in Data.Text.Prettyprint.Doc.Internal Methods pretty :: Const a b -> Doc ann prettyList :: [Const a b] -> Doc ann
ToJSON a => ToJSON (Const a b)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Const a b -> Value toEncoding :: Const a b -> Encoding toJSONList :: [Const a b] -> Value toEncodingList :: [Const a b] -> Encoding
Wrapped (Const a x)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Const a x) :: Type # Methods _Wrapped' :: Iso' (Const a x) (Unwrapped (Const a x)) #
Newtype (Const a x)
Instance details Defined in Control.Newtype.Generics Associated Types type O (Const a x) :: Type Methods pack :: O (Const a x) -> Const a x unpack :: Const a x -> O (Const a x)
t ~ Const a' x' => Rewrapped (Const a x) t
Instance details Defined in Control.Lens.Wrapped
type Rep1 (Const a :: k -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const type Rep1 (Const a :: k -> Type) = D1 (MetaData "Const" "Data.Functor.Const" "base" True) (C1 (MetaCons "Const" PrefixI True) (S1 (MetaSel (Just "getConst") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Rep (Const a b)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Const type Rep (Const a b) = D1 (MetaData "Const" "Data.Functor.Const" "base" True) (C1 (MetaCons "Const" PrefixI True) (S1 (MetaSel (Just "getConst") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Unwrapped (Const a x)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Const a x) = a
type O (Const a x)
Instance details Defined in Control.Newtype.Generics type O (Const a x) = a

stimesMonoid :: (Integral b, Monoid a) => b -> a -> a #

This is a valid definition of stimes for a Monoid.

Unlike the default definition of stimes, it is defined for 0 and so it should be preferred where possible.

stimesIdempotent :: Integral b => b -> a -> a #

This is a valid definition of stimes for an idempotent Semigroup.

When x <> x = x, this definition should be preferred, because it works in O(1) rather than O(log n).

newtype Dual a #

The dual of a Monoid, obtained by swapping the arguments of mappend.

>>> getDual (mappend (Dual "Hello") (Dual "World"))
"WorldHello"

Constructors

Dual
Fields getDual :: a

Instances

Monad Dual	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods (>>=) :: Dual a -> (a -> Dual b) -> Dual b # (>>) :: Dual a -> Dual b -> Dual b # return :: a -> Dual a # fail :: String -> Dual a #
Functor Dual	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods fmap :: (a -> b) -> Dual a -> Dual b # (<$) :: a -> Dual b -> Dual a #
Applicative Dual	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Dual a # (<>) :: Dual (a -> b) -> Dual a -> Dual b # liftA2 :: (a -> b -> c) -> Dual a -> Dual b -> Dual c # (>) :: Dual a -> Dual b -> Dual b # (<*) :: Dual a -> Dual b -> Dual a #
Foldable Dual	Since: base-4.8.0.0
Instance details Defined in Data.Foldable Methods fold :: Monoid m => Dual m -> m # foldMap :: Monoid m => (a -> m) -> Dual a -> m # foldr :: (a -> b -> b) -> b -> Dual a -> b # foldr' :: (a -> b -> b) -> b -> Dual a -> b # foldl :: (b -> a -> b) -> b -> Dual a -> b # foldl' :: (b -> a -> b) -> b -> Dual a -> b # foldr1 :: (a -> a -> a) -> Dual a -> a # foldl1 :: (a -> a -> a) -> Dual a -> a # toList :: Dual a -> [a] # null :: Dual a -> Bool # length :: Dual a -> Int # elem :: Eq a => a -> Dual a -> Bool # maximum :: Ord a => Dual a -> a # minimum :: Ord a => Dual a -> a # sum :: Num a => Dual a -> a # product :: Num a => Dual a -> a #
Traversable Dual	Since: base-4.8.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Dual a -> f (Dual b) # sequenceA :: Applicative f => Dual (f a) -> f (Dual a) # mapM :: Monad m => (a -> m b) -> Dual a -> m (Dual b) # sequence :: Monad m => Dual (m a) -> m (Dual a) #
Apply Dual
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Dual (a -> b) -> Dual a -> Dual b (.>) :: Dual a -> Dual b -> Dual b (<.) :: Dual a -> Dual b -> Dual a liftF2 :: (a -> b -> c) -> Dual a -> Dual b -> Dual c
Bind Dual
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Dual a -> (a -> Dual b) -> Dual b join :: Dual (Dual a) -> Dual a
Traversable1 Dual
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Dual a -> f (Dual b) # sequence1 :: Apply f => Dual (f b) -> f (Dual b)
Representable Dual
Instance details Defined in Data.Functor.Rep Associated Types type Rep Dual :: Type Methods tabulate :: (Rep Dual -> a) -> Dual a index :: Dual a -> Rep Dual -> a
ToJSON1 Dual
Instance details Defined in Data.Aeson.Types.ToJSON Methods liftToJSON :: (a -> Value) -> ([a] -> Value) -> Dual a -> Value liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Dual a] -> Value liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Dual a -> Encoding liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Dual a] -> Encoding
Bounded a => Bounded (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Dual a # maxBound :: Dual a #
Eq a => Eq (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: Dual a -> Dual a -> Bool # (/=) :: Dual a -> Dual a -> Bool #
Ord a => Ord (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: Dual a -> Dual a -> Ordering # (<) :: Dual a -> Dual a -> Bool # (<=) :: Dual a -> Dual a -> Bool # (>) :: Dual a -> Dual a -> Bool # (>=) :: Dual a -> Dual a -> Bool # max :: Dual a -> Dual a -> Dual a # min :: Dual a -> Dual a -> Dual a #
Read a => Read (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS (Dual a) # readList :: ReadS [Dual a] # readPrec :: ReadPrec (Dual a) # readListPrec :: ReadPrec [Dual a] #
Show a => Show (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Dual a -> ShowS # show :: Dual a -> String # showList :: [Dual a] -> ShowS #
Generic (Dual a)
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Dual a) :: Type -> Type # Methods from :: Dual a -> Rep (Dual a) x # to :: Rep (Dual a) x -> Dual a #
Semigroup a => Semigroup (Dual a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Dual a -> Dual a -> Dual a # sconcat :: NonEmpty (Dual a) -> Dual a # stimes :: Integral b => b -> Dual a -> Dual a #
Monoid a => Monoid (Dual a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Dual a # mappend :: Dual a -> Dual a -> Dual a # mconcat :: [Dual a] -> Dual a #
Default a => Default (Dual a)
Instance details Defined in Data.Default.Class Methods def :: Dual a #
ToJSON a => ToJSON (Dual a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Dual a -> Value toEncoding :: Dual a -> Encoding toJSONList :: [Dual a] -> Value toEncodingList :: [Dual a] -> Encoding
AsEmpty a => AsEmpty (Dual a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (Dual a) () #
Wrapped (Dual a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Dual a) :: Type # Methods _Wrapped' :: Iso' (Dual a) (Unwrapped (Dual a)) #
Newtype (Dual a)
Instance details Defined in Control.Newtype.Generics Associated Types type O (Dual a) :: Type Methods pack :: O (Dual a) -> Dual a unpack :: Dual a -> O (Dual a)
Generic1 Dual
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep1 Dual :: k -> Type # Methods from1 :: Dual a -> Rep1 Dual a # to1 :: Rep1 Dual a -> Dual a #
t ~ Dual b => Rewrapped (Dual a) t
Instance details Defined in Control.Lens.Wrapped
type Rep Dual
Instance details Defined in Data.Functor.Rep type Rep Dual = ()
type Rep (Dual a)	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal type Rep (Dual a) = D1 (MetaData "Dual" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Dual" PrefixI True) (S1 (MetaSel (Just "getDual") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Unwrapped (Dual a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Dual a) = a
type O (Dual a)
Instance details Defined in Control.Newtype.Generics type O (Dual a) = a
type Rep1 Dual	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal type Rep1 Dual = D1 (MetaData "Dual" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Dual" PrefixI True) (S1 (MetaSel (Just "getDual") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

newtype Endo a #

The monoid of endomorphisms under composition.

>>> let computation = Endo ("Hello, " ++) <> Endo (++ "!")
>>> appEndo computation "Haskell"
"Hello, Haskell!"

Constructors

Endo
Fields appEndo :: a -> a

Instances

Generic (Endo a)
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Endo a) :: Type -> Type # Methods from :: Endo a -> Rep (Endo a) x # to :: Rep (Endo a) x -> Endo a #
Semigroup (Endo a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Endo a -> Endo a -> Endo a # sconcat :: NonEmpty (Endo a) -> Endo a # stimes :: Integral b => b -> Endo a -> Endo a #
Monoid (Endo a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Endo a # mappend :: Endo a -> Endo a -> Endo a # mconcat :: [Endo a] -> Endo a #
Default (Endo a)
Instance details Defined in Data.Default.Class Methods def :: Endo a #
Wrapped (Endo a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Endo a) :: Type # Methods _Wrapped' :: Iso' (Endo a) (Unwrapped (Endo a)) #
Newtype (Endo a)
Instance details Defined in Control.Newtype.Generics Associated Types type O (Endo a) :: Type Methods pack :: O (Endo a) -> Endo a unpack :: Endo a -> O (Endo a)
t ~ Endo b => Rewrapped (Endo a) t
Instance details Defined in Control.Lens.Wrapped
type Rep (Endo a)	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal type Rep (Endo a) = D1 (MetaData "Endo" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Endo" PrefixI True) (S1 (MetaSel (Just "appEndo") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (a -> a))))
type Unwrapped (Endo a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Endo a) = a -> a
type O (Endo a)
Instance details Defined in Control.Newtype.Generics type O (Endo a) = a -> a

newtype All #

Boolean monoid under conjunction (&&).

>>> getAll (All True <> mempty <> All False)
False

>>> getAll (mconcat (map (\x -> All (even x)) [2,4,6,7,8]))
False

Constructors

All
Fields getAll :: Bool

Instances

Bounded All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: All # maxBound :: All #
Eq All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: All -> All -> Bool # (/=) :: All -> All -> Bool #
Ord All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: All -> All -> Ordering # (<) :: All -> All -> Bool # (<=) :: All -> All -> Bool # (>) :: All -> All -> Bool # (>=) :: All -> All -> Bool # max :: All -> All -> All # min :: All -> All -> All #
Read All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS All # readList :: ReadS [All] # readPrec :: ReadPrec All # readListPrec :: ReadPrec [All] #
Show All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> All -> ShowS # show :: All -> String # showList :: [All] -> ShowS #
Generic All
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep All :: Type -> Type # Methods from :: All -> Rep All x # to :: Rep All x -> All #
Semigroup All	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: All -> All -> All # sconcat :: NonEmpty All -> All # stimes :: Integral b => b -> All -> All #
Monoid All	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: All # mappend :: All -> All -> All # mconcat :: [All] -> All #
Default All
Instance details Defined in Data.Default.Class Methods def :: All #
AsEmpty All
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' All () #
Wrapped All
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped All :: Type # Methods _Wrapped' :: Iso' All (Unwrapped All) #
Newtype All
Instance details Defined in Control.Newtype.Generics Associated Types type O All :: Type Methods pack :: O All -> All unpack :: All -> O All
t ~ All => Rewrapped All t
Instance details Defined in Control.Lens.Wrapped
RealFloat n => HasQuery (Clip n) All
Instance details Defined in Diagrams.TwoD.Path Methods getQuery :: Clip n -> Query (V (Clip n)) (N (Clip n)) All #
type Rep All	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal type Rep All = D1 (MetaData "All" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "All" PrefixI True) (S1 (MetaSel (Just "getAll") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Bool)))
type Unwrapped All
Instance details Defined in Control.Lens.Wrapped type Unwrapped All = Bool
type O All
Instance details Defined in Control.Newtype.Generics type O All = Bool

newtype Any #

Boolean monoid under disjunction (||).

>>> getAny (Any True <> mempty <> Any False)
True

>>> getAny (mconcat (map (\x -> Any (even x)) [2,4,6,7,8]))
True

Constructors

Any
Fields getAny :: Bool

Instances

Bounded Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Any # maxBound :: Any #
Eq Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: Any -> Any -> Bool # (/=) :: Any -> Any -> Bool #
Ord Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: Any -> Any -> Ordering # (<) :: Any -> Any -> Bool # (<=) :: Any -> Any -> Bool # (>) :: Any -> Any -> Bool # (>=) :: Any -> Any -> Bool # max :: Any -> Any -> Any # min :: Any -> Any -> Any #
Read Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS Any # readList :: ReadS [Any] # readPrec :: ReadPrec Any # readListPrec :: ReadPrec [Any] #
Show Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Any -> ShowS # show :: Any -> String # showList :: [Any] -> ShowS #
Generic Any
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep Any :: Type -> Type # Methods from :: Any -> Rep Any x # to :: Rep Any x -> Any #
Semigroup Any	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Any -> Any -> Any # sconcat :: NonEmpty Any -> Any # stimes :: Integral b => b -> Any -> Any #
Monoid Any	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Any # mappend :: Any -> Any -> Any # mconcat :: [Any] -> Any #
Default Any
Instance details Defined in Data.Default.Class Methods def :: Any #
AsEmpty Any
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' Any () #
Wrapped Any
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped Any :: Type # Methods _Wrapped' :: Iso' Any (Unwrapped Any) #
Newtype Any
Instance details Defined in Control.Newtype.Generics Associated Types type O Any :: Type Methods pack :: O Any -> Any unpack :: Any -> O Any
t ~ Any => Rewrapped Any t
Instance details Defined in Control.Lens.Wrapped
(Num n, Ord n) => HasQuery (Box n) Any
Instance details Defined in Diagrams.ThreeD.Shapes Methods getQuery :: Box n -> Query (V (Box n)) (N (Box n)) Any #
(Floating n, Ord n) => HasQuery (CSG n) Any
Instance details Defined in Diagrams.ThreeD.Shapes Methods getQuery :: CSG n -> Query (V (CSG n)) (N (CSG n)) Any #
(Num n, Ord n) => HasQuery (Ellipsoid n) Any
Instance details Defined in Diagrams.ThreeD.Shapes Methods getQuery :: Ellipsoid n -> Query (V (Ellipsoid n)) (N (Ellipsoid n)) Any #
OrderedField n => HasQuery (Frustum n) Any
Instance details Defined in Diagrams.ThreeD.Shapes Methods getQuery :: Frustum n -> Query (V (Frustum n)) (N (Frustum n)) Any #
(Additive v, Foldable v, Ord n) => HasQuery (BoundingBox v n) Any
Instance details Defined in Diagrams.BoundingBox Methods getQuery :: BoundingBox v n -> Query (V (BoundingBox v n)) (N (BoundingBox v n)) Any #
RealFloat n => HasQuery (DImage n a) Any
Instance details Defined in Diagrams.TwoD.Image Methods getQuery :: DImage n a -> Query (V (DImage n a)) (N (DImage n a)) Any #
type Rep Any	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal type Rep Any = D1 (MetaData "Any" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Any" PrefixI True) (S1 (MetaSel (Just "getAny") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Bool)))
type Unwrapped Any
Instance details Defined in Control.Lens.Wrapped type Unwrapped Any = Bool
type O Any
Instance details Defined in Control.Newtype.Generics type O Any = Bool

newtype Sum a #

Monoid under addition.

>>> getSum (Sum 1 <> Sum 2 <> mempty)
3

Constructors

Sum
Fields getSum :: a

Instances

Monad Sum	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods (>>=) :: Sum a -> (a -> Sum b) -> Sum b # (>>) :: Sum a -> Sum b -> Sum b # return :: a -> Sum a # fail :: String -> Sum a #
Functor Sum	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods fmap :: (a -> b) -> Sum a -> Sum b # (<$) :: a -> Sum b -> Sum a #
Applicative Sum	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Sum a # (<>) :: Sum (a -> b) -> Sum a -> Sum b # liftA2 :: (a -> b -> c) -> Sum a -> Sum b -> Sum c # (>) :: Sum a -> Sum b -> Sum b # (<*) :: Sum a -> Sum b -> Sum a #
Foldable Sum	Since: base-4.8.0.0
Instance details Defined in Data.Foldable Methods fold :: Monoid m => Sum m -> m # foldMap :: Monoid m => (a -> m) -> Sum a -> m # foldr :: (a -> b -> b) -> b -> Sum a -> b # foldr' :: (a -> b -> b) -> b -> Sum a -> b # foldl :: (b -> a -> b) -> b -> Sum a -> b # foldl' :: (b -> a -> b) -> b -> Sum a -> b # foldr1 :: (a -> a -> a) -> Sum a -> a # foldl1 :: (a -> a -> a) -> Sum a -> a # toList :: Sum a -> [a] # null :: Sum a -> Bool # length :: Sum a -> Int # elem :: Eq a => a -> Sum a -> Bool # maximum :: Ord a => Sum a -> a # minimum :: Ord a => Sum a -> a # sum :: Num a => Sum a -> a # product :: Num a => Sum a -> a #
Traversable Sum	Since: base-4.8.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Sum a -> f (Sum b) # sequenceA :: Applicative f => Sum (f a) -> f (Sum a) # mapM :: Monad m => (a -> m b) -> Sum a -> m (Sum b) # sequence :: Monad m => Sum (m a) -> m (Sum a) #
Apply Sum
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Sum (a -> b) -> Sum a -> Sum b (.>) :: Sum a -> Sum b -> Sum b (<.) :: Sum a -> Sum b -> Sum a liftF2 :: (a -> b -> c) -> Sum a -> Sum b -> Sum c
Bind Sum
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Sum a -> (a -> Sum b) -> Sum b join :: Sum (Sum a) -> Sum a
Traversable1 Sum
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Sum a -> f (Sum b) # sequence1 :: Apply f => Sum (f b) -> f (Sum b)
Representable Sum
Instance details Defined in Data.Functor.Rep Associated Types type Rep Sum :: Type Methods tabulate :: (Rep Sum -> a) -> Sum a index :: Sum a -> Rep Sum -> a
Bounded a => Bounded (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Sum a # maxBound :: Sum a #
Eq a => Eq (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: Sum a -> Sum a -> Bool # (/=) :: Sum a -> Sum a -> Bool #
Num a => Num (Sum a)	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal Methods (+) :: Sum a -> Sum a -> Sum a # (-) :: Sum a -> Sum a -> Sum a # (*) :: Sum a -> Sum a -> Sum a # negate :: Sum a -> Sum a # abs :: Sum a -> Sum a # signum :: Sum a -> Sum a # fromInteger :: Integer -> Sum a #
Ord a => Ord (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: Sum a -> Sum a -> Ordering # (<) :: Sum a -> Sum a -> Bool # (<=) :: Sum a -> Sum a -> Bool # (>) :: Sum a -> Sum a -> Bool # (>=) :: Sum a -> Sum a -> Bool # max :: Sum a -> Sum a -> Sum a # min :: Sum a -> Sum a -> Sum a #
Read a => Read (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS (Sum a) # readList :: ReadS [Sum a] # readPrec :: ReadPrec (Sum a) # readListPrec :: ReadPrec [Sum a] #
Show a => Show (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Sum a -> ShowS # show :: Sum a -> String # showList :: [Sum a] -> ShowS #
Generic (Sum a)
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Sum a) :: Type -> Type # Methods from :: Sum a -> Rep (Sum a) x # to :: Rep (Sum a) x -> Sum a #
Num a => Semigroup (Sum a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Sum a -> Sum a -> Sum a # sconcat :: NonEmpty (Sum a) -> Sum a # stimes :: Integral b => b -> Sum a -> Sum a #
Num a => Monoid (Sum a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Sum a # mappend :: Sum a -> Sum a -> Sum a # mconcat :: [Sum a] -> Sum a #
Num a => Default (Sum a)
Instance details Defined in Data.Default.Class Methods def :: Sum a #
(Eq a, Num a) => AsEmpty (Sum a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (Sum a) () #
Wrapped (Sum a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Sum a) :: Type # Methods _Wrapped' :: Iso' (Sum a) (Unwrapped (Sum a)) #
Newtype (Sum a)
Instance details Defined in Control.Newtype.Generics Associated Types type O (Sum a) :: Type Methods pack :: O (Sum a) -> Sum a unpack :: Sum a -> O (Sum a)
Generic1 Sum
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep1 Sum :: k -> Type # Methods from1 :: Sum a -> Rep1 Sum a # to1 :: Rep1 Sum a -> Sum a #
t ~ Sum b => Rewrapped (Sum a) t
Instance details Defined in Control.Lens.Wrapped
type Rep Sum
Instance details Defined in Data.Functor.Rep type Rep Sum = ()
type Rep (Sum a)	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal type Rep (Sum a) = D1 (MetaData "Sum" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Sum" PrefixI True) (S1 (MetaSel (Just "getSum") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Unwrapped (Sum a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Sum a) = a
type O (Sum a)
Instance details Defined in Control.Newtype.Generics type O (Sum a) = a
type Rep1 Sum	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal type Rep1 Sum = D1 (MetaData "Sum" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Sum" PrefixI True) (S1 (MetaSel (Just "getSum") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

newtype Product a #

Monoid under multiplication.

>>> getProduct (Product 3 <> Product 4 <> mempty)
12

Constructors

Product
Fields getProduct :: a

Instances

Monad Product	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods (>>=) :: Product a -> (a -> Product b) -> Product b # (>>) :: Product a -> Product b -> Product b # return :: a -> Product a # fail :: String -> Product a #
Functor Product	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods fmap :: (a -> b) -> Product a -> Product b # (<$) :: a -> Product b -> Product a #
Applicative Product	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Product a # (<>) :: Product (a -> b) -> Product a -> Product b # liftA2 :: (a -> b -> c) -> Product a -> Product b -> Product c # (>) :: Product a -> Product b -> Product b # (<*) :: Product a -> Product b -> Product a #
Foldable Product	Since: base-4.8.0.0
Instance details Defined in Data.Foldable Methods fold :: Monoid m => Product m -> m # foldMap :: Monoid m => (a -> m) -> Product a -> m # foldr :: (a -> b -> b) -> b -> Product a -> b # foldr' :: (a -> b -> b) -> b -> Product a -> b # foldl :: (b -> a -> b) -> b -> Product a -> b # foldl' :: (b -> a -> b) -> b -> Product a -> b # foldr1 :: (a -> a -> a) -> Product a -> a # foldl1 :: (a -> a -> a) -> Product a -> a # toList :: Product a -> [a] # null :: Product a -> Bool # length :: Product a -> Int # elem :: Eq a => a -> Product a -> Bool # maximum :: Ord a => Product a -> a # minimum :: Ord a => Product a -> a # sum :: Num a => Product a -> a # product :: Num a => Product a -> a #
Traversable Product	Since: base-4.8.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Product a -> f (Product b) # sequenceA :: Applicative f => Product (f a) -> f (Product a) # mapM :: Monad m => (a -> m b) -> Product a -> m (Product b) # sequence :: Monad m => Product (m a) -> m (Product a) #
Apply Product
Instance details Defined in Data.Functor.Bind.Class Methods (<.>) :: Product (a -> b) -> Product a -> Product b (.>) :: Product a -> Product b -> Product b (<.) :: Product a -> Product b -> Product a liftF2 :: (a -> b -> c) -> Product a -> Product b -> Product c
Bind Product
Instance details Defined in Data.Functor.Bind.Class Methods (>>-) :: Product a -> (a -> Product b) -> Product b join :: Product (Product a) -> Product a
Traversable1 Product
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Product a -> f (Product b) # sequence1 :: Apply f => Product (f b) -> f (Product b)
Representable Product
Instance details Defined in Data.Functor.Rep Associated Types type Rep Product :: Type Methods tabulate :: (Rep Product -> a) -> Product a index :: Product a -> Rep Product -> a
Bounded a => Bounded (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods minBound :: Product a # maxBound :: Product a #
Eq a => Eq (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods (==) :: Product a -> Product a -> Bool # (/=) :: Product a -> Product a -> Bool #
Num a => Num (Product a)	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal Methods (+) :: Product a -> Product a -> Product a # (-) :: Product a -> Product a -> Product a # (*) :: Product a -> Product a -> Product a # negate :: Product a -> Product a # abs :: Product a -> Product a # signum :: Product a -> Product a # fromInteger :: Integer -> Product a #
Ord a => Ord (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods compare :: Product a -> Product a -> Ordering # (<) :: Product a -> Product a -> Bool # (<=) :: Product a -> Product a -> Bool # (>) :: Product a -> Product a -> Bool # (>=) :: Product a -> Product a -> Bool # max :: Product a -> Product a -> Product a # min :: Product a -> Product a -> Product a #
Read a => Read (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods readsPrec :: Int -> ReadS (Product a) # readList :: ReadS [Product a] # readPrec :: ReadPrec (Product a) # readListPrec :: ReadPrec [Product a] #
Show a => Show (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods showsPrec :: Int -> Product a -> ShowS # show :: Product a -> String # showList :: [Product a] -> ShowS #
Generic (Product a)
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep (Product a) :: Type -> Type # Methods from :: Product a -> Rep (Product a) x # to :: Rep (Product a) x -> Product a #
Num a => Semigroup (Product a)	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup.Internal Methods (<>) :: Product a -> Product a -> Product a # sconcat :: NonEmpty (Product a) -> Product a # stimes :: Integral b => b -> Product a -> Product a #
Num a => Monoid (Product a)	Since: base-2.1
Instance details Defined in Data.Semigroup.Internal Methods mempty :: Product a # mappend :: Product a -> Product a -> Product a # mconcat :: [Product a] -> Product a #
Num a => Default (Product a)
Instance details Defined in Data.Default.Class Methods def :: Product a #
(Eq a, Num a) => AsEmpty (Product a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (Product a) () #
Wrapped (Product a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Product a) :: Type # Methods _Wrapped' :: Iso' (Product a) (Unwrapped (Product a)) #
Newtype (Product a)
Instance details Defined in Control.Newtype.Generics Associated Types type O (Product a) :: Type Methods pack :: O (Product a) -> Product a unpack :: Product a -> O (Product a)
Generic1 Product
Instance details Defined in Data.Semigroup.Internal Associated Types type Rep1 Product :: k -> Type # Methods from1 :: Product a -> Rep1 Product a # to1 :: Rep1 Product a -> Product a #
t ~ Product b => Rewrapped (Product a) t
Instance details Defined in Control.Lens.Wrapped
type Rep Product
Instance details Defined in Data.Functor.Rep type Rep Product = ()
type Rep (Product a)	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal type Rep (Product a) = D1 (MetaData "Product" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Product" PrefixI True) (S1 (MetaSel (Just "getProduct") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Unwrapped (Product a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Product a) = a
type O (Product a)
Instance details Defined in Control.Newtype.Generics type O (Product a) = a
type Rep1 Product	Since: base-4.7.0.0
Instance details Defined in Data.Semigroup.Internal type Rep1 Product = D1 (MetaData "Product" "Data.Semigroup.Internal" "base" True) (C1 (MetaCons "Product" PrefixI True) (S1 (MetaSel (Just "getProduct") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

(&) :: a -> (a -> b) -> b infixl 1 #

& is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $.

>>> 5 & (+1) & show
"6"

Since: base-4.8.0.0

(<&>) :: Functor f => f a -> (a -> b) -> f b infixl 1 #

Flipped version of <$>.

(<&>) = flip fmap

Examples

Expand

Apply (+1) to a list, a Just and a Right:

>>> Just 2 <&> (+1)
Just 3

>>> [1,2,3] <&> (+1)
[2,3,4]

>>> Right 3 <&> (+1)
Right 4

Since: base-4.11.0.0

(<$>) :: Functor f => (a -> b) -> f a -> f b infixl 4 #

An infix synonym for fmap.

The name of this operator is an allusion to $. Note the similarities between their types:

 ($)  ::              (a -> b) ->   a ->   b
(<$>) :: Functor f => (a -> b) -> f a -> f b

Whereas $ is function application, <$> is function application lifted over a Functor.

Examples

Expand

Convert from a Maybe Int to a Maybe String using show:

>>> show <$> Nothing
Nothing
>>> show <$> Just 3
Just "3"

Convert from an Either Int Int to an Either Int String using show:

>>> show <$> Left 17
Left 17
>>> show <$> Right 17
Right "17"

Double each element of a list:

>>> (*2) <$> [1,2,3]
[2,4,6]

Apply even to the second element of a pair:

>>> even <$> (2,2)
(2,True)

liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d #

Lift a ternary function to actions.

liftA :: Applicative f => (a -> b) -> f a -> f b #

Lift a function to actions. This function may be used as a value for fmap in a Functor instance.

stimesIdempotentMonoid :: (Integral b, Monoid a) => b -> a -> a #

This is a valid definition of stimes for an idempotent Monoid.

When mappend x x = x, this definition should be preferred, because it works in O(1) rather than O(log n)

class Default a where #

Minimal complete definition

Nothing

Methods

def :: a #

Instances

Default Double
Instance details Defined in Data.Default.Class Methods def :: Double #
Default Float
Instance details Defined in Data.Default.Class Methods def :: Float #
Default Int
Instance details Defined in Data.Default.Class Methods def :: Int #
Default Int8
Instance details Defined in Data.Default.Class Methods def :: Int8 #
Default Int16
Instance details Defined in Data.Default.Class Methods def :: Int16 #
Default Int32
Instance details Defined in Data.Default.Class Methods def :: Int32 #
Default Int64
Instance details Defined in Data.Default.Class Methods def :: Int64 #
Default Integer
Instance details Defined in Data.Default.Class Methods def :: Integer #
Default Ordering
Instance details Defined in Data.Default.Class Methods def :: Ordering #
Default Word
Instance details Defined in Data.Default.Class Methods def :: Word #
Default Word8
Instance details Defined in Data.Default.Class Methods def :: Word8 #
Default Word16
Instance details Defined in Data.Default.Class Methods def :: Word16 #
Default Word32
Instance details Defined in Data.Default.Class Methods def :: Word32 #
Default Word64
Instance details Defined in Data.Default.Class Methods def :: Word64 #
Default ()
Instance details Defined in Data.Default.Class Methods def :: () #
Default All
Instance details Defined in Data.Default.Class Methods def :: All #
Default Any
Instance details Defined in Data.Default.Class Methods def :: Any #
Default CShort
Instance details Defined in Data.Default.Class Methods def :: CShort #
Default CUShort
Instance details Defined in Data.Default.Class Methods def :: CUShort #
Default CInt
Instance details Defined in Data.Default.Class Methods def :: CInt #
Default CUInt
Instance details Defined in Data.Default.Class Methods def :: CUInt #
Default CLong
Instance details Defined in Data.Default.Class Methods def :: CLong #
Default CULong
Instance details Defined in Data.Default.Class Methods def :: CULong #
Default CLLong
Instance details Defined in Data.Default.Class Methods def :: CLLong #
Default CULLong
Instance details Defined in Data.Default.Class Methods def :: CULLong #
Default CFloat
Instance details Defined in Data.Default.Class Methods def :: CFloat #
Default CDouble
Instance details Defined in Data.Default.Class Methods def :: CDouble #
Default CPtrdiff
Instance details Defined in Data.Default.Class Methods def :: CPtrdiff #
Default CSize
Instance details Defined in Data.Default.Class Methods def :: CSize #
Default CSigAtomic
Instance details Defined in Data.Default.Class Methods def :: CSigAtomic #
Default CClock
Instance details Defined in Data.Default.Class Methods def :: CClock #
Default CTime
Instance details Defined in Data.Default.Class Methods def :: CTime #
Default CUSeconds
Instance details Defined in Data.Default.Class Methods def :: CUSeconds #
Default CSUSeconds
Instance details Defined in Data.Default.Class Methods def :: CSUSeconds #
Default CIntPtr
Instance details Defined in Data.Default.Class Methods def :: CIntPtr #
Default CUIntPtr
Instance details Defined in Data.Default.Class Methods def :: CUIntPtr #
Default CIntMax
Instance details Defined in Data.Default.Class Methods def :: CIntMax #
Default CUIntMax
Instance details Defined in Data.Default.Class Methods def :: CUIntMax #
Default CommonState
Instance details Defined in Text.Pandoc.Class Methods def :: CommonState #
Default PureState
Instance details Defined in Text.Pandoc.Class Methods def :: PureState #
Default ReaderOptions
Instance details Defined in Text.Pandoc.Options Methods def :: ReaderOptions #
Default WriterOptions
Instance details Defined in Text.Pandoc.Options Methods def :: WriterOptions #
Default DEnv
Instance details Defined in Text.Pandoc.Readers.Docx Methods def :: DEnv #
Default DState
Instance details Defined in Text.Pandoc.Readers.Docx Methods def :: DState #
Default HTMLLocal
Instance details Defined in Text.Pandoc.Readers.HTML Methods def :: HTMLLocal #
Default WriterEnv
Instance details Defined in Text.Pandoc.Writers.Markdown Methods def :: WriterEnv #
Default WriterState
Instance details Defined in Text.Pandoc.Writers.Markdown Methods def :: WriterState #
Default NewtonParam
Instance details Defined in Numeric.RootFinding Methods def :: NewtonParam #
Default RiddersParam
Instance details Defined in Numeric.RootFinding Methods def :: RiddersParam #
Default LineCap
Instance details Defined in Diagrams.Attributes Methods def :: LineCap #
Default LineJoin
Instance details Defined in Diagrams.Attributes Methods def :: LineJoin #
Default LineMiterLimit
Instance details Defined in Diagrams.Attributes Methods def :: LineMiterLimit #
Default AdjustSide
Instance details Defined in Diagrams.Parametric.Adjust Methods def :: AdjustSide #
Default FillRule
Instance details Defined in Diagrams.TwoD.Path Methods def :: FillRule #
Default FontSlant
Instance details Defined in Diagrams.TwoD.Text Methods def :: FontSlant #
Default FontWeight
Instance details Defined in Diagrams.TwoD.Text Methods def :: FontWeight #
Default [a]
Instance details Defined in Data.Default.Class Methods def :: [a] #
Default (Maybe a)
Instance details Defined in Data.Default.Class Methods def :: Maybe a #
Integral a => Default (Ratio a)
Instance details Defined in Data.Default.Class Methods def :: Ratio a #
Default a => Default (IO a)
Instance details Defined in Data.Default.Class Methods def :: IO a #
(Default a, RealFloat a) => Default (Complex a)
Instance details Defined in Data.Default.Class Methods def :: Complex a #
Default (First a)
Instance details Defined in Data.Default.Class Methods def :: First a #
Default (Last a)
Instance details Defined in Data.Default.Class Methods def :: Last a #
Default a => Default (Dual a)
Instance details Defined in Data.Default.Class Methods def :: Dual a #
Default (Endo a)
Instance details Defined in Data.Default.Class Methods def :: Endo a #
Num a => Default (Sum a)
Instance details Defined in Data.Default.Class Methods def :: Sum a #
Num a => Default (Product a)
Instance details Defined in Data.Default.Class Methods def :: Product a #
Num n => Default (CatOpts n)
Instance details Defined in Diagrams.Combinators Methods def :: CatOpts n #
Fractional n => Default (AdjustMethod n)
Instance details Defined in Diagrams.Parametric.Adjust Methods def :: AdjustMethod n #
Fractional n => Default (AdjustOpts n)
Instance details Defined in Diagrams.Parametric.Adjust Methods def :: AdjustOpts n #
TypeableFloat n => Default (ArrowOpts n)
Instance details Defined in Diagrams.TwoD.Arrow Methods def :: ArrowOpts n #
OrderedField n => Default (EnvelopeOpts n)
Instance details Defined in Diagrams.TwoD.Model Methods def :: EnvelopeOpts n #
Fractional n => Default (OriginOpts n)
Instance details Defined in Diagrams.TwoD.Model Methods def :: OriginOpts n #
Floating n => Default (TraceOpts n)
Instance details Defined in Diagrams.TwoD.Model Methods def :: TraceOpts n #
Default (StrokeOpts a)
Instance details Defined in Diagrams.TwoD.Path Methods def :: StrokeOpts a #
Num n => Default (PolygonOpts n)
Instance details Defined in Diagrams.TwoD.Polygons Methods def :: PolygonOpts n #
Num d => Default (RoundedRectOpts d)
Instance details Defined in Diagrams.TwoD.Shapes Methods def :: RoundedRectOpts d #
Default (FillTexture n)
Instance details Defined in Diagrams.TwoD.Attributes Methods def :: FillTexture n #
Default (LineTexture n)
Instance details Defined in Diagrams.TwoD.Attributes Methods def :: LineTexture n #
Num n => Default (FontSizeM n)
Instance details Defined in Diagrams.TwoD.Text Methods def :: FontSizeM n #
OrderedField n => Default (LineWidthM n)
Instance details Defined in Diagrams.Attributes Methods def :: LineWidthM n #
Default r => Default (e -> r)
Instance details Defined in Data.Default.Class Methods def :: e -> r #
(Default a, Default b) => Default (a, b)
Instance details Defined in Data.Default.Class Methods def :: (a, b) #
(Default a, Default b, Default c) => Default (a, b, c)
Instance details Defined in Data.Default.Class Methods def :: (a, b, c) #
(Default a, Default b, Default c, Default d) => Default (a, b, c, d)
Instance details Defined in Data.Default.Class Methods def :: (a, b, c, d) #
(Default a, Default b, Default c, Default d, Default e) => Default (a, b, c, d, e)
Instance details Defined in Data.Default.Class Methods def :: (a, b, c, d, e) #
(Default a, Default b, Default c, Default d, Default e, Default f) => Default (a, b, c, d, e, f)
Instance details Defined in Data.Default.Class Methods def :: (a, b, c, d, e, f) #
(Default a, Default b, Default c, Default d, Default e, Default f, Default g) => Default (a, b, c, d, e, f, g)
Instance details Defined in Data.Default.Class Methods def :: (a, b, c, d, e, f, g) #

alphaChannel :: AlphaColour a -> a #

alphaColourConvert :: (Fractional b, Real a) => AlphaColour a -> AlphaColour b #

black :: Num a => Colour a #

blend :: (Num a, AffineSpace f) => a -> f a -> f a -> f a #

colourConvert :: (Fractional b, Real a) => Colour a -> Colour b #

dissolve :: Num a => a -> AlphaColour a -> AlphaColour a #

opaque :: Num a => Colour a -> AlphaColour a #

transparent :: Num a => AlphaColour a #

withOpacity :: Num a => Colour a -> a -> AlphaColour a #

data AlphaColour a #

Instances

AffineSpace AlphaColour
Instance details Defined in Data.Colour.Internal Methods affineCombo :: Num a => [(a, AlphaColour a)] -> AlphaColour a -> AlphaColour a
ColourOps AlphaColour
Instance details Defined in Data.Colour.Internal Methods over :: Num a => AlphaColour a -> AlphaColour a -> AlphaColour a darken :: Num a => a -> AlphaColour a -> AlphaColour a #
Eq a => Eq (AlphaColour a)
Instance details Defined in Data.Colour.Internal Methods (==) :: AlphaColour a -> AlphaColour a -> Bool # (/=) :: AlphaColour a -> AlphaColour a -> Bool #
Num a => Semigroup (AlphaColour a)
Instance details Defined in Data.Colour.Internal Methods (<>) :: AlphaColour a -> AlphaColour a -> AlphaColour a # sconcat :: NonEmpty (AlphaColour a) -> AlphaColour a # stimes :: Integral b => b -> AlphaColour a -> AlphaColour a #
Num a => Monoid (AlphaColour a)
Instance details Defined in Data.Colour.Internal Methods mempty :: AlphaColour a # mappend :: AlphaColour a -> AlphaColour a -> AlphaColour a # mconcat :: [AlphaColour a] -> AlphaColour a #
a ~ Double => Color (AlphaColour a)
Instance details Defined in Diagrams.Attributes Methods toAlphaColour :: AlphaColour a -> AlphaColour Double # fromAlphaColour :: AlphaColour Double -> AlphaColour a #

data Colour a #

Instances

AffineSpace Colour
Instance details Defined in Data.Colour.Internal Methods affineCombo :: Num a => [(a, Colour a)] -> Colour a -> Colour a
ColourOps Colour
Instance details Defined in Data.Colour.Internal Methods over :: Num a => AlphaColour a -> Colour a -> Colour a darken :: Num a => a -> Colour a -> Colour a #
Eq a => Eq (Colour a)
Instance details Defined in Data.Colour.Internal Methods (==) :: Colour a -> Colour a -> Bool # (/=) :: Colour a -> Colour a -> Bool #
Num a => Semigroup (Colour a)
Instance details Defined in Data.Colour.Internal Methods (<>) :: Colour a -> Colour a -> Colour a # sconcat :: NonEmpty (Colour a) -> Colour a # stimes :: Integral b => b -> Colour a -> Colour a #
Num a => Monoid (Colour a)
Instance details Defined in Data.Colour.Internal Methods mempty :: Colour a # mappend :: Colour a -> Colour a -> Colour a # mconcat :: [Colour a] -> Colour a #
(Ord a, Floating a) => FromColor (Colour a)
Instance details Defined in Skylighting.Types Methods fromColor :: Color -> Colour a
(RealFrac a, Floating a) => ToColor (Colour a)
Instance details Defined in Skylighting.Types Methods toColor :: Colour a -> Maybe Color
a ~ Double => Color (Colour a)
Instance details Defined in Diagrams.Attributes Methods toAlphaColour :: Colour a -> AlphaColour Double # fromAlphaColour :: AlphaColour Double -> Colour a #

class ColourOps (f :: Type -> Type) where #

Minimal complete definition

over, darken

Methods

darken :: Num a => a -> f a -> f a #

Instances

ColourOps AlphaColour
Instance details Defined in Data.Colour.Internal Methods over :: Num a => AlphaColour a -> AlphaColour a -> AlphaColour a darken :: Num a => a -> AlphaColour a -> AlphaColour a #
ColourOps Colour
Instance details Defined in Data.Colour.Internal Methods over :: Num a => AlphaColour a -> Colour a -> Colour a darken :: Num a => a -> Colour a -> Colour a #

data family MVector s a :: Type #

Instances

MVector MVector Bool
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Bool -> Int basicUnsafeSlice :: Int -> Int -> MVector s Bool -> MVector s Bool basicOverlaps :: MVector s Bool -> MVector s Bool -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Bool) basicInitialize :: PrimMonad m => MVector (PrimState m) Bool -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Bool -> m (MVector (PrimState m) Bool) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m Bool basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Bool -> Int -> Bool -> m () basicClear :: PrimMonad m => MVector (PrimState m) Bool -> m () basicSet :: PrimMonad m => MVector (PrimState m) Bool -> Bool -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m (MVector (PrimState m) Bool)
MVector MVector Char
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Char -> Int basicUnsafeSlice :: Int -> Int -> MVector s Char -> MVector s Char basicOverlaps :: MVector s Char -> MVector s Char -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Char) basicInitialize :: PrimMonad m => MVector (PrimState m) Char -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Char -> m (MVector (PrimState m) Char) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Char -> Int -> m Char basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Char -> Int -> Char -> m () basicClear :: PrimMonad m => MVector (PrimState m) Char -> m () basicSet :: PrimMonad m => MVector (PrimState m) Char -> Char -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Char -> MVector (PrimState m) Char -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Char -> MVector (PrimState m) Char -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Char -> Int -> m (MVector (PrimState m) Char)
MVector MVector Double
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Double -> Int basicUnsafeSlice :: Int -> Int -> MVector s Double -> MVector s Double basicOverlaps :: MVector s Double -> MVector s Double -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Double) basicInitialize :: PrimMonad m => MVector (PrimState m) Double -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Double -> m (MVector (PrimState m) Double) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Double -> Int -> m Double basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Double -> Int -> Double -> m () basicClear :: PrimMonad m => MVector (PrimState m) Double -> m () basicSet :: PrimMonad m => MVector (PrimState m) Double -> Double -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Double -> MVector (PrimState m) Double -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Double -> MVector (PrimState m) Double -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Double -> Int -> m (MVector (PrimState m) Double)
MVector MVector Float
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Float -> Int basicUnsafeSlice :: Int -> Int -> MVector s Float -> MVector s Float basicOverlaps :: MVector s Float -> MVector s Float -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Float) basicInitialize :: PrimMonad m => MVector (PrimState m) Float -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Float -> m (MVector (PrimState m) Float) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Float -> Int -> m Float basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Float -> Int -> Float -> m () basicClear :: PrimMonad m => MVector (PrimState m) Float -> m () basicSet :: PrimMonad m => MVector (PrimState m) Float -> Float -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Float -> MVector (PrimState m) Float -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Float -> MVector (PrimState m) Float -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Float -> Int -> m (MVector (PrimState m) Float)
MVector MVector Int
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Int -> Int basicUnsafeSlice :: Int -> Int -> MVector s Int -> MVector s Int basicOverlaps :: MVector s Int -> MVector s Int -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Int) basicInitialize :: PrimMonad m => MVector (PrimState m) Int -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Int -> m (MVector (PrimState m) Int) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Int -> Int -> m Int basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Int -> Int -> Int -> m () basicClear :: PrimMonad m => MVector (PrimState m) Int -> m () basicSet :: PrimMonad m => MVector (PrimState m) Int -> Int -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Int -> MVector (PrimState m) Int -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Int -> MVector (PrimState m) Int -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Int -> Int -> m (MVector (PrimState m) Int)
MVector MVector Int8
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Int8 -> Int basicUnsafeSlice :: Int -> Int -> MVector s Int8 -> MVector s Int8 basicOverlaps :: MVector s Int8 -> MVector s Int8 -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Int8) basicInitialize :: PrimMonad m => MVector (PrimState m) Int8 -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Int8 -> m (MVector (PrimState m) Int8) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Int8 -> Int -> m Int8 basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Int8 -> Int -> Int8 -> m () basicClear :: PrimMonad m => MVector (PrimState m) Int8 -> m () basicSet :: PrimMonad m => MVector (PrimState m) Int8 -> Int8 -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Int8 -> MVector (PrimState m) Int8 -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Int8 -> MVector (PrimState m) Int8 -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Int8 -> Int -> m (MVector (PrimState m) Int8)
MVector MVector Int16
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Int16 -> Int basicUnsafeSlice :: Int -> Int -> MVector s Int16 -> MVector s Int16 basicOverlaps :: MVector s Int16 -> MVector s Int16 -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Int16) basicInitialize :: PrimMonad m => MVector (PrimState m) Int16 -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Int16 -> m (MVector (PrimState m) Int16) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Int16 -> Int -> m Int16 basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Int16 -> Int -> Int16 -> m () basicClear :: PrimMonad m => MVector (PrimState m) Int16 -> m () basicSet :: PrimMonad m => MVector (PrimState m) Int16 -> Int16 -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Int16 -> MVector (PrimState m) Int16 -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Int16 -> MVector (PrimState m) Int16 -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Int16 -> Int -> m (MVector (PrimState m) Int16)
MVector MVector Int32
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Int32 -> Int basicUnsafeSlice :: Int -> Int -> MVector s Int32 -> MVector s Int32 basicOverlaps :: MVector s Int32 -> MVector s Int32 -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Int32) basicInitialize :: PrimMonad m => MVector (PrimState m) Int32 -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Int32 -> m (MVector (PrimState m) Int32) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Int32 -> Int -> m Int32 basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Int32 -> Int -> Int32 -> m () basicClear :: PrimMonad m => MVector (PrimState m) Int32 -> m () basicSet :: PrimMonad m => MVector (PrimState m) Int32 -> Int32 -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Int32 -> MVector (PrimState m) Int32 -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Int32 -> MVector (PrimState m) Int32 -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Int32 -> Int -> m (MVector (PrimState m) Int32)
MVector MVector Int64
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Int64 -> Int basicUnsafeSlice :: Int -> Int -> MVector s Int64 -> MVector s Int64 basicOverlaps :: MVector s Int64 -> MVector s Int64 -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Int64) basicInitialize :: PrimMonad m => MVector (PrimState m) Int64 -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Int64 -> m (MVector (PrimState m) Int64) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Int64 -> Int -> m Int64 basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Int64 -> Int -> Int64 -> m () basicClear :: PrimMonad m => MVector (PrimState m) Int64 -> m () basicSet :: PrimMonad m => MVector (PrimState m) Int64 -> Int64 -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Int64 -> MVector (PrimState m) Int64 -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Int64 -> MVector (PrimState m) Int64 -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Int64 -> Int -> m (MVector (PrimState m) Int64)
MVector MVector Word
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Word -> Int basicUnsafeSlice :: Int -> Int -> MVector s Word -> MVector s Word basicOverlaps :: MVector s Word -> MVector s Word -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Word) basicInitialize :: PrimMonad m => MVector (PrimState m) Word -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Word -> m (MVector (PrimState m) Word) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Word -> Int -> m Word basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Word -> Int -> Word -> m () basicClear :: PrimMonad m => MVector (PrimState m) Word -> m () basicSet :: PrimMonad m => MVector (PrimState m) Word -> Word -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Word -> MVector (PrimState m) Word -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Word -> MVector (PrimState m) Word -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Word -> Int -> m (MVector (PrimState m) Word)
MVector MVector Word8
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Word8 -> Int basicUnsafeSlice :: Int -> Int -> MVector s Word8 -> MVector s Word8 basicOverlaps :: MVector s Word8 -> MVector s Word8 -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Word8) basicInitialize :: PrimMonad m => MVector (PrimState m) Word8 -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Word8 -> m (MVector (PrimState m) Word8) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Word8 -> Int -> m Word8 basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Word8 -> Int -> Word8 -> m () basicClear :: PrimMonad m => MVector (PrimState m) Word8 -> m () basicSet :: PrimMonad m => MVector (PrimState m) Word8 -> Word8 -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Word8 -> MVector (PrimState m) Word8 -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Word8 -> MVector (PrimState m) Word8 -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Word8 -> Int -> m (MVector (PrimState m) Word8)
MVector MVector Word16
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Word16 -> Int basicUnsafeSlice :: Int -> Int -> MVector s Word16 -> MVector s Word16 basicOverlaps :: MVector s Word16 -> MVector s Word16 -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Word16) basicInitialize :: PrimMonad m => MVector (PrimState m) Word16 -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Word16 -> m (MVector (PrimState m) Word16) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Word16 -> Int -> m Word16 basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Word16 -> Int -> Word16 -> m () basicClear :: PrimMonad m => MVector (PrimState m) Word16 -> m () basicSet :: PrimMonad m => MVector (PrimState m) Word16 -> Word16 -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Word16 -> MVector (PrimState m) Word16 -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Word16 -> MVector (PrimState m) Word16 -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Word16 -> Int -> m (MVector (PrimState m) Word16)
MVector MVector Word32
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Word32 -> Int basicUnsafeSlice :: Int -> Int -> MVector s Word32 -> MVector s Word32 basicOverlaps :: MVector s Word32 -> MVector s Word32 -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Word32) basicInitialize :: PrimMonad m => MVector (PrimState m) Word32 -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Word32 -> m (MVector (PrimState m) Word32) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Word32 -> Int -> m Word32 basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Word32 -> Int -> Word32 -> m () basicClear :: PrimMonad m => MVector (PrimState m) Word32 -> m () basicSet :: PrimMonad m => MVector (PrimState m) Word32 -> Word32 -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Word32 -> MVector (PrimState m) Word32 -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Word32 -> MVector (PrimState m) Word32 -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Word32 -> Int -> m (MVector (PrimState m) Word32)
MVector MVector Word64
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Word64 -> Int basicUnsafeSlice :: Int -> Int -> MVector s Word64 -> MVector s Word64 basicOverlaps :: MVector s Word64 -> MVector s Word64 -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Word64) basicInitialize :: PrimMonad m => MVector (PrimState m) Word64 -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Word64 -> m (MVector (PrimState m) Word64) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Word64 -> Int -> m Word64 basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Word64 -> Int -> Word64 -> m () basicClear :: PrimMonad m => MVector (PrimState m) Word64 -> m () basicSet :: PrimMonad m => MVector (PrimState m) Word64 -> Word64 -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Word64 -> MVector (PrimState m) Word64 -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Word64 -> MVector (PrimState m) Word64 -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Word64 -> Int -> m (MVector (PrimState m) Word64)
MVector MVector ()
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s () -> Int basicUnsafeSlice :: Int -> Int -> MVector s () -> MVector s () basicOverlaps :: MVector s () -> MVector s () -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) ()) basicInitialize :: PrimMonad m => MVector (PrimState m) () -> m () basicUnsafeReplicate :: PrimMonad m => Int -> () -> m (MVector (PrimState m) ()) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) () -> Int -> m () basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) () -> Int -> () -> m () basicClear :: PrimMonad m => MVector (PrimState m) () -> m () basicSet :: PrimMonad m => MVector (PrimState m) () -> () -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) () -> MVector (PrimState m) () -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) () -> MVector (PrimState m) () -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) () -> Int -> m (MVector (PrimState m) ())
Unbox a => MVector MVector (Complex a)
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (Complex a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (Complex a) -> MVector s (Complex a) basicOverlaps :: MVector s (Complex a) -> MVector s (Complex a) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Complex a)) basicInitialize :: PrimMonad m => MVector (PrimState m) (Complex a) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Complex a -> m (MVector (PrimState m) (Complex a)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Complex a) -> Int -> m (Complex a) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Complex a) -> Int -> Complex a -> m () basicClear :: PrimMonad m => MVector (PrimState m) (Complex a) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (Complex a) -> Complex a -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Complex a) -> MVector (PrimState m) (Complex a) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Complex a) -> MVector (PrimState m) (Complex a) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Complex a) -> Int -> m (MVector (PrimState m) (Complex a))
Unbox a => MVector MVector (V2 a)
Instance details Defined in Linear.V2 Methods basicLength :: MVector s (V2 a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (V2 a) -> MVector s (V2 a) basicOverlaps :: MVector s (V2 a) -> MVector s (V2 a) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (V2 a)) basicInitialize :: PrimMonad m => MVector (PrimState m) (V2 a) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> V2 a -> m (MVector (PrimState m) (V2 a)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (V2 a) -> Int -> m (V2 a) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (V2 a) -> Int -> V2 a -> m () basicClear :: PrimMonad m => MVector (PrimState m) (V2 a) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (V2 a) -> V2 a -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (V2 a) -> MVector (PrimState m) (V2 a) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (V2 a) -> MVector (PrimState m) (V2 a) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (V2 a) -> Int -> m (MVector (PrimState m) (V2 a))
Unbox a => MVector MVector (V3 a)
Instance details Defined in Linear.V3 Methods basicLength :: MVector s (V3 a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (V3 a) -> MVector s (V3 a) basicOverlaps :: MVector s (V3 a) -> MVector s (V3 a) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (V3 a)) basicInitialize :: PrimMonad m => MVector (PrimState m) (V3 a) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> V3 a -> m (MVector (PrimState m) (V3 a)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (V3 a) -> Int -> m (V3 a) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (V3 a) -> Int -> V3 a -> m () basicClear :: PrimMonad m => MVector (PrimState m) (V3 a) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (V3 a) -> V3 a -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (V3 a) -> MVector (PrimState m) (V3 a) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (V3 a) -> MVector (PrimState m) (V3 a) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (V3 a) -> Int -> m (MVector (PrimState m) (V3 a))
Unbox a => MVector MVector (V4 a)
Instance details Defined in Linear.V4 Methods basicLength :: MVector s (V4 a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (V4 a) -> MVector s (V4 a) basicOverlaps :: MVector s (V4 a) -> MVector s (V4 a) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (V4 a)) basicInitialize :: PrimMonad m => MVector (PrimState m) (V4 a) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> V4 a -> m (MVector (PrimState m) (V4 a)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (V4 a) -> Int -> m (V4 a) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (V4 a) -> Int -> V4 a -> m () basicClear :: PrimMonad m => MVector (PrimState m) (V4 a) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (V4 a) -> V4 a -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (V4 a) -> MVector (PrimState m) (V4 a) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (V4 a) -> MVector (PrimState m) (V4 a) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (V4 a) -> Int -> m (MVector (PrimState m) (V4 a))
Unbox a => MVector MVector (V1 a)
Instance details Defined in Linear.V1 Methods basicLength :: MVector s (V1 a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (V1 a) -> MVector s (V1 a) basicOverlaps :: MVector s (V1 a) -> MVector s (V1 a) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (V1 a)) basicInitialize :: PrimMonad m => MVector (PrimState m) (V1 a) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> V1 a -> m (MVector (PrimState m) (V1 a)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (V1 a) -> Int -> m (V1 a) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (V1 a) -> Int -> V1 a -> m () basicClear :: PrimMonad m => MVector (PrimState m) (V1 a) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (V1 a) -> V1 a -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (V1 a) -> MVector (PrimState m) (V1 a) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (V1 a) -> MVector (PrimState m) (V1 a) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (V1 a) -> Int -> m (MVector (PrimState m) (V1 a))
Unbox a => MVector MVector (Plucker a)
Instance details Defined in Linear.Plucker Methods basicLength :: MVector s (Plucker a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (Plucker a) -> MVector s (Plucker a) basicOverlaps :: MVector s (Plucker a) -> MVector s (Plucker a) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Plucker a)) basicInitialize :: PrimMonad m => MVector (PrimState m) (Plucker a) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Plucker a -> m (MVector (PrimState m) (Plucker a)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Plucker a) -> Int -> m (Plucker a) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Plucker a) -> Int -> Plucker a -> m () basicClear :: PrimMonad m => MVector (PrimState m) (Plucker a) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (Plucker a) -> Plucker a -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Plucker a) -> MVector (PrimState m) (Plucker a) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Plucker a) -> MVector (PrimState m) (Plucker a) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Plucker a) -> Int -> m (MVector (PrimState m) (Plucker a))
Unbox a => MVector MVector (Quaternion a)
Instance details Defined in Linear.Quaternion Methods basicLength :: MVector s (Quaternion a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (Quaternion a) -> MVector s (Quaternion a) basicOverlaps :: MVector s (Quaternion a) -> MVector s (Quaternion a) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Quaternion a)) basicInitialize :: PrimMonad m => MVector (PrimState m) (Quaternion a) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Quaternion a -> m (MVector (PrimState m) (Quaternion a)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Quaternion a) -> Int -> m (Quaternion a) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Quaternion a) -> Int -> Quaternion a -> m () basicClear :: PrimMonad m => MVector (PrimState m) (Quaternion a) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (Quaternion a) -> Quaternion a -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Quaternion a) -> MVector (PrimState m) (Quaternion a) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Quaternion a) -> MVector (PrimState m) (Quaternion a) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Quaternion a) -> Int -> m (MVector (PrimState m) (Quaternion a))
MVector MVector (V0 a)
Instance details Defined in Linear.V0 Methods basicLength :: MVector s (V0 a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (V0 a) -> MVector s (V0 a) basicOverlaps :: MVector s (V0 a) -> MVector s (V0 a) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (V0 a)) basicInitialize :: PrimMonad m => MVector (PrimState m) (V0 a) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> V0 a -> m (MVector (PrimState m) (V0 a)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (V0 a) -> Int -> m (V0 a) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (V0 a) -> Int -> V0 a -> m () basicClear :: PrimMonad m => MVector (PrimState m) (V0 a) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (V0 a) -> V0 a -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (V0 a) -> MVector (PrimState m) (V0 a) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (V0 a) -> MVector (PrimState m) (V0 a) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (V0 a) -> Int -> m (MVector (PrimState m) (V0 a))
(Unbox a, Unbox b) => MVector MVector (a, b)
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (a, b) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (a, b) -> MVector s (a, b) basicOverlaps :: MVector s (a, b) -> MVector s (a, b) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (a, b)) basicInitialize :: PrimMonad m => MVector (PrimState m) (a, b) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> (a, b) -> m (MVector (PrimState m) (a, b)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (a, b) -> Int -> m (a, b) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (a, b) -> Int -> (a, b) -> m () basicClear :: PrimMonad m => MVector (PrimState m) (a, b) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (a, b) -> (a, b) -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (a, b) -> MVector (PrimState m) (a, b) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (a, b) -> MVector (PrimState m) (a, b) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (a, b) -> Int -> m (MVector (PrimState m) (a, b))
Unbox (f a) => MVector MVector (Point f a)
Instance details Defined in Linear.Affine Methods basicLength :: MVector s (Point f a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (Point f a) -> MVector s (Point f a) basicOverlaps :: MVector s (Point f a) -> MVector s (Point f a) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Point f a)) basicInitialize :: PrimMonad m => MVector (PrimState m) (Point f a) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Point f a -> m (MVector (PrimState m) (Point f a)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Point f a) -> Int -> m (Point f a) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Point f a) -> Int -> Point f a -> m () basicClear :: PrimMonad m => MVector (PrimState m) (Point f a) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (Point f a) -> Point f a -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Point f a) -> MVector (PrimState m) (Point f a) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Point f a) -> MVector (PrimState m) (Point f a) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Point f a) -> Int -> m (MVector (PrimState m) (Point f a))
(Unbox a, Unbox b, Unbox c) => MVector MVector (a, b, c)
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (a, b, c) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (a, b, c) -> MVector s (a, b, c) basicOverlaps :: MVector s (a, b, c) -> MVector s (a, b, c) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (a, b, c)) basicInitialize :: PrimMonad m => MVector (PrimState m) (a, b, c) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> (a, b, c) -> m (MVector (PrimState m) (a, b, c)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (a, b, c) -> Int -> m (a, b, c) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (a, b, c) -> Int -> (a, b, c) -> m () basicClear :: PrimMonad m => MVector (PrimState m) (a, b, c) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (a, b, c) -> (a, b, c) -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (a, b, c) -> MVector (PrimState m) (a, b, c) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (a, b, c) -> MVector (PrimState m) (a, b, c) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (a, b, c) -> Int -> m (MVector (PrimState m) (a, b, c))
(Dim n, Unbox a) => MVector MVector (V n a)
Instance details Defined in Linear.V Methods basicLength :: MVector s (V n a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (V n a) -> MVector s (V n a) basicOverlaps :: MVector s (V n a) -> MVector s (V n a) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (V n a)) basicInitialize :: PrimMonad m => MVector (PrimState m) (V n a) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> V n a -> m (MVector (PrimState m) (V n a)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (V n a) -> Int -> m (V n a) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (V n a) -> Int -> V n a -> m () basicClear :: PrimMonad m => MVector (PrimState m) (V n a) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (V n a) -> V n a -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (V n a) -> MVector (PrimState m) (V n a) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (V n a) -> MVector (PrimState m) (V n a) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (V n a) -> Int -> m (MVector (PrimState m) (V n a))
(Unbox a, Unbox b, Unbox c, Unbox d) => MVector MVector (a, b, c, d)
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (a, b, c, d) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (a, b, c, d) -> MVector s (a, b, c, d) basicOverlaps :: MVector s (a, b, c, d) -> MVector s (a, b, c, d) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (a, b, c, d)) basicInitialize :: PrimMonad m => MVector (PrimState m) (a, b, c, d) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> (a, b, c, d) -> m (MVector (PrimState m) (a, b, c, d)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (a, b, c, d) -> Int -> m (a, b, c, d) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (a, b, c, d) -> Int -> (a, b, c, d) -> m () basicClear :: PrimMonad m => MVector (PrimState m) (a, b, c, d) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (a, b, c, d) -> (a, b, c, d) -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (a, b, c, d) -> MVector (PrimState m) (a, b, c, d) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (a, b, c, d) -> MVector (PrimState m) (a, b, c, d) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (a, b, c, d) -> Int -> m (MVector (PrimState m) (a, b, c, d))
(Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => MVector MVector (a, b, c, d, e)
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (a, b, c, d, e) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (a, b, c, d, e) -> MVector s (a, b, c, d, e) basicOverlaps :: MVector s (a, b, c, d, e) -> MVector s (a, b, c, d, e) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (a, b, c, d, e)) basicInitialize :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> (a, b, c, d, e) -> m (MVector (PrimState m) (a, b, c, d, e)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e) -> Int -> m (a, b, c, d, e) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e) -> Int -> (a, b, c, d, e) -> m () basicClear :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e) -> (a, b, c, d, e) -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e) -> MVector (PrimState m) (a, b, c, d, e) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e) -> MVector (PrimState m) (a, b, c, d, e) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e) -> Int -> m (MVector (PrimState m) (a, b, c, d, e))
(Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => MVector MVector (a, b, c, d, e, f)
Instance details Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (a, b, c, d, e, f) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (a, b, c, d, e, f) -> MVector s (a, b, c, d, e, f) basicOverlaps :: MVector s (a, b, c, d, e, f) -> MVector s (a, b, c, d, e, f) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (a, b, c, d, e, f)) basicInitialize :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e, f) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> (a, b, c, d, e, f) -> m (MVector (PrimState m) (a, b, c, d, e, f)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e, f) -> Int -> m (a, b, c, d, e, f) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e, f) -> Int -> (a, b, c, d, e, f) -> m () basicClear :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e, f) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e, f) -> MVector (PrimState m) (a, b, c, d, e, f) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e, f) -> MVector (PrimState m) (a, b, c, d, e, f) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (a, b, c, d, e, f) -> Int -> m (MVector (PrimState m) (a, b, c, d, e, f))
NFData (MVector s a)
Instance details Defined in Data.Vector.Unboxed.Base Methods rnf :: MVector s a -> () #
newtype MVector s Bool
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Bool = MV_Bool (MVector s Word8)
newtype MVector s Char
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Char = MV_Char (MVector s Char)
newtype MVector s Double
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Double = MV_Double (MVector s Double)
newtype MVector s Float
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Float = MV_Float (MVector s Float)
newtype MVector s Word64
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Word64 = MV_Word64 (MVector s Word64)
newtype MVector s Word32
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Word32 = MV_Word32 (MVector s Word32)
newtype MVector s Word16
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Word16 = MV_Word16 (MVector s Word16)
newtype MVector s Word8
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Word8 = MV_Word8 (MVector s Word8)
newtype MVector s Word
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Word = MV_Word (MVector s Word)
newtype MVector s Int64
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Int64 = MV_Int64 (MVector s Int64)
newtype MVector s Int32
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Int32 = MV_Int32 (MVector s Int32)
newtype MVector s Int16
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Int16 = MV_Int16 (MVector s Int16)
newtype MVector s Int8
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Int8 = MV_Int8 (MVector s Int8)
newtype MVector s Int
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s Int = MV_Int (MVector s Int)
newtype MVector s ()
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s () = MV_Unit Int
data MVector s (V4 a)
Instance details Defined in Linear.V4 data MVector s (V4 a) = MV_V4 !Int !(MVector s a)
data MVector s (V3 a)
Instance details Defined in Linear.V3 data MVector s (V3 a) = MV_V3 !Int !(MVector s a)
data MVector s (V2 a)
Instance details Defined in Linear.V2 data MVector s (V2 a) = MV_V2 !Int !(MVector s a)
newtype MVector s (V1 a)
Instance details Defined in Linear.V1 newtype MVector s (V1 a) = MV_V1 (MVector s a)
newtype MVector s (V0 a)
Instance details Defined in Linear.V0 newtype MVector s (V0 a) = MV_V0 Int
data MVector s (Quaternion a)
Instance details Defined in Linear.Quaternion data MVector s (Quaternion a) = MV_Quaternion !Int (MVector s a)
data MVector s (Plucker a)
Instance details Defined in Linear.Plucker data MVector s (Plucker a) = MV_Plucker !Int (MVector s a)
newtype MVector s (Complex a)
Instance details Defined in Data.Vector.Unboxed.Base newtype MVector s (Complex a) = MV_Complex (MVector s (a, a))
newtype MVector s (Point f a)
Instance details Defined in Linear.Affine newtype MVector s (Point f a) = MV_P (MVector s (f a))
data MVector s (a, b)
Instance details Defined in Data.Vector.Unboxed.Base data MVector s (a, b) = MV_2 !Int !(MVector s a) !(MVector s b)
data MVector s (V n a)
Instance details Defined in Linear.V data MVector s (V n a) = MV_VN !Int !(MVector s a)
data MVector s (a, b, c)
Instance details Defined in Data.Vector.Unboxed.Base data MVector s (a, b, c) = MV_3 !Int !(MVector s a) !(MVector s b) !(MVector s c)
data MVector s (a, b, c, d)
Instance details Defined in Data.Vector.Unboxed.Base data MVector s (a, b, c, d) = MV_4 !Int !(MVector s a) !(MVector s b) !(MVector s c) !(MVector s d)
data MVector s (a, b, c, d, e)
Instance details Defined in Data.Vector.Unboxed.Base data MVector s (a, b, c, d, e) = MV_5 !Int !(MVector s a) !(MVector s b) !(MVector s c) !(MVector s d) !(MVector s e)
data MVector s (a, b, c, d, e, f)
Instance details Defined in Data.Vector.Unboxed.Base data MVector s (a, b, c, d, e, f) = MV_6 !Int !(MVector s a) !(MVector s b) !(MVector s c) !(MVector s d) !(MVector s e) !(MVector s f)

data family Vector a :: Type #

Instances

Vector Vector Bool
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Bool -> m (Vector Bool) basicUnsafeThaw :: PrimMonad m => Vector Bool -> m (Mutable Vector (PrimState m) Bool) basicLength :: Vector Bool -> Int basicUnsafeSlice :: Int -> Int -> Vector Bool -> Vector Bool basicUnsafeIndexM :: Monad m => Vector Bool -> Int -> m Bool basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Bool -> Vector Bool -> m () elemseq :: Vector Bool -> Bool -> b -> b
Vector Vector Char
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Char -> m (Vector Char) basicUnsafeThaw :: PrimMonad m => Vector Char -> m (Mutable Vector (PrimState m) Char) basicLength :: Vector Char -> Int basicUnsafeSlice :: Int -> Int -> Vector Char -> Vector Char basicUnsafeIndexM :: Monad m => Vector Char -> Int -> m Char basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Char -> Vector Char -> m () elemseq :: Vector Char -> Char -> b -> b
Vector Vector Double
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Double -> m (Vector Double) basicUnsafeThaw :: PrimMonad m => Vector Double -> m (Mutable Vector (PrimState m) Double) basicLength :: Vector Double -> Int basicUnsafeSlice :: Int -> Int -> Vector Double -> Vector Double basicUnsafeIndexM :: Monad m => Vector Double -> Int -> m Double basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Double -> Vector Double -> m () elemseq :: Vector Double -> Double -> b -> b
Vector Vector Float
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Float -> m (Vector Float) basicUnsafeThaw :: PrimMonad m => Vector Float -> m (Mutable Vector (PrimState m) Float) basicLength :: Vector Float -> Int basicUnsafeSlice :: Int -> Int -> Vector Float -> Vector Float basicUnsafeIndexM :: Monad m => Vector Float -> Int -> m Float basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Float -> Vector Float -> m () elemseq :: Vector Float -> Float -> b -> b
Vector Vector Int
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Int -> m (Vector Int) basicUnsafeThaw :: PrimMonad m => Vector Int -> m (Mutable Vector (PrimState m) Int) basicLength :: Vector Int -> Int basicUnsafeSlice :: Int -> Int -> Vector Int -> Vector Int basicUnsafeIndexM :: Monad m => Vector Int -> Int -> m Int basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Int -> Vector Int -> m () elemseq :: Vector Int -> Int -> b -> b
Vector Vector Int8
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Int8 -> m (Vector Int8) basicUnsafeThaw :: PrimMonad m => Vector Int8 -> m (Mutable Vector (PrimState m) Int8) basicLength :: Vector Int8 -> Int basicUnsafeSlice :: Int -> Int -> Vector Int8 -> Vector Int8 basicUnsafeIndexM :: Monad m => Vector Int8 -> Int -> m Int8 basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Int8 -> Vector Int8 -> m () elemseq :: Vector Int8 -> Int8 -> b -> b
Vector Vector Int16
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Int16 -> m (Vector Int16) basicUnsafeThaw :: PrimMonad m => Vector Int16 -> m (Mutable Vector (PrimState m) Int16) basicLength :: Vector Int16 -> Int basicUnsafeSlice :: Int -> Int -> Vector Int16 -> Vector Int16 basicUnsafeIndexM :: Monad m => Vector Int16 -> Int -> m Int16 basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Int16 -> Vector Int16 -> m () elemseq :: Vector Int16 -> Int16 -> b -> b
Vector Vector Int32
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Int32 -> m (Vector Int32) basicUnsafeThaw :: PrimMonad m => Vector Int32 -> m (Mutable Vector (PrimState m) Int32) basicLength :: Vector Int32 -> Int basicUnsafeSlice :: Int -> Int -> Vector Int32 -> Vector Int32 basicUnsafeIndexM :: Monad m => Vector Int32 -> Int -> m Int32 basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Int32 -> Vector Int32 -> m () elemseq :: Vector Int32 -> Int32 -> b -> b
Vector Vector Int64
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Int64 -> m (Vector Int64) basicUnsafeThaw :: PrimMonad m => Vector Int64 -> m (Mutable Vector (PrimState m) Int64) basicLength :: Vector Int64 -> Int basicUnsafeSlice :: Int -> Int -> Vector Int64 -> Vector Int64 basicUnsafeIndexM :: Monad m => Vector Int64 -> Int -> m Int64 basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Int64 -> Vector Int64 -> m () elemseq :: Vector Int64 -> Int64 -> b -> b
Vector Vector Word
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Word -> m (Vector Word) basicUnsafeThaw :: PrimMonad m => Vector Word -> m (Mutable Vector (PrimState m) Word) basicLength :: Vector Word -> Int basicUnsafeSlice :: Int -> Int -> Vector Word -> Vector Word basicUnsafeIndexM :: Monad m => Vector Word -> Int -> m Word basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Word -> Vector Word -> m () elemseq :: Vector Word -> Word -> b -> b
Vector Vector Word8
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Word8 -> m (Vector Word8) basicUnsafeThaw :: PrimMonad m => Vector Word8 -> m (Mutable Vector (PrimState m) Word8) basicLength :: Vector Word8 -> Int basicUnsafeSlice :: Int -> Int -> Vector Word8 -> Vector Word8 basicUnsafeIndexM :: Monad m => Vector Word8 -> Int -> m Word8 basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Word8 -> Vector Word8 -> m () elemseq :: Vector Word8 -> Word8 -> b -> b
Vector Vector Word16
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Word16 -> m (Vector Word16) basicUnsafeThaw :: PrimMonad m => Vector Word16 -> m (Mutable Vector (PrimState m) Word16) basicLength :: Vector Word16 -> Int basicUnsafeSlice :: Int -> Int -> Vector Word16 -> Vector Word16 basicUnsafeIndexM :: Monad m => Vector Word16 -> Int -> m Word16 basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Word16 -> Vector Word16 -> m () elemseq :: Vector Word16 -> Word16 -> b -> b
Vector Vector Word32
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Word32 -> m (Vector Word32) basicUnsafeThaw :: PrimMonad m => Vector Word32 -> m (Mutable Vector (PrimState m) Word32) basicLength :: Vector Word32 -> Int basicUnsafeSlice :: Int -> Int -> Vector Word32 -> Vector Word32 basicUnsafeIndexM :: Monad m => Vector Word32 -> Int -> m Word32 basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Word32 -> Vector Word32 -> m () elemseq :: Vector Word32 -> Word32 -> b -> b
Vector Vector Word64
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Word64 -> m (Vector Word64) basicUnsafeThaw :: PrimMonad m => Vector Word64 -> m (Mutable Vector (PrimState m) Word64) basicLength :: Vector Word64 -> Int basicUnsafeSlice :: Int -> Int -> Vector Word64 -> Vector Word64 basicUnsafeIndexM :: Monad m => Vector Word64 -> Int -> m Word64 basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Word64 -> Vector Word64 -> m () elemseq :: Vector Word64 -> Word64 -> b -> b
Vector Vector ()
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) () -> m (Vector ()) basicUnsafeThaw :: PrimMonad m => Vector () -> m (Mutable Vector (PrimState m) ()) basicLength :: Vector () -> Int basicUnsafeSlice :: Int -> Int -> Vector () -> Vector () basicUnsafeIndexM :: Monad m => Vector () -> Int -> m () basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) () -> Vector () -> m () elemseq :: Vector () -> () -> b -> b
Unbox a => Vector Vector (Complex a)
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Complex a) -> m (Vector (Complex a)) basicUnsafeThaw :: PrimMonad m => Vector (Complex a) -> m (Mutable Vector (PrimState m) (Complex a)) basicLength :: Vector (Complex a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (Complex a) -> Vector (Complex a) basicUnsafeIndexM :: Monad m => Vector (Complex a) -> Int -> m (Complex a) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Complex a) -> Vector (Complex a) -> m () elemseq :: Vector (Complex a) -> Complex a -> b -> b
Unbox a => Vector Vector (V2 a)
Instance details Defined in Linear.V2 Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (V2 a) -> m (Vector (V2 a)) basicUnsafeThaw :: PrimMonad m => Vector (V2 a) -> m (Mutable Vector (PrimState m) (V2 a)) basicLength :: Vector (V2 a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (V2 a) -> Vector (V2 a) basicUnsafeIndexM :: Monad m => Vector (V2 a) -> Int -> m (V2 a) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (V2 a) -> Vector (V2 a) -> m () elemseq :: Vector (V2 a) -> V2 a -> b -> b
Unbox a => Vector Vector (V3 a)
Instance details Defined in Linear.V3 Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (V3 a) -> m (Vector (V3 a)) basicUnsafeThaw :: PrimMonad m => Vector (V3 a) -> m (Mutable Vector (PrimState m) (V3 a)) basicLength :: Vector (V3 a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (V3 a) -> Vector (V3 a) basicUnsafeIndexM :: Monad m => Vector (V3 a) -> Int -> m (V3 a) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (V3 a) -> Vector (V3 a) -> m () elemseq :: Vector (V3 a) -> V3 a -> b -> b
Unbox a => Vector Vector (V4 a)
Instance details Defined in Linear.V4 Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (V4 a) -> m (Vector (V4 a)) basicUnsafeThaw :: PrimMonad m => Vector (V4 a) -> m (Mutable Vector (PrimState m) (V4 a)) basicLength :: Vector (V4 a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (V4 a) -> Vector (V4 a) basicUnsafeIndexM :: Monad m => Vector (V4 a) -> Int -> m (V4 a) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (V4 a) -> Vector (V4 a) -> m () elemseq :: Vector (V4 a) -> V4 a -> b -> b
Unbox a => Vector Vector (V1 a)
Instance details Defined in Linear.V1 Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (V1 a) -> m (Vector (V1 a)) basicUnsafeThaw :: PrimMonad m => Vector (V1 a) -> m (Mutable Vector (PrimState m) (V1 a)) basicLength :: Vector (V1 a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (V1 a) -> Vector (V1 a) basicUnsafeIndexM :: Monad m => Vector (V1 a) -> Int -> m (V1 a) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (V1 a) -> Vector (V1 a) -> m () elemseq :: Vector (V1 a) -> V1 a -> b -> b
Unbox a => Vector Vector (Plucker a)
Instance details Defined in Linear.Plucker Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Plucker a) -> m (Vector (Plucker a)) basicUnsafeThaw :: PrimMonad m => Vector (Plucker a) -> m (Mutable Vector (PrimState m) (Plucker a)) basicLength :: Vector (Plucker a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (Plucker a) -> Vector (Plucker a) basicUnsafeIndexM :: Monad m => Vector (Plucker a) -> Int -> m (Plucker a) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Plucker a) -> Vector (Plucker a) -> m () elemseq :: Vector (Plucker a) -> Plucker a -> b -> b
Unbox a => Vector Vector (Quaternion a)
Instance details Defined in Linear.Quaternion Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Quaternion a) -> m (Vector (Quaternion a)) basicUnsafeThaw :: PrimMonad m => Vector (Quaternion a) -> m (Mutable Vector (PrimState m) (Quaternion a)) basicLength :: Vector (Quaternion a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (Quaternion a) -> Vector (Quaternion a) basicUnsafeIndexM :: Monad m => Vector (Quaternion a) -> Int -> m (Quaternion a) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Quaternion a) -> Vector (Quaternion a) -> m () elemseq :: Vector (Quaternion a) -> Quaternion a -> b -> b
Vector Vector (V0 a)
Instance details Defined in Linear.V0 Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (V0 a) -> m (Vector (V0 a)) basicUnsafeThaw :: PrimMonad m => Vector (V0 a) -> m (Mutable Vector (PrimState m) (V0 a)) basicLength :: Vector (V0 a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (V0 a) -> Vector (V0 a) basicUnsafeIndexM :: Monad m => Vector (V0 a) -> Int -> m (V0 a) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (V0 a) -> Vector (V0 a) -> m () elemseq :: Vector (V0 a) -> V0 a -> b -> b
(Unbox a, Unbox b) => Vector Vector (a, b)
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (a, b) -> m (Vector (a, b)) basicUnsafeThaw :: PrimMonad m => Vector (a, b) -> m (Mutable Vector (PrimState m) (a, b)) basicLength :: Vector (a, b) -> Int basicUnsafeSlice :: Int -> Int -> Vector (a, b) -> Vector (a, b) basicUnsafeIndexM :: Monad m => Vector (a, b) -> Int -> m (a, b) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (a, b) -> Vector (a, b) -> m () elemseq :: Vector (a, b) -> (a, b) -> b0 -> b0
Unbox (f a) => Vector Vector (Point f a)
Instance details Defined in Linear.Affine Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Point f a) -> m (Vector (Point f a)) basicUnsafeThaw :: PrimMonad m => Vector (Point f a) -> m (Mutable Vector (PrimState m) (Point f a)) basicLength :: Vector (Point f a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (Point f a) -> Vector (Point f a) basicUnsafeIndexM :: Monad m => Vector (Point f a) -> Int -> m (Point f a) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Point f a) -> Vector (Point f a) -> m () elemseq :: Vector (Point f a) -> Point f a -> b -> b
(Unbox a, Unbox b, Unbox c) => Vector Vector (a, b, c)
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (a, b, c) -> m (Vector (a, b, c)) basicUnsafeThaw :: PrimMonad m => Vector (a, b, c) -> m (Mutable Vector (PrimState m) (a, b, c)) basicLength :: Vector (a, b, c) -> Int basicUnsafeSlice :: Int -> Int -> Vector (a, b, c) -> Vector (a, b, c) basicUnsafeIndexM :: Monad m => Vector (a, b, c) -> Int -> m (a, b, c) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (a, b, c) -> Vector (a, b, c) -> m () elemseq :: Vector (a, b, c) -> (a, b, c) -> b0 -> b0
(Dim n, Unbox a) => Vector Vector (V n a)
Instance details Defined in Linear.V Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (V n a) -> m (Vector (V n a)) basicUnsafeThaw :: PrimMonad m => Vector (V n a) -> m (Mutable Vector (PrimState m) (V n a)) basicLength :: Vector (V n a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (V n a) -> Vector (V n a) basicUnsafeIndexM :: Monad m => Vector (V n a) -> Int -> m (V n a) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (V n a) -> Vector (V n a) -> m () elemseq :: Vector (V n a) -> V n a -> b -> b
(Unbox a, Unbox b, Unbox c, Unbox d) => Vector Vector (a, b, c, d)
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (a, b, c, d) -> m (Vector (a, b, c, d)) basicUnsafeThaw :: PrimMonad m => Vector (a, b, c, d) -> m (Mutable Vector (PrimState m) (a, b, c, d)) basicLength :: Vector (a, b, c, d) -> Int basicUnsafeSlice :: Int -> Int -> Vector (a, b, c, d) -> Vector (a, b, c, d) basicUnsafeIndexM :: Monad m => Vector (a, b, c, d) -> Int -> m (a, b, c, d) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (a, b, c, d) -> Vector (a, b, c, d) -> m () elemseq :: Vector (a, b, c, d) -> (a, b, c, d) -> b0 -> b0
(Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => Vector Vector (a, b, c, d, e)
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (a, b, c, d, e) -> m (Vector (a, b, c, d, e)) basicUnsafeThaw :: PrimMonad m => Vector (a, b, c, d, e) -> m (Mutable Vector (PrimState m) (a, b, c, d, e)) basicLength :: Vector (a, b, c, d, e) -> Int basicUnsafeSlice :: Int -> Int -> Vector (a, b, c, d, e) -> Vector (a, b, c, d, e) basicUnsafeIndexM :: Monad m => Vector (a, b, c, d, e) -> Int -> m (a, b, c, d, e) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (a, b, c, d, e) -> Vector (a, b, c, d, e) -> m () elemseq :: Vector (a, b, c, d, e) -> (a, b, c, d, e) -> b0 -> b0
(Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => Vector Vector (a, b, c, d, e, f)
Instance details Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (a, b, c, d, e, f) -> m (Vector (a, b, c, d, e, f)) basicUnsafeThaw :: PrimMonad m => Vector (a, b, c, d, e, f) -> m (Mutable Vector (PrimState m) (a, b, c, d, e, f)) basicLength :: Vector (a, b, c, d, e, f) -> Int basicUnsafeSlice :: Int -> Int -> Vector (a, b, c, d, e, f) -> Vector (a, b, c, d, e, f) basicUnsafeIndexM :: Monad m => Vector (a, b, c, d, e, f) -> Int -> m (a, b, c, d, e, f) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (a, b, c, d, e, f) -> Vector (a, b, c, d, e, f) -> m () elemseq :: Vector (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> b0 -> b0
(Data a, Unbox a) => Data (Vector a)
Instance details Defined in Data.Vector.Unboxed.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Vector a -> c (Vector a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Vector a) # toConstr :: Vector a -> Constr # dataTypeOf :: Vector a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Vector a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Vector a)) # gmapT :: (forall b. Data b => b -> b) -> Vector a -> Vector a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Vector a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Vector a -> r # gmapQ :: (forall d. Data d => d -> u) -> Vector a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Vector a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a) #
NFData (Vector a)
Instance details Defined in Data.Vector.Unboxed.Base Methods rnf :: Vector a -> () #
(Vector Vector a, ToJSON a) => ToJSON (Vector a)
Instance details Defined in Data.Aeson.Types.ToJSON Methods toJSON :: Vector a -> Value toEncoding :: Vector a -> Encoding toJSONList :: [Vector a] -> Value toEncodingList :: [Vector a] -> Encoding
Unbox a => Ixed (Vector a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Vector a) -> Traversal' (Vector a) (IxValue (Vector a)) #
Unbox a => AsEmpty (Vector a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (Vector a) () #
Unbox a => Reversing (Vector a)
Instance details Defined in Control.Lens.Internal.Iso Methods reversing :: Vector a -> Vector a #
Unbox a => Wrapped (Vector a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Vector a) :: Type # Methods _Wrapped' :: Iso' (Vector a) (Unwrapped (Vector a)) #
(Unbox a, t ~ Vector a') => Rewrapped (Vector a) t
Instance details Defined in Control.Lens.Wrapped
(Unbox a, Unbox b) => Cons (Vector a) (Vector b) a b
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism (Vector a) (Vector b) (a, Vector a) (b, Vector b) #
(Unbox a, Unbox b) => Snoc (Vector a) (Vector b) a b
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism (Vector a) (Vector b) (Vector a, a) (Vector b, b) #
(Unbox a, Unbox b) => Each (Vector a) (Vector b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (Vector a) (Vector b) a b #
newtype Vector Bool
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Bool = V_Bool (Vector Word8)
newtype Vector Char
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Char = V_Char (Vector Char)
newtype Vector Double
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Double = V_Double (Vector Double)
newtype Vector Float
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Float = V_Float (Vector Float)
newtype Vector Int
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Int = V_Int (Vector Int)
newtype Vector Int8
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Int8 = V_Int8 (Vector Int8)
newtype Vector Int16
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Int16 = V_Int16 (Vector Int16)
newtype Vector Int32
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Int32 = V_Int32 (Vector Int32)
newtype Vector Int64
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Int64 = V_Int64 (Vector Int64)
newtype Vector Word
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Word = V_Word (Vector Word)
newtype Vector Word8
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Word8 = V_Word8 (Vector Word8)
newtype Vector Word16
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Word16 = V_Word16 (Vector Word16)
newtype Vector Word32
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Word32 = V_Word32 (Vector Word32)
newtype Vector Word64
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector Word64 = V_Word64 (Vector Word64)
newtype Vector ()
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector () = V_Unit Int
type Mutable Vector
Instance details Defined in Data.Vector.Unboxed.Base type Mutable Vector = MVector
type Item (Vector e)
Instance details Defined in Data.Vector.Unboxed type Item (Vector e) = e
newtype Vector (Complex a)
Instance details Defined in Data.Vector.Unboxed.Base newtype Vector (Complex a) = V_Complex (Vector (a, a))
data Vector (V2 a)
Instance details Defined in Linear.V2 data Vector (V2 a) = V_V2 !Int !(Vector a)
data Vector (V3 a)
Instance details Defined in Linear.V3 data Vector (V3 a) = V_V3 !Int !(Vector a)
data Vector (V4 a)
Instance details Defined in Linear.V4 data Vector (V4 a) = V_V4 !Int !(Vector a)
newtype Vector (V1 a)
Instance details Defined in Linear.V1 newtype Vector (V1 a) = V_V1 (Vector a)
data Vector (Plucker a)
Instance details Defined in Linear.Plucker data Vector (Plucker a) = V_Plucker !Int (Vector a)
data Vector (Quaternion a)
Instance details Defined in Linear.Quaternion data Vector (Quaternion a) = V_Quaternion !Int (Vector a)
newtype Vector (V0 a)
Instance details Defined in Linear.V0 newtype Vector (V0 a) = V_V0 Int
type Index (Vector a)
Instance details Defined in Control.Lens.At type Index (Vector a) = Int
type IxValue (Vector a)
Instance details Defined in Control.Lens.At type IxValue (Vector a) = a
type Unwrapped (Vector a)
Instance details Defined in Control.Lens.Wrapped type Unwrapped (Vector a) = [a]
data Vector (a, b)
Instance details Defined in Data.Vector.Unboxed.Base data Vector (a, b) = V_2 !Int !(Vector a) !(Vector b)
newtype Vector (Point f a)
Instance details Defined in Linear.Affine newtype Vector (Point f a) = V_P (Vector (f a))
data Vector (a, b, c)
Instance details Defined in Data.Vector.Unboxed.Base data Vector (a, b, c) = V_3 !Int !(Vector a) !(Vector b) !(Vector c)
data Vector (V n a)
Instance details Defined in Linear.V data Vector (V n a) = V_VN !Int !(Vector a)
data Vector (a, b, c, d)
Instance details Defined in Data.Vector.Unboxed.Base data Vector (a, b, c, d) = V_4 !Int !(Vector a) !(Vector b) !(Vector c) !(Vector d)
data Vector (a, b, c, d, e)
Instance details Defined in Data.Vector.Unboxed.Base data Vector (a, b, c, d, e) = V_5 !Int !(Vector a) !(Vector b) !(Vector c) !(Vector d) !(Vector e)
data Vector (a, b, c, d, e, f)
Instance details Defined in Data.Vector.Unboxed.Base data Vector (a, b, c, d, e, f) = V_6 !Int !(Vector a) !(Vector b) !(Vector c) !(Vector d) !(Vector e) !(Vector f)

sRGBBounded :: (Ord b, Floating b, Integral a, Bounded a) => a -> a -> a -> Colour b #

data RGB a #

Constructors

RGB
Fields channelRed :: !a channelGreen :: !a channelBlue :: !a

Instances

Functor RGB
Instance details Defined in Data.Colour.RGB Methods fmap :: (a -> b) -> RGB a -> RGB b # (<$) :: a -> RGB b -> RGB a #
Applicative RGB
Instance details Defined in Data.Colour.RGB Methods pure :: a -> RGB a # (<>) :: RGB (a -> b) -> RGB a -> RGB b # liftA2 :: (a -> b -> c) -> RGB a -> RGB b -> RGB c # (>) :: RGB a -> RGB b -> RGB b # (<*) :: RGB a -> RGB b -> RGB a #
Eq a => Eq (RGB a)
Instance details Defined in Data.Colour.RGB Methods (==) :: RGB a -> RGB a -> Bool # (/=) :: RGB a -> RGB a -> Bool #
Read a => Read (RGB a)
Instance details Defined in Data.Colour.RGB Methods readsPrec :: Int -> ReadS (RGB a) # readList :: ReadS [RGB a] # readPrec :: ReadPrec (RGB a) # readListPrec :: ReadPrec [RGB a] #
Show a => Show (RGB a)
Instance details Defined in Data.Colour.RGB Methods showsPrec :: Int -> RGB a -> ShowS # show :: RGB a -> String # showList :: [RGB a] -> ShowS #

toSRGBBounded :: (RealFrac b, Floating b, Integral a, Bounded a) => Colour b -> RGB a #

class Profunctor (p :: Type -> Type -> Type) where #

Minimal complete definition

dimap | lmap, rmap

Methods

dimap :: (a -> b) -> (c -> d) -> p b c -> p a d #

lmap :: (a -> b) -> p b c -> p a c #

rmap :: (b -> c) -> p a b -> p a c #

Instances

Profunctor Measured
Instance details Defined in Diagrams.Core.Measure Methods dimap :: (a -> b) -> (c -> d) -> Measured b c -> Measured a d # lmap :: (a -> b) -> Measured b c -> Measured a c # rmap :: (b -> c) -> Measured a b -> Measured a c # (#.) :: Coercible c b => q b c -> Measured a b -> Measured a c (.#) :: Coercible b a => Measured b c -> q a b -> Measured a c
Profunctor ReifiedFold
Instance details Defined in Control.Lens.Reified Methods dimap :: (a -> b) -> (c -> d) -> ReifiedFold b c -> ReifiedFold a d # lmap :: (a -> b) -> ReifiedFold b c -> ReifiedFold a c # rmap :: (b -> c) -> ReifiedFold a b -> ReifiedFold a c # (#.) :: Coercible c b => q b c -> ReifiedFold a b -> ReifiedFold a c (.#) :: Coercible b a => ReifiedFold b c -> q a b -> ReifiedFold a c
Profunctor ReifiedGetter
Instance details Defined in Control.Lens.Reified Methods dimap :: (a -> b) -> (c -> d) -> ReifiedGetter b c -> ReifiedGetter a d # lmap :: (a -> b) -> ReifiedGetter b c -> ReifiedGetter a c # rmap :: (b -> c) -> ReifiedGetter a b -> ReifiedGetter a c # (#.) :: Coercible c b => q b c -> ReifiedGetter a b -> ReifiedGetter a c (.#) :: Coercible b a => ReifiedGetter b c -> q a b -> ReifiedGetter a c
Monad m => Profunctor (Kleisli m)
Instance details Defined in Data.Profunctor.Unsafe Methods dimap :: (a -> b) -> (c -> d) -> Kleisli m b c -> Kleisli m a d # lmap :: (a -> b) -> Kleisli m b c -> Kleisli m a c # rmap :: (b -> c) -> Kleisli m a b -> Kleisli m a c # (#.) :: Coercible c b => q b c -> Kleisli m a b -> Kleisli m a c (.#) :: Coercible b a => Kleisli m b c -> q a b -> Kleisli m a c
Profunctor (Tagged :: Type -> Type -> Type)
Instance details Defined in Data.Profunctor.Unsafe Methods dimap :: (a -> b) -> (c -> d) -> Tagged b c -> Tagged a d # lmap :: (a -> b) -> Tagged b c -> Tagged a c # rmap :: (b -> c) -> Tagged a b -> Tagged a c # (#.) :: Coercible c b => q b c -> Tagged a b -> Tagged a c (.#) :: Coercible b a => Tagged b c -> q a b -> Tagged a c
Functor h => Profunctor (Colonnade h)
Instance details Defined in Colonnade.Encode Methods dimap :: (a -> b) -> (c -> d) -> Colonnade h b c -> Colonnade h a d # lmap :: (a -> b) -> Colonnade h b c -> Colonnade h a c # rmap :: (b -> c) -> Colonnade h a b -> Colonnade h a c # (#.) :: Coercible c b => q b c -> Colonnade h a b -> Colonnade h a c (.#) :: Coercible b a => Colonnade h b c -> q a b -> Colonnade h a c
Functor h => Profunctor (OneColonnade h)
Instance details Defined in Colonnade.Encode Methods dimap :: (a -> b) -> (c -> d) -> OneColonnade h b c -> OneColonnade h a d # lmap :: (a -> b) -> OneColonnade h b c -> OneColonnade h a c # rmap :: (b -> c) -> OneColonnade h a b -> OneColonnade h a c # (#.) :: Coercible c b => q b c -> OneColonnade h a b -> OneColonnade h a c (.#) :: Coercible b a => OneColonnade h b c -> q a b -> OneColonnade h a c
Functor v => Profunctor (Query v)
Instance details Defined in Diagrams.Core.Query Methods dimap :: (a -> b) -> (c -> d) -> Query v b c -> Query v a d # lmap :: (a -> b) -> Query v b c -> Query v a c # rmap :: (b -> c) -> Query v a b -> Query v a c # (#.) :: Coercible c b => q b c -> Query v a b -> Query v a c (.#) :: Coercible b a => Query v b c -> q a b -> Query v a c
Profunctor (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed Methods dimap :: (a -> b) -> (c -> d) -> Indexed i b c -> Indexed i a d # lmap :: (a -> b) -> Indexed i b c -> Indexed i a c # rmap :: (b -> c) -> Indexed i a b -> Indexed i a c # (#.) :: Coercible c b => q b c -> Indexed i a b -> Indexed i a c (.#) :: Coercible b a => Indexed i b c -> q a b -> Indexed i a c
Profunctor (ReifiedIndexedFold i)
Instance details Defined in Control.Lens.Reified Methods dimap :: (a -> b) -> (c -> d) -> ReifiedIndexedFold i b c -> ReifiedIndexedFold i a d # lmap :: (a -> b) -> ReifiedIndexedFold i b c -> ReifiedIndexedFold i a c # rmap :: (b -> c) -> ReifiedIndexedFold i a b -> ReifiedIndexedFold i a c # (#.) :: Coercible c b => q b c -> ReifiedIndexedFold i a b -> ReifiedIndexedFold i a c (.#) :: Coercible b a => ReifiedIndexedFold i b c -> q a b -> ReifiedIndexedFold i a c
Profunctor (ReifiedIndexedGetter i)
Instance details Defined in Control.Lens.Reified Methods dimap :: (a -> b) -> (c -> d) -> ReifiedIndexedGetter i b c -> ReifiedIndexedGetter i a d # lmap :: (a -> b) -> ReifiedIndexedGetter i b c -> ReifiedIndexedGetter i a c # rmap :: (b -> c) -> ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i a c # (#.) :: Coercible c b => q b c -> ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i a c (.#) :: Coercible b a => ReifiedIndexedGetter i b c -> q a b -> ReifiedIndexedGetter i a c
Functor f => Profunctor (Costar f)
Instance details Defined in Data.Profunctor.Types Methods dimap :: (a -> b) -> (c -> d) -> Costar f b c -> Costar f a d # lmap :: (a -> b) -> Costar f b c -> Costar f a c # rmap :: (b -> c) -> Costar f a b -> Costar f a c # (#.) :: Coercible c b => q b c -> Costar f a b -> Costar f a c (.#) :: Coercible b a => Costar f b c -> q a b -> Costar f a c
Profunctor (Forget r)
Instance details Defined in Data.Profunctor.Types Methods dimap :: (a -> b) -> (c -> d) -> Forget r b c -> Forget r a d # lmap :: (a -> b) -> Forget r b c -> Forget r a c # rmap :: (b -> c) -> Forget r a b -> Forget r a c # (#.) :: Coercible c b => q b c -> Forget r a b -> Forget r a c (.#) :: Coercible b a => Forget r b c -> q a b -> Forget r a c
Functor f => Profunctor (Star f)
Instance details Defined in Data.Profunctor.Types Methods dimap :: (a -> b) -> (c -> d) -> Star f b c -> Star f a d # lmap :: (a -> b) -> Star f b c -> Star f a c # rmap :: (b -> c) -> Star f a b -> Star f a c # (#.) :: Coercible c b => q b c -> Star f a b -> Star f a c (.#) :: Coercible b a => Star f b c -> q a b -> Star f a c
Arrow p => Profunctor (WrappedArrow p)
Instance details Defined in Data.Profunctor.Types Methods dimap :: (a -> b) -> (c -> d) -> WrappedArrow p b c -> WrappedArrow p a d # lmap :: (a -> b) -> WrappedArrow p b c -> WrappedArrow p a c # rmap :: (b -> c) -> WrappedArrow p a b -> WrappedArrow p a c # (#.) :: Coercible c b => q b c -> WrappedArrow p a b -> WrappedArrow p a c (.#) :: Coercible b a => WrappedArrow p b c -> q a b -> WrappedArrow p a c
Profunctor (CopastroSum p)
Instance details Defined in Data.Profunctor.Choice Methods dimap :: (a -> b) -> (c -> d) -> CopastroSum p b c -> CopastroSum p a d # lmap :: (a -> b) -> CopastroSum p b c -> CopastroSum p a c # rmap :: (b -> c) -> CopastroSum p a b -> CopastroSum p a c # (#.) :: Coercible c b => q b c -> CopastroSum p a b -> CopastroSum p a c (.#) :: Coercible b a => CopastroSum p b c -> q a b -> CopastroSum p a c
Profunctor (CotambaraSum p)
Instance details Defined in Data.Profunctor.Choice Methods dimap :: (a -> b) -> (c -> d) -> CotambaraSum p b c -> CotambaraSum p a d # lmap :: (a -> b) -> CotambaraSum p b c -> CotambaraSum p a c # rmap :: (b -> c) -> CotambaraSum p a b -> CotambaraSum p a c # (#.) :: Coercible c b => q b c -> CotambaraSum p a b -> CotambaraSum p a c (.#) :: Coercible b a => CotambaraSum p b c -> q a b -> CotambaraSum p a c
Profunctor (PastroSum p)
Instance details Defined in Data.Profunctor.Choice Methods dimap :: (a -> b) -> (c -> d) -> PastroSum p b c -> PastroSum p a d # lmap :: (a -> b) -> PastroSum p b c -> PastroSum p a c # rmap :: (b -> c) -> PastroSum p a b -> PastroSum p a c # (#.) :: Coercible c b => q b c -> PastroSum p a b -> PastroSum p a c (.#) :: Coercible b a => PastroSum p b c -> q a b -> PastroSum p a c
Profunctor p => Profunctor (TambaraSum p)
Instance details Defined in Data.Profunctor.Choice Methods dimap :: (a -> b) -> (c -> d) -> TambaraSum p b c -> TambaraSum p a d # lmap :: (a -> b) -> TambaraSum p b c -> TambaraSum p a c # rmap :: (b -> c) -> TambaraSum p a b -> TambaraSum p a c # (#.) :: Coercible c b => q b c -> TambaraSum p a b -> TambaraSum p a c (.#) :: Coercible b a => TambaraSum p b c -> q a b -> TambaraSum p a c
Profunctor p => Profunctor (Tambara p)
Instance details Defined in Data.Profunctor.Strong Methods dimap :: (a -> b) -> (c -> d) -> Tambara p b c -> Tambara p a d # lmap :: (a -> b) -> Tambara p b c -> Tambara p a c # rmap :: (b -> c) -> Tambara p a b -> Tambara p a c # (#.) :: Coercible c b => q b c -> Tambara p a b -> Tambara p a c (.#) :: Coercible b a => Tambara p b c -> q a b -> Tambara p a c
Profunctor (Copastro p)
Instance details Defined in Data.Profunctor.Strong Methods dimap :: (a -> b) -> (c -> d) -> Copastro p b c -> Copastro p a d # lmap :: (a -> b) -> Copastro p b c -> Copastro p a c # rmap :: (b -> c) -> Copastro p a b -> Copastro p a c # (#.) :: Coercible c b => q b c -> Copastro p a b -> Copastro p a c (.#) :: Coercible b a => Copastro p b c -> q a b -> Copastro p a c
Profunctor (Cotambara p)
Instance details Defined in Data.Profunctor.Strong Methods dimap :: (a -> b) -> (c -> d) -> Cotambara p b c -> Cotambara p a d # lmap :: (a -> b) -> Cotambara p b c -> Cotambara p a c # rmap :: (b -> c) -> Cotambara p a b -> Cotambara p a c # (#.) :: Coercible c b => q b c -> Cotambara p a b -> Cotambara p a c (.#) :: Coercible b a => Cotambara p b c -> q a b -> Cotambara p a c
Profunctor (Pastro p)
Instance details Defined in Data.Profunctor.Strong Methods dimap :: (a -> b) -> (c -> d) -> Pastro p b c -> Pastro p a d # lmap :: (a -> b) -> Pastro p b c -> Pastro p a c # rmap :: (b -> c) -> Pastro p a b -> Pastro p a c # (#.) :: Coercible c b => q b c -> Pastro p a b -> Pastro p a c (.#) :: Coercible b a => Pastro p b c -> q a b -> Pastro p a c
Profunctor ((->) :: Type -> Type -> Type)
Instance details Defined in Data.Profunctor.Unsafe Methods dimap :: (a -> b) -> (c -> d) -> (b -> c) -> a -> d # lmap :: (a -> b) -> (b -> c) -> a -> c # rmap :: (b -> c) -> (a -> b) -> a -> c # (#.) :: Coercible c b => q b c -> (a -> b) -> a -> c (.#) :: Coercible b a => (b -> c) -> q a b -> a -> c
Functor h => Profunctor (Cornice h p)
Instance details Defined in Colonnade.Encode Methods dimap :: (a -> b) -> (c -> d) -> Cornice h p b c -> Cornice h p a d # lmap :: (a -> b) -> Cornice h p b c -> Cornice h p a c # rmap :: (b -> c) -> Cornice h p a b -> Cornice h p a c # (#.) :: Coercible c b => q b c -> Cornice h p a b -> Cornice h p a c (.#) :: Coercible b a => Cornice h p b c -> q a b -> Cornice h p a c
Profunctor (Exchange a b)
Instance details Defined in Control.Lens.Internal.Iso Methods dimap :: (a0 -> b0) -> (c -> d) -> Exchange a b b0 c -> Exchange a b a0 d # lmap :: (a0 -> b0) -> Exchange a b b0 c -> Exchange a b a0 c # rmap :: (b0 -> c) -> Exchange a b a0 b0 -> Exchange a b a0 c # (#.) :: Coercible c b0 => q b0 c -> Exchange a b a0 b0 -> Exchange a b a0 c (.#) :: Coercible b0 a0 => Exchange a b b0 c -> q a0 b0 -> Exchange a b a0 c
(Profunctor p, Profunctor q) => Profunctor (Procompose p q)
Instance details Defined in Data.Profunctor.Composition Methods dimap :: (a -> b) -> (c -> d) -> Procompose p q b c -> Procompose p q a d # lmap :: (a -> b) -> Procompose p q b c -> Procompose p q a c # rmap :: (b -> c) -> Procompose p q a b -> Procompose p q a c # (#.) :: Coercible c b => q0 b c -> Procompose p q a b -> Procompose p q a c (.#) :: Coercible b a => Procompose p q b c -> q0 a b -> Procompose p q a c
(Profunctor p, Profunctor q) => Profunctor (Rift p q)
Instance details Defined in Data.Profunctor.Composition Methods dimap :: (a -> b) -> (c -> d) -> Rift p q b c -> Rift p q a d # lmap :: (a -> b) -> Rift p q b c -> Rift p q a c # rmap :: (b -> c) -> Rift p q a b -> Rift p q a c # (#.) :: Coercible c b => q0 b c -> Rift p q a b -> Rift p q a c (.#) :: Coercible b a => Rift p q b c -> q0 a b -> Rift p q a c
Functor w => Profunctor (Cokleisli w)
Instance details Defined in Data.Profunctor.Unsafe Methods dimap :: (a -> b) -> (c -> d) -> Cokleisli w b c -> Cokleisli w a d # lmap :: (a -> b) -> Cokleisli w b c -> Cokleisli w a c # rmap :: (b -> c) -> Cokleisli w a b -> Cokleisli w a c # (#.) :: Coercible c b => q b c -> Cokleisli w a b -> Cokleisli w a c (.#) :: Coercible b a => Cokleisli w b c -> q a b -> Cokleisli w a c
Contravariant f => Profunctor (Clown f :: Type -> Type -> Type)
Instance details Defined in Data.Profunctor.Unsafe Methods dimap :: (a -> b) -> (c -> d) -> Clown f b c -> Clown f a d # lmap :: (a -> b) -> Clown f b c -> Clown f a c # rmap :: (b -> c) -> Clown f a b -> Clown f a c # (#.) :: Coercible c b => q b c -> Clown f a b -> Clown f a c (.#) :: Coercible b a => Clown f b c -> q a b -> Clown f a c
Functor f => Profunctor (Joker f :: Type -> Type -> Type)
Instance details Defined in Data.Profunctor.Unsafe Methods dimap :: (a -> b) -> (c -> d) -> Joker f b c -> Joker f a d # lmap :: (a -> b) -> Joker f b c -> Joker f a c # rmap :: (b -> c) -> Joker f a b -> Joker f a c # (#.) :: Coercible c b => q b c -> Joker f a b -> Joker f a c (.#) :: Coercible b a => Joker f b c -> q a b -> Joker f a c
(Profunctor p, Profunctor q) => Profunctor (Product p q)
Instance details Defined in Data.Profunctor.Unsafe Methods dimap :: (a -> b) -> (c -> d) -> Product p q b c -> Product p q a d # lmap :: (a -> b) -> Product p q b c -> Product p q a c # rmap :: (b -> c) -> Product p q a b -> Product p q a c # (#.) :: Coercible c b => q0 b c -> Product p q a b -> Product p q a c (.#) :: Coercible b a => Product p q b c -> q0 a b -> Product p q a c
(Profunctor p, Profunctor q) => Profunctor (Sum p q)
Instance details Defined in Data.Profunctor.Unsafe Methods dimap :: (a -> b) -> (c -> d) -> Sum p q b c -> Sum p q a d # lmap :: (a -> b) -> Sum p q b c -> Sum p q a c # rmap :: (b -> c) -> Sum p q a b -> Sum p q a c # (#.) :: Coercible c b => q0 b c -> Sum p q a b -> Sum p q a c (.#) :: Coercible b a => Sum p q b c -> q0 a b -> Sum p q a c
(Functor f, Profunctor p) => Profunctor (Tannen f p)
Instance details Defined in Data.Profunctor.Unsafe Methods dimap :: (a -> b) -> (c -> d) -> Tannen f p b c -> Tannen f p a d # lmap :: (a -> b) -> Tannen f p b c -> Tannen f p a c # rmap :: (b -> c) -> Tannen f p a b -> Tannen f p a c # (#.) :: Coercible c b => q b c -> Tannen f p a b -> Tannen f p a c (.#) :: Coercible b a => Tannen f p b c -> q a b -> Tannen f p a c
(Profunctor p, Functor f, Functor g) => Profunctor (Biff p f g)
Instance details Defined in Data.Profunctor.Unsafe Methods dimap :: (a -> b) -> (c -> d) -> Biff p f g b c -> Biff p f g a d # lmap :: (a -> b) -> Biff p f g b c -> Biff p f g a c # rmap :: (b -> c) -> Biff p f g a b -> Biff p f g a c # (#.) :: Coercible c b => q b c -> Biff p f g a b -> Biff p f g a c (.#) :: Coercible b a => Biff p f g b c -> q a b -> Biff p f g a c

aliceblue :: (Ord a, Floating a) => Colour a #

antiquewhite :: (Ord a, Floating a) => Colour a #

aqua :: (Ord a, Floating a) => Colour a #

aquamarine :: (Ord a, Floating a) => Colour a #

azure :: (Ord a, Floating a) => Colour a #

beige :: (Ord a, Floating a) => Colour a #

bisque :: (Ord a, Floating a) => Colour a #

blanchedalmond :: (Ord a, Floating a) => Colour a #

blue :: (Ord a, Floating a) => Colour a #

blueviolet :: (Ord a, Floating a) => Colour a #

brown :: (Ord a, Floating a) => Colour a #

burlywood :: (Ord a, Floating a) => Colour a #

cadetblue :: (Ord a, Floating a) => Colour a #

chartreuse :: (Ord a, Floating a) => Colour a #

chocolate :: (Ord a, Floating a) => Colour a #

coral :: (Ord a, Floating a) => Colour a #

cornflowerblue :: (Ord a, Floating a) => Colour a #

cornsilk :: (Ord a, Floating a) => Colour a #

crimson :: (Ord a, Floating a) => Colour a #

cyan :: (Ord a, Floating a) => Colour a #

darkblue :: (Ord a, Floating a) => Colour a #

darkcyan :: (Ord a, Floating a) => Colour a #

darkgoldenrod :: (Ord a, Floating a) => Colour a #

darkgray :: (Ord a, Floating a) => Colour a #

darkgreen :: (Ord a, Floating a) => Colour a #

darkgrey :: (Ord a, Floating a) => Colour a #

darkkhaki :: (Ord a, Floating a) => Colour a #

darkmagenta :: (Ord a, Floating a) => Colour a #

darkolivegreen :: (Ord a, Floating a) => Colour a #

darkorange :: (Ord a, Floating a) => Colour a #

darkorchid :: (Ord a, Floating a) => Colour a #

darkred :: (Ord a, Floating a) => Colour a #

darksalmon :: (Ord a, Floating a) => Colour a #

darkseagreen :: (Ord a, Floating a) => Colour a #

darkslateblue :: (Ord a, Floating a) => Colour a #

darkslategray :: (Ord a, Floating a) => Colour a #

darkslategrey :: (Ord a, Floating a) => Colour a #

darkturquoise :: (Ord a, Floating a) => Colour a #

darkviolet :: (Ord a, Floating a) => Colour a #

deeppink :: (Ord a, Floating a) => Colour a #

deepskyblue :: (Ord a, Floating a) => Colour a #

dimgray :: (Ord a, Floating a) => Colour a #

dimgrey :: (Ord a, Floating a) => Colour a #

dodgerblue :: (Ord a, Floating a) => Colour a #

firebrick :: (Ord a, Floating a) => Colour a #

floralwhite :: (Ord a, Floating a) => Colour a #

forestgreen :: (Ord a, Floating a) => Colour a #

fuchsia :: (Ord a, Floating a) => Colour a #

gainsboro :: (Ord a, Floating a) => Colour a #

ghostwhite :: (Ord a, Floating a) => Colour a #

gold :: (Ord a, Floating a) => Colour a #

goldenrod :: (Ord a, Floating a) => Colour a #

gray :: (Ord a, Floating a) => Colour a #

green :: (Ord a, Floating a) => Colour a #

greenyellow :: (Ord a, Floating a) => Colour a #

grey :: (Ord a, Floating a) => Colour a #

honeydew :: (Ord a, Floating a) => Colour a #

hotpink :: (Ord a, Floating a) => Colour a #

indianred :: (Ord a, Floating a) => Colour a #

indigo :: (Ord a, Floating a) => Colour a #

ivory :: (Ord a, Floating a) => Colour a #

khaki :: (Ord a, Floating a) => Colour a #

lavender :: (Ord a, Floating a) => Colour a #

lavenderblush :: (Ord a, Floating a) => Colour a #

lawngreen :: (Ord a, Floating a) => Colour a #

lemonchiffon :: (Ord a, Floating a) => Colour a #

lightblue :: (Ord a, Floating a) => Colour a #

lightcoral :: (Ord a, Floating a) => Colour a #

lightcyan :: (Ord a, Floating a) => Colour a #

lightgoldenrodyellow :: (Ord a, Floating a) => Colour a #

lightgray :: (Ord a, Floating a) => Colour a #

lightgreen :: (Ord a, Floating a) => Colour a #

lightgrey :: (Ord a, Floating a) => Colour a #

lightpink :: (Ord a, Floating a) => Colour a #

lightsalmon :: (Ord a, Floating a) => Colour a #

lightseagreen :: (Ord a, Floating a) => Colour a #

lightskyblue :: (Ord a, Floating a) => Colour a #

lightslategray :: (Ord a, Floating a) => Colour a #

lightslategrey :: (Ord a, Floating a) => Colour a #

lightsteelblue :: (Ord a, Floating a) => Colour a #

lightyellow :: (Ord a, Floating a) => Colour a #

lime :: (Ord a, Floating a) => Colour a #

limegreen :: (Ord a, Floating a) => Colour a #

linen :: (Ord a, Floating a) => Colour a #

magenta :: (Ord a, Floating a) => Colour a #

maroon :: (Ord a, Floating a) => Colour a #

mediumaquamarine :: (Ord a, Floating a) => Colour a #

mediumblue :: (Ord a, Floating a) => Colour a #

mediumorchid :: (Ord a, Floating a) => Colour a #

mediumpurple :: (Ord a, Floating a) => Colour a #

mediumseagreen :: (Ord a, Floating a) => Colour a #

mediumslateblue :: (Ord a, Floating a) => Colour a #

mediumspringgreen :: (Ord a, Floating a) => Colour a #

mediumturquoise :: (Ord a, Floating a) => Colour a #

mediumvioletred :: (Ord a, Floating a) => Colour a #

midnightblue :: (Ord a, Floating a) => Colour a #

mintcream :: (Ord a, Floating a) => Colour a #

mistyrose :: (Ord a, Floating a) => Colour a #

moccasin :: (Ord a, Floating a) => Colour a #

navajowhite :: (Ord a, Floating a) => Colour a #

navy :: (Ord a, Floating a) => Colour a #

oldlace :: (Ord a, Floating a) => Colour a #

olive :: (Ord a, Floating a) => Colour a #

olivedrab :: (Ord a, Floating a) => Colour a #

orange :: (Ord a, Floating a) => Colour a #

orangered :: (Ord a, Floating a) => Colour a #

orchid :: (Ord a, Floating a) => Colour a #

palegoldenrod :: (Ord a, Floating a) => Colour a #

palegreen :: (Ord a, Floating a) => Colour a #

paleturquoise :: (Ord a, Floating a) => Colour a #

palevioletred :: (Ord a, Floating a) => Colour a #

papayawhip :: (Ord a, Floating a) => Colour a #

peachpuff :: (Ord a, Floating a) => Colour a #

peru :: (Ord a, Floating a) => Colour a #

pink :: (Ord a, Floating a) => Colour a #

plum :: (Ord a, Floating a) => Colour a #

powderblue :: (Ord a, Floating a) => Colour a #

purple :: (Ord a, Floating a) => Colour a #

readColourName :: (MonadFail m, Monad m, Ord a, Floating a) => String -> m (Colour a) #

red :: (Ord a, Floating a) => Colour a #

rosybrown :: (Ord a, Floating a) => Colour a #

royalblue :: (Ord a, Floating a) => Colour a #

saddlebrown :: (Ord a, Floating a) => Colour a #

salmon :: (Ord a, Floating a) => Colour a #

sandybrown :: (Ord a, Floating a) => Colour a #

seagreen :: (Ord a, Floating a) => Colour a #

seashell :: (Ord a, Floating a) => Colour a #

sienna :: (Ord a, Floating a) => Colour a #

silver :: (Ord a, Floating a) => Colour a #

skyblue :: (Ord a, Floating a) => Colour a #

slateblue :: (Ord a, Floating a) => Colour a #

slategray :: (Ord a, Floating a) => Colour a #

slategrey :: (Ord a, Floating a) => Colour a #

snow :: (Ord a, Floating a) => Colour a #

springgreen :: (Ord a, Floating a) => Colour a #

steelblue :: (Ord a, Floating a) => Colour a #

teal :: (Ord a, Floating a) => Colour a #

thistle :: (Ord a, Floating a) => Colour a #

tomato :: (Ord a, Floating a) => Colour a #

turquoise :: (Ord a, Floating a) => Colour a #

violet :: (Ord a, Floating a) => Colour a #

wheat :: (Ord a, Floating a) => Colour a #

white :: (Ord a, Floating a) => Colour a #

whitesmoke :: (Ord a, Floating a) => Colour a #

yellow :: (Ord a, Floating a) => Colour a #

yellowgreen :: (Ord a, Floating a) => Colour a #

sRGB :: (Ord b, Floating b) => b -> b -> b -> Colour b #

sRGB24 :: (Ord b, Floating b) => Word8 -> Word8 -> Word8 -> Colour b #

sRGB24read :: (Ord b, Floating b) => String -> Colour b #

sRGB24reads :: (Ord b, Floating b) => ReadS (Colour b) #

sRGB24show :: (RealFrac b, Floating b) => Colour b -> String #

sRGB24shows :: (RealFrac b, Floating b) => Colour b -> ShowS #

sRGBSpace :: (Ord a, Floating a) => RGBSpace a #

toSRGB :: (Ord b, Floating b) => Colour b -> RGB b #

toSRGB24 :: (RealFrac b, Floating b) => Colour b -> RGB Word8 #

(->>) :: Semigroup a => Active a -> Active a -> Active a #

activeEnd :: Active a -> a #

activeEra :: Active a -> Maybe (Era Rational) #

activeStart :: Active a -> a #

after :: Active a -> Active a -> Active a #

atTime :: Time Rational -> Active a -> Active a #

backwards :: Active a -> Active a #

clamp :: Active a -> Active a #

clampAfter :: Active a -> Active a #

clampBefore :: Active a -> Active a #

discrete :: [a] -> Active a #

duration :: Num n => Era n -> Duration n #

during :: Active a -> Active a -> Active a #

end :: Era n -> Time n #

fromDuration :: Duration n -> n #

fromDynamic :: Dynamic a -> Active a #

fromTime :: Time n -> n #

interval :: Fractional a => Time Rational -> Time Rational -> Active a #

isConstant :: Active a -> Bool #

isDynamic :: Active a -> Bool #

mkActive :: Time Rational -> Time Rational -> (Time Rational -> a) -> Active a #

mkDynamic :: Time Rational -> Time Rational -> (Time Rational -> a) -> Dynamic a #

mkEra :: Time n -> Time n -> Era n #

modActive :: (a -> b) -> (Dynamic a -> Dynamic b) -> Active a -> Active b #

movie :: [Active a] -> Active a #

onActive :: (a -> b) -> (Dynamic a -> b) -> Active a -> b #

onDynamic :: (Time Rational -> Time Rational -> (Time Rational -> a) -> b) -> Dynamic a -> b #

runActive :: Active a -> Time Rational -> a #

setEra :: Era Rational -> Active a -> Active a #

shift :: Duration Rational -> Active a -> Active a #

shiftDynamic :: Duration Rational -> Dynamic a -> Dynamic a #

simulate :: Rational -> Active a -> [a] #

snapshot :: Time Rational -> Active a -> Active a #

start :: Era n -> Time n #

stretch :: Rational -> Active a -> Active a #

stretchTo :: Duration Rational -> Active a -> Active a #

toDuration :: n -> Duration n #

toTime :: n -> Time n #

trim :: Monoid a => Active a -> Active a #

trimAfter :: Monoid a => Active a -> Active a #

trimBefore :: Monoid a => Active a -> Active a #

ui :: Fractional a => Active a #

(|>>) :: Active a -> Active a -> Active a #

renderDia :: (Backend b v n, HasLinearMap v, Metric v, Typeable n, OrderedField n, Monoid' m) => b -> Options b v n -> QDiagram b v n m -> Result b v n #

renderDiaT :: (Backend b v n, HasLinearMap v, Metric v, Typeable n, OrderedField n, Monoid' m) => b -> Options b v n -> QDiagram b v n m -> (Transformation v n, Result b v n) #

appEnvelope :: Envelope v n -> Maybe (v n -> n) #

diameter :: (V a ~ v, N a ~ n, Enveloped a) => v n -> a -> n #

envelopeP :: (V a ~ v, N a ~ n, Enveloped a) => v n -> a -> Point v n #

envelopePMay :: (V a ~ v, N a ~ n, Enveloped a) => v n -> a -> Maybe (Point v n) #

envelopeV :: Enveloped a => Vn a -> a -> Vn a #

envelopeVMay :: Enveloped a => Vn a -> a -> Maybe (Vn a) #

mkEnvelope :: (v n -> n) -> Envelope v n #

onEnvelope :: ((v n -> n) -> v n -> n) -> Envelope v n -> Envelope v n #

radius :: (V a ~ v, N a ~ n, Enveloped a) => v n -> a -> n #

size :: (V a ~ v, N a ~ n, Enveloped a, HasBasis v) => a -> v n #

moveOriginBy :: (V t ~ v, N t ~ n, HasOrigin t) => v n -> t -> t #

moveTo :: (InSpace v n t, HasOrigin t) => Point v n -> t -> t #

place :: (InSpace v n t, HasOrigin t) => t -> Point v n -> t #

juxtaposeDefault :: (Enveloped a, HasOrigin a) => Vn a -> a -> a -> a #

atLeast :: Ord n => Measure n -> Measure n -> Measure n #

atMost :: Ord n => Measure n -> Measure n -> Measure n #

fromMeasured :: Num n => n -> n -> Measured n a -> a #

global :: Num n => n -> Measure n #

local :: Num n => n -> Measure n #

normalized :: Num n => n -> Measure n #

output :: n -> Measure n #

scaleLocal :: Num n => n -> Measured n a -> Measured n a #

(.>) :: (IsName a1, IsName a2) => a1 -> a2 -> Name #

eachName :: (Typeable a, Ord a, Show a) => Traversal' Name a #

(*.) :: (Functor v, Num n) => n -> Point v n -> Point v n #

applyAttr :: (AttributeClass a, HasStyle d) => a -> d -> d #

applyMAttr :: (AttributeClass a, N d ~ n, HasStyle d) => Measured n a -> d -> d #

applyTAttr :: (AttributeClass a, Transformable a, V a ~ V d, N a ~ N d, HasStyle d) => a -> d -> d #

atAttr :: AttributeClass a => Lens' (Style v n) (Maybe a) #

atMAttr :: (AttributeClass a, Typeable n) => Lens' (Style v n) (Maybe (Measured n a)) #

atTAttr :: (V a ~ v, N a ~ n, AttributeClass a, Transformable a) => Lens' (Style v n) (Maybe a) #

getAttr :: AttributeClass a => Style v n -> Maybe a #

getSortedList :: SortedList a -> [a] #

maxRayTraceP :: (n ~ N a, Traced a, Num n) => Point (V a) n -> V a n -> a -> Maybe (Point (V a) n) #

maxRayTraceV :: (n ~ N a, Traced a, Num n) => Point (V a) n -> V a n -> a -> Maybe (V a n) #

maxTraceP :: (n ~ N a, Num n, Traced a) => Point (V a) n -> V a n -> a -> Maybe (Point (V a) n) #

maxTraceV :: (n ~ N a, Num n, Traced a) => Point (V a) n -> V a n -> a -> Maybe (V a n) #

mkSortedList :: Ord a => [a] -> SortedList a #

mkTrace :: (Point v n -> v n -> SortedList n) -> Trace v n #

rayTraceP :: (n ~ N a, Traced a, Num n) => Point (V a) n -> V a n -> a -> Maybe (Point (V a) n) #

rayTraceV :: (n ~ N a, Traced a, Num n) => Point (V a) n -> V a n -> a -> Maybe (V a n) #

traceP :: (n ~ N a, Traced a, Num n) => Point (V a) n -> V a n -> a -> Maybe (Point (V a) n) #

traceV :: (n ~ N a, Num n, Traced a) => Point (V a) n -> V a n -> a -> Maybe (V a n) #

(<->) :: (u -> v) -> (v -> u) -> u :-: v #

apply :: Transformation v n -> v n -> v n #

avgScale :: (Additive v, Traversable v, Floating n) => Transformation v n -> n #

determinant :: (Additive v, Traversable v, Num n) => Transformation v n -> n #

dimension :: (Additive (V a), Traversable (V a)) => a -> Int #

dropTransl :: (Additive v, Num n) => Transformation v n -> Transformation v n #

eye :: (HasBasis v, Num n) => v (v n) #

fromLinear :: (Additive v, Num n) => (v n :-: v n) -> (v n :-: v n) -> Transformation v n #

inv :: (Functor v, Num n) => Transformation v n -> Transformation v n #

isReflection :: (Additive v, Traversable v, Num n, Ord n) => Transformation v n -> Bool #

lapp :: (u :-: v) -> u -> v #

linv :: (u :-: v) -> v :-: u #

papply :: (Additive v, Num n) => Transformation v n -> Point v n -> Point v n #

scale :: (InSpace v n a, Eq n, Fractional n, Transformable a) => n -> a -> a #

scaling :: (Additive v, Fractional n) => n -> Transformation v n #

transl :: Transformation v n -> v n #

translate :: Transformable t => Vn t -> t -> t #

translation :: v n -> Transformation v n #

transp :: Transformation v n -> v n :-: v n #

atop :: (OrderedField n, Metric v, Semigroup m) => QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m #

envelope :: (OrderedField n, Metric v, Monoid' m) => Lens' (QDiagram b v n m) (Envelope v n) #

fromNames :: IsName a => [(a, Subdiagram b v n m)] -> SubMap b v n m #

getSub :: (Metric v, OrderedField n, Semigroup m) => Subdiagram b v n m -> QDiagram b v n m #

groupOpacity :: (Metric v, OrderedField n, Semigroup m) => Double -> QDiagram b v n m -> QDiagram b v n m #

href :: (Metric v, OrderedField n, Semigroup m) => String -> QDiagram b v n m -> QDiagram b v n m #

localize :: (Metric v, OrderedField n, Semigroup m) => QDiagram b v n m -> QDiagram b v n m #

location :: (Additive v, Num n) => Subdiagram b v n m -> Point v n #

lookupName :: (IsName nm, Metric v, Semigroup m, OrderedField n) => nm -> QDiagram b v n m -> Maybe (Subdiagram b v n m) #

lookupSub :: IsName nm => nm -> SubMap b v n m -> Maybe [Subdiagram b v n m] #

mkQD :: Prim b v n -> Envelope v n -> Trace v n -> SubMap b v n m -> Query v n m -> QDiagram b v n m #

mkSubdiagram :: QDiagram b v n m -> Subdiagram b v n m #

nameSub :: (IsName nm, Metric v, OrderedField n, Semigroup m) => (QDiagram b v n m -> Subdiagram b v n m) -> nm -> QDiagram b v n m -> QDiagram b v n m #

names :: (Metric v, Semigroup m, OrderedField n) => QDiagram b v n m -> [(Name, [Point v n])] #

opacityGroup :: (Metric v, OrderedField n, Semigroup m) => Double -> QDiagram b v n m -> QDiagram b v n m #

pointDiagram :: (Metric v, Fractional n) => Point v n -> QDiagram b v n m #

query :: Monoid m => QDiagram b v n m -> Query v n m #

rawSub :: Subdiagram b v n m -> QDiagram b v n m #

rememberAs :: IsName a => a -> QDiagram b v n m -> SubMap b v n m -> SubMap b v n m #

setEnvelope :: (OrderedField n, Metric v, Monoid' m) => Envelope v n -> QDiagram b v n m -> QDiagram b v n m #

setTrace :: (OrderedField n, Metric v, Semigroup m) => Trace v n -> QDiagram b v n m -> QDiagram b v n m #

subMap :: (Metric v, Semigroup m, OrderedField n) => Lens' (QDiagram b v n m) (SubMap b v n m) #

subPoint :: (Metric v, OrderedField n) => Point v n -> Subdiagram b v n m #

withName :: (IsName nm, Metric v, Semigroup m, OrderedField n) => nm -> (Subdiagram b v n m -> QDiagram b v n m -> QDiagram b v n m) -> QDiagram b v n m -> QDiagram b v n m #

withNameAll :: (IsName nm, Metric v, Semigroup m, OrderedField n) => nm -> ([Subdiagram b v n m] -> QDiagram b v n m -> QDiagram b v n m) -> QDiagram b v n m -> QDiagram b v n m #

withNames :: (IsName nm, Metric v, Semigroup m, OrderedField n) => [nm] -> ([Subdiagram b v n m] -> QDiagram b v n m -> QDiagram b v n m) -> QDiagram b v n m -> QDiagram b v n m #

align :: (InSpace v n a, Fractional n, Alignable a, HasOrigin a) => v n -> a -> a #

alignBy'Default :: (InSpace v n a, Fractional n, HasOrigin a) => (v n -> a -> Point v n) -> v n -> n -> a -> a #

center :: (InSpace v n a, Fractional n, Traversable v, Alignable a, HasOrigin a) => a -> a #

centerV :: (InSpace v n a, Fractional n, Alignable a, HasOrigin a) => v n -> a -> a #

envelopeBoundary :: (V a ~ v, N a ~ n, Enveloped a) => v n -> a -> Point v n #

snug :: (InSpace v n a, Fractional n, Alignable a, Traced a, HasOrigin a) => v n -> a -> a #

snugBy :: (InSpace v n a, Fractional n, Alignable a, Traced a, HasOrigin a) => v n -> n -> a -> a #

snugCenter :: (InSpace v n a, Traversable v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a #

snugCenterV :: (InSpace v n a, Fractional n, Alignable a, Traced a, HasOrigin a) => v n -> a -> a #

traceBoundary :: (V a ~ v, N a ~ n, Num n, Traced a) => v n -> a -> Point v n #

(@@) :: b -> AReview a b -> a #

acosA :: Floating n => n -> Angle n #

angleBetween :: (Metric v, Floating n, Ord n) => v n -> v n -> Angle n #

angleRatio :: Floating n => Angle n -> Angle n -> n #

asinA :: Floating n => n -> Angle n #

atan2A :: RealFloat n => n -> n -> Angle n #

atan2A' :: OrderedField n => n -> n -> Angle n #

atanA :: Floating n => n -> Angle n #

cosA :: Floating n => Angle n -> n #

deg :: Floating n => Iso' (Angle n) n #

fullTurn :: Floating v => Angle v #

halfTurn :: Floating v => Angle v #

normalizeAngle :: (Floating n, Real n) => Angle n -> Angle n #

quarterTurn :: Floating v => Angle v #

rad :: Iso' (Angle n) n #

rotate :: (InSpace V2 n t, Transformable t, Floating n) => Angle n -> t -> t #

rotation :: Floating n => Angle n -> Transformation V2 n #

sinA :: Floating n => Angle n -> n #

tanA :: Floating n => Angle n -> n #

turn :: Floating n => Iso' (Angle n) n #

animEnvelope :: (OrderedField n, Metric v, Monoid' m) => QAnimation b v n m -> QAnimation b v n m #

animEnvelope' :: (OrderedField n, Metric v, Monoid' m) => Rational -> QAnimation b v n m -> QAnimation b v n m #

animRect :: (InSpace V2 n t, Monoid' m, TrailLike t, Enveloped t, Transformable t, Monoid t) => QAnimation b V2 n m -> t #

animRect' :: (InSpace V2 n t, Monoid' m, TrailLike t, Enveloped t, Transformable t, Monoid t) => Rational -> QAnimation b V2 n m -> t #

_Commit :: Prism' (Recommend a) a #

_FillOpacity :: Iso' FillOpacity Double #

_LineMiterLimit :: Iso' LineMiterLimit Double #

_LineWidth :: Iso' (LineWidth n) n #

_LineWidthM :: Iso' (LineWidthM n) (Measure n) #

_Opacity :: Iso' Opacity Double #

_Recommend :: Prism' (Recommend a) a #

_SomeColor :: Iso' SomeColor (AlphaColour Double) #

_StrokeOpacity :: Iso' StrokeOpacity Double #

_dashing :: Typeable n => Lens' (Style v n) (Maybe (Measured n (Dashing n))) #

_dashingU :: Typeable n => Lens' (Style v n) (Maybe (Dashing n)) #

_fillOpacity :: Lens' (Style v n) Double #

_lineCap :: Lens' (Style v n) LineCap #

_lineJoin :: Lens' (Style v n) LineJoin #

_lineMiterLimit :: Lens' (Style v n) Double #

_lineWidth :: (Typeable n, OrderedField n) => Lens' (Style v n) (Measure n) #

_lineWidthU :: Typeable n => Lens' (Style v n) (Maybe n) #

_lw :: (Typeable n, OrderedField n) => Lens' (Style v n) (Measure n) #

_opacity :: Lens' (Style v n) Double #

_recommend :: Lens (Recommend a) (Recommend b) a b #

_strokeOpacity :: Lens' (Style v n) Double #

colorToRGBA :: Color c => c -> (Double, Double, Double, Double) #

colorToSRGBA :: Color c => c -> (Double, Double, Double, Double) #

committed :: Iso (Recommend a) (Recommend b) a b #

dashing :: (N a ~ n, HasStyle a, Typeable n) => [Measure n] -> Measure n -> a -> a #

dashingG :: (N a ~ n, HasStyle a, Typeable n, Num n) => [n] -> n -> a -> a #

dashingL :: (N a ~ n, HasStyle a, Typeable n, Num n) => [n] -> n -> a -> a #

dashingN :: (N a ~ n, HasStyle a, Typeable n, Num n) => [n] -> n -> a -> a #

dashingO :: (N a ~ n, HasStyle a, Typeable n) => [n] -> n -> a -> a #

fillOpacity :: HasStyle a => Double -> a -> a #

getDashing :: Dashing n -> Dashing n #

getFillOpacity :: FillOpacity -> Double #

getLineCap :: LineCap -> LineCap #

getLineJoin :: LineJoin -> LineJoin #

getLineMiterLimit :: LineMiterLimit -> Double #

getLineWidth :: LineWidth n -> n #

getOpacity :: Opacity -> Double #

getStrokeOpacity :: StrokeOpacity -> Double #

huge :: OrderedField n => Measure n #

isCommitted :: Lens' (Recommend a) Bool #

large :: OrderedField n => Measure n #

lineCap :: HasStyle a => LineCap -> a -> a #

lineJoin :: HasStyle a => LineJoin -> a -> a #

lineMiterLimit :: HasStyle a => Double -> a -> a #

lineMiterLimitA :: HasStyle a => LineMiterLimit -> a -> a #

lineWidth :: (N a ~ n, HasStyle a, Typeable n) => Measure n -> a -> a #

lineWidthM :: (N a ~ n, HasStyle a, Typeable n) => LineWidthM n -> a -> a #

lw :: (N a ~ n, HasStyle a, Typeable n) => Measure n -> a -> a #

lwG :: (N a ~ n, HasStyle a, Typeable n, Num n) => n -> a -> a #

lwL :: (N a ~ n, HasStyle a, Typeable n, Num n) => n -> a -> a #

lwN :: (N a ~ n, HasStyle a, Typeable n, Num n) => n -> a -> a #

lwO :: (N a ~ n, HasStyle a, Typeable n) => n -> a -> a #

medium :: OrderedField n => Measure n #

none :: OrderedField n => Measure n #

normal :: OrderedField n => Measure n #

opacity :: HasStyle a => Double -> a -> a #

small :: OrderedField n => Measure n #

someToAlpha :: SomeColor -> AlphaColour Double #

strokeOpacity :: HasStyle a => Double -> a -> a #

thick :: OrderedField n => Measure n #

thin :: OrderedField n => Measure n #

tiny :: OrderedField n => Measure n #

ultraThick :: OrderedField n => Measure n #

ultraThin :: OrderedField n => Measure n #

veryLarge :: OrderedField n => Measure n #

verySmall :: OrderedField n => Measure n #

veryThick :: OrderedField n => Measure n #

veryThin :: OrderedField n => Measure n #

boundingBox :: (InSpace v n a, HasBasis v, Enveloped a) => a -> BoundingBox v n #

boxCenter :: (Additive v, Fractional n) => BoundingBox v n -> Maybe (Point v n) #

boxExtents :: (Additive v, Num n) => BoundingBox v n -> v n #

boxFit :: (InSpace v n a, HasBasis v, Enveloped a, Transformable a, Monoid a) => BoundingBox v n -> a -> a #

boxGrid :: (Traversable v, Additive v, Num n, Enum n) => n -> BoundingBox v n -> [Point v n] #

boxTransform :: (Additive v, Fractional n) => BoundingBox v n -> BoundingBox v n -> Maybe (Transformation v n) #

centerPoint :: (InSpace v n a, HasBasis v, Enveloped a) => a -> Point v n #

contains' :: (Additive v, Foldable v, Ord n) => BoundingBox v n -> Point v n -> Bool #

emptyBox :: BoundingBox v n #

fromCorners :: (Additive v, Foldable v, Ord n) => Point v n -> Point v n -> BoundingBox v n #

fromPoint :: Point v n -> BoundingBox v n #

fromPoints :: (Additive v, Ord n) => [Point v n] -> BoundingBox v n #

getAllCorners :: (Additive v, Traversable v) => BoundingBox v n -> [Point v n] #

getCorners :: BoundingBox v n -> Maybe (Point v n, Point v n) #

inside' :: (Additive v, Foldable v, Ord n) => BoundingBox v n -> BoundingBox v n -> Bool #

isEmptyBox :: BoundingBox v n -> Bool #

mCenterPoint :: (InSpace v n a, HasBasis v, Enveloped a) => a -> Maybe (Point v n) #

outside' :: (Additive v, Foldable v, Ord n) => BoundingBox v n -> BoundingBox v n -> Bool #

appends :: (Juxtaposable a, Monoid' a) => a -> [(Vn a, a)] -> a #

atDirection :: (InSpace v n a, Metric v, Floating n, Juxtaposable a, Semigroup a) => Direction v n -> a -> a -> a #

atPoints :: (InSpace v n a, HasOrigin a, Monoid' a) => [Point v n] -> [a] -> a #

beneath :: (Metric v, OrderedField n, Monoid' m) => QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m #

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

cat :: (InSpace v n a, Metric v, Floating n, Juxtaposable a, Monoid' a, HasOrigin a) => v n -> [a] -> a #

cat' :: (InSpace v n a, Metric v, Floating n, Juxtaposable a, Monoid' a, HasOrigin a) => v n -> CatOpts n -> [a] -> a #

catMethod :: Lens' (CatOpts n) CatMethod #

composeAligned :: (Monoid' m, Floating n, Ord n, Metric v) => (QDiagram b v n m -> QDiagram b v n m) -> ([QDiagram b v n m] -> QDiagram b v n m) -> [QDiagram b v n m] -> QDiagram b v n m #

extrudeEnvelope :: (Metric v, OrderedField n, Monoid' m) => v n -> QDiagram b v n m -> QDiagram b v n m #

frame :: (Metric v, OrderedField n, Monoid' m) => n -> QDiagram b v n m -> QDiagram b v n m #

intrudeEnvelope :: (Metric v, OrderedField n, Monoid' m) => v n -> QDiagram b v n m -> QDiagram b v n m #

pad :: (Metric v, OrderedField n, Monoid' m) => n -> QDiagram b v n m -> QDiagram b v n m #

phantom :: (InSpace v n a, Monoid' m, Enveloped a, Traced a) => a -> QDiagram b v n m #

position :: (InSpace v n a, HasOrigin a, Monoid' a) => [(Point v n, a)] -> a #

sep :: Lens' (CatOpts n) n #

strut :: (Metric v, OrderedField n) => v n -> QDiagram b v n m #

withEnvelope :: (InSpace v n a, Monoid' m, Enveloped a) => a -> QDiagram b v n m -> QDiagram b v n m #

withTrace :: (InSpace v n a, Metric v, OrderedField n, Monoid' m, Traced a) => a -> QDiagram b v n m -> QDiagram b v n m #

cubicSpline :: (V t ~ v, N t ~ n, TrailLike t, Fractional (v n)) => Bool -> [Point v n] -> t #

bspline :: (TrailLike t, V t ~ v, N t ~ n) => BSpline v n -> t #

asDeformation :: (Additive v, Num n) => Transformation v n -> Deformation v v n #

_Dir :: Iso' (Direction v n) (v n) #

angleBetweenDirs :: (Metric v, Floating n, Ord n) => Direction v n -> Direction v n -> Angle n #

dirBetween :: (Additive v, Num n) => Point v n -> Point v n -> Direction v n #

direction :: v n -> Direction v n #

fromDir :: (Metric v, Floating n) => Direction v n -> v n #

fromDirection :: (Metric v, Floating n) => Direction v n -> v n #

_loc :: Lens' (Located a) (Point (V a) (N a)) #

at :: a -> Point (V a) (N a) -> Located a #

located :: SameSpace a b => Lens (Located a) (Located b) a b #

mapLoc :: SameSpace a b => (a -> b) -> Located a -> Located b #

viewLoc :: Located a -> (Point (V a) (N a), a) #

namePoint :: (IsName nm, Metric v, OrderedField n, Semigroup m) => (QDiagram b v n m -> Point v n) -> nm -> QDiagram b v n m -> QDiagram b v n m #

named :: (IsName nm, Metric v, OrderedField n, Semigroup m) => nm -> QDiagram b v n m -> QDiagram b v n m #

domainBounds :: DomainBounds p => p -> (N p, N p) #

stdTolerance :: Fractional a => a #

adjEps :: Lens' (AdjustOpts n) n #

adjMethod :: Lens' (AdjustOpts n) (AdjustMethod n) #

adjSide :: Lens' (AdjustOpts n) AdjustSide #

adjust :: (N t ~ n, Sectionable t, HasArcLength t, Fractional n) => t -> AdjustOpts n -> t #

explodePath :: (V t ~ v, N t ~ n, TrailLike t) => Path v n -> [[t]] #

fixPath :: (Metric v, OrderedField n) => Path v n -> [[FixedSegment v n]] #

partitionPath :: (Located (Trail v n) -> Bool) -> Path v n -> (Path v n, Path v n) #

pathCentroid :: (Metric v, OrderedField n) => Path v n -> Point v n #

pathFromLocTrail :: (Metric v, OrderedField n) => Located (Trail v n) -> Path v n #

pathFromTrail :: (Metric v, OrderedField n) => Trail v n -> Path v n #

pathFromTrailAt :: (Metric v, OrderedField n) => Trail v n -> Point v n -> Path v n #

pathLocSegments :: (Metric v, OrderedField n) => Path v n -> [[Located (Segment Closed v n)]] #

pathOffsets :: (Metric v, OrderedField n) => Path v n -> [v n] #

pathTrails :: Path v n -> [Located (Trail v n)] #

pathVertices :: (Metric v, OrderedField n) => Path v n -> [[Point v n]] #

pathVertices' :: (Metric v, OrderedField n) => n -> Path v n -> [[Point v n]] #

reversePath :: (Metric v, OrderedField n) => Path v n -> Path v n #

scalePath :: (HasLinearMap v, Metric v, OrderedField n) => n -> Path v n -> Path v n #

centroid :: (Additive v, Fractional n) => [Point v n] -> Point v n #

clearValue :: QDiagram b v n m -> QDiagram b v n Any #

inquire :: HasQuery t Any => t -> Point (V t) (N t) -> Bool #

resetValue :: (Eq m, Monoid m) => QDiagram b v n m -> QDiagram b v n Any #

sample :: HasQuery t m => t -> Point (V t) (N t) -> m #

value :: Monoid m => m -> QDiagram b v n Any -> QDiagram b v n m #

bezier3 :: v n -> v n -> v n -> Segment Closed v n #

bézier3 :: v n -> v n -> v n -> Segment Closed v n #

fixedSegIso :: (Num n, Additive v) => Iso' (FixedSegment v n) (Located (Segment Closed v n)) #

fromFixedSeg :: (Num n, Additive v) => FixedSegment v n -> Located (Segment Closed v n) #

getArcLengthBounded :: (Num n, Ord n) => n -> ArcLength n -> Interval n #

getArcLengthCached :: ArcLength n -> Interval n #

getArcLengthFun :: ArcLength n -> n -> Interval n #

mapSegmentVectors :: (v n -> v' n') -> Segment c v n -> Segment c v' n' #

mkFixedSeg :: (Num n, Additive v) => Located (Segment Closed v n) -> FixedSegment v n #

oeEnvelope :: Lens' (OffsetEnvelope v n) (Envelope v n) #

oeOffset :: Lens' (OffsetEnvelope v n) (TotalOffset v n) #

openCubic :: v n -> v n -> Segment Open v n #

openLinear :: Segment Open v n #

reverseSegment :: (Num n, Additive v) => Segment Closed v n -> Segment Closed v n #

segOffset :: Segment Closed v n -> v n #

straight :: v n -> Segment Closed v n #

absolute :: (Additive v, Num n) => SizeSpec v n #

dims :: v n -> SizeSpec v n #

getSpec :: (Functor v, Num n, Ord n) => SizeSpec v n -> v (Maybe n) #

mkSizeSpec :: (Functor v, Num n) => v (Maybe n) -> SizeSpec v n #

requiredScale :: (Additive v, Foldable v, Fractional n, Ord n) => SizeSpec v n -> v n -> n #

requiredScaling :: (Additive v, Foldable v, Fractional n, Ord n) => SizeSpec v n -> v n -> Transformation v n #

sizeAdjustment :: (Additive v, Foldable v, OrderedField n) => SizeSpec v n -> BoundingBox v n -> (v n, Transformation v n) #

sized :: (InSpace v n a, HasLinearMap v, Transformable a, Enveloped a) => SizeSpec v n -> a -> a #

sizedAs :: (InSpace v n a, SameSpace a b, HasLinearMap v, Transformable a, Enveloped a, Enveloped b) => b -> a -> a #

specToSize :: (Foldable v, Functor v, Num n, Ord n) => n -> SizeSpec v n -> v n #

normalAtEnd :: (InSpace V2 n t, EndValues (Tangent t), Floating n) => t -> V2 n #

normalAtParam :: (InSpace V2 n t, Parametric (Tangent t), Floating n) => t -> n -> V2 n #

normalAtStart :: (InSpace V2 n t, EndValues (Tangent t), Floating n) => t -> V2 n #

tangentAtEnd :: EndValues (Tangent t) => t -> Vn t #

tangentAtParam :: Parametric (Tangent t) => t -> N t -> Vn t #

tangentAtStart :: EndValues (Tangent t) => t -> Vn t #

alignXMax :: (InSpace v n a, R1 v, Fractional n, Alignable a, HasOrigin a) => a -> a #

alignXMin :: (InSpace v n a, R1 v, Fractional n, Alignable a, HasOrigin a) => a -> a #

alignYMax :: (InSpace v n a, R2 v, Fractional n, Alignable a, HasOrigin a) => a -> a #

alignYMin :: (InSpace v n a, R2 v, Fractional n, Alignable a, HasOrigin a) => a -> a #

alignZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a) => n -> a -> a #

alignZMax :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a) => a -> a #

alignZMin :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a) => a -> a #

centerXYZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a) => a -> a #

centerXZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a) => a -> a #

centerYZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a) => a -> a #

centerZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a) => a -> a #

snugCenterXYZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a #

snugCenterXZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a #

snugCenterYZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a #

snugCenterZ :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a #

snugXMax :: (InSpace v n a, R1 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a #

snugXMin :: (InSpace v n a, R1 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a #

snugYMax :: (InSpace v n a, R2 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a #

snugYMin :: (InSpace v n a, R2 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a #

snugZ :: (V a ~ v, N a ~ n, Alignable a, Traced a, HasOrigin a, R3 v, Fractional n) => n -> a -> a #

snugZMax :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a #

snugZMin :: (InSpace v n a, R3 v, Fractional n, Alignable a, HasOrigin a, Traced a) => a -> a #

_Ambient :: Iso' Ambient Double #

_Diffuse :: Iso' Diffuse Double #

_Highlight :: Iso' Highlight Specular #

_SurfaceColor :: Iso' SurfaceColor (Colour Double) #

_ambient :: Lens' (Style v n) (Maybe Double) #

_diffuse :: Lens' (Style v n) (Maybe Double) #

_highlight :: Lens' (Style v n) (Maybe Specular) #

_sc :: Lens' (Style v n) (Maybe (Colour Double)) #

ambient :: HasStyle d => Double -> d -> d #

diffuse :: HasStyle d => Double -> d -> d #

highlight :: HasStyle d => Specular -> d -> d #

highlightIntensity :: Traversal' (Style v n) Double #

highlightSize :: Traversal' (Style v n) Double #

sc :: HasStyle d => Colour Double -> d -> d #

specularIntensity :: Lens' Specular Double #

specularSize :: Lens' Specular Double #

camAspect :: (Floating n, CameraLens l) => Camera l n -> n #

camForward :: Camera l n -> Direction V3 n #

camLens :: Camera l n -> l n #

camRight :: Fractional n => Camera l n -> Direction V3 n #

camUp :: Camera l n -> Direction V3 n #

facing_ZCamera :: (Floating n, Ord n, Typeable n, CameraLens l, Renderable (Camera l n) b) => l n -> QDiagram b V3 n Any #

horizontalFieldOfView :: Lens' (PerspectiveLens n) (Angle n) #

mm50 :: Floating n => PerspectiveLens n #

mm50Camera :: (Typeable n, Floating n, Ord n, Renderable (Camera PerspectiveLens n) b) => QDiagram b V3 n Any #

mm50Narrow :: Floating n => PerspectiveLens n #

mm50Wide :: Floating n => PerspectiveLens n #

orthoHeight :: Lens' (OrthoLens n) n #

orthoWidth :: Lens' (OrthoLens n) n #

verticalFieldOfView :: Lens' (PerspectiveLens n) (Angle n) #

facingZ :: (R3 v, Functor v, Fractional n) => Deformation v v n #

parallelZ0 :: (R3 v, Num n) => Deformation v v n #

perspectiveZ1 :: (R3 v, Functor v, Fractional n) => Deformation v v n #

parallelLight :: (Typeable n, OrderedField n, Renderable (ParallelLight n) b) => Direction V3 n -> Colour Double -> QDiagram b V3 n Any #

pointLight :: (Typeable n, Num n, Ord n, Renderable (PointLight n) b) => Colour Double -> QDiagram b V3 n Any #

cone :: Num n => Frustum n #

cube :: Num n => Box n #

cylinder :: Num n => Frustum n #

difference :: (CsgPrim a, CsgPrim b) => a n -> b n -> CSG n #

frustum :: Num n => n -> n -> Frustum n #

intersection :: (CsgPrim a, CsgPrim b) => a n -> b n -> CSG n #

sphere :: Num n => Ellipsoid n #

union :: (CsgPrim a, CsgPrim b) => a n -> b n -> CSG n #

aboutX :: Floating n => Angle n -> Transformation V3 n #

aboutY :: Floating n => Angle n -> Transformation V3 n #

aboutZ :: Floating n => Angle n -> Transformation V3 n #

pointAt :: (Floating n, Ord n) => Direction V3 n -> Direction V3 n -> Direction V3 n -> Transformation V3 n #

pointAt' :: (Floating n, Ord n) => V3 n -> V3 n -> V3 n -> Transformation V3 n #

reflectAcross :: (InSpace v n t, Metric v, Fractional n, Transformable t) => Point v n -> v n -> t -> t #

reflectZ :: (InSpace v n t, R3 v, Transformable t) => t -> t #

reflectionAcross :: (Metric v, Fractional n) => Point v n -> v n -> Transformation v n #

reflectionZ :: (Additive v, R3 v, Num n) => Transformation v n #

rotateAbout :: (InSpace V3 n t, Floating n, Transformable t) => Point V3 n -> Direction V3 n -> Angle n -> t -> t #

rotationAbout :: Floating n => Point V3 n -> Direction V3 n -> Angle n -> Transformation V3 n #

scaleZ :: (InSpace v n t, R3 v, Fractional n, Transformable t) => n -> t -> t #

scalingZ :: (Additive v, R3 v, Fractional n) => n -> Transformation v n #

translateZ :: (InSpace v n t, R3 v, Transformable t) => n -> t -> t #

translationZ :: (Additive v, R3 v, Num n) => n -> Transformation v n #

mkP3 :: n -> n -> n -> P3 n #

mkR3 :: n -> n -> n -> V3 n #

p3 :: (n, n, n) -> P3 n #

p3Iso :: Iso' (P3 n) (n, n, n) #

r3 :: (n, n, n) -> V3 n #

r3CylindricalIso :: RealFloat n => Iso' (V3 n) (n, Angle n, n) #

r3Iso :: Iso' (V3 n) (n, n, n) #

r3SphericalIso :: RealFloat n => Iso' (V3 n) (n, Angle n, Angle n) #

unp3 :: P3 n -> (n, n, n) #

unr3 :: V3 n -> (n, n, n) #

unitZ :: (R3 v, Additive v, Num n) => v n #

unit_Z :: (R3 v, Additive v, Num n) => v n #

zDir :: (R3 v, Additive v, Num n) => Direction v n #

boundaryFrom :: (OrderedField n, Metric v, Semigroup m) => Subdiagram b v n m -> v n -> Point v n #

boundaryFromMay :: (Metric v, OrderedField n, Semigroup m) => Subdiagram b v n m -> v n -> Maybe (Point v n) #

_Line :: Prism' (Trail v n) (Trail' Line v n) #

_LocLine :: Prism' (Located (Trail v n)) (Located (Trail' Line v n)) #

_LocLoop :: Prism' (Located (Trail v n)) (Located (Trail' Loop v n)) #

_Loop :: Prism' (Trail v n) (Trail' Loop v n) #

closeLine :: Trail' Line v n -> Trail' Loop v n #

closeTrail :: Trail v n -> Trail v n #

cutLoop :: (Metric v, OrderedField n) => Trail' Loop v n -> Trail' Line v n #

cutTrail :: (Metric v, OrderedField n) => Trail v n -> Trail v n #

emptyLine :: (Metric v, OrderedField n) => Trail' Line v n #

emptyTrail :: (Metric v, OrderedField n) => Trail v n #

fixTrail :: (Metric v, OrderedField n) => Located (Trail v n) -> [FixedSegment v n] #

getSegment :: t -> GetSegment t #

glueLine :: (Metric v, OrderedField n) => Trail' Line v n -> Trail' Loop v n #

glueTrail :: (Metric v, OrderedField n) => Trail v n -> Trail v n #

isLine :: Trail v n -> Bool #

isLineEmpty :: (Metric v, OrderedField n) => Trail' Line v n -> Bool #

isLoop :: Trail v n -> Bool #

isTrailEmpty :: (Metric v, OrderedField n) => Trail v n -> Bool #

lineFromOffsets :: (Metric v, OrderedField n) => [v n] -> Trail' Line v n #

lineFromSegments :: (Metric v, OrderedField n) => [Segment Closed v n] -> Trail' Line v n #

lineFromVertices :: (Metric v, OrderedField n) => [Point v n] -> Trail' Line v n #

lineOffset :: (Metric v, OrderedField n) => Trail' Line v n -> v n #

lineOffsets :: Trail' Line v n -> [v n] #

lineSegments :: Trail' Line v n -> [Segment Closed v n] #

lineVertices :: (Metric v, OrderedField n) => Located (Trail' Line v n) -> [Point v n] #

lineVertices' :: (Metric v, OrderedField n) => n -> Located (Trail' Line v n) -> [Point v n] #

loopFromSegments :: (Metric v, OrderedField n) => [Segment Closed v n] -> Segment Open v n -> Trail' Loop v n #

loopOffsets :: (Metric v, OrderedField n) => Trail' Loop v n -> [v n] #

loopSegments :: Trail' Loop v n -> ([Segment Closed v n], Segment Open v n) #

loopVertices :: (Metric v, OrderedField n) => Located (Trail' Loop v n) -> [Point v n] #

loopVertices' :: (Metric v, OrderedField n) => n -> Located (Trail' Loop v n) -> [Point v n] #

numSegs :: (Num c, Measured (SegMeasure v n) a) => a -> c #

offset :: (OrderedField n, Metric v, Measured (SegMeasure v n) t) => t -> v n #

onLine :: (Metric v, OrderedField n) => (Trail' Line v n -> Trail' Line v n) -> Trail v n -> Trail v n #

onLineSegments :: (Metric v, OrderedField n) => ([Segment Closed v n] -> [Segment Closed v n]) -> Trail' Line v n -> Trail' Line v n #

onTrail :: (Trail' Line v n -> Trail' l1 v n) -> (Trail' Loop v n -> Trail' l2 v n) -> Trail v n -> Trail v n #

reverseLine :: (Metric v, OrderedField n) => Trail' Line v n -> Trail' Line v n #

reverseLocLine :: (Metric v, OrderedField n) => Located (Trail' Line v n) -> Located (Trail' Line v n) #

reverseLocLoop :: (Metric v, OrderedField n) => Located (Trail' Loop v n) -> Located (Trail' Loop v n) #

reverseLocTrail :: (Metric v, OrderedField n) => Located (Trail v n) -> Located (Trail v n) #

reverseLoop :: (Metric v, OrderedField n) => Trail' Loop v n -> Trail' Loop v n #

reverseTrail :: (Metric v, OrderedField n) => Trail v n -> Trail v n #

trailFromOffsets :: (Metric v, OrderedField n) => [v n] -> Trail v n #

trailFromSegments :: (Metric v, OrderedField n) => [Segment Closed v n] -> Trail v n #

trailFromVertices :: (Metric v, OrderedField n) => [Point v n] -> Trail v n #

trailLocSegments :: (Metric v, OrderedField n) => Located (Trail v n) -> [Located (Segment Closed v n)] #

trailMeasure :: (SegMeasure v n :>: m, Measured (SegMeasure v n) t) => a -> (m -> a) -> t -> a #

trailOffset :: (Metric v, OrderedField n) => Trail v n -> v n #

trailOffsets :: (Metric v, OrderedField n) => Trail v n -> [v n] #

trailSegments :: (Metric v, OrderedField n) => Trail v n -> [Segment Closed v n] #

trailVertices :: (Metric v, OrderedField n) => Located (Trail v n) -> [Point v n] #

trailVertices' :: (Metric v, OrderedField n) => n -> Located (Trail v n) -> [Point v n] #

unfixTrail :: (Metric v, Ord n, Floating n) => [FixedSegment v n] -> Located (Trail v n) #

withLine :: (Metric v, OrderedField n) => (Trail' Line v n -> r) -> Trail v n -> r #

withTrail :: (Trail' Line v n -> r) -> (Trail' Loop v n -> r) -> Trail v n -> r #

withTrail' :: (Trail' Line v n -> r) -> (Trail' Loop v n -> r) -> Trail' l v n -> r #

wrapLine :: Trail' Line v n -> Trail v n #

wrapLoop :: Trail' Loop v n -> Trail v n #

wrapTrail :: Trail' l v n -> Trail v n #

explodeTrail :: (V t ~ v, N t ~ n, TrailLike t) => Located (Trail v n) -> [t] #

fromLocOffsets :: (V t ~ v, N t ~ n, V (v n) ~ v, N (v n) ~ n, TrailLike t) => Located [v n] -> t #

fromLocSegments :: TrailLike t => Located [Segment Closed (V t) (N t)] -> t #

fromOffsets :: TrailLike t => [Vn t] -> t #

fromSegments :: TrailLike t => [Segment Closed (V t) (N t)] -> t #

fromVertices :: TrailLike t => [Point (V t) (N t)] -> t #

(~~) :: (V t ~ v, N t ~ n, TrailLike t) => Point v n -> Point v n -> t #

conjugate :: (Additive v, Num n) => Transformation v n -> Transformation v n -> Transformation v n #

movedFrom :: (InSpace v n a, SameSpace a b, HasOrigin a, HasOrigin b) => Point v n -> Iso a b a b #

movedTo :: (InSpace v n a, SameSpace a b, HasOrigin a, HasOrigin b) => Point v n -> Iso a b a b #

transformed :: (InSpace v n a, SameSpace a b, Transformable a, Transformable b) => Transformation v n -> Iso a b a b #

translated :: (InSpace v n a, SameSpace a b, Transformable a, Transformable b) => v n -> Iso a b a b #

underT :: (InSpace v n a, SameSpace a b, Transformable a, Transformable b) => (a -> b) -> Transformation v n -> a -> b #

alignB :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a #

alignBL :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a #

alignBR :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a #

alignL :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a #

alignR :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a #

alignT :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a #

alignTL :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a #

alignTR :: (InSpace V2 n a, Fractional n, Alignable a, HasOrigin a) => a -> a #

alignX :: (InSpace v n a, R1 v, Fractional n, Alignable a, HasOrigin a) => n -> a -> a #

alignY :: (InSpace v n a, R2 v, Fractional n, Alignable a, HasOrigin a) => n -> a -> a #

centerX :: (InSpace v n a, R1 v, Fractional n, Alignable a, HasOrigin a) => a -> a #

centerXY :: (InSpace v n a, R2 v, Fractional n, Alignable a, HasOrigin a) => a -> a #

centerY :: (InSpace v n a, R2 v, Fractional n, Alignable a, HasOrigin a) => a -> a #

snugB :: (InSpace V2 n a, Fractional n, Alignable a, Traced a, HasOrigin a) => a -> a #

snugCenterX :: (InSpace v n a, R1 v, Fractional n, Alignable a, Traced a, HasOrigin a) => a -> a #

snugCenterXY :: (InSpace v n a, R2 v, Fractional n, Alignable a, Traced a, HasOrigin a) => a -> a #

snugCenterY :: (InSpace v n a, R2 v, Fractional n, Alignable a, Traced a, HasOrigin a) => a -> a #

snugL :: (InSpace V2 n a, Fractional n, Alignable a, Traced a, HasOrigin a) => a -> a #

snugR :: (InSpace V2 n a, Fractional n, Alignable a, Traced a, HasOrigin a) => a -> a #

snugT :: (InSpace V2 n a, Fractional n, Alignable a, Traced a, HasOrigin a) => a -> a #

snugX :: (InSpace v n a, R1 v, Fractional n, Alignable a, Traced a, HasOrigin a) => n -> a -> a #

snugY :: (InSpace v n a, R2 v, Fractional n, Alignable a, Traced a, HasOrigin a) => n -> a -> a #

annularWedge :: (TrailLike t, V t ~ V2, N t ~ n, RealFloat n) => n -> n -> Direction V2 n -> Angle n -> t #

arc :: (InSpace V2 n t, OrderedField n, TrailLike t) => Direction V2 n -> Angle n -> t #

arc' :: (InSpace V2 n t, OrderedField n, TrailLike t) => n -> Direction V2 n -> Angle n -> t #

arcBetween :: (TrailLike t, V t ~ V2, N t ~ n, RealFloat n) => Point V2 n -> Point V2 n -> n -> t #

arcCCW :: (InSpace V2 n t, RealFloat n, TrailLike t) => Direction V2 n -> Direction V2 n -> t #

arcCW :: (InSpace V2 n t, RealFloat n, TrailLike t) => Direction V2 n -> Direction V2 n -> t #

wedge :: (InSpace V2 n t, OrderedField n, TrailLike t) => n -> Direction V2 n -> Angle n -> t #

arrow :: (TypeableFloat n, Renderable (Path V2 n) b) => n -> QDiagram b V2 n Any #

arrow' :: (TypeableFloat n, Renderable (Path V2 n) b) => ArrowOpts n -> n -> QDiagram b V2 n Any #

arrowAt :: (TypeableFloat n, Renderable (Path V2 n) b) => Point V2 n -> V2 n -> QDiagram b V2 n Any #

arrowAt' :: (TypeableFloat n, Renderable (Path V2 n) b) => ArrowOpts n -> Point V2 n -> V2 n -> QDiagram b V2 n Any #

arrowBetween :: (TypeableFloat n, Renderable (Path V2 n) b) => Point V2 n -> Point V2 n -> QDiagram b V2 n Any #

arrowBetween' :: (TypeableFloat n, Renderable (Path V2 n) b) => ArrowOpts n -> Point V2 n -> Point V2 n -> QDiagram b V2 n Any #

arrowHead :: Lens' (ArrowOpts n) (ArrowHT n) #

arrowShaft :: Lens' (ArrowOpts n) (Trail V2 n) #

arrowTail :: Lens' (ArrowOpts n) (ArrowHT n) #

arrowV :: (TypeableFloat n, Renderable (Path V2 n) b) => V2 n -> QDiagram b V2 n Any #

arrowV' :: (TypeableFloat n, Renderable (Path V2 n) b) => ArrowOpts n -> V2 n -> QDiagram b V2 n Any #

connect :: (TypeableFloat n, Renderable (Path V2 n) b, IsName n1, IsName n2) => n1 -> n2 -> QDiagram b V2 n Any -> QDiagram b V2 n Any #

connect' :: (TypeableFloat n, Renderable (Path V2 n) b, IsName n1, IsName n2) => ArrowOpts n -> n1 -> n2 -> QDiagram b V2 n Any -> QDiagram b V2 n Any #

connectOutside :: (TypeableFloat n, Renderable (Path V2 n) b, IsName n1, IsName n2) => n1 -> n2 -> QDiagram b V2 n Any -> QDiagram b V2 n Any #

connectOutside' :: (TypeableFloat n, Renderable (Path V2 n) b, IsName n1, IsName n2) => ArrowOpts n -> n1 -> n2 -> QDiagram b V2 n Any -> QDiagram b V2 n Any #

connectPerim :: (TypeableFloat n, Renderable (Path V2 n) b, IsName n1, IsName n2) => n1 -> n2 -> Angle n -> Angle n -> QDiagram b V2 n Any -> QDiagram b V2 n Any #

connectPerim' :: (TypeableFloat n, Renderable (Path V2 n) b, IsName n1, IsName n2) => ArrowOpts n -> n1 -> n2 -> Angle n -> Angle n -> QDiagram b V2 n Any -> QDiagram b V2 n Any #

gap :: Traversal' (ArrowOpts n) (Measure n) #

gaps :: Traversal' (ArrowOpts n) (Measure n) #

headGap :: Lens' (ArrowOpts n) (Measure n) #

headLength :: Lens' (ArrowOpts n) (Measure n) #

headStyle :: Lens' (ArrowOpts n) (Style V2 n) #

headTexture :: TypeableFloat n => Lens' (ArrowOpts n) (Texture n) #

lengths :: Traversal' (ArrowOpts n) (Measure n) #

shaftStyle :: Lens' (ArrowOpts n) (Style V2 n) #

shaftTexture :: TypeableFloat n => Lens' (ArrowOpts n) (Texture n) #

straightShaft :: OrderedField n => Trail V2 n #

tailGap :: Lens' (ArrowOpts n) (Measure n) #

tailLength :: Lens' (ArrowOpts n) (Measure n) #

tailStyle :: Lens' (ArrowOpts n) (Style V2 n) #

tailTexture :: TypeableFloat n => Lens' (ArrowOpts n) (Texture n) #

arrowheadDart :: RealFloat n => Angle n -> ArrowHT n #

arrowheadHalfDart :: RealFloat n => Angle n -> ArrowHT n #

arrowheadSpike :: RealFloat n => Angle n -> ArrowHT n #

arrowheadThorn :: RealFloat n => Angle n -> ArrowHT n #

arrowheadTriangle :: RealFloat n => Angle n -> ArrowHT n #

arrowtailBlock :: RealFloat n => Angle n -> ArrowHT n #

arrowtailQuill :: OrderedField n => Angle n -> ArrowHT n #

block :: RealFloat n => ArrowHT n #

dart :: RealFloat n => ArrowHT n #

dart' :: RealFloat n => ArrowHT n #

halfDart :: RealFloat n => ArrowHT n #

halfDart' :: RealFloat n => ArrowHT n #

lineHead :: RealFloat n => ArrowHT n #

lineTail :: RealFloat n => ArrowHT n #

noHead :: ArrowHT n #

noTail :: ArrowHT n #

quill :: (Floating n, Ord n) => ArrowHT n #

spike :: RealFloat n => ArrowHT n #

spike' :: RealFloat n => ArrowHT n #

thorn :: RealFloat n => ArrowHT n #

thorn' :: RealFloat n => ArrowHT n #

tri :: RealFloat n => ArrowHT n #

tri' :: RealFloat n => ArrowHT n #

_AC :: Prism' (Texture n) (AlphaColour Double) #

_FillTexture :: Iso' (FillTexture n) (Recommend (Texture n)) #

_LG :: Prism' (Texture n) (LGradient n) #

_LineTexture :: Iso (LineTexture n) (LineTexture n') (Texture n) (Texture n') #

_RG :: Prism' (Texture n) (RGradient n) #

_SC :: Prism' (Texture n) SomeColor #

_fillTexture :: (Typeable n, Floating n) => Lens' (Style V2 n) (Texture n) #

_lineTexture :: (Floating n, Typeable n) => Lens' (Style V2 n) (Texture n) #

defaultLG :: Fractional n => Texture n #

defaultRG :: Fractional n => Texture n #

fc :: (InSpace V2 n a, Floating n, Typeable n, HasStyle a) => Colour Double -> a -> a #

fcA :: (InSpace V2 n a, Floating n, Typeable n, HasStyle a) => AlphaColour Double -> a -> a #

fillColor :: (InSpace V2 n a, Color c, Typeable n, Floating n, HasStyle a) => c -> a -> a #

fillTexture :: (InSpace V2 n a, Typeable n, Floating n, HasStyle a) => Texture n -> a -> a #

getFillTexture :: FillTexture n -> Texture n #

getLineTexture :: LineTexture n -> Texture n #

lGradEnd :: Lens' (LGradient n) (Point V2 n) #

lGradSpreadMethod :: Lens' (LGradient n) SpreadMethod #

lGradStart :: Lens' (LGradient n) (Point V2 n) #

lGradStops :: Lens' (LGradient n) [GradientStop n] #

lGradTrans :: Lens' (LGradient n) (Transformation V2 n) #

lc :: (InSpace V2 n a, Typeable n, Floating n, HasStyle a) => Colour Double -> a -> a #

lcA :: (InSpace V2 n a, Typeable n, Floating n, HasStyle a) => AlphaColour Double -> a -> a #

lineColor :: (InSpace V2 n a, Color c, Typeable n, Floating n, HasStyle a) => c -> a -> a #

lineTexture :: (InSpace V2 n a, Typeable n, Floating n, HasStyle a) => Texture n -> a -> a #

lineTextureA :: (InSpace V2 n a, Typeable n, Floating n, HasStyle a) => LineTexture n -> a -> a #

mkLinearGradient :: Num n => [GradientStop n] -> Point V2 n -> Point V2 n -> SpreadMethod -> Texture n #

mkRadialGradient :: Num n => [GradientStop n] -> Point V2 n -> n -> Point V2 n -> n -> SpreadMethod -> Texture n #

mkStops :: [(Colour Double, d, Double)] -> [GradientStop d] #

rGradCenter0 :: Lens' (RGradient n) (Point V2 n) #

rGradCenter1 :: Lens' (RGradient n) (Point V2 n) #

rGradRadius0 :: Lens' (RGradient n) n #

rGradRadius1 :: Lens' (RGradient n) n #

rGradSpreadMethod :: Lens' (RGradient n) SpreadMethod #

rGradStops :: Lens' (RGradient n) [GradientStop n] #

rGradTrans :: Lens' (RGradient n) (Transformation V2 n) #

recommendFillColor :: (InSpace V2 n a, Color c, Typeable n, Floating n, HasStyle a) => c -> a -> a #

solid :: Color a => a -> Texture n #

stopColor :: Lens' (GradientStop n) SomeColor #

stopFraction :: Lens' (GradientStop n) n #

(===) :: (InSpace V2 n a, Juxtaposable a, Semigroup a) => a -> a -> a #

bg :: (TypeableFloat n, Renderable (Path V2 n) b) => Colour Double -> QDiagram b V2 n Any -> QDiagram b V2 n Any #

bgFrame :: (TypeableFloat n, Renderable (Path V2 n) b) => n -> Colour Double -> QDiagram b V2 n Any -> QDiagram b V2 n Any #

boundingRect :: (InSpace V2 n a, SameSpace a t, Enveloped t, Transformable t, TrailLike t, Monoid t, Enveloped a) => a -> t #

extrudeBottom :: (OrderedField n, Monoid' m) => n -> QDiagram b V2 n m -> QDiagram b V2 n m #

extrudeLeft :: (OrderedField n, Monoid' m) => n -> QDiagram b V2 n m -> QDiagram b V2 n m #

extrudeRight :: (OrderedField n, Monoid' m) => n -> QDiagram b V2 n m -> QDiagram b V2 n m #

extrudeTop :: (OrderedField n, Monoid' m) => n -> QDiagram b V2 n m -> QDiagram b V2 n m #

hcat :: (InSpace V2 n a, Floating n, Juxtaposable a, HasOrigin a, Monoid' a) => [a] -> a #

hcat' :: (InSpace V2 n a, Floating n, Juxtaposable a, HasOrigin a, Monoid' a) => CatOpts n -> [a] -> a #

hsep :: (InSpace V2 n a, Floating n, Juxtaposable a, HasOrigin a, Monoid' a) => n -> [a] -> a #

padX :: (Metric v, R2 v, OrderedField n, Monoid' m) => n -> QDiagram b v n m -> QDiagram b v n m #

padY :: (Metric v, R2 v, Monoid' m, OrderedField n) => n -> QDiagram b v n m -> QDiagram b v n m #

rectEnvelope :: (OrderedField n, Monoid' m) => Point V2 n -> V2 n -> QDiagram b V2 n m -> QDiagram b V2 n m #

strutX :: (Metric v, R1 v, OrderedField n) => n -> QDiagram b v n m #

strutY :: (Metric v, R2 v, OrderedField n) => n -> QDiagram b v n m #

vcat :: (InSpace V2 n a, Floating n, Juxtaposable a, HasOrigin a, Monoid' a) => [a] -> a #

vcat' :: (InSpace V2 n a, Floating n, Juxtaposable a, HasOrigin a, Monoid' a) => CatOpts n -> [a] -> a #

vsep :: (InSpace V2 n a, Floating n, Juxtaposable a, HasOrigin a, Monoid' a) => n -> [a] -> a #

(|||) :: (InSpace V2 n a, Juxtaposable a, Semigroup a) => a -> a -> a #

facingX :: (R1 v, Functor v, Fractional n) => Deformation v v n #

facingY :: (R2 v, Functor v, Fractional n) => Deformation v v n #

parallelX0 :: (R1 v, Num n) => Deformation v v n #

parallelY0 :: (R2 v, Num n) => Deformation v v n #

perspectiveX1 :: (R1 v, Functor v, Fractional n) => Deformation v v n #

perspectiveY1 :: (R2 v, Functor v, Floating n) => Deformation v v n #

circle :: (TrailLike t, V t ~ V2, N t ~ n, Transformable t) => n -> t #

ellipse :: (TrailLike t, V t ~ V2, N t ~ n, Transformable t) => n -> t #

ellipseXY :: (TrailLike t, V t ~ V2, N t ~ n, Transformable t) => n -> n -> t #

unitCircle :: (TrailLike t, V t ~ V2, N t ~ n) => t #

image :: (TypeableFloat n, Typeable a, Renderable (DImage n a) b) => DImage n a -> QDiagram b V2 n Any #

loadImageEmb :: Num n => FilePath -> IO (Either String (DImage n Embedded)) #

loadImageExt :: Num n => FilePath -> IO (Either String (DImage n External)) #

raster :: Num n => (Int -> Int -> AlphaColour Double) -> Int -> Int -> DImage n Embedded #

rasterDia :: (TypeableFloat n, Renderable (DImage n Embedded) b) => (Int -> Int -> AlphaColour Double) -> Int -> Int -> QDiagram b V2 n Any #

uncheckedImageRef :: Num n => FilePath -> Int -> Int -> DImage n External #

eColor :: Lens' (EnvelopeOpts n) (Colour Double) #

eLineWidth :: Lens (EnvelopeOpts n1) (EnvelopeOpts n2) (Measure n1) (Measure n2) #

ePoints :: Lens' (EnvelopeOpts n) Int #

oColor :: Lens' (OriginOpts n) (Colour Double) #

oMinSize :: Lens' (OriginOpts n) n #

oScale :: Lens' (OriginOpts n) n #

showEnvelope :: (Enum n, TypeableFloat n, Renderable (Path V2 n) b) => QDiagram b V2 n Any -> QDiagram b V2 n Any #

showEnvelope' :: (Enum n, TypeableFloat n, Renderable (Path V2 n) b) => EnvelopeOpts n -> QDiagram b V2 n Any -> QDiagram b V2 n Any #

showLabels :: (TypeableFloat n, Renderable (Text n) b, Semigroup m) => QDiagram b V2 n m -> QDiagram b V2 n Any #

showOrigin :: (TypeableFloat n, Renderable (Path V2 n) b, Monoid' m) => QDiagram b V2 n m -> QDiagram b V2 n m #

showOrigin' :: (TypeableFloat n, Renderable (Path V2 n) b, Monoid' m) => OriginOpts n -> QDiagram b V2 n m -> QDiagram b V2 n m #

showTrace :: (Enum n, TypeableFloat n, Renderable (Path V2 n) b) => QDiagram b V2 n Any -> QDiagram b V2 n Any #

showTrace' :: (Enum n, TypeableFloat n, Renderable (Path V2 n) b) => TraceOpts n -> QDiagram b V2 n Any -> QDiagram b V2 n Any #

tColor :: Lens' (TraceOpts n) (Colour Double) #

tMinSize :: Lens' (TraceOpts n) n #

tPoints :: Lens' (TraceOpts n) Int #

tScale :: Lens' (TraceOpts n) n #

_Clip :: Iso (Clip n) (Clip n') [Path V2 n] [Path V2 n'] #

_clip :: (Typeable n, OrderedField n) => Lens' (Style V2 n) [Path V2 n] #

_fillRule :: Lens' (Style V2 n) FillRule #

clipBy :: (HasStyle a, V a ~ V2, N a ~ n, TypeableFloat n) => Path V2 n -> a -> a #

clipTo :: TypeableFloat n => Path V2 n -> QDiagram b V2 n Any -> QDiagram b V2 n Any #

clipped :: TypeableFloat n => Path V2 n -> QDiagram b V2 n Any -> QDiagram b V2 n Any #

fillRule :: HasStyle a => FillRule -> a -> a #

intersectPoints :: (InSpace V2 n t, SameSpace t s, ToPath t, ToPath s, OrderedField n) => t -> s -> [P2 n] #

intersectPoints' :: (InSpace V2 n t, SameSpace t s, ToPath t, ToPath s, OrderedField n) => n -> t -> s -> [P2 n] #

intersectPointsP :: OrderedField n => Path V2 n -> Path V2 n -> [P2 n] #

intersectPointsP' :: OrderedField n => n -> Path V2 n -> Path V2 n -> [P2 n] #

intersectPointsT :: OrderedField n => Located (Trail V2 n) -> Located (Trail V2 n) -> [P2 n] #

intersectPointsT' :: OrderedField n => n -> Located (Trail V2 n) -> Located (Trail V2 n) -> [P2 n] #

queryFillRule :: Lens' (StrokeOpts a) FillRule #

stroke :: (InSpace V2 n t, ToPath t, TypeableFloat n, Renderable (Path V2 n) b) => t -> QDiagram b V2 n Any #

stroke' :: (InSpace V2 n t, ToPath t, TypeableFloat n, Renderable (Path V2 n) b, IsName a) => StrokeOpts a -> t -> QDiagram b V2 n Any #

strokeLine :: (TypeableFloat n, Renderable (Path V2 n) b) => Trail' Line V2 n -> QDiagram b V2 n Any #

strokeLocLine :: (TypeableFloat n, Renderable (Path V2 n) b) => Located (Trail' Line V2 n) -> QDiagram b V2 n Any #

strokeLocLoop :: (TypeableFloat n, Renderable (Path V2 n) b) => Located (Trail' Loop V2 n) -> QDiagram b V2 n Any #

strokeLocT :: (TypeableFloat n, Renderable (Path V2 n) b) => Located (Trail V2 n) -> QDiagram b V2 n Any #

strokeLocTrail :: (TypeableFloat n, Renderable (Path V2 n) b) => Located (Trail V2 n) -> QDiagram b V2 n Any #

strokeLoop :: (TypeableFloat n, Renderable (Path V2 n) b) => Trail' Loop V2 n -> QDiagram b V2 n Any #

strokeP :: (TypeableFloat n, Renderable (Path V2 n) b) => Path V2 n -> QDiagram b V2 n Any #

strokeP' :: (TypeableFloat n, Renderable (Path V2 n) b, IsName a) => StrokeOpts a -> Path V2 n -> QDiagram b V2 n Any #

strokePath :: (TypeableFloat n, Renderable (Path V2 n) b) => Path V2 n -> QDiagram b V2 n Any #

strokePath' :: (TypeableFloat n, Renderable (Path V2 n) b, IsName a) => StrokeOpts a -> Path V2 n -> QDiagram b V2 n Any #

strokeT :: (TypeableFloat n, Renderable (Path V2 n) b) => Trail V2 n -> QDiagram b V2 n Any #

strokeT' :: (TypeableFloat n, Renderable (Path V2 n) b, IsName a) => StrokeOpts a -> Trail V2 n -> QDiagram b V2 n Any #

strokeTrail :: (TypeableFloat n, Renderable (Path V2 n) b) => Trail V2 n -> QDiagram b V2 n Any #

strokeTrail' :: (TypeableFloat n, Renderable (Path V2 n) b, IsName a) => StrokeOpts a -> Trail V2 n -> QDiagram b V2 n Any #

vertexNames :: Lens (StrokeOpts a) (StrokeOpts a') [[a]] [[a']] #

polyCenter :: Lens' (PolygonOpts n) (Point V2 n) #

polyOrient :: Lens' (PolygonOpts n) (PolyOrientation n) #

polyTrail :: OrderedField n => PolygonOpts n -> Located (Trail V2 n) #

polyType :: Lens' (PolygonOpts n) (PolyType n) #

polygon :: (InSpace V2 n t, TrailLike t) => PolygonOpts n -> t #

star :: OrderedField n => StarOpts -> [Point V2 n] -> Path V2 n #

decagon :: (InSpace V2 n t, TrailLike t) => n -> t #

dodecagon :: (InSpace V2 n t, TrailLike t) => n -> t #

eqTriangle :: (InSpace V2 n t, TrailLike t) => n -> t #

hendecagon :: (InSpace V2 n t, TrailLike t) => n -> t #

heptagon :: (InSpace V2 n t, TrailLike t) => n -> t #

hexagon :: (InSpace V2 n t, TrailLike t) => n -> t #

hrule :: (InSpace V2 n t, TrailLike t) => n -> t #

nonagon :: (InSpace V2 n t, TrailLike t) => n -> t #

octagon :: (InSpace V2 n t, TrailLike t) => n -> t #

pentagon :: (InSpace V2 n t, TrailLike t) => n -> t #

radiusBL :: Lens' (RoundedRectOpts d) d #

radiusBR :: Lens' (RoundedRectOpts d) d #

radiusTL :: Lens' (RoundedRectOpts d) d #

radiusTR :: Lens' (RoundedRectOpts d) d #

rect :: (InSpace V2 n t, TrailLike t) => n -> n -> t #

regPoly :: (InSpace V2 n t, TrailLike t) => Int -> n -> t #

roundedRect :: (InSpace V2 n t, TrailLike t, RealFloat n) => n -> n -> n -> t #

roundedRect' :: (InSpace V2 n t, TrailLike t, RealFloat n) => n -> n -> RoundedRectOpts n -> t #

septagon :: (InSpace V2 n t, TrailLike t) => n -> t #

square :: (InSpace V2 n t, TrailLike t) => n -> t #

triangle :: (InSpace V2 n t, TrailLike t) => n -> t #

unitSquare :: (InSpace V2 n t, TrailLike t) => t #

vrule :: (InSpace V2 n t, TrailLike t) => n -> t #

dims2D :: n -> n -> SizeSpec V2 n #

extentX :: (InSpace v n a, R1 v, Enveloped a) => a -> Maybe (n, n) #

extentY :: (InSpace v n a, R2 v, Enveloped a) => a -> Maybe (n, n) #

height :: (InSpace V2 n a, Enveloped a) => a -> n #

mkHeight :: Num n => n -> SizeSpec V2 n #

mkSizeSpec2D :: Num n => Maybe n -> Maybe n -> SizeSpec V2 n #

mkWidth :: Num n => n -> SizeSpec V2 n #

width :: (InSpace V2 n a, Enveloped a) => a -> n #

_font :: Lens' (Style v n) (Maybe String) #

_fontSize :: (Typeable n, OrderedField n) => Lens' (Style v n) (Measure n) #

_fontSizeR :: (Typeable n, OrderedField n) => Lens' (Style v n) (Measured n (Recommend n)) #

alignedText :: (TypeableFloat n, Renderable (Text n) b) => n -> n -> String -> QDiagram b V2 n Any #

baselineText :: (TypeableFloat n, Renderable (Text n) b) => String -> QDiagram b V2 n Any #

bold :: HasStyle a => a -> a #

bolder :: HasStyle a => a -> a #

font :: HasStyle a => String -> a -> a #

fontSize :: (N a ~ n, Typeable n, HasStyle a) => Measure n -> a -> a #

fontSizeG :: (N a ~ n, Typeable n, Num n, HasStyle a) => n -> a -> a #

fontSizeL :: (N a ~ n, Typeable n, Num n, HasStyle a) => n -> a -> a #

fontSizeN :: (N a ~ n, Typeable n, Num n, HasStyle a) => n -> a -> a #

fontSizeO :: (N a ~ n, Typeable n, HasStyle a) => n -> a -> a #

heavy :: HasStyle a => a -> a #

italic :: HasStyle a => a -> a #

light :: HasStyle a => a -> a #

lighter :: HasStyle a => a -> a #

mediumWeight :: HasStyle a => a -> a #

oblique :: HasStyle a => a -> a #

semiBold :: HasStyle a => a -> a #

text :: (TypeableFloat n, Renderable (Text n) b) => String -> QDiagram b V2 n Any #

thinWeight :: HasStyle a => a -> a #

topLeftText :: (TypeableFloat n, Renderable (Text n) b) => String -> QDiagram b V2 n Any #

ultraBold :: HasStyle a => a -> a #

ultraLight :: HasStyle a => a -> a #

reflectAbout :: (InSpace V2 n t, OrderedField n, Transformable t) => P2 n -> Direction V2 n -> t -> t #

reflectX :: (InSpace v n t, R1 v, Transformable t) => t -> t #

reflectXY :: (InSpace v n t, R2 v, Transformable t) => t -> t #

reflectY :: (InSpace v n t, R2 v, Transformable t) => t -> t #

reflectionAbout :: OrderedField n => P2 n -> Direction V2 n -> T2 n #

reflectionX :: (Additive v, R1 v, Num n) => Transformation v n #

reflectionXY :: (Additive v, R2 v, Num n) => Transformation v n #

reflectionY :: (Additive v, R2 v, Num n) => Transformation v n #

rotateAround :: (InSpace V2 n t, Transformable t, Floating n) => P2 n -> Angle n -> t -> t #

rotateBy :: (InSpace V2 n t, Transformable t, Floating n) => n -> t -> t #

rotateTo :: (InSpace V2 n t, OrderedField n, Transformable t) => Direction V2 n -> t -> t #

rotated :: (InSpace V2 n a, Floating n, SameSpace a b, Transformable a, Transformable b) => Angle n -> Iso a b a b #

rotationAround :: Floating n => P2 n -> Angle n -> T2 n #

rotationTo :: OrderedField n => Direction V2 n -> T2 n #

scaleRotateTo :: (InSpace V2 n t, Transformable t, Floating n) => V2 n -> t -> t #

scaleToX :: (InSpace v n t, R2 v, Enveloped t, Transformable t) => n -> t -> t #

scaleToY :: (InSpace v n t, R2 v, Enveloped t, Transformable t) => n -> t -> t #

scaleUToX :: (InSpace v n t, R1 v, Enveloped t, Transformable t) => n -> t -> t #

scaleUToY :: (InSpace v n t, R2 v, Enveloped t, Transformable t) => n -> t -> t #

scaleX :: (InSpace v n t, R2 v, Fractional n, Transformable t) => n -> t -> t #

scaleY :: (InSpace v n t, R2 v, Fractional n, Transformable t) => n -> t -> t #

scalingRotationTo :: Floating n => V2 n -> T2 n #

scalingX :: (Additive v, R1 v, Fractional n) => n -> Transformation v n #

scalingY :: (Additive v, R2 v, Fractional n) => n -> Transformation v n #

shearX :: (InSpace V2 n t, Transformable t) => n -> t -> t #

shearY :: (InSpace V2 n t, Transformable t) => n -> t -> t #

shearingX :: Num n => n -> T2 n #

shearingY :: Num n => n -> T2 n #

translateX :: (InSpace v n t, R1 v, Transformable t) => n -> t -> t #

translateY :: (InSpace v n t, R2 v, Transformable t) => n -> t -> t #

translationX :: (Additive v, R1 v, Num n) => n -> Transformation v n #

translationY :: (Additive v, R2 v, Num n) => n -> Transformation v n #

mkP2 :: n -> n -> P2 n #

mkR2 :: n -> n -> V2 n #

p2 :: (n, n) -> P2 n #

r2 :: (n, n) -> V2 n #

r2PolarIso :: RealFloat n => Iso' (V2 n) (n, Angle n) #

unp2 :: P2 n -> (n, n) #

unr2 :: V2 n -> (n, n) #

angleDir :: Floating n => Angle n -> Direction V2 n #

angleV :: Floating n => Angle n -> V2 n #

leftTurn :: (Num n, Ord n) => V2 n -> V2 n -> Bool #

signedAngleBetween :: RealFloat n => V2 n -> V2 n -> Angle n #

signedAngleBetweenDirs :: RealFloat n => Direction V2 n -> Direction V2 n -> Angle n #

unitX :: (R1 v, Additive v, Num n) => v n #

unitY :: (R2 v, Additive v, Num n) => v n #

unit_X :: (R1 v, Additive v, Num n) => v n #

unit_Y :: (R2 v, Additive v, Num n) => v n #

xDir :: (R1 v, Additive v, Num n) => Direction v n #

yDir :: (R2 v, Additive v, Num n) => Direction v n #

(#) :: a -> (a -> b) -> b #

(##) :: AReview t b -> b -> t #

applyAll :: [a -> a] -> a -> a #

findHsFile :: FilePath -> IO (Maybe FilePath) #

findSandbox :: [FilePath] -> IO (Maybe FilePath) #

foldB :: (a -> a -> a) -> a -> [a] -> a #

globalPackage :: IO FilePath #

iterateN :: Int -> (a -> a) -> a -> [a] #

tau :: Floating a => a #

with :: Default d => d #

(#.) :: Coercible c b => (b -> c) -> (a -> b) -> a -> c #

(.#) :: Coercible b a => (b -> c) -> (a -> b) -> a -> c #

_Point :: Iso' (Point f a) (f a) #

distanceA :: (Floating a, Foldable (Diff p), Affine p) => p a -> p a -> a #

lensP :: Lens' (Point g a) (g a) #

origin :: (Additive f, Num a) => Point f a #

qdA :: (Affine p, Foldable (Diff p), Num a) => p a -> p a -> a #

relative :: (Additive f, Num a) => Point f a -> Iso' (Point f a) (f a) #

unP :: Point f a -> f a #

normalize :: (Floating a, Metric f, Epsilon a) => f a -> f a #

project :: (Metric v, Fractional a) => v a -> v a -> v a #

perp :: Num a => V2 a -> V2 a #

(*^) :: (Functor f, Num a) => a -> f a -> f a #

(^*) :: (Functor f, Num a) => f a -> a -> f a #

(^/) :: (Functor f, Fractional a) => f a -> a -> f a #

basis :: (Additive t, Traversable t, Num a) => [t a] #

basisFor :: (Traversable t, Num a) => t b -> [t a] #

negated :: (Functor f, Num a) => f a -> f a #

outer :: (Functor f, Functor g, Num a) => f a -> g a -> f (g a) #

scaled :: (Traversable t, Num a) => t a -> t (t a) #

sumV :: (Foldable f, Additive v, Num a) => f (v a) -> v a #

unit :: (Additive t, Num a) => ASetter' (t a) a -> t a #

iat :: At m => Index m -> IndexedLens' (Index m) m (Maybe (IxValue m)) #

icontains :: Contains m => Index m -> IndexedLens' (Index m) m Bool #

iix :: Ixed m => Index m -> IndexedTraversal' (Index m) m (IxValue m) #

ixAt :: At m => Index m -> Traversal' m (IxValue m) #

sans :: At m => Index m -> m -> m #

pattern (:<) :: forall b a. Cons b b a a => a -> b -> b #

pattern (:>) :: forall a b. Snoc a a b b => a -> b -> a #

(<|) :: Cons s s a a => a -> s -> s #

_head :: Cons s s a a => Traversal' s a #

_init :: Snoc s s a a => Traversal' s s #

_last :: Snoc s s a a => Traversal' s a #

_tail :: Cons s s a a => Traversal' s s #

cons :: Cons s s a a => a -> s -> s #

snoc :: Snoc s s a a => s -> a -> s #

uncons :: Cons s s a a => s -> Maybe (a, s) #

unsnoc :: Snoc s s a a => s -> Maybe (s, a) #

(|>) :: Snoc s s a a => s -> a -> s #

pattern Empty :: forall s. AsEmpty s => s #

fromEq :: AnEquality s t a b -> Equality b a t s #

mapEq :: AnEquality s t a b -> f s -> f a #

runEq :: AnEquality s t a b -> Identical s t a b #

simple :: Equality' a a #

simply :: (Optic' p f s a -> r) -> Optic' p f s a -> r #

substEq :: AnEquality s t a b -> ((s ~ a) -> (t ~ b) -> r) -> r #

(^..) :: s -> Getting (Endo [a]) s a -> [a] #

(^?) :: s -> Getting (First a) s a -> Maybe a #

(^?!) :: HasCallStack => s -> Getting (Endo a) s a -> a #

(^@..) :: s -> IndexedGetting i (Endo [(i, a)]) s a -> [(i, a)] #

(^@?) :: s -> IndexedGetting i (Endo (Maybe (i, a))) s a -> Maybe (i, a) #

(^@?!) :: HasCallStack => s -> IndexedGetting i (Endo (i, a)) s a -> (i, a) #

allOf :: Getting All s a -> (a -> Bool) -> s -> Bool #

andOf :: Getting All s Bool -> s -> Bool #

anyOf :: Getting Any s a -> (a -> Bool) -> s -> Bool #

asumOf :: Alternative f => Getting (Endo (f a)) s (f a) -> s -> f a #

concatMapOf :: Getting [r] s a -> (a -> [r]) -> s -> [r] #

concatOf :: Getting [r] s [r] -> s -> [r] #

cycled :: Apply f => LensLike f s t a b -> LensLike f s t a b #

droppingWhile :: (Conjoined p, Profunctor q, Applicative f) => (a -> Bool) -> Optical p q (Compose (State Bool) f) s t a a -> Optical p q f s t a a #

elemIndexOf :: Eq a => IndexedGetting i (First i) s a -> a -> s -> Maybe i #

elemIndicesOf :: Eq a => IndexedGetting i (Endo [i]) s a -> a -> s -> [i] #

elemOf :: Eq a => Getting Any s a -> a -> s -> Bool #

filtered :: (Choice p, Applicative f) => (a -> Bool) -> Optic' p f a a #

findIndexOf :: IndexedGetting i (First i) s a -> (a -> Bool) -> s -> Maybe i #

findIndicesOf :: IndexedGetting i (Endo [i]) s a -> (a -> Bool) -> s -> [i] #

findMOf :: Monad m => Getting (Endo (m (Maybe a))) s a -> (a -> m Bool) -> s -> m (Maybe a) #

findOf :: Getting (Endo (Maybe a)) s a -> (a -> Bool) -> s -> Maybe a #

first1Of :: Getting (First a) s a -> s -> a #

firstOf :: Getting (Leftmost a) s a -> s -> Maybe a #

foldByOf :: Fold s a -> (a -> a -> a) -> a -> s -> a #

foldMapByOf :: Fold s a -> (r -> r -> r) -> r -> (a -> r) -> s -> r #

foldMapOf :: Getting r s a -> (a -> r) -> s -> r #

foldOf :: Getting a s a -> s -> a #

folded :: Foldable f => IndexedFold Int (f a) a #

folded64 :: Foldable f => IndexedFold Int64 (f a) a #

folding :: Foldable f => (s -> f a) -> Fold s a #

foldl1Of :: HasCallStack => Getting (Dual (Endo (Maybe a))) s a -> (a -> a -> a) -> s -> a #

foldl1Of' :: HasCallStack => Getting (Endo (Endo (Maybe a))) s a -> (a -> a -> a) -> s -> a #

foldlMOf :: Monad m => Getting (Endo (r -> m r)) s a -> (r -> a -> m r) -> r -> s -> m r #

foldlOf :: Getting (Dual (Endo r)) s a -> (r -> a -> r) -> r -> s -> r #

foldlOf' :: Getting (Endo (Endo r)) s a -> (r -> a -> r) -> r -> s -> r #

foldr1Of :: HasCallStack => Getting (Endo (Maybe a)) s a -> (a -> a -> a) -> s -> a #

foldr1Of' :: HasCallStack => Getting (Dual (Endo (Endo (Maybe a)))) s a -> (a -> a -> a) -> s -> a #

foldrMOf :: Monad m => Getting (Dual (Endo (r -> m r))) s a -> (a -> r -> m r) -> r -> s -> m r #

foldrOf :: Getting (Endo r) s a -> (a -> r -> r) -> r -> s -> r #

foldrOf' :: Getting (Dual (Endo (Endo r))) s a -> (a -> r -> r) -> r -> s -> r #

foldring :: (Contravariant f, Applicative f) => ((a -> f a -> f a) -> f a -> s -> f a) -> LensLike f s t a b #

for1Of_ :: Functor f => Getting (TraversedF r f) s a -> s -> (a -> f r) -> f () #

forMOf_ :: Monad m => Getting (Sequenced r m) s a -> s -> (a -> m r) -> m () #

forOf_ :: Functor f => Getting (Traversed r f) s a -> s -> (a -> f r) -> f () #

has :: Getting Any s a -> s -> Bool #

hasn't :: Getting All s a -> s -> Bool #

iallOf :: IndexedGetting i All s a -> (i -> a -> Bool) -> s -> Bool #

ianyOf :: IndexedGetting i Any s a -> (i -> a -> Bool) -> s -> Bool #

iconcatMapOf :: IndexedGetting i [r] s a -> (i -> a -> [r]) -> s -> [r] #

idroppingWhile :: (Indexable i p, Profunctor q, Applicative f) => (i -> a -> Bool) -> Optical (Indexed i) q (Compose (State Bool) f) s t a a -> Optical p q f s t a a #

ifiltered :: (Indexable i p, Applicative f) => (i -> a -> Bool) -> Optical' p (Indexed i) f a a #

ifindMOf :: Monad m => IndexedGetting i (Endo (m (Maybe a))) s a -> (i -> a -> m Bool) -> s -> m (Maybe a) #

ifindOf :: IndexedGetting i (Endo (Maybe a)) s a -> (i -> a -> Bool) -> s -> Maybe a #

ifoldMapOf :: IndexedGetting i m s a -> (i -> a -> m) -> s -> m #

ifolding :: (Foldable f, Indexable i p, Contravariant g, Applicative g) => (s -> f (i, a)) -> Over p g s t a b #

ifoldlMOf :: Monad m => IndexedGetting i (Endo (r -> m r)) s a -> (i -> r -> a -> m r) -> r -> s -> m r #

ifoldlOf :: IndexedGetting i (Dual (Endo r)) s a -> (i -> r -> a -> r) -> r -> s -> r #

ifoldlOf' :: IndexedGetting i (Endo (r -> r)) s a -> (i -> r -> a -> r) -> r -> s -> r #

ifoldrMOf :: Monad m => IndexedGetting i (Dual (Endo (r -> m r))) s a -> (i -> a -> r -> m r) -> r -> s -> m r #

ifoldrOf :: IndexedGetting i (Endo r) s a -> (i -> a -> r -> r) -> r -> s -> r #

ifoldrOf' :: IndexedGetting i (Dual (Endo (r -> r))) s a -> (i -> a -> r -> r) -> r -> s -> r #

ifoldring :: (Indexable i p, Contravariant f, Applicative f) => ((i -> a -> f a -> f a) -> f a -> s -> f a) -> Over p f s t a b #

iforMOf_ :: Monad m => IndexedGetting i (Sequenced r m) s a -> s -> (i -> a -> m r) -> m () #

iforOf_ :: Functor f => IndexedGetting i (Traversed r f) s a -> s -> (i -> a -> f r) -> f () #

imapMOf_ :: Monad m => IndexedGetting i (Sequenced r m) s a -> (i -> a -> m r) -> s -> m () #

inoneOf :: IndexedGetting i Any s a -> (i -> a -> Bool) -> s -> Bool #

ipre :: IndexedGetting i (First (i, a)) s a -> IndexPreservingGetter s (Maybe (i, a)) #

ipreuse :: MonadState s m => IndexedGetting i (First (i, a)) s a -> m (Maybe (i, a)) #

ipreuses :: MonadState s m => IndexedGetting i (First r) s a -> (i -> a -> r) -> m (Maybe r) #

ipreview :: MonadReader s m => IndexedGetting i (First (i, a)) s a -> m (Maybe (i, a)) #

ipreviews :: MonadReader s m => IndexedGetting i (First r) s a -> (i -> a -> r) -> m (Maybe r) #

itakingWhile :: (Indexable i p, Profunctor q, Contravariant f, Applicative f) => (i -> a -> Bool) -> Optical' (Indexed i) q (Const (Endo (f s)) :: Type -> Type) s a -> Optical' p q f s a #

iterated :: Apply f => (a -> a) -> LensLike' f a a #

itoListOf :: IndexedGetting i (Endo [(i, a)]) s a -> s -> [(i, a)] #

itraverseOf_ :: Functor f => IndexedGetting i (Traversed r f) s a -> (i -> a -> f r) -> s -> f () #

last1Of :: Getting (Last a) s a -> s -> a #

lastOf :: Getting (Rightmost a) s a -> s -> Maybe a #

lengthOf :: Getting (Endo (Endo Int)) s a -> s -> Int #

lined :: Applicative f => IndexedLensLike' Int f String String #

lookupOf :: Eq k => Getting (Endo (Maybe v)) s (k, v) -> k -> s -> Maybe v #

mapMOf_ :: Monad m => Getting (Sequenced r m) s a -> (a -> m r) -> s -> m () #

maximum1Of :: Ord a => Getting (Max a) s a -> s -> a #

maximumByOf :: Getting (Endo (Endo (Maybe a))) s a -> (a -> a -> Ordering) -> s -> Maybe a #

maximumOf :: Ord a => Getting (Endo (Endo (Maybe a))) s a -> s -> Maybe a #

minimum1Of :: Ord a => Getting (Min a) s a -> s -> a #

minimumByOf :: Getting (Endo (Endo (Maybe a))) s a -> (a -> a -> Ordering) -> s -> Maybe a #

minimumOf :: Ord a => Getting (Endo (Endo (Maybe a))) s a -> s -> Maybe a #

msumOf :: MonadPlus m => Getting (Endo (m a)) s (m a) -> s -> m a #

noneOf :: Getting Any s a -> (a -> Bool) -> s -> Bool #

notElemOf :: Eq a => Getting All s a -> a -> s -> Bool #

notNullOf :: Getting Any s a -> s -> Bool #

nullOf :: Getting All s a -> s -> Bool #

orOf :: Getting Any s Bool -> s -> Bool #

pre :: Getting (First a) s a -> IndexPreservingGetter s (Maybe a) #

preuse :: MonadState s m => Getting (First a) s a -> m (Maybe a) #

preuses :: MonadState s m => Getting (First r) s a -> (a -> r) -> m (Maybe r) #

preview :: MonadReader s m => Getting (First a) s a -> m (Maybe a) #

previews :: MonadReader s m => Getting (First r) s a -> (a -> r) -> m (Maybe r) #

productOf :: Num a => Getting (Endo (Endo a)) s a -> s -> a #

repeated :: Apply f => LensLike' f a a #

replicated :: Int -> Fold a a #

sequence1Of_ :: Functor f => Getting (TraversedF a f) s (f a) -> s -> f () #

sequenceAOf_ :: Functor f => Getting (Traversed a f) s (f a) -> s -> f () #

sequenceOf_ :: Monad m => Getting (Sequenced a m) s (m a) -> s -> m () #

sumOf :: Num a => Getting (Endo (Endo a)) s a -> s -> a #

takingWhile :: (Conjoined p, Applicative f) => (a -> Bool) -> Over p (TakingWhile p f a a) s t a a -> Over p f s t a a #

toListOf :: Getting (Endo [a]) s a -> s -> [a] #

toNonEmptyOf :: Getting (NonEmptyDList a) s a -> s -> NonEmpty a #

traverse1Of_ :: Functor f => Getting (TraversedF r f) s a -> (a -> f r) -> s -> f () #

traverseOf_ :: Functor f => Getting (Traversed r f) s a -> (a -> f r) -> s -> f () #

unfolded :: (b -> Maybe (a, b)) -> Fold b a #

worded :: Applicative f => IndexedLensLike' Int f String String #

(^.) :: s -> Getting a s a -> a #

(^@.) :: s -> IndexedGetting i (i, a) s a -> (i, a) #

getting :: (Profunctor p, Profunctor q, Functor f, Contravariant f) => Optical p q f s t a b -> Optical' p q f s a #

ilike :: (Indexable i p, Contravariant f, Functor f) => i -> a -> Over' p f s a #

ilistening :: MonadWriter w m => IndexedGetting i (i, u) w u -> m a -> m (a, (i, u)) #

ilistenings :: MonadWriter w m => IndexedGetting i v w u -> (i -> u -> v) -> m a -> m (a, v) #

ito :: (Indexable i p, Contravariant f) => (s -> (i, a)) -> Over' p f s a #

iuse :: MonadState s m => IndexedGetting i (i, a) s a -> m (i, a) #

iuses :: MonadState s m => IndexedGetting i r s a -> (i -> a -> r) -> m r #

iview :: MonadReader s m => IndexedGetting i (i, a) s a -> m (i, a) #

iviews :: MonadReader s m => IndexedGetting i r s a -> (i -> a -> r) -> m r #

like :: (Profunctor p, Contravariant f, Functor f) => a -> Optic' p f s a #

listening :: MonadWriter w m => Getting u w u -> m a -> m (a, u) #

listenings :: MonadWriter w m => Getting v w u -> (u -> v) -> m a -> m (a, v) #

to :: (Profunctor p, Contravariant f) => (s -> a) -> Optic' p f s a #

use :: MonadState s m => Getting a s a -> m a #

uses :: MonadState s m => LensLike' (Const r :: Type -> Type) s a -> (a -> r) -> m r #

view :: MonadReader s m => Getting a s a -> m a #

views :: MonadReader s m => LensLike' (Const r :: Type -> Type) s a -> (a -> r) -> m r #

(<.) :: Indexable i p => (Indexed i s t -> r) -> ((a -> b) -> s -> t) -> p a b -> r #

iall :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Bool #

iany :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Bool #

icompose :: Indexable p c => (i -> j -> p) -> (Indexed i s t -> r) -> (Indexed j a b -> s -> t) -> c a b -> r #

iconcatMap :: FoldableWithIndex i f => (i -> a -> [b]) -> f a -> [b] #

ifind :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Maybe (i, a) #

ifoldMapBy :: FoldableWithIndex i t => (r -> r -> r) -> r -> (i -> a -> r) -> t a -> r #

ifoldMapByOf :: IndexedFold i t a -> (r -> r -> r) -> r -> (i -> a -> r) -> t -> r #

ifoldlM :: (FoldableWithIndex i f, Monad m) => (i -> b -> a -> m b) -> b -> f a -> m b #

ifoldrM :: (FoldableWithIndex i f, Monad m) => (i -> a -> b -> m b) -> b -> f a -> m b #

ifor :: (TraversableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f (t b) #

iforM :: (TraversableWithIndex i t, Monad m) => t a -> (i -> a -> m b) -> m (t b) #

iforM_ :: (FoldableWithIndex i t, Monad m) => t a -> (i -> a -> m b) -> m () #

ifor_ :: (FoldableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f () #

imapAccumL :: TraversableWithIndex i t => (i -> s -> a -> (s, b)) -> s -> t a -> (s, t b) #

imapAccumR :: TraversableWithIndex i t => (i -> s -> a -> (s, b)) -> s -> t a -> (s, t b) #

imapM :: (TraversableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m (t b) #

imapM_ :: (FoldableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m () #

index :: (Indexable i p, Eq i, Applicative f) => i -> Optical' p (Indexed i) f a a #

inone :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Bool #

itoList :: FoldableWithIndex i f => f a -> [(i, a)] #

itraverseBy :: TraversableWithIndex i t => (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> t a -> f (t b) #

itraverseByOf :: IndexedTraversal i s t a b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> s -> f t #

itraverse_ :: (FoldableWithIndex i t, Applicative f) => (i -> a -> f b) -> t a -> f () #

reindexed :: Indexable j p => (i -> j) -> (Indexed i a b -> r) -> p a b -> r #

selfIndex :: Indexable a p => p a fb -> a -> fb #

asIndex :: (Indexable i p, Contravariant f, Functor f) => p i (f i) -> Indexed i s (f s) #

indexing :: Indexable Int p => ((a -> Indexing f b) -> s -> Indexing f t) -> p a (f b) -> s -> f t #

indexing64 :: Indexable Int64 p => ((a -> Indexing64 f b) -> s -> Indexing64 f t) -> p a (f b) -> s -> f t #

withIndex :: (Indexable i p, Functor f) => p (i, s) (f (j, t)) -> Indexed i s (f t) #

makeClassyPrisms :: Name -> DecsQ #

makePrisms :: Name -> DecsQ #

retagged :: (Profunctor p, Bifunctor p) => p a b -> p s b #

pattern Lazy :: forall t s. Strict t s => t -> s #

pattern List :: forall l. IsList l => [Item l] -> l #

pattern Reversed :: forall t. Reversing t => t -> t #

pattern Strict :: forall s t. Strict s t => t -> s #

pattern Swapped :: forall (p :: Type -> Type -> Type) c d. Swapped p => p d c -> p c d #

anon :: a -> (a -> Bool) -> Iso' (Maybe a) a #

au :: Functor f => AnIso s t a b -> ((b -> t) -> f s) -> f a #

auf :: Optic (Costar f) g s t a b -> (f a -> g b) -> f s -> g t #

bimapping :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (f s s') (g t t') (f a a') (g b b') #

cloneIso :: AnIso s t a b -> Iso s t a b #

coerced :: (Coercible s a, Coercible t b) => Iso s t a b #

contramapping :: Contravariant f => AnIso s t a b -> Iso (f a) (f b) (f s) (f t) #

curried :: Iso ((a, b) -> c) ((d, e) -> f) (a -> b -> c) (d -> e -> f) #

dimapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (p a s') (q b t') (p s a') (q t b') #

enum :: Enum a => Iso' Int a #

firsting :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f s x) (g t y) (f a x) (g b y) #

flipped :: Iso (a -> b -> c) (a' -> b' -> c') (b -> a -> c) (b' -> a' -> c') #

from :: AnIso s t a b -> Iso b a t s #

imagma :: Over (Indexed i) (Molten i a b) s t a b -> Iso s t' (Magma i t b a) (Magma j t' c c) #

involuted :: (a -> a) -> Iso' a a #

iso :: (s -> a) -> (b -> t) -> Iso s t a b #

lazy :: Strict lazy strict => Iso' strict lazy #

lmapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p a x) (q b y) (p s x) (q t y) #

magma :: LensLike (Mafic a b) s t a b -> Iso s u (Magma Int t b a) (Magma j u c c) #

mapping :: (Functor f, Functor g) => AnIso s t a b -> Iso (f s) (g t) (f a) (g b) #

non :: Eq a => a -> Iso' (Maybe a) a #

non' :: APrism' a () -> Iso' (Maybe a) a #

reversed :: Reversing a => Iso' a a #

rmapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p x s) (q y t) (p x a) (q y b) #

seconding :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f x s) (g y t) (f x a) (g y b) #

uncurried :: Iso (a -> b -> c) (d -> e -> f) ((a, b) -> c) ((d, e) -> f) #

under :: AnIso s t a b -> (t -> s) -> b -> a #

withIso :: AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r #

(#%%=) :: MonadState s m => ALens s s a b -> (a -> (r, b)) -> m r #

(#%%~) :: Functor f => ALens s t a b -> (a -> f b) -> s -> f t #

(#%=) :: MonadState s m => ALens s s a b -> (a -> b) -> m () #

(#%~) :: ALens s t a b -> (a -> b) -> s -> t #

(#=) :: MonadState s m => ALens s s a b -> b -> m () #

(#~) :: ALens s t a b -> b -> s -> t #

(%%=) :: MonadState s m => Over p ((,) r) s s a b -> p a (r, b) -> m r #

(%%@=) :: MonadState s m => Over (Indexed i) ((,) r) s s a b -> (i -> a -> (r, b)) -> m r #

(%%@~) :: Over (Indexed i) f s t a b -> (i -> a -> f b) -> s -> f t #

(%%~) :: LensLike f s t a b -> (a -> f b) -> s -> f t #

(&~) :: s -> State s a -> s #

(<#%=) :: MonadState s m => ALens s s a b -> (a -> b) -> m b #

(<#%~) :: ALens s t a b -> (a -> b) -> s -> (b, t) #

(<#=) :: MonadState s m => ALens s s a b -> b -> m b #

(<#~) :: ALens s t a b -> b -> s -> (b, t) #

(<%=) :: MonadState s m => LensLike ((,) b) s s a b -> (a -> b) -> m b #

(<%@=) :: MonadState s m => Over (Indexed i) ((,) b) s s a b -> (i -> a -> b) -> m b #

(<%@~) :: Over (Indexed i) ((,) b) s t a b -> (i -> a -> b) -> s -> (b, t) #

(<%~) :: LensLike ((,) b) s t a b -> (a -> b) -> s -> (b, t) #

(<&&=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool #

(<&&~) :: LensLike ((,) Bool) s t Bool Bool -> Bool -> s -> (Bool, t) #

(<**=) :: (MonadState s m, Floating a) => LensLike' ((,) a) s a -> a -> m a #

(<**~) :: Floating a => LensLike ((,) a) s t a a -> a -> s -> (a, t) #

(<*=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<*~) :: Num a => LensLike ((,) a) s t a a -> a -> s -> (a, t) #

(<+=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<+~) :: Num a => LensLike ((,) a) s t a a -> a -> s -> (a, t) #

(<-=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<-~) :: Num a => LensLike ((,) a) s t a a -> a -> s -> (a, t) #

(<//=) :: (MonadState s m, Fractional a) => LensLike' ((,) a) s a -> a -> m a #

(<//~) :: Fractional a => LensLike ((,) a) s t a a -> a -> s -> (a, t) #

(<<%=) :: (Strong p, MonadState s m) => Over p ((,) a) s s a b -> p a b -> m a #

(<<%@=) :: MonadState s m => Over (Indexed i) ((,) a) s s a b -> (i -> a -> b) -> m a #

(<<%@~) :: Over (Indexed i) ((,) a) s t a b -> (i -> a -> b) -> s -> (a, t) #

(<<%~) :: LensLike ((,) a) s t a b -> (a -> b) -> s -> (a, t) #

(<<&&=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool #

(<<&&~) :: LensLike' ((,) Bool) s Bool -> Bool -> s -> (Bool, s) #

(<<**=) :: (MonadState s m, Floating a) => LensLike' ((,) a) s a -> a -> m a #

(<<**~) :: Floating a => LensLike' ((,) a) s a -> a -> s -> (a, s) #

(<<*=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<<*~) :: Num a => LensLike' ((,) a) s a -> a -> s -> (a, s) #

(<<+=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<<+~) :: Num a => LensLike' ((,) a) s a -> a -> s -> (a, s) #

(<<-=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<<-~) :: Num a => LensLike' ((,) a) s a -> a -> s -> (a, s) #

(<<.=) :: MonadState s m => LensLike ((,) a) s s a b -> b -> m a #

(<<.~) :: LensLike ((,) a) s t a b -> b -> s -> (a, t) #

(<<//=) :: (MonadState s m, Fractional a) => LensLike' ((,) a) s a -> a -> m a #

(<<//~) :: Fractional a => LensLike' ((,) a) s a -> a -> s -> (a, s) #

(<<<>=) :: (MonadState s m, Monoid r) => LensLike' ((,) r) s r -> r -> m r #

(<<<>~) :: Monoid r => LensLike' ((,) r) s r -> r -> s -> (r, s) #

(<<>=) :: (MonadState s m, Monoid r) => LensLike' ((,) r) s r -> r -> m r #

(<<>~) :: Monoid m => LensLike ((,) m) s t m m -> m -> s -> (m, t) #

(<<?=) :: MonadState s m => LensLike ((,) a) s s a (Maybe b) -> b -> m a #

(<<?~) :: LensLike ((,) a) s t a (Maybe b) -> b -> s -> (a, t) #

(<<^=) :: (MonadState s m, Num a, Integral e) => LensLike' ((,) a) s a -> e -> m a #

(<<^^=) :: (MonadState s m, Fractional a, Integral e) => LensLike' ((,) a) s a -> e -> m a #

(<<^^~) :: (Fractional a, Integral e) => LensLike' ((,) a) s a -> e -> s -> (a, s) #

(<<^~) :: (Num a, Integral e) => LensLike' ((,) a) s a -> e -> s -> (a, s) #

(<<||=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool #

(<<||~) :: LensLike' ((,) Bool) s Bool -> Bool -> s -> (Bool, s) #

(<<~) :: MonadState s m => ALens s s a b -> m b -> m b #

(<^=) :: (MonadState s m, Num a, Integral e) => LensLike' ((,) a) s a -> e -> m a #

(<^^=) :: (MonadState s m, Fractional a, Integral e) => LensLike' ((,) a) s a -> e -> m a #

(<^^~) :: (Fractional a, Integral e) => LensLike ((,) a) s t a a -> e -> s -> (a, t) #

(<^~) :: (Num a, Integral e) => LensLike ((,) a) s t a a -> e -> s -> (a, t) #

(<||=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool #

(<||~) :: LensLike ((,) Bool) s t Bool Bool -> Bool -> s -> (Bool, t) #

(??) :: Functor f => f (a -> b) -> a -> f b #

(^#) :: s -> ALens s t a b -> a #

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') #

choosing :: Functor f => LensLike f s t a b -> LensLike f s' t' a b -> LensLike f (Either s s') (Either t t') a b #

chosen :: IndexPreservingLens (Either a a) (Either b b) a b #

cloneIndexPreservingLens :: ALens s t a b -> IndexPreservingLens s t a b #

cloneIndexedLens :: AnIndexedLens i s t a b -> IndexedLens i s t a b #

cloneLens :: ALens s t a b -> Lens s t a b #

devoid :: Over p f Void Void a b #

fusing :: Functor f => LensLike (Yoneda f) s t a b -> LensLike f s t a b #

ilens :: (s -> (i, a)) -> (s -> b -> t) -> IndexedLens i s t a b #

iplens :: (s -> a) -> (s -> b -> t) -> IndexPreservingLens s t a b #

lens :: (s -> a) -> (s -> b -> t) -> Lens s t a b #

locus :: IndexedComonadStore p => Lens (p a c s) (p b c s) a b #

overA :: Arrow ar => LensLike (Context a b) s t a b -> ar a b -> ar s t #

storing :: ALens s t a b -> b -> s -> t #

united :: Lens' a () #

ilevels :: Applicative f => Traversing (Indexed i) f s t a b -> IndexedLensLike Int f s t (Level i a) (Level j b) #

composOpFold :: Plated a => b -> (b -> b -> b) -> (a -> b) -> a -> b #

contexts :: Plated a => a -> [Context a a a] #

contextsOf :: ATraversal' a a -> a -> [Context a a a] #

contextsOn :: Plated a => ATraversal s t a a -> s -> [Context a a t] #

contextsOnOf :: ATraversal s t a a -> ATraversal' a a -> s -> [Context a a t] #

cosmos :: Plated a => Fold a a #

cosmosOf :: (Applicative f, Contravariant f) => LensLike' f a a -> LensLike' f a a #

cosmosOn :: (Applicative f, Contravariant f, Plated a) => LensLike' f s a -> LensLike' f s a #

cosmosOnOf :: (Applicative f, Contravariant f) => LensLike' f s a -> LensLike' f a a -> LensLike' f s a #

deep :: (Conjoined p, Applicative f, Plated s) => Traversing p f s s a b -> Over p f s s a b #

gplate :: (Generic a, GPlated a (Rep a)) => Traversal' a a #

gplate1 :: (Generic1 f, GPlated1 f (Rep1 f)) => Traversal' (f a) (f a) #

holes :: Plated a => a -> [Pretext ((->) :: Type -> Type -> Type) a a a] #

holesOn :: Conjoined p => Over p (Bazaar p a a) s t a a -> s -> [Pretext p a a t] #

holesOnOf :: Conjoined p => LensLike (Bazaar p r r) s t a b -> Over p (Bazaar p r r) a b r r -> s -> [Pretext p r r t] #

para :: Plated a => (a -> [r] -> r) -> a -> r #

paraOf :: Getting (Endo [a]) a a -> (a -> [r] -> r) -> a -> r #

parts :: Plated a => Lens' a [a] #

rewrite :: Plated a => (a -> Maybe a) -> a -> a #

rewriteM :: (Monad m, Plated a) => (a -> m (Maybe a)) -> a -> m a #

rewriteMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m (Maybe a)) -> a -> m b #

rewriteMOn :: (Monad m, Plated a) => LensLike (WrappedMonad m) s t a a -> (a -> m (Maybe a)) -> s -> m t #

rewriteMOnOf :: Monad m => LensLike (WrappedMonad m) s t a b -> LensLike (WrappedMonad m) a b a b -> (b -> m (Maybe a)) -> s -> m t #

rewriteOf :: ASetter a b a b -> (b -> Maybe a) -> a -> b #

rewriteOn :: Plated a => ASetter s t a a -> (a -> Maybe a) -> s -> t #

rewriteOnOf :: ASetter s t a b -> ASetter a b a b -> (b -> Maybe a) -> s -> t #

transformM :: (Monad m, Plated a) => (a -> m a) -> a -> m a #

transformMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m b) -> a -> m b #

transformMOn :: (Monad m, Plated a) => LensLike (WrappedMonad m) s t a a -> (a -> m a) -> s -> m t #

transformMOnOf :: Monad m => LensLike (WrappedMonad m) s t a b -> LensLike (WrappedMonad m) a b a b -> (b -> m b) -> s -> m t #

transformOf :: ASetter a b a b -> (b -> b) -> a -> b #

transformOn :: Plated a => ASetter s t a a -> (a -> a) -> s -> t #

transformOnOf :: ASetter s t a b -> ASetter a b a b -> (b -> b) -> s -> t #

universe :: Plated a => a -> [a] #

universeOf :: Getting [a] a a -> a -> [a] #

universeOn :: Plated a => Getting [a] s a -> s -> [a] #

universeOnOf :: Getting [a] s a -> Getting [a] a a -> s -> [a] #

_Just :: Prism (Maybe a) (Maybe b) a b #

_Left :: Prism (Either a c) (Either b c) a b #

_Nothing :: Prism' (Maybe a) () #

_Right :: Prism (Either c a) (Either c b) a b #

_Show :: (Read a, Show a) => Prism' String a #

_Void :: Prism s s a Void #

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

below :: Traversable f => APrism' s a -> Prism' (f s) (f a) #

clonePrism :: APrism s t a b -> Prism s t a b #

isn't :: APrism s t a b -> s -> Bool #

matching :: APrism s t a b -> s -> Either t a #

nearly :: a -> (a -> Bool) -> Prism' a () #

only :: Eq a => a -> Prism' a () #

prism :: (b -> t) -> (s -> Either t a) -> Prism s t a b #

prism' :: (b -> s) -> (s -> Maybe a) -> Prism s s a b #

withPrism :: APrism s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r #

without :: APrism s t a b -> APrism u v c d -> Prism (Either s u) (Either t v) (Either a c) (Either b d) #

re :: AReview t b -> Getter b t #

reuse :: MonadState b m => AReview t b -> m t #

reuses :: MonadState b m => AReview t b -> (t -> r) -> m r #

review :: MonadReader b m => AReview t b -> m t #

reviews :: MonadReader b m => AReview t b -> (t -> r) -> m r #

un :: (Profunctor p, Bifunctor p, Functor f) => Getting a s a -> Optic' p f a s #

unto :: (Profunctor p, Bifunctor p, Functor f) => (b -> t) -> Optic p f s t a b #

(%=) :: MonadState s m => ASetter s s a b -> (a -> b) -> m () #

(%@=) :: MonadState s m => AnIndexedSetter i s s a b -> (i -> a -> b) -> m () #

(%@~) :: AnIndexedSetter i s t a b -> (i -> a -> b) -> s -> t #

(%~) :: ASetter s t a b -> (a -> b) -> s -> t #

(&&=) :: MonadState s m => ASetter' s Bool -> Bool -> m () #

(&&~) :: ASetter s t Bool Bool -> Bool -> s -> t #

(**=) :: (MonadState s m, Floating a) => ASetter' s a -> a -> m () #

(**~) :: Floating a => ASetter s t a a -> a -> s -> t #

(*=) :: (MonadState s m, Num a) => ASetter' s a -> a -> m () #

(*~) :: Num a => ASetter s t a a -> a -> s -> t #

(+=) :: (MonadState s m, Num a) => ASetter' s a -> a -> m () #

(+~) :: Num a => ASetter s t a a -> a -> s -> t #

(-=) :: (MonadState s m, Num a) => ASetter' s a -> a -> m () #

(-~) :: Num a => ASetter s t a a -> a -> s -> t #

(.=) :: MonadState s m => ASetter s s a b -> b -> m () #

(.@=) :: MonadState s m => AnIndexedSetter i s s a b -> (i -> b) -> m () #

(.@~) :: AnIndexedSetter i s t a b -> (i -> b) -> s -> t #

(.~) :: ASetter s t a b -> b -> s -> t #

(//=) :: (MonadState s m, Fractional a) => ASetter' s a -> a -> m () #

(//~) :: Fractional a => ASetter s t a a -> a -> s -> t #

(<.=) :: MonadState s m => ASetter s s a b -> b -> m b #

(<.~) :: ASetter s t a b -> b -> s -> (b, t) #

(<>=) :: (MonadState s m, Monoid a) => ASetter' s a -> a -> m () #

(<>~) :: Monoid a => ASetter s t a a -> a -> s -> t #

(<?=) :: MonadState s m => ASetter s s a (Maybe b) -> b -> m b #

(<?~) :: ASetter s t a (Maybe b) -> b -> s -> (b, t) #

(<~) :: MonadState s m => ASetter s s a b -> m b -> m () #

(?=) :: MonadState s m => ASetter s s a (Maybe b) -> b -> m () #

(?~) :: ASetter s t a (Maybe b) -> b -> s -> t #

(^=) :: (MonadState s m, Num a, Integral e) => ASetter' s a -> e -> m () #

(^^=) :: (MonadState s m, Fractional a, Integral e) => ASetter' s a -> e -> m () #

(^^~) :: (Fractional a, Integral e) => ASetter s t a a -> e -> s -> t #

(^~) :: (Num a, Integral e) => ASetter s t a a -> e -> s -> t #

assign :: MonadState s m => ASetter s s a b -> b -> m () #

assignA :: Arrow p => ASetter s t a b -> p s b -> p s t #

censoring :: MonadWriter w m => Setter w w u v -> (u -> v) -> m a -> m a #

cloneIndexPreservingSetter :: ASetter s t a b -> IndexPreservingSetter s t a b #

cloneIndexedSetter :: AnIndexedSetter i s t a b -> IndexedSetter i s t a b #

cloneSetter :: ASetter s t a b -> Setter s t a b #

contramapped :: Contravariant f => Setter (f b) (f a) a b #

icensoring :: MonadWriter w m => IndexedSetter i w w u v -> (i -> u -> v) -> m a -> m a #

ilocally :: MonadReader s m => AnIndexedSetter i s s a b -> (i -> a -> b) -> m r -> m r #

imapOf :: AnIndexedSetter i s t a b -> (i -> a -> b) -> s -> t #

imodifying :: MonadState s m => AnIndexedSetter i s s a b -> (i -> a -> b) -> m () #

iover :: AnIndexedSetter i s t a b -> (i -> a -> b) -> s -> t #

ipassing :: MonadWriter w m => IndexedSetter i w w u v -> m (a, i -> u -> v) -> m a #

iset :: AnIndexedSetter i s t a b -> (i -> b) -> s -> t #

isets :: ((i -> a -> b) -> s -> t) -> IndexedSetter i s t a b #

lifted :: Monad m => Setter (m a) (m b) a b #

locally :: MonadReader s m => ASetter s s a b -> (a -> b) -> m r -> m r #

mapOf :: ASetter s t a b -> (a -> b) -> s -> t #

mapped :: Functor f => Setter (f a) (f b) a b #

modifying :: MonadState s m => ASetter s s a b -> (a -> b) -> m () #

over :: ASetter s t a b -> (a -> b) -> s -> t #

passing :: MonadWriter w m => Setter w w u v -> m (a, u -> v) -> m a #

scribe :: (MonadWriter t m, Monoid s) => ASetter s t a b -> b -> m () #

set :: ASetter s t a b -> b -> s -> t #

set' :: ASetter' s a -> a -> s -> s #

sets :: (Profunctor p, Profunctor q, Settable f) => (p a b -> q s t) -> Optical p q f s t a b #

setting :: ((a -> b) -> s -> t) -> IndexPreservingSetter s t a b #

(||=) :: MonadState s m => ASetter' s Bool -> Bool -> m () #

(||~) :: ASetter s t Bool Bool -> Bool -> s -> t #

abbreviatedFields :: LensRules #

abbreviatedNamer :: FieldNamer #

camelCaseFields :: LensRules #

camelCaseNamer :: FieldNamer #

classUnderscoreNoPrefixFields :: LensRules #

classUnderscoreNoPrefixNamer :: FieldNamer #

classyRules :: LensRules #

classyRules_ :: LensRules #

createClass :: Lens' LensRules Bool #

declareClassy :: DecsQ -> DecsQ #

declareClassyFor :: [(String, (String, String))] -> [(String, String)] -> DecsQ -> DecsQ #

declareFields :: DecsQ -> DecsQ #

declareLenses :: DecsQ -> DecsQ #

declareLensesFor :: [(String, String)] -> DecsQ -> DecsQ #

declareLensesWith :: LensRules -> DecsQ -> DecsQ #

declarePrisms :: DecsQ -> DecsQ #

declareWrapped :: DecsQ -> DecsQ #

defaultFieldRules :: LensRules #

generateLazyPatterns :: Lens' LensRules Bool #

generateSignatures :: Lens' LensRules Bool #

generateUpdateableOptics :: Lens' LensRules Bool #

lensClass :: Lens' LensRules ClassyNamer #

lensField :: Lens' LensRules FieldNamer #

lensRules :: LensRules #

lensRulesFor :: [(String, String)] -> LensRules #

lookingupNamer :: [(String, String)] -> FieldNamer #

makeClassy :: Name -> DecsQ #

makeClassyFor :: String -> String -> [(String, String)] -> Name -> DecsQ #

makeClassy_ :: Name -> DecsQ #

makeFields :: Name -> DecsQ #

makeFieldsNoPrefix :: Name -> DecsQ #

makeLenses :: Name -> DecsQ #

makeLensesFor :: [(String, String)] -> Name -> DecsQ #

makeLensesWith :: LensRules -> Name -> DecsQ #

makeWrapped :: Name -> DecsQ #

mappingNamer :: (String -> [String]) -> FieldNamer #

simpleLenses :: Lens' LensRules Bool #

underscoreFields :: LensRules #

underscoreNamer :: FieldNamer #

underscoreNoPrefixNamer :: FieldNamer #

both :: Bitraversable r => Traversal (r a a) (r b b) a b #

both1 :: Bitraversable1 r => Traversal1 (r a a) (r b b) a b #

cloneIndexPreservingTraversal :: ATraversal s t a b -> IndexPreservingTraversal s t a b #

cloneIndexPreservingTraversal1 :: ATraversal1 s t a b -> IndexPreservingTraversal1 s t a b #

cloneIndexedTraversal :: AnIndexedTraversal i s t a b -> IndexedTraversal i s t a b #

cloneIndexedTraversal1 :: AnIndexedTraversal1 i s t a b -> IndexedTraversal1 i s t a b #

cloneTraversal :: ATraversal s t a b -> Traversal s t a b #

cloneTraversal1 :: ATraversal1 s t a b -> Traversal1 s t a b #

confusing :: Applicative f => LensLike (Curried (Yoneda f) (Yoneda f)) s t a b -> LensLike f s t a b #

deepOf :: (Conjoined p, Applicative f) => LensLike f s t s t -> Traversing p f s t a b -> Over p f s t a b #

dropping :: (Conjoined p, Applicative f) => Int -> Over p (Indexing f) s t a a -> Over p f s t a a #

element :: Traversable t => Int -> IndexedTraversal' Int (t a) a #

elementOf :: Applicative f => LensLike (Indexing f) s t a a -> Int -> IndexedLensLike Int f s t a a #

elements :: Traversable t => (Int -> Bool) -> IndexedTraversal' Int (t a) a #

elementsOf :: Applicative f => LensLike (Indexing f) s t a a -> (Int -> Bool) -> IndexedLensLike Int f s t a a #

failing :: (Conjoined p, Applicative f) => Traversing p f s t a b -> Over p f s t a b -> Over p f s t a b #

failover :: Alternative m => LensLike ((,) Any) s t a b -> (a -> b) -> s -> m t #

forMOf :: LensLike (WrappedMonad m) s t a b -> s -> (a -> m b) -> m t #

forOf :: LensLike f s t a b -> s -> (a -> f b) -> f t #

holes1Of :: Conjoined p => Over p (Bazaar1 p a a) s t a a -> s -> NonEmpty (Pretext p a a t) #

holesOf :: Conjoined p => Over p (Bazaar p a a) s t a a -> s -> [Pretext p a a t] #

ifailover :: Alternative m => Over (Indexed i) ((,) Any) s t a b -> (i -> a -> b) -> s -> m t #

iforMOf :: (Indexed i a (WrappedMonad m b) -> s -> WrappedMonad m t) -> s -> (i -> a -> m b) -> m t #

iforOf :: (Indexed i a (f b) -> s -> f t) -> s -> (i -> a -> f b) -> f t #

ignored :: Applicative f => pafb -> s -> f s #

iloci :: IndexedTraversal i (Bazaar (Indexed i) a c s) (Bazaar (Indexed i) b c s) a b #

imapAccumLOf :: Over (Indexed i) (State acc) s t a b -> (i -> acc -> a -> (acc, b)) -> acc -> s -> (acc, t) #

imapAccumROf :: Over (Indexed i) (Backwards (State acc)) s t a b -> (i -> acc -> a -> (acc, b)) -> acc -> s -> (acc, t) #

imapMOf :: Over (Indexed i) (WrappedMonad m) s t a b -> (i -> a -> m b) -> s -> m t #

ipartsOf :: (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a a -> Over p f s t [a] [a] #

ipartsOf' :: (Indexable [i] p, Functor f) => Over (Indexed i) (Bazaar' (Indexed i) a) s t a a -> Over p f s t [a] [a] #

itraverseOf :: (Indexed i a (f b) -> s -> f t) -> (i -> a -> f b) -> s -> f t #

iunsafePartsOf :: (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a b -> Over p f s t [a] [b] #

iunsafePartsOf' :: Over (Indexed i) (Bazaar (Indexed i) a b) s t a b -> IndexedLens [i] s t [a] [b] #

loci :: Traversal (Bazaar ((->) :: Type -> Type -> Type) a c s) (Bazaar ((->) :: Type -> Type -> Type) b c s) a b #

mapAccumLOf :: LensLike (State acc) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t) #

mapAccumROf :: LensLike (Backwards (State acc)) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t) #

mapMOf :: LensLike (WrappedMonad m) s t a b -> (a -> m b) -> s -> m t #

partsOf :: Functor f => Traversing ((->) :: Type -> Type -> Type) f s t a a -> LensLike f s t [a] [a] #

partsOf' :: ATraversal s t a a -> Lens s t [a] [a] #

scanl1Of :: LensLike (State (Maybe a)) s t a a -> (a -> a -> a) -> s -> t #

scanr1Of :: LensLike (Backwards (State (Maybe a))) s t a a -> (a -> a -> a) -> s -> t #

sequenceAOf :: LensLike f s t (f b) b -> s -> f t #

sequenceByOf :: Traversal s t (f b) b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> s -> f t #

sequenceOf :: LensLike (WrappedMonad m) s t (m b) b -> s -> m t #

taking :: (Conjoined p, Applicative f) => Int -> Traversing p f s t a a -> Over p f s t a a #

transposeOf :: LensLike ZipList s t [a] a -> s -> [t] #

traverseByOf :: Traversal s t a b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (a -> f b) -> s -> f t #

traverseOf :: LensLike f s t a b -> (a -> f b) -> s -> f t #

traversed :: Traversable f => IndexedTraversal Int (f a) (f b) a b #

traversed1 :: Traversable1 f => IndexedTraversal1 Int (f a) (f b) a b #

traversed64 :: Traversable f => IndexedTraversal Int64 (f a) (f b) a b #

unsafePartsOf :: Functor f => Traversing ((->) :: Type -> Type -> Type) f s t a b -> LensLike f s t [a] [b] #

unsafePartsOf' :: ATraversal s t a b -> Lens s t [a] [b] #

unsafeSingular :: (HasCallStack, Conjoined p, Functor f) => Traversing p f s t a b -> Over p f s t a b #

_1' :: Field1 s t a b => Lens s t a b #

_10' :: Field10 s t a b => Lens s t a b #

_11' :: Field11 s t a b => Lens s t a b #

_12' :: Field12 s t a b => Lens s t a b #

_13' :: Field13 s t a b => Lens s t a b #

_14' :: Field14 s t a b => Lens s t a b #

_15' :: Field15 s t a b => Lens s t a b #

_16' :: Field16 s t a b => Lens s t a b #

_17' :: Field17 s t a b => Lens s t a b #

_18' :: Field18 s t a b => Lens s t a b #

_19' :: Field19 s t a b => Lens s t a b #

_2' :: Field2 s t a b => Lens s t a b #

_3' :: Field3 s t a b => Lens s t a b #

_4' :: Field4 s t a b => Lens s t a b #

_5' :: Field5 s t a b => Lens s t a b #

_6' :: Field6 s t a b => Lens s t a b #

_7' :: Field7 s t a b => Lens s t a b #

_8' :: Field8 s t a b => Lens s t a b #

_9' :: Field9 s t a b => Lens s t a b #

pattern Unwrapped :: forall t. Rewrapped t t => t -> Unwrapped t #

pattern Wrapped :: forall s. Rewrapped s s => Unwrapped s -> s #

_GWrapped' :: (Generic s, D1 d (C1 c (S1 s' (Rec0 a))) ~ Rep s, Unwrapped s ~ GUnwrapped (Rep s)) => Iso' s (Unwrapped s) #

_Unwrapped :: Rewrapping s t => Iso (Unwrapped t) (Unwrapped s) t s #

_Unwrapped' :: Wrapped s => Iso' (Unwrapped s) s #

_Unwrapping :: Rewrapping s t => (Unwrapped s -> s) -> Iso (Unwrapped t) (Unwrapped s) t s #

_Unwrapping' :: Wrapped s => (Unwrapped s -> s) -> Iso' (Unwrapped s) s #

_Wrapped :: Rewrapping s t => Iso s t (Unwrapped s) (Unwrapped t) #

_Wrapping :: Rewrapping s t => (Unwrapped s -> s) -> Iso s t (Unwrapped s) (Unwrapped t) #

_Wrapping' :: Wrapped s => (Unwrapped s -> s) -> Iso' s (Unwrapped s) #

ala :: (Functor f, Rewrapping s t) => (Unwrapped s -> s) -> ((Unwrapped t -> t) -> f s) -> f (Unwrapped s) #

alaf :: (Functor f, Functor g, Rewrapping s t) => (Unwrapped s -> s) -> (f t -> g s) -> f (Unwrapped t) -> g (Unwrapped s) #

op :: Wrapped s => (Unwrapped s -> s) -> s -> Unwrapped s #

foldBy :: Foldable t => (a -> a -> a) -> a -> t a -> a #

foldMapBy :: Foldable t => (r -> r -> r) -> r -> (a -> r) -> t a -> r #

sequenceBy :: Traversable t => (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> t (f a) -> f (t a) #

traverseBy :: Traversable t => (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (a -> f b) -> t a -> f (t b) #

data Active a #

Instances

Functor Active
Instance details Defined in Data.Active Methods fmap :: (a -> b) -> Active a -> Active b # (<$) :: a -> Active b -> Active a #
Applicative Active
Instance details Defined in Data.Active Methods pure :: a -> Active a # (<>) :: Active (a -> b) -> Active a -> Active b # liftA2 :: (a -> b -> c) -> Active a -> Active b -> Active c # (>) :: Active a -> Active b -> Active b # (<*) :: Active a -> Active b -> Active a #
Apply Active
Instance details Defined in Data.Active Methods (<.>) :: Active (a -> b) -> Active a -> Active b (.>) :: Active a -> Active b -> Active b (<.) :: Active a -> Active b -> Active a liftF2 :: (a -> b -> c) -> Active a -> Active b -> Active c
Semigroup a => Semigroup (Active a)
Instance details Defined in Data.Active Methods (<>) :: Active a -> Active a -> Active a # sconcat :: NonEmpty (Active a) -> Active a # stimes :: Integral b => b -> Active a -> Active a #
(Monoid a, Semigroup a) => Monoid (Active a)
Instance details Defined in Data.Active Methods mempty :: Active a # mappend :: Active a -> Active a -> Active a # mconcat :: [Active a] -> Active a #
Wrapped (Active a)
Instance details Defined in Data.Active Associated Types type Unwrapped (Active a) :: Type # Methods _Wrapped' :: Iso' (Active a) (Unwrapped (Active a)) #
Active a1 ~ t => Rewrapped (Active a2) t
Instance details Defined in Data.Active
type N (Active a)
Instance details Defined in Diagrams.Animation.Active type N (Active a) = N a
type V (Active a)
Instance details Defined in Diagrams.Animation.Active type V (Active a) = V a
type Unwrapped (Active a)
Instance details Defined in Data.Active type Unwrapped (Active a) = MaybeApply Dynamic a

data Duration n #

Instances

Functor Duration
Instance details Defined in Data.Active Methods fmap :: (a -> b) -> Duration a -> Duration b # (<$) :: a -> Duration b -> Duration a #
Applicative Duration
Instance details Defined in Data.Active Methods pure :: a -> Duration a # (<>) :: Duration (a -> b) -> Duration a -> Duration b # liftA2 :: (a -> b -> c) -> Duration a -> Duration b -> Duration c # (>) :: Duration a -> Duration b -> Duration b # (<*) :: Duration a -> Duration b -> Duration a #
Additive Duration
Instance details Defined in Data.Active Methods zero :: Num a => Duration a # (^+^) :: Num a => Duration a -> Duration a -> Duration a # (^-^) :: Num a => Duration a -> Duration a -> Duration a # lerp :: Num a => a -> Duration a -> Duration a -> Duration a # liftU2 :: (a -> a -> a) -> Duration a -> Duration a -> Duration a # liftI2 :: (a -> b -> c) -> Duration a -> Duration b -> Duration c #
Enum n => Enum (Duration n)
Instance details Defined in Data.Active Methods succ :: Duration n -> Duration n # pred :: Duration n -> Duration n # toEnum :: Int -> Duration n # fromEnum :: Duration n -> Int # enumFrom :: Duration n -> [Duration n] # enumFromThen :: Duration n -> Duration n -> [Duration n] # enumFromTo :: Duration n -> Duration n -> [Duration n] # enumFromThenTo :: Duration n -> Duration n -> Duration n -> [Duration n] #
Eq n => Eq (Duration n)
Instance details Defined in Data.Active Methods (==) :: Duration n -> Duration n -> Bool # (/=) :: Duration n -> Duration n -> Bool #
Fractional n => Fractional (Duration n)
Instance details Defined in Data.Active Methods (/) :: Duration n -> Duration n -> Duration n # recip :: Duration n -> Duration n # fromRational :: Rational -> Duration n #
Num n => Num (Duration n)
Instance details Defined in Data.Active Methods (+) :: Duration n -> Duration n -> Duration n # (-) :: Duration n -> Duration n -> Duration n # (*) :: Duration n -> Duration n -> Duration n # negate :: Duration n -> Duration n # abs :: Duration n -> Duration n # signum :: Duration n -> Duration n # fromInteger :: Integer -> Duration n #
Ord n => Ord (Duration n)
Instance details Defined in Data.Active Methods compare :: Duration n -> Duration n -> Ordering # (<) :: Duration n -> Duration n -> Bool # (<=) :: Duration n -> Duration n -> Bool # (>) :: Duration n -> Duration n -> Bool # (>=) :: Duration n -> Duration n -> Bool # max :: Duration n -> Duration n -> Duration n # min :: Duration n -> Duration n -> Duration n #
Read n => Read (Duration n)
Instance details Defined in Data.Active Methods readsPrec :: Int -> ReadS (Duration n) # readList :: ReadS [Duration n] # readPrec :: ReadPrec (Duration n) # readListPrec :: ReadPrec [Duration n] #
Real n => Real (Duration n)
Instance details Defined in Data.Active Methods toRational :: Duration n -> Rational #
RealFrac n => RealFrac (Duration n)
Instance details Defined in Data.Active Methods properFraction :: Integral b => Duration n -> (b, Duration n) # truncate :: Integral b => Duration n -> b # round :: Integral b => Duration n -> b # ceiling :: Integral b => Duration n -> b # floor :: Integral b => Duration n -> b #
Show n => Show (Duration n)
Instance details Defined in Data.Active Methods showsPrec :: Int -> Duration n -> ShowS # show :: Duration n -> String # showList :: [Duration n] -> ShowS #
Num n => Semigroup (Duration n)
Instance details Defined in Data.Active Methods (<>) :: Duration n -> Duration n -> Duration n # sconcat :: NonEmpty (Duration n) -> Duration n # stimes :: Integral b => b -> Duration n -> Duration n #
Num n => Monoid (Duration n)
Instance details Defined in Data.Active Methods mempty :: Duration n # mappend :: Duration n -> Duration n -> Duration n # mconcat :: [Duration n] -> Duration n #
Wrapped (Duration n)
Instance details Defined in Data.Active Associated Types type Unwrapped (Duration n) :: Type # Methods _Wrapped' :: Iso' (Duration n) (Unwrapped (Duration n)) #
Duration n1 ~ t => Rewrapped (Duration n2) t
Instance details Defined in Data.Active
type Unwrapped (Duration n)
Instance details Defined in Data.Active type Unwrapped (Duration n) = n

data Dynamic a #

Constructors

Dynamic
Fields era :: Era Rational runDynamic :: Time Rational -> a

Instances

Functor Dynamic
Instance details Defined in Data.Active Methods fmap :: (a -> b) -> Dynamic a -> Dynamic b # (<$) :: a -> Dynamic b -> Dynamic a #
Apply Dynamic
Instance details Defined in Data.Active Methods (<.>) :: Dynamic (a -> b) -> Dynamic a -> Dynamic b (.>) :: Dynamic a -> Dynamic b -> Dynamic b (<.) :: Dynamic a -> Dynamic b -> Dynamic a liftF2 :: (a -> b -> c) -> Dynamic a -> Dynamic b -> Dynamic c
Semigroup a => Semigroup (Dynamic a)
Instance details Defined in Data.Active Methods (<>) :: Dynamic a -> Dynamic a -> Dynamic a # sconcat :: NonEmpty (Dynamic a) -> Dynamic a # stimes :: Integral b => b -> Dynamic a -> Dynamic a #

data Era n #

Instances

Show n => Show (Era n)
Instance details Defined in Data.Active Methods showsPrec :: Int -> Era n -> ShowS # show :: Era n -> String # showList :: [Era n] -> ShowS #
Ord n => Semigroup (Era n)
Instance details Defined in Data.Active Methods (<>) :: Era n -> Era n -> Era n # sconcat :: NonEmpty (Era n) -> Era n # stimes :: Integral b => b -> Era n -> Era n #

data Time n #

Instances

Functor Time
Instance details Defined in Data.Active Methods fmap :: (a -> b) -> Time a -> Time b # (<$) :: a -> Time b -> Time a #
Affine Time
Instance details Defined in Data.Active Associated Types type Diff Time :: Type -> Type # Methods (.-.) :: Num a => Time a -> Time a -> Diff Time a # (.+^) :: Num a => Time a -> Diff Time a -> Time a # (.-^) :: Num a => Time a -> Diff Time a -> Time a #
Enum n => Enum (Time n)
Instance details Defined in Data.Active Methods succ :: Time n -> Time n # pred :: Time n -> Time n # toEnum :: Int -> Time n # fromEnum :: Time n -> Int # enumFrom :: Time n -> [Time n] # enumFromThen :: Time n -> Time n -> [Time n] # enumFromTo :: Time n -> Time n -> [Time n] # enumFromThenTo :: Time n -> Time n -> Time n -> [Time n] #
Eq n => Eq (Time n)
Instance details Defined in Data.Active Methods (==) :: Time n -> Time n -> Bool # (/=) :: Time n -> Time n -> Bool #
Fractional n => Fractional (Time n)
Instance details Defined in Data.Active Methods (/) :: Time n -> Time n -> Time n # recip :: Time n -> Time n # fromRational :: Rational -> Time n #
Num n => Num (Time n)
Instance details Defined in Data.Active Methods (+) :: Time n -> Time n -> Time n # (-) :: Time n -> Time n -> Time n # (*) :: Time n -> Time n -> Time n # negate :: Time n -> Time n # abs :: Time n -> Time n # signum :: Time n -> Time n # fromInteger :: Integer -> Time n #
Ord n => Ord (Time n)
Instance details Defined in Data.Active Methods compare :: Time n -> Time n -> Ordering # (<) :: Time n -> Time n -> Bool # (<=) :: Time n -> Time n -> Bool # (>) :: Time n -> Time n -> Bool # (>=) :: Time n -> Time n -> Bool # max :: Time n -> Time n -> Time n # min :: Time n -> Time n -> Time n #
Read n => Read (Time n)
Instance details Defined in Data.Active Methods readsPrec :: Int -> ReadS (Time n) # readList :: ReadS [Time n] # readPrec :: ReadPrec (Time n) # readListPrec :: ReadPrec [Time n] #
Real n => Real (Time n)
Instance details Defined in Data.Active Methods toRational :: Time n -> Rational #
RealFrac n => RealFrac (Time n)
Instance details Defined in Data.Active Methods properFraction :: Integral b => Time n -> (b, Time n) # truncate :: Integral b => Time n -> b # round :: Integral b => Time n -> b # ceiling :: Integral b => Time n -> b # floor :: Integral b => Time n -> b #
Show n => Show (Time n)
Instance details Defined in Data.Active Methods showsPrec :: Int -> Time n -> ShowS # show :: Time n -> String # showList :: [Time n] -> ShowS #
Wrapped (Time n)
Instance details Defined in Data.Active Associated Types type Unwrapped (Time n) :: Type # Methods _Wrapped' :: Iso' (Time n) (Unwrapped (Time n)) #
Time n1 ~ t => Rewrapped (Time n2) t
Instance details Defined in Data.Active
type Diff Time
Instance details Defined in Data.Active type Diff Time = Duration
type Unwrapped (Time n)
Instance details Defined in Data.Active type Unwrapped (Time n) = n

newtype Envelope (v :: Type -> Type) n #

Constructors

Envelope (Option (v n -> Max n))

Instances

Show (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope Methods showsPrec :: Int -> Envelope v n -> ShowS # show :: Envelope v n -> String # showList :: [Envelope v n] -> ShowS #
Ord n => Semigroup (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope Methods (<>) :: Envelope v n -> Envelope v n -> Envelope v n # sconcat :: NonEmpty (Envelope v n) -> Envelope v n # stimes :: Integral b => b -> Envelope v n -> Envelope v n #
Ord n => Monoid (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope Methods mempty :: Envelope v n # mappend :: Envelope v n -> Envelope v n -> Envelope v n # mconcat :: [Envelope v n] -> Envelope v n #
(Metric v, OrderedField n) => Enveloped (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope Methods getEnvelope :: Envelope v n -> Envelope (V (Envelope v n)) (N (Envelope v n)) #
(Metric v, Fractional n) => HasOrigin (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope Methods moveOriginTo :: Point (V (Envelope v n)) (N (Envelope v n)) -> Envelope v n -> Envelope v n #
(Metric v, OrderedField n) => Juxtaposable (Envelope v n)
Instance details Defined in Diagrams.Core.Juxtapose Methods juxtapose :: Vn (Envelope v n) -> Envelope v n -> Envelope v n -> Envelope v n #
(Metric v, Floating n) => Transformable (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope Methods transform :: Transformation (V (Envelope v n)) (N (Envelope v n)) -> Envelope v n -> Envelope v n #
(Metric v, OrderedField n) => Alignable (Envelope v n)
Instance details Defined in Diagrams.Align Methods alignBy' :: (InSpace v0 n0 (Envelope v n), Fractional n0, HasOrigin (Envelope v n)) => (v0 n0 -> Envelope v n -> Point v0 n0) -> v0 n0 -> n0 -> Envelope v n -> Envelope v n # defaultBoundary :: (V (Envelope v n) ~ v0, N (Envelope v n) ~ n0) => v0 n0 -> Envelope v n -> Point v0 n0 # alignBy :: (InSpace v0 n0 (Envelope v n), Fractional n0, HasOrigin (Envelope v n)) => v0 n0 -> n0 -> Envelope v n -> Envelope v n #
Wrapped (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope Associated Types type Unwrapped (Envelope v n) :: Type # Methods _Wrapped' :: Iso' (Envelope v n) (Unwrapped (Envelope v n)) #
Rewrapped (Envelope v n) (Envelope v' n')
Instance details Defined in Diagrams.Core.Envelope
type N (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope type N (Envelope v n) = n
type V (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope type V (Envelope v n) = v
type Unwrapped (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope type Unwrapped (Envelope v n) = Option (v n -> Max n)

class (Metric (V a), OrderedField (N a)) => Enveloped a where #

Methods

getEnvelope :: a -> Envelope (V a) (N a) #

Instances

Enveloped b => Enveloped [b]
Instance details Defined in Diagrams.Core.Envelope Methods getEnvelope :: [b] -> Envelope (V [b]) (N [b]) #
Enveloped b => Enveloped (Set b)
Instance details Defined in Diagrams.Core.Envelope Methods getEnvelope :: Set b -> Envelope (V (Set b)) (N (Set b)) #
Enveloped t => Enveloped (TransInv t)
Instance details Defined in Diagrams.Core.Envelope Methods getEnvelope :: TransInv t -> Envelope (V (TransInv t)) (N (TransInv t)) #
Enveloped a => Enveloped (Located a)
Instance details Defined in Diagrams.Located Methods getEnvelope :: Located a -> Envelope (V (Located a)) (N (Located a)) #
OrderedField n => Enveloped (Box n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getEnvelope :: Box n -> Envelope (V (Box n)) (N (Box n)) #
RealFloat n => Enveloped (CSG n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getEnvelope :: CSG n -> Envelope (V (CSG n)) (N (CSG n)) #
OrderedField n => Enveloped (Ellipsoid n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getEnvelope :: Ellipsoid n -> Envelope (V (Ellipsoid n)) (N (Ellipsoid n)) #
(OrderedField n, RealFloat n) => Enveloped (Frustum n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getEnvelope :: Frustum n -> Envelope (V (Frustum n)) (N (Frustum n)) #
(Enveloped a, Enveloped b, V a ~ V b, N a ~ N b) => Enveloped (a, b)
Instance details Defined in Diagrams.Core.Envelope Methods getEnvelope :: (a, b) -> Envelope (V (a, b)) (N (a, b)) #
Enveloped b => Enveloped (Map k b)
Instance details Defined in Diagrams.Core.Envelope Methods getEnvelope :: Map k b -> Envelope (V (Map k b)) (N (Map k b)) #
(Metric v, OrderedField n) => Enveloped (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope Methods getEnvelope :: Envelope v n -> Envelope (V (Envelope v n)) (N (Envelope v n)) #
(Metric v, Traversable v, OrderedField n) => Enveloped (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox Methods getEnvelope :: BoundingBox v n -> Envelope (V (BoundingBox v n)) (N (BoundingBox v n)) #
(Metric v, OrderedField n) => Enveloped (Path v n)
Instance details Defined in Diagrams.Path Methods getEnvelope :: Path v n -> Envelope (V (Path v n)) (N (Path v n)) #
(Metric v, OrderedField n) => Enveloped (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods getEnvelope :: FixedSegment v n -> Envelope (V (FixedSegment v n)) (N (FixedSegment v n)) #
(Metric v, OrderedField n) => Enveloped (Trail v n)
Instance details Defined in Diagrams.Trail Methods getEnvelope :: Trail v n -> Envelope (V (Trail v n)) (N (Trail v n)) #
(OrderedField n, Metric v) => Enveloped (Point v n)
Instance details Defined in Diagrams.Core.Envelope Methods getEnvelope :: Point v n -> Envelope (V (Point v n)) (N (Point v n)) #
(Metric v, OrderedField n) => Enveloped (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods getEnvelope :: Segment Closed v n -> Envelope (V (Segment Closed v n)) (N (Segment Closed v n)) #
(Metric v, OrderedField n) => Enveloped (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods getEnvelope :: Trail' l v n -> Envelope (V (Trail' l v n)) (N (Trail' l v n)) #
(Metric v, OrderedField n, Monoid' m) => Enveloped (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods getEnvelope :: QDiagram b v n m -> Envelope (V (QDiagram b v n m)) (N (QDiagram b v n m)) #
(OrderedField n, Metric v, Monoid' m) => Enveloped (Subdiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods getEnvelope :: Subdiagram b v n m -> Envelope (V (Subdiagram b v n m)) (N (Subdiagram b v n m)) #

type OrderedField s = (Floating s, Ord s) #

class HasOrigin t where #

Methods

moveOriginTo :: Point (V t) (N t) -> t -> t #

Instances

HasOrigin t => HasOrigin [t]
Instance details Defined in Diagrams.Core.HasOrigin Methods moveOriginTo :: Point (V [t]) (N [t]) -> [t] -> [t] #
(HasOrigin t, Ord t) => HasOrigin (Set t)
Instance details Defined in Diagrams.Core.HasOrigin Methods moveOriginTo :: Point (V (Set t)) (N (Set t)) -> Set t -> Set t #
HasOrigin (TransInv t)
Instance details Defined in Diagrams.Core.Transform Methods moveOriginTo :: Point (V (TransInv t)) (N (TransInv t)) -> TransInv t -> TransInv t #
(Num (N a), Additive (V a)) => HasOrigin (Located a)
Instance details Defined in Diagrams.Located Methods moveOriginTo :: Point (V (Located a)) (N (Located a)) -> Located a -> Located a #
Floating n => HasOrigin (Text n)
Instance details Defined in Diagrams.TwoD.Text Methods moveOriginTo :: Point (V (Text n)) (N (Text n)) -> Text n -> Text n #
(HasOrigin t, HasOrigin s, SameSpace s t) => HasOrigin (s, t)
Instance details Defined in Diagrams.Core.HasOrigin Methods moveOriginTo :: Point (V (s, t)) (N (s, t)) -> (s, t) -> (s, t) #
HasOrigin t => HasOrigin (Map k t)
Instance details Defined in Diagrams.Core.HasOrigin Methods moveOriginTo :: Point (V (Map k t)) (N (Map k t)) -> Map k t -> Map k t #
(Metric v, Fractional n) => HasOrigin (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope Methods moveOriginTo :: Point (V (Envelope v n)) (N (Envelope v n)) -> Envelope v n -> Envelope v n #
HasOrigin t => HasOrigin (Measured n t)
Instance details Defined in Diagrams.Core.HasOrigin Methods moveOriginTo :: Point (V (Measured n t)) (N (Measured n t)) -> Measured n t -> Measured n t #
(Additive v, Num n) => HasOrigin (Trace v n)
Instance details Defined in Diagrams.Core.Trace Methods moveOriginTo :: Point (V (Trace v n)) (N (Trace v n)) -> Trace v n -> Trace v n #
(Additive v, Num n) => HasOrigin (Transformation v n)
Instance details Defined in Diagrams.Core.Transform Methods moveOriginTo :: Point (V (Transformation v n)) (N (Transformation v n)) -> Transformation v n -> Transformation v n #
(Additive v, Num n) => HasOrigin (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox Methods moveOriginTo :: Point (V (BoundingBox v n)) (N (BoundingBox v n)) -> BoundingBox v n -> BoundingBox v n #
(Additive v, Num n) => HasOrigin (Path v n)
Instance details Defined in Diagrams.Path Methods moveOriginTo :: Point (V (Path v n)) (N (Path v n)) -> Path v n -> Path v n #
(Additive v, Num n) => HasOrigin (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods moveOriginTo :: Point (V (FixedSegment v n)) (N (FixedSegment v n)) -> FixedSegment v n -> FixedSegment v n #
Fractional n => HasOrigin (DImage n a)
Instance details Defined in Diagrams.TwoD.Image Methods moveOriginTo :: Point (V (DImage n a)) (N (DImage n a)) -> DImage n a -> DImage n a #
(Additive v, Num n) => HasOrigin (Point v n)
Instance details Defined in Diagrams.Core.HasOrigin Methods moveOriginTo :: Point (V (Point v n)) (N (Point v n)) -> Point v n -> Point v n #
(Additive v, Num n) => HasOrigin (Query v n m)
Instance details Defined in Diagrams.Core.Query Methods moveOriginTo :: Point (V (Query v n m)) (N (Query v n m)) -> Query v n m -> Query v n m #
(Metric v, OrderedField n, Semigroup m) => HasOrigin (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods moveOriginTo :: Point (V (QDiagram b v n m)) (N (QDiagram b v n m)) -> QDiagram b v n m -> QDiagram b v n m #
(OrderedField n, Metric v) => HasOrigin (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types Methods moveOriginTo :: Point (V (SubMap b v n m)) (N (SubMap b v n m)) -> SubMap b v n m -> SubMap b v n m #
(Metric v, OrderedField n) => HasOrigin (Subdiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods moveOriginTo :: Point (V (Subdiagram b v n m)) (N (Subdiagram b v n m)) -> Subdiagram b v n m -> Subdiagram b v n m #

class Juxtaposable a where #

Methods

juxtapose :: Vn a -> a -> a -> a #

Instances

(Enveloped b, HasOrigin b) => Juxtaposable [b]
Instance details Defined in Diagrams.Core.Juxtapose Methods juxtapose :: Vn [b] -> [b] -> [b] -> [b] #
(Enveloped b, HasOrigin b, Ord b) => Juxtaposable (Set b)
Instance details Defined in Diagrams.Core.Juxtapose Methods juxtapose :: Vn (Set b) -> Set b -> Set b -> Set b #
Enveloped a => Juxtaposable (Located a)
Instance details Defined in Diagrams.Located Methods juxtapose :: Vn (Located a) -> Located a -> Located a -> Located a #
Juxtaposable a => Juxtaposable (b -> a)
Instance details Defined in Diagrams.Core.Juxtapose Methods juxtapose :: Vn (b -> a) -> (b -> a) -> (b -> a) -> b -> a #
(Enveloped a, HasOrigin a, Enveloped b, HasOrigin b, V a ~ V b, N a ~ N b) => Juxtaposable (a, b)
Instance details Defined in Diagrams.Core.Juxtapose Methods juxtapose :: Vn (a, b) -> (a, b) -> (a, b) -> (a, b) #
(Enveloped b, HasOrigin b) => Juxtaposable (Map k b)
Instance details Defined in Diagrams.Core.Juxtapose Methods juxtapose :: Vn (Map k b) -> Map k b -> Map k b -> Map k b #
(Metric v, OrderedField n) => Juxtaposable (Envelope v n)
Instance details Defined in Diagrams.Core.Juxtapose Methods juxtapose :: Vn (Envelope v n) -> Envelope v n -> Envelope v n -> Envelope v n #
Juxtaposable a => Juxtaposable (Measured n a)
Instance details Defined in Diagrams.Core.Juxtapose Methods juxtapose :: Vn (Measured n a) -> Measured n a -> Measured n a -> Measured n a #
(Metric v, OrderedField n) => Juxtaposable (Path v n)
Instance details Defined in Diagrams.Path Methods juxtapose :: Vn (Path v n) -> Path v n -> Path v n -> Path v n #
(Metric v, OrderedField n, Monoid' m) => Juxtaposable (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods juxtapose :: Vn (QDiagram b v n m) -> QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m #

type Measure n = Measured n n #

data Measured n a #

Instances

Profunctor Measured
Instance details Defined in Diagrams.Core.Measure Methods dimap :: (a -> b) -> (c -> d) -> Measured b c -> Measured a d # lmap :: (a -> b) -> Measured b c -> Measured a c # rmap :: (b -> c) -> Measured a b -> Measured a c # (#.) :: Coercible c b => q b c -> Measured a b -> Measured a c (.#) :: Coercible b a => Measured b c -> q a b -> Measured a c
Monad (Measured n)
Instance details Defined in Diagrams.Core.Measure Methods (>>=) :: Measured n a -> (a -> Measured n b) -> Measured n b # (>>) :: Measured n a -> Measured n b -> Measured n b # return :: a -> Measured n a # fail :: String -> Measured n a #
Functor (Measured n)
Instance details Defined in Diagrams.Core.Measure Methods fmap :: (a -> b) -> Measured n a -> Measured n b # (<$) :: a -> Measured n b -> Measured n a #
Applicative (Measured n)
Instance details Defined in Diagrams.Core.Measure Methods pure :: a -> Measured n a # (<>) :: Measured n (a -> b) -> Measured n a -> Measured n b # liftA2 :: (a -> b -> c) -> Measured n a -> Measured n b -> Measured n c # (>) :: Measured n a -> Measured n b -> Measured n b # (<*) :: Measured n a -> Measured n b -> Measured n a #
Num n => Default (FontSizeM n)
Instance details Defined in Diagrams.TwoD.Text Methods def :: FontSizeM n #
OrderedField n => Default (LineWidthM n)
Instance details Defined in Diagrams.Attributes Methods def :: LineWidthM n #
Additive (Measured n)
Instance details Defined in Diagrams.Core.Measure Methods zero :: Num a => Measured n a # (^+^) :: Num a => Measured n a -> Measured n a -> Measured n a # (^-^) :: Num a => Measured n a -> Measured n a -> Measured n a # lerp :: Num a => a -> Measured n a -> Measured n a -> Measured n a # liftU2 :: (a -> a -> a) -> Measured n a -> Measured n a -> Measured n a # liftI2 :: (a -> b -> c) -> Measured n a -> Measured n b -> Measured n c #
Representable (Measured n)
Instance details Defined in Diagrams.Core.Measure Associated Types type Rep (Measured n) :: Type Methods tabulate :: (Rep (Measured n) -> a) -> Measured n a index :: Measured n a -> Rep (Measured n) -> a
Distributive (Measured n)
Instance details Defined in Diagrams.Core.Measure Methods distribute :: Functor f => f (Measured n a) -> Measured n (f a) collect :: Functor f => (a -> Measured n b) -> f a -> Measured n (f b) distributeM :: Monad m => m (Measured n a) -> Measured n (m a) collectM :: Monad m => (a -> Measured n b) -> m a -> Measured n (m b)
Floating a => Floating (Measured n a)
Instance details Defined in Diagrams.Core.Measure Methods pi :: Measured n a # exp :: Measured n a -> Measured n a # log :: Measured n a -> Measured n a # sqrt :: Measured n a -> Measured n a # (**) :: Measured n a -> Measured n a -> Measured n a # logBase :: Measured n a -> Measured n a -> Measured n a # sin :: Measured n a -> Measured n a # cos :: Measured n a -> Measured n a # tan :: Measured n a -> Measured n a # asin :: Measured n a -> Measured n a # acos :: Measured n a -> Measured n a # atan :: Measured n a -> Measured n a # sinh :: Measured n a -> Measured n a # cosh :: Measured n a -> Measured n a # tanh :: Measured n a -> Measured n a # asinh :: Measured n a -> Measured n a # acosh :: Measured n a -> Measured n a # atanh :: Measured n a -> Measured n a # log1p :: Measured n a -> Measured n a # expm1 :: Measured n a -> Measured n a # log1pexp :: Measured n a -> Measured n a # log1mexp :: Measured n a -> Measured n a #
Fractional a => Fractional (Measured n a)
Instance details Defined in Diagrams.Core.Measure Methods (/) :: Measured n a -> Measured n a -> Measured n a # recip :: Measured n a -> Measured n a # fromRational :: Rational -> Measured n a #
Num a => Num (Measured n a)
Instance details Defined in Diagrams.Core.Measure Methods (+) :: Measured n a -> Measured n a -> Measured n a # (-) :: Measured n a -> Measured n a -> Measured n a # (*) :: Measured n a -> Measured n a -> Measured n a # negate :: Measured n a -> Measured n a # abs :: Measured n a -> Measured n a # signum :: Measured n a -> Measured n a # fromInteger :: Integer -> Measured n a #
Semigroup a => Semigroup (Measured n a)
Instance details Defined in Diagrams.Core.Measure Methods (<>) :: Measured n a -> Measured n a -> Measured n a # sconcat :: NonEmpty (Measured n a) -> Measured n a # stimes :: Integral b => b -> Measured n a -> Measured n a #
Monoid a => Monoid (Measured n a)
Instance details Defined in Diagrams.Core.Measure Methods mempty :: Measured n a # mappend :: Measured n a -> Measured n a -> Measured n a # mconcat :: [Measured n a] -> Measured n a #
HasOrigin t => HasOrigin (Measured n t)
Instance details Defined in Diagrams.Core.HasOrigin Methods moveOriginTo :: Point (V (Measured n t)) (N (Measured n t)) -> Measured n t -> Measured n t #
Juxtaposable a => Juxtaposable (Measured n a)
Instance details Defined in Diagrams.Core.Juxtapose Methods juxtapose :: Vn (Measured n a) -> Measured n a -> Measured n a -> Measured n a #
Qualifiable a => Qualifiable (Measured n a)
Instance details Defined in Diagrams.Core.Names Methods (.>>) :: IsName a0 => a0 -> Measured n a -> Measured n a #
HasStyle b => HasStyle (Measured n b)
Instance details Defined in Diagrams.Core.Style Methods applyStyle :: Style (V (Measured n b)) (N (Measured n b)) -> Measured n b -> Measured n b #
(InSpace v n t, Transformable t, HasLinearMap v, Floating n) => Transformable (Measured n t)
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V (Measured n t)) (N (Measured n t)) -> Measured n t -> Measured n t #
MonadReader (n, n, n) (Measured n)
Instance details Defined in Diagrams.Core.Measure Methods ask :: Measured n (n, n, n) # local :: ((n, n, n) -> (n, n, n)) -> Measured n a -> Measured n a # reader :: ((n, n, n) -> a) -> Measured n a #
type Rep (Measured n)
Instance details Defined in Diagrams.Core.Measure type Rep (Measured n) = (n, n, n)
type N (Measured n a)
Instance details Defined in Diagrams.Core.Measure type N (Measured n a) = N a
type V (Measured n a)
Instance details Defined in Diagrams.Core.Measure type V (Measured n a) = V a

data AName #

Instances

Eq AName
Instance details Defined in Diagrams.Core.Names Methods (==) :: AName -> AName -> Bool # (/=) :: AName -> AName -> Bool #
Ord AName
Instance details Defined in Diagrams.Core.Names Methods compare :: AName -> AName -> Ordering # (<) :: AName -> AName -> Bool # (<=) :: AName -> AName -> Bool # (>) :: AName -> AName -> Bool # (>=) :: AName -> AName -> Bool # max :: AName -> AName -> AName # min :: AName -> AName -> AName #
Show AName
Instance details Defined in Diagrams.Core.Names Methods showsPrec :: Int -> AName -> ShowS # show :: AName -> String # showList :: [AName] -> ShowS #
IsName AName
Instance details Defined in Diagrams.Core.Names Methods toName :: AName -> Name #
Each Name Name AName AName
Instance details Defined in Diagrams.Core.Names Methods each :: Traversal Name Name AName AName #

class (Typeable a, Ord a, Show a) => IsName a where #

Minimal complete definition

Nothing

Methods

toName :: a -> Name #

Instances

IsName Bool
Instance details Defined in Diagrams.Core.Names Methods toName :: Bool -> Name #
IsName Char
Instance details Defined in Diagrams.Core.Names Methods toName :: Char -> Name #
IsName Double
Instance details Defined in Diagrams.Core.Names Methods toName :: Double -> Name #
IsName Float
Instance details Defined in Diagrams.Core.Names Methods toName :: Float -> Name #
IsName Int
Instance details Defined in Diagrams.Core.Names Methods toName :: Int -> Name #
IsName Integer
Instance details Defined in Diagrams.Core.Names Methods toName :: Integer -> Name #
IsName ()
Instance details Defined in Diagrams.Core.Names Methods toName :: () -> Name #
IsName AName
Instance details Defined in Diagrams.Core.Names Methods toName :: AName -> Name #
IsName Name
Instance details Defined in Diagrams.Core.Names Methods toName :: Name -> Name #
IsName a => IsName [a]
Instance details Defined in Diagrams.Core.Names Methods toName :: [a] -> Name #
IsName a => IsName (Maybe a)
Instance details Defined in Diagrams.Core.Names Methods toName :: Maybe a -> Name #
(IsName a, IsName b) => IsName (a, b)
Instance details Defined in Diagrams.Core.Names Methods toName :: (a, b) -> Name #
(IsName a, IsName b, IsName c) => IsName (a, b, c)
Instance details Defined in Diagrams.Core.Names Methods toName :: (a, b, c) -> Name #

data Name #

Instances

Eq Name
Instance details Defined in Diagrams.Core.Names Methods (==) :: Name -> Name -> Bool # (/=) :: Name -> Name -> Bool #
Ord Name
Instance details Defined in Diagrams.Core.Names Methods compare :: Name -> Name -> Ordering # (<) :: Name -> Name -> Bool # (<=) :: Name -> Name -> Bool # (>) :: Name -> Name -> Bool # (>=) :: Name -> Name -> Bool # max :: Name -> Name -> Name # min :: Name -> Name -> Name #
Show Name
Instance details Defined in Diagrams.Core.Names Methods showsPrec :: Int -> Name -> ShowS # show :: Name -> String # showList :: [Name] -> ShowS #
Semigroup Name
Instance details Defined in Diagrams.Core.Names Methods (<>) :: Name -> Name -> Name # sconcat :: NonEmpty Name -> Name # stimes :: Integral b => b -> Name -> Name #
Monoid Name
Instance details Defined in Diagrams.Core.Names Methods mempty :: Name # mappend :: Name -> Name -> Name # mconcat :: [Name] -> Name #
IsName Name
Instance details Defined in Diagrams.Core.Names Methods toName :: Name -> Name #
Qualifiable Name
Instance details Defined in Diagrams.Core.Names Methods (.>>) :: IsName a => a -> Name -> Name #
Wrapped Name
Instance details Defined in Diagrams.Core.Names Associated Types type Unwrapped Name :: Type # Methods _Wrapped' :: Iso' Name (Unwrapped Name) #
Rewrapped Name Name
Instance details Defined in Diagrams.Core.Names
Each Name Name AName AName
Instance details Defined in Diagrams.Core.Names Methods each :: Traversal Name Name AName AName #
Action Name (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types Methods act :: Name -> SubMap b v n m -> SubMap b v n m
type Unwrapped Name
Instance details Defined in Diagrams.Core.Names type Unwrapped Name = [AName]

class Qualifiable q where #

Methods

(.>>) :: IsName a => a -> q -> q #

Instances

Qualifiable Name
Instance details Defined in Diagrams.Core.Names Methods (.>>) :: IsName a => a -> Name -> Name #
Qualifiable a => Qualifiable [a]
Instance details Defined in Diagrams.Core.Names Methods (.>>) :: IsName a0 => a0 -> [a] -> [a] #
(Ord a, Qualifiable a) => Qualifiable (Set a)
Instance details Defined in Diagrams.Core.Names Methods (.>>) :: IsName a0 => a0 -> Set a -> Set a #
Qualifiable a => Qualifiable (TransInv a)
Instance details Defined in Diagrams.Core.Names Methods (.>>) :: IsName a0 => a0 -> TransInv a -> TransInv a #
Qualifiable a => Qualifiable (Located a)
Instance details Defined in Diagrams.Located Methods (.>>) :: IsName a0 => a0 -> Located a -> Located a #
Qualifiable a => Qualifiable (b -> a)
Instance details Defined in Diagrams.Core.Names Methods (.>>) :: IsName a0 => a0 -> (b -> a) -> b -> a #
(Qualifiable a, Qualifiable b) => Qualifiable (a, b)
Instance details Defined in Diagrams.Core.Names Methods (.>>) :: IsName a0 => a0 -> (a, b) -> (a, b) #
Qualifiable a => Qualifiable (Map k a)
Instance details Defined in Diagrams.Core.Names Methods (.>>) :: IsName a0 => a0 -> Map k a -> Map k a #
Qualifiable a => Qualifiable (Measured n a)
Instance details Defined in Diagrams.Core.Names Methods (.>>) :: IsName a0 => a0 -> Measured n a -> Measured n a #
(Qualifiable a, Qualifiable b, Qualifiable c) => Qualifiable (a, b, c)
Instance details Defined in Diagrams.Core.Names Methods (.>>) :: IsName a0 => a0 -> (a, b, c) -> (a, b, c) #
(Metric v, OrderedField n, Semigroup m) => Qualifiable (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods (.>>) :: IsName a => a -> QDiagram b v n m -> QDiagram b v n m #
Qualifiable (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types Methods (.>>) :: IsName a => a -> SubMap b v n m -> SubMap b v n m #

newtype Query (v :: Type -> Type) n m #

Constructors

Query
Fields runQuery :: Point v n -> m

Instances

Functor v => Profunctor (Query v)
Instance details Defined in Diagrams.Core.Query Methods dimap :: (a -> b) -> (c -> d) -> Query v b c -> Query v a d # lmap :: (a -> b) -> Query v b c -> Query v a c # rmap :: (b -> c) -> Query v a b -> Query v a c # (#.) :: Coercible c b => q b c -> Query v a b -> Query v a c (.#) :: Coercible b a => Query v b c -> q a b -> Query v a c
Functor v => Closed (Query v)
Instance details Defined in Diagrams.Core.Query Methods closed :: Query v a b -> Query v (x -> a) (x -> b)
Functor v => Corepresentable (Query v)
Instance details Defined in Diagrams.Core.Query Associated Types type Corep (Query v) :: Type -> Type Methods cotabulate :: (Corep (Query v) d -> c) -> Query v d c
Functor v => Costrong (Query v)
Instance details Defined in Diagrams.Core.Query Methods unfirst :: Query v (a, d) (b, d) -> Query v a b unsecond :: Query v (d, a) (d, b) -> Query v a b
Functor v => Cosieve (Query v) (Point v)
Instance details Defined in Diagrams.Core.Query Methods cosieve :: Query v a b -> Point v a -> b
Monad (Query v n)
Instance details Defined in Diagrams.Core.Query Methods (>>=) :: Query v n a -> (a -> Query v n b) -> Query v n b # (>>) :: Query v n a -> Query v n b -> Query v n b # return :: a -> Query v n a # fail :: String -> Query v n a #
Functor (Query v n)
Instance details Defined in Diagrams.Core.Query Methods fmap :: (a -> b) -> Query v n a -> Query v n b # (<$) :: a -> Query v n b -> Query v n a #
Applicative (Query v n)
Instance details Defined in Diagrams.Core.Query Methods pure :: a -> Query v n a # (<>) :: Query v n (a -> b) -> Query v n a -> Query v n b # liftA2 :: (a -> b -> c) -> Query v n a -> Query v n b -> Query v n c # (>) :: Query v n a -> Query v n b -> Query v n b # (<*) :: Query v n a -> Query v n b -> Query v n a #
Representable (Query v n)
Instance details Defined in Diagrams.Core.Query Associated Types type Rep (Query v n) :: Type Methods tabulate :: (Rep (Query v n) -> a) -> Query v n a index :: Query v n a -> Rep (Query v n) -> a
Distributive (Query v n)
Instance details Defined in Diagrams.Core.Query Methods distribute :: Functor f => f (Query v n a) -> Query v n (f a) collect :: Functor f => (a -> Query v n b) -> f a -> Query v n (f b) distributeM :: Monad m => m (Query v n a) -> Query v n (m a) collectM :: Monad m => (a -> Query v n b) -> m a -> Query v n (m b)
Semigroup m => Semigroup (Query v n m)
Instance details Defined in Diagrams.Core.Query Methods (<>) :: Query v n m -> Query v n m -> Query v n m # sconcat :: NonEmpty (Query v n m) -> Query v n m # stimes :: Integral b => b -> Query v n m -> Query v n m #
Monoid m => Monoid (Query v n m)
Instance details Defined in Diagrams.Core.Query Methods mempty :: Query v n m # mappend :: Query v n m -> Query v n m -> Query v n m # mconcat :: [Query v n m] -> Query v n m #
(Additive v, Num n) => HasOrigin (Query v n m)
Instance details Defined in Diagrams.Core.Query Methods moveOriginTo :: Point (V (Query v n m)) (N (Query v n m)) -> Query v n m -> Query v n m #
(Additive v, Num n) => Transformable (Query v n m)
Instance details Defined in Diagrams.Core.Query Methods transform :: Transformation (V (Query v n m)) (N (Query v n m)) -> Query v n m -> Query v n m #
Wrapped (Query v n m)
Instance details Defined in Diagrams.Core.Query Associated Types type Unwrapped (Query v n m) :: Type # Methods _Wrapped' :: Iso' (Query v n m) (Unwrapped (Query v n m)) #
HasQuery (Query v n m) m
Instance details Defined in Diagrams.Query Methods getQuery :: Query v n m -> Query (V (Query v n m)) (N (Query v n m)) m #
Rewrapped (Query v a m) (Query v' a' m')
Instance details Defined in Diagrams.Core.Query
type Corep (Query v)
Instance details Defined in Diagrams.Core.Query type Corep (Query v) = Point v
type Rep (Query v n)
Instance details Defined in Diagrams.Core.Query type Rep (Query v n) = Point v n
type N (Query v n m)
Instance details Defined in Diagrams.Core.Query type N (Query v n m) = n
type V (Query v n m)
Instance details Defined in Diagrams.Core.Query type V (Query v n m) = v
type Unwrapped (Query v n m)
Instance details Defined in Diagrams.Core.Query type Unwrapped (Query v n m) = Point v n -> m

data Attribute (v :: Type -> Type) n where #

Constructors

Attribute :: forall (v :: Type -> Type) n a. AttributeClass a => a -> Attribute v n
MAttribute :: forall (v :: Type -> Type) n a. AttributeClass a => Measured n a -> Attribute v n
TAttribute :: forall (v :: Type -> Type) n a. (AttributeClass a, Transformable a, V a ~ v, N a ~ n) => a -> Attribute v n

Instances

Show (Attribute v n)
Instance details Defined in Diagrams.Core.Style Methods showsPrec :: Int -> Attribute v n -> ShowS # show :: Attribute v n -> String # showList :: [Attribute v n] -> ShowS #
Typeable n => Semigroup (Attribute v n)
Instance details Defined in Diagrams.Core.Style Methods (<>) :: Attribute v n -> Attribute v n -> Attribute v n # sconcat :: NonEmpty (Attribute v n) -> Attribute v n # stimes :: Integral b => b -> Attribute v n -> Attribute v n #
(Additive v, Traversable v, Floating n) => Transformable (Attribute v n)
Instance details Defined in Diagrams.Core.Style Methods transform :: Transformation (V (Attribute v n)) (N (Attribute v n)) -> Attribute v n -> Attribute v n #
Each (Style v n) (Style v' n') (Attribute v n) (Attribute v' n')
Instance details Defined in Diagrams.Core.Style Methods each :: Traversal (Style v n) (Style v' n') (Attribute v n) (Attribute v' n') #
type N (Attribute v n)
Instance details Defined in Diagrams.Core.Style type N (Attribute v n) = n
type V (Attribute v n)
Instance details Defined in Diagrams.Core.Style type V (Attribute v n) = v

class (Typeable a, Semigroup a) => AttributeClass a #

Instances

AttributeClass FillOpacity
Instance details Defined in Diagrams.Attributes
AttributeClass LineCap
Instance details Defined in Diagrams.Attributes
AttributeClass LineJoin
Instance details Defined in Diagrams.Attributes
AttributeClass LineMiterLimit
Instance details Defined in Diagrams.Attributes
AttributeClass Opacity
Instance details Defined in Diagrams.Attributes
AttributeClass StrokeOpacity
Instance details Defined in Diagrams.Attributes
AttributeClass Ambient
Instance details Defined in Diagrams.ThreeD.Attributes
AttributeClass Diffuse
Instance details Defined in Diagrams.ThreeD.Attributes
AttributeClass Highlight
Instance details Defined in Diagrams.ThreeD.Attributes
AttributeClass SurfaceColor
Instance details Defined in Diagrams.ThreeD.Attributes
AttributeClass FillRule
Instance details Defined in Diagrams.TwoD.Path
AttributeClass Font
Instance details Defined in Diagrams.TwoD.Text
AttributeClass FontSlant
Instance details Defined in Diagrams.TwoD.Text
AttributeClass FontWeight
Instance details Defined in Diagrams.TwoD.Text
Typeable n => AttributeClass (Dashing n)
Instance details Defined in Diagrams.Attributes
Typeable n => AttributeClass (LineWidth n)
Instance details Defined in Diagrams.Attributes
Typeable n => AttributeClass (Clip n)
Instance details Defined in Diagrams.TwoD.Path
Typeable n => AttributeClass (FillTexture n)
Instance details Defined in Diagrams.TwoD.Attributes
Typeable n => AttributeClass (LineTexture n)
Instance details Defined in Diagrams.TwoD.Attributes
Typeable n => AttributeClass (FontSize n)
Instance details Defined in Diagrams.TwoD.Text

class HasStyle a where #

Methods

applyStyle :: Style (V a) (N a) -> a -> a #

Instances

HasStyle a => HasStyle [a]
Instance details Defined in Diagrams.Core.Style Methods applyStyle :: Style (V [a]) (N [a]) -> [a] -> [a] #
(HasStyle a, Ord a) => HasStyle (Set a)
Instance details Defined in Diagrams.Core.Style Methods applyStyle :: Style (V (Set a)) (N (Set a)) -> Set a -> Set a #
HasStyle b => HasStyle (a -> b)
Instance details Defined in Diagrams.Core.Style Methods applyStyle :: Style (V (a -> b)) (N (a -> b)) -> (a -> b) -> a -> b #
(HasStyle a, HasStyle b, V a ~ V b, N a ~ N b) => HasStyle (a, b)
Instance details Defined in Diagrams.Core.Style Methods applyStyle :: Style (V (a, b)) (N (a, b)) -> (a, b) -> (a, b) #
HasStyle a => HasStyle (Map k a)
Instance details Defined in Diagrams.Core.Style Methods applyStyle :: Style (V (Map k a)) (N (Map k a)) -> Map k a -> Map k a #
HasStyle b => HasStyle (Measured n b)
Instance details Defined in Diagrams.Core.Style Methods applyStyle :: Style (V (Measured n b)) (N (Measured n b)) -> Measured n b -> Measured n b #
Typeable n => HasStyle (Style v n)
Instance details Defined in Diagrams.Core.Style Methods applyStyle :: Style (V (Style v n)) (N (Style v n)) -> Style v n -> Style v n #
(Metric v, OrderedField n, Semigroup m) => HasStyle (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods applyStyle :: Style (V (QDiagram b v n m)) (N (QDiagram b v n m)) -> QDiagram b v n m -> QDiagram b v n m #

data Style (v :: Type -> Type) n #

Instances

Show (Style v n)
Instance details Defined in Diagrams.Core.Style Methods showsPrec :: Int -> Style v n -> ShowS # show :: Style v n -> String # showList :: [Style v n] -> ShowS #
Typeable n => Semigroup (Style v n)
Instance details Defined in Diagrams.Core.Style Methods (<>) :: Style v n -> Style v n -> Style v n # sconcat :: NonEmpty (Style v n) -> Style v n # stimes :: Integral b => b -> Style v n -> Style v n #
Typeable n => Monoid (Style v n)
Instance details Defined in Diagrams.Core.Style Methods mempty :: Style v n # mappend :: Style v n -> Style v n -> Style v n # mconcat :: [Style v n] -> Style v n #
Typeable n => HasStyle (Style v n)
Instance details Defined in Diagrams.Core.Style Methods applyStyle :: Style (V (Style v n)) (N (Style v n)) -> Style v n -> Style v n #
(Additive v, Traversable v, Floating n) => Transformable (Style v n)
Instance details Defined in Diagrams.Core.Style Methods transform :: Transformation (V (Style v n)) (N (Style v n)) -> Style v n -> Style v n #
At (Style v n)
Instance details Defined in Diagrams.Core.Style Methods at :: Index (Style v n) -> Lens' (Style v n) (Maybe (IxValue (Style v n)))
Ixed (Style v n)
Instance details Defined in Diagrams.Core.Style Methods ix :: Index (Style v n) -> Traversal' (Style v n) (IxValue (Style v n)) #
Wrapped (Style v n)
Instance details Defined in Diagrams.Core.Style Associated Types type Unwrapped (Style v n) :: Type # Methods _Wrapped' :: Iso' (Style v n) (Unwrapped (Style v n)) #
Action (Style v n) m
Instance details Defined in Diagrams.Core.Style Methods act :: Style v n -> m -> m
Rewrapped (Style v n) (Style v' n')
Instance details Defined in Diagrams.Core.Style
Each (Style v n) (Style v' n') (Attribute v n) (Attribute v' n')
Instance details Defined in Diagrams.Core.Style Methods each :: Traversal (Style v n) (Style v' n') (Attribute v n) (Attribute v' n') #
type N (Style v n)
Instance details Defined in Diagrams.Core.Style type N (Style v n) = n
type V (Style v n)
Instance details Defined in Diagrams.Core.Style type V (Style v n) = v
type Index (Style v n)
Instance details Defined in Diagrams.Core.Style type Index (Style v n) = TypeRep
type IxValue (Style v n)
Instance details Defined in Diagrams.Core.Style type IxValue (Style v n) = Attribute v n
type Unwrapped (Style v n)
Instance details Defined in Diagrams.Core.Style type Unwrapped (Style v n) = HashMap TypeRep (Attribute v n)

data SortedList a #

Instances

Ord a => Semigroup (SortedList a)
Instance details Defined in Diagrams.Core.Trace Methods (<>) :: SortedList a -> SortedList a -> SortedList a # sconcat :: NonEmpty (SortedList a) -> SortedList a # stimes :: Integral b => b -> SortedList a -> SortedList a #
Ord a => Monoid (SortedList a)
Instance details Defined in Diagrams.Core.Trace Methods mempty :: SortedList a # mappend :: SortedList a -> SortedList a -> SortedList a # mconcat :: [SortedList a] -> SortedList a #

newtype Trace (v :: Type -> Type) n #

Constructors

Trace
Fields appTrace :: Point v n -> v n -> SortedList n

Instances

Show (Trace v n)
Instance details Defined in Diagrams.Core.Trace Methods showsPrec :: Int -> Trace v n -> ShowS # show :: Trace v n -> String # showList :: [Trace v n] -> ShowS #
Ord n => Semigroup (Trace v n)
Instance details Defined in Diagrams.Core.Trace Methods (<>) :: Trace v n -> Trace v n -> Trace v n # sconcat :: NonEmpty (Trace v n) -> Trace v n # stimes :: Integral b => b -> Trace v n -> Trace v n #
Ord n => Monoid (Trace v n)
Instance details Defined in Diagrams.Core.Trace Methods mempty :: Trace v n # mappend :: Trace v n -> Trace v n -> Trace v n # mconcat :: [Trace v n] -> Trace v n #
(Additive v, Num n) => HasOrigin (Trace v n)
Instance details Defined in Diagrams.Core.Trace Methods moveOriginTo :: Point (V (Trace v n)) (N (Trace v n)) -> Trace v n -> Trace v n #
(Additive v, Ord n) => Traced (Trace v n)
Instance details Defined in Diagrams.Core.Trace Methods getTrace :: Trace v n -> Trace (V (Trace v n)) (N (Trace v n)) #
(Additive v, Num n) => Transformable (Trace v n)
Instance details Defined in Diagrams.Core.Trace Methods transform :: Transformation (V (Trace v n)) (N (Trace v n)) -> Trace v n -> Trace v n #
(Metric v, OrderedField n) => Alignable (Trace v n)
Instance details Defined in Diagrams.Align Methods alignBy' :: (InSpace v0 n0 (Trace v n), Fractional n0, HasOrigin (Trace v n)) => (v0 n0 -> Trace v n -> Point v0 n0) -> v0 n0 -> n0 -> Trace v n -> Trace v n # defaultBoundary :: (V (Trace v n) ~ v0, N (Trace v n) ~ n0) => v0 n0 -> Trace v n -> Point v0 n0 # alignBy :: (InSpace v0 n0 (Trace v n), Fractional n0, HasOrigin (Trace v n)) => v0 n0 -> n0 -> Trace v n -> Trace v n #
Wrapped (Trace v n)
Instance details Defined in Diagrams.Core.Trace Associated Types type Unwrapped (Trace v n) :: Type # Methods _Wrapped' :: Iso' (Trace v n) (Unwrapped (Trace v n)) #
Rewrapped (Trace v n) (Trace v' n')
Instance details Defined in Diagrams.Core.Trace
type N (Trace v n)
Instance details Defined in Diagrams.Core.Trace type N (Trace v n) = n
type V (Trace v n)
Instance details Defined in Diagrams.Core.Trace type V (Trace v n) = v
type Unwrapped (Trace v n)
Instance details Defined in Diagrams.Core.Trace type Unwrapped (Trace v n) = Point v n -> v n -> SortedList n

class (Additive (V a), Ord (N a)) => Traced a where #

Methods

getTrace :: a -> Trace (V a) (N a) #

Instances

Traced b => Traced [b]
Instance details Defined in Diagrams.Core.Trace Methods getTrace :: [b] -> Trace (V [b]) (N [b]) #
Traced b => Traced (Set b)
Instance details Defined in Diagrams.Core.Trace Methods getTrace :: Set b -> Trace (V (Set b)) (N (Set b)) #
Traced t => Traced (TransInv t)
Instance details Defined in Diagrams.Core.Trace Methods getTrace :: TransInv t -> Trace (V (TransInv t)) (N (TransInv t)) #
(Traced a, Num (N a)) => Traced (Located a)
Instance details Defined in Diagrams.Located Methods getTrace :: Located a -> Trace (V (Located a)) (N (Located a)) #
(Fractional n, Ord n) => Traced (Box n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getTrace :: Box n -> Trace (V (Box n)) (N (Box n)) #
(RealFloat n, Ord n) => Traced (CSG n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getTrace :: CSG n -> Trace (V (CSG n)) (N (CSG n)) #
OrderedField n => Traced (Ellipsoid n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getTrace :: Ellipsoid n -> Trace (V (Ellipsoid n)) (N (Ellipsoid n)) #
(RealFloat n, Ord n) => Traced (Frustum n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getTrace :: Frustum n -> Trace (V (Frustum n)) (N (Frustum n)) #
(Traced a, Traced b, SameSpace a b) => Traced (a, b)
Instance details Defined in Diagrams.Core.Trace Methods getTrace :: (a, b) -> Trace (V (a, b)) (N (a, b)) #
Traced b => Traced (Map k b)
Instance details Defined in Diagrams.Core.Trace Methods getTrace :: Map k b -> Trace (V (Map k b)) (N (Map k b)) #
(Additive v, Ord n) => Traced (Trace v n)
Instance details Defined in Diagrams.Core.Trace Methods getTrace :: Trace v n -> Trace (V (Trace v n)) (N (Trace v n)) #
RealFloat n => Traced (BoundingBox V2 n)
Instance details Defined in Diagrams.BoundingBox Methods getTrace :: BoundingBox V2 n -> Trace (V (BoundingBox V2 n)) (N (BoundingBox V2 n)) #
TypeableFloat n => Traced (BoundingBox V3 n)
Instance details Defined in Diagrams.BoundingBox Methods getTrace :: BoundingBox V3 n -> Trace (V (BoundingBox V3 n)) (N (BoundingBox V3 n)) #
(Additive v, Ord n) => Traced (Point v n)
Instance details Defined in Diagrams.Core.Trace Methods getTrace :: Point v n -> Trace (V (Point v n)) (N (Point v n)) #
(Metric v, OrderedField n, Semigroup m) => Traced (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods getTrace :: QDiagram b v n m -> Trace (V (QDiagram b v n m)) (N (QDiagram b v n m)) #
(OrderedField n, Metric v, Semigroup m) => Traced (Subdiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods getTrace :: Subdiagram b v n m -> Trace (V (Subdiagram b v n m)) (N (Subdiagram b v n m)) #

data u :-: v #

Instances

Semigroup (a :-: a)
Instance details Defined in Diagrams.Core.Transform Methods (<>) :: (a :-: a) -> (a :-: a) -> a :-: a # sconcat :: NonEmpty (a :-: a) -> a :-: a # stimes :: Integral b => b -> (a :-: a) -> a :-: a #
Monoid (v :-: v)
Instance details Defined in Diagrams.Core.Transform Methods mempty :: v :-: v # mappend :: (v :-: v) -> (v :-: v) -> v :-: v # mconcat :: [v :-: v] -> v :-: v #

type HasBasis (v :: Type -> Type) = (Additive v, Representable v, Rep v ~ E v) #

type HasLinearMap (v :: Type -> Type) = (HasBasis v, Traversable v) #

newtype TransInv t #

Constructors

TransInv t

Instances

Eq t => Eq (TransInv t)
Instance details Defined in Diagrams.Core.Transform Methods (==) :: TransInv t -> TransInv t -> Bool # (/=) :: TransInv t -> TransInv t -> Bool #
Ord t => Ord (TransInv t)
Instance details Defined in Diagrams.Core.Transform Methods compare :: TransInv t -> TransInv t -> Ordering # (<) :: TransInv t -> TransInv t -> Bool # (<=) :: TransInv t -> TransInv t -> Bool # (>) :: TransInv t -> TransInv t -> Bool # (>=) :: TransInv t -> TransInv t -> Bool # max :: TransInv t -> TransInv t -> TransInv t # min :: TransInv t -> TransInv t -> TransInv t #
Show t => Show (TransInv t)
Instance details Defined in Diagrams.Core.Transform Methods showsPrec :: Int -> TransInv t -> ShowS # show :: TransInv t -> String # showList :: [TransInv t] -> ShowS #
Semigroup t => Semigroup (TransInv t)
Instance details Defined in Diagrams.Core.Transform Methods (<>) :: TransInv t -> TransInv t -> TransInv t # sconcat :: NonEmpty (TransInv t) -> TransInv t # stimes :: Integral b => b -> TransInv t -> TransInv t #
Monoid t => Monoid (TransInv t)
Instance details Defined in Diagrams.Core.Transform Methods mempty :: TransInv t # mappend :: TransInv t -> TransInv t -> TransInv t # mconcat :: [TransInv t] -> TransInv t #
Enveloped t => Enveloped (TransInv t)
Instance details Defined in Diagrams.Core.Envelope Methods getEnvelope :: TransInv t -> Envelope (V (TransInv t)) (N (TransInv t)) #
HasOrigin (TransInv t)
Instance details Defined in Diagrams.Core.Transform Methods moveOriginTo :: Point (V (TransInv t)) (N (TransInv t)) -> TransInv t -> TransInv t #
Qualifiable a => Qualifiable (TransInv a)
Instance details Defined in Diagrams.Core.Names Methods (.>>) :: IsName a0 => a0 -> TransInv a -> TransInv a #
Traced t => Traced (TransInv t)
Instance details Defined in Diagrams.Core.Trace Methods getTrace :: TransInv t -> Trace (V (TransInv t)) (N (TransInv t)) #
(Num (N t), Additive (V t), Transformable t) => Transformable (TransInv t)
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V (TransInv t)) (N (TransInv t)) -> TransInv t -> TransInv t #
TrailLike t => TrailLike (TransInv t)
Instance details Defined in Diagrams.TrailLike Methods trailLike :: Located (Trail (V (TransInv t)) (N (TransInv t))) -> TransInv t #
Wrapped (TransInv t)
Instance details Defined in Diagrams.Core.Transform Associated Types type Unwrapped (TransInv t) :: Type # Methods _Wrapped' :: Iso' (TransInv t) (Unwrapped (TransInv t)) #
Rewrapped (TransInv t) (TransInv t')
Instance details Defined in Diagrams.Core.Transform
type N (TransInv t)
Instance details Defined in Diagrams.Core.Transform type N (TransInv t) = N t
type V (TransInv t)
Instance details Defined in Diagrams.Core.Transform type V (TransInv t) = V t
type Unwrapped (TransInv t)
Instance details Defined in Diagrams.Core.Transform type Unwrapped (TransInv t) = t

class Transformable t where #

Methods

transform :: Transformation (V t) (N t) -> t -> t #

Instances

Transformable t => Transformable [t]
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V [t]) (N [t]) -> [t] -> [t] #
(Transformable t, Ord t) => Transformable (Set t)
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V (Set t)) (N (Set t)) -> Set t -> Set t #
(Num (N t), Additive (V t), Transformable t) => Transformable (TransInv t)
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V (TransInv t)) (N (TransInv t)) -> TransInv t -> TransInv t #
(Additive (V a), Num (N a), Transformable a) => Transformable (Located a)
Instance details Defined in Diagrams.Located Methods transform :: Transformation (V (Located a)) (N (Located a)) -> Located a -> Located a #
Transformable (ParallelLight n)
Instance details Defined in Diagrams.ThreeD.Light Methods transform :: Transformation (V (ParallelLight n)) (N (ParallelLight n)) -> ParallelLight n -> ParallelLight n #
Fractional n => Transformable (PointLight n)
Instance details Defined in Diagrams.ThreeD.Light Methods transform :: Transformation (V (PointLight n)) (N (PointLight n)) -> PointLight n -> PointLight n #
Fractional n => Transformable (Box n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods transform :: Transformation (V (Box n)) (N (Box n)) -> Box n -> Box n #
Fractional n => Transformable (CSG n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods transform :: Transformation (V (CSG n)) (N (CSG n)) -> CSG n -> CSG n #
Fractional n => Transformable (Ellipsoid n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods transform :: Transformation (V (Ellipsoid n)) (N (Ellipsoid n)) -> Ellipsoid n -> Ellipsoid n #
Fractional n => Transformable (Frustum n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods transform :: Transformation (V (Frustum n)) (N (Frustum n)) -> Frustum n -> Frustum n #
Fractional n => Transformable (LGradient n)
Instance details Defined in Diagrams.TwoD.Attributes Methods transform :: Transformation (V (LGradient n)) (N (LGradient n)) -> LGradient n -> LGradient n #
Fractional n => Transformable (RGradient n)
Instance details Defined in Diagrams.TwoD.Attributes Methods transform :: Transformation (V (RGradient n)) (N (RGradient n)) -> RGradient n -> RGradient n #
Floating n => Transformable (Texture n)
Instance details Defined in Diagrams.TwoD.Attributes Methods transform :: Transformation (V (Texture n)) (N (Texture n)) -> Texture n -> Texture n #
Floating n => Transformable (Text n)
Instance details Defined in Diagrams.TwoD.Text Methods transform :: Transformation (V (Text n)) (N (Text n)) -> Text n -> Text n #
OrderedField n => Transformable (Clip n)
Instance details Defined in Diagrams.TwoD.Path Methods transform :: Transformation (V (Clip n)) (N (Clip n)) -> Clip n -> Clip n #
Transformable m => Transformable (Deletable m)
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V (Deletable m)) (N (Deletable m)) -> Deletable m -> Deletable m #
Floating n => Transformable (FillTexture n)
Instance details Defined in Diagrams.TwoD.Attributes Methods transform :: Transformation (V (FillTexture n)) (N (FillTexture n)) -> FillTexture n -> FillTexture n #
Floating n => Transformable (LineTexture n)
Instance details Defined in Diagrams.TwoD.Attributes Methods transform :: Transformation (V (LineTexture n)) (N (LineTexture n)) -> LineTexture n -> LineTexture n #
(V t ~ v, N t ~ n, V t ~ V s, N t ~ N s, Functor v, Num n, Transformable t, Transformable s) => Transformable (s -> t)
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V (s -> t)) (N (s -> t)) -> (s -> t) -> s -> t #
(Transformable t, Transformable s, V t ~ V s, N t ~ N s) => Transformable (t, s)
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V (t, s)) (N (t, s)) -> (t, s) -> (t, s) #
Transformable t => Transformable (Map k t)
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V (Map k t)) (N (Map k t)) -> Map k t -> Map k t #
(Metric v, Floating n) => Transformable (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope Methods transform :: Transformation (V (Envelope v n)) (N (Envelope v n)) -> Envelope v n -> Envelope v n #
(InSpace v n t, Transformable t, HasLinearMap v, Floating n) => Transformable (Measured n t)
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V (Measured n t)) (N (Measured n t)) -> Measured n t -> Measured n t #
(Additive v, Traversable v, Floating n) => Transformable (Attribute v n)
Instance details Defined in Diagrams.Core.Style Methods transform :: Transformation (V (Attribute v n)) (N (Attribute v n)) -> Attribute v n -> Attribute v n #
(Additive v, Traversable v, Floating n) => Transformable (Style v n)
Instance details Defined in Diagrams.Core.Style Methods transform :: Transformation (V (Style v n)) (N (Style v n)) -> Style v n -> Style v n #
(Additive v, Num n) => Transformable (Trace v n)
Instance details Defined in Diagrams.Core.Trace Methods transform :: Transformation (V (Trace v n)) (N (Trace v n)) -> Trace v n -> Trace v n #
(Additive v, Num n) => Transformable (Transformation v n)
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V (Transformation v n)) (N (Transformation v n)) -> Transformation v n -> Transformation v n #
(V (v n) ~ v, N (v n) ~ n, Transformable (v n)) => Transformable (Direction v n)
Instance details Defined in Diagrams.Direction Methods transform :: Transformation (V (Direction v n)) (N (Direction v n)) -> Direction v n -> Direction v n #
(HasLinearMap v, Metric v, OrderedField n) => Transformable (Path v n)
Instance details Defined in Diagrams.Path Methods transform :: Transformation (V (Path v n)) (N (Path v n)) -> Path v n -> Path v n #
(Additive v, Num n) => Transformable (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods transform :: Transformation (V (FixedSegment v n)) (N (FixedSegment v n)) -> FixedSegment v n -> FixedSegment v n #
Num n => Transformable (Camera l n)
Instance details Defined in Diagrams.ThreeD.Camera Methods transform :: Transformation (V (Camera l n)) (N (Camera l n)) -> Camera l n -> Camera l n #
(Floating n, Ord n, Metric v) => Transformable (SegTree v n)
Instance details Defined in Diagrams.Trail Methods transform :: Transformation (V (SegTree v n)) (N (SegTree v n)) -> SegTree v n -> SegTree v n #
(HasLinearMap v, Metric v, OrderedField n) => Transformable (Trail v n)
Instance details Defined in Diagrams.Trail Methods transform :: Transformation (V (Trail v n)) (N (Trail v n)) -> Trail v n -> Trail v n #
Fractional n => Transformable (DImage n a)
Instance details Defined in Diagrams.TwoD.Image Methods transform :: Transformation (V (DImage n a)) (N (DImage n a)) -> DImage n a -> DImage n a #
(Additive v, Num n) => Transformable (Point v n)
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V (Point v n)) (N (Point v n)) -> Point v n -> Point v n #
(Transformable t, Transformable s, Transformable u, V s ~ V t, N s ~ N t, V s ~ V u, N s ~ N u) => Transformable (t, s, u)
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V (t, s, u)) (N (t, s, u)) -> (t, s, u) -> (t, s, u) #
(Additive v, Num n) => Transformable (Query v n m)
Instance details Defined in Diagrams.Core.Query Methods transform :: Transformation (V (Query v n m)) (N (Query v n m)) -> Query v n m -> Query v n m #
Transformable (Prim b v n)
Instance details Defined in Diagrams.Core.Types Methods transform :: Transformation (V (Prim b v n)) (N (Prim b v n)) -> Prim b v n -> Prim b v n #
Transformable (Offset c v n)
Instance details Defined in Diagrams.Segment Methods transform :: Transformation (V (Offset c v n)) (N (Offset c v n)) -> Offset c v n -> Offset c v n #
Transformable (Segment c v n)
Instance details Defined in Diagrams.Segment Methods transform :: Transformation (V (Segment c v n)) (N (Segment c v n)) -> Segment c v n -> Segment c v n #
(HasLinearMap v, Metric v, OrderedField n) => Transformable (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods transform :: Transformation (V (Trail' l v n)) (N (Trail' l v n)) -> Trail' l v n -> Trail' l v n #
(OrderedField n, Metric v, Semigroup m) => Transformable (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods transform :: Transformation (V (QDiagram b v n m)) (N (QDiagram b v n m)) -> QDiagram b v n m -> QDiagram b v n m #
Transformable (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types Methods transform :: Transformation (V (SubMap b v n m)) (N (SubMap b v n m)) -> SubMap b v n m -> SubMap b v n m #
Transformable (Subdiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods transform :: Transformation (V (Subdiagram b v n m)) (N (Subdiagram b v n m)) -> Subdiagram b v n m -> Subdiagram b v n m #

data Transformation (v :: Type -> Type) n #

Instances

(Additive v, Num n) => Semigroup (Transformation v n)
Instance details Defined in Diagrams.Core.Transform Methods (<>) :: Transformation v n -> Transformation v n -> Transformation v n # sconcat :: NonEmpty (Transformation v n) -> Transformation v n # stimes :: Integral b => b -> Transformation v n -> Transformation v n #
(Additive v, Num n) => Monoid (Transformation v n)
Instance details Defined in Diagrams.Core.Transform Methods mempty :: Transformation v n # mappend :: Transformation v n -> Transformation v n -> Transformation v n # mconcat :: [Transformation v n] -> Transformation v n #
(Additive v, Num n) => HasOrigin (Transformation v n)
Instance details Defined in Diagrams.Core.Transform Methods moveOriginTo :: Point (V (Transformation v n)) (N (Transformation v n)) -> Transformation v n -> Transformation v n #
(Additive v, Num n) => Transformable (Transformation v n)
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V (Transformation v n)) (N (Transformation v n)) -> Transformation v n -> Transformation v n #
(Transformable a, V a ~ v, N a ~ n) => Action (Transformation v n) a
Instance details Defined in Diagrams.Core.Transform Methods act :: Transformation v n -> a -> a
type N (Transformation v n)
Instance details Defined in Diagrams.Core.Transform type N (Transformation v n) = n
type V (Transformation v n)
Instance details Defined in Diagrams.Core.Transform type V (Transformation v n) = v

class Backend b (v :: Type -> Type) n where #

Minimal complete definition

renderRTree

Associated Types

data Render b (v :: Type -> Type) n :: Type #

type Result b (v :: Type -> Type) n :: Type #

data Options b (v :: Type -> Type) n :: Type #

Methods

adjustDia :: (Additive v, Monoid' m, Num n) => b -> Options b v n -> QDiagram b v n m -> (Options b v n, Transformation v n, QDiagram b v n m) #

renderRTree :: b -> Options b v n -> RTree b v n Annotation -> Result b v n #

Instances

Backend NullBackend v n
Instance details Defined in Diagrams.Core.Types Associated Types data Render NullBackend v n :: Type # type Result NullBackend v n :: Type # data Options NullBackend v n :: Type # Methods adjustDia :: (Additive v, Monoid' m, Num n) => NullBackend -> Options NullBackend v n -> QDiagram NullBackend v n m -> (Options NullBackend v n, Transformation v n, QDiagram NullBackend v n m) # renderRTree :: NullBackend -> Options NullBackend v n -> RTree NullBackend v n Annotation -> Result NullBackend v n #
SVGFloat n => Backend SVG V2 n
Instance details Defined in Diagrams.Backend.SVG Associated Types data Render SVG V2 n :: Type # type Result SVG V2 n :: Type # data Options SVG V2 n :: Type # Methods adjustDia :: (Additive V2, Monoid' m, Num n) => SVG -> Options SVG V2 n -> QDiagram SVG V2 n m -> (Options SVG V2 n, Transformation V2 n, QDiagram SVG V2 n m) # renderRTree :: SVG -> Options SVG V2 n -> RTree SVG V2 n Annotation -> Result SVG V2 n #

type D (v :: Type -> Type) n = QDiagram NullBackend v n Any #

type Diagram b = QDiagram b (V b) (N b) Any #

data NullBackend #

Instances

Backend NullBackend v n
Instance details Defined in Diagrams.Core.Types Associated Types data Render NullBackend v n :: Type # type Result NullBackend v n :: Type # data Options NullBackend v n :: Type # Methods adjustDia :: (Additive v, Monoid' m, Num n) => NullBackend -> Options NullBackend v n -> QDiagram NullBackend v n m -> (Options NullBackend v n, Transformation v n, QDiagram NullBackend v n m) # renderRTree :: NullBackend -> Options NullBackend v n -> RTree NullBackend v n Annotation -> Result NullBackend v n #
Fractional n => Renderable (Box n) NullBackend
Instance details Defined in Diagrams.ThreeD.Shapes Methods render :: NullBackend -> Box n -> Render NullBackend (V (Box n)) (N (Box n)) #
Fractional n => Renderable (Ellipsoid n) NullBackend
Instance details Defined in Diagrams.ThreeD.Shapes Methods render :: NullBackend -> Ellipsoid n -> Render NullBackend (V (Ellipsoid n)) (N (Ellipsoid n)) #
Fractional n => Renderable (Frustum n) NullBackend
Instance details Defined in Diagrams.ThreeD.Shapes Methods render :: NullBackend -> Frustum n -> Render NullBackend (V (Frustum n)) (N (Frustum n)) #
Floating n => Renderable (Text n) NullBackend
Instance details Defined in Diagrams.TwoD.Text Methods render :: NullBackend -> Text n -> Render NullBackend (V (Text n)) (N (Text n)) #
(HasLinearMap v, Metric v, OrderedField n) => Renderable (Path v n) NullBackend
Instance details Defined in Diagrams.Path Methods render :: NullBackend -> Path v n -> Render NullBackend (V (Path v n)) (N (Path v n)) #
Num n => Renderable (Camera l n) NullBackend
Instance details Defined in Diagrams.ThreeD.Camera Methods render :: NullBackend -> Camera l n -> Render NullBackend (V (Camera l n)) (N (Camera l n)) #
Fractional n => Renderable (DImage n a) NullBackend
Instance details Defined in Diagrams.TwoD.Image Methods render :: NullBackend -> DImage n a -> Render NullBackend (V (DImage n a)) (N (DImage n a)) #
Semigroup (Render NullBackend v n)
Instance details Defined in Diagrams.Core.Types Methods (<>) :: Render NullBackend v n -> Render NullBackend v n -> Render NullBackend v n # sconcat :: NonEmpty (Render NullBackend v n) -> Render NullBackend v n # stimes :: Integral b => b -> Render NullBackend v n -> Render NullBackend v n #
Monoid (Render NullBackend v n)
Instance details Defined in Diagrams.Core.Types Methods mempty :: Render NullBackend v n # mappend :: Render NullBackend v n -> Render NullBackend v n -> Render NullBackend v n # mconcat :: [Render NullBackend v n] -> Render NullBackend v n #
Renderable (Segment c v n) NullBackend
Instance details Defined in Diagrams.Segment Methods render :: NullBackend -> Segment c v n -> Render NullBackend (V (Segment c v n)) (N (Segment c v n)) #
(HasLinearMap v, Metric v, OrderedField n) => Renderable (Trail' o v n) NullBackend
Instance details Defined in Diagrams.Trail Methods render :: NullBackend -> Trail' o v n -> Render NullBackend (V (Trail' o v n)) (N (Trail' o v n)) #
data Options NullBackend v n
Instance details Defined in Diagrams.Core.Types data Options NullBackend v n
data Render NullBackend v n
Instance details Defined in Diagrams.Core.Types data Render NullBackend v n = NullBackendRender
type Result NullBackend v n
Instance details Defined in Diagrams.Core.Types type Result NullBackend v n = ()

data Prim b (v :: Type -> Type) n where #

Constructors

Prim :: forall b (v :: Type -> Type) n p. (Transformable p, Typeable p, Renderable p b) => p -> Prim b (V p) (N p)

Instances

Transformable (Prim b v n)
Instance details Defined in Diagrams.Core.Types Methods transform :: Transformation (V (Prim b v n)) (N (Prim b v n)) -> Prim b v n -> Prim b v n #
Renderable (Prim b v n) b
Instance details Defined in Diagrams.Core.Types Methods render :: b -> Prim b v n -> Render b (V (Prim b v n)) (N (Prim b v n)) #
type N (Prim b v n)
Instance details Defined in Diagrams.Core.Types type N (Prim b v n) = n
type V (Prim b v n)
Instance details Defined in Diagrams.Core.Types type V (Prim b v n) = v

data QDiagram b (v :: Type -> Type) n m #

Instances

Functor (QDiagram b v n)
Instance details Defined in Diagrams.Core.Types Methods fmap :: (a -> b0) -> QDiagram b v n a -> QDiagram b v n b0 # (<$) :: a -> QDiagram b v n b0 -> QDiagram b v n a #
(Metric v, OrderedField n, Semigroup m) => Semigroup (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods (<>) :: QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m # sconcat :: NonEmpty (QDiagram b v n m) -> QDiagram b v n m # stimes :: Integral b0 => b0 -> QDiagram b v n m -> QDiagram b v n m #
(Metric v, OrderedField n, Semigroup m) => Monoid (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods mempty :: QDiagram b v n m # mappend :: QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m # mconcat :: [QDiagram b v n m] -> QDiagram b v n m #
(Metric v, OrderedField n, Monoid' m) => Enveloped (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods getEnvelope :: QDiagram b v n m -> Envelope (V (QDiagram b v n m)) (N (QDiagram b v n m)) #
(Metric v, OrderedField n, Semigroup m) => HasOrigin (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods moveOriginTo :: Point (V (QDiagram b v n m)) (N (QDiagram b v n m)) -> QDiagram b v n m -> QDiagram b v n m #
(Metric v, OrderedField n, Monoid' m) => Juxtaposable (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods juxtapose :: Vn (QDiagram b v n m) -> QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m #
(Metric v, OrderedField n, Semigroup m) => Qualifiable (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods (.>>) :: IsName a => a -> QDiagram b v n m -> QDiagram b v n m #
(Metric v, OrderedField n, Semigroup m) => HasStyle (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods applyStyle :: Style (V (QDiagram b v n m)) (N (QDiagram b v n m)) -> QDiagram b v n m -> QDiagram b v n m #
(Metric v, OrderedField n, Semigroup m) => Traced (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods getTrace :: QDiagram b v n m -> Trace (V (QDiagram b v n m)) (N (QDiagram b v n m)) #
(OrderedField n, Metric v, Semigroup m) => Transformable (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods transform :: Transformation (V (QDiagram b v n m)) (N (QDiagram b v n m)) -> QDiagram b v n m -> QDiagram b v n m #
(Metric v, OrderedField n, Monoid' m) => Alignable (QDiagram b v n m)
Instance details Defined in Diagrams.Align Methods alignBy' :: (InSpace v0 n0 (QDiagram b v n m), Fractional n0, HasOrigin (QDiagram b v n m)) => (v0 n0 -> QDiagram b v n m -> Point v0 n0) -> v0 n0 -> n0 -> QDiagram b v n m -> QDiagram b v n m # defaultBoundary :: (V (QDiagram b v n m) ~ v0, N (QDiagram b v n m) ~ n0) => v0 n0 -> QDiagram b v n m -> Point v0 n0 # alignBy :: (InSpace v0 n0 (QDiagram b v n m), Fractional n0, HasOrigin (QDiagram b v n m)) => v0 n0 -> n0 -> QDiagram b v n m -> QDiagram b v n m #
Wrapped (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Associated Types type Unwrapped (QDiagram b v n m) :: Type # Methods _Wrapped' :: Iso' (QDiagram b v n m) (Unwrapped (QDiagram b v n m)) #
Monoid m => HasQuery (QDiagram b v n m) m
Instance details Defined in Diagrams.Query Methods getQuery :: QDiagram b v n m -> Query (V (QDiagram b v n m)) (N (QDiagram b v n m)) m #
Rewrapped (QDiagram b v n m) (QDiagram b' v' n' m')
Instance details Defined in Diagrams.Core.Types
type N (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types type N (QDiagram b v n m) = n
type V (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types type V (QDiagram b v n m) = v
type Unwrapped (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types type Unwrapped (QDiagram b v n m) = DUALTree (DownAnnots v n) (UpAnnots b v n m) Annotation (QDiaLeaf b v n m)

class Transformable t => Renderable t b where #

Methods

render :: b -> t -> Render b (V t) (N t) #

Instances

Fractional n => Renderable (Box n) NullBackend
Instance details Defined in Diagrams.ThreeD.Shapes Methods render :: NullBackend -> Box n -> Render NullBackend (V (Box n)) (N (Box n)) #
Fractional n => Renderable (Ellipsoid n) NullBackend
Instance details Defined in Diagrams.ThreeD.Shapes Methods render :: NullBackend -> Ellipsoid n -> Render NullBackend (V (Ellipsoid n)) (N (Ellipsoid n)) #
Fractional n => Renderable (Frustum n) NullBackend
Instance details Defined in Diagrams.ThreeD.Shapes Methods render :: NullBackend -> Frustum n -> Render NullBackend (V (Frustum n)) (N (Frustum n)) #
Floating n => Renderable (Text n) NullBackend
Instance details Defined in Diagrams.TwoD.Text Methods render :: NullBackend -> Text n -> Render NullBackend (V (Text n)) (N (Text n)) #
SVGFloat n => Renderable (Text n) SVG
Instance details Defined in Diagrams.Backend.SVG Methods render :: SVG -> Text n -> Render SVG (V (Text n)) (N (Text n)) #
(HasLinearMap v, Metric v, OrderedField n) => Renderable (Path v n) NullBackend
Instance details Defined in Diagrams.Path Methods render :: NullBackend -> Path v n -> Render NullBackend (V (Path v n)) (N (Path v n)) #
SVGFloat n => Renderable (Path V2 n) SVG
Instance details Defined in Diagrams.Backend.SVG Methods render :: SVG -> Path V2 n -> Render SVG (V (Path V2 n)) (N (Path V2 n)) #
Num n => Renderable (Camera l n) NullBackend
Instance details Defined in Diagrams.ThreeD.Camera Methods render :: NullBackend -> Camera l n -> Render NullBackend (V (Camera l n)) (N (Camera l n)) #
Fractional n => Renderable (DImage n a) NullBackend
Instance details Defined in Diagrams.TwoD.Image Methods render :: NullBackend -> DImage n a -> Render NullBackend (V (DImage n a)) (N (DImage n a)) #
SVGFloat n => Renderable (DImage n (Native Img)) SVG
Instance details Defined in Diagrams.Backend.SVG Methods render :: SVG -> DImage n (Native Img) -> Render SVG (V (DImage n (Native Img))) (N (DImage n (Native Img))) #
SVGFloat n => Renderable (DImage n Embedded) SVG
Instance details Defined in Diagrams.Backend.SVG Methods render :: SVG -> DImage n Embedded -> Render SVG (V (DImage n Embedded)) (N (DImage n Embedded)) #
Renderable (Prim b v n) b
Instance details Defined in Diagrams.Core.Types Methods render :: b -> Prim b v n -> Render b (V (Prim b v n)) (N (Prim b v n)) #
Renderable (Segment c v n) NullBackend
Instance details Defined in Diagrams.Segment Methods render :: NullBackend -> Segment c v n -> Render NullBackend (V (Segment c v n)) (N (Segment c v n)) #
(HasLinearMap v, Metric v, OrderedField n) => Renderable (Trail' o v n) NullBackend
Instance details Defined in Diagrams.Trail Methods render :: NullBackend -> Trail' o v n -> Render NullBackend (V (Trail' o v n)) (N (Trail' o v n)) #

newtype SubMap b (v :: Type -> Type) n m #

Constructors

SubMap (Map Name [Subdiagram b v n m])

Instances

Action Name (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types Methods act :: Name -> SubMap b v n m -> SubMap b v n m
Functor (SubMap b v n)
Instance details Defined in Diagrams.Core.Types Methods fmap :: (a -> b0) -> SubMap b v n a -> SubMap b v n b0 # (<$) :: a -> SubMap b v n b0 -> SubMap b v n a #
Semigroup (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types Methods (<>) :: SubMap b v n m -> SubMap b v n m -> SubMap b v n m # sconcat :: NonEmpty (SubMap b v n m) -> SubMap b v n m # stimes :: Integral b0 => b0 -> SubMap b v n m -> SubMap b v n m #
Monoid (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types Methods mempty :: SubMap b v n m # mappend :: SubMap b v n m -> SubMap b v n m -> SubMap b v n m # mconcat :: [SubMap b v n m] -> SubMap b v n m #
(OrderedField n, Metric v) => HasOrigin (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types Methods moveOriginTo :: Point (V (SubMap b v n m)) (N (SubMap b v n m)) -> SubMap b v n m -> SubMap b v n m #
Qualifiable (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types Methods (.>>) :: IsName a => a -> SubMap b v n m -> SubMap b v n m #
Transformable (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types Methods transform :: Transformation (V (SubMap b v n m)) (N (SubMap b v n m)) -> SubMap b v n m -> SubMap b v n m #
Wrapped (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types Associated Types type Unwrapped (SubMap b v n m) :: Type # Methods _Wrapped' :: Iso' (SubMap b v n m) (Unwrapped (SubMap b v n m)) #
Rewrapped (SubMap b v n m) (SubMap b' v' n' m')
Instance details Defined in Diagrams.Core.Types
type N (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types type N (SubMap b v n m) = n
type V (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types type V (SubMap b v n m) = v
type Unwrapped (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types type Unwrapped (SubMap b v n m) = Map Name [Subdiagram b v n m]

data Subdiagram b (v :: Type -> Type) n m #

Constructors

Subdiagram (QDiagram b v n m) (DownAnnots v n)

Instances

Functor (Subdiagram b v n)
Instance details Defined in Diagrams.Core.Types Methods fmap :: (a -> b0) -> Subdiagram b v n a -> Subdiagram b v n b0 # (<$) :: a -> Subdiagram b v n b0 -> Subdiagram b v n a #
(OrderedField n, Metric v, Monoid' m) => Enveloped (Subdiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods getEnvelope :: Subdiagram b v n m -> Envelope (V (Subdiagram b v n m)) (N (Subdiagram b v n m)) #
(Metric v, OrderedField n) => HasOrigin (Subdiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods moveOriginTo :: Point (V (Subdiagram b v n m)) (N (Subdiagram b v n m)) -> Subdiagram b v n m -> Subdiagram b v n m #
(OrderedField n, Metric v, Semigroup m) => Traced (Subdiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods getTrace :: Subdiagram b v n m -> Trace (V (Subdiagram b v n m)) (N (Subdiagram b v n m)) #
Transformable (Subdiagram b v n m)
Instance details Defined in Diagrams.Core.Types Methods transform :: Transformation (V (Subdiagram b v n m)) (N (Subdiagram b v n m)) -> Subdiagram b v n m -> Subdiagram b v n m #
type N (Subdiagram b v n m)
Instance details Defined in Diagrams.Core.Types type N (Subdiagram b v n m) = n
type V (Subdiagram b v n m)
Instance details Defined in Diagrams.Core.Types type V (Subdiagram b v n m) = v

type TypeableFloat n = (Typeable n, RealFloat n) #

type InSpace (v :: Type -> Type) n a = (V a ~ v, N a ~ n, Additive v, Num n) #

type family N a :: Type #

Instances

type N SVG
Instance details Defined in Diagrams.Backend.SVG type N SVG = Double
type N [a]
Instance details Defined in Diagrams.Core.V type N [a] = N a
type N (Option a)
Instance details Defined in Diagrams.Core.V type N (Option a) = N a
type N (Set a)
Instance details Defined in Diagrams.Core.V type N (Set a) = N a
type N (Active a)
Instance details Defined in Diagrams.Animation.Active type N (Active a) = N a
type N (TransInv t)
Instance details Defined in Diagrams.Core.Transform type N (TransInv t) = N t
type N (Angle n)
Instance details Defined in Diagrams.Angle type N (Angle n) = n
type N (Located a)
Instance details Defined in Diagrams.Located type N (Located a) = N a
type N (Tangent t)
Instance details Defined in Diagrams.Tangent type N (Tangent t) = N t
type N (OrthoLens n)
Instance details Defined in Diagrams.ThreeD.Camera type N (OrthoLens n) = n
type N (PerspectiveLens n)
Instance details Defined in Diagrams.ThreeD.Camera type N (PerspectiveLens n) = n
type N (ParallelLight n)
Instance details Defined in Diagrams.ThreeD.Light type N (ParallelLight n) = n
type N (PointLight n)
Instance details Defined in Diagrams.ThreeD.Light type N (PointLight n) = n
type N (Box n)
Instance details Defined in Diagrams.ThreeD.Shapes type N (Box n) = n
type N (CSG n)
Instance details Defined in Diagrams.ThreeD.Shapes type N (CSG n) = n
type N (Ellipsoid n)
Instance details Defined in Diagrams.ThreeD.Shapes type N (Ellipsoid n) = n
type N (Frustum n)
Instance details Defined in Diagrams.ThreeD.Shapes type N (Frustum n) = n
type N (GetSegment t)
Instance details Defined in Diagrams.Trail type N (GetSegment t) = N t
type N (LGradient n)
Instance details Defined in Diagrams.TwoD.Attributes type N (LGradient n) = n
type N (RGradient n)
Instance details Defined in Diagrams.TwoD.Attributes type N (RGradient n) = n
type N (Texture n)
Instance details Defined in Diagrams.TwoD.Attributes type N (Texture n) = n
type N (V2 n)
Instance details Defined in Diagrams.TwoD.Types type N (V2 n) = n
type N (V3 n)
Instance details Defined in Diagrams.ThreeD.Types type N (V3 n) = n
type N (Text n)
Instance details Defined in Diagrams.TwoD.Text type N (Text n) = n
type N (Clip n)
Instance details Defined in Diagrams.TwoD.Path type N (Clip n) = n
type N (Deletable m)
Instance details Defined in Diagrams.Core.V type N (Deletable m) = N m
type N (Split m)
Instance details Defined in Diagrams.Core.V type N (Split m) = N m
type N (FillTexture n)
Instance details Defined in Diagrams.TwoD.Attributes type N (FillTexture n) = n
type N (LineTexture n)
Instance details Defined in Diagrams.TwoD.Attributes type N (LineTexture n) = n
type N (BernsteinPoly n)
Instance details Defined in Diagrams.TwoD.Segment.Bernstein type N (BernsteinPoly n) = n
type N (a -> b)
Instance details Defined in Diagrams.Core.V type N (a -> b) = N b
type N (a, b)
Instance details Defined in Diagrams.Core.V type N (a, b) = N a
type N (Map k a)
Instance details Defined in Diagrams.Core.V type N (Map k a) = N a
type N (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope type N (Envelope v n) = n
type N (Measured n a)
Instance details Defined in Diagrams.Core.Measure type N (Measured n a) = N a
type N (Attribute v n)
Instance details Defined in Diagrams.Core.Style type N (Attribute v n) = n
type N (Style v n)
Instance details Defined in Diagrams.Core.Style type N (Style v n) = n
type N (Trace v n)
Instance details Defined in Diagrams.Core.Trace type N (Trace v n) = n
type N (Transformation v n)
Instance details Defined in Diagrams.Core.Transform type N (Transformation v n) = n
type N (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox type N (BoundingBox v n) = n
type N (Direction v n)
Instance details Defined in Diagrams.Direction type N (Direction v n) = n
type N (Path v n)
Instance details Defined in Diagrams.Path type N (Path v n) = n
type N (FixedSegment v n)
Instance details Defined in Diagrams.Segment type N (FixedSegment v n) = n
type N (SizeSpec v n)
Instance details Defined in Diagrams.Size type N (SizeSpec v n) = n
type N (Camera l n)
Instance details Defined in Diagrams.ThreeD.Camera type N (Camera l n) = n
type N (SegTree v n)
Instance details Defined in Diagrams.Trail type N (SegTree v n) = n
type N (Trail v n)
Instance details Defined in Diagrams.Trail type N (Trail v n) = n
type N (DImage n a)
Instance details Defined in Diagrams.TwoD.Image type N (DImage n a) = n
type N (Point v n)
Instance details Defined in Diagrams.Core.Points type N (Point v n) = n
type N (FingerTree m a)
Instance details Defined in Diagrams.Trail type N (FingerTree m a) = N a
type N (m :+: n)
Instance details Defined in Diagrams.Core.V type N (m :+: n) = N m
type N (NonEmptyBoundingBox v n)
Instance details Defined in Diagrams.BoundingBox type N (NonEmptyBoundingBox v n) = n
type N (a, b, c)
Instance details Defined in Diagrams.Core.V type N (a, b, c) = N a
type N (Query v n m)
Instance details Defined in Diagrams.Core.Query type N (Query v n m) = n
type N (Prim b v n)
Instance details Defined in Diagrams.Core.Types type N (Prim b v n) = n
type N (Offset c v n)
Instance details Defined in Diagrams.Segment type N (Offset c v n) = n
type N (Segment c v n)
Instance details Defined in Diagrams.Segment type N (Segment c v n) = n
type N (Trail' l v n)
Instance details Defined in Diagrams.Trail type N (Trail' l v n) = n
type N (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types type N (QDiagram b v n m) = n
type N (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types type N (SubMap b v n m) = n
type N (Subdiagram b v n m)
Instance details Defined in Diagrams.Core.Types type N (Subdiagram b v n m) = n

type SameSpace a b = (V a ~ V b, N a ~ N b) #

type family V a :: Type -> Type #

Instances

type V SVG
Instance details Defined in Diagrams.Backend.SVG type V SVG = V2
type V [a]
Instance details Defined in Diagrams.Core.V type V [a] = V a
type V (Option a)
Instance details Defined in Diagrams.Core.V type V (Option a) = V a
type V (Set a)
Instance details Defined in Diagrams.Core.V type V (Set a) = V a
type V (Active a)
Instance details Defined in Diagrams.Animation.Active type V (Active a) = V a
type V (TransInv t)
Instance details Defined in Diagrams.Core.Transform type V (TransInv t) = V t
type V (Located a)
Instance details Defined in Diagrams.Located type V (Located a) = V a
type V (Tangent t)
Instance details Defined in Diagrams.Tangent type V (Tangent t) = V t
type V (OrthoLens n)
Instance details Defined in Diagrams.ThreeD.Camera type V (OrthoLens n) = V3
type V (PerspectiveLens n)
Instance details Defined in Diagrams.ThreeD.Camera type V (PerspectiveLens n) = V3
type V (ParallelLight n)
Instance details Defined in Diagrams.ThreeD.Light type V (ParallelLight n) = V3
type V (PointLight n)
Instance details Defined in Diagrams.ThreeD.Light type V (PointLight n) = V3
type V (Box n)
Instance details Defined in Diagrams.ThreeD.Shapes type V (Box n) = V3
type V (CSG n)
Instance details Defined in Diagrams.ThreeD.Shapes type V (CSG n) = V3
type V (Ellipsoid n)
Instance details Defined in Diagrams.ThreeD.Shapes type V (Ellipsoid n) = V3
type V (Frustum n)
Instance details Defined in Diagrams.ThreeD.Shapes type V (Frustum n) = V3
type V (GetSegment t)
Instance details Defined in Diagrams.Trail type V (GetSegment t) = V t
type V (LGradient n)
Instance details Defined in Diagrams.TwoD.Attributes type V (LGradient n) = V2
type V (RGradient n)
Instance details Defined in Diagrams.TwoD.Attributes type V (RGradient n) = V2
type V (Texture n)
Instance details Defined in Diagrams.TwoD.Attributes type V (Texture n) = V2
type V (V2 n)
Instance details Defined in Diagrams.TwoD.Types type V (V2 n) = V2
type V (V3 n)
Instance details Defined in Diagrams.ThreeD.Types type V (V3 n) = V3
type V (Text n)
Instance details Defined in Diagrams.TwoD.Text type V (Text n) = V2
type V (Clip n)
Instance details Defined in Diagrams.TwoD.Path type V (Clip n) = V2
type V (Deletable m)
Instance details Defined in Diagrams.Core.V type V (Deletable m) = V m
type V (Split m)
Instance details Defined in Diagrams.Core.V type V (Split m) = V m
type V (FillTexture n)
Instance details Defined in Diagrams.TwoD.Attributes type V (FillTexture n) = V2
type V (LineTexture n)
Instance details Defined in Diagrams.TwoD.Attributes type V (LineTexture n) = V2
type V (BernsteinPoly n)
Instance details Defined in Diagrams.TwoD.Segment.Bernstein type V (BernsteinPoly n) = V1
type V (a -> b)
Instance details Defined in Diagrams.Core.V type V (a -> b) = V b
type V (a, b)
Instance details Defined in Diagrams.Core.V type V (a, b) = V a
type V (Map k a)
Instance details Defined in Diagrams.Core.V type V (Map k a) = V a
type V (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope type V (Envelope v n) = v
type V (Measured n a)
Instance details Defined in Diagrams.Core.Measure type V (Measured n a) = V a
type V (Attribute v n)
Instance details Defined in Diagrams.Core.Style type V (Attribute v n) = v
type V (Style v n)
Instance details Defined in Diagrams.Core.Style type V (Style v n) = v
type V (Trace v n)
Instance details Defined in Diagrams.Core.Trace type V (Trace v n) = v
type V (Transformation v n)
Instance details Defined in Diagrams.Core.Transform type V (Transformation v n) = v
type V (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox type V (BoundingBox v n) = v
type V (Direction v n)
Instance details Defined in Diagrams.Direction type V (Direction v n) = v
type V (Path v n)
Instance details Defined in Diagrams.Path type V (Path v n) = v
type V (FixedSegment v n)
Instance details Defined in Diagrams.Segment type V (FixedSegment v n) = v
type V (SizeSpec v n)
Instance details Defined in Diagrams.Size type V (SizeSpec v n) = v
type V (Camera l n)
Instance details Defined in Diagrams.ThreeD.Camera type V (Camera l n) = V3
type V (SegTree v n)
Instance details Defined in Diagrams.Trail type V (SegTree v n) = v
type V (Trail v n)
Instance details Defined in Diagrams.Trail type V (Trail v n) = v
type V (DImage n a)
Instance details Defined in Diagrams.TwoD.Image type V (DImage n a) = V2
type V (Point v n)
Instance details Defined in Diagrams.Core.Points type V (Point v n) = v
type V (FingerTree m a)
Instance details Defined in Diagrams.Trail type V (FingerTree m a) = V a
type V (m :+: n)
Instance details Defined in Diagrams.Core.V type V (m :+: n) = V m
type V (NonEmptyBoundingBox v n)
Instance details Defined in Diagrams.BoundingBox type V (NonEmptyBoundingBox v n) = v
type V (a, b, c)
Instance details Defined in Diagrams.Core.V type V (a, b, c) = V a
type V (Query v n m)
Instance details Defined in Diagrams.Core.Query type V (Query v n m) = v
type V (Prim b v n)
Instance details Defined in Diagrams.Core.Types type V (Prim b v n) = v
type V (Offset c v n)
Instance details Defined in Diagrams.Segment type V (Offset c v n) = v
type V (Segment c v n)
Instance details Defined in Diagrams.Segment type V (Segment c v n) = v
type V (Trail' l v n)
Instance details Defined in Diagrams.Trail type V (Trail' l v n) = v
type V (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types type V (QDiagram b v n m) = v
type V (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types type V (SubMap b v n m) = v
type V (Subdiagram b v n m)
Instance details Defined in Diagrams.Core.Types type V (Subdiagram b v n m) = v

type Vn a = V a (N a) #

class Alignable a where #

Minimal complete definition

defaultBoundary

Methods

alignBy' :: (InSpace v n a, Fractional n, HasOrigin a) => (v n -> a -> Point v n) -> v n -> n -> a -> a #

defaultBoundary :: (V a ~ v, N a ~ n) => v n -> a -> Point v n #

alignBy :: (InSpace v n a, Fractional n, HasOrigin a) => v n -> n -> a -> a #

Instances

(V b ~ v, N b ~ n, Metric v, OrderedField n, Alignable b) => Alignable [b]
Instance details Defined in Diagrams.Align Methods alignBy' :: (InSpace v n [b], Fractional n, HasOrigin [b]) => (v n -> [b] -> Point v n) -> v n -> n -> [b] -> [b] # defaultBoundary :: (V [b] ~ v, N [b] ~ n) => v n -> [b] -> Point v n # alignBy :: (InSpace v n [b], Fractional n, HasOrigin [b]) => v n -> n -> [b] -> [b] #
(V b ~ v, N b ~ n, Metric v, OrderedField n, Alignable b) => Alignable (Set b)
Instance details Defined in Diagrams.Align Methods alignBy' :: (InSpace v n (Set b), Fractional n, HasOrigin (Set b)) => (v n -> Set b -> Point v n) -> v n -> n -> Set b -> Set b # defaultBoundary :: (V (Set b) ~ v, N (Set b) ~ n) => v n -> Set b -> Point v n # alignBy :: (InSpace v n (Set b), Fractional n, HasOrigin (Set b)) => v n -> n -> Set b -> Set b #
Alignable a => Alignable (Located a)
Instance details Defined in Diagrams.Located Methods alignBy' :: (InSpace v n (Located a), Fractional n, HasOrigin (Located a)) => (v n -> Located a -> Point v n) -> v n -> n -> Located a -> Located a # defaultBoundary :: (V (Located a) ~ v, N (Located a) ~ n) => v n -> Located a -> Point v n # alignBy :: (InSpace v n (Located a), Fractional n, HasOrigin (Located a)) => v n -> n -> Located a -> Located a #
(InSpace v n a, HasOrigin a, Alignable a) => Alignable (b -> a)
Instance details Defined in Diagrams.Align Methods alignBy' :: (InSpace v n (b -> a), Fractional n, HasOrigin (b -> a)) => (v n -> (b -> a) -> Point v n) -> v n -> n -> (b -> a) -> b -> a # defaultBoundary :: (V (b -> a) ~ v, N (b -> a) ~ n) => v n -> (b -> a) -> Point v n # alignBy :: (InSpace v n (b -> a), Fractional n, HasOrigin (b -> a)) => v n -> n -> (b -> a) -> b -> a #
(V b ~ v, N b ~ n, Metric v, OrderedField n, Alignable b) => Alignable (Map k b)
Instance details Defined in Diagrams.Align Methods alignBy' :: (InSpace v n (Map k b), Fractional n, HasOrigin (Map k b)) => (v n -> Map k b -> Point v n) -> v n -> n -> Map k b -> Map k b # defaultBoundary :: (V (Map k b) ~ v, N (Map k b) ~ n) => v n -> Map k b -> Point v n # alignBy :: (InSpace v n (Map k b), Fractional n, HasOrigin (Map k b)) => v n -> n -> Map k b -> Map k b #
(Metric v, OrderedField n) => Alignable (Envelope v n)
Instance details Defined in Diagrams.Align Methods alignBy' :: (InSpace v0 n0 (Envelope v n), Fractional n0, HasOrigin (Envelope v n)) => (v0 n0 -> Envelope v n -> Point v0 n0) -> v0 n0 -> n0 -> Envelope v n -> Envelope v n # defaultBoundary :: (V (Envelope v n) ~ v0, N (Envelope v n) ~ n0) => v0 n0 -> Envelope v n -> Point v0 n0 # alignBy :: (InSpace v0 n0 (Envelope v n), Fractional n0, HasOrigin (Envelope v n)) => v0 n0 -> n0 -> Envelope v n -> Envelope v n #
(Metric v, OrderedField n) => Alignable (Trace v n)
Instance details Defined in Diagrams.Align Methods alignBy' :: (InSpace v0 n0 (Trace v n), Fractional n0, HasOrigin (Trace v n)) => (v0 n0 -> Trace v n -> Point v0 n0) -> v0 n0 -> n0 -> Trace v n -> Trace v n # defaultBoundary :: (V (Trace v n) ~ v0, N (Trace v n) ~ n0) => v0 n0 -> Trace v n -> Point v0 n0 # alignBy :: (InSpace v0 n0 (Trace v n), Fractional n0, HasOrigin (Trace v n)) => v0 n0 -> n0 -> Trace v n -> Trace v n #
(Metric v, Traversable v, OrderedField n) => Alignable (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox Methods alignBy' :: (InSpace v0 n0 (BoundingBox v n), Fractional n0, HasOrigin (BoundingBox v n)) => (v0 n0 -> BoundingBox v n -> Point v0 n0) -> v0 n0 -> n0 -> BoundingBox v n -> BoundingBox v n # defaultBoundary :: (V (BoundingBox v n) ~ v0, N (BoundingBox v n) ~ n0) => v0 n0 -> BoundingBox v n -> Point v0 n0 # alignBy :: (InSpace v0 n0 (BoundingBox v n), Fractional n0, HasOrigin (BoundingBox v n)) => v0 n0 -> n0 -> BoundingBox v n -> BoundingBox v n #
(Metric v, OrderedField n) => Alignable (Path v n)
Instance details Defined in Diagrams.Path Methods alignBy' :: (InSpace v0 n0 (Path v n), Fractional n0, HasOrigin (Path v n)) => (v0 n0 -> Path v n -> Point v0 n0) -> v0 n0 -> n0 -> Path v n -> Path v n # defaultBoundary :: (V (Path v n) ~ v0, N (Path v n) ~ n0) => v0 n0 -> Path v n -> Point v0 n0 # alignBy :: (InSpace v0 n0 (Path v n), Fractional n0, HasOrigin (Path v n)) => v0 n0 -> n0 -> Path v n -> Path v n #
(Metric v, OrderedField n, Monoid' m) => Alignable (QDiagram b v n m)
Instance details Defined in Diagrams.Align Methods alignBy' :: (InSpace v0 n0 (QDiagram b v n m), Fractional n0, HasOrigin (QDiagram b v n m)) => (v0 n0 -> QDiagram b v n m -> Point v0 n0) -> v0 n0 -> n0 -> QDiagram b v n m -> QDiagram b v n m # defaultBoundary :: (V (QDiagram b v n m) ~ v0, N (QDiagram b v n m) ~ n0) => v0 n0 -> QDiagram b v n m -> Point v0 n0 # alignBy :: (InSpace v0 n0 (QDiagram b v n m), Fractional n0, HasOrigin (QDiagram b v n m)) => v0 n0 -> n0 -> QDiagram b v n m -> QDiagram b v n m #

data Angle n #

Instances

Functor Angle
Instance details Defined in Diagrams.Angle Methods fmap :: (a -> b) -> Angle a -> Angle b # (<$) :: a -> Angle b -> Angle a #
Applicative Angle
Instance details Defined in Diagrams.Angle Methods pure :: a -> Angle a # (<>) :: Angle (a -> b) -> Angle a -> Angle b # liftA2 :: (a -> b -> c) -> Angle a -> Angle b -> Angle c # (>) :: Angle a -> Angle b -> Angle b # (<*) :: Angle a -> Angle b -> Angle a #
Additive Angle
Instance details Defined in Diagrams.Angle Methods zero :: Num a => Angle a # (^+^) :: Num a => Angle a -> Angle a -> Angle a # (^-^) :: Num a => Angle a -> Angle a -> Angle a # lerp :: Num a => a -> Angle a -> Angle a -> Angle a # liftU2 :: (a -> a -> a) -> Angle a -> Angle a -> Angle a # liftI2 :: (a -> b -> c) -> Angle a -> Angle b -> Angle c #
Enum n => Enum (Angle n)
Instance details Defined in Diagrams.Angle Methods succ :: Angle n -> Angle n # pred :: Angle n -> Angle n # toEnum :: Int -> Angle n # fromEnum :: Angle n -> Int # enumFrom :: Angle n -> [Angle n] # enumFromThen :: Angle n -> Angle n -> [Angle n] # enumFromTo :: Angle n -> Angle n -> [Angle n] # enumFromThenTo :: Angle n -> Angle n -> Angle n -> [Angle n] #
Eq n => Eq (Angle n)
Instance details Defined in Diagrams.Angle Methods (==) :: Angle n -> Angle n -> Bool # (/=) :: Angle n -> Angle n -> Bool #
Ord n => Ord (Angle n)
Instance details Defined in Diagrams.Angle Methods compare :: Angle n -> Angle n -> Ordering # (<) :: Angle n -> Angle n -> Bool # (<=) :: Angle n -> Angle n -> Bool # (>) :: Angle n -> Angle n -> Bool # (>=) :: Angle n -> Angle n -> Bool # max :: Angle n -> Angle n -> Angle n # min :: Angle n -> Angle n -> Angle n #
Read n => Read (Angle n)
Instance details Defined in Diagrams.Angle Methods readsPrec :: Int -> ReadS (Angle n) # readList :: ReadS [Angle n] # readPrec :: ReadPrec (Angle n) # readListPrec :: ReadPrec [Angle n] #
Show n => Show (Angle n)
Instance details Defined in Diagrams.Angle Methods showsPrec :: Int -> Angle n -> ShowS # show :: Angle n -> String # showList :: [Angle n] -> ShowS #
Num n => Semigroup (Angle n)
Instance details Defined in Diagrams.Angle Methods (<>) :: Angle n -> Angle n -> Angle n # sconcat :: NonEmpty (Angle n) -> Angle n # stimes :: Integral b => b -> Angle n -> Angle n #
Num n => Monoid (Angle n)
Instance details Defined in Diagrams.Angle Methods mempty :: Angle n # mappend :: Angle n -> Angle n -> Angle n # mconcat :: [Angle n] -> Angle n #
(V t ~ V2, N t ~ n, Transformable t, Floating n) => Action (Angle n) t
Instance details Defined in Diagrams.Angle Methods act :: Angle n -> t -> t
type N (Angle n)
Instance details Defined in Diagrams.Angle type N (Angle n) = n

class HasTheta t => HasPhi (t :: Type -> Type) where #

Methods

_phi :: RealFloat n => Lens' (t n) (Angle n) #

Instances

HasPhi v => HasPhi (Direction v)
Instance details Defined in Diagrams.Direction Methods _phi :: RealFloat n => Lens' (Direction v n) (Angle n) #
HasPhi v => HasPhi (Point v)
Instance details Defined in Diagrams.Angle Methods _phi :: RealFloat n => Lens' (Point v n) (Angle n) #

class HasTheta (t :: Type -> Type) where #

Methods

_theta :: RealFloat n => Lens' (t n) (Angle n) #

Instances

HasTheta v => HasTheta (Direction v)
Instance details Defined in Diagrams.Direction Methods _theta :: RealFloat n => Lens' (Direction v n) (Angle n) #
HasTheta v => HasTheta (Point v)
Instance details Defined in Diagrams.Angle Methods _theta :: RealFloat n => Lens' (Point v n) (Angle n) #

type Animation b (v :: Type -> Type) n = QAnimation b v n Any #

type QAnimation b (v :: Type -> Type) n m = Active (QDiagram b v n m) #

class Color c where #

Methods

toAlphaColour :: c -> AlphaColour Double #

fromAlphaColour :: AlphaColour Double -> c #

Instances

Color SomeColor
Instance details Defined in Diagrams.Attributes Methods toAlphaColour :: SomeColor -> AlphaColour Double # fromAlphaColour :: AlphaColour Double -> SomeColor #
a ~ Double => Color (AlphaColour a)
Instance details Defined in Diagrams.Attributes Methods toAlphaColour :: AlphaColour a -> AlphaColour Double # fromAlphaColour :: AlphaColour Double -> AlphaColour a #
a ~ Double => Color (Colour a)
Instance details Defined in Diagrams.Attributes Methods toAlphaColour :: Colour a -> AlphaColour Double # fromAlphaColour :: AlphaColour Double -> Colour a #

data Dashing n #

Constructors

Dashing [n] n

Instances

Functor Dashing
Instance details Defined in Diagrams.Attributes Methods fmap :: (a -> b) -> Dashing a -> Dashing b # (<$) :: a -> Dashing b -> Dashing a #
Eq n => Eq (Dashing n)
Instance details Defined in Diagrams.Attributes Methods (==) :: Dashing n -> Dashing n -> Bool # (/=) :: Dashing n -> Dashing n -> Bool #
Semigroup (Dashing n)
Instance details Defined in Diagrams.Attributes Methods (<>) :: Dashing n -> Dashing n -> Dashing n # sconcat :: NonEmpty (Dashing n) -> Dashing n # stimes :: Integral b => b -> Dashing n -> Dashing n #
Typeable n => AttributeClass (Dashing n)
Instance details Defined in Diagrams.Attributes

data FillOpacity #

Instances

Semigroup FillOpacity
Instance details Defined in Diagrams.Attributes Methods (<>) :: FillOpacity -> FillOpacity -> FillOpacity # sconcat :: NonEmpty FillOpacity -> FillOpacity # stimes :: Integral b => b -> FillOpacity -> FillOpacity #
AttributeClass FillOpacity
Instance details Defined in Diagrams.Attributes

data LineCap #

Constructors

LineCapButt
LineCapRound
LineCapSquare

Instances

Eq LineCap
Instance details Defined in Diagrams.Attributes Methods (==) :: LineCap -> LineCap -> Bool # (/=) :: LineCap -> LineCap -> Bool #
Ord LineCap
Instance details Defined in Diagrams.Attributes Methods compare :: LineCap -> LineCap -> Ordering # (<) :: LineCap -> LineCap -> Bool # (<=) :: LineCap -> LineCap -> Bool # (>) :: LineCap -> LineCap -> Bool # (>=) :: LineCap -> LineCap -> Bool # max :: LineCap -> LineCap -> LineCap # min :: LineCap -> LineCap -> LineCap #
Show LineCap
Instance details Defined in Diagrams.Attributes Methods showsPrec :: Int -> LineCap -> ShowS # show :: LineCap -> String # showList :: [LineCap] -> ShowS #
Semigroup LineCap
Instance details Defined in Diagrams.Attributes Methods (<>) :: LineCap -> LineCap -> LineCap # sconcat :: NonEmpty LineCap -> LineCap # stimes :: Integral b => b -> LineCap -> LineCap #
Default LineCap
Instance details Defined in Diagrams.Attributes Methods def :: LineCap #
AttributeClass LineCap
Instance details Defined in Diagrams.Attributes

data LineJoin #

Constructors

LineJoinMiter
LineJoinRound
LineJoinBevel

Instances

Eq LineJoin
Instance details Defined in Diagrams.Attributes Methods (==) :: LineJoin -> LineJoin -> Bool # (/=) :: LineJoin -> LineJoin -> Bool #
Ord LineJoin
Instance details Defined in Diagrams.Attributes Methods compare :: LineJoin -> LineJoin -> Ordering # (<) :: LineJoin -> LineJoin -> Bool # (<=) :: LineJoin -> LineJoin -> Bool # (>) :: LineJoin -> LineJoin -> Bool # (>=) :: LineJoin -> LineJoin -> Bool # max :: LineJoin -> LineJoin -> LineJoin # min :: LineJoin -> LineJoin -> LineJoin #
Show LineJoin
Instance details Defined in Diagrams.Attributes Methods showsPrec :: Int -> LineJoin -> ShowS # show :: LineJoin -> String # showList :: [LineJoin] -> ShowS #
Semigroup LineJoin
Instance details Defined in Diagrams.Attributes Methods (<>) :: LineJoin -> LineJoin -> LineJoin # sconcat :: NonEmpty LineJoin -> LineJoin # stimes :: Integral b => b -> LineJoin -> LineJoin #
Default LineJoin
Instance details Defined in Diagrams.Attributes Methods def :: LineJoin #
AttributeClass LineJoin
Instance details Defined in Diagrams.Attributes

newtype LineMiterLimit #

Constructors

LineMiterLimit (Last Double)

Instances

Eq LineMiterLimit
Instance details Defined in Diagrams.Attributes Methods (==) :: LineMiterLimit -> LineMiterLimit -> Bool # (/=) :: LineMiterLimit -> LineMiterLimit -> Bool #
Ord LineMiterLimit
Instance details Defined in Diagrams.Attributes Methods compare :: LineMiterLimit -> LineMiterLimit -> Ordering # (<) :: LineMiterLimit -> LineMiterLimit -> Bool # (<=) :: LineMiterLimit -> LineMiterLimit -> Bool # (>) :: LineMiterLimit -> LineMiterLimit -> Bool # (>=) :: LineMiterLimit -> LineMiterLimit -> Bool # max :: LineMiterLimit -> LineMiterLimit -> LineMiterLimit # min :: LineMiterLimit -> LineMiterLimit -> LineMiterLimit #
Semigroup LineMiterLimit
Instance details Defined in Diagrams.Attributes Methods (<>) :: LineMiterLimit -> LineMiterLimit -> LineMiterLimit # sconcat :: NonEmpty LineMiterLimit -> LineMiterLimit # stimes :: Integral b => b -> LineMiterLimit -> LineMiterLimit #
Default LineMiterLimit
Instance details Defined in Diagrams.Attributes Methods def :: LineMiterLimit #
AttributeClass LineMiterLimit
Instance details Defined in Diagrams.Attributes

data LineWidth n #

Instances

Semigroup (LineWidth n)
Instance details Defined in Diagrams.Attributes Methods (<>) :: LineWidth n -> LineWidth n -> LineWidth n # sconcat :: NonEmpty (LineWidth n) -> LineWidth n # stimes :: Integral b => b -> LineWidth n -> LineWidth n #
OrderedField n => Default (LineWidthM n)
Instance details Defined in Diagrams.Attributes Methods def :: LineWidthM n #
Typeable n => AttributeClass (LineWidth n)
Instance details Defined in Diagrams.Attributes

data Opacity #

Instances

Semigroup Opacity
Instance details Defined in Diagrams.Attributes Methods (<>) :: Opacity -> Opacity -> Opacity # sconcat :: NonEmpty Opacity -> Opacity # stimes :: Integral b => b -> Opacity -> Opacity #
AttributeClass Opacity
Instance details Defined in Diagrams.Attributes

data SomeColor where #

Constructors

SomeColor :: forall c. Color c => c -> SomeColor

Instances

Show SomeColor
Instance details Defined in Diagrams.Attributes Methods showsPrec :: Int -> SomeColor -> ShowS # show :: SomeColor -> String # showList :: [SomeColor] -> ShowS #
Color SomeColor
Instance details Defined in Diagrams.Attributes Methods toAlphaColour :: SomeColor -> AlphaColour Double # fromAlphaColour :: AlphaColour Double -> SomeColor #

data StrokeOpacity #

Instances

Semigroup StrokeOpacity
Instance details Defined in Diagrams.Attributes Methods (<>) :: StrokeOpacity -> StrokeOpacity -> StrokeOpacity # sconcat :: NonEmpty StrokeOpacity -> StrokeOpacity # stimes :: Integral b => b -> StrokeOpacity -> StrokeOpacity #
AttributeClass StrokeOpacity
Instance details Defined in Diagrams.Attributes

data BoundingBox (v :: Type -> Type) n #

Instances

Functor v => Functor (BoundingBox v)
Instance details Defined in Diagrams.BoundingBox Methods fmap :: (a -> b) -> BoundingBox v a -> BoundingBox v b # (<$) :: a -> BoundingBox v b -> BoundingBox v a #
Eq (v n) => Eq (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox Methods (==) :: BoundingBox v n -> BoundingBox v n -> Bool # (/=) :: BoundingBox v n -> BoundingBox v n -> Bool #
Read (v n) => Read (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox Methods readsPrec :: Int -> ReadS (BoundingBox v n) # readList :: ReadS [BoundingBox v n] # readPrec :: ReadPrec (BoundingBox v n) # readListPrec :: ReadPrec [BoundingBox v n] #
Show (v n) => Show (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox Methods showsPrec :: Int -> BoundingBox v n -> ShowS # show :: BoundingBox v n -> String # showList :: [BoundingBox v n] -> ShowS #
(Additive v, Ord n) => Semigroup (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox Methods (<>) :: BoundingBox v n -> BoundingBox v n -> BoundingBox v n # sconcat :: NonEmpty (BoundingBox v n) -> BoundingBox v n # stimes :: Integral b => b -> BoundingBox v n -> BoundingBox v n #
(Additive v, Ord n) => Monoid (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox Methods mempty :: BoundingBox v n # mappend :: BoundingBox v n -> BoundingBox v n -> BoundingBox v n # mconcat :: [BoundingBox v n] -> BoundingBox v n #
(Metric v, Traversable v, OrderedField n) => Enveloped (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox Methods getEnvelope :: BoundingBox v n -> Envelope (V (BoundingBox v n)) (N (BoundingBox v n)) #
(Additive v, Num n) => HasOrigin (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox Methods moveOriginTo :: Point (V (BoundingBox v n)) (N (BoundingBox v n)) -> BoundingBox v n -> BoundingBox v n #
RealFloat n => Traced (BoundingBox V2 n)
Instance details Defined in Diagrams.BoundingBox Methods getTrace :: BoundingBox V2 n -> Trace (V (BoundingBox V2 n)) (N (BoundingBox V2 n)) #
TypeableFloat n => Traced (BoundingBox V3 n)
Instance details Defined in Diagrams.BoundingBox Methods getTrace :: BoundingBox V3 n -> Trace (V (BoundingBox V3 n)) (N (BoundingBox V3 n)) #
(Metric v, Traversable v, OrderedField n) => Alignable (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox Methods alignBy' :: (InSpace v0 n0 (BoundingBox v n), Fractional n0, HasOrigin (BoundingBox v n)) => (v0 n0 -> BoundingBox v n -> Point v0 n0) -> v0 n0 -> n0 -> BoundingBox v n -> BoundingBox v n # defaultBoundary :: (V (BoundingBox v n) ~ v0, N (BoundingBox v n) ~ n0) => v0 n0 -> BoundingBox v n -> Point v0 n0 # alignBy :: (InSpace v0 n0 (BoundingBox v n), Fractional n0, HasOrigin (BoundingBox v n)) => v0 n0 -> n0 -> BoundingBox v n -> BoundingBox v n #
AsEmpty (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox Methods _Empty :: Prism' (BoundingBox v n) () #
(Additive v, Foldable v, Ord n) => HasQuery (BoundingBox v n) Any
Instance details Defined in Diagrams.BoundingBox Methods getQuery :: BoundingBox v n -> Query (V (BoundingBox v n)) (N (BoundingBox v n)) Any #
(Additive v', Foldable v', Ord n') => Each (BoundingBox v n) (BoundingBox v' n') (Point v n) (Point v' n')
Instance details Defined in Diagrams.BoundingBox Methods each :: Traversal (BoundingBox v n) (BoundingBox v' n') (Point v n) (Point v' n') #
type N (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox type N (BoundingBox v n) = n
type V (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox type V (BoundingBox v n) = v

data CatMethod #

Constructors

Cat
Distrib

data CatOpts n #

Instances

Num n => Default (CatOpts n)
Instance details Defined in Diagrams.Combinators Methods def :: CatOpts n #

data a :& b #

Constructors

a :& b

Instances

(Eq a, Eq b) => Eq (a :& b)
Instance details Defined in Diagrams.Coordinates Methods (==) :: (a :& b) -> (a :& b) -> Bool # (/=) :: (a :& b) -> (a :& b) -> Bool #
(Ord a, Ord b) => Ord (a :& b)
Instance details Defined in Diagrams.Coordinates Methods compare :: (a :& b) -> (a :& b) -> Ordering # (<) :: (a :& b) -> (a :& b) -> Bool # (<=) :: (a :& b) -> (a :& b) -> Bool # (>) :: (a :& b) -> (a :& b) -> Bool # (>=) :: (a :& b) -> (a :& b) -> Bool # max :: (a :& b) -> (a :& b) -> a :& b # min :: (a :& b) -> (a :& b) -> a :& b #
(Show a, Show b) => Show (a :& b)
Instance details Defined in Diagrams.Coordinates Methods showsPrec :: Int -> (a :& b) -> ShowS # show :: (a :& b) -> String # showList :: [a :& b] -> ShowS #
Coordinates (a :& b)
Instance details Defined in Diagrams.Coordinates Associated Types type FinalCoord (a :& b) :: Type # type PrevDim (a :& b) :: Type # type Decomposition (a :& b) :: Type # Methods (^&) :: PrevDim (a :& b) -> FinalCoord (a :& b) -> a :& b # pr :: PrevDim (a :& b) -> FinalCoord (a :& b) -> a :& b # coords :: (a :& b) -> Decomposition (a :& b) #
type Decomposition (a :& b)
Instance details Defined in Diagrams.Coordinates type Decomposition (a :& b) = a :& b
type FinalCoord (a :& b)
Instance details Defined in Diagrams.Coordinates type FinalCoord (a :& b) = b
type PrevDim (a :& b)
Instance details Defined in Diagrams.Coordinates type PrevDim (a :& b) = a

class Coordinates c where #

Minimal complete definition

(^&), coords

Associated Types

type FinalCoord c :: Type #

type PrevDim c :: Type #

type Decomposition c :: Type #

Methods

(^&) :: PrevDim c -> FinalCoord c -> c #

pr :: PrevDim c -> FinalCoord c -> c #

coords :: c -> Decomposition c #

Instances

Coordinates (V2 n)
Instance details Defined in Diagrams.Coordinates Associated Types type FinalCoord (V2 n) :: Type # type PrevDim (V2 n) :: Type # type Decomposition (V2 n) :: Type # Methods (^&) :: PrevDim (V2 n) -> FinalCoord (V2 n) -> V2 n # pr :: PrevDim (V2 n) -> FinalCoord (V2 n) -> V2 n # coords :: V2 n -> Decomposition (V2 n) #
Coordinates (V3 n)
Instance details Defined in Diagrams.Coordinates Associated Types type FinalCoord (V3 n) :: Type # type PrevDim (V3 n) :: Type # type Decomposition (V3 n) :: Type # Methods (^&) :: PrevDim (V3 n) -> FinalCoord (V3 n) -> V3 n # pr :: PrevDim (V3 n) -> FinalCoord (V3 n) -> V3 n # coords :: V3 n -> Decomposition (V3 n) #
Coordinates (V4 n)
Instance details Defined in Diagrams.Coordinates Associated Types type FinalCoord (V4 n) :: Type # type PrevDim (V4 n) :: Type # type Decomposition (V4 n) :: Type # Methods (^&) :: PrevDim (V4 n) -> FinalCoord (V4 n) -> V4 n # pr :: PrevDim (V4 n) -> FinalCoord (V4 n) -> V4 n # coords :: V4 n -> Decomposition (V4 n) #
Coordinates (a, b)
Instance details Defined in Diagrams.Coordinates Associated Types type FinalCoord (a, b) :: Type # type PrevDim (a, b) :: Type # type Decomposition (a, b) :: Type # Methods (^&) :: PrevDim (a, b) -> FinalCoord (a, b) -> (a, b) # pr :: PrevDim (a, b) -> FinalCoord (a, b) -> (a, b) # coords :: (a, b) -> Decomposition (a, b) #
Coordinates (a :& b)
Instance details Defined in Diagrams.Coordinates Associated Types type FinalCoord (a :& b) :: Type # type PrevDim (a :& b) :: Type # type Decomposition (a :& b) :: Type # Methods (^&) :: PrevDim (a :& b) -> FinalCoord (a :& b) -> a :& b # pr :: PrevDim (a :& b) -> FinalCoord (a :& b) -> a :& b # coords :: (a :& b) -> Decomposition (a :& b) #
Coordinates (v n) => Coordinates (Point v n)
Instance details Defined in Diagrams.Coordinates Associated Types type FinalCoord (Point v n) :: Type # type PrevDim (Point v n) :: Type # type Decomposition (Point v n) :: Type # Methods (^&) :: PrevDim (Point v n) -> FinalCoord (Point v n) -> Point v n # pr :: PrevDim (Point v n) -> FinalCoord (Point v n) -> Point v n # coords :: Point v n -> Decomposition (Point v n) #
Coordinates (a, b, c)
Instance details Defined in Diagrams.Coordinates Associated Types type FinalCoord (a, b, c) :: Type # type PrevDim (a, b, c) :: Type # type Decomposition (a, b, c) :: Type # Methods (^&) :: PrevDim (a, b, c) -> FinalCoord (a, b, c) -> (a, b, c) # pr :: PrevDim (a, b, c) -> FinalCoord (a, b, c) -> (a, b, c) # coords :: (a, b, c) -> Decomposition (a, b, c) #
Coordinates (a, b, c, d)
Instance details Defined in Diagrams.Coordinates Associated Types type FinalCoord (a, b, c, d) :: Type # type PrevDim (a, b, c, d) :: Type # type Decomposition (a, b, c, d) :: Type # Methods (^&) :: PrevDim (a, b, c, d) -> FinalCoord (a, b, c, d) -> (a, b, c, d) # pr :: PrevDim (a, b, c, d) -> FinalCoord (a, b, c, d) -> (a, b, c, d) # coords :: (a, b, c, d) -> Decomposition (a, b, c, d) #

type BSpline (v :: Type -> Type) n = [Point v n] #

class Deformable a b where #

Methods

deform' :: N a -> Deformation (V a) (V b) (N a) -> a -> b #

deform :: Deformation (V a) (V b) (N a) -> a -> b #

Instances

(Metric v, Metric u, OrderedField n, r ~ Located (Trail u n)) => Deformable (Located (Trail v n)) r
Instance details Defined in Diagrams.Deform Methods deform' :: N (Located (Trail v n)) -> Deformation (V (Located (Trail v n))) (V r) (N (Located (Trail v n))) -> Located (Trail v n) -> r # deform :: Deformation (V (Located (Trail v n))) (V r) (N (Located (Trail v n))) -> Located (Trail v n) -> r #
(Metric v, Metric u, OrderedField n, r ~ Path u n) => Deformable (Path v n) r
Instance details Defined in Diagrams.Deform Methods deform' :: N (Path v n) -> Deformation (V (Path v n)) (V r) (N (Path v n)) -> Path v n -> r # deform :: Deformation (V (Path v n)) (V r) (N (Path v n)) -> Path v n -> r #
r ~ Point u n => Deformable (Point v n) r
Instance details Defined in Diagrams.Deform Methods deform' :: N (Point v n) -> Deformation (V (Point v n)) (V r) (N (Point v n)) -> Point v n -> r # deform :: Deformation (V (Point v n)) (V r) (N (Point v n)) -> Point v n -> r #

newtype Deformation (v :: Type -> Type) (u :: Type -> Type) n #

Constructors

Deformation (Point v n -> Point u n)

Instances

Semigroup (Deformation v v n)
Instance details Defined in Diagrams.Deform Methods (<>) :: Deformation v v n -> Deformation v v n -> Deformation v v n # sconcat :: NonEmpty (Deformation v v n) -> Deformation v v n # stimes :: Integral b => b -> Deformation v v n -> Deformation v v n #
Monoid (Deformation v v n)
Instance details Defined in Diagrams.Deform Methods mempty :: Deformation v v n # mappend :: Deformation v v n -> Deformation v v n -> Deformation v v n # mconcat :: [Deformation v v n] -> Deformation v v n #

data Direction (v :: Type -> Type) n #

Instances

Functor v => Functor (Direction v)
Instance details Defined in Diagrams.Direction Methods fmap :: (a -> b) -> Direction v a -> Direction v b # (<$) :: a -> Direction v b -> Direction v a #
HasPhi v => HasPhi (Direction v)
Instance details Defined in Diagrams.Direction Methods _phi :: RealFloat n => Lens' (Direction v n) (Angle n) #
HasTheta v => HasTheta (Direction v)
Instance details Defined in Diagrams.Direction Methods _theta :: RealFloat n => Lens' (Direction v n) (Angle n) #
Eq (v n) => Eq (Direction v n)
Instance details Defined in Diagrams.Direction Methods (==) :: Direction v n -> Direction v n -> Bool # (/=) :: Direction v n -> Direction v n -> Bool #
Ord (v n) => Ord (Direction v n)
Instance details Defined in Diagrams.Direction Methods compare :: Direction v n -> Direction v n -> Ordering # (<) :: Direction v n -> Direction v n -> Bool # (<=) :: Direction v n -> Direction v n -> Bool # (>) :: Direction v n -> Direction v n -> Bool # (>=) :: Direction v n -> Direction v n -> Bool # max :: Direction v n -> Direction v n -> Direction v n # min :: Direction v n -> Direction v n -> Direction v n #
Read (v n) => Read (Direction v n)
Instance details Defined in Diagrams.Direction Methods readsPrec :: Int -> ReadS (Direction v n) # readList :: ReadS [Direction v n] # readPrec :: ReadPrec (Direction v n) # readListPrec :: ReadPrec [Direction v n] #
Show (v n) => Show (Direction v n)
Instance details Defined in Diagrams.Direction Methods showsPrec :: Int -> Direction v n -> ShowS # show :: Direction v n -> String # showList :: [Direction v n] -> ShowS #
(V (v n) ~ v, N (v n) ~ n, Transformable (v n)) => Transformable (Direction v n)
Instance details Defined in Diagrams.Direction Methods transform :: Transformation (V (Direction v n)) (N (Direction v n)) -> Direction v n -> Direction v n #
type N (Direction v n)
Instance details Defined in Diagrams.Direction type N (Direction v n) = n
type V (Direction v n)
Instance details Defined in Diagrams.Direction type V (Direction v n) = v

data Located a #

Constructors

Loc
Fields loc :: Point (V a) (N a) unLoc :: a

Instances

(Eq (V a (N a)), Eq a) => Eq (Located a)
Instance details Defined in Diagrams.Located Methods (==) :: Located a -> Located a -> Bool # (/=) :: Located a -> Located a -> Bool #
(Ord (V a (N a)), Ord a) => Ord (Located a)
Instance details Defined in Diagrams.Located Methods compare :: Located a -> Located a -> Ordering # (<) :: Located a -> Located a -> Bool # (<=) :: Located a -> Located a -> Bool # (>) :: Located a -> Located a -> Bool # (>=) :: Located a -> Located a -> Bool # max :: Located a -> Located a -> Located a # min :: Located a -> Located a -> Located a #
(Read (V a (N a)), Read a) => Read (Located a)
Instance details Defined in Diagrams.Located Methods readsPrec :: Int -> ReadS (Located a) # readList :: ReadS [Located a] # readPrec :: ReadPrec (Located a) # readListPrec :: ReadPrec [Located a] #
(Show (V a (N a)), Show a) => Show (Located a)
Instance details Defined in Diagrams.Located Methods showsPrec :: Int -> Located a -> ShowS # show :: Located a -> String # showList :: [Located a] -> ShowS #
Generic (Located a)
Instance details Defined in Diagrams.Located Associated Types type Rep (Located a) :: Type -> Type # Methods from :: Located a -> Rep (Located a) x # to :: Rep (Located a) x -> Located a #
Enveloped a => Enveloped (Located a)
Instance details Defined in Diagrams.Located Methods getEnvelope :: Located a -> Envelope (V (Located a)) (N (Located a)) #
(Num (N a), Additive (V a)) => HasOrigin (Located a)
Instance details Defined in Diagrams.Located Methods moveOriginTo :: Point (V (Located a)) (N (Located a)) -> Located a -> Located a #
Enveloped a => Juxtaposable (Located a)
Instance details Defined in Diagrams.Located Methods juxtapose :: Vn (Located a) -> Located a -> Located a -> Located a #
Qualifiable a => Qualifiable (Located a)
Instance details Defined in Diagrams.Located Methods (.>>) :: IsName a0 => a0 -> Located a -> Located a #
(Traced a, Num (N a)) => Traced (Located a)
Instance details Defined in Diagrams.Located Methods getTrace :: Located a -> Trace (V (Located a)) (N (Located a)) #
(Additive (V a), Num (N a), Transformable a) => Transformable (Located a)
Instance details Defined in Diagrams.Located Methods transform :: Transformation (V (Located a)) (N (Located a)) -> Located a -> Located a #
Alignable a => Alignable (Located a)
Instance details Defined in Diagrams.Located Methods alignBy' :: (InSpace v n (Located a), Fractional n, HasOrigin (Located a)) => (v n -> Located a -> Point v n) -> v n -> n -> Located a -> Located a # defaultBoundary :: (V (Located a) ~ v, N (Located a) ~ n) => v n -> Located a -> Point v n # alignBy :: (InSpace v n (Located a), Fractional n, HasOrigin (Located a)) => v n -> n -> Located a -> Located a #
DomainBounds a => DomainBounds (Located a)
Instance details Defined in Diagrams.Located Methods domainLower :: Located a -> N (Located a) # domainUpper :: Located a -> N (Located a) #
(InSpace v n a, EndValues a, Codomain a ~ v) => EndValues (Located a)
Instance details Defined in Diagrams.Located Methods atStart :: Located a -> Codomain (Located a) (N (Located a)) # atEnd :: Located a -> Codomain (Located a) (N (Located a)) #
(DomainBounds t, EndValues (Tangent t)) => EndValues (Tangent (Located t))
Instance details Defined in Diagrams.Tangent Methods atStart :: Tangent (Located t) -> Codomain (Tangent (Located t)) (N (Tangent (Located t))) # atEnd :: Tangent (Located t) -> Codomain (Tangent (Located t)) (N (Tangent (Located t))) #
(InSpace v n a, Fractional n, HasArcLength a, Codomain a ~ v) => HasArcLength (Located a)
Instance details Defined in Diagrams.Located Methods arcLengthBounded :: N (Located a) -> Located a -> Interval (N (Located a)) # arcLength :: N (Located a) -> Located a -> N (Located a) # stdArcLength :: Located a -> N (Located a) # arcLengthToParam :: N (Located a) -> Located a -> N (Located a) -> N (Located a) # stdArcLengthToParam :: Located a -> N (Located a) -> N (Located a) #
(InSpace v n a, Parametric a, Codomain a ~ v) => Parametric (Located a)
Instance details Defined in Diagrams.Located Methods atParam :: Located a -> N (Located a) -> Codomain (Located a) (N (Located a)) #
Parametric (Tangent t) => Parametric (Tangent (Located t))
Instance details Defined in Diagrams.Tangent Methods atParam :: Tangent (Located t) -> N (Tangent (Located t)) -> Codomain (Tangent (Located t)) (N (Tangent (Located t))) #
(InSpace v n a, Fractional n, Parametric a, Sectionable a, Codomain a ~ v) => Sectionable (Located a)
Instance details Defined in Diagrams.Located Methods splitAtParam :: Located a -> N (Located a) -> (Located a, Located a) # section :: Located a -> N (Located a) -> N (Located a) -> Located a # reverseDomain :: Located a -> Located a #
ToPath (Located [Segment Closed v n])
Instance details Defined in Diagrams.Path Methods toPath :: Located [Segment Closed v n] -> Path (V (Located [Segment Closed v n])) (N (Located [Segment Closed v n])) #
ToPath (Located (Segment Closed v n))
Instance details Defined in Diagrams.Path Methods toPath :: Located (Segment Closed v n) -> Path (V (Located (Segment Closed v n))) (N (Located (Segment Closed v n))) #
ToPath (Located (Trail v n))
Instance details Defined in Diagrams.Path Methods toPath :: Located (Trail v n) -> Path (V (Located (Trail v n))) (N (Located (Trail v n))) #
ToPath (Located (Trail' l v n))
Instance details Defined in Diagrams.Path Methods toPath :: Located (Trail' l v n) -> Path (V (Located (Trail' l v n))) (N (Located (Trail' l v n))) #
TrailLike t => TrailLike (Located t)
Instance details Defined in Diagrams.TrailLike Methods trailLike :: Located (Trail (V (Located t)) (N (Located t))) -> Located t #
(Metric v, OrderedField n) => Reversing (Located (Trail v n))
Instance details Defined in Diagrams.Trail Methods reversing :: Located (Trail v n) -> Located (Trail v n) #
(Metric v, OrderedField n) => Reversing (Located (Trail' l v n))
Instance details Defined in Diagrams.Trail Methods reversing :: Located (Trail' l v n) -> Located (Trail' l v n) #
(Serialize a, Serialize (V a (N a))) => Serialize (Located a)
Instance details Defined in Diagrams.Located Methods put :: Putter (Located a) get :: Get (Located a)
(Metric v, Metric u, OrderedField n, r ~ Located (Trail u n)) => Deformable (Located (Trail v n)) r
Instance details Defined in Diagrams.Deform Methods deform' :: N (Located (Trail v n)) -> Deformation (V (Located (Trail v n))) (V r) (N (Located (Trail v n))) -> Located (Trail v n) -> r # deform :: Deformation (V (Located (Trail v n))) (V r) (N (Located (Trail v n))) -> Located (Trail v n) -> r #
Cons (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n'))
Instance details Defined in Diagrams.Path Methods _Cons :: Prism (Path v n) (Path v' n') (Located (Trail v n), Path v n) (Located (Trail v' n'), Path v' n') #
Snoc (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n'))
Instance details Defined in Diagrams.Path Methods _Snoc :: Prism (Path v n) (Path v' n') (Path v n, Located (Trail v n)) (Path v' n', Located (Trail v' n')) #
Each (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n'))
Instance details Defined in Diagrams.Path Methods each :: Traversal (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n')) #
type Rep (Located a)
Instance details Defined in Diagrams.Located type Rep (Located a) = D1 (MetaData "Located" "Diagrams.Located" "dgrms-lb-1.4.2.3-8d574a09" False) (C1 (MetaCons "Loc" PrefixI True) (S1 (MetaSel (Just "loc") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Point (V a) (N a))) :*: S1 (MetaSel (Just "unLoc") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type N (Located a)
Instance details Defined in Diagrams.Located type N (Located a) = N a
type V (Located a)
Instance details Defined in Diagrams.Located type V (Located a) = V a
type Codomain (Located a)
Instance details Defined in Diagrams.Located type Codomain (Located a) = Point (Codomain a)

type family Codomain p :: Type -> Type #

Instances

type Codomain (Located a)
Instance details Defined in Diagrams.Located type Codomain (Located a) = Point (Codomain a)
type Codomain (Tangent t)
Instance details Defined in Diagrams.Tangent type Codomain (Tangent t) = V t
type Codomain (GetSegment t)
Instance details Defined in Diagrams.Trail type Codomain (GetSegment t) = GetSegmentCodomain (V t)
type Codomain (BernsteinPoly n)
Instance details Defined in Diagrams.TwoD.Segment.Bernstein type Codomain (BernsteinPoly n) = V1
type Codomain (FixedSegment v n)
Instance details Defined in Diagrams.Segment type Codomain (FixedSegment v n) = Point v
type Codomain (SegTree v n)
Instance details Defined in Diagrams.Trail type Codomain (SegTree v n) = v
type Codomain (Trail v n)
Instance details Defined in Diagrams.Trail type Codomain (Trail v n) = v
type Codomain (Segment Closed v n)
Instance details Defined in Diagrams.Segment type Codomain (Segment Closed v n) = v
type Codomain (Trail' l v n)
Instance details Defined in Diagrams.Trail type Codomain (Trail' l v n) = v

class DomainBounds p where #

Minimal complete definition

Nothing

Methods

domainLower :: p -> N p #

domainUpper :: p -> N p #

Instances

DomainBounds a => DomainBounds (Located a)
Instance details Defined in Diagrams.Located Methods domainLower :: Located a -> N (Located a) # domainUpper :: Located a -> N (Located a) #
DomainBounds t => DomainBounds (Tangent t)
Instance details Defined in Diagrams.Tangent Methods domainLower :: Tangent t -> N (Tangent t) # domainUpper :: Tangent t -> N (Tangent t) #
DomainBounds t => DomainBounds (GetSegment t)
Instance details Defined in Diagrams.Trail Methods domainLower :: GetSegment t -> N (GetSegment t) # domainUpper :: GetSegment t -> N (GetSegment t) #
Num n => DomainBounds (BernsteinPoly n)
Instance details Defined in Diagrams.TwoD.Segment.Bernstein Methods domainLower :: BernsteinPoly n -> N (BernsteinPoly n) # domainUpper :: BernsteinPoly n -> N (BernsteinPoly n) #
Num n => DomainBounds (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods domainLower :: FixedSegment v n -> N (FixedSegment v n) # domainUpper :: FixedSegment v n -> N (FixedSegment v n) #
Num n => DomainBounds (SegTree v n)
Instance details Defined in Diagrams.Trail Methods domainLower :: SegTree v n -> N (SegTree v n) # domainUpper :: SegTree v n -> N (SegTree v n) #
Num n => DomainBounds (Trail v n)
Instance details Defined in Diagrams.Trail Methods domainLower :: Trail v n -> N (Trail v n) # domainUpper :: Trail v n -> N (Trail v n) #
Num n => DomainBounds (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods domainLower :: Segment Closed v n -> N (Segment Closed v n) # domainUpper :: Segment Closed v n -> N (Segment Closed v n) #
Num n => DomainBounds (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods domainLower :: Trail' l v n -> N (Trail' l v n) # domainUpper :: Trail' l v n -> N (Trail' l v n) #

class (Parametric p, DomainBounds p) => EndValues p where #

Minimal complete definition

Nothing

Methods

atStart :: p -> Codomain p (N p) #

atEnd :: p -> Codomain p (N p) #

Instances

(InSpace v n a, EndValues a, Codomain a ~ v) => EndValues (Located a)
Instance details Defined in Diagrams.Located Methods atStart :: Located a -> Codomain (Located a) (N (Located a)) # atEnd :: Located a -> Codomain (Located a) (N (Located a)) #
(DomainBounds t, EndValues (Tangent t)) => EndValues (Tangent (Located t))
Instance details Defined in Diagrams.Tangent Methods atStart :: Tangent (Located t) -> Codomain (Tangent (Located t)) (N (Tangent (Located t))) # atEnd :: Tangent (Located t) -> Codomain (Tangent (Located t)) (N (Tangent (Located t))) #
(Additive v, Num n) => EndValues (Tangent (FixedSegment v n))
Instance details Defined in Diagrams.Tangent Methods atStart :: Tangent (FixedSegment v n) -> Codomain (Tangent (FixedSegment v n)) (N (Tangent (FixedSegment v n))) # atEnd :: Tangent (FixedSegment v n) -> Codomain (Tangent (FixedSegment v n)) (N (Tangent (FixedSegment v n))) #
(Additive v, Num n) => EndValues (Tangent (Segment Closed v n))
Instance details Defined in Diagrams.Tangent Methods atStart :: Tangent (Segment Closed v n) -> Codomain (Tangent (Segment Closed v n)) (N (Tangent (Segment Closed v n))) # atEnd :: Tangent (Segment Closed v n) -> Codomain (Tangent (Segment Closed v n)) (N (Tangent (Segment Closed v n))) #
(Metric v, OrderedField n, Real n) => EndValues (Tangent (Trail v n))
Instance details Defined in Diagrams.Trail Methods atStart :: Tangent (Trail v n) -> Codomain (Tangent (Trail v n)) (N (Tangent (Trail v n))) # atEnd :: Tangent (Trail v n) -> Codomain (Tangent (Trail v n)) (N (Tangent (Trail v n))) #
(Parametric (GetSegment (Trail' c v n)), EndValues (GetSegment (Trail' c v n)), Additive v, Num n) => EndValues (Tangent (Trail' c v n))
Instance details Defined in Diagrams.Trail Methods atStart :: Tangent (Trail' c v n) -> Codomain (Tangent (Trail' c v n)) (N (Tangent (Trail' c v n))) # atEnd :: Tangent (Trail' c v n) -> Codomain (Tangent (Trail' c v n)) (N (Tangent (Trail' c v n))) #
(Metric v, OrderedField n, Real n) => EndValues (GetSegment (Trail v n))
Instance details Defined in Diagrams.Trail Methods atStart :: GetSegment (Trail v n) -> Codomain (GetSegment (Trail v n)) (N (GetSegment (Trail v n))) # atEnd :: GetSegment (Trail v n) -> Codomain (GetSegment (Trail v n)) (N (GetSegment (Trail v n))) #
(Metric v, OrderedField n) => EndValues (GetSegment (Trail' Line v n))
Instance details Defined in Diagrams.Trail Methods atStart :: GetSegment (Trail' Line v n) -> Codomain (GetSegment (Trail' Line v n)) (N (GetSegment (Trail' Line v n))) # atEnd :: GetSegment (Trail' Line v n) -> Codomain (GetSegment (Trail' Line v n)) (N (GetSegment (Trail' Line v n))) #
(Metric v, OrderedField n, Real n) => EndValues (GetSegment (Trail' Loop v n))
Instance details Defined in Diagrams.Trail Methods atStart :: GetSegment (Trail' Loop v n) -> Codomain (GetSegment (Trail' Loop v n)) (N (GetSegment (Trail' Loop v n))) # atEnd :: GetSegment (Trail' Loop v n) -> Codomain (GetSegment (Trail' Loop v n)) (N (GetSegment (Trail' Loop v n))) #
Fractional n => EndValues (BernsteinPoly n)
Instance details Defined in Diagrams.TwoD.Segment.Bernstein Methods atStart :: BernsteinPoly n -> Codomain (BernsteinPoly n) (N (BernsteinPoly n)) # atEnd :: BernsteinPoly n -> Codomain (BernsteinPoly n) (N (BernsteinPoly n)) #
(Additive v, Num n) => EndValues (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods atStart :: FixedSegment v n -> Codomain (FixedSegment v n) (N (FixedSegment v n)) # atEnd :: FixedSegment v n -> Codomain (FixedSegment v n) (N (FixedSegment v n)) #
(Metric v, OrderedField n, Real n) => EndValues (SegTree v n)
Instance details Defined in Diagrams.Trail Methods atStart :: SegTree v n -> Codomain (SegTree v n) (N (SegTree v n)) # atEnd :: SegTree v n -> Codomain (SegTree v n) (N (SegTree v n)) #
(Metric v, OrderedField n, Real n) => EndValues (Trail v n)
Instance details Defined in Diagrams.Trail Methods atStart :: Trail v n -> Codomain (Trail v n) (N (Trail v n)) # atEnd :: Trail v n -> Codomain (Trail v n) (N (Trail v n)) #
(Additive v, Num n) => EndValues (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods atStart :: Segment Closed v n -> Codomain (Segment Closed v n) (N (Segment Closed v n)) # atEnd :: Segment Closed v n -> Codomain (Segment Closed v n) (N (Segment Closed v n)) #
(Metric v, OrderedField n, Real n) => EndValues (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods atStart :: Trail' l v n -> Codomain (Trail' l v n) (N (Trail' l v n)) # atEnd :: Trail' l v n -> Codomain (Trail' l v n) (N (Trail' l v n)) #

class Parametric p => HasArcLength p where #

Minimal complete definition

arcLengthBounded, arcLengthToParam

Methods

arcLengthBounded :: N p -> p -> Interval (N p) #

arcLength :: N p -> p -> N p #

stdArcLength :: p -> N p #

arcLengthToParam :: N p -> p -> N p -> N p #

stdArcLengthToParam :: p -> N p -> N p #

Instances

(InSpace v n a, Fractional n, HasArcLength a, Codomain a ~ v) => HasArcLength (Located a)
Instance details Defined in Diagrams.Located Methods arcLengthBounded :: N (Located a) -> Located a -> Interval (N (Located a)) # arcLength :: N (Located a) -> Located a -> N (Located a) # stdArcLength :: Located a -> N (Located a) # arcLengthToParam :: N (Located a) -> Located a -> N (Located a) -> N (Located a) # stdArcLengthToParam :: Located a -> N (Located a) -> N (Located a) #
(Metric v, OrderedField n) => HasArcLength (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods arcLengthBounded :: N (FixedSegment v n) -> FixedSegment v n -> Interval (N (FixedSegment v n)) # arcLength :: N (FixedSegment v n) -> FixedSegment v n -> N (FixedSegment v n) # stdArcLength :: FixedSegment v n -> N (FixedSegment v n) # arcLengthToParam :: N (FixedSegment v n) -> FixedSegment v n -> N (FixedSegment v n) -> N (FixedSegment v n) # stdArcLengthToParam :: FixedSegment v n -> N (FixedSegment v n) -> N (FixedSegment v n) #
(Metric v, OrderedField n, Real n) => HasArcLength (SegTree v n)
Instance details Defined in Diagrams.Trail Methods arcLengthBounded :: N (SegTree v n) -> SegTree v n -> Interval (N (SegTree v n)) # arcLength :: N (SegTree v n) -> SegTree v n -> N (SegTree v n) # stdArcLength :: SegTree v n -> N (SegTree v n) # arcLengthToParam :: N (SegTree v n) -> SegTree v n -> N (SegTree v n) -> N (SegTree v n) # stdArcLengthToParam :: SegTree v n -> N (SegTree v n) -> N (SegTree v n) #
(Metric v, OrderedField n, Real n) => HasArcLength (Trail v n)
Instance details Defined in Diagrams.Trail Methods arcLengthBounded :: N (Trail v n) -> Trail v n -> Interval (N (Trail v n)) # arcLength :: N (Trail v n) -> Trail v n -> N (Trail v n) # stdArcLength :: Trail v n -> N (Trail v n) # arcLengthToParam :: N (Trail v n) -> Trail v n -> N (Trail v n) -> N (Trail v n) # stdArcLengthToParam :: Trail v n -> N (Trail v n) -> N (Trail v n) #
(Metric v, OrderedField n) => HasArcLength (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods arcLengthBounded :: N (Segment Closed v n) -> Segment Closed v n -> Interval (N (Segment Closed v n)) # arcLength :: N (Segment Closed v n) -> Segment Closed v n -> N (Segment Closed v n) # stdArcLength :: Segment Closed v n -> N (Segment Closed v n) # arcLengthToParam :: N (Segment Closed v n) -> Segment Closed v n -> N (Segment Closed v n) -> N (Segment Closed v n) # stdArcLengthToParam :: Segment Closed v n -> N (Segment Closed v n) -> N (Segment Closed v n) #
(Metric v, OrderedField n, Real n) => HasArcLength (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods arcLengthBounded :: N (Trail' l v n) -> Trail' l v n -> Interval (N (Trail' l v n)) # arcLength :: N (Trail' l v n) -> Trail' l v n -> N (Trail' l v n) # stdArcLength :: Trail' l v n -> N (Trail' l v n) # arcLengthToParam :: N (Trail' l v n) -> Trail' l v n -> N (Trail' l v n) -> N (Trail' l v n) # stdArcLengthToParam :: Trail' l v n -> N (Trail' l v n) -> N (Trail' l v n) #

class Parametric p where #

Methods

atParam :: p -> N p -> Codomain p (N p) #

Instances

(InSpace v n a, Parametric a, Codomain a ~ v) => Parametric (Located a)
Instance details Defined in Diagrams.Located Methods atParam :: Located a -> N (Located a) -> Codomain (Located a) (N (Located a)) #
Parametric (Tangent t) => Parametric (Tangent (Located t))
Instance details Defined in Diagrams.Tangent Methods atParam :: Tangent (Located t) -> N (Tangent (Located t)) -> Codomain (Tangent (Located t)) (N (Tangent (Located t))) #
(Additive v, Num n) => Parametric (Tangent (FixedSegment v n))
Instance details Defined in Diagrams.Tangent Methods atParam :: Tangent (FixedSegment v n) -> N (Tangent (FixedSegment v n)) -> Codomain (Tangent (FixedSegment v n)) (N (Tangent (FixedSegment v n))) #
(Additive v, Num n) => Parametric (Tangent (Segment Closed v n))
Instance details Defined in Diagrams.Tangent Methods atParam :: Tangent (Segment Closed v n) -> N (Tangent (Segment Closed v n)) -> Codomain (Tangent (Segment Closed v n)) (N (Tangent (Segment Closed v n))) #
(Metric v, OrderedField n, Real n) => Parametric (Tangent (Trail v n))
Instance details Defined in Diagrams.Trail Methods atParam :: Tangent (Trail v n) -> N (Tangent (Trail v n)) -> Codomain (Tangent (Trail v n)) (N (Tangent (Trail v n))) #
(Parametric (GetSegment (Trail' c v n)), Additive v, Num n) => Parametric (Tangent (Trail' c v n))
Instance details Defined in Diagrams.Trail Methods atParam :: Tangent (Trail' c v n) -> N (Tangent (Trail' c v n)) -> Codomain (Tangent (Trail' c v n)) (N (Tangent (Trail' c v n))) #
(Metric v, OrderedField n, Real n) => Parametric (GetSegment (Trail v n))
Instance details Defined in Diagrams.Trail Methods atParam :: GetSegment (Trail v n) -> N (GetSegment (Trail v n)) -> Codomain (GetSegment (Trail v n)) (N (GetSegment (Trail v n))) #
(Metric v, OrderedField n) => Parametric (GetSegment (Trail' Line v n))
Instance details Defined in Diagrams.Trail Methods atParam :: GetSegment (Trail' Line v n) -> N (GetSegment (Trail' Line v n)) -> Codomain (GetSegment (Trail' Line v n)) (N (GetSegment (Trail' Line v n))) #
(Metric v, OrderedField n, Real n) => Parametric (GetSegment (Trail' Loop v n))
Instance details Defined in Diagrams.Trail Methods atParam :: GetSegment (Trail' Loop v n) -> N (GetSegment (Trail' Loop v n)) -> Codomain (GetSegment (Trail' Loop v n)) (N (GetSegment (Trail' Loop v n))) #
Fractional n => Parametric (BernsteinPoly n)
Instance details Defined in Diagrams.TwoD.Segment.Bernstein Methods atParam :: BernsteinPoly n -> N (BernsteinPoly n) -> Codomain (BernsteinPoly n) (N (BernsteinPoly n)) #
(Additive v, Num n) => Parametric (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods atParam :: FixedSegment v n -> N (FixedSegment v n) -> Codomain (FixedSegment v n) (N (FixedSegment v n)) #
(Metric v, OrderedField n, Real n) => Parametric (SegTree v n)
Instance details Defined in Diagrams.Trail Methods atParam :: SegTree v n -> N (SegTree v n) -> Codomain (SegTree v n) (N (SegTree v n)) #
(Metric v, OrderedField n, Real n) => Parametric (Trail v n)
Instance details Defined in Diagrams.Trail Methods atParam :: Trail v n -> N (Trail v n) -> Codomain (Trail v n) (N (Trail v n)) #
(Additive v, Num n) => Parametric (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods atParam :: Segment Closed v n -> N (Segment Closed v n) -> Codomain (Segment Closed v n) (N (Segment Closed v n)) #
(Metric v, OrderedField n, Real n) => Parametric (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods atParam :: Trail' l v n -> N (Trail' l v n) -> Codomain (Trail' l v n) (N (Trail' l v n)) #

class DomainBounds p => Sectionable p where #

Minimal complete definition

reverseDomain

Methods

splitAtParam :: p -> N p -> (p, p) #

section :: p -> N p -> N p -> p #

reverseDomain :: p -> p #

Instances

(InSpace v n a, Fractional n, Parametric a, Sectionable a, Codomain a ~ v) => Sectionable (Located a)
Instance details Defined in Diagrams.Located Methods splitAtParam :: Located a -> N (Located a) -> (Located a, Located a) # section :: Located a -> N (Located a) -> N (Located a) -> Located a # reverseDomain :: Located a -> Located a #
Fractional n => Sectionable (BernsteinPoly n)
Instance details Defined in Diagrams.TwoD.Segment.Bernstein Methods splitAtParam :: BernsteinPoly n -> N (BernsteinPoly n) -> (BernsteinPoly n, BernsteinPoly n) # section :: BernsteinPoly n -> N (BernsteinPoly n) -> N (BernsteinPoly n) -> BernsteinPoly n # reverseDomain :: BernsteinPoly n -> BernsteinPoly n #
(Additive v, Fractional n) => Sectionable (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods splitAtParam :: FixedSegment v n -> N (FixedSegment v n) -> (FixedSegment v n, FixedSegment v n) # section :: FixedSegment v n -> N (FixedSegment v n) -> N (FixedSegment v n) -> FixedSegment v n # reverseDomain :: FixedSegment v n -> FixedSegment v n #
(Metric v, OrderedField n, Real n) => Sectionable (SegTree v n)
Instance details Defined in Diagrams.Trail Methods splitAtParam :: SegTree v n -> N (SegTree v n) -> (SegTree v n, SegTree v n) # section :: SegTree v n -> N (SegTree v n) -> N (SegTree v n) -> SegTree v n # reverseDomain :: SegTree v n -> SegTree v n #
(Metric v, OrderedField n, Real n) => Sectionable (Trail v n)
Instance details Defined in Diagrams.Trail Methods splitAtParam :: Trail v n -> N (Trail v n) -> (Trail v n, Trail v n) # section :: Trail v n -> N (Trail v n) -> N (Trail v n) -> Trail v n # reverseDomain :: Trail v n -> Trail v n #
(Additive v, Fractional n) => Sectionable (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods splitAtParam :: Segment Closed v n -> N (Segment Closed v n) -> (Segment Closed v n, Segment Closed v n) # section :: Segment Closed v n -> N (Segment Closed v n) -> N (Segment Closed v n) -> Segment Closed v n # reverseDomain :: Segment Closed v n -> Segment Closed v n #
(Metric v, OrderedField n, Real n) => Sectionable (Trail' Line v n)
Instance details Defined in Diagrams.Trail Methods splitAtParam :: Trail' Line v n -> N (Trail' Line v n) -> (Trail' Line v n, Trail' Line v n) # section :: Trail' Line v n -> N (Trail' Line v n) -> N (Trail' Line v n) -> Trail' Line v n # reverseDomain :: Trail' Line v n -> Trail' Line v n #

data AdjustMethod n #

Constructors

ByParam n
ByAbsolute n
ToAbsolute n

Instances

Fractional n => Default (AdjustMethod n)
Instance details Defined in Diagrams.Parametric.Adjust Methods def :: AdjustMethod n #

data AdjustOpts n #

Instances

Fractional n => Default (AdjustOpts n)
Instance details Defined in Diagrams.Parametric.Adjust Methods def :: AdjustOpts n #

data AdjustSide #

Constructors

Start
End
Both

Instances

Bounded AdjustSide
Instance details Defined in Diagrams.Parametric.Adjust Methods minBound :: AdjustSide # maxBound :: AdjustSide #
Enum AdjustSide
Instance details Defined in Diagrams.Parametric.Adjust Methods succ :: AdjustSide -> AdjustSide # pred :: AdjustSide -> AdjustSide # toEnum :: Int -> AdjustSide # fromEnum :: AdjustSide -> Int # enumFrom :: AdjustSide -> [AdjustSide] # enumFromThen :: AdjustSide -> AdjustSide -> [AdjustSide] # enumFromTo :: AdjustSide -> AdjustSide -> [AdjustSide] # enumFromThenTo :: AdjustSide -> AdjustSide -> AdjustSide -> [AdjustSide] #
Eq AdjustSide
Instance details Defined in Diagrams.Parametric.Adjust Methods (==) :: AdjustSide -> AdjustSide -> Bool # (/=) :: AdjustSide -> AdjustSide -> Bool #
Ord AdjustSide
Instance details Defined in Diagrams.Parametric.Adjust Methods compare :: AdjustSide -> AdjustSide -> Ordering # (<) :: AdjustSide -> AdjustSide -> Bool # (<=) :: AdjustSide -> AdjustSide -> Bool # (>) :: AdjustSide -> AdjustSide -> Bool # (>=) :: AdjustSide -> AdjustSide -> Bool # max :: AdjustSide -> AdjustSide -> AdjustSide # min :: AdjustSide -> AdjustSide -> AdjustSide #
Read AdjustSide
Instance details Defined in Diagrams.Parametric.Adjust Methods readsPrec :: Int -> ReadS AdjustSide # readList :: ReadS [AdjustSide] # readPrec :: ReadPrec AdjustSide # readListPrec :: ReadPrec [AdjustSide] #
Show AdjustSide
Instance details Defined in Diagrams.Parametric.Adjust Methods showsPrec :: Int -> AdjustSide -> ShowS # show :: AdjustSide -> String # showList :: [AdjustSide] -> ShowS #
Default AdjustSide
Instance details Defined in Diagrams.Parametric.Adjust Methods def :: AdjustSide #

newtype Path (v :: Type -> Type) n #

Constructors

Path [Located (Trail v n)]

Instances

Eq (v n) => Eq (Path v n)
Instance details Defined in Diagrams.Path Methods (==) :: Path v n -> Path v n -> Bool # (/=) :: Path v n -> Path v n -> Bool #
Ord (v n) => Ord (Path v n)
Instance details Defined in Diagrams.Path Methods compare :: Path v n -> Path v n -> Ordering # (<) :: Path v n -> Path v n -> Bool # (<=) :: Path v n -> Path v n -> Bool # (>) :: Path v n -> Path v n -> Bool # (>=) :: Path v n -> Path v n -> Bool # max :: Path v n -> Path v n -> Path v n # min :: Path v n -> Path v n -> Path v n #
Show (v n) => Show (Path v n)
Instance details Defined in Diagrams.Path Methods showsPrec :: Int -> Path v n -> ShowS # show :: Path v n -> String # showList :: [Path v n] -> ShowS #
Generic (Path v n)
Instance details Defined in Diagrams.Path Associated Types type Rep (Path v n) :: Type -> Type # Methods from :: Path v n -> Rep (Path v n) x # to :: Rep (Path v n) x -> Path v n #
Semigroup (Path v n)
Instance details Defined in Diagrams.Path Methods (<>) :: Path v n -> Path v n -> Path v n # sconcat :: NonEmpty (Path v n) -> Path v n # stimes :: Integral b => b -> Path v n -> Path v n #
Monoid (Path v n)
Instance details Defined in Diagrams.Path Methods mempty :: Path v n # mappend :: Path v n -> Path v n -> Path v n # mconcat :: [Path v n] -> Path v n #
(Metric v, OrderedField n) => Enveloped (Path v n)
Instance details Defined in Diagrams.Path Methods getEnvelope :: Path v n -> Envelope (V (Path v n)) (N (Path v n)) #
(Additive v, Num n) => HasOrigin (Path v n)
Instance details Defined in Diagrams.Path Methods moveOriginTo :: Point (V (Path v n)) (N (Path v n)) -> Path v n -> Path v n #
(Metric v, OrderedField n) => Juxtaposable (Path v n)
Instance details Defined in Diagrams.Path Methods juxtapose :: Vn (Path v n) -> Path v n -> Path v n -> Path v n #
(HasLinearMap v, Metric v, OrderedField n) => Transformable (Path v n)
Instance details Defined in Diagrams.Path Methods transform :: Transformation (V (Path v n)) (N (Path v n)) -> Path v n -> Path v n #
(Metric v, OrderedField n) => Alignable (Path v n)
Instance details Defined in Diagrams.Path Methods alignBy' :: (InSpace v0 n0 (Path v n), Fractional n0, HasOrigin (Path v n)) => (v0 n0 -> Path v n -> Point v0 n0) -> v0 n0 -> n0 -> Path v n -> Path v n # defaultBoundary :: (V (Path v n) ~ v0, N (Path v n) ~ n0) => v0 n0 -> Path v n -> Point v0 n0 # alignBy :: (InSpace v0 n0 (Path v n), Fractional n0, HasOrigin (Path v n)) => v0 n0 -> n0 -> Path v n -> Path v n #
ToPath (Path v n)
Instance details Defined in Diagrams.Path Methods toPath :: Path v n -> Path (V (Path v n)) (N (Path v n)) #
(Metric v, OrderedField n) => TrailLike (Path v n)
Instance details Defined in Diagrams.Path Methods trailLike :: Located (Trail (V (Path v n)) (N (Path v n))) -> Path v n #
AsEmpty (Path v n)
Instance details Defined in Diagrams.Path Methods _Empty :: Prism' (Path v n) () #
(Metric v, OrderedField n) => Reversing (Path v n)
Instance details Defined in Diagrams.Path Methods reversing :: Path v n -> Path v n #
Wrapped (Path v n)
Instance details Defined in Diagrams.Path Associated Types type Unwrapped (Path v n) :: Type # Methods _Wrapped' :: Iso' (Path v n) (Unwrapped (Path v n)) #
(OrderedField n, Metric v, Serialize (v n), Serialize (V (v n) (N (v n)))) => Serialize (Path v n)
Instance details Defined in Diagrams.Path Methods put :: Putter (Path v n) get :: Get (Path v n)
(HasLinearMap v, Metric v, OrderedField n) => Renderable (Path v n) NullBackend
Instance details Defined in Diagrams.Path Methods render :: NullBackend -> Path v n -> Render NullBackend (V (Path v n)) (N (Path v n)) #
SVGFloat n => Renderable (Path V2 n) SVG
Instance details Defined in Diagrams.Backend.SVG Methods render :: SVG -> Path V2 n -> Render SVG (V (Path V2 n)) (N (Path V2 n)) #
(Metric v, Metric u, OrderedField n, r ~ Path u n) => Deformable (Path v n) r
Instance details Defined in Diagrams.Deform Methods deform' :: N (Path v n) -> Deformation (V (Path v n)) (V r) (N (Path v n)) -> Path v n -> r # deform :: Deformation (V (Path v n)) (V r) (N (Path v n)) -> Path v n -> r #
Rewrapped (Path v n) (Path v' n')
Instance details Defined in Diagrams.Path
Cons (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n'))
Instance details Defined in Diagrams.Path Methods _Cons :: Prism (Path v n) (Path v' n') (Located (Trail v n), Path v n) (Located (Trail v' n'), Path v' n') #
Snoc (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n'))
Instance details Defined in Diagrams.Path Methods _Snoc :: Prism (Path v n) (Path v' n') (Path v n, Located (Trail v n)) (Path v' n', Located (Trail v' n')) #
Each (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n'))
Instance details Defined in Diagrams.Path Methods each :: Traversal (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n')) #
type Rep (Path v n)
Instance details Defined in Diagrams.Path type Rep (Path v n) = D1 (MetaData "Path" "Diagrams.Path" "dgrms-lb-1.4.2.3-8d574a09" True) (C1 (MetaCons "Path" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Located (Trail v n)])))
type N (Path v n)
Instance details Defined in Diagrams.Path type N (Path v n) = n
type V (Path v n)
Instance details Defined in Diagrams.Path type V (Path v n) = v
type Unwrapped (Path v n)
Instance details Defined in Diagrams.Path type Unwrapped (Path v n) = [Located (Trail v n)]

class ToPath t where #

Methods

toPath :: t -> Path (V t) (N t) #

Instances

ToPath a => ToPath [a]
Instance details Defined in Diagrams.Path Methods toPath :: [a] -> Path (V [a]) (N [a]) #
ToPath (Located [Segment Closed v n])
Instance details Defined in Diagrams.Path Methods toPath :: Located [Segment Closed v n] -> Path (V (Located [Segment Closed v n])) (N (Located [Segment Closed v n])) #
ToPath (Located (Segment Closed v n))
Instance details Defined in Diagrams.Path Methods toPath :: Located (Segment Closed v n) -> Path (V (Located (Segment Closed v n))) (N (Located (Segment Closed v n))) #
ToPath (Located (Trail v n))
Instance details Defined in Diagrams.Path Methods toPath :: Located (Trail v n) -> Path (V (Located (Trail v n))) (N (Located (Trail v n))) #
ToPath (Located (Trail' l v n))
Instance details Defined in Diagrams.Path Methods toPath :: Located (Trail' l v n) -> Path (V (Located (Trail' l v n))) (N (Located (Trail' l v n))) #
ToPath (Path v n)
Instance details Defined in Diagrams.Path Methods toPath :: Path v n -> Path (V (Path v n)) (N (Path v n)) #
ToPath (FixedSegment v n)
Instance details Defined in Diagrams.Path Methods toPath :: FixedSegment v n -> Path (V (FixedSegment v n)) (N (FixedSegment v n)) #
ToPath (Trail v n)
Instance details Defined in Diagrams.Path Methods toPath :: Trail v n -> Path (V (Trail v n)) (N (Trail v n)) #
ToPath (Trail' l v n)
Instance details Defined in Diagrams.Path Methods toPath :: Trail' l v n -> Path (V (Trail' l v n)) (N (Trail' l v n)) #

class HasQuery t m | t -> m where #

Methods

getQuery :: t -> Query (V t) (N t) m #

Instances

(Num n, Ord n) => HasQuery (Box n) Any
Instance details Defined in Diagrams.ThreeD.Shapes Methods getQuery :: Box n -> Query (V (Box n)) (N (Box n)) Any #
(Floating n, Ord n) => HasQuery (CSG n) Any
Instance details Defined in Diagrams.ThreeD.Shapes Methods getQuery :: CSG n -> Query (V (CSG n)) (N (CSG n)) Any #
(Num n, Ord n) => HasQuery (Ellipsoid n) Any
Instance details Defined in Diagrams.ThreeD.Shapes Methods getQuery :: Ellipsoid n -> Query (V (Ellipsoid n)) (N (Ellipsoid n)) Any #
OrderedField n => HasQuery (Frustum n) Any
Instance details Defined in Diagrams.ThreeD.Shapes Methods getQuery :: Frustum n -> Query (V (Frustum n)) (N (Frustum n)) Any #
RealFloat n => HasQuery (Clip n) All
Instance details Defined in Diagrams.TwoD.Path Methods getQuery :: Clip n -> Query (V (Clip n)) (N (Clip n)) All #
(Additive v, Foldable v, Ord n) => HasQuery (BoundingBox v n) Any
Instance details Defined in Diagrams.BoundingBox Methods getQuery :: BoundingBox v n -> Query (V (BoundingBox v n)) (N (BoundingBox v n)) Any #
RealFloat n => HasQuery (DImage n a) Any
Instance details Defined in Diagrams.TwoD.Image Methods getQuery :: DImage n a -> Query (V (DImage n a)) (N (DImage n a)) Any #
HasQuery (Query v n m) m
Instance details Defined in Diagrams.Query Methods getQuery :: Query v n m -> Query (V (Query v n m)) (N (Query v n m)) m #
Monoid m => HasQuery (QDiagram b v n m) m
Instance details Defined in Diagrams.Query Methods getQuery :: QDiagram b v n m -> Query (V (QDiagram b v n m)) (N (QDiagram b v n m)) m #

newtype ArcLength n #

Constructors

ArcLength (Sum (Interval n), n -> Sum (Interval n))

Instances

(Num n, Ord n) => Semigroup (ArcLength n)
Instance details Defined in Diagrams.Segment Methods (<>) :: ArcLength n -> ArcLength n -> ArcLength n # sconcat :: NonEmpty (ArcLength n) -> ArcLength n # stimes :: Integral b => b -> ArcLength n -> ArcLength n #
(Num n, Ord n) => Monoid (ArcLength n)
Instance details Defined in Diagrams.Segment Methods mempty :: ArcLength n # mappend :: ArcLength n -> ArcLength n -> ArcLength n # mconcat :: [ArcLength n] -> ArcLength n #
Wrapped (ArcLength n)
Instance details Defined in Diagrams.Segment Associated Types type Unwrapped (ArcLength n) :: Type # Methods _Wrapped' :: Iso' (ArcLength n) (Unwrapped (ArcLength n)) #
Rewrapped (ArcLength n) (ArcLength n')
Instance details Defined in Diagrams.Segment
(Metric v, OrderedField n) => Measured (SegMeasure v n) (SegMeasure v n)
Instance details Defined in Diagrams.Segment Methods measure :: SegMeasure v n -> SegMeasure v n
(Floating n, Ord n, Metric v) => Measured (SegMeasure v n) (SegTree v n)
Instance details Defined in Diagrams.Trail Methods measure :: SegTree v n -> SegMeasure v n
(OrderedField n, Metric v) => Measured (SegMeasure v n) (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods measure :: Segment Closed v n -> SegMeasure v n
type Unwrapped (ArcLength n)
Instance details Defined in Diagrams.Segment type Unwrapped (ArcLength n) = (Sum (Interval n), n -> Sum (Interval n))

data Closed #

Instances

(Additive v, Num n) => EndValues (Tangent (Segment Closed v n))
Instance details Defined in Diagrams.Tangent Methods atStart :: Tangent (Segment Closed v n) -> Codomain (Tangent (Segment Closed v n)) (N (Tangent (Segment Closed v n))) # atEnd :: Tangent (Segment Closed v n) -> Codomain (Tangent (Segment Closed v n)) (N (Tangent (Segment Closed v n))) #
(Additive v, Num n) => Parametric (Tangent (Segment Closed v n))
Instance details Defined in Diagrams.Tangent Methods atParam :: Tangent (Segment Closed v n) -> N (Tangent (Segment Closed v n)) -> Codomain (Tangent (Segment Closed v n)) (N (Tangent (Segment Closed v n))) #
ToPath (Located [Segment Closed v n])
Instance details Defined in Diagrams.Path Methods toPath :: Located [Segment Closed v n] -> Path (V (Located [Segment Closed v n])) (N (Located [Segment Closed v n])) #
ToPath (Located (Segment Closed v n))
Instance details Defined in Diagrams.Path Methods toPath :: Located (Segment Closed v n) -> Path (V (Located (Segment Closed v n))) (N (Located (Segment Closed v n))) #
(Metric v, OrderedField n, Metric u, OrderedField n') => Cons (SegTree v n) (SegTree u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Cons :: Prism (SegTree v n) (SegTree u n') (Segment Closed v n, SegTree v n) (Segment Closed u n', SegTree u n') #
(Metric v, OrderedField n, Metric u, OrderedField n') => Snoc (SegTree v n) (SegTree u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Snoc :: Prism (SegTree v n) (SegTree u n') (SegTree v n, Segment Closed v n) (SegTree u n', Segment Closed u n') #
(OrderedField n, Metric v) => Measured (SegMeasure v n) (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods measure :: Segment Closed v n -> SegMeasure v n
(Metric v, OrderedField n) => Enveloped (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods getEnvelope :: Segment Closed v n -> Envelope (V (Segment Closed v n)) (N (Segment Closed v n)) #
Num n => DomainBounds (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods domainLower :: Segment Closed v n -> N (Segment Closed v n) # domainUpper :: Segment Closed v n -> N (Segment Closed v n) #
(Additive v, Num n) => EndValues (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods atStart :: Segment Closed v n -> Codomain (Segment Closed v n) (N (Segment Closed v n)) # atEnd :: Segment Closed v n -> Codomain (Segment Closed v n) (N (Segment Closed v n)) #
(Metric v, OrderedField n) => HasArcLength (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods arcLengthBounded :: N (Segment Closed v n) -> Segment Closed v n -> Interval (N (Segment Closed v n)) # arcLength :: N (Segment Closed v n) -> Segment Closed v n -> N (Segment Closed v n) # stdArcLength :: Segment Closed v n -> N (Segment Closed v n) # arcLengthToParam :: N (Segment Closed v n) -> Segment Closed v n -> N (Segment Closed v n) -> N (Segment Closed v n) # stdArcLengthToParam :: Segment Closed v n -> N (Segment Closed v n) -> N (Segment Closed v n) #
(Additive v, Num n) => Parametric (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods atParam :: Segment Closed v n -> N (Segment Closed v n) -> Codomain (Segment Closed v n) (N (Segment Closed v n)) #
(Additive v, Fractional n) => Sectionable (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods splitAtParam :: Segment Closed v n -> N (Segment Closed v n) -> (Segment Closed v n, Segment Closed v n) # section :: Segment Closed v n -> N (Segment Closed v n) -> N (Segment Closed v n) -> Segment Closed v n # reverseDomain :: Segment Closed v n -> Segment Closed v n #
(Additive v, Num n) => Reversing (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods reversing :: Segment Closed v n -> Segment Closed v n #
Serialize (v n) => Serialize (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods put :: Putter (Segment Closed v n) get :: Get (Segment Closed v n)
(Metric v, OrderedField n, Metric u, OrderedField n') => Cons (Trail' Line v n) (Trail' Line u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Cons :: Prism (Trail' Line v n) (Trail' Line u n') (Segment Closed v n, Trail' Line v n) (Segment Closed u n', Trail' Line u n') #
(Metric v, OrderedField n, Metric u, OrderedField n') => Snoc (Trail' Line v n) (Trail' Line u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Snoc :: Prism (Trail' Line v n) (Trail' Line u n') (Trail' Line v n, Segment Closed v n) (Trail' Line u n', Segment Closed u n') #
type Codomain (Segment Closed v n)
Instance details Defined in Diagrams.Segment type Codomain (Segment Closed v n) = v

data FixedSegment (v :: Type -> Type) n #

Constructors

FLinear (Point v n) (Point v n)
FCubic (Point v n) (Point v n) (Point v n) (Point v n)

Instances

(Additive v, Num n) => EndValues (Tangent (FixedSegment v n))
Instance details Defined in Diagrams.Tangent Methods atStart :: Tangent (FixedSegment v n) -> Codomain (Tangent (FixedSegment v n)) (N (Tangent (FixedSegment v n))) # atEnd :: Tangent (FixedSegment v n) -> Codomain (Tangent (FixedSegment v n)) (N (Tangent (FixedSegment v n))) #
(Additive v, Num n) => Parametric (Tangent (FixedSegment v n))
Instance details Defined in Diagrams.Tangent Methods atParam :: Tangent (FixedSegment v n) -> N (Tangent (FixedSegment v n)) -> Codomain (Tangent (FixedSegment v n)) (N (Tangent (FixedSegment v n))) #
Show (v n) => Show (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods showsPrec :: Int -> FixedSegment v n -> ShowS # show :: FixedSegment v n -> String # showList :: [FixedSegment v n] -> ShowS #
(Metric v, OrderedField n) => Enveloped (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods getEnvelope :: FixedSegment v n -> Envelope (V (FixedSegment v n)) (N (FixedSegment v n)) #
(Additive v, Num n) => HasOrigin (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods moveOriginTo :: Point (V (FixedSegment v n)) (N (FixedSegment v n)) -> FixedSegment v n -> FixedSegment v n #
(Additive v, Num n) => Transformable (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods transform :: Transformation (V (FixedSegment v n)) (N (FixedSegment v n)) -> FixedSegment v n -> FixedSegment v n #
Num n => DomainBounds (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods domainLower :: FixedSegment v n -> N (FixedSegment v n) # domainUpper :: FixedSegment v n -> N (FixedSegment v n) #
(Additive v, Num n) => EndValues (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods atStart :: FixedSegment v n -> Codomain (FixedSegment v n) (N (FixedSegment v n)) # atEnd :: FixedSegment v n -> Codomain (FixedSegment v n) (N (FixedSegment v n)) #
(Metric v, OrderedField n) => HasArcLength (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods arcLengthBounded :: N (FixedSegment v n) -> FixedSegment v n -> Interval (N (FixedSegment v n)) # arcLength :: N (FixedSegment v n) -> FixedSegment v n -> N (FixedSegment v n) # stdArcLength :: FixedSegment v n -> N (FixedSegment v n) # arcLengthToParam :: N (FixedSegment v n) -> FixedSegment v n -> N (FixedSegment v n) -> N (FixedSegment v n) # stdArcLengthToParam :: FixedSegment v n -> N (FixedSegment v n) -> N (FixedSegment v n) #
(Additive v, Num n) => Parametric (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods atParam :: FixedSegment v n -> N (FixedSegment v n) -> Codomain (FixedSegment v n) (N (FixedSegment v n)) #
(Additive v, Fractional n) => Sectionable (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods splitAtParam :: FixedSegment v n -> N (FixedSegment v n) -> (FixedSegment v n, FixedSegment v n) # section :: FixedSegment v n -> N (FixedSegment v n) -> N (FixedSegment v n) -> FixedSegment v n # reverseDomain :: FixedSegment v n -> FixedSegment v n #
ToPath (FixedSegment v n)
Instance details Defined in Diagrams.Path Methods toPath :: FixedSegment v n -> Path (V (FixedSegment v n)) (N (FixedSegment v n)) #
Reversing (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods reversing :: FixedSegment v n -> FixedSegment v n #
Each (FixedSegment v n) (FixedSegment v' n') (Point v n) (Point v' n')
Instance details Defined in Diagrams.Segment Methods each :: Traversal (FixedSegment v n) (FixedSegment v' n') (Point v n) (Point v' n') #
type N (FixedSegment v n)
Instance details Defined in Diagrams.Segment type N (FixedSegment v n) = n
type V (FixedSegment v n)
Instance details Defined in Diagrams.Segment type V (FixedSegment v n) = v
type Codomain (FixedSegment v n)
Instance details Defined in Diagrams.Segment type Codomain (FixedSegment v n) = Point v

data Offset c (v :: Type -> Type) n where #

Constructors

OffsetOpen :: forall c (v :: Type -> Type) n. Offset Open v n
OffsetClosed :: forall c (v :: Type -> Type) n. v n -> Offset Closed v n

Instances

Functor v => Functor (Offset c v)
Instance details Defined in Diagrams.Segment Methods fmap :: (a -> b) -> Offset c v a -> Offset c v b # (<$) :: a -> Offset c v b -> Offset c v a #
Eq (v n) => Eq (Offset c v n)
Instance details Defined in Diagrams.Segment Methods (==) :: Offset c v n -> Offset c v n -> Bool # (/=) :: Offset c v n -> Offset c v n -> Bool #
Ord (v n) => Ord (Offset c v n)
Instance details Defined in Diagrams.Segment Methods compare :: Offset c v n -> Offset c v n -> Ordering # (<) :: Offset c v n -> Offset c v n -> Bool # (<=) :: Offset c v n -> Offset c v n -> Bool # (>) :: Offset c v n -> Offset c v n -> Bool # (>=) :: Offset c v n -> Offset c v n -> Bool # max :: Offset c v n -> Offset c v n -> Offset c v n # min :: Offset c v n -> Offset c v n -> Offset c v n #
Show (v n) => Show (Offset c v n)
Instance details Defined in Diagrams.Segment Methods showsPrec :: Int -> Offset c v n -> ShowS # show :: Offset c v n -> String # showList :: [Offset c v n] -> ShowS #
Transformable (Offset c v n)
Instance details Defined in Diagrams.Segment Methods transform :: Transformation (V (Offset c v n)) (N (Offset c v n)) -> Offset c v n -> Offset c v n #
(Additive v, Num n) => Reversing (Offset c v n)
Instance details Defined in Diagrams.Segment Methods reversing :: Offset c v n -> Offset c v n #
Each (Offset c v n) (Offset c v' n') (v n) (v' n')
Instance details Defined in Diagrams.Segment Methods each :: Traversal (Offset c v n) (Offset c v' n') (v n) (v' n') #
type N (Offset c v n)
Instance details Defined in Diagrams.Segment type N (Offset c v n) = n
type V (Offset c v n)
Instance details Defined in Diagrams.Segment type V (Offset c v n) = v

data OffsetEnvelope (v :: Type -> Type) n #

Constructors

OffsetEnvelope
Fields _oeOffset :: !(TotalOffset v n) _oeEnvelope :: Envelope v n

Instances

(Metric v, OrderedField n) => Semigroup (OffsetEnvelope v n)
Instance details Defined in Diagrams.Segment Methods (<>) :: OffsetEnvelope v n -> OffsetEnvelope v n -> OffsetEnvelope v n # sconcat :: NonEmpty (OffsetEnvelope v n) -> OffsetEnvelope v n # stimes :: Integral b => b -> OffsetEnvelope v n -> OffsetEnvelope v n #
(Metric v, OrderedField n) => Measured (SegMeasure v n) (SegMeasure v n)
Instance details Defined in Diagrams.Segment Methods measure :: SegMeasure v n -> SegMeasure v n
(Floating n, Ord n, Metric v) => Measured (SegMeasure v n) (SegTree v n)
Instance details Defined in Diagrams.Trail Methods measure :: SegTree v n -> SegMeasure v n
(OrderedField n, Metric v) => Measured (SegMeasure v n) (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods measure :: Segment Closed v n -> SegMeasure v n

data Open #

Instances

Serialize (v n) => Serialize (Segment Open v n)
Instance details Defined in Diagrams.Segment Methods put :: Putter (Segment Open v n) get :: Get (Segment Open v n)

newtype SegCount #

Constructors

SegCount (Sum Int)

Instances

Semigroup SegCount
Instance details Defined in Diagrams.Segment Methods (<>) :: SegCount -> SegCount -> SegCount # sconcat :: NonEmpty SegCount -> SegCount # stimes :: Integral b => b -> SegCount -> SegCount #
Monoid SegCount
Instance details Defined in Diagrams.Segment Methods mempty :: SegCount # mappend :: SegCount -> SegCount -> SegCount # mconcat :: [SegCount] -> SegCount #
Wrapped SegCount
Instance details Defined in Diagrams.Segment Associated Types type Unwrapped SegCount :: Type # Methods _Wrapped' :: Iso' SegCount (Unwrapped SegCount) #
Rewrapped SegCount SegCount
Instance details Defined in Diagrams.Segment
(Metric v, OrderedField n) => Measured (SegMeasure v n) (SegMeasure v n)
Instance details Defined in Diagrams.Segment Methods measure :: SegMeasure v n -> SegMeasure v n
(Floating n, Ord n, Metric v) => Measured (SegMeasure v n) (SegTree v n)
Instance details Defined in Diagrams.Trail Methods measure :: SegTree v n -> SegMeasure v n
(OrderedField n, Metric v) => Measured (SegMeasure v n) (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods measure :: Segment Closed v n -> SegMeasure v n
type Unwrapped SegCount
Instance details Defined in Diagrams.Segment type Unwrapped SegCount = Sum Int

type SegMeasure (v :: Type -> Type) n = SegCount ::: (ArcLength n ::: (OffsetEnvelope v n ::: ())) #

data Segment c (v :: Type -> Type) n #

Constructors

Linear !(Offset c v n)
Cubic !(v n) !(v n) !(Offset c v n)

Instances

(Additive v, Num n) => EndValues (Tangent (Segment Closed v n))
Instance details Defined in Diagrams.Tangent Methods atStart :: Tangent (Segment Closed v n) -> Codomain (Tangent (Segment Closed v n)) (N (Tangent (Segment Closed v n))) # atEnd :: Tangent (Segment Closed v n) -> Codomain (Tangent (Segment Closed v n)) (N (Tangent (Segment Closed v n))) #
(Additive v, Num n) => Parametric (Tangent (Segment Closed v n))
Instance details Defined in Diagrams.Tangent Methods atParam :: Tangent (Segment Closed v n) -> N (Tangent (Segment Closed v n)) -> Codomain (Tangent (Segment Closed v n)) (N (Tangent (Segment Closed v n))) #
ToPath (Located [Segment Closed v n])
Instance details Defined in Diagrams.Path Methods toPath :: Located [Segment Closed v n] -> Path (V (Located [Segment Closed v n])) (N (Located [Segment Closed v n])) #
ToPath (Located (Segment Closed v n))
Instance details Defined in Diagrams.Path Methods toPath :: Located (Segment Closed v n) -> Path (V (Located (Segment Closed v n))) (N (Located (Segment Closed v n))) #
Functor v => Functor (Segment c v)
Instance details Defined in Diagrams.Segment Methods fmap :: (a -> b) -> Segment c v a -> Segment c v b # (<$) :: a -> Segment c v b -> Segment c v a #
(Metric v, OrderedField n, Metric u, OrderedField n') => Cons (SegTree v n) (SegTree u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Cons :: Prism (SegTree v n) (SegTree u n') (Segment Closed v n, SegTree v n) (Segment Closed u n', SegTree u n') #
(Metric v, OrderedField n, Metric u, OrderedField n') => Snoc (SegTree v n) (SegTree u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Snoc :: Prism (SegTree v n) (SegTree u n') (SegTree v n, Segment Closed v n) (SegTree u n', Segment Closed u n') #
(OrderedField n, Metric v) => Measured (SegMeasure v n) (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods measure :: Segment Closed v n -> SegMeasure v n
Eq (v n) => Eq (Segment c v n)
Instance details Defined in Diagrams.Segment Methods (==) :: Segment c v n -> Segment c v n -> Bool # (/=) :: Segment c v n -> Segment c v n -> Bool #
Ord (v n) => Ord (Segment c v n)
Instance details Defined in Diagrams.Segment Methods compare :: Segment c v n -> Segment c v n -> Ordering # (<) :: Segment c v n -> Segment c v n -> Bool # (<=) :: Segment c v n -> Segment c v n -> Bool # (>) :: Segment c v n -> Segment c v n -> Bool # (>=) :: Segment c v n -> Segment c v n -> Bool # max :: Segment c v n -> Segment c v n -> Segment c v n # min :: Segment c v n -> Segment c v n -> Segment c v n #
Show (v n) => Show (Segment c v n)
Instance details Defined in Diagrams.Segment Methods showsPrec :: Int -> Segment c v n -> ShowS # show :: Segment c v n -> String # showList :: [Segment c v n] -> ShowS #
(Metric v, OrderedField n) => Enveloped (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods getEnvelope :: Segment Closed v n -> Envelope (V (Segment Closed v n)) (N (Segment Closed v n)) #
Transformable (Segment c v n)
Instance details Defined in Diagrams.Segment Methods transform :: Transformation (V (Segment c v n)) (N (Segment c v n)) -> Segment c v n -> Segment c v n #
Num n => DomainBounds (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods domainLower :: Segment Closed v n -> N (Segment Closed v n) # domainUpper :: Segment Closed v n -> N (Segment Closed v n) #
(Additive v, Num n) => EndValues (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods atStart :: Segment Closed v n -> Codomain (Segment Closed v n) (N (Segment Closed v n)) # atEnd :: Segment Closed v n -> Codomain (Segment Closed v n) (N (Segment Closed v n)) #
(Metric v, OrderedField n) => HasArcLength (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods arcLengthBounded :: N (Segment Closed v n) -> Segment Closed v n -> Interval (N (Segment Closed v n)) # arcLength :: N (Segment Closed v n) -> Segment Closed v n -> N (Segment Closed v n) # stdArcLength :: Segment Closed v n -> N (Segment Closed v n) # arcLengthToParam :: N (Segment Closed v n) -> Segment Closed v n -> N (Segment Closed v n) -> N (Segment Closed v n) # stdArcLengthToParam :: Segment Closed v n -> N (Segment Closed v n) -> N (Segment Closed v n) #
(Additive v, Num n) => Parametric (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods atParam :: Segment Closed v n -> N (Segment Closed v n) -> Codomain (Segment Closed v n) (N (Segment Closed v n)) #
(Additive v, Fractional n) => Sectionable (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods splitAtParam :: Segment Closed v n -> N (Segment Closed v n) -> (Segment Closed v n, Segment Closed v n) # section :: Segment Closed v n -> N (Segment Closed v n) -> N (Segment Closed v n) -> Segment Closed v n # reverseDomain :: Segment Closed v n -> Segment Closed v n #
(Additive v, Num n) => Reversing (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods reversing :: Segment Closed v n -> Segment Closed v n #
Serialize (v n) => Serialize (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods put :: Putter (Segment Closed v n) get :: Get (Segment Closed v n)
Serialize (v n) => Serialize (Segment Open v n)
Instance details Defined in Diagrams.Segment Methods put :: Putter (Segment Open v n) get :: Get (Segment Open v n)
Renderable (Segment c v n) NullBackend
Instance details Defined in Diagrams.Segment Methods render :: NullBackend -> Segment c v n -> Render NullBackend (V (Segment c v n)) (N (Segment c v n)) #
Each (Segment c v n) (Segment c v' n') (v n) (v' n')
Instance details Defined in Diagrams.Segment Methods each :: Traversal (Segment c v n) (Segment c v' n') (v n) (v' n') #
(Metric v, OrderedField n, Metric u, OrderedField n') => Cons (Trail' Line v n) (Trail' Line u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Cons :: Prism (Trail' Line v n) (Trail' Line u n') (Segment Closed v n, Trail' Line v n) (Segment Closed u n', Trail' Line u n') #
(Metric v, OrderedField n, Metric u, OrderedField n') => Snoc (Trail' Line v n) (Trail' Line u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Snoc :: Prism (Trail' Line v n) (Trail' Line u n') (Trail' Line v n, Segment Closed v n) (Trail' Line u n', Segment Closed u n') #
type N (Segment c v n)
Instance details Defined in Diagrams.Segment type N (Segment c v n) = n
type V (Segment c v n)
Instance details Defined in Diagrams.Segment type V (Segment c v n) = v
type Codomain (Segment Closed v n)
Instance details Defined in Diagrams.Segment type Codomain (Segment Closed v n) = v

newtype TotalOffset (v :: Type -> Type) n #

Constructors

TotalOffset (v n)

Instances

(Num n, Additive v) => Semigroup (TotalOffset v n)
Instance details Defined in Diagrams.Segment Methods (<>) :: TotalOffset v n -> TotalOffset v n -> TotalOffset v n # sconcat :: NonEmpty (TotalOffset v n) -> TotalOffset v n # stimes :: Integral b => b -> TotalOffset v n -> TotalOffset v n #
(Num n, Additive v) => Monoid (TotalOffset v n)
Instance details Defined in Diagrams.Segment Methods mempty :: TotalOffset v n # mappend :: TotalOffset v n -> TotalOffset v n -> TotalOffset v n # mconcat :: [TotalOffset v n] -> TotalOffset v n #
Wrapped (TotalOffset v n)
Instance details Defined in Diagrams.Segment Associated Types type Unwrapped (TotalOffset v n) :: Type # Methods _Wrapped' :: Iso' (TotalOffset v n) (Unwrapped (TotalOffset v n)) #
Rewrapped (TotalOffset v n) (TotalOffset v' n')
Instance details Defined in Diagrams.Segment
type Unwrapped (TotalOffset v n)
Instance details Defined in Diagrams.Segment type Unwrapped (TotalOffset v n) = v n

data SizeSpec (v :: Type -> Type) n #

Instances

Functor v => Functor (SizeSpec v)
Instance details Defined in Diagrams.Size Methods fmap :: (a -> b) -> SizeSpec v a -> SizeSpec v b # (<$) :: a -> SizeSpec v b -> SizeSpec v a #
Show (v n) => Show (SizeSpec v n)
Instance details Defined in Diagrams.Size Methods showsPrec :: Int -> SizeSpec v n -> ShowS # show :: SizeSpec v n -> String # showList :: [SizeSpec v n] -> ShowS #
Generic (SizeSpec v n)
Instance details Defined in Diagrams.Size Associated Types type Rep (SizeSpec v n) :: Type -> Type # Methods from :: SizeSpec v n -> Rep (SizeSpec v n) x # to :: Rep (SizeSpec v n) x -> SizeSpec v n #
Hashable (v n) => Hashable (SizeSpec v n)
Instance details Defined in Diagrams.Size Methods hashWithSalt :: Int -> SizeSpec v n -> Int hash :: SizeSpec v n -> Int
type Rep (SizeSpec v n)
Instance details Defined in Diagrams.Size type Rep (SizeSpec v n) = D1 (MetaData "SizeSpec" "Diagrams.Size" "dgrms-lb-1.4.2.3-8d574a09" True) (C1 (MetaCons "SizeSpec" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (v n))))
type N (SizeSpec v n)
Instance details Defined in Diagrams.Size type N (SizeSpec v n) = n
type V (SizeSpec v n)
Instance details Defined in Diagrams.Size type V (SizeSpec v n) = v

newtype Tangent t #

Constructors

Tangent t

Instances

DomainBounds t => DomainBounds (Tangent t)
Instance details Defined in Diagrams.Tangent Methods domainLower :: Tangent t -> N (Tangent t) # domainUpper :: Tangent t -> N (Tangent t) #
(DomainBounds t, EndValues (Tangent t)) => EndValues (Tangent (Located t))
Instance details Defined in Diagrams.Tangent Methods atStart :: Tangent (Located t) -> Codomain (Tangent (Located t)) (N (Tangent (Located t))) # atEnd :: Tangent (Located t) -> Codomain (Tangent (Located t)) (N (Tangent (Located t))) #
(Additive v, Num n) => EndValues (Tangent (FixedSegment v n))
Instance details Defined in Diagrams.Tangent Methods atStart :: Tangent (FixedSegment v n) -> Codomain (Tangent (FixedSegment v n)) (N (Tangent (FixedSegment v n))) # atEnd :: Tangent (FixedSegment v n) -> Codomain (Tangent (FixedSegment v n)) (N (Tangent (FixedSegment v n))) #
(Additive v, Num n) => EndValues (Tangent (Segment Closed v n))
Instance details Defined in Diagrams.Tangent Methods atStart :: Tangent (Segment Closed v n) -> Codomain (Tangent (Segment Closed v n)) (N (Tangent (Segment Closed v n))) # atEnd :: Tangent (Segment Closed v n) -> Codomain (Tangent (Segment Closed v n)) (N (Tangent (Segment Closed v n))) #
(Metric v, OrderedField n, Real n) => EndValues (Tangent (Trail v n))
Instance details Defined in Diagrams.Trail Methods atStart :: Tangent (Trail v n) -> Codomain (Tangent (Trail v n)) (N (Tangent (Trail v n))) # atEnd :: Tangent (Trail v n) -> Codomain (Tangent (Trail v n)) (N (Tangent (Trail v n))) #
(Parametric (GetSegment (Trail' c v n)), EndValues (GetSegment (Trail' c v n)), Additive v, Num n) => EndValues (Tangent (Trail' c v n))
Instance details Defined in Diagrams.Trail Methods atStart :: Tangent (Trail' c v n) -> Codomain (Tangent (Trail' c v n)) (N (Tangent (Trail' c v n))) # atEnd :: Tangent (Trail' c v n) -> Codomain (Tangent (Trail' c v n)) (N (Tangent (Trail' c v n))) #
Parametric (Tangent t) => Parametric (Tangent (Located t))
Instance details Defined in Diagrams.Tangent Methods atParam :: Tangent (Located t) -> N (Tangent (Located t)) -> Codomain (Tangent (Located t)) (N (Tangent (Located t))) #
(Additive v, Num n) => Parametric (Tangent (FixedSegment v n))
Instance details Defined in Diagrams.Tangent Methods atParam :: Tangent (FixedSegment v n) -> N (Tangent (FixedSegment v n)) -> Codomain (Tangent (FixedSegment v n)) (N (Tangent (FixedSegment v n))) #
(Additive v, Num n) => Parametric (Tangent (Segment Closed v n))
Instance details Defined in Diagrams.Tangent Methods atParam :: Tangent (Segment Closed v n) -> N (Tangent (Segment Closed v n)) -> Codomain (Tangent (Segment Closed v n)) (N (Tangent (Segment Closed v n))) #
(Metric v, OrderedField n, Real n) => Parametric (Tangent (Trail v n))
Instance details Defined in Diagrams.Trail Methods atParam :: Tangent (Trail v n) -> N (Tangent (Trail v n)) -> Codomain (Tangent (Trail v n)) (N (Tangent (Trail v n))) #
(Parametric (GetSegment (Trail' c v n)), Additive v, Num n) => Parametric (Tangent (Trail' c v n))
Instance details Defined in Diagrams.Trail Methods atParam :: Tangent (Trail' c v n) -> N (Tangent (Trail' c v n)) -> Codomain (Tangent (Trail' c v n)) (N (Tangent (Trail' c v n))) #
type N (Tangent t)
Instance details Defined in Diagrams.Tangent type N (Tangent t) = N t
type V (Tangent t)
Instance details Defined in Diagrams.Tangent type V (Tangent t) = V t
type Codomain (Tangent t)
Instance details Defined in Diagrams.Tangent type Codomain (Tangent t) = V t

newtype Ambient #

Constructors

Ambient (Last Double)

Instances

Show Ambient
Instance details Defined in Diagrams.ThreeD.Attributes Methods showsPrec :: Int -> Ambient -> ShowS # show :: Ambient -> String # showList :: [Ambient] -> ShowS #
Semigroup Ambient
Instance details Defined in Diagrams.ThreeD.Attributes Methods (<>) :: Ambient -> Ambient -> Ambient # sconcat :: NonEmpty Ambient -> Ambient # stimes :: Integral b => b -> Ambient -> Ambient #
AttributeClass Ambient
Instance details Defined in Diagrams.ThreeD.Attributes

newtype Diffuse #

Constructors

Diffuse (Last Double)

Instances

Show Diffuse
Instance details Defined in Diagrams.ThreeD.Attributes Methods showsPrec :: Int -> Diffuse -> ShowS # show :: Diffuse -> String # showList :: [Diffuse] -> ShowS #
Semigroup Diffuse
Instance details Defined in Diagrams.ThreeD.Attributes Methods (<>) :: Diffuse -> Diffuse -> Diffuse # sconcat :: NonEmpty Diffuse -> Diffuse # stimes :: Integral b => b -> Diffuse -> Diffuse #
AttributeClass Diffuse
Instance details Defined in Diagrams.ThreeD.Attributes

newtype Highlight #

Constructors

Highlight (Last Specular)

Instances

Show Highlight
Instance details Defined in Diagrams.ThreeD.Attributes Methods showsPrec :: Int -> Highlight -> ShowS # show :: Highlight -> String # showList :: [Highlight] -> ShowS #
Semigroup Highlight
Instance details Defined in Diagrams.ThreeD.Attributes Methods (<>) :: Highlight -> Highlight -> Highlight # sconcat :: NonEmpty Highlight -> Highlight # stimes :: Integral b => b -> Highlight -> Highlight #
AttributeClass Highlight
Instance details Defined in Diagrams.ThreeD.Attributes

data Specular #

Constructors

Specular
Fields _specularIntensity :: Double _specularSize :: Double

Instances

Show Specular
Instance details Defined in Diagrams.ThreeD.Attributes Methods showsPrec :: Int -> Specular -> ShowS # show :: Specular -> String # showList :: [Specular] -> ShowS #

newtype SurfaceColor #

Constructors

SurfaceColor (Last (Colour Double))

Instances

Show SurfaceColor
Instance details Defined in Diagrams.ThreeD.Attributes Methods showsPrec :: Int -> SurfaceColor -> ShowS # show :: SurfaceColor -> String # showList :: [SurfaceColor] -> ShowS #
Semigroup SurfaceColor
Instance details Defined in Diagrams.ThreeD.Attributes Methods (<>) :: SurfaceColor -> SurfaceColor -> SurfaceColor # sconcat :: NonEmpty SurfaceColor -> SurfaceColor # stimes :: Integral b => b -> SurfaceColor -> SurfaceColor #
AttributeClass SurfaceColor
Instance details Defined in Diagrams.ThreeD.Attributes

data Camera (l :: Type -> Type) n #

Instances

Num n => Transformable (Camera l n)
Instance details Defined in Diagrams.ThreeD.Camera Methods transform :: Transformation (V (Camera l n)) (N (Camera l n)) -> Camera l n -> Camera l n #
Num n => Renderable (Camera l n) NullBackend
Instance details Defined in Diagrams.ThreeD.Camera Methods render :: NullBackend -> Camera l n -> Render NullBackend (V (Camera l n)) (N (Camera l n)) #
type N (Camera l n)
Instance details Defined in Diagrams.ThreeD.Camera type N (Camera l n) = n
type V (Camera l n)
Instance details Defined in Diagrams.ThreeD.Camera type V (Camera l n) = V3

aspect :: (CameraLens l, Floating n) => l n -> n #

data OrthoLens n #

Constructors

OrthoLens
Fields _orthoWidth :: n _orthoHeight :: n

Instances

CameraLens OrthoLens
Instance details Defined in Diagrams.ThreeD.Camera Methods aspect :: Floating n => OrthoLens n -> n #
type N (OrthoLens n)
Instance details Defined in Diagrams.ThreeD.Camera type N (OrthoLens n) = n
type V (OrthoLens n)
Instance details Defined in Diagrams.ThreeD.Camera type V (OrthoLens n) = V3

data PerspectiveLens n #

Constructors

PerspectiveLens
Fields _horizontalFieldOfView :: Angle n _verticalFieldOfView :: Angle n

Instances

CameraLens PerspectiveLens
Instance details Defined in Diagrams.ThreeD.Camera Methods aspect :: Floating n => PerspectiveLens n -> n #
type N (PerspectiveLens n)
Instance details Defined in Diagrams.ThreeD.Camera type N (PerspectiveLens n) = n
type V (PerspectiveLens n)
Instance details Defined in Diagrams.ThreeD.Camera type V (PerspectiveLens n) = V3

data ParallelLight n #

Constructors

ParallelLight (V3 n) (Colour Double)

Instances

Transformable (ParallelLight n)
Instance details Defined in Diagrams.ThreeD.Light Methods transform :: Transformation (V (ParallelLight n)) (N (ParallelLight n)) -> ParallelLight n -> ParallelLight n #
type N (ParallelLight n)
Instance details Defined in Diagrams.ThreeD.Light type N (ParallelLight n) = n
type V (ParallelLight n)
Instance details Defined in Diagrams.ThreeD.Light type V (ParallelLight n) = V3

data PointLight n #

Constructors

PointLight (Point V3 n) (Colour Double)

Instances

Fractional n => Transformable (PointLight n)
Instance details Defined in Diagrams.ThreeD.Light Methods transform :: Transformation (V (PointLight n)) (N (PointLight n)) -> PointLight n -> PointLight n #
type N (PointLight n)
Instance details Defined in Diagrams.ThreeD.Light type N (PointLight n) = n
type V (PointLight n)
Instance details Defined in Diagrams.ThreeD.Light type V (PointLight n) = V3

data Box n #

Constructors

Box (Transformation V3 n)

Instances

CsgPrim Box
Instance details Defined in Diagrams.ThreeD.Shapes Methods toCsg :: Box n -> CSG n
OrderedField n => Enveloped (Box n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getEnvelope :: Box n -> Envelope (V (Box n)) (N (Box n)) #
(Fractional n, Ord n) => Traced (Box n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getTrace :: Box n -> Trace (V (Box n)) (N (Box n)) #
Fractional n => Transformable (Box n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods transform :: Transformation (V (Box n)) (N (Box n)) -> Box n -> Box n #
OrderedField n => Skinned (Box n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods skin :: (Renderable (Box n) b, N (Box n) ~ n0, TypeableFloat n0) => Box n -> QDiagram b V3 n0 Any #
Fractional n => Renderable (Box n) NullBackend
Instance details Defined in Diagrams.ThreeD.Shapes Methods render :: NullBackend -> Box n -> Render NullBackend (V (Box n)) (N (Box n)) #
(Num n, Ord n) => HasQuery (Box n) Any
Instance details Defined in Diagrams.ThreeD.Shapes Methods getQuery :: Box n -> Query (V (Box n)) (N (Box n)) Any #
type N (Box n)
Instance details Defined in Diagrams.ThreeD.Shapes type N (Box n) = n
type V (Box n)
Instance details Defined in Diagrams.ThreeD.Shapes type V (Box n) = V3

data CSG n #

Constructors

CsgEllipsoid (Ellipsoid n)
CsgBox (Box n)
CsgFrustum (Frustum n)
CsgUnion [CSG n]
CsgIntersection [CSG n]
CsgDifference (CSG n) (CSG n)

Instances

CsgPrim CSG
Instance details Defined in Diagrams.ThreeD.Shapes Methods toCsg :: CSG n -> CSG n
RealFloat n => Enveloped (CSG n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getEnvelope :: CSG n -> Envelope (V (CSG n)) (N (CSG n)) #
(RealFloat n, Ord n) => Traced (CSG n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getTrace :: CSG n -> Trace (V (CSG n)) (N (CSG n)) #
Fractional n => Transformable (CSG n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods transform :: Transformation (V (CSG n)) (N (CSG n)) -> CSG n -> CSG n #
(RealFloat n, Ord n) => Skinned (CSG n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods skin :: (Renderable (CSG n) b, N (CSG n) ~ n0, TypeableFloat n0) => CSG n -> QDiagram b V3 n0 Any #
(Floating n, Ord n) => HasQuery (CSG n) Any
Instance details Defined in Diagrams.ThreeD.Shapes Methods getQuery :: CSG n -> Query (V (CSG n)) (N (CSG n)) Any #
type N (CSG n)
Instance details Defined in Diagrams.ThreeD.Shapes type N (CSG n) = n
type V (CSG n)
Instance details Defined in Diagrams.ThreeD.Shapes type V (CSG n) = V3

data Ellipsoid n #

Constructors

Ellipsoid (Transformation V3 n)

Instances

CsgPrim Ellipsoid
Instance details Defined in Diagrams.ThreeD.Shapes Methods toCsg :: Ellipsoid n -> CSG n
OrderedField n => Enveloped (Ellipsoid n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getEnvelope :: Ellipsoid n -> Envelope (V (Ellipsoid n)) (N (Ellipsoid n)) #
OrderedField n => Traced (Ellipsoid n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getTrace :: Ellipsoid n -> Trace (V (Ellipsoid n)) (N (Ellipsoid n)) #
Fractional n => Transformable (Ellipsoid n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods transform :: Transformation (V (Ellipsoid n)) (N (Ellipsoid n)) -> Ellipsoid n -> Ellipsoid n #
OrderedField n => Skinned (Ellipsoid n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods skin :: (Renderable (Ellipsoid n) b, N (Ellipsoid n) ~ n0, TypeableFloat n0) => Ellipsoid n -> QDiagram b V3 n0 Any #
Fractional n => Renderable (Ellipsoid n) NullBackend
Instance details Defined in Diagrams.ThreeD.Shapes Methods render :: NullBackend -> Ellipsoid n -> Render NullBackend (V (Ellipsoid n)) (N (Ellipsoid n)) #
(Num n, Ord n) => HasQuery (Ellipsoid n) Any
Instance details Defined in Diagrams.ThreeD.Shapes Methods getQuery :: Ellipsoid n -> Query (V (Ellipsoid n)) (N (Ellipsoid n)) Any #
type N (Ellipsoid n)
Instance details Defined in Diagrams.ThreeD.Shapes type N (Ellipsoid n) = n
type V (Ellipsoid n)
Instance details Defined in Diagrams.ThreeD.Shapes type V (Ellipsoid n) = V3

data Frustum n #

Constructors

Frustum n n (Transformation V3 n)

Instances

CsgPrim Frustum
Instance details Defined in Diagrams.ThreeD.Shapes Methods toCsg :: Frustum n -> CSG n
(OrderedField n, RealFloat n) => Enveloped (Frustum n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getEnvelope :: Frustum n -> Envelope (V (Frustum n)) (N (Frustum n)) #
(RealFloat n, Ord n) => Traced (Frustum n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods getTrace :: Frustum n -> Trace (V (Frustum n)) (N (Frustum n)) #
Fractional n => Transformable (Frustum n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods transform :: Transformation (V (Frustum n)) (N (Frustum n)) -> Frustum n -> Frustum n #
Skinned (Frustum n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods skin :: (Renderable (Frustum n) b, N (Frustum n) ~ n0, TypeableFloat n0) => Frustum n -> QDiagram b V3 n0 Any #
Fractional n => Renderable (Frustum n) NullBackend
Instance details Defined in Diagrams.ThreeD.Shapes Methods render :: NullBackend -> Frustum n -> Render NullBackend (V (Frustum n)) (N (Frustum n)) #
OrderedField n => HasQuery (Frustum n) Any
Instance details Defined in Diagrams.ThreeD.Shapes Methods getQuery :: Frustum n -> Query (V (Frustum n)) (N (Frustum n)) Any #
type N (Frustum n)
Instance details Defined in Diagrams.ThreeD.Shapes type N (Frustum n) = n
type V (Frustum n)
Instance details Defined in Diagrams.ThreeD.Shapes type V (Frustum n) = V3

class Skinned t where #

Methods

skin :: (Renderable t b, N t ~ n, TypeableFloat n) => t -> QDiagram b V3 n Any #

Instances

OrderedField n => Skinned (Box n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods skin :: (Renderable (Box n) b, N (Box n) ~ n0, TypeableFloat n0) => Box n -> QDiagram b V3 n0 Any #
(RealFloat n, Ord n) => Skinned (CSG n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods skin :: (Renderable (CSG n) b, N (CSG n) ~ n0, TypeableFloat n0) => CSG n -> QDiagram b V3 n0 Any #
OrderedField n => Skinned (Ellipsoid n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods skin :: (Renderable (Ellipsoid n) b, N (Ellipsoid n) ~ n0, TypeableFloat n0) => Ellipsoid n -> QDiagram b V3 n0 Any #
Skinned (Frustum n)
Instance details Defined in Diagrams.ThreeD.Shapes Methods skin :: (Renderable (Frustum n) b, N (Frustum n) ~ n0, TypeableFloat n0) => Frustum n -> QDiagram b V3 n0 Any #

type P3 = Point V3 #

type T3 = Transformation V3 #

newtype GetSegment t #

Constructors

GetSegment t

Instances

DomainBounds t => DomainBounds (GetSegment t)
Instance details Defined in Diagrams.Trail Methods domainLower :: GetSegment t -> N (GetSegment t) # domainUpper :: GetSegment t -> N (GetSegment t) #
(Metric v, OrderedField n, Real n) => EndValues (GetSegment (Trail v n))
Instance details Defined in Diagrams.Trail Methods atStart :: GetSegment (Trail v n) -> Codomain (GetSegment (Trail v n)) (N (GetSegment (Trail v n))) # atEnd :: GetSegment (Trail v n) -> Codomain (GetSegment (Trail v n)) (N (GetSegment (Trail v n))) #
(Metric v, OrderedField n) => EndValues (GetSegment (Trail' Line v n))
Instance details Defined in Diagrams.Trail Methods atStart :: GetSegment (Trail' Line v n) -> Codomain (GetSegment (Trail' Line v n)) (N (GetSegment (Trail' Line v n))) # atEnd :: GetSegment (Trail' Line v n) -> Codomain (GetSegment (Trail' Line v n)) (N (GetSegment (Trail' Line v n))) #
(Metric v, OrderedField n, Real n) => EndValues (GetSegment (Trail' Loop v n))
Instance details Defined in Diagrams.Trail Methods atStart :: GetSegment (Trail' Loop v n) -> Codomain (GetSegment (Trail' Loop v n)) (N (GetSegment (Trail' Loop v n))) # atEnd :: GetSegment (Trail' Loop v n) -> Codomain (GetSegment (Trail' Loop v n)) (N (GetSegment (Trail' Loop v n))) #
(Metric v, OrderedField n, Real n) => Parametric (GetSegment (Trail v n))
Instance details Defined in Diagrams.Trail Methods atParam :: GetSegment (Trail v n) -> N (GetSegment (Trail v n)) -> Codomain (GetSegment (Trail v n)) (N (GetSegment (Trail v n))) #
(Metric v, OrderedField n) => Parametric (GetSegment (Trail' Line v n))
Instance details Defined in Diagrams.Trail Methods atParam :: GetSegment (Trail' Line v n) -> N (GetSegment (Trail' Line v n)) -> Codomain (GetSegment (Trail' Line v n)) (N (GetSegment (Trail' Line v n))) #
(Metric v, OrderedField n, Real n) => Parametric (GetSegment (Trail' Loop v n))
Instance details Defined in Diagrams.Trail Methods atParam :: GetSegment (Trail' Loop v n) -> N (GetSegment (Trail' Loop v n)) -> Codomain (GetSegment (Trail' Loop v n)) (N (GetSegment (Trail' Loop v n))) #
type N (GetSegment t)
Instance details Defined in Diagrams.Trail type N (GetSegment t) = N t
type V (GetSegment t)
Instance details Defined in Diagrams.Trail type V (GetSegment t) = V t
type Codomain (GetSegment t)
Instance details Defined in Diagrams.Trail type Codomain (GetSegment t) = GetSegmentCodomain (V t)

newtype GetSegmentCodomain (v :: Type -> Type) n #

Constructors

GetSegmentCodomain (Maybe (v n, Segment Closed v n, AnIso' n n))

data Line #

Instances

(Metric v, OrderedField n) => EndValues (GetSegment (Trail' Line v n))
Instance details Defined in Diagrams.Trail Methods atStart :: GetSegment (Trail' Line v n) -> Codomain (GetSegment (Trail' Line v n)) (N (GetSegment (Trail' Line v n))) # atEnd :: GetSegment (Trail' Line v n) -> Codomain (GetSegment (Trail' Line v n)) (N (GetSegment (Trail' Line v n))) #
(Metric v, OrderedField n) => Parametric (GetSegment (Trail' Line v n))
Instance details Defined in Diagrams.Trail Methods atParam :: GetSegment (Trail' Line v n) -> N (GetSegment (Trail' Line v n)) -> Codomain (GetSegment (Trail' Line v n)) (N (GetSegment (Trail' Line v n))) #
(OrderedField n, Metric v) => Semigroup (Trail' Line v n)
Instance details Defined in Diagrams.Trail Methods (<>) :: Trail' Line v n -> Trail' Line v n -> Trail' Line v n # sconcat :: NonEmpty (Trail' Line v n) -> Trail' Line v n # stimes :: Integral b => b -> Trail' Line v n -> Trail' Line v n #
(Metric v, OrderedField n) => Monoid (Trail' Line v n)
Instance details Defined in Diagrams.Trail Methods mempty :: Trail' Line v n # mappend :: Trail' Line v n -> Trail' Line v n -> Trail' Line v n # mconcat :: [Trail' Line v n] -> Trail' Line v n #
(Metric v, OrderedField n, Real n) => Sectionable (Trail' Line v n)
Instance details Defined in Diagrams.Trail Methods splitAtParam :: Trail' Line v n -> N (Trail' Line v n) -> (Trail' Line v n, Trail' Line v n) # section :: Trail' Line v n -> N (Trail' Line v n) -> N (Trail' Line v n) -> Trail' Line v n # reverseDomain :: Trail' Line v n -> Trail' Line v n #
(Metric v, OrderedField n) => TrailLike (Trail' Line v n)
Instance details Defined in Diagrams.TrailLike Methods trailLike :: Located (Trail (V (Trail' Line v n)) (N (Trail' Line v n))) -> Trail' Line v n #
(Metric v, OrderedField n) => AsEmpty (Trail' Line v n)
Instance details Defined in Diagrams.Trail Methods _Empty :: Prism' (Trail' Line v n) () #
Wrapped (Trail' Line v n)
Instance details Defined in Diagrams.Trail Associated Types type Unwrapped (Trail' Line v n) :: Type # Methods _Wrapped' :: Iso' (Trail' Line v n) (Unwrapped (Trail' Line v n)) #
Rewrapped (Trail' Line v n) (Trail' Line v' n')
Instance details Defined in Diagrams.Trail
(Metric v, OrderedField n, Metric u, OrderedField n') => Cons (Trail' Line v n) (Trail' Line u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Cons :: Prism (Trail' Line v n) (Trail' Line u n') (Segment Closed v n, Trail' Line v n) (Segment Closed u n', Trail' Line u n') #
(Metric v, OrderedField n, Metric u, OrderedField n') => Snoc (Trail' Line v n) (Trail' Line u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Snoc :: Prism (Trail' Line v n) (Trail' Line u n') (Trail' Line v n, Segment Closed v n) (Trail' Line u n', Segment Closed u n') #
type Unwrapped (Trail' Line v n)
Instance details Defined in Diagrams.Trail type Unwrapped (Trail' Line v n) = SegTree v n

data Loop #

Instances

(Metric v, OrderedField n, Real n) => EndValues (GetSegment (Trail' Loop v n))
Instance details Defined in Diagrams.Trail Methods atStart :: GetSegment (Trail' Loop v n) -> Codomain (GetSegment (Trail' Loop v n)) (N (GetSegment (Trail' Loop v n))) # atEnd :: GetSegment (Trail' Loop v n) -> Codomain (GetSegment (Trail' Loop v n)) (N (GetSegment (Trail' Loop v n))) #
(Metric v, OrderedField n, Real n) => Parametric (GetSegment (Trail' Loop v n))
Instance details Defined in Diagrams.Trail Methods atParam :: GetSegment (Trail' Loop v n) -> N (GetSegment (Trail' Loop v n)) -> Codomain (GetSegment (Trail' Loop v n)) (N (GetSegment (Trail' Loop v n))) #
(Metric v, OrderedField n) => TrailLike (Trail' Loop v n)
Instance details Defined in Diagrams.TrailLike Methods trailLike :: Located (Trail (V (Trail' Loop v n)) (N (Trail' Loop v n))) -> Trail' Loop v n #

newtype SegTree (v :: Type -> Type) n #

Constructors

SegTree (FingerTree (SegMeasure v n) (Segment Closed v n))

Instances

Eq (v n) => Eq (SegTree v n)
Instance details Defined in Diagrams.Trail Methods (==) :: SegTree v n -> SegTree v n -> Bool # (/=) :: SegTree v n -> SegTree v n -> Bool #
Ord (v n) => Ord (SegTree v n)
Instance details Defined in Diagrams.Trail Methods compare :: SegTree v n -> SegTree v n -> Ordering # (<) :: SegTree v n -> SegTree v n -> Bool # (<=) :: SegTree v n -> SegTree v n -> Bool # (>) :: SegTree v n -> SegTree v n -> Bool # (>=) :: SegTree v n -> SegTree v n -> Bool # max :: SegTree v n -> SegTree v n -> SegTree v n # min :: SegTree v n -> SegTree v n -> SegTree v n #
Show (v n) => Show (SegTree v n)
Instance details Defined in Diagrams.Trail Methods showsPrec :: Int -> SegTree v n -> ShowS # show :: SegTree v n -> String # showList :: [SegTree v n] -> ShowS #
(Ord n, Floating n, Metric v) => Semigroup (SegTree v n)
Instance details Defined in Diagrams.Trail Methods (<>) :: SegTree v n -> SegTree v n -> SegTree v n # sconcat :: NonEmpty (SegTree v n) -> SegTree v n # stimes :: Integral b => b -> SegTree v n -> SegTree v n #
(Floating n, Ord n, Metric v) => Monoid (SegTree v n)
Instance details Defined in Diagrams.Trail Methods mempty :: SegTree v n # mappend :: SegTree v n -> SegTree v n -> SegTree v n # mconcat :: [SegTree v n] -> SegTree v n #
(Floating n, Ord n, Metric v) => Transformable (SegTree v n)
Instance details Defined in Diagrams.Trail Methods transform :: Transformation (V (SegTree v n)) (N (SegTree v n)) -> SegTree v n -> SegTree v n #
Num n => DomainBounds (SegTree v n)
Instance details Defined in Diagrams.Trail Methods domainLower :: SegTree v n -> N (SegTree v n) # domainUpper :: SegTree v n -> N (SegTree v n) #
(Metric v, OrderedField n, Real n) => EndValues (SegTree v n)
Instance details Defined in Diagrams.Trail Methods atStart :: SegTree v n -> Codomain (SegTree v n) (N (SegTree v n)) # atEnd :: SegTree v n -> Codomain (SegTree v n) (N (SegTree v n)) #
(Metric v, OrderedField n, Real n) => HasArcLength (SegTree v n)
Instance details Defined in Diagrams.Trail Methods arcLengthBounded :: N (SegTree v n) -> SegTree v n -> Interval (N (SegTree v n)) # arcLength :: N (SegTree v n) -> SegTree v n -> N (SegTree v n) # stdArcLength :: SegTree v n -> N (SegTree v n) # arcLengthToParam :: N (SegTree v n) -> SegTree v n -> N (SegTree v n) -> N (SegTree v n) # stdArcLengthToParam :: SegTree v n -> N (SegTree v n) -> N (SegTree v n) #
(Metric v, OrderedField n, Real n) => Parametric (SegTree v n)
Instance details Defined in Diagrams.Trail Methods atParam :: SegTree v n -> N (SegTree v n) -> Codomain (SegTree v n) (N (SegTree v n)) #
(Metric v, OrderedField n, Real n) => Sectionable (SegTree v n)
Instance details Defined in Diagrams.Trail Methods splitAtParam :: SegTree v n -> N (SegTree v n) -> (SegTree v n, SegTree v n) # section :: SegTree v n -> N (SegTree v n) -> N (SegTree v n) -> SegTree v n # reverseDomain :: SegTree v n -> SegTree v n #
Wrapped (SegTree v n)
Instance details Defined in Diagrams.Trail Associated Types type Unwrapped (SegTree v n) :: Type # Methods _Wrapped' :: Iso' (SegTree v n) (Unwrapped (SegTree v n)) #
(OrderedField n, Metric v, Serialize (v n)) => Serialize (SegTree v n)
Instance details Defined in Diagrams.Trail Methods put :: Putter (SegTree v n) get :: Get (SegTree v n)
Rewrapped (SegTree v n) (SegTree v' n')
Instance details Defined in Diagrams.Trail
(Floating n, Ord n, Metric v) => Measured (SegMeasure v n) (SegTree v n)
Instance details Defined in Diagrams.Trail Methods measure :: SegTree v n -> SegMeasure v n
(Metric v, OrderedField n, Metric u, OrderedField n') => Cons (SegTree v n) (SegTree u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Cons :: Prism (SegTree v n) (SegTree u n') (Segment Closed v n, SegTree v n) (Segment Closed u n', SegTree u n') #
(Metric v, OrderedField n, Metric u, OrderedField n') => Snoc (SegTree v n) (SegTree u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Snoc :: Prism (SegTree v n) (SegTree u n') (SegTree v n, Segment Closed v n) (SegTree u n', Segment Closed u n') #
type N (SegTree v n)
Instance details Defined in Diagrams.Trail type N (SegTree v n) = n
type V (SegTree v n)
Instance details Defined in Diagrams.Trail type V (SegTree v n) = v
type Codomain (SegTree v n)
Instance details Defined in Diagrams.Trail type Codomain (SegTree v n) = v
type Unwrapped (SegTree v n)
Instance details Defined in Diagrams.Trail type Unwrapped (SegTree v n) = FingerTree (SegMeasure v n) (Segment Closed v n)

data Trail (v :: Type -> Type) n where #

Constructors

Trail :: forall (v :: Type -> Type) n l. Trail' l v n -> Trail v n

Instances

(Metric v, OrderedField n, Real n) => EndValues (Tangent (Trail v n))
Instance details Defined in Diagrams.Trail Methods atStart :: Tangent (Trail v n) -> Codomain (Tangent (Trail v n)) (N (Tangent (Trail v n))) # atEnd :: Tangent (Trail v n) -> Codomain (Tangent (Trail v n)) (N (Tangent (Trail v n))) #
(Metric v, OrderedField n, Real n) => EndValues (GetSegment (Trail v n))
Instance details Defined in Diagrams.Trail Methods atStart :: GetSegment (Trail v n) -> Codomain (GetSegment (Trail v n)) (N (GetSegment (Trail v n))) # atEnd :: GetSegment (Trail v n) -> Codomain (GetSegment (Trail v n)) (N (GetSegment (Trail v n))) #
(Metric v, OrderedField n, Real n) => Parametric (Tangent (Trail v n))
Instance details Defined in Diagrams.Trail Methods atParam :: Tangent (Trail v n) -> N (Tangent (Trail v n)) -> Codomain (Tangent (Trail v n)) (N (Tangent (Trail v n))) #
(Metric v, OrderedField n, Real n) => Parametric (GetSegment (Trail v n))
Instance details Defined in Diagrams.Trail Methods atParam :: GetSegment (Trail v n) -> N (GetSegment (Trail v n)) -> Codomain (GetSegment (Trail v n)) (N (GetSegment (Trail v n))) #
ToPath (Located (Trail v n))
Instance details Defined in Diagrams.Path Methods toPath :: Located (Trail v n) -> Path (V (Located (Trail v n))) (N (Located (Trail v n))) #
(Metric v, OrderedField n) => Reversing (Located (Trail v n))
Instance details Defined in Diagrams.Trail Methods reversing :: Located (Trail v n) -> Located (Trail v n) #
(Metric v, Metric u, OrderedField n, r ~ Located (Trail u n)) => Deformable (Located (Trail v n)) r
Instance details Defined in Diagrams.Deform Methods deform' :: N (Located (Trail v n)) -> Deformation (V (Located (Trail v n))) (V r) (N (Located (Trail v n))) -> Located (Trail v n) -> r # deform :: Deformation (V (Located (Trail v n))) (V r) (N (Located (Trail v n))) -> Located (Trail v n) -> r #
Eq (v n) => Eq (Trail v n)
Instance details Defined in Diagrams.Trail Methods (==) :: Trail v n -> Trail v n -> Bool # (/=) :: Trail v n -> Trail v n -> Bool #
Ord (v n) => Ord (Trail v n)
Instance details Defined in Diagrams.Trail Methods compare :: Trail v n -> Trail v n -> Ordering # (<) :: Trail v n -> Trail v n -> Bool # (<=) :: Trail v n -> Trail v n -> Bool # (>) :: Trail v n -> Trail v n -> Bool # (>=) :: Trail v n -> Trail v n -> Bool # max :: Trail v n -> Trail v n -> Trail v n # min :: Trail v n -> Trail v n -> Trail v n #
Show (v n) => Show (Trail v n)
Instance details Defined in Diagrams.Trail Methods showsPrec :: Int -> Trail v n -> ShowS # show :: Trail v n -> String # showList :: [Trail v n] -> ShowS #
(OrderedField n, Metric v) => Semigroup (Trail v n)
Instance details Defined in Diagrams.Trail Methods (<>) :: Trail v n -> Trail v n -> Trail v n # sconcat :: NonEmpty (Trail v n) -> Trail v n # stimes :: Integral b => b -> Trail v n -> Trail v n #
(Metric v, OrderedField n) => Monoid (Trail v n)
Instance details Defined in Diagrams.Trail Methods mempty :: Trail v n # mappend :: Trail v n -> Trail v n -> Trail v n # mconcat :: [Trail v n] -> Trail v n #
(Metric v, OrderedField n) => Enveloped (Trail v n)
Instance details Defined in Diagrams.Trail Methods getEnvelope :: Trail v n -> Envelope (V (Trail v n)) (N (Trail v n)) #
(HasLinearMap v, Metric v, OrderedField n) => Transformable (Trail v n)
Instance details Defined in Diagrams.Trail Methods transform :: Transformation (V (Trail v n)) (N (Trail v n)) -> Trail v n -> Trail v n #
Num n => DomainBounds (Trail v n)
Instance details Defined in Diagrams.Trail Methods domainLower :: Trail v n -> N (Trail v n) # domainUpper :: Trail v n -> N (Trail v n) #
(Metric v, OrderedField n, Real n) => EndValues (Trail v n)
Instance details Defined in Diagrams.Trail Methods atStart :: Trail v n -> Codomain (Trail v n) (N (Trail v n)) # atEnd :: Trail v n -> Codomain (Trail v n) (N (Trail v n)) #
(Metric v, OrderedField n, Real n) => HasArcLength (Trail v n)
Instance details Defined in Diagrams.Trail Methods arcLengthBounded :: N (Trail v n) -> Trail v n -> Interval (N (Trail v n)) # arcLength :: N (Trail v n) -> Trail v n -> N (Trail v n) # stdArcLength :: Trail v n -> N (Trail v n) # arcLengthToParam :: N (Trail v n) -> Trail v n -> N (Trail v n) -> N (Trail v n) # stdArcLengthToParam :: Trail v n -> N (Trail v n) -> N (Trail v n) #
(Metric v, OrderedField n, Real n) => Parametric (Trail v n)
Instance details Defined in Diagrams.Trail Methods atParam :: Trail v n -> N (Trail v n) -> Codomain (Trail v n) (N (Trail v n)) #
(Metric v, OrderedField n, Real n) => Sectionable (Trail v n)
Instance details Defined in Diagrams.Trail Methods splitAtParam :: Trail v n -> N (Trail v n) -> (Trail v n, Trail v n) # section :: Trail v n -> N (Trail v n) -> N (Trail v n) -> Trail v n # reverseDomain :: Trail v n -> Trail v n #
ToPath (Trail v n)
Instance details Defined in Diagrams.Path Methods toPath :: Trail v n -> Path (V (Trail v n)) (N (Trail v n)) #
(Metric v, OrderedField n) => TrailLike (Trail v n)
Instance details Defined in Diagrams.TrailLike Methods trailLike :: Located (Trail (V (Trail v n)) (N (Trail v n))) -> Trail v n #
(Metric v, OrderedField n) => AsEmpty (Trail v n)
Instance details Defined in Diagrams.Trail Methods _Empty :: Prism' (Trail v n) () #
(Metric v, OrderedField n) => Reversing (Trail v n)
Instance details Defined in Diagrams.Trail Methods reversing :: Trail v n -> Trail v n #
Wrapped (Trail v n)
Instance details Defined in Diagrams.Trail Associated Types type Unwrapped (Trail v n) :: Type # Methods _Wrapped' :: Iso' (Trail v n) (Unwrapped (Trail v n)) #
(Serialize (v n), OrderedField n, Metric v) => Serialize (Trail v n)
Instance details Defined in Diagrams.Trail Methods put :: Putter (Trail v n) get :: Get (Trail v n)
Rewrapped (Trail v n) (Trail v' n')
Instance details Defined in Diagrams.Trail
Cons (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n'))
Instance details Defined in Diagrams.Path Methods _Cons :: Prism (Path v n) (Path v' n') (Located (Trail v n), Path v n) (Located (Trail v' n'), Path v' n') #
Snoc (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n'))
Instance details Defined in Diagrams.Path Methods _Snoc :: Prism (Path v n) (Path v' n') (Path v n, Located (Trail v n)) (Path v' n', Located (Trail v' n')) #
Each (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n'))
Instance details Defined in Diagrams.Path Methods each :: Traversal (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n')) #
type N (Trail v n)
Instance details Defined in Diagrams.Trail type N (Trail v n) = n
type V (Trail v n)
Instance details Defined in Diagrams.Trail type V (Trail v n) = v
type Codomain (Trail v n)
Instance details Defined in Diagrams.Trail type Codomain (Trail v n) = v
type Unwrapped (Trail v n)
Instance details Defined in Diagrams.Trail type Unwrapped (Trail v n) = Either (Trail' Line v n) (Trail' Loop v n)

data Trail' l (v :: Type -> Type) n where #

Constructors

Line :: forall l (v :: Type -> Type) n. SegTree v n -> Trail' Line v n
Loop :: forall l (v :: Type -> Type) n. SegTree v n -> Segment Open v n -> Trail' Loop v n

Instances

(Parametric (GetSegment (Trail' c v n)), EndValues (GetSegment (Trail' c v n)), Additive v, Num n) => EndValues (Tangent (Trail' c v n))
Instance details Defined in Diagrams.Trail Methods atStart :: Tangent (Trail' c v n) -> Codomain (Tangent (Trail' c v n)) (N (Tangent (Trail' c v n))) # atEnd :: Tangent (Trail' c v n) -> Codomain (Tangent (Trail' c v n)) (N (Tangent (Trail' c v n))) #
(Metric v, OrderedField n) => EndValues (GetSegment (Trail' Line v n))
Instance details Defined in Diagrams.Trail Methods atStart :: GetSegment (Trail' Line v n) -> Codomain (GetSegment (Trail' Line v n)) (N (GetSegment (Trail' Line v n))) # atEnd :: GetSegment (Trail' Line v n) -> Codomain (GetSegment (Trail' Line v n)) (N (GetSegment (Trail' Line v n))) #
(Metric v, OrderedField n, Real n) => EndValues (GetSegment (Trail' Loop v n))
Instance details Defined in Diagrams.Trail Methods atStart :: GetSegment (Trail' Loop v n) -> Codomain (GetSegment (Trail' Loop v n)) (N (GetSegment (Trail' Loop v n))) # atEnd :: GetSegment (Trail' Loop v n) -> Codomain (GetSegment (Trail' Loop v n)) (N (GetSegment (Trail' Loop v n))) #
(Parametric (GetSegment (Trail' c v n)), Additive v, Num n) => Parametric (Tangent (Trail' c v n))
Instance details Defined in Diagrams.Trail Methods atParam :: Tangent (Trail' c v n) -> N (Tangent (Trail' c v n)) -> Codomain (Tangent (Trail' c v n)) (N (Tangent (Trail' c v n))) #
(Metric v, OrderedField n) => Parametric (GetSegment (Trail' Line v n))
Instance details Defined in Diagrams.Trail Methods atParam :: GetSegment (Trail' Line v n) -> N (GetSegment (Trail' Line v n)) -> Codomain (GetSegment (Trail' Line v n)) (N (GetSegment (Trail' Line v n))) #
(Metric v, OrderedField n, Real n) => Parametric (GetSegment (Trail' Loop v n))
Instance details Defined in Diagrams.Trail Methods atParam :: GetSegment (Trail' Loop v n) -> N (GetSegment (Trail' Loop v n)) -> Codomain (GetSegment (Trail' Loop v n)) (N (GetSegment (Trail' Loop v n))) #
ToPath (Located (Trail' l v n))
Instance details Defined in Diagrams.Path Methods toPath :: Located (Trail' l v n) -> Path (V (Located (Trail' l v n))) (N (Located (Trail' l v n))) #
(Metric v, OrderedField n) => Reversing (Located (Trail' l v n))
Instance details Defined in Diagrams.Trail Methods reversing :: Located (Trail' l v n) -> Located (Trail' l v n) #
Eq (v n) => Eq (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods (==) :: Trail' l v n -> Trail' l v n -> Bool # (/=) :: Trail' l v n -> Trail' l v n -> Bool #
Ord (v n) => Ord (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods compare :: Trail' l v n -> Trail' l v n -> Ordering # (<) :: Trail' l v n -> Trail' l v n -> Bool # (<=) :: Trail' l v n -> Trail' l v n -> Bool # (>) :: Trail' l v n -> Trail' l v n -> Bool # (>=) :: Trail' l v n -> Trail' l v n -> Bool # max :: Trail' l v n -> Trail' l v n -> Trail' l v n # min :: Trail' l v n -> Trail' l v n -> Trail' l v n #
Show (v n) => Show (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods showsPrec :: Int -> Trail' l v n -> ShowS # show :: Trail' l v n -> String # showList :: [Trail' l v n] -> ShowS #
(OrderedField n, Metric v) => Semigroup (Trail' Line v n)
Instance details Defined in Diagrams.Trail Methods (<>) :: Trail' Line v n -> Trail' Line v n -> Trail' Line v n # sconcat :: NonEmpty (Trail' Line v n) -> Trail' Line v n # stimes :: Integral b => b -> Trail' Line v n -> Trail' Line v n #
(Metric v, OrderedField n) => Monoid (Trail' Line v n)
Instance details Defined in Diagrams.Trail Methods mempty :: Trail' Line v n # mappend :: Trail' Line v n -> Trail' Line v n -> Trail' Line v n # mconcat :: [Trail' Line v n] -> Trail' Line v n #
(Metric v, OrderedField n) => Enveloped (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods getEnvelope :: Trail' l v n -> Envelope (V (Trail' l v n)) (N (Trail' l v n)) #
(HasLinearMap v, Metric v, OrderedField n) => Transformable (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods transform :: Transformation (V (Trail' l v n)) (N (Trail' l v n)) -> Trail' l v n -> Trail' l v n #
Num n => DomainBounds (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods domainLower :: Trail' l v n -> N (Trail' l v n) # domainUpper :: Trail' l v n -> N (Trail' l v n) #
(Metric v, OrderedField n, Real n) => EndValues (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods atStart :: Trail' l v n -> Codomain (Trail' l v n) (N (Trail' l v n)) # atEnd :: Trail' l v n -> Codomain (Trail' l v n) (N (Trail' l v n)) #
(Metric v, OrderedField n, Real n) => HasArcLength (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods arcLengthBounded :: N (Trail' l v n) -> Trail' l v n -> Interval (N (Trail' l v n)) # arcLength :: N (Trail' l v n) -> Trail' l v n -> N (Trail' l v n) # stdArcLength :: Trail' l v n -> N (Trail' l v n) # arcLengthToParam :: N (Trail' l v n) -> Trail' l v n -> N (Trail' l v n) -> N (Trail' l v n) # stdArcLengthToParam :: Trail' l v n -> N (Trail' l v n) -> N (Trail' l v n) #
(Metric v, OrderedField n, Real n) => Parametric (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods atParam :: Trail' l v n -> N (Trail' l v n) -> Codomain (Trail' l v n) (N (Trail' l v n)) #
(Metric v, OrderedField n, Real n) => Sectionable (Trail' Line v n)
Instance details Defined in Diagrams.Trail Methods splitAtParam :: Trail' Line v n -> N (Trail' Line v n) -> (Trail' Line v n, Trail' Line v n) # section :: Trail' Line v n -> N (Trail' Line v n) -> N (Trail' Line v n) -> Trail' Line v n # reverseDomain :: Trail' Line v n -> Trail' Line v n #
ToPath (Trail' l v n)
Instance details Defined in Diagrams.Path Methods toPath :: Trail' l v n -> Path (V (Trail' l v n)) (N (Trail' l v n)) #
(Metric v, OrderedField n) => TrailLike (Trail' Line v n)
Instance details Defined in Diagrams.TrailLike Methods trailLike :: Located (Trail (V (Trail' Line v n)) (N (Trail' Line v n))) -> Trail' Line v n #
(Metric v, OrderedField n) => TrailLike (Trail' Loop v n)
Instance details Defined in Diagrams.TrailLike Methods trailLike :: Located (Trail (V (Trail' Loop v n)) (N (Trail' Loop v n))) -> Trail' Loop v n #
(Metric v, OrderedField n) => AsEmpty (Trail' Line v n)
Instance details Defined in Diagrams.Trail Methods _Empty :: Prism' (Trail' Line v n) () #
(Metric v, OrderedField n) => Reversing (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods reversing :: Trail' l v n -> Trail' l v n #
Wrapped (Trail' Line v n)
Instance details Defined in Diagrams.Trail Associated Types type Unwrapped (Trail' Line v n) :: Type # Methods _Wrapped' :: Iso' (Trail' Line v n) (Unwrapped (Trail' Line v n)) #
(HasLinearMap v, Metric v, OrderedField n) => Renderable (Trail' o v n) NullBackend
Instance details Defined in Diagrams.Trail Methods render :: NullBackend -> Trail' o v n -> Render NullBackend (V (Trail' o v n)) (N (Trail' o v n)) #
Rewrapped (Trail' Line v n) (Trail' Line v' n')
Instance details Defined in Diagrams.Trail
(Metric v, OrderedField n, Metric u, OrderedField n') => Cons (Trail' Line v n) (Trail' Line u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Cons :: Prism (Trail' Line v n) (Trail' Line u n') (Segment Closed v n, Trail' Line v n) (Segment Closed u n', Trail' Line u n') #
(Metric v, OrderedField n, Metric u, OrderedField n') => Snoc (Trail' Line v n) (Trail' Line u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Snoc :: Prism (Trail' Line v n) (Trail' Line u n') (Trail' Line v n, Segment Closed v n) (Trail' Line u n', Segment Closed u n') #
type N (Trail' l v n)
Instance details Defined in Diagrams.Trail type N (Trail' l v n) = n
type V (Trail' l v n)
Instance details Defined in Diagrams.Trail type V (Trail' l v n) = v
type Codomain (Trail' l v n)
Instance details Defined in Diagrams.Trail type Codomain (Trail' l v n) = v
type Unwrapped (Trail' Line v n)
Instance details Defined in Diagrams.Trail type Unwrapped (Trail' Line v n) = SegTree v n

class (Metric (V t), OrderedField (N t)) => TrailLike t where #

Methods

trailLike :: Located (Trail (V t) (N t)) -> t #

Instances

(Metric v, OrderedField n) => TrailLike [Point v n]
Instance details Defined in Diagrams.TrailLike Methods trailLike :: Located (Trail (V [Point v n]) (N [Point v n])) -> [Point v n] #
TrailLike t => TrailLike (TransInv t)
Instance details Defined in Diagrams.TrailLike Methods trailLike :: Located (Trail (V (TransInv t)) (N (TransInv t))) -> TransInv t #
TrailLike t => TrailLike (Located t)
Instance details Defined in Diagrams.TrailLike Methods trailLike :: Located (Trail (V (Located t)) (N (Located t))) -> Located t #
(Metric v, OrderedField n) => TrailLike (Path v n)
Instance details Defined in Diagrams.Path Methods trailLike :: Located (Trail (V (Path v n)) (N (Path v n))) -> Path v n #
(Metric v, OrderedField n) => TrailLike (Trail v n)
Instance details Defined in Diagrams.TrailLike Methods trailLike :: Located (Trail (V (Trail v n)) (N (Trail v n))) -> Trail v n #
(Metric v, OrderedField n) => TrailLike (Trail' Line v n)
Instance details Defined in Diagrams.TrailLike Methods trailLike :: Located (Trail (V (Trail' Line v n)) (N (Trail' Line v n))) -> Trail' Line v n #
(Metric v, OrderedField n) => TrailLike (Trail' Loop v n)
Instance details Defined in Diagrams.TrailLike Methods trailLike :: Located (Trail (V (Trail' Loop v n)) (N (Trail' Loop v n))) -> Trail' Loop v n #

data ArrowOpts n #

Constructors

ArrowOpts
Fields _arrowHead :: ArrowHT n _arrowTail :: ArrowHT n _arrowShaft :: Trail V2 n _headGap :: Measure n _tailGap :: Measure n _headStyle :: Style V2 n _headLength :: Measure n _tailStyle :: Style V2 n _tailLength :: Measure n _shaftStyle :: Style V2 n

Instances

TypeableFloat n => Default (ArrowOpts n)
Instance details Defined in Diagrams.TwoD.Arrow Methods def :: ArrowOpts n #

type ArrowHT n = n -> n -> (Path V2 n, Path V2 n) #

data GradientStop d #

Constructors

GradientStop
Fields _stopColor :: SomeColor _stopFraction :: d

data LGradient n #

Constructors

LGradient
Fields _lGradStops :: [GradientStop n] _lGradStart :: Point V2 n _lGradEnd :: Point V2 n _lGradTrans :: Transformation V2 n _lGradSpreadMethod :: SpreadMethod

Instances

Fractional n => Transformable (LGradient n)
Instance details Defined in Diagrams.TwoD.Attributes Methods transform :: Transformation (V (LGradient n)) (N (LGradient n)) -> LGradient n -> LGradient n #
type N (LGradient n)
Instance details Defined in Diagrams.TwoD.Attributes type N (LGradient n) = n
type V (LGradient n)
Instance details Defined in Diagrams.TwoD.Attributes type V (LGradient n) = V2

data RGradient n #

Constructors

RGradient
Fields _rGradStops :: [GradientStop n] _rGradCenter0 :: Point V2 n _rGradRadius0 :: n _rGradCenter1 :: Point V2 n _rGradRadius1 :: n _rGradTrans :: Transformation V2 n _rGradSpreadMethod :: SpreadMethod

Instances

Fractional n => Transformable (RGradient n)
Instance details Defined in Diagrams.TwoD.Attributes Methods transform :: Transformation (V (RGradient n)) (N (RGradient n)) -> RGradient n -> RGradient n #
type N (RGradient n)
Instance details Defined in Diagrams.TwoD.Attributes type N (RGradient n) = n
type V (RGradient n)
Instance details Defined in Diagrams.TwoD.Attributes type V (RGradient n) = V2

data SpreadMethod #

Constructors

GradPad
GradReflect
GradRepeat

data Texture n #

Constructors

SC SomeColor
LG (LGradient n)
RG (RGradient n)

Instances

Floating n => Transformable (Texture n)
Instance details Defined in Diagrams.TwoD.Attributes Methods transform :: Transformation (V (Texture n)) (N (Texture n)) -> Texture n -> Texture n #
type N (Texture n)
Instance details Defined in Diagrams.TwoD.Attributes type N (Texture n) = n
type V (Texture n)
Instance details Defined in Diagrams.TwoD.Attributes type V (Texture n) = V2

data DImage a b #

Constructors

DImage (ImageData b) Int Int (Transformation V2 a)

Instances

Fractional n => HasOrigin (DImage n a)
Instance details Defined in Diagrams.TwoD.Image Methods moveOriginTo :: Point (V (DImage n a)) (N (DImage n a)) -> DImage n a -> DImage n a #
Fractional n => Transformable (DImage n a)
Instance details Defined in Diagrams.TwoD.Image Methods transform :: Transformation (V (DImage n a)) (N (DImage n a)) -> DImage n a -> DImage n a #
Fractional n => Renderable (DImage n a) NullBackend
Instance details Defined in Diagrams.TwoD.Image Methods render :: NullBackend -> DImage n a -> Render NullBackend (V (DImage n a)) (N (DImage n a)) #
SVGFloat n => Renderable (DImage n (Native Img)) SVG
Instance details Defined in Diagrams.Backend.SVG Methods render :: SVG -> DImage n (Native Img) -> Render SVG (V (DImage n (Native Img))) (N (DImage n (Native Img))) #
SVGFloat n => Renderable (DImage n Embedded) SVG
Instance details Defined in Diagrams.Backend.SVG Methods render :: SVG -> DImage n Embedded -> Render SVG (V (DImage n Embedded)) (N (DImage n Embedded)) #
RealFloat n => HasQuery (DImage n a) Any
Instance details Defined in Diagrams.TwoD.Image Methods getQuery :: DImage n a -> Query (V (DImage n a)) (N (DImage n a)) Any #
type N (DImage n a)
Instance details Defined in Diagrams.TwoD.Image type N (DImage n a) = n
type V (DImage n a)
Instance details Defined in Diagrams.TwoD.Image type V (DImage n a) = V2

data Embedded #

Instances

SVGFloat n => Renderable (DImage n Embedded) SVG
Instance details Defined in Diagrams.Backend.SVG Methods render :: SVG -> DImage n Embedded -> Render SVG (V (DImage n Embedded)) (N (DImage n Embedded)) #

data External #

data ImageData a where #

Constructors

ImageRaster :: forall a. DynamicImage -> ImageData Embedded
ImageRef :: forall a. FilePath -> ImageData External
ImageNative :: forall a t. t -> ImageData (Native t)

data Native t #

Instances

SVGFloat n => Renderable (DImage n (Native Img)) SVG
Instance details Defined in Diagrams.Backend.SVG Methods render :: SVG -> DImage n (Native Img) -> Render SVG (V (DImage n (Native Img))) (N (DImage n (Native Img))) #

data EnvelopeOpts n #

Constructors

EnvelopeOpts
Fields _eColor :: Colour Double _eLineWidth :: Measure n _ePoints :: Int

Instances

OrderedField n => Default (EnvelopeOpts n)
Instance details Defined in Diagrams.TwoD.Model Methods def :: EnvelopeOpts n #

data OriginOpts n #

Constructors

OriginOpts
Fields _oColor :: Colour Double _oScale :: n _oMinSize :: n

Instances

Fractional n => Default (OriginOpts n)
Instance details Defined in Diagrams.TwoD.Model Methods def :: OriginOpts n #

data TraceOpts n #

Constructors

TraceOpts
Fields _tColor :: Colour Double _tScale :: n _tMinSize :: n _tPoints :: Int

Instances

Floating n => Default (TraceOpts n)
Instance details Defined in Diagrams.TwoD.Model Methods def :: TraceOpts n #

data FillRule #

Constructors

Winding
EvenOdd

Instances

Eq FillRule
Instance details Defined in Diagrams.TwoD.Path Methods (==) :: FillRule -> FillRule -> Bool # (/=) :: FillRule -> FillRule -> Bool #
Ord FillRule
Instance details Defined in Diagrams.TwoD.Path Methods compare :: FillRule -> FillRule -> Ordering # (<) :: FillRule -> FillRule -> Bool # (<=) :: FillRule -> FillRule -> Bool # (>) :: FillRule -> FillRule -> Bool # (>=) :: FillRule -> FillRule -> Bool # max :: FillRule -> FillRule -> FillRule # min :: FillRule -> FillRule -> FillRule #
Show FillRule
Instance details Defined in Diagrams.TwoD.Path Methods showsPrec :: Int -> FillRule -> ShowS # show :: FillRule -> String # showList :: [FillRule] -> ShowS #
Semigroup FillRule
Instance details Defined in Diagrams.TwoD.Path Methods (<>) :: FillRule -> FillRule -> FillRule # sconcat :: NonEmpty FillRule -> FillRule # stimes :: Integral b => b -> FillRule -> FillRule #
Default FillRule
Instance details Defined in Diagrams.TwoD.Path Methods def :: FillRule #
AttributeClass FillRule
Instance details Defined in Diagrams.TwoD.Path

data StrokeOpts a #

Constructors

StrokeOpts
Fields _vertexNames :: [[a]] _queryFillRule :: FillRule

Instances

Default (StrokeOpts a)
Instance details Defined in Diagrams.TwoD.Path Methods def :: StrokeOpts a #

data PolyOrientation n #

Constructors

NoOrient
OrientH
OrientV
OrientTo (V2 n)

Instances

Eq n => Eq (PolyOrientation n)
Instance details Defined in Diagrams.TwoD.Polygons Methods (==) :: PolyOrientation n -> PolyOrientation n -> Bool # (/=) :: PolyOrientation n -> PolyOrientation n -> Bool #
Ord n => Ord (PolyOrientation n)
Instance details Defined in Diagrams.TwoD.Polygons Methods compare :: PolyOrientation n -> PolyOrientation n -> Ordering # (<) :: PolyOrientation n -> PolyOrientation n -> Bool # (<=) :: PolyOrientation n -> PolyOrientation n -> Bool # (>) :: PolyOrientation n -> PolyOrientation n -> Bool # (>=) :: PolyOrientation n -> PolyOrientation n -> Bool # max :: PolyOrientation n -> PolyOrientation n -> PolyOrientation n # min :: PolyOrientation n -> PolyOrientation n -> PolyOrientation n #
Read n => Read (PolyOrientation n)
Instance details Defined in Diagrams.TwoD.Polygons Methods readsPrec :: Int -> ReadS (PolyOrientation n) # readList :: ReadS [PolyOrientation n] # readPrec :: ReadPrec (PolyOrientation n) # readListPrec :: ReadPrec [PolyOrientation n] #
Show n => Show (PolyOrientation n)
Instance details Defined in Diagrams.TwoD.Polygons Methods showsPrec :: Int -> PolyOrientation n -> ShowS # show :: PolyOrientation n -> String # showList :: [PolyOrientation n] -> ShowS #

data PolyType n #

Constructors

PolyPolar [Angle n] [n]
PolySides [Angle n] [n]
PolyRegular Int n

data PolygonOpts n #

Constructors

PolygonOpts
Fields _polyType :: PolyType n _polyOrient :: PolyOrientation n _polyCenter :: Point V2 n

Instances

Num n => Default (PolygonOpts n)
Instance details Defined in Diagrams.TwoD.Polygons Methods def :: PolygonOpts n #

data StarOpts #

Constructors

StarFun (Int -> Int)
StarSkip Int

data RoundedRectOpts d #

Constructors

RoundedRectOpts
Fields _radiusTL :: d _radiusTR :: d _radiusBL :: d _radiusBR :: d

Instances

Num d => Default (RoundedRectOpts d)
Instance details Defined in Diagrams.TwoD.Shapes Methods def :: RoundedRectOpts d #

class HasR (t :: Type -> Type) where #

Methods

_r :: RealFloat n => Lens' (t n) n #

Instances

HasR V2
Instance details Defined in Diagrams.TwoD.Types Methods _r :: RealFloat n => Lens' (V2 n) n #
HasR v => HasR (Point v)
Instance details Defined in Diagrams.TwoD.Types Methods _r :: RealFloat n => Lens' (Point v n) n #

type P2 = Point V2 #

type T2 = Transformation V2 #

class Additive (Diff p) => Affine (p :: Type -> Type) where #

Minimal complete definition

(.-.), (.+^)

Associated Types

type Diff (p :: Type -> Type) :: Type -> Type #

Methods

(.-.) :: Num a => p a -> p a -> Diff p a #

(.+^) :: Num a => p a -> Diff p a -> p a #

(.-^) :: Num a => p a -> Diff p a -> p a #

Instances

Affine []
Instance details Defined in Linear.Affine Associated Types type Diff [] :: Type -> Type # Methods (.-.) :: Num a => [a] -> [a] -> Diff [] a # (.+^) :: Num a => [a] -> Diff [] a -> [a] # (.-^) :: Num a => [a] -> Diff [] a -> [a] #
Affine Maybe
Instance details Defined in Linear.Affine Associated Types type Diff Maybe :: Type -> Type # Methods (.-.) :: Num a => Maybe a -> Maybe a -> Diff Maybe a # (.+^) :: Num a => Maybe a -> Diff Maybe a -> Maybe a # (.-^) :: Num a => Maybe a -> Diff Maybe a -> Maybe a #
Affine Complex
Instance details Defined in Linear.Affine Associated Types type Diff Complex :: Type -> Type # Methods (.-.) :: Num a => Complex a -> Complex a -> Diff Complex a # (.+^) :: Num a => Complex a -> Diff Complex a -> Complex a # (.-^) :: Num a => Complex a -> Diff Complex a -> Complex a #
Affine ZipList
Instance details Defined in Linear.Affine Associated Types type Diff ZipList :: Type -> Type # Methods (.-.) :: Num a => ZipList a -> ZipList a -> Diff ZipList a # (.+^) :: Num a => ZipList a -> Diff ZipList a -> ZipList a # (.-^) :: Num a => ZipList a -> Diff ZipList a -> ZipList a #
Affine Identity
Instance details Defined in Linear.Affine Associated Types type Diff Identity :: Type -> Type # Methods (.-.) :: Num a => Identity a -> Identity a -> Diff Identity a # (.+^) :: Num a => Identity a -> Diff Identity a -> Identity a # (.-^) :: Num a => Identity a -> Diff Identity a -> Identity a #
Affine IntMap
Instance details Defined in Linear.Affine Associated Types type Diff IntMap :: Type -> Type # Methods (.-.) :: Num a => IntMap a -> IntMap a -> Diff IntMap a # (.+^) :: Num a => IntMap a -> Diff IntMap a -> IntMap a # (.-^) :: Num a => IntMap a -> Diff IntMap a -> IntMap a #
Affine Vector
Instance details Defined in Linear.Affine Associated Types type Diff Vector :: Type -> Type # Methods (.-.) :: Num a => Vector a -> Vector a -> Diff Vector a # (.+^) :: Num a => Vector a -> Diff Vector a -> Vector a # (.-^) :: Num a => Vector a -> Diff Vector a -> Vector a #
Affine Time
Instance details Defined in Data.Active Associated Types type Diff Time :: Type -> Type # Methods (.-.) :: Num a => Time a -> Time a -> Diff Time a # (.+^) :: Num a => Time a -> Diff Time a -> Time a # (.-^) :: Num a => Time a -> Diff Time a -> Time a #
Affine V2
Instance details Defined in Linear.Affine Associated Types type Diff V2 :: Type -> Type # Methods (.-.) :: Num a => V2 a -> V2 a -> Diff V2 a # (.+^) :: Num a => V2 a -> Diff V2 a -> V2 a # (.-^) :: Num a => V2 a -> Diff V2 a -> V2 a #
Affine V3
Instance details Defined in Linear.Affine Associated Types type Diff V3 :: Type -> Type # Methods (.-.) :: Num a => V3 a -> V3 a -> Diff V3 a # (.+^) :: Num a => V3 a -> Diff V3 a -> V3 a # (.-^) :: Num a => V3 a -> Diff V3 a -> V3 a #
Affine V4
Instance details Defined in Linear.Affine Associated Types type Diff V4 :: Type -> Type # Methods (.-.) :: Num a => V4 a -> V4 a -> Diff V4 a # (.+^) :: Num a => V4 a -> Diff V4 a -> V4 a # (.-^) :: Num a => V4 a -> Diff V4 a -> V4 a #
Affine V1
Instance details Defined in Linear.Affine Associated Types type Diff V1 :: Type -> Type # Methods (.-.) :: Num a => V1 a -> V1 a -> Diff V1 a # (.+^) :: Num a => V1 a -> Diff V1 a -> V1 a # (.-^) :: Num a => V1 a -> Diff V1 a -> V1 a #
Affine Plucker
Instance details Defined in Linear.Affine Associated Types type Diff Plucker :: Type -> Type # Methods (.-.) :: Num a => Plucker a -> Plucker a -> Diff Plucker a # (.+^) :: Num a => Plucker a -> Diff Plucker a -> Plucker a # (.-^) :: Num a => Plucker a -> Diff Plucker a -> Plucker a #
Affine Quaternion
Instance details Defined in Linear.Affine Associated Types type Diff Quaternion :: Type -> Type # Methods (.-.) :: Num a => Quaternion a -> Quaternion a -> Diff Quaternion a # (.+^) :: Num a => Quaternion a -> Diff Quaternion a -> Quaternion a # (.-^) :: Num a => Quaternion a -> Diff Quaternion a -> Quaternion a #
Affine V0
Instance details Defined in Linear.Affine Associated Types type Diff V0 :: Type -> Type # Methods (.-.) :: Num a => V0 a -> V0 a -> Diff V0 a # (.+^) :: Num a => V0 a -> Diff V0 a -> V0 a # (.-^) :: Num a => V0 a -> Diff V0 a -> V0 a #
Ord k => Affine (Map k)
Instance details Defined in Linear.Affine Associated Types type Diff (Map k) :: Type -> Type # Methods (.-.) :: Num a => Map k a -> Map k a -> Diff (Map k) a # (.+^) :: Num a => Map k a -> Diff (Map k) a -> Map k a # (.-^) :: Num a => Map k a -> Diff (Map k) a -> Map k a #
(Eq k, Hashable k) => Affine (HashMap k)
Instance details Defined in Linear.Affine Associated Types type Diff (HashMap k) :: Type -> Type # Methods (.-.) :: Num a => HashMap k a -> HashMap k a -> Diff (HashMap k) a # (.+^) :: Num a => HashMap k a -> Diff (HashMap k) a -> HashMap k a # (.-^) :: Num a => HashMap k a -> Diff (HashMap k) a -> HashMap k a #
Additive f => Affine (Point f)
Instance details Defined in Linear.Affine Associated Types type Diff (Point f) :: Type -> Type # Methods (.-.) :: Num a => Point f a -> Point f a -> Diff (Point f) a # (.+^) :: Num a => Point f a -> Diff (Point f) a -> Point f a # (.-^) :: Num a => Point f a -> Diff (Point f) a -> Point f a #
Dim n => Affine (V n)
Instance details Defined in Linear.Affine Associated Types type Diff (V n) :: Type -> Type # Methods (.-.) :: Num a => V n a -> V n a -> Diff (V n) a # (.+^) :: Num a => V n a -> Diff (V n) a -> V n a # (.-^) :: Num a => V n a -> Diff (V n) a -> V n a #
Affine ((->) b :: Type -> Type)
Instance details Defined in Linear.Affine Associated Types type Diff ((->) b) :: Type -> Type # Methods (.-.) :: Num a => (b -> a) -> (b -> a) -> Diff ((->) b) a # (.+^) :: Num a => (b -> a) -> Diff ((->) b) a -> b -> a # (.-^) :: Num a => (b -> a) -> Diff ((->) b) a -> b -> a #

newtype Point (f :: Type -> Type) a #

Constructors

P (f a)

Instances

Unbox (f a) => Vector Vector (Point f a)
Instance details Defined in Linear.Affine Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Point f a) -> m (Vector (Point f a)) basicUnsafeThaw :: PrimMonad m => Vector (Point f a) -> m (Mutable Vector (PrimState m) (Point f a)) basicLength :: Vector (Point f a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (Point f a) -> Vector (Point f a) basicUnsafeIndexM :: Monad m => Vector (Point f a) -> Int -> m (Point f a) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Point f a) -> Vector (Point f a) -> m () elemseq :: Vector (Point f a) -> Point f a -> b -> b
Unbox (f a) => MVector MVector (Point f a)
Instance details Defined in Linear.Affine Methods basicLength :: MVector s (Point f a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (Point f a) -> MVector s (Point f a) basicOverlaps :: MVector s (Point f a) -> MVector s (Point f a) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Point f a)) basicInitialize :: PrimMonad m => MVector (PrimState m) (Point f a) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Point f a -> m (MVector (PrimState m) (Point f a)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Point f a) -> Int -> m (Point f a) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Point f a) -> Int -> Point f a -> m () basicClear :: PrimMonad m => MVector (PrimState m) (Point f a) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (Point f a) -> Point f a -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Point f a) -> MVector (PrimState m) (Point f a) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Point f a) -> MVector (PrimState m) (Point f a) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Point f a) -> Int -> m (MVector (PrimState m) (Point f a))
Monad f => Monad (Point f)
Instance details Defined in Linear.Affine Methods (>>=) :: Point f a -> (a -> Point f b) -> Point f b # (>>) :: Point f a -> Point f b -> Point f b # return :: a -> Point f a # fail :: String -> Point f a #
Functor f => Functor (Point f)
Instance details Defined in Linear.Affine Methods fmap :: (a -> b) -> Point f a -> Point f b # (<$) :: a -> Point f b -> Point f a #
Applicative f => Applicative (Point f)
Instance details Defined in Linear.Affine Methods pure :: a -> Point f a # (<>) :: Point f (a -> b) -> Point f a -> Point f b # liftA2 :: (a -> b -> c) -> Point f a -> Point f b -> Point f c # (>) :: Point f a -> Point f b -> Point f b # (<*) :: Point f a -> Point f b -> Point f a #
Foldable f => Foldable (Point f)
Instance details Defined in Linear.Affine Methods fold :: Monoid m => Point f m -> m # foldMap :: Monoid m => (a -> m) -> Point f a -> m # foldr :: (a -> b -> b) -> b -> Point f a -> b # foldr' :: (a -> b -> b) -> b -> Point f a -> b # foldl :: (b -> a -> b) -> b -> Point f a -> b # foldl' :: (b -> a -> b) -> b -> Point f a -> b # foldr1 :: (a -> a -> a) -> Point f a -> a # foldl1 :: (a -> a -> a) -> Point f a -> a # toList :: Point f a -> [a] # null :: Point f a -> Bool # length :: Point f a -> Int # elem :: Eq a => a -> Point f a -> Bool # maximum :: Ord a => Point f a -> a # minimum :: Ord a => Point f a -> a # sum :: Num a => Point f a -> a # product :: Num a => Point f a -> a #
Traversable f => Traversable (Point f)
Instance details Defined in Linear.Affine Methods traverse :: Applicative f0 => (a -> f0 b) -> Point f a -> f0 (Point f b) # sequenceA :: Applicative f0 => Point f (f0 a) -> f0 (Point f a) # mapM :: Monad m => (a -> m b) -> Point f a -> m (Point f b) # sequence :: Monad m => Point f (m a) -> m (Point f a) #
Eq1 f => Eq1 (Point f)
Instance details Defined in Linear.Affine Methods liftEq :: (a -> b -> Bool) -> Point f a -> Point f b -> Bool #
Ord1 f => Ord1 (Point f)
Instance details Defined in Linear.Affine Methods liftCompare :: (a -> b -> Ordering) -> Point f a -> Point f b -> Ordering #
Read1 f => Read1 (Point f)
Instance details Defined in Linear.Affine Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Point f a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Point f a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Point f a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Point f a] #
Show1 f => Show1 (Point f)
Instance details Defined in Linear.Affine Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Point f a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Point f a] -> ShowS #
Hashable1 f => Hashable1 (Point f)
Instance details Defined in Linear.Affine Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Point f a -> Int
Apply f => Apply (Point f)
Instance details Defined in Linear.Affine Methods (<.>) :: Point f (a -> b) -> Point f a -> Point f b (.>) :: Point f a -> Point f b -> Point f b (<.) :: Point f a -> Point f b -> Point f a liftF2 :: (a -> b -> c) -> Point f a -> Point f b -> Point f c
Bind f => Bind (Point f)
Instance details Defined in Linear.Affine Methods (>>-) :: Point f a -> (a -> Point f b) -> Point f b join :: Point f (Point f a) -> Point f a
HasPhi v => HasPhi (Point v)
Instance details Defined in Diagrams.Angle Methods _phi :: RealFloat n => Lens' (Point v n) (Angle n) #
HasTheta v => HasTheta (Point v)
Instance details Defined in Diagrams.Angle Methods _theta :: RealFloat n => Lens' (Point v n) (Angle n) #
(Metric v, OrderedField n) => TrailLike [Point v n]
Instance details Defined in Diagrams.TrailLike Methods trailLike :: Located (Trail (V [Point v n]) (N [Point v n])) -> [Point v n] #
HasR v => HasR (Point v)
Instance details Defined in Diagrams.TwoD.Types Methods _r :: RealFloat n => Lens' (Point v n) n #
Additive f => Affine (Point f)
Instance details Defined in Linear.Affine Associated Types type Diff (Point f) :: Type -> Type # Methods (.-.) :: Num a => Point f a -> Point f a -> Diff (Point f) a # (.+^) :: Num a => Point f a -> Diff (Point f) a -> Point f a # (.-^) :: Num a => Point f a -> Diff (Point f) a -> Point f a #
Metric f => Metric (Point f)
Instance details Defined in Linear.Affine Methods dot :: Num a => Point f a -> Point f a -> a # quadrance :: Num a => Point f a -> a # qd :: Num a => Point f a -> Point f a -> a # distance :: Floating a => Point f a -> Point f a -> a # norm :: Floating a => Point f a -> a # signorm :: Floating a => Point f a -> Point f a #
R1 f => R1 (Point f)
Instance details Defined in Linear.Affine Methods _x :: Lens' (Point f a) a #
R2 f => R2 (Point f)
Instance details Defined in Linear.Affine Methods _y :: Lens' (Point f a) a # _xy :: Lens' (Point f a) (V2 a) #
R3 f => R3 (Point f)
Instance details Defined in Linear.Affine Methods _z :: Lens' (Point f a) a # _xyz :: Lens' (Point f a) (V3 a) #
Additive f => Additive (Point f)
Instance details Defined in Linear.Affine Methods zero :: Num a => Point f a # (^+^) :: Num a => Point f a -> Point f a -> Point f a # (^-^) :: Num a => Point f a -> Point f a -> Point f a # lerp :: Num a => a -> Point f a -> Point f a -> Point f a # liftU2 :: (a -> a -> a) -> Point f a -> Point f a -> Point f a # liftI2 :: (a -> b -> c) -> Point f a -> Point f b -> Point f c #
Representable f => Representable (Point f)
Instance details Defined in Linear.Affine Associated Types type Rep (Point f) :: Type Methods tabulate :: (Rep (Point f) -> a) -> Point f a index :: Point f a -> Rep (Point f) -> a
Distributive f => Distributive (Point f)
Instance details Defined in Linear.Affine Methods distribute :: Functor f0 => f0 (Point f a) -> Point f (f0 a) collect :: Functor f0 => (a -> Point f b) -> f0 a -> Point f (f0 b) distributeM :: Monad m => m (Point f a) -> Point f (m a) collectM :: Monad m => (a -> Point f b) -> m a -> Point f (m b)
Finite f => Finite (Point f)
Instance details Defined in Linear.Affine Associated Types type Size (Point f) :: Nat Methods toV :: Point f a -> V (Size (Point f)) a fromV :: V (Size (Point f)) a -> Point f a
R4 f => R4 (Point f)
Instance details Defined in Linear.Affine Methods _w :: Lens' (Point f a) a _xyzw :: Lens' (Point f a) (V4 a)
Serial1 f => Serial1 (Point f)
Instance details Defined in Linear.Affine Methods serializeWith :: MonadPut m => (a -> m ()) -> Point f a -> m () deserializeWith :: MonadGet m => m a -> m (Point f a)
Generic1 (Point f :: Type -> Type)
Instance details Defined in Linear.Affine Associated Types type Rep1 (Point f) :: k -> Type # Methods from1 :: Point f a -> Rep1 (Point f) a # to1 :: Rep1 (Point f) a -> Point f a #
Functor v => Cosieve (Query v) (Point v)
Instance details Defined in Diagrams.Core.Query Methods cosieve :: Query v a b -> Point v a -> b
Eq (f a) => Eq (Point f a)
Instance details Defined in Linear.Affine Methods (==) :: Point f a -> Point f a -> Bool # (/=) :: Point f a -> Point f a -> Bool #
Fractional (f a) => Fractional (Point f a)
Instance details Defined in Linear.Affine Methods (/) :: Point f a -> Point f a -> Point f a # recip :: Point f a -> Point f a # fromRational :: Rational -> Point f a #
(Typeable f, Typeable a, Data (f a)) => Data (Point f a)
Instance details Defined in Linear.Affine Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Point f a -> c (Point f a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Point f a) # toConstr :: Point f a -> Constr # dataTypeOf :: Point f a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Point f a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Point f a)) # gmapT :: (forall b. Data b => b -> b) -> Point f a -> Point f a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Point f a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Point f a -> r # gmapQ :: (forall d. Data d => d -> u) -> Point f a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Point f a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Point f a -> m (Point f a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Point f a -> m (Point f a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Point f a -> m (Point f a) #
Num (f a) => Num (Point f a)
Instance details Defined in Linear.Affine Methods (+) :: Point f a -> Point f a -> Point f a # (-) :: Point f a -> Point f a -> Point f a # (*) :: Point f a -> Point f a -> Point f a # negate :: Point f a -> Point f a # abs :: Point f a -> Point f a # signum :: Point f a -> Point f a # fromInteger :: Integer -> Point f a #
Ord (f a) => Ord (Point f a)
Instance details Defined in Linear.Affine Methods compare :: Point f a -> Point f a -> Ordering # (<) :: Point f a -> Point f a -> Bool # (<=) :: Point f a -> Point f a -> Bool # (>) :: Point f a -> Point f a -> Bool # (>=) :: Point f a -> Point f a -> Bool # max :: Point f a -> Point f a -> Point f a # min :: Point f a -> Point f a -> Point f a #
Read (f a) => Read (Point f a)
Instance details Defined in Linear.Affine Methods readsPrec :: Int -> ReadS (Point f a) # readList :: ReadS [Point f a] # readPrec :: ReadPrec (Point f a) # readListPrec :: ReadPrec [Point f a] #
Show (f a) => Show (Point f a)
Instance details Defined in Linear.Affine Methods showsPrec :: Int -> Point f a -> ShowS # show :: Point f a -> String # showList :: [Point f a] -> ShowS #
Ix (f a) => Ix (Point f a)
Instance details Defined in Linear.Affine Methods range :: (Point f a, Point f a) -> [Point f a] # index :: (Point f a, Point f a) -> Point f a -> Int # unsafeIndex :: (Point f a, Point f a) -> Point f a -> Int inRange :: (Point f a, Point f a) -> Point f a -> Bool # rangeSize :: (Point f a, Point f a) -> Int # unsafeRangeSize :: (Point f a, Point f a) -> Int
Generic (Point f a)
Instance details Defined in Linear.Affine Associated Types type Rep (Point f a) :: Type -> Type # Methods from :: Point f a -> Rep (Point f a) x # to :: Rep (Point f a) x -> Point f a #
Storable (f a) => Storable (Point f a)
Instance details Defined in Linear.Affine Methods sizeOf :: Point f a -> Int # alignment :: Point f a -> Int # peekElemOff :: Ptr (Point f a) -> Int -> IO (Point f a) # pokeElemOff :: Ptr (Point f a) -> Int -> Point f a -> IO () # peekByteOff :: Ptr b -> Int -> IO (Point f a) # pokeByteOff :: Ptr b -> Int -> Point f a -> IO () # peek :: Ptr (Point f a) -> IO (Point f a) # poke :: Ptr (Point f a) -> Point f a -> IO () #
Binary (f a) => Binary (Point f a)
Instance details Defined in Linear.Affine Methods put :: Point f a -> Put # get :: Get (Point f a) # putList :: [Point f a] -> Put #
NFData (f a) => NFData (Point f a)
Instance details Defined in Linear.Affine Methods rnf :: Point f a -> () #
Hashable (f a) => Hashable (Point f a)
Instance details Defined in Linear.Affine Methods hashWithSalt :: Int -> Point f a -> Int hash :: Point f a -> Int
Unbox (f a) => Unbox (Point f a)
Instance details Defined in Linear.Affine
(OrderedField n, Metric v) => Enveloped (Point v n)
Instance details Defined in Diagrams.Core.Envelope Methods getEnvelope :: Point v n -> Envelope (V (Point v n)) (N (Point v n)) #
(Additive v, Num n) => HasOrigin (Point v n)
Instance details Defined in Diagrams.Core.HasOrigin Methods moveOriginTo :: Point (V (Point v n)) (N (Point v n)) -> Point v n -> Point v n #
(Additive v, Ord n) => Traced (Point v n)
Instance details Defined in Diagrams.Core.Trace Methods getTrace :: Point v n -> Trace (V (Point v n)) (N (Point v n)) #
(Additive v, Num n) => Transformable (Point v n)
Instance details Defined in Diagrams.Core.Transform Methods transform :: Transformation (V (Point v n)) (N (Point v n)) -> Point v n -> Point v n #
Coordinates (v n) => Coordinates (Point v n)
Instance details Defined in Diagrams.Coordinates Associated Types type FinalCoord (Point v n) :: Type # type PrevDim (Point v n) :: Type # type Decomposition (Point v n) :: Type # Methods (^&) :: PrevDim (Point v n) -> FinalCoord (Point v n) -> Point v n # pr :: PrevDim (Point v n) -> FinalCoord (Point v n) -> Point v n # coords :: Point v n -> Decomposition (Point v n) #
Ixed (f a) => Ixed (Point f a)
Instance details Defined in Linear.Affine Methods ix :: Index (Point f a) -> Traversal' (Point f a) (IxValue (Point f a)) #
Wrapped (Point f a)
Instance details Defined in Linear.Affine Associated Types type Unwrapped (Point f a) :: Type # Methods _Wrapped' :: Iso' (Point f a) (Unwrapped (Point f a)) #
Serialize (f a) => Serialize (Point f a)
Instance details Defined in Linear.Affine Methods put :: Putter (Point f a) get :: Get (Point f a)
Epsilon (f a) => Epsilon (Point f a)
Instance details Defined in Linear.Affine Methods nearZero :: Point f a -> Bool
Serial (f a) => Serial (Point f a)
Instance details Defined in Linear.Affine Methods serialize :: MonadPut m => Point f a -> m () deserialize :: MonadGet m => m (Point f a)
r ~ Point u n => Deformable (Point v n) r
Instance details Defined in Diagrams.Deform Methods deform' :: N (Point v n) -> Deformation (V (Point v n)) (V r) (N (Point v n)) -> Point v n -> r # deform :: Deformation (V (Point v n)) (V r) (N (Point v n)) -> Point v n -> r #
t ~ Point g b => Rewrapped (Point f a) t
Instance details Defined in Linear.Affine
Traversable f => Each (Point f a) (Point f b) a b
Instance details Defined in Linear.Affine Methods each :: Traversal (Point f a) (Point f b) a b #
(Additive v', Foldable v', Ord n') => Each (BoundingBox v n) (BoundingBox v' n') (Point v n) (Point v' n')
Instance details Defined in Diagrams.BoundingBox Methods each :: Traversal (BoundingBox v n) (BoundingBox v' n') (Point v n) (Point v' n') #
Each (FixedSegment v n) (FixedSegment v' n') (Point v n) (Point v' n')
Instance details Defined in Diagrams.Segment Methods each :: Traversal (FixedSegment v n) (FixedSegment v' n') (Point v n) (Point v' n') #
newtype MVector s (Point f a)
Instance details Defined in Linear.Affine newtype MVector s (Point f a) = MV_P (MVector s (f a))
type Diff (Point f)
Instance details Defined in Linear.Affine type Diff (Point f) = f
type Rep (Point f)
Instance details Defined in Linear.Affine type Rep (Point f) = Rep f
type Size (Point f)
Instance details Defined in Linear.Affine type Size (Point f) = Size f
type Rep1 (Point f :: Type -> Type)
Instance details Defined in Linear.Affine type Rep1 (Point f :: Type -> Type) = D1 (MetaData "Point" "Linear.Affine" "lnr-1.20.9-8295282c" True) (C1 (MetaCons "P" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 f)))
type Rep (Point f a)
Instance details Defined in Linear.Affine type Rep (Point f a) = D1 (MetaData "Point" "Linear.Affine" "lnr-1.20.9-8295282c" True) (C1 (MetaCons "P" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (f a))))
newtype Vector (Point f a)
Instance details Defined in Linear.Affine newtype Vector (Point f a) = V_P (Vector (f a))
type N (Point v n)
Instance details Defined in Diagrams.Core.Points type N (Point v n) = n
type V (Point v n)
Instance details Defined in Diagrams.Core.Points type V (Point v n) = v
type Decomposition (Point v n)
Instance details Defined in Diagrams.Coordinates type Decomposition (Point v n) = Decomposition (v n)
type FinalCoord (Point v n)
Instance details Defined in Diagrams.Coordinates type FinalCoord (Point v n) = FinalCoord (v n)
type PrevDim (Point v n)
Instance details Defined in Diagrams.Coordinates type PrevDim (Point v n) = PrevDim (v n)
type Index (Point f a)
Instance details Defined in Linear.Affine type Index (Point f a) = Index (f a)
type IxValue (Point f a)
Instance details Defined in Linear.Affine type IxValue (Point f a) = IxValue (f a)
type Unwrapped (Point f a)
Instance details Defined in Linear.Affine type Unwrapped (Point f a) = f a

class Additive f => Metric (f :: Type -> Type) where #

Minimal complete definition

Nothing

Methods

dot :: Num a => f a -> f a -> a #

quadrance :: Num a => f a -> a #

qd :: Num a => f a -> f a -> a #

distance :: Floating a => f a -> f a -> a #

norm :: Floating a => f a -> a #

signorm :: Floating a => f a -> f a #

Instances

Metric []
Instance details Defined in Linear.Metric Methods dot :: Num a => [a] -> [a] -> a # quadrance :: Num a => [a] -> a # qd :: Num a => [a] -> [a] -> a # distance :: Floating a => [a] -> [a] -> a # norm :: Floating a => [a] -> a # signorm :: Floating a => [a] -> [a] #
Metric Maybe
Instance details Defined in Linear.Metric Methods dot :: Num a => Maybe a -> Maybe a -> a # quadrance :: Num a => Maybe a -> a # qd :: Num a => Maybe a -> Maybe a -> a # distance :: Floating a => Maybe a -> Maybe a -> a # norm :: Floating a => Maybe a -> a # signorm :: Floating a => Maybe a -> Maybe a #
Metric ZipList
Instance details Defined in Linear.Metric Methods dot :: Num a => ZipList a -> ZipList a -> a # quadrance :: Num a => ZipList a -> a # qd :: Num a => ZipList a -> ZipList a -> a # distance :: Floating a => ZipList a -> ZipList a -> a # norm :: Floating a => ZipList a -> a # signorm :: Floating a => ZipList a -> ZipList a #
Metric Identity
Instance details Defined in Linear.Metric Methods dot :: Num a => Identity a -> Identity a -> a # quadrance :: Num a => Identity a -> a # qd :: Num a => Identity a -> Identity a -> a # distance :: Floating a => Identity a -> Identity a -> a # norm :: Floating a => Identity a -> a # signorm :: Floating a => Identity a -> Identity a #
Metric IntMap
Instance details Defined in Linear.Metric Methods dot :: Num a => IntMap a -> IntMap a -> a # quadrance :: Num a => IntMap a -> a # qd :: Num a => IntMap a -> IntMap a -> a # distance :: Floating a => IntMap a -> IntMap a -> a # norm :: Floating a => IntMap a -> a # signorm :: Floating a => IntMap a -> IntMap a #
Metric Vector
Instance details Defined in Linear.Metric Methods dot :: Num a => Vector a -> Vector a -> a # quadrance :: Num a => Vector a -> a # qd :: Num a => Vector a -> Vector a -> a # distance :: Floating a => Vector a -> Vector a -> a # norm :: Floating a => Vector a -> a # signorm :: Floating a => Vector a -> Vector a #
Metric V2
Instance details Defined in Linear.V2 Methods dot :: Num a => V2 a -> V2 a -> a # quadrance :: Num a => V2 a -> a # qd :: Num a => V2 a -> V2 a -> a # distance :: Floating a => V2 a -> V2 a -> a # norm :: Floating a => V2 a -> a # signorm :: Floating a => V2 a -> V2 a #
Metric V3
Instance details Defined in Linear.V3 Methods dot :: Num a => V3 a -> V3 a -> a # quadrance :: Num a => V3 a -> a # qd :: Num a => V3 a -> V3 a -> a # distance :: Floating a => V3 a -> V3 a -> a # norm :: Floating a => V3 a -> a # signorm :: Floating a => V3 a -> V3 a #
Metric V4
Instance details Defined in Linear.V4 Methods dot :: Num a => V4 a -> V4 a -> a # quadrance :: Num a => V4 a -> a # qd :: Num a => V4 a -> V4 a -> a # distance :: Floating a => V4 a -> V4 a -> a # norm :: Floating a => V4 a -> a # signorm :: Floating a => V4 a -> V4 a #
Metric V1
Instance details Defined in Linear.V1 Methods dot :: Num a => V1 a -> V1 a -> a # quadrance :: Num a => V1 a -> a # qd :: Num a => V1 a -> V1 a -> a # distance :: Floating a => V1 a -> V1 a -> a # norm :: Floating a => V1 a -> a # signorm :: Floating a => V1 a -> V1 a #
Metric Plucker
Instance details Defined in Linear.Plucker Methods dot :: Num a => Plucker a -> Plucker a -> a # quadrance :: Num a => Plucker a -> a # qd :: Num a => Plucker a -> Plucker a -> a # distance :: Floating a => Plucker a -> Plucker a -> a # norm :: Floating a => Plucker a -> a # signorm :: Floating a => Plucker a -> Plucker a #
Metric Quaternion
Instance details Defined in Linear.Quaternion Methods dot :: Num a => Quaternion a -> Quaternion a -> a # quadrance :: Num a => Quaternion a -> a # qd :: Num a => Quaternion a -> Quaternion a -> a # distance :: Floating a => Quaternion a -> Quaternion a -> a # norm :: Floating a => Quaternion a -> a # signorm :: Floating a => Quaternion a -> Quaternion a #
Metric V0
Instance details Defined in Linear.V0 Methods dot :: Num a => V0 a -> V0 a -> a # quadrance :: Num a => V0 a -> a # qd :: Num a => V0 a -> V0 a -> a # distance :: Floating a => V0 a -> V0 a -> a # norm :: Floating a => V0 a -> a # signorm :: Floating a => V0 a -> V0 a #
Ord k => Metric (Map k)
Instance details Defined in Linear.Metric Methods dot :: Num a => Map k a -> Map k a -> a # quadrance :: Num a => Map k a -> a # qd :: Num a => Map k a -> Map k a -> a # distance :: Floating a => Map k a -> Map k a -> a # norm :: Floating a => Map k a -> a # signorm :: Floating a => Map k a -> Map k a #
(Hashable k, Eq k) => Metric (HashMap k)
Instance details Defined in Linear.Metric Methods dot :: Num a => HashMap k a -> HashMap k a -> a # quadrance :: Num a => HashMap k a -> a # qd :: Num a => HashMap k a -> HashMap k a -> a # distance :: Floating a => HashMap k a -> HashMap k a -> a # norm :: Floating a => HashMap k a -> a # signorm :: Floating a => HashMap k a -> HashMap k a #
Metric f => Metric (Point f)
Instance details Defined in Linear.Affine Methods dot :: Num a => Point f a -> Point f a -> a # quadrance :: Num a => Point f a -> a # qd :: Num a => Point f a -> Point f a -> a # distance :: Floating a => Point f a -> Point f a -> a # norm :: Floating a => Point f a -> a # signorm :: Floating a => Point f a -> Point f a #
Dim n => Metric (V n)
Instance details Defined in Linear.V Methods dot :: Num a => V n a -> V n a -> a # quadrance :: Num a => V n a -> a # qd :: Num a => V n a -> V n a -> a # distance :: Floating a => V n a -> V n a -> a # norm :: Floating a => V n a -> a # signorm :: Floating a => V n a -> V n a #

class R1 (t :: Type -> Type) where #

Methods

_x :: Lens' (t a) a #

Instances

R1 Identity
Instance details Defined in Linear.V1 Methods _x :: Lens' (Identity a) a #
R1 V2
Instance details Defined in Linear.V2 Methods _x :: Lens' (V2 a) a #
R1 V3
Instance details Defined in Linear.V3 Methods _x :: Lens' (V3 a) a #
R1 V4
Instance details Defined in Linear.V4 Methods _x :: Lens' (V4 a) a #
R1 V1
Instance details Defined in Linear.V1 Methods _x :: Lens' (V1 a) a #
R1 f => R1 (Point f)
Instance details Defined in Linear.Affine Methods _x :: Lens' (Point f a) a #

class R1 t => R2 (t :: Type -> Type) where #

Minimal complete definition

_xy

Methods

_y :: Lens' (t a) a #

_xy :: Lens' (t a) (V2 a) #

Instances

R2 V2
Instance details Defined in Linear.V2 Methods _y :: Lens' (V2 a) a # _xy :: Lens' (V2 a) (V2 a) #
R2 V3
Instance details Defined in Linear.V3 Methods _y :: Lens' (V3 a) a # _xy :: Lens' (V3 a) (V2 a) #
R2 V4
Instance details Defined in Linear.V4 Methods _y :: Lens' (V4 a) a # _xy :: Lens' (V4 a) (V2 a) #
R2 f => R2 (Point f)
Instance details Defined in Linear.Affine Methods _y :: Lens' (Point f a) a # _xy :: Lens' (Point f a) (V2 a) #

data V2 a #

Constructors

V2 !a !a

Instances

Monad V2
Instance details Defined in Linear.V2 Methods (>>=) :: V2 a -> (a -> V2 b) -> V2 b # (>>) :: V2 a -> V2 b -> V2 b # return :: a -> V2 a # fail :: String -> V2 a #
Functor V2
Instance details Defined in Linear.V2 Methods fmap :: (a -> b) -> V2 a -> V2 b # (<$) :: a -> V2 b -> V2 a #
MonadFix V2
Instance details Defined in Linear.V2 Methods mfix :: (a -> V2 a) -> V2 a #
Applicative V2
Instance details Defined in Linear.V2 Methods pure :: a -> V2 a # (<>) :: V2 (a -> b) -> V2 a -> V2 b # liftA2 :: (a -> b -> c) -> V2 a -> V2 b -> V2 c # (>) :: V2 a -> V2 b -> V2 b # (<*) :: V2 a -> V2 b -> V2 a #
Foldable V2
Instance details Defined in Linear.V2 Methods fold :: Monoid m => V2 m -> m # foldMap :: Monoid m => (a -> m) -> V2 a -> m # foldr :: (a -> b -> b) -> b -> V2 a -> b # foldr' :: (a -> b -> b) -> b -> V2 a -> b # foldl :: (b -> a -> b) -> b -> V2 a -> b # foldl' :: (b -> a -> b) -> b -> V2 a -> b # foldr1 :: (a -> a -> a) -> V2 a -> a # foldl1 :: (a -> a -> a) -> V2 a -> a # toList :: V2 a -> [a] # null :: V2 a -> Bool # length :: V2 a -> Int # elem :: Eq a => a -> V2 a -> Bool # maximum :: Ord a => V2 a -> a # minimum :: Ord a => V2 a -> a # sum :: Num a => V2 a -> a # product :: Num a => V2 a -> a #
Traversable V2
Instance details Defined in Linear.V2 Methods traverse :: Applicative f => (a -> f b) -> V2 a -> f (V2 b) # sequenceA :: Applicative f => V2 (f a) -> f (V2 a) # mapM :: Monad m => (a -> m b) -> V2 a -> m (V2 b) # sequence :: Monad m => V2 (m a) -> m (V2 a) #
Eq1 V2
Instance details Defined in Linear.V2 Methods liftEq :: (a -> b -> Bool) -> V2 a -> V2 b -> Bool #
Ord1 V2
Instance details Defined in Linear.V2 Methods liftCompare :: (a -> b -> Ordering) -> V2 a -> V2 b -> Ordering #
Read1 V2
Instance details Defined in Linear.V2 Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (V2 a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [V2 a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (V2 a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [V2 a] #
Show1 V2
Instance details Defined in Linear.V2 Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> V2 a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [V2 a] -> ShowS #
MonadZip V2
Instance details Defined in Linear.V2 Methods mzip :: V2 a -> V2 b -> V2 (a, b) # mzipWith :: (a -> b -> c) -> V2 a -> V2 b -> V2 c # munzip :: V2 (a, b) -> (V2 a, V2 b) #
Hashable1 V2
Instance details Defined in Linear.V2 Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> V2 a -> Int
Apply V2
Instance details Defined in Linear.V2 Methods (<.>) :: V2 (a -> b) -> V2 a -> V2 b (.>) :: V2 a -> V2 b -> V2 b (<.) :: V2 a -> V2 b -> V2 a liftF2 :: (a -> b -> c) -> V2 a -> V2 b -> V2 c
Bind V2
Instance details Defined in Linear.V2 Methods (>>-) :: V2 a -> (a -> V2 b) -> V2 b join :: V2 (V2 a) -> V2 a
HasR V2
Instance details Defined in Diagrams.TwoD.Types Methods _r :: RealFloat n => Lens' (V2 n) n #
Affine V2
Instance details Defined in Linear.Affine Associated Types type Diff V2 :: Type -> Type # Methods (.-.) :: Num a => V2 a -> V2 a -> Diff V2 a # (.+^) :: Num a => V2 a -> Diff V2 a -> V2 a # (.-^) :: Num a => V2 a -> Diff V2 a -> V2 a #
Metric V2
Instance details Defined in Linear.V2 Methods dot :: Num a => V2 a -> V2 a -> a # quadrance :: Num a => V2 a -> a # qd :: Num a => V2 a -> V2 a -> a # distance :: Floating a => V2 a -> V2 a -> a # norm :: Floating a => V2 a -> a # signorm :: Floating a => V2 a -> V2 a #
R1 V2
Instance details Defined in Linear.V2 Methods _x :: Lens' (V2 a) a #
R2 V2
Instance details Defined in Linear.V2 Methods _y :: Lens' (V2 a) a # _xy :: Lens' (V2 a) (V2 a) #
Additive V2
Instance details Defined in Linear.V2 Methods zero :: Num a => V2 a # (^+^) :: Num a => V2 a -> V2 a -> V2 a # (^-^) :: Num a => V2 a -> V2 a -> V2 a # lerp :: Num a => a -> V2 a -> V2 a -> V2 a # liftU2 :: (a -> a -> a) -> V2 a -> V2 a -> V2 a # liftI2 :: (a -> b -> c) -> V2 a -> V2 b -> V2 c #
Traversable1 V2
Instance details Defined in Linear.V2 Methods traverse1 :: Apply f => (a -> f b) -> V2 a -> f (V2 b) # sequence1 :: Apply f => V2 (f b) -> f (V2 b)
Representable V2
Instance details Defined in Linear.V2 Associated Types type Rep V2 :: Type Methods tabulate :: (Rep V2 -> a) -> V2 a index :: V2 a -> Rep V2 -> a
Distributive V2
Instance details Defined in Linear.V2 Methods distribute :: Functor f => f (V2 a) -> V2 (f a) collect :: Functor f => (a -> V2 b) -> f a -> V2 (f b) distributeM :: Monad m => m (V2 a) -> V2 (m a) collectM :: Monad m => (a -> V2 b) -> m a -> V2 (m b)
Foldable1 V2
Instance details Defined in Linear.V2 Methods fold1 :: Semigroup m => V2 m -> m foldMap1 :: Semigroup m => (a -> m) -> V2 a -> m toNonEmpty :: V2 a -> NonEmpty a
Finite V2
Instance details Defined in Linear.V2 Associated Types type Size V2 :: Nat Methods toV :: V2 a -> V (Size V2) a fromV :: V (Size V2) a -> V2 a
Serial1 V2
Instance details Defined in Linear.V2 Methods serializeWith :: MonadPut m => (a -> m ()) -> V2 a -> m () deserializeWith :: MonadGet m => m a -> m (V2 a)
SVGFloat n => Backend SVG V2 n
Instance details Defined in Diagrams.Backend.SVG Associated Types data Render SVG V2 n :: Type # type Result SVG V2 n :: Type # data Options SVG V2 n :: Type # Methods adjustDia :: (Additive V2, Monoid' m, Num n) => SVG -> Options SVG V2 n -> QDiagram SVG V2 n m -> (Options SVG V2 n, Transformation V2 n, QDiagram SVG V2 n m) # renderRTree :: SVG -> Options SVG V2 n -> RTree SVG V2 n Annotation -> Result SVG V2 n #
Unbox a => Vector Vector (V2 a)
Instance details Defined in Linear.V2 Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (V2 a) -> m (Vector (V2 a)) basicUnsafeThaw :: PrimMonad m => Vector (V2 a) -> m (Mutable Vector (PrimState m) (V2 a)) basicLength :: Vector (V2 a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (V2 a) -> Vector (V2 a) basicUnsafeIndexM :: Monad m => Vector (V2 a) -> Int -> m (V2 a) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (V2 a) -> Vector (V2 a) -> m () elemseq :: Vector (V2 a) -> V2 a -> b -> b
Unbox a => MVector MVector (V2 a)
Instance details Defined in Linear.V2 Methods basicLength :: MVector s (V2 a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (V2 a) -> MVector s (V2 a) basicOverlaps :: MVector s (V2 a) -> MVector s (V2 a) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (V2 a)) basicInitialize :: PrimMonad m => MVector (PrimState m) (V2 a) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> V2 a -> m (MVector (PrimState m) (V2 a)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (V2 a) -> Int -> m (V2 a) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (V2 a) -> Int -> V2 a -> m () basicClear :: PrimMonad m => MVector (PrimState m) (V2 a) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (V2 a) -> V2 a -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (V2 a) -> MVector (PrimState m) (V2 a) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (V2 a) -> MVector (PrimState m) (V2 a) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (V2 a) -> Int -> m (MVector (PrimState m) (V2 a))
Bounded a => Bounded (V2 a)
Instance details Defined in Linear.V2 Methods minBound :: V2 a # maxBound :: V2 a #
Eq a => Eq (V2 a)
Instance details Defined in Linear.V2 Methods (==) :: V2 a -> V2 a -> Bool # (/=) :: V2 a -> V2 a -> Bool #
Floating a => Floating (V2 a)
Instance details Defined in Linear.V2 Methods pi :: V2 a # exp :: V2 a -> V2 a # log :: V2 a -> V2 a # sqrt :: V2 a -> V2 a # (**) :: V2 a -> V2 a -> V2 a # logBase :: V2 a -> V2 a -> V2 a # sin :: V2 a -> V2 a # cos :: V2 a -> V2 a # tan :: V2 a -> V2 a # asin :: V2 a -> V2 a # acos :: V2 a -> V2 a # atan :: V2 a -> V2 a # sinh :: V2 a -> V2 a # cosh :: V2 a -> V2 a # tanh :: V2 a -> V2 a # asinh :: V2 a -> V2 a # acosh :: V2 a -> V2 a # atanh :: V2 a -> V2 a # log1p :: V2 a -> V2 a # expm1 :: V2 a -> V2 a # log1pexp :: V2 a -> V2 a # log1mexp :: V2 a -> V2 a #
Fractional a => Fractional (V2 a)
Instance details Defined in Linear.V2 Methods (/) :: V2 a -> V2 a -> V2 a # recip :: V2 a -> V2 a # fromRational :: Rational -> V2 a #
Data a => Data (V2 a)
Instance details Defined in Linear.V2 Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> V2 a -> c (V2 a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (V2 a) # toConstr :: V2 a -> Constr # dataTypeOf :: V2 a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (V2 a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (V2 a)) # gmapT :: (forall b. Data b => b -> b) -> V2 a -> V2 a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> V2 a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> V2 a -> r # gmapQ :: (forall d. Data d => d -> u) -> V2 a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> V2 a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> V2 a -> m (V2 a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> V2 a -> m (V2 a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> V2 a -> m (V2 a) #
Num a => Num (V2 a)
Instance details Defined in Linear.V2 Methods (+) :: V2 a -> V2 a -> V2 a # (-) :: V2 a -> V2 a -> V2 a # (*) :: V2 a -> V2 a -> V2 a # negate :: V2 a -> V2 a # abs :: V2 a -> V2 a # signum :: V2 a -> V2 a # fromInteger :: Integer -> V2 a #
Ord a => Ord (V2 a)
Instance details Defined in Linear.V2 Methods compare :: V2 a -> V2 a -> Ordering # (<) :: V2 a -> V2 a -> Bool # (<=) :: V2 a -> V2 a -> Bool # (>) :: V2 a -> V2 a -> Bool # (>=) :: V2 a -> V2 a -> Bool # max :: V2 a -> V2 a -> V2 a # min :: V2 a -> V2 a -> V2 a #
Read a => Read (V2 a)
Instance details Defined in Linear.V2 Methods readsPrec :: Int -> ReadS (V2 a) # readList :: ReadS [V2 a] # readPrec :: ReadPrec (V2 a) # readListPrec :: ReadPrec [V2 a] #
Show a => Show (V2 a)
Instance details Defined in Linear.V2 Methods showsPrec :: Int -> V2 a -> ShowS # show :: V2 a -> String # showList :: [V2 a] -> ShowS #
Ix a => Ix (V2 a)
Instance details Defined in Linear.V2 Methods range :: (V2 a, V2 a) -> [V2 a] # index :: (V2 a, V2 a) -> V2 a -> Int # unsafeIndex :: (V2 a, V2 a) -> V2 a -> Int inRange :: (V2 a, V2 a) -> V2 a -> Bool # rangeSize :: (V2 a, V2 a) -> Int # unsafeRangeSize :: (V2 a, V2 a) -> Int
Generic (V2 a)
Instance details Defined in Linear.V2 Associated Types type Rep (V2 a) :: Type -> Type # Methods from :: V2 a -> Rep (V2 a) x # to :: Rep (V2 a) x -> V2 a #
Lift a => Lift (V2 a)
Instance details Defined in Linear.V2 Methods lift :: V2 a -> Q Exp #
Storable a => Storable (V2 a)
Instance details Defined in Linear.V2 Methods sizeOf :: V2 a -> Int # alignment :: V2 a -> Int # peekElemOff :: Ptr (V2 a) -> Int -> IO (V2 a) # pokeElemOff :: Ptr (V2 a) -> Int -> V2 a -> IO () # peekByteOff :: Ptr b -> Int -> IO (V2 a) # pokeByteOff :: Ptr b -> Int -> V2 a -> IO () # peek :: Ptr (V2 a) -> IO (V2 a) # poke :: Ptr (V2 a) -> V2 a -> IO () #
Binary a => Binary (V2 a)
Instance details Defined in Linear.V2 Methods put :: V2 a -> Put # get :: Get (V2 a) # putList :: [V2 a] -> Put #
NFData a => NFData (V2 a)
Instance details Defined in Linear.V2 Methods rnf :: V2 a -> () #
Hashable a => Hashable (V2 a)
Instance details Defined in Linear.V2 Methods hashWithSalt :: Int -> V2 a -> Int hash :: V2 a -> Int
Unbox a => Unbox (V2 a)
Instance details Defined in Linear.V2
Coordinates (V2 n)
Instance details Defined in Diagrams.Coordinates Associated Types type FinalCoord (V2 n) :: Type # type PrevDim (V2 n) :: Type # type Decomposition (V2 n) :: Type # Methods (^&) :: PrevDim (V2 n) -> FinalCoord (V2 n) -> V2 n # pr :: PrevDim (V2 n) -> FinalCoord (V2 n) -> V2 n # coords :: V2 n -> Decomposition (V2 n) #
Ixed (V2 a)
Instance details Defined in Linear.V2 Methods ix :: Index (V2 a) -> Traversal' (V2 a) (IxValue (V2 a)) #
Serialize a => Serialize (V2 a)
Instance details Defined in Linear.V2 Methods put :: Putter (V2 a) get :: Get (V2 a)
Epsilon a => Epsilon (V2 a)
Instance details Defined in Linear.V2 Methods nearZero :: V2 a -> Bool
Serial a => Serial (V2 a)
Instance details Defined in Linear.V2 Methods serialize :: MonadPut m => V2 a -> m () deserialize :: MonadGet m => m (V2 a)
Generic1 V2
Instance details Defined in Linear.V2 Associated Types type Rep1 V2 :: k -> Type # Methods from1 :: V2 a -> Rep1 V2 a # to1 :: Rep1 V2 a -> V2 a #
FoldableWithIndex (E V2) V2
Instance details Defined in Linear.V2 Methods ifoldMap :: Monoid m => (E V2 -> a -> m) -> V2 a -> m # ifolded :: IndexedFold (E V2) (V2 a) a # ifoldr :: (E V2 -> a -> b -> b) -> b -> V2 a -> b # ifoldl :: (E V2 -> b -> a -> b) -> b -> V2 a -> b # ifoldr' :: (E V2 -> a -> b -> b) -> b -> V2 a -> b # ifoldl' :: (E V2 -> b -> a -> b) -> b -> V2 a -> b #
FunctorWithIndex (E V2) V2
Instance details Defined in Linear.V2 Methods imap :: (E V2 -> a -> b) -> V2 a -> V2 b # imapped :: IndexedSetter (E V2) (V2 a) (V2 b) a b #
TraversableWithIndex (E V2) V2
Instance details Defined in Linear.V2 Methods itraverse :: Applicative f => (E V2 -> a -> f b) -> V2 a -> f (V2 b) # itraversed :: IndexedTraversal (E V2) (V2 a) (V2 b) a b #
Each (V2 a) (V2 b) a b
Instance details Defined in Linear.V2 Methods each :: Traversal (V2 a) (V2 b) a b #
Field1 (V2 a) (V2 a) a a
Instance details Defined in Linear.V2 Methods _1 :: Lens (V2 a) (V2 a) a a #
Field2 (V2 a) (V2 a) a a
Instance details Defined in Linear.V2 Methods _2 :: Lens (V2 a) (V2 a) a a #
RealFloat n => Traced (BoundingBox V2 n)
Instance details Defined in Diagrams.BoundingBox Methods getTrace :: BoundingBox V2 n -> Trace (V (BoundingBox V2 n)) (N (BoundingBox V2 n)) #
SVGFloat n => Renderable (Path V2 n) SVG
Instance details Defined in Diagrams.Backend.SVG Methods render :: SVG -> Path V2 n -> Render SVG (V (Path V2 n)) (N (Path V2 n)) #
Semigroup (Render SVG V2 n)
Instance details Defined in Diagrams.Backend.SVG Methods (<>) :: Render SVG V2 n -> Render SVG V2 n -> Render SVG V2 n # sconcat :: NonEmpty (Render SVG V2 n) -> Render SVG V2 n # stimes :: Integral b => b -> Render SVG V2 n -> Render SVG V2 n #
Monoid (Render SVG V2 n)
Instance details Defined in Diagrams.Backend.SVG Methods mempty :: Render SVG V2 n # mappend :: Render SVG V2 n -> Render SVG V2 n -> Render SVG V2 n # mconcat :: [Render SVG V2 n] -> Render SVG V2 n #
Hashable n => Hashable (Options SVG V2 n)
Instance details Defined in Diagrams.Backend.SVG Methods hashWithSalt :: Int -> Options SVG V2 n -> Int hash :: Options SVG V2 n -> Int
type Diff V2
Instance details Defined in Linear.Affine type Diff V2 = V2
type Rep V2
Instance details Defined in Linear.V2 type Rep V2 = E V2
type Size V2
Instance details Defined in Linear.V2 type Size V2 = 2
data Options SVG V2 n
Instance details Defined in Diagrams.Backend.SVG data Options SVG V2 n = SVGOptions { _size :: SizeSpec V2 n _svgDefinitions :: Maybe Element _idPrefix :: Text _svgAttributes :: [Attribute] _generateDoctype :: Bool }
newtype Render SVG V2 n
Instance details Defined in Diagrams.Backend.SVG newtype Render SVG V2 n = R (SvgRenderM n)
type Result SVG V2 n
Instance details Defined in Diagrams.Backend.SVG type Result SVG V2 n = Element
data MVector s (V2 a)
Instance details Defined in Linear.V2 data MVector s (V2 a) = MV_V2 !Int !(MVector s a)
type Rep (V2 a)
Instance details Defined in Linear.V2 type Rep (V2 a) = D1 (MetaData "V2" "Linear.V2" "lnr-1.20.9-8295282c" False) (C1 (MetaCons "V2" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 a) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 a)))
data Vector (V2 a)
Instance details Defined in Linear.V2 data Vector (V2 a) = V_V2 !Int !(Vector a)
type N (V2 n)
Instance details Defined in Diagrams.TwoD.Types type N (V2 n) = n
type V (V2 n)
Instance details Defined in Diagrams.TwoD.Types type V (V2 n) = V2
type Decomposition (V2 n)
Instance details Defined in Diagrams.Coordinates type Decomposition (V2 n) = n :& n
type FinalCoord (V2 n)
Instance details Defined in Diagrams.Coordinates type FinalCoord (V2 n) = n
type PrevDim (V2 n)
Instance details Defined in Diagrams.Coordinates type PrevDim (V2 n) = n
type Index (V2 a)
Instance details Defined in Linear.V2 type Index (V2 a) = E V2
type IxValue (V2 a)
Instance details Defined in Linear.V2 type IxValue (V2 a) = a
type Rep1 V2
Instance details Defined in Linear.V2 type Rep1 V2 = D1 (MetaData "V2" "Linear.V2" "lnr-1.20.9-8295282c" False) (C1 (MetaCons "V2" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) Par1 :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) Par1))

class R2 t => R3 (t :: Type -> Type) where #

Methods

_z :: Lens' (t a) a #

_xyz :: Lens' (t a) (V3 a) #

Instances

R3 V3
Instance details Defined in Linear.V3 Methods _z :: Lens' (V3 a) a # _xyz :: Lens' (V3 a) (V3 a) #
R3 V4
Instance details Defined in Linear.V4 Methods _z :: Lens' (V4 a) a # _xyz :: Lens' (V4 a) (V3 a) #
R3 f => R3 (Point f)
Instance details Defined in Linear.Affine Methods _z :: Lens' (Point f a) a # _xyz :: Lens' (Point f a) (V3 a) #

data V3 a #

Constructors

V3 !a !a !a

Instances

Monad V3
Instance details Defined in Linear.V3 Methods (>>=) :: V3 a -> (a -> V3 b) -> V3 b # (>>) :: V3 a -> V3 b -> V3 b # return :: a -> V3 a # fail :: String -> V3 a #
Functor V3
Instance details Defined in Linear.V3 Methods fmap :: (a -> b) -> V3 a -> V3 b # (<$) :: a -> V3 b -> V3 a #
MonadFix V3
Instance details Defined in Linear.V3 Methods mfix :: (a -> V3 a) -> V3 a #
Applicative V3
Instance details Defined in Linear.V3 Methods pure :: a -> V3 a # (<>) :: V3 (a -> b) -> V3 a -> V3 b # liftA2 :: (a -> b -> c) -> V3 a -> V3 b -> V3 c # (>) :: V3 a -> V3 b -> V3 b # (<*) :: V3 a -> V3 b -> V3 a #
Foldable V3
Instance details Defined in Linear.V3 Methods fold :: Monoid m => V3 m -> m # foldMap :: Monoid m => (a -> m) -> V3 a -> m # foldr :: (a -> b -> b) -> b -> V3 a -> b # foldr' :: (a -> b -> b) -> b -> V3 a -> b # foldl :: (b -> a -> b) -> b -> V3 a -> b # foldl' :: (b -> a -> b) -> b -> V3 a -> b # foldr1 :: (a -> a -> a) -> V3 a -> a # foldl1 :: (a -> a -> a) -> V3 a -> a # toList :: V3 a -> [a] # null :: V3 a -> Bool # length :: V3 a -> Int # elem :: Eq a => a -> V3 a -> Bool # maximum :: Ord a => V3 a -> a # minimum :: Ord a => V3 a -> a # sum :: Num a => V3 a -> a # product :: Num a => V3 a -> a #
Traversable V3
Instance details Defined in Linear.V3 Methods traverse :: Applicative f => (a -> f b) -> V3 a -> f (V3 b) # sequenceA :: Applicative f => V3 (f a) -> f (V3 a) # mapM :: Monad m => (a -> m b) -> V3 a -> m (V3 b) # sequence :: Monad m => V3 (m a) -> m (V3 a) #
Eq1 V3
Instance details Defined in Linear.V3 Methods liftEq :: (a -> b -> Bool) -> V3 a -> V3 b -> Bool #
Ord1 V3
Instance details Defined in Linear.V3 Methods liftCompare :: (a -> b -> Ordering) -> V3 a -> V3 b -> Ordering #
Read1 V3
Instance details Defined in Linear.V3 Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (V3 a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [V3 a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (V3 a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [V3 a] #
Show1 V3
Instance details Defined in Linear.V3 Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> V3 a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [V3 a] -> ShowS #
MonadZip V3
Instance details Defined in Linear.V3 Methods mzip :: V3 a -> V3 b -> V3 (a, b) # mzipWith :: (a -> b -> c) -> V3 a -> V3 b -> V3 c # munzip :: V3 (a, b) -> (V3 a, V3 b) #
Hashable1 V3
Instance details Defined in Linear.V3 Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> V3 a -> Int
Apply V3
Instance details Defined in Linear.V3 Methods (<.>) :: V3 (a -> b) -> V3 a -> V3 b (.>) :: V3 a -> V3 b -> V3 b (<.) :: V3 a -> V3 b -> V3 a liftF2 :: (a -> b -> c) -> V3 a -> V3 b -> V3 c
Bind V3
Instance details Defined in Linear.V3 Methods (>>-) :: V3 a -> (a -> V3 b) -> V3 b join :: V3 (V3 a) -> V3 a
Affine V3
Instance details Defined in Linear.Affine Associated Types type Diff V3 :: Type -> Type # Methods (.-.) :: Num a => V3 a -> V3 a -> Diff V3 a # (.+^) :: Num a => V3 a -> Diff V3 a -> V3 a # (.-^) :: Num a => V3 a -> Diff V3 a -> V3 a #
Metric V3
Instance details Defined in Linear.V3 Methods dot :: Num a => V3 a -> V3 a -> a # quadrance :: Num a => V3 a -> a # qd :: Num a => V3 a -> V3 a -> a # distance :: Floating a => V3 a -> V3 a -> a # norm :: Floating a => V3 a -> a # signorm :: Floating a => V3 a -> V3 a #
R1 V3
Instance details Defined in Linear.V3 Methods _x :: Lens' (V3 a) a #
R2 V3
Instance details Defined in Linear.V3 Methods _y :: Lens' (V3 a) a # _xy :: Lens' (V3 a) (V2 a) #
R3 V3
Instance details Defined in Linear.V3 Methods _z :: Lens' (V3 a) a # _xyz :: Lens' (V3 a) (V3 a) #
Additive V3
Instance details Defined in Linear.V3 Methods zero :: Num a => V3 a # (^+^) :: Num a => V3 a -> V3 a -> V3 a # (^-^) :: Num a => V3 a -> V3 a -> V3 a # lerp :: Num a => a -> V3 a -> V3 a -> V3 a # liftU2 :: (a -> a -> a) -> V3 a -> V3 a -> V3 a # liftI2 :: (a -> b -> c) -> V3 a -> V3 b -> V3 c #
Traversable1 V3
Instance details Defined in Linear.V3 Methods traverse1 :: Apply f => (a -> f b) -> V3 a -> f (V3 b) # sequence1 :: Apply f => V3 (f b) -> f (V3 b)
Representable V3
Instance details Defined in Linear.V3 Associated Types type Rep V3 :: Type Methods tabulate :: (Rep V3 -> a) -> V3 a index :: V3 a -> Rep V3 -> a
Distributive V3
Instance details Defined in Linear.V3 Methods distribute :: Functor f => f (V3 a) -> V3 (f a) collect :: Functor f => (a -> V3 b) -> f a -> V3 (f b) distributeM :: Monad m => m (V3 a) -> V3 (m a) collectM :: Monad m => (a -> V3 b) -> m a -> V3 (m b)
Foldable1 V3
Instance details Defined in Linear.V3 Methods fold1 :: Semigroup m => V3 m -> m foldMap1 :: Semigroup m => (a -> m) -> V3 a -> m toNonEmpty :: V3 a -> NonEmpty a
Finite V3
Instance details Defined in Linear.V3 Associated Types type Size V3 :: Nat Methods toV :: V3 a -> V (Size V3) a fromV :: V (Size V3) a -> V3 a
Serial1 V3
Instance details Defined in Linear.V3 Methods serializeWith :: MonadPut m => (a -> m ()) -> V3 a -> m () deserializeWith :: MonadGet m => m a -> m (V3 a)
Unbox a => Vector Vector (V3 a)
Instance details Defined in Linear.V3 Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (V3 a) -> m (Vector (V3 a)) basicUnsafeThaw :: PrimMonad m => Vector (V3 a) -> m (Mutable Vector (PrimState m) (V3 a)) basicLength :: Vector (V3 a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (V3 a) -> Vector (V3 a) basicUnsafeIndexM :: Monad m => Vector (V3 a) -> Int -> m (V3 a) basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (V3 a) -> Vector (V3 a) -> m () elemseq :: Vector (V3 a) -> V3 a -> b -> b
Unbox a => MVector MVector (V3 a)
Instance details Defined in Linear.V3 Methods basicLength :: MVector s (V3 a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s (V3 a) -> MVector s (V3 a) basicOverlaps :: MVector s (V3 a) -> MVector s (V3 a) -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (V3 a)) basicInitialize :: PrimMonad m => MVector (PrimState m) (V3 a) -> m () basicUnsafeReplicate :: PrimMonad m => Int -> V3 a -> m (MVector (PrimState m) (V3 a)) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (V3 a) -> Int -> m (V3 a) basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (V3 a) -> Int -> V3 a -> m () basicClear :: PrimMonad m => MVector (PrimState m) (V3 a) -> m () basicSet :: PrimMonad m => MVector (PrimState m) (V3 a) -> V3 a -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (V3 a) -> MVector (PrimState m) (V3 a) -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (V3 a) -> MVector (PrimState m) (V3 a) -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (V3 a) -> Int -> m (MVector (PrimState m) (V3 a))
Bounded a => Bounded (V3 a)
Instance details Defined in Linear.V3 Methods minBound :: V3 a # maxBound :: V3 a #
Eq a => Eq (V3 a)
Instance details Defined in Linear.V3 Methods (==) :: V3 a -> V3 a -> Bool # (/=) :: V3 a -> V3 a -> Bool #
Floating a => Floating (V3 a)
Instance details Defined in Linear.V3 Methods pi :: V3 a # exp :: V3 a -> V3 a # log :: V3 a -> V3 a # sqrt :: V3 a -> V3 a # (**) :: V3 a -> V3 a -> V3 a # logBase :: V3 a -> V3 a -> V3 a # sin :: V3 a -> V3 a # cos :: V3 a -> V3 a # tan :: V3 a -> V3 a # asin :: V3 a -> V3 a # acos :: V3 a -> V3 a # atan :: V3 a -> V3 a # sinh :: V3 a -> V3 a # cosh :: V3 a -> V3 a # tanh :: V3 a -> V3 a # asinh :: V3 a -> V3 a # acosh :: V3 a -> V3 a # atanh :: V3 a -> V3 a # log1p :: V3 a -> V3 a # expm1 :: V3 a -> V3 a # log1pexp :: V3 a -> V3 a # log1mexp :: V3 a -> V3 a #
Fractional a => Fractional (V3 a)
Instance details Defined in Linear.V3 Methods (/) :: V3 a -> V3 a -> V3 a # recip :: V3 a -> V3 a # fromRational :: Rational -> V3 a #
Data a => Data (V3 a)
Instance details Defined in Linear.V3 Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> V3 a -> c (V3 a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (V3 a) # toConstr :: V3 a -> Constr # dataTypeOf :: V3 a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (V3 a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (V3 a)) # gmapT :: (forall b. Data b => b -> b) -> V3 a -> V3 a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> V3 a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> V3 a -> r # gmapQ :: (forall d. Data d => d -> u) -> V3 a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> V3 a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> V3 a -> m (V3 a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> V3 a -> m (V3 a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> V3 a -> m (V3 a) #
Num a => Num (V3 a)
Instance details Defined in Linear.V3 Methods (+) :: V3 a -> V3 a -> V3 a # (-) :: V3 a -> V3 a -> V3 a # (*) :: V3 a -> V3 a -> V3 a # negate :: V3 a -> V3 a # abs :: V3 a -> V3 a # signum :: V3 a -> V3 a # fromInteger :: Integer -> V3 a #
Ord a => Ord (V3 a)
Instance details Defined in Linear.V3 Methods compare :: V3 a -> V3 a -> Ordering # (<) :: V3 a -> V3 a -> Bool # (<=) :: V3 a -> V3 a -> Bool # (>) :: V3 a -> V3 a -> Bool # (>=) :: V3 a -> V3 a -> Bool # max :: V3 a -> V3 a -> V3 a # min :: V3 a -> V3 a -> V3 a #
Read a => Read (V3 a)
Instance details Defined in Linear.V3 Methods readsPrec :: Int -> ReadS (V3 a) # readList :: ReadS [V3 a] # readPrec :: ReadPrec (V3 a) # readListPrec :: ReadPrec [V3 a] #
Show a => Show (V3 a)
Instance details Defined in Linear.V3 Methods showsPrec :: Int -> V3 a -> ShowS # show :: V3 a -> String # showList :: [V3 a] -> ShowS #
Ix a => Ix (V3 a)
Instance details Defined in Linear.V3 Methods range :: (V3 a, V3 a) -> [V3 a] # index :: (V3 a, V3 a) -> V3 a -> Int # unsafeIndex :: (V3 a, V3 a) -> V3 a -> Int inRange :: (V3 a, V3 a) -> V3 a -> Bool # rangeSize :: (V3 a, V3 a) -> Int # unsafeRangeSize :: (V3 a, V3 a) -> Int
Generic (V3 a)
Instance details Defined in Linear.V3 Associated Types type Rep (V3 a) :: Type -> Type # Methods from :: V3 a -> Rep (V3 a) x # to :: Rep (V3 a) x -> V3 a #
Lift a => Lift (V3 a)
Instance details Defined in Linear.V3 Methods lift :: V3 a -> Q Exp #
Storable a => Storable (V3 a)
Instance details Defined in Linear.V3 Methods sizeOf :: V3 a -> Int # alignment :: V3 a -> Int # peekElemOff :: Ptr (V3 a) -> Int -> IO (V3 a) # pokeElemOff :: Ptr (V3 a) -> Int -> V3 a -> IO () # peekByteOff :: Ptr b -> Int -> IO (V3 a) # pokeByteOff :: Ptr b -> Int -> V3 a -> IO () # peek :: Ptr (V3 a) -> IO (V3 a) # poke :: Ptr (V3 a) -> V3 a -> IO () #
Binary a => Binary (V3 a)
Instance details Defined in Linear.V3 Methods put :: V3 a -> Put # get :: Get (V3 a) # putList :: [V3 a] -> Put #
NFData a => NFData (V3 a)
Instance details Defined in Linear.V3 Methods rnf :: V3 a -> () #
Hashable a => Hashable (V3 a)
Instance details Defined in Linear.V3 Methods hashWithSalt :: Int -> V3 a -> Int hash :: V3 a -> Int
Unbox a => Unbox (V3 a)
Instance details Defined in Linear.V3
Coordinates (V3 n)
Instance details Defined in Diagrams.Coordinates Associated Types type FinalCoord (V3 n) :: Type # type PrevDim (V3 n) :: Type # type Decomposition (V3 n) :: Type # Methods (^&) :: PrevDim (V3 n) -> FinalCoord (V3 n) -> V3 n # pr :: PrevDim (V3 n) -> FinalCoord (V3 n) -> V3 n # coords :: V3 n -> Decomposition (V3 n) #
Ixed (V3 a)
Instance details Defined in Linear.V3 Methods ix :: Index (V3 a) -> Traversal' (V3 a) (IxValue (V3 a)) #
Serialize a => Serialize (V3 a)
Instance details Defined in Linear.V3 Methods put :: Putter (V3 a) get :: Get (V3 a)
Epsilon a => Epsilon (V3 a)
Instance details Defined in Linear.V3 Methods nearZero :: V3 a -> Bool
Serial a => Serial (V3 a)
Instance details Defined in Linear.V3 Methods serialize :: MonadPut m => V3 a -> m () deserialize :: MonadGet m => m (V3 a)
Generic1 V3
Instance details Defined in Linear.V3 Associated Types type Rep1 V3 :: k -> Type # Methods from1 :: V3 a -> Rep1 V3 a # to1 :: Rep1 V3 a -> V3 a #
FoldableWithIndex (E V3) V3
Instance details Defined in Linear.V3 Methods ifoldMap :: Monoid m => (E V3 -> a -> m) -> V3 a -> m # ifolded :: IndexedFold (E V3) (V3 a) a # ifoldr :: (E V3 -> a -> b -> b) -> b -> V3 a -> b # ifoldl :: (E V3 -> b -> a -> b) -> b -> V3 a -> b # ifoldr' :: (E V3 -> a -> b -> b) -> b -> V3 a -> b # ifoldl' :: (E V3 -> b -> a -> b) -> b -> V3 a -> b #
FunctorWithIndex (E V3) V3
Instance details Defined in Linear.V3 Methods imap :: (E V3 -> a -> b) -> V3 a -> V3 b # imapped :: IndexedSetter (E V3) (V3 a) (V3 b) a b #
TraversableWithIndex (E V3) V3
Instance details Defined in Linear.V3 Methods itraverse :: Applicative f => (E V3 -> a -> f b) -> V3 a -> f (V3 b) # itraversed :: IndexedTraversal (E V3) (V3 a) (V3 b) a b #
Each (V3 a) (V3 b) a b
Instance details Defined in Linear.V3 Methods each :: Traversal (V3 a) (V3 b) a b #
Field1 (V3 a) (V3 a) a a
Instance details Defined in Linear.V3 Methods _1 :: Lens (V3 a) (V3 a) a a #
Field2 (V3 a) (V3 a) a a
Instance details Defined in Linear.V3 Methods _2 :: Lens (V3 a) (V3 a) a a #
Field3 (V3 a) (V3 a) a a
Instance details Defined in Linear.V3 Methods _3 :: Lens (V3 a) (V3 a) a a #
TypeableFloat n => Traced (BoundingBox V3 n)
Instance details Defined in Diagrams.BoundingBox Methods getTrace :: BoundingBox V3 n -> Trace (V (BoundingBox V3 n)) (N (BoundingBox V3 n)) #
type Diff V3
Instance details Defined in Linear.Affine type Diff V3 = V3
type Rep V3
Instance details Defined in Linear.V3 type Rep V3 = E V3
type Size V3
Instance details Defined in Linear.V3 type Size V3 = 3
data MVector s (V3 a)
Instance details Defined in Linear.V3 data MVector s (V3 a) = MV_V3 !Int !(MVector s a)
type Rep (V3 a)
Instance details Defined in Linear.V3 type Rep (V3 a) = D1 (MetaData "V3" "Linear.V3" "lnr-1.20.9-8295282c" False) (C1 (MetaCons "V3" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 a) :: (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 a) :: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 a))))
data Vector (V3 a)
Instance details Defined in Linear.V3 data Vector (V3 a) = V_V3 !Int !(Vector a)
type N (V3 n)
Instance details Defined in Diagrams.ThreeD.Types type N (V3 n) = n
type V (V3 n)
Instance details Defined in Diagrams.ThreeD.Types type V (V3 n) = V3
type Decomposition (V3 n)
Instance details Defined in Diagrams.Coordinates type Decomposition (V3 n) = (n :& n) :& n
type FinalCoord (V3 n)
Instance details Defined in Diagrams.Coordinates type FinalCoord (V3 n) = n
type PrevDim (V3 n)
Instance details Defined in Diagrams.Coordinates type PrevDim (V3 n) = V2 n
type Index (V3 a)
Instance details Defined in Linear.V3 type Index (V3 a) = E V3
type IxValue (V3 a)
Instance details Defined in Linear.V3 type IxValue (V3 a) = a
type Rep1 V3
Instance details Defined in Linear.V3 type Rep1 V3 = D1 (MetaData "V3" "Linear.V3" "lnr-1.20.9-8295282c" False) (C1 (MetaCons "V3" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) Par1 :: (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) Par1 :: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) Par1)))

class Functor f => Additive (f :: Type -> Type) where #

Minimal complete definition

Nothing

Methods

zero :: Num a => f a #

(^+^) :: Num a => f a -> f a -> f a #

(^-^) :: Num a => f a -> f a -> f a #

lerp :: Num a => a -> f a -> f a -> f a #

liftU2 :: (a -> a -> a) -> f a -> f a -> f a #

liftI2 :: (a -> b -> c) -> f a -> f b -> f c #

Instances

Additive []
Instance details Defined in Linear.Vector Methods zero :: Num a => [a] # (^+^) :: Num a => [a] -> [a] -> [a] # (^-^) :: Num a => [a] -> [a] -> [a] # lerp :: Num a => a -> [a] -> [a] -> [a] # liftU2 :: (a -> a -> a) -> [a] -> [a] -> [a] # liftI2 :: (a -> b -> c) -> [a] -> [b] -> [c] #
Additive Maybe
Instance details Defined in Linear.Vector Methods zero :: Num a => Maybe a # (^+^) :: Num a => Maybe a -> Maybe a -> Maybe a # (^-^) :: Num a => Maybe a -> Maybe a -> Maybe a # lerp :: Num a => a -> Maybe a -> Maybe a -> Maybe a # liftU2 :: (a -> a -> a) -> Maybe a -> Maybe a -> Maybe a # liftI2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c #
Additive Complex
Instance details Defined in Linear.Vector Methods zero :: Num a => Complex a # (^+^) :: Num a => Complex a -> Complex a -> Complex a # (^-^) :: Num a => Complex a -> Complex a -> Complex a # lerp :: Num a => a -> Complex a -> Complex a -> Complex a # liftU2 :: (a -> a -> a) -> Complex a -> Complex a -> Complex a # liftI2 :: (a -> b -> c) -> Complex a -> Complex b -> Complex c #
Additive ZipList
Instance details Defined in Linear.Vector Methods zero :: Num a => ZipList a # (^+^) :: Num a => ZipList a -> ZipList a -> ZipList a # (^-^) :: Num a => ZipList a -> ZipList a -> ZipList a # lerp :: Num a => a -> ZipList a -> ZipList a -> ZipList a # liftU2 :: (a -> a -> a) -> ZipList a -> ZipList a -> ZipList a # liftI2 :: (a -> b -> c) -> ZipList a -> ZipList b -> ZipList c #
Additive Identity
Instance details Defined in Linear.Vector Methods zero :: Num a => Identity a # (^+^) :: Num a => Identity a -> Identity a -> Identity a # (^-^) :: Num a => Identity a -> Identity a -> Identity a # lerp :: Num a => a -> Identity a -> Identity a -> Identity a # liftU2 :: (a -> a -> a) -> Identity a -> Identity a -> Identity a # liftI2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c #
Additive IntMap
Instance details Defined in Linear.Vector Methods zero :: Num a => IntMap a # (^+^) :: Num a => IntMap a -> IntMap a -> IntMap a # (^-^) :: Num a => IntMap a -> IntMap a -> IntMap a # lerp :: Num a => a -> IntMap a -> IntMap a -> IntMap a # liftU2 :: (a -> a -> a) -> IntMap a -> IntMap a -> IntMap a # liftI2 :: (a -> b -> c) -> IntMap a -> IntMap b -> IntMap c #
Additive Vector
Instance details Defined in Linear.Vector Methods zero :: Num a => Vector a # (^+^) :: Num a => Vector a -> Vector a -> Vector a # (^-^) :: Num a => Vector a -> Vector a -> Vector a # lerp :: Num a => a -> Vector a -> Vector a -> Vector a # liftU2 :: (a -> a -> a) -> Vector a -> Vector a -> Vector a # liftI2 :: (a -> b -> c) -> Vector a -> Vector b -> Vector c #
Additive Duration
Instance details Defined in Data.Active Methods zero :: Num a => Duration a # (^+^) :: Num a => Duration a -> Duration a -> Duration a # (^-^) :: Num a => Duration a -> Duration a -> Duration a # lerp :: Num a => a -> Duration a -> Duration a -> Duration a # liftU2 :: (a -> a -> a) -> Duration a -> Duration a -> Duration a # liftI2 :: (a -> b -> c) -> Duration a -> Duration b -> Duration c #
Additive Angle
Instance details Defined in Diagrams.Angle Methods zero :: Num a => Angle a # (^+^) :: Num a => Angle a -> Angle a -> Angle a # (^-^) :: Num a => Angle a -> Angle a -> Angle a # lerp :: Num a => a -> Angle a -> Angle a -> Angle a # liftU2 :: (a -> a -> a) -> Angle a -> Angle a -> Angle a # liftI2 :: (a -> b -> c) -> Angle a -> Angle b -> Angle c #
Additive V2
Instance details Defined in Linear.V2 Methods zero :: Num a => V2 a # (^+^) :: Num a => V2 a -> V2 a -> V2 a # (^-^) :: Num a => V2 a -> V2 a -> V2 a # lerp :: Num a => a -> V2 a -> V2 a -> V2 a # liftU2 :: (a -> a -> a) -> V2 a -> V2 a -> V2 a # liftI2 :: (a -> b -> c) -> V2 a -> V2 b -> V2 c #
Additive V3
Instance details Defined in Linear.V3 Methods zero :: Num a => V3 a # (^+^) :: Num a => V3 a -> V3 a -> V3 a # (^-^) :: Num a => V3 a -> V3 a -> V3 a # lerp :: Num a => a -> V3 a -> V3 a -> V3 a # liftU2 :: (a -> a -> a) -> V3 a -> V3 a -> V3 a # liftI2 :: (a -> b -> c) -> V3 a -> V3 b -> V3 c #
Additive V4
Instance details Defined in Linear.V4 Methods zero :: Num a => V4 a # (^+^) :: Num a => V4 a -> V4 a -> V4 a # (^-^) :: Num a => V4 a -> V4 a -> V4 a # lerp :: Num a => a -> V4 a -> V4 a -> V4 a # liftU2 :: (a -> a -> a) -> V4 a -> V4 a -> V4 a # liftI2 :: (a -> b -> c) -> V4 a -> V4 b -> V4 c #
Additive V1
Instance details Defined in Linear.V1 Methods zero :: Num a => V1 a # (^+^) :: Num a => V1 a -> V1 a -> V1 a # (^-^) :: Num a => V1 a -> V1 a -> V1 a # lerp :: Num a => a -> V1 a -> V1 a -> V1 a # liftU2 :: (a -> a -> a) -> V1 a -> V1 a -> V1 a # liftI2 :: (a -> b -> c) -> V1 a -> V1 b -> V1 c #
Additive Plucker
Instance details Defined in Linear.Plucker Methods zero :: Num a => Plucker a # (^+^) :: Num a => Plucker a -> Plucker a -> Plucker a # (^-^) :: Num a => Plucker a -> Plucker a -> Plucker a # lerp :: Num a => a -> Plucker a -> Plucker a -> Plucker a # liftU2 :: (a -> a -> a) -> Plucker a -> Plucker a -> Plucker a # liftI2 :: (a -> b -> c) -> Plucker a -> Plucker b -> Plucker c #
Additive Quaternion
Instance details Defined in Linear.Quaternion Methods zero :: Num a => Quaternion a # (^+^) :: Num a => Quaternion a -> Quaternion a -> Quaternion a # (^-^) :: Num a => Quaternion a -> Quaternion a -> Quaternion a # lerp :: Num a => a -> Quaternion a -> Quaternion a -> Quaternion a # liftU2 :: (a -> a -> a) -> Quaternion a -> Quaternion a -> Quaternion a # liftI2 :: (a -> b -> c) -> Quaternion a -> Quaternion b -> Quaternion c #
Additive V0
Instance details Defined in Linear.V0 Methods zero :: Num a => V0 a # (^+^) :: Num a => V0 a -> V0 a -> V0 a # (^-^) :: Num a => V0 a -> V0 a -> V0 a # lerp :: Num a => a -> V0 a -> V0 a -> V0 a # liftU2 :: (a -> a -> a) -> V0 a -> V0 a -> V0 a # liftI2 :: (a -> b -> c) -> V0 a -> V0 b -> V0 c #
Ord k => Additive (Map k)
Instance details Defined in Linear.Vector Methods zero :: Num a => Map k a # (^+^) :: Num a => Map k a -> Map k a -> Map k a # (^-^) :: Num a => Map k a -> Map k a -> Map k a # lerp :: Num a => a -> Map k a -> Map k a -> Map k a # liftU2 :: (a -> a -> a) -> Map k a -> Map k a -> Map k a # liftI2 :: (a -> b -> c) -> Map k a -> Map k b -> Map k c #
(Eq k, Hashable k) => Additive (HashMap k)
Instance details Defined in Linear.Vector Methods zero :: Num a => HashMap k a # (^+^) :: Num a => HashMap k a -> HashMap k a -> HashMap k a # (^-^) :: Num a => HashMap k a -> HashMap k a -> HashMap k a # lerp :: Num a => a -> HashMap k a -> HashMap k a -> HashMap k a # liftU2 :: (a -> a -> a) -> HashMap k a -> HashMap k a -> HashMap k a # liftI2 :: (a -> b -> c) -> HashMap k a -> HashMap k b -> HashMap k c #
Additive (Measured n)
Instance details Defined in Diagrams.Core.Measure Methods zero :: Num a => Measured n a # (^+^) :: Num a => Measured n a -> Measured n a -> Measured n a # (^-^) :: Num a => Measured n a -> Measured n a -> Measured n a # lerp :: Num a => a -> Measured n a -> Measured n a -> Measured n a # liftU2 :: (a -> a -> a) -> Measured n a -> Measured n a -> Measured n a # liftI2 :: (a -> b -> c) -> Measured n a -> Measured n b -> Measured n c #
Additive f => Additive (Point f)
Instance details Defined in Linear.Affine Methods zero :: Num a => Point f a # (^+^) :: Num a => Point f a -> Point f a -> Point f a # (^-^) :: Num a => Point f a -> Point f a -> Point f a # lerp :: Num a => a -> Point f a -> Point f a -> Point f a # liftU2 :: (a -> a -> a) -> Point f a -> Point f a -> Point f a # liftI2 :: (a -> b -> c) -> Point f a -> Point f b -> Point f c #
Dim n => Additive (V n)
Instance details Defined in Linear.V Methods zero :: Num a => V n a # (^+^) :: Num a => V n a -> V n a -> V n a # (^-^) :: Num a => V n a -> V n a -> V n a # lerp :: Num a => a -> V n a -> V n a -> V n a # liftU2 :: (a -> a -> a) -> V n a -> V n a -> V n a # liftI2 :: (a -> b -> c) -> V n a -> V n b -> V n c #
Additive ((->) b :: Type -> Type)
Instance details Defined in Linear.Vector Methods zero :: Num a => b -> a # (^+^) :: Num a => (b -> a) -> (b -> a) -> b -> a # (^-^) :: Num a => (b -> a) -> (b -> a) -> b -> a # lerp :: Num a => a -> (b -> a) -> (b -> a) -> b -> a # liftU2 :: (a -> a -> a) -> (b -> a) -> (b -> a) -> b -> a # liftI2 :: (a -> b0 -> c) -> (b -> a) -> (b -> b0) -> b -> c #

newtype E (t :: Type -> Type) #

Constructors

E
Fields el :: forall x. Lens' (t x) x

Instances

FoldableWithIndex (E V2) V2
Instance details Defined in Linear.V2 Methods ifoldMap :: Monoid m => (E V2 -> a -> m) -> V2 a -> m # ifolded :: IndexedFold (E V2) (V2 a) a # ifoldr :: (E V2 -> a -> b -> b) -> b -> V2 a -> b # ifoldl :: (E V2 -> b -> a -> b) -> b -> V2 a -> b # ifoldr' :: (E V2 -> a -> b -> b) -> b -> V2 a -> b # ifoldl' :: (E V2 -> b -> a -> b) -> b -> V2 a -> b #
FoldableWithIndex (E V3) V3
Instance details Defined in Linear.V3 Methods ifoldMap :: Monoid m => (E V3 -> a -> m) -> V3 a -> m # ifolded :: IndexedFold (E V3) (V3 a) a # ifoldr :: (E V3 -> a -> b -> b) -> b -> V3 a -> b # ifoldl :: (E V3 -> b -> a -> b) -> b -> V3 a -> b # ifoldr' :: (E V3 -> a -> b -> b) -> b -> V3 a -> b # ifoldl' :: (E V3 -> b -> a -> b) -> b -> V3 a -> b #
FoldableWithIndex (E V4) V4
Instance details Defined in Linear.V4 Methods ifoldMap :: Monoid m => (E V4 -> a -> m) -> V4 a -> m # ifolded :: IndexedFold (E V4) (V4 a) a # ifoldr :: (E V4 -> a -> b -> b) -> b -> V4 a -> b # ifoldl :: (E V4 -> b -> a -> b) -> b -> V4 a -> b # ifoldr' :: (E V4 -> a -> b -> b) -> b -> V4 a -> b # ifoldl' :: (E V4 -> b -> a -> b) -> b -> V4 a -> b #
FoldableWithIndex (E V1) V1
Instance details Defined in Linear.V1 Methods ifoldMap :: Monoid m => (E V1 -> a -> m) -> V1 a -> m # ifolded :: IndexedFold (E V1) (V1 a) a # ifoldr :: (E V1 -> a -> b -> b) -> b -> V1 a -> b # ifoldl :: (E V1 -> b -> a -> b) -> b -> V1 a -> b # ifoldr' :: (E V1 -> a -> b -> b) -> b -> V1 a -> b # ifoldl' :: (E V1 -> b -> a -> b) -> b -> V1 a -> b #
FoldableWithIndex (E Plucker) Plucker
Instance details Defined in Linear.Plucker Methods ifoldMap :: Monoid m => (E Plucker -> a -> m) -> Plucker a -> m # ifolded :: IndexedFold (E Plucker) (Plucker a) a # ifoldr :: (E Plucker -> a -> b -> b) -> b -> Plucker a -> b # ifoldl :: (E Plucker -> b -> a -> b) -> b -> Plucker a -> b # ifoldr' :: (E Plucker -> a -> b -> b) -> b -> Plucker a -> b # ifoldl' :: (E Plucker -> b -> a -> b) -> b -> Plucker a -> b #
FoldableWithIndex (E Quaternion) Quaternion
Instance details Defined in Linear.Quaternion Methods ifoldMap :: Monoid m => (E Quaternion -> a -> m) -> Quaternion a -> m # ifolded :: IndexedFold (E Quaternion) (Quaternion a) a # ifoldr :: (E Quaternion -> a -> b -> b) -> b -> Quaternion a -> b # ifoldl :: (E Quaternion -> b -> a -> b) -> b -> Quaternion a -> b # ifoldr' :: (E Quaternion -> a -> b -> b) -> b -> Quaternion a -> b # ifoldl' :: (E Quaternion -> b -> a -> b) -> b -> Quaternion a -> b #
FoldableWithIndex (E V0) V0
Instance details Defined in Linear.V0 Methods ifoldMap :: Monoid m => (E V0 -> a -> m) -> V0 a -> m # ifolded :: IndexedFold (E V0) (V0 a) a # ifoldr :: (E V0 -> a -> b -> b) -> b -> V0 a -> b # ifoldl :: (E V0 -> b -> a -> b) -> b -> V0 a -> b # ifoldr' :: (E V0 -> a -> b -> b) -> b -> V0 a -> b # ifoldl' :: (E V0 -> b -> a -> b) -> b -> V0 a -> b #
FunctorWithIndex (E V2) V2
Instance details Defined in Linear.V2 Methods imap :: (E V2 -> a -> b) -> V2 a -> V2 b # imapped :: IndexedSetter (E V2) (V2 a) (V2 b) a b #
FunctorWithIndex (E V3) V3
Instance details Defined in Linear.V3 Methods imap :: (E V3 -> a -> b) -> V3 a -> V3 b # imapped :: IndexedSetter (E V3) (V3 a) (V3 b) a b #
FunctorWithIndex (E V4) V4
Instance details Defined in Linear.V4 Methods imap :: (E V4 -> a -> b) -> V4 a -> V4 b # imapped :: IndexedSetter (E V4) (V4 a) (V4 b) a b #
FunctorWithIndex (E V1) V1
Instance details Defined in Linear.V1 Methods imap :: (E V1 -> a -> b) -> V1 a -> V1 b # imapped :: IndexedSetter (E V1) (V1 a) (V1 b) a b #
FunctorWithIndex (E Plucker) Plucker
Instance details Defined in Linear.Plucker Methods imap :: (E Plucker -> a -> b) -> Plucker a -> Plucker b # imapped :: IndexedSetter (E Plucker) (Plucker a) (Plucker b) a b #
FunctorWithIndex (E Quaternion) Quaternion
Instance details Defined in Linear.Quaternion Methods imap :: (E Quaternion -> a -> b) -> Quaternion a -> Quaternion b # imapped :: IndexedSetter (E Quaternion) (Quaternion a) (Quaternion b) a b #
FunctorWithIndex (E V0) V0
Instance details Defined in Linear.V0 Methods imap :: (E V0 -> a -> b) -> V0 a -> V0 b # imapped :: IndexedSetter (E V0) (V0 a) (V0 b) a b #
TraversableWithIndex (E V2) V2
Instance details Defined in Linear.V2 Methods itraverse :: Applicative f => (E V2 -> a -> f b) -> V2 a -> f (V2 b) # itraversed :: IndexedTraversal (E V2) (V2 a) (V2 b) a b #
TraversableWithIndex (E V3) V3
Instance details Defined in Linear.V3 Methods itraverse :: Applicative f => (E V3 -> a -> f b) -> V3 a -> f (V3 b) # itraversed :: IndexedTraversal (E V3) (V3 a) (V3 b) a b #
TraversableWithIndex (E V4) V4
Instance details Defined in Linear.V4 Methods itraverse :: Applicative f => (E V4 -> a -> f b) -> V4 a -> f (V4 b) # itraversed :: IndexedTraversal (E V4) (V4 a) (V4 b) a b #
TraversableWithIndex (E V1) V1
Instance details Defined in Linear.V1 Methods itraverse :: Applicative f => (E V1 -> a -> f b) -> V1 a -> f (V1 b) # itraversed :: IndexedTraversal (E V1) (V1 a) (V1 b) a b #
TraversableWithIndex (E Plucker) Plucker
Instance details Defined in Linear.Plucker Methods itraverse :: Applicative f => (E Plucker -> a -> f b) -> Plucker a -> f (Plucker b) # itraversed :: IndexedTraversal (E Plucker) (Plucker a) (Plucker b) a b #
TraversableWithIndex (E Quaternion) Quaternion
Instance details Defined in Linear.Quaternion Methods itraverse :: Applicative f => (E Quaternion -> a -> f b) -> Quaternion a -> f (Quaternion b) # itraversed :: IndexedTraversal (E Quaternion) (Quaternion a) (Quaternion b) a b #
TraversableWithIndex (E V0) V0
Instance details Defined in Linear.V0 Methods itraverse :: Applicative f => (E V0 -> a -> f b) -> V0 a -> f (V0 b) # itraversed :: IndexedTraversal (E V0) (V0 a) (V0 b) a b #

class Ixed m => At m #

Minimal complete definition

at

Instances

At IntSet
Instance details Defined in Control.Lens.At Methods at :: Index IntSet -> Lens' IntSet (Maybe (IxValue IntSet))
At (Maybe a)
Instance details Defined in Control.Lens.At Methods at :: Index (Maybe a) -> Lens' (Maybe a) (Maybe (IxValue (Maybe a)))
At (IntMap a)
Instance details Defined in Control.Lens.At Methods at :: Index (IntMap a) -> Lens' (IntMap a) (Maybe (IxValue (IntMap a)))
Ord k => At (Set k)
Instance details Defined in Control.Lens.At Methods at :: Index (Set k) -> Lens' (Set k) (Maybe (IxValue (Set k)))
(Eq k, Hashable k) => At (HashSet k)
Instance details Defined in Control.Lens.At Methods at :: Index (HashSet k) -> Lens' (HashSet k) (Maybe (IxValue (HashSet k)))
Ord k => At (Map k a)
Instance details Defined in Control.Lens.At Methods at :: Index (Map k a) -> Lens' (Map k a) (Maybe (IxValue (Map k a)))
(Eq k, Hashable k) => At (HashMap k a)
Instance details Defined in Control.Lens.At Methods at :: Index (HashMap k a) -> Lens' (HashMap k a) (Maybe (IxValue (HashMap k a)))
At (Style v n)
Instance details Defined in Diagrams.Core.Style Methods at :: Index (Style v n) -> Lens' (Style v n) (Maybe (IxValue (Style v n)))

class Contains m #

Minimal complete definition

contains

Instances

Contains IntSet
Instance details Defined in Control.Lens.At Methods contains :: Index IntSet -> Lens' IntSet Bool
Ord a => Contains (Set a)
Instance details Defined in Control.Lens.At Methods contains :: Index (Set a) -> Lens' (Set a) Bool
(Eq a, Hashable a) => Contains (HashSet a)
Instance details Defined in Control.Lens.At Methods contains :: Index (HashSet a) -> Lens' (HashSet a) Bool

type family Index s :: Type #

Instances

type Index ByteString
Instance details Defined in Control.Lens.At type Index ByteString = Int64
type Index ByteString
Instance details Defined in Control.Lens.At type Index ByteString = Int
type Index IntSet
Instance details Defined in Control.Lens.At type Index IntSet = Int
type Index Text
Instance details Defined in Control.Lens.At type Index Text = Int64
type Index Text
Instance details Defined in Control.Lens.At type Index Text = Int
type Index [a]
Instance details Defined in Control.Lens.At type Index [a] = Int
type Index (Maybe a)
Instance details Defined in Control.Lens.At type Index (Maybe a) = ()
type Index (Complex a)
Instance details Defined in Control.Lens.At type Index (Complex a) = Int
type Index (Identity a)
Instance details Defined in Control.Lens.At type Index (Identity a) = ()
type Index (NonEmpty a)
Instance details Defined in Control.Lens.At type Index (NonEmpty a) = Int
type Index (IntMap a)
Instance details Defined in Control.Lens.At type Index (IntMap a) = Int
type Index (Tree a)
Instance details Defined in Control.Lens.At type Index (Tree a) = [Int]
type Index (Seq a)
Instance details Defined in Control.Lens.At type Index (Seq a) = Int
type Index (Set a)
Instance details Defined in Control.Lens.At type Index (Set a) = a
type Index (HashSet a)
Instance details Defined in Control.Lens.At type Index (HashSet a) = a
type Index (Vector a)
Instance details Defined in Control.Lens.At type Index (Vector a) = Int
type Index (Vector a)
Instance details Defined in Control.Lens.At type Index (Vector a) = Int
type Index (Vector a)
Instance details Defined in Control.Lens.At type Index (Vector a) = Int
type Index (Vector a)
Instance details Defined in Control.Lens.At type Index (Vector a) = Int
type Index (V2 a)
Instance details Defined in Linear.V2 type Index (V2 a) = E V2
type Index (V3 a)
Instance details Defined in Linear.V3 type Index (V3 a) = E V3
type Index (V4 a)
Instance details Defined in Linear.V4 type Index (V4 a) = E V4
type Index (V1 a)
Instance details Defined in Linear.V1 type Index (V1 a) = E V1
type Index (Plucker a)
Instance details Defined in Linear.Plucker type Index (Plucker a) = E Plucker
type Index (Quaternion a)
Instance details Defined in Linear.Quaternion type Index (Quaternion a) = E Quaternion
type Index (V0 a)
Instance details Defined in Linear.V0 type Index (V0 a) = E V0
type Index (e -> a)
Instance details Defined in Control.Lens.At type Index (e -> a) = e
type Index (a, b)
Instance details Defined in Control.Lens.At type Index (a, b) = Int
type Index (UArray i e)
Instance details Defined in Control.Lens.At type Index (UArray i e) = i
type Index (Array i e)
Instance details Defined in Control.Lens.At type Index (Array i e) = i
type Index (Map k a)
Instance details Defined in Control.Lens.At type Index (Map k a) = k
type Index (HashMap k a)
Instance details Defined in Control.Lens.At type Index (HashMap k a) = k
type Index (Style v n)
Instance details Defined in Diagrams.Core.Style type Index (Style v n) = TypeRep
type Index (Point f a)
Instance details Defined in Linear.Affine type Index (Point f a) = Index (f a)
type Index (a, b, c)
Instance details Defined in Control.Lens.At type Index (a, b, c) = Int
type Index (V n a)
Instance details Defined in Linear.V type Index (V n a) = Int
type Index (a, b, c, d)
Instance details Defined in Control.Lens.At type Index (a, b, c, d) = Int
type Index (a, b, c, d, e)
Instance details Defined in Control.Lens.At type Index (a, b, c, d, e) = Int
type Index (a, b, c, d, e, f)
Instance details Defined in Control.Lens.At type Index (a, b, c, d, e, f) = Int
type Index (a, b, c, d, e, f, g)
Instance details Defined in Control.Lens.At type Index (a, b, c, d, e, f, g) = Int
type Index (a, b, c, d, e, f, g, h)
Instance details Defined in Control.Lens.At type Index (a, b, c, d, e, f, g, h) = Int
type Index (a, b, c, d, e, f, g, h, i)
Instance details Defined in Control.Lens.At type Index (a, b, c, d, e, f, g, h, i) = Int

type family IxValue m :: Type #

Instances

type IxValue ByteString
Instance details Defined in Control.Lens.At type IxValue ByteString = Word8
type IxValue ByteString
Instance details Defined in Control.Lens.At type IxValue ByteString = Word8
type IxValue IntSet
Instance details Defined in Control.Lens.At type IxValue IntSet = ()
type IxValue Text
Instance details Defined in Control.Lens.At type IxValue Text = Char
type IxValue Text
Instance details Defined in Control.Lens.At type IxValue Text = Char
type IxValue [a]
Instance details Defined in Control.Lens.At type IxValue [a] = a
type IxValue (Maybe a)
Instance details Defined in Control.Lens.At type IxValue (Maybe a) = a
type IxValue (Identity a)
Instance details Defined in Control.Lens.At type IxValue (Identity a) = a
type IxValue (NonEmpty a)
Instance details Defined in Control.Lens.At type IxValue (NonEmpty a) = a
type IxValue (IntMap a)
Instance details Defined in Control.Lens.At type IxValue (IntMap a) = a
type IxValue (Tree a)
Instance details Defined in Control.Lens.At type IxValue (Tree a) = a
type IxValue (Seq a)
Instance details Defined in Control.Lens.At type IxValue (Seq a) = a
type IxValue (Set k)
Instance details Defined in Control.Lens.At type IxValue (Set k) = ()
type IxValue (HashSet k)
Instance details Defined in Control.Lens.At type IxValue (HashSet k) = ()
type IxValue (Vector a)
Instance details Defined in Control.Lens.At type IxValue (Vector a) = a
type IxValue (Vector a)
Instance details Defined in Control.Lens.At type IxValue (Vector a) = a
type IxValue (Vector a)
Instance details Defined in Control.Lens.At type IxValue (Vector a) = a
type IxValue (Vector a)
Instance details Defined in Control.Lens.At type IxValue (Vector a) = a
type IxValue (V2 a)
Instance details Defined in Linear.V2 type IxValue (V2 a) = a
type IxValue (V3 a)
Instance details Defined in Linear.V3 type IxValue (V3 a) = a
type IxValue (V4 a)
Instance details Defined in Linear.V4 type IxValue (V4 a) = a
type IxValue (V1 a)
Instance details Defined in Linear.V1 type IxValue (V1 a) = a
type IxValue (Plucker a)
Instance details Defined in Linear.Plucker type IxValue (Plucker a) = a
type IxValue (Quaternion a)
Instance details Defined in Linear.Quaternion type IxValue (Quaternion a) = a
type IxValue (V0 a)
Instance details Defined in Linear.V0 type IxValue (V0 a) = a
type IxValue (e -> a)
Instance details Defined in Control.Lens.At type IxValue (e -> a) = a
type IxValue (a, a2)
Instance details Defined in Control.Lens.At type IxValue (a, a2) = a
type IxValue (UArray i e)
Instance details Defined in Control.Lens.At type IxValue (UArray i e) = e
type IxValue (Array i e)
Instance details Defined in Control.Lens.At type IxValue (Array i e) = e
type IxValue (Map k a)
Instance details Defined in Control.Lens.At type IxValue (Map k a) = a
type IxValue (HashMap k a)
Instance details Defined in Control.Lens.At type IxValue (HashMap k a) = a
type IxValue (Style v n)
Instance details Defined in Diagrams.Core.Style type IxValue (Style v n) = Attribute v n
type IxValue (Point f a)
Instance details Defined in Linear.Affine type IxValue (Point f a) = IxValue (f a)
type IxValue (a, a2, a3)
Instance details Defined in Control.Lens.At type IxValue (a, a2, a3) = a
type IxValue (V n a)
Instance details Defined in Linear.V type IxValue (V n a) = a
type IxValue (a, a2, a3, a4)
Instance details Defined in Control.Lens.At type IxValue (a, a2, a3, a4) = a
type IxValue (a, a2, a3, a4, a5)
Instance details Defined in Control.Lens.At type IxValue (a, a2, a3, a4, a5) = a
type IxValue (a, a2, a3, a4, a5, a6)
Instance details Defined in Control.Lens.At type IxValue (a, a2, a3, a4, a5, a6) = a
type IxValue (a, a2, a3, a4, a5, a6, a7)
Instance details Defined in Control.Lens.At type IxValue (a, a2, a3, a4, a5, a6, a7) = a
type IxValue (a, a2, a3, a4, a5, a6, a7, a8)
Instance details Defined in Control.Lens.At type IxValue (a, a2, a3, a4, a5, a6, a7, a8) = a
type IxValue (a, a2, a3, a4, a5, a6, a7, a8, a9)
Instance details Defined in Control.Lens.At type IxValue (a, a2, a3, a4, a5, a6, a7, a8, a9) = a

class Ixed m where #

Minimal complete definition

Nothing

Methods

ix :: Index m -> Traversal' m (IxValue m) #

Instances

Ixed ByteString
Instance details Defined in Control.Lens.At Methods ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) #
Ixed ByteString
Instance details Defined in Control.Lens.At Methods ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) #
Ixed IntSet
Instance details Defined in Control.Lens.At Methods ix :: Index IntSet -> Traversal' IntSet (IxValue IntSet) #
Ixed Text
Instance details Defined in Control.Lens.At Methods ix :: Index Text -> Traversal' Text (IxValue Text) #
Ixed Text
Instance details Defined in Control.Lens.At Methods ix :: Index Text -> Traversal' Text (IxValue Text) #
Ixed [a]
Instance details Defined in Control.Lens.At Methods ix :: Index [a] -> Traversal' [a] (IxValue [a]) #
Ixed (Maybe a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Maybe a) -> Traversal' (Maybe a) (IxValue (Maybe a)) #
Ixed (Identity a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Identity a) -> Traversal' (Identity a) (IxValue (Identity a)) #
Ixed (NonEmpty a)
Instance details Defined in Control.Lens.At Methods ix :: Index (NonEmpty a) -> Traversal' (NonEmpty a) (IxValue (NonEmpty a)) #
Ixed (IntMap a)
Instance details Defined in Control.Lens.At Methods ix :: Index (IntMap a) -> Traversal' (IntMap a) (IxValue (IntMap a)) #
Ixed (Tree a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Tree a) -> Traversal' (Tree a) (IxValue (Tree a)) #
Ixed (Seq a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Seq a) -> Traversal' (Seq a) (IxValue (Seq a)) #
Ord k => Ixed (Set k)
Instance details Defined in Control.Lens.At Methods ix :: Index (Set k) -> Traversal' (Set k) (IxValue (Set k)) #
(Eq k, Hashable k) => Ixed (HashSet k)
Instance details Defined in Control.Lens.At Methods ix :: Index (HashSet k) -> Traversal' (HashSet k) (IxValue (HashSet k)) #
Unbox a => Ixed (Vector a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Vector a) -> Traversal' (Vector a) (IxValue (Vector a)) #
Ixed (Vector a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Vector a) -> Traversal' (Vector a) (IxValue (Vector a)) #
Prim a => Ixed (Vector a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Vector a) -> Traversal' (Vector a) (IxValue (Vector a)) #
Storable a => Ixed (Vector a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Vector a) -> Traversal' (Vector a) (IxValue (Vector a)) #
Ixed (V2 a)
Instance details Defined in Linear.V2 Methods ix :: Index (V2 a) -> Traversal' (V2 a) (IxValue (V2 a)) #
Ixed (V3 a)
Instance details Defined in Linear.V3 Methods ix :: Index (V3 a) -> Traversal' (V3 a) (IxValue (V3 a)) #
Ixed (V4 a)
Instance details Defined in Linear.V4 Methods ix :: Index (V4 a) -> Traversal' (V4 a) (IxValue (V4 a)) #
Ixed (V1 a)
Instance details Defined in Linear.V1 Methods ix :: Index (V1 a) -> Traversal' (V1 a) (IxValue (V1 a)) #
Ixed (Plucker a)
Instance details Defined in Linear.Plucker Methods ix :: Index (Plucker a) -> Traversal' (Plucker a) (IxValue (Plucker a)) #
Ixed (Quaternion a)
Instance details Defined in Linear.Quaternion Methods ix :: Index (Quaternion a) -> Traversal' (Quaternion a) (IxValue (Quaternion a)) #
Ixed (V0 a)
Instance details Defined in Linear.V0 Methods ix :: Index (V0 a) -> Traversal' (V0 a) (IxValue (V0 a)) #
Eq e => Ixed (e -> a)
Instance details Defined in Control.Lens.At Methods ix :: Index (e -> a) -> Traversal' (e -> a) (IxValue (e -> a)) #
a ~ a2 => Ixed (a, a2)
Instance details Defined in Control.Lens.At Methods ix :: Index (a, a2) -> Traversal' (a, a2) (IxValue (a, a2)) #
(IArray UArray e, Ix i) => Ixed (UArray i e)
Instance details Defined in Control.Lens.At Methods ix :: Index (UArray i e) -> Traversal' (UArray i e) (IxValue (UArray i e)) #
Ix i => Ixed (Array i e)
Instance details Defined in Control.Lens.At Methods ix :: Index (Array i e) -> Traversal' (Array i e) (IxValue (Array i e)) #
Ord k => Ixed (Map k a)
Instance details Defined in Control.Lens.At Methods ix :: Index (Map k a) -> Traversal' (Map k a) (IxValue (Map k a)) #
(Eq k, Hashable k) => Ixed (HashMap k a)
Instance details Defined in Control.Lens.At Methods ix :: Index (HashMap k a) -> Traversal' (HashMap k a) (IxValue (HashMap k a)) #
Ixed (Style v n)
Instance details Defined in Diagrams.Core.Style Methods ix :: Index (Style v n) -> Traversal' (Style v n) (IxValue (Style v n)) #
Ixed (f a) => Ixed (Point f a)
Instance details Defined in Linear.Affine Methods ix :: Index (Point f a) -> Traversal' (Point f a) (IxValue (Point f a)) #
(a ~ a2, a ~ a3) => Ixed (a, a2, a3)
Instance details Defined in Control.Lens.At Methods ix :: Index (a, a2, a3) -> Traversal' (a, a2, a3) (IxValue (a, a2, a3)) #
Ixed (V n a)
Instance details Defined in Linear.V Methods ix :: Index (V n a) -> Traversal' (V n a) (IxValue (V n a)) #
(a ~ a2, a ~ a3, a ~ a4) => Ixed (a, a2, a3, a4)
Instance details Defined in Control.Lens.At Methods ix :: Index (a, a2, a3, a4) -> Traversal' (a, a2, a3, a4) (IxValue (a, a2, a3, a4)) #
(a ~ a2, a ~ a3, a ~ a4, a ~ a5) => Ixed (a, a2, a3, a4, a5)
Instance details Defined in Control.Lens.At Methods ix :: Index (a, a2, a3, a4, a5) -> Traversal' (a, a2, a3, a4, a5) (IxValue (a, a2, a3, a4, a5)) #
(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6) => Ixed (a, a2, a3, a4, a5, a6)
Instance details Defined in Control.Lens.At Methods ix :: Index (a, a2, a3, a4, a5, a6) -> Traversal' (a, a2, a3, a4, a5, a6) (IxValue (a, a2, a3, a4, a5, a6)) #
(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7) => Ixed (a, a2, a3, a4, a5, a6, a7)
Instance details Defined in Control.Lens.At Methods ix :: Index (a, a2, a3, a4, a5, a6, a7) -> Traversal' (a, a2, a3, a4, a5, a6, a7) (IxValue (a, a2, a3, a4, a5, a6, a7)) #
(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, a ~ a8) => Ixed (a, a2, a3, a4, a5, a6, a7, a8)
Instance details Defined in Control.Lens.At Methods ix :: Index (a, a2, a3, a4, a5, a6, a7, a8) -> Traversal' (a, a2, a3, a4, a5, a6, a7, a8) (IxValue (a, a2, a3, a4, a5, a6, a7, a8)) #
(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, a ~ a8, a ~ a9) => Ixed (a, a2, a3, a4, a5, a6, a7, a8, a9)
Instance details Defined in Control.Lens.At Methods ix :: Index (a, a2, a3, a4, a5, a6, a7, a8, a9) -> Traversal' (a, a2, a3, a4, a5, a6, a7, a8, a9) (IxValue (a, a2, a3, a4, a5, a6, a7, a8, a9)) #

class Cons s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_Cons :: Prism s t (a, s) (b, t) #

Instances

Cons ByteString ByteString Word8 Word8
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism ByteString ByteString (Word8, ByteString) (Word8, ByteString) #
Cons ByteString ByteString Word8 Word8
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism ByteString ByteString (Word8, ByteString) (Word8, ByteString) #
Cons Text Text Char Char
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism Text Text (Char, Text) (Char, Text) #
Cons Text Text Char Char
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism Text Text (Char, Text) (Char, Text) #
Cons [a] [b] a b
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism [a] [b] (a, [a]) (b, [b]) #
Cons (ZipList a) (ZipList b) a b
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism (ZipList a) (ZipList b) (a, ZipList a) (b, ZipList b) #
Cons (Seq a) (Seq b) a b
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism (Seq a) (Seq b) (a, Seq a) (b, Seq b) #
(Unbox a, Unbox b) => Cons (Vector a) (Vector b) a b
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism (Vector a) (Vector b) (a, Vector a) (b, Vector b) #
Cons (Vector a) (Vector b) a b
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism (Vector a) (Vector b) (a, Vector a) (b, Vector b) #
(Prim a, Prim b) => Cons (Vector a) (Vector b) a b
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism (Vector a) (Vector b) (a, Vector a) (b, Vector b) #
(Storable a, Storable b) => Cons (Vector a) (Vector b) a b
Instance details Defined in Control.Lens.Cons Methods _Cons :: Prism (Vector a) (Vector b) (a, Vector a) (b, Vector b) #
Cons (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n'))
Instance details Defined in Diagrams.Path Methods _Cons :: Prism (Path v n) (Path v' n') (Located (Trail v n), Path v n) (Located (Trail v' n'), Path v' n') #
(Metric v, OrderedField n, Metric u, OrderedField n') => Cons (SegTree v n) (SegTree u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Cons :: Prism (SegTree v n) (SegTree u n') (Segment Closed v n, SegTree v n) (Segment Closed u n', SegTree u n') #
(Metric v, OrderedField n, Metric u, OrderedField n') => Cons (Trail' Line v n) (Trail' Line u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Cons :: Prism (Trail' Line v n) (Trail' Line u n') (Segment Closed v n, Trail' Line v n) (Segment Closed u n', Trail' Line u n') #

class Snoc s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_Snoc :: Prism s t (s, a) (t, b) #

Instances

Snoc ByteString ByteString Word8 Word8
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism ByteString ByteString (ByteString, Word8) (ByteString, Word8) #
Snoc ByteString ByteString Word8 Word8
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism ByteString ByteString (ByteString, Word8) (ByteString, Word8) #
Snoc Text Text Char Char
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism Text Text (Text, Char) (Text, Char) #
Snoc Text Text Char Char
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism Text Text (Text, Char) (Text, Char) #
Snoc [a] [b] a b
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism [a] [b] ([a], a) ([b], b) #
Snoc (ZipList a) (ZipList b) a b
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism (ZipList a) (ZipList b) (ZipList a, a) (ZipList b, b) #
Snoc (Seq a) (Seq b) a b
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism (Seq a) (Seq b) (Seq a, a) (Seq b, b) #
(Unbox a, Unbox b) => Snoc (Vector a) (Vector b) a b
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism (Vector a) (Vector b) (Vector a, a) (Vector b, b) #
Snoc (Vector a) (Vector b) a b
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism (Vector a) (Vector b) (Vector a, a) (Vector b, b) #
(Prim a, Prim b) => Snoc (Vector a) (Vector b) a b
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism (Vector a) (Vector b) (Vector a, a) (Vector b, b) #
(Storable a, Storable b) => Snoc (Vector a) (Vector b) a b
Instance details Defined in Control.Lens.Cons Methods _Snoc :: Prism (Vector a) (Vector b) (Vector a, a) (Vector b, b) #
Snoc (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n'))
Instance details Defined in Diagrams.Path Methods _Snoc :: Prism (Path v n) (Path v' n') (Path v n, Located (Trail v n)) (Path v' n', Located (Trail v' n')) #
(Metric v, OrderedField n, Metric u, OrderedField n') => Snoc (SegTree v n) (SegTree u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Snoc :: Prism (SegTree v n) (SegTree u n') (SegTree v n, Segment Closed v n) (SegTree u n', Segment Closed u n') #
(Metric v, OrderedField n, Metric u, OrderedField n') => Snoc (Trail' Line v n) (Trail' Line u n') (Segment Closed v n) (Segment Closed u n')
Instance details Defined in Diagrams.Trail Methods _Snoc :: Prism (Trail' Line v n) (Trail' Line u n') (Trail' Line v n, Segment Closed v n) (Trail' Line u n', Segment Closed u n') #

class Each s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

each :: Traversal s t a b #

Instances

(a ~ Word8, b ~ Word8) => Each ByteString ByteString a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal ByteString ByteString a b #
(a ~ Word8, b ~ Word8) => Each ByteString ByteString a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal ByteString ByteString a b #
(a ~ Char, b ~ Char) => Each Text Text a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal Text Text a b #
(a ~ Char, b ~ Char) => Each Text Text a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal Text Text a b #
Each Name Name AName AName
Instance details Defined in Diagrams.Core.Names Methods each :: Traversal Name Name AName AName #
Each [a] [b] a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal [a] [b] a b #
Each (Maybe a) (Maybe b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (Maybe a) (Maybe b) a b #
Each (Complex a) (Complex b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (Complex a) (Complex b) a b #
Each (Identity a) (Identity b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (Identity a) (Identity b) a b #
Each (NonEmpty a) (NonEmpty b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (NonEmpty a) (NonEmpty b) a b #
Each (IntMap a) (IntMap b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (IntMap a) (IntMap b) a b #
Each (Tree a) (Tree b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (Tree a) (Tree b) a b #
Each (Seq a) (Seq b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (Seq a) (Seq b) a b #
(Unbox a, Unbox b) => Each (Vector a) (Vector b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (Vector a) (Vector b) a b #
Each (Vector a) (Vector b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (Vector a) (Vector b) a b #
(Prim a, Prim b) => Each (Vector a) (Vector b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (Vector a) (Vector b) a b #
(Storable a, Storable b) => Each (Vector a) (Vector b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (Vector a) (Vector b) a b #
Each (V2 a) (V2 b) a b
Instance details Defined in Linear.V2 Methods each :: Traversal (V2 a) (V2 b) a b #
Each (V3 a) (V3 b) a b
Instance details Defined in Linear.V3 Methods each :: Traversal (V3 a) (V3 b) a b #
Each (V4 a) (V4 b) a b
Instance details Defined in Linear.V4 Methods each :: Traversal (V4 a) (V4 b) a b #
Each (V1 a) (V1 b) a b
Instance details Defined in Linear.V1 Methods each :: Traversal (V1 a) (V1 b) a b #
Each (Plucker a) (Plucker b) a b
Instance details Defined in Linear.Plucker Methods each :: Traversal (Plucker a) (Plucker b) a b #
Each (Quaternion a) (Quaternion b) a b
Instance details Defined in Linear.Quaternion Methods each :: Traversal (Quaternion a) (Quaternion b) a b #
Each (V0 a) (V0 b) a b
Instance details Defined in Linear.V0 Methods each :: Traversal (V0 a) (V0 b) a b #
(a ~ a', b ~ b') => Each (a, a') (b, b') a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (a, a') (b, b') a b #
(Ix i, IArray UArray a, IArray UArray b, i ~ j) => Each (UArray i a) (UArray j b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (UArray i a) (UArray j b) a b #
(Ix i, i ~ j) => Each (Array i a) (Array j b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (Array i a) (Array j b) a b #
c ~ d => Each (Map c a) (Map d b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (Map c a) (Map d b) a b #
c ~ d => Each (HashMap c a) (HashMap d b) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (HashMap c a) (HashMap d b) a b #
Traversable f => Each (Point f a) (Point f b) a b
Instance details Defined in Linear.Affine Methods each :: Traversal (Point f a) (Point f b) a b #
Each (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n'))
Instance details Defined in Diagrams.Path Methods each :: Traversal (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n')) #
Each (Style v n) (Style v' n') (Attribute v n) (Attribute v' n')
Instance details Defined in Diagrams.Core.Style Methods each :: Traversal (Style v n) (Style v' n') (Attribute v n) (Attribute v' n') #
(Additive v', Foldable v', Ord n') => Each (BoundingBox v n) (BoundingBox v' n') (Point v n) (Point v' n')
Instance details Defined in Diagrams.BoundingBox Methods each :: Traversal (BoundingBox v n) (BoundingBox v' n') (Point v n) (Point v' n') #
Each (FixedSegment v n) (FixedSegment v' n') (Point v n) (Point v' n')
Instance details Defined in Diagrams.Segment Methods each :: Traversal (FixedSegment v n) (FixedSegment v' n') (Point v n) (Point v' n') #
(a ~ a2, a ~ a3, b ~ b2, b ~ b3) => Each (a, a2, a3) (b, b2, b3) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (a, a2, a3) (b, b2, b3) a b #
Each (V n a) (V n b) a b
Instance details Defined in Linear.V Methods each :: Traversal (V n a) (V n b) a b #
Each (Offset c v n) (Offset c v' n') (v n) (v' n')
Instance details Defined in Diagrams.Segment Methods each :: Traversal (Offset c v n) (Offset c v' n') (v n) (v' n') #
Each (Segment c v n) (Segment c v' n') (v n) (v' n')
Instance details Defined in Diagrams.Segment Methods each :: Traversal (Segment c v n) (Segment c v' n') (v n) (v' n') #
(a ~ a2, a ~ a3, a ~ a4, b ~ b2, b ~ b3, b ~ b4) => Each (a, a2, a3, a4) (b, b2, b3, b4) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (a, a2, a3, a4) (b, b2, b3, b4) a b #
(a ~ a2, a ~ a3, a ~ a4, a ~ a5, b ~ b2, b ~ b3, b ~ b4, b ~ b5) => Each (a, a2, a3, a4, a5) (b, b2, b3, b4, b5) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (a, a2, a3, a4, a5) (b, b2, b3, b4, b5) a b #
(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6) => Each (a, a2, a3, a4, a5, a6) (b, b2, b3, b4, b5, b6) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (a, a2, a3, a4, a5, a6) (b, b2, b3, b4, b5, b6) a b #
(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6, b ~ b7) => Each (a, a2, a3, a4, a5, a6, a7) (b, b2, b3, b4, b5, b6, b7) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (a, a2, a3, a4, a5, a6, a7) (b, b2, b3, b4, b5, b6, b7) a b #
(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, a ~ a8, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6, b ~ b7, b ~ b8) => Each (a, a2, a3, a4, a5, a6, a7, a8) (b, b2, b3, b4, b5, b6, b7, b8) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (a, a2, a3, a4, a5, a6, a7, a8) (b, b2, b3, b4, b5, b6, b7, b8) a b #
(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, a ~ a8, a ~ a9, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6, b ~ b7, b ~ b8, b ~ b9) => Each (a, a2, a3, a4, a5, a6, a7, a8, a9) (b, b2, b3, b4, b5, b6, b7, b8, b9) a b
Instance details Defined in Control.Lens.Each Methods each :: Traversal (a, a2, a3, a4, a5, a6, a7, a8, a9) (b, b2, b3, b4, b5, b6, b7, b8, b9) a b #

class AsEmpty a where #

Minimal complete definition

Nothing

Methods

_Empty :: Prism' a () #

Instances

AsEmpty Ordering
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' Ordering () #
AsEmpty ()
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' () () #
AsEmpty Event
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' Event () #
AsEmpty All
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' All () #
AsEmpty Any
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' Any () #
AsEmpty ByteString
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' ByteString () #
AsEmpty ByteString
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' ByteString () #
AsEmpty IntSet
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' IntSet () #
AsEmpty Text
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' Text () #
AsEmpty Text
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' Text () #
AsEmpty [a]
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' [a] () #
AsEmpty (Maybe a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (Maybe a) () #
AsEmpty (ZipList a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (ZipList a) () #
AsEmpty (First a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (First a) () #
AsEmpty (Last a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (Last a) () #
AsEmpty a => AsEmpty (Dual a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (Dual a) () #
(Eq a, Num a) => AsEmpty (Sum a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (Sum a) () #
(Eq a, Num a) => AsEmpty (Product a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (Product a) () #
AsEmpty (IntMap a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (IntMap a) () #
AsEmpty (Seq a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (Seq a) () #
AsEmpty (Set a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (Set a) () #
AsEmpty (HashSet a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (HashSet a) () #
Unbox a => AsEmpty (Vector a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (Vector a) () #
AsEmpty (Vector a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (Vector a) () #
Storable a => AsEmpty (Vector a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (Vector a) () #
AsEmpty (Clip n)
Instance details Defined in Diagrams.TwoD.Path Methods _Empty :: Prism' (Clip n) () #
(AsEmpty a, AsEmpty b) => AsEmpty (a, b)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (a, b) () #
AsEmpty (Map k a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (Map k a) () #
AsEmpty (HashMap k a)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (HashMap k a) () #
AsEmpty (BoundingBox v n)
Instance details Defined in Diagrams.BoundingBox Methods _Empty :: Prism' (BoundingBox v n) () #
AsEmpty (Path v n)
Instance details Defined in Diagrams.Path Methods _Empty :: Prism' (Path v n) () #
(Metric v, OrderedField n) => AsEmpty (Trail v n)
Instance details Defined in Diagrams.Trail Methods _Empty :: Prism' (Trail v n) () #
(AsEmpty a, AsEmpty b, AsEmpty c) => AsEmpty (a, b, c)
Instance details Defined in Control.Lens.Empty Methods _Empty :: Prism' (a, b, c) () #
(Metric v, OrderedField n) => AsEmpty (Trail' Line v n)
Instance details Defined in Diagrams.Trail Methods _Empty :: Prism' (Trail' Line v n) () #

type AnEquality (s :: k1) (t :: k2) (a :: k1) (b :: k2) = Identical a (Proxy b) a (Proxy b) -> Identical a (Proxy b) s (Proxy t) #

type AnEquality' (s :: k2) (a :: k2) = AnEquality s s a a #

data Identical (a :: k) (b :: k1) (s :: k) (t :: k1) :: forall k k1. k -> k1 -> k -> k1 -> Type where #

Constructors

Identical :: forall k k1 (a :: k) (b :: k1) (s :: k) (t :: k1). Identical a b a b

type Accessing (p :: Type -> Type -> Type) m s a = p a (Const m a) -> s -> Const m s #

type Getting r s a = (a -> Const r a) -> s -> Const r s #

type IndexedGetting i m s a = Indexed i a (Const m a) -> s -> Const m s #

class Foldable f => FoldableWithIndex i (f :: Type -> Type) | f -> i where #

Minimal complete definition

Nothing

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> f a -> m #

ifolded :: IndexedFold i (f a) a #

ifoldr :: (i -> a -> b -> b) -> b -> f a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> f a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> f a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> f a -> b #

Instances

FoldableWithIndex Int []
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Int -> a -> m) -> [a] -> m # ifolded :: IndexedFold Int [a] a # ifoldr :: (Int -> a -> b -> b) -> b -> [a] -> b # ifoldl :: (Int -> b -> a -> b) -> b -> [a] -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> [a] -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> [a] -> b #
FoldableWithIndex Int ZipList
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Int -> a -> m) -> ZipList a -> m # ifolded :: IndexedFold Int (ZipList a) a # ifoldr :: (Int -> a -> b -> b) -> b -> ZipList a -> b # ifoldl :: (Int -> b -> a -> b) -> b -> ZipList a -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> ZipList a -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> ZipList a -> b #
FoldableWithIndex Int NonEmpty
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Int -> a -> m) -> NonEmpty a -> m # ifolded :: IndexedFold Int (NonEmpty a) a # ifoldr :: (Int -> a -> b -> b) -> b -> NonEmpty a -> b # ifoldl :: (Int -> b -> a -> b) -> b -> NonEmpty a -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> NonEmpty a -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> NonEmpty a -> b #
FoldableWithIndex Int IntMap
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Int -> a -> m) -> IntMap a -> m # ifolded :: IndexedFold Int (IntMap a) a # ifoldr :: (Int -> a -> b -> b) -> b -> IntMap a -> b # ifoldl :: (Int -> b -> a -> b) -> b -> IntMap a -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> IntMap a -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> IntMap a -> b #
FoldableWithIndex Int Seq
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Int -> a -> m) -> Seq a -> m # ifolded :: IndexedFold Int (Seq a) a # ifoldr :: (Int -> a -> b -> b) -> b -> Seq a -> b # ifoldl :: (Int -> b -> a -> b) -> b -> Seq a -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> Seq a -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> Seq a -> b #
FoldableWithIndex Int Vector
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Int -> a -> m) -> Vector a -> m # ifolded :: IndexedFold Int (Vector a) a # ifoldr :: (Int -> a -> b -> b) -> b -> Vector a -> b # ifoldl :: (Int -> b -> a -> b) -> b -> Vector a -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> Vector a -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> Vector a -> b #
FoldableWithIndex () Maybe
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (() -> a -> m) -> Maybe a -> m # ifolded :: IndexedFold () (Maybe a) a # ifoldr :: (() -> a -> b -> b) -> b -> Maybe a -> b # ifoldl :: (() -> b -> a -> b) -> b -> Maybe a -> b # ifoldr' :: (() -> a -> b -> b) -> b -> Maybe a -> b # ifoldl' :: (() -> b -> a -> b) -> b -> Maybe a -> b #
FoldableWithIndex () Par1
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (() -> a -> m) -> Par1 a -> m # ifolded :: IndexedFold () (Par1 a) a # ifoldr :: (() -> a -> b -> b) -> b -> Par1 a -> b # ifoldl :: (() -> b -> a -> b) -> b -> Par1 a -> b # ifoldr' :: (() -> a -> b -> b) -> b -> Par1 a -> b # ifoldl' :: (() -> b -> a -> b) -> b -> Par1 a -> b #
FoldableWithIndex () Identity
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (() -> a -> m) -> Identity a -> m # ifolded :: IndexedFold () (Identity a) a # ifoldr :: (() -> a -> b -> b) -> b -> Identity a -> b # ifoldl :: (() -> b -> a -> b) -> b -> Identity a -> b # ifoldr' :: (() -> a -> b -> b) -> b -> Identity a -> b # ifoldl' :: (() -> b -> a -> b) -> b -> Identity a -> b #
FoldableWithIndex k (Map k)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (k -> a -> m) -> Map k a -> m # ifolded :: IndexedFold k (Map k a) a # ifoldr :: (k -> a -> b -> b) -> b -> Map k a -> b # ifoldl :: (k -> b -> a -> b) -> b -> Map k a -> b # ifoldr' :: (k -> a -> b -> b) -> b -> Map k a -> b # ifoldl' :: (k -> b -> a -> b) -> b -> Map k a -> b #
FoldableWithIndex k (HashMap k)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (k -> a -> m) -> HashMap k a -> m # ifolded :: IndexedFold k (HashMap k a) a # ifoldr :: (k -> a -> b -> b) -> b -> HashMap k a -> b # ifoldl :: (k -> b -> a -> b) -> b -> HashMap k a -> b # ifoldr' :: (k -> a -> b -> b) -> b -> HashMap k a -> b # ifoldl' :: (k -> b -> a -> b) -> b -> HashMap k a -> b #
FoldableWithIndex k ((,) k)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (k -> a -> m) -> (k, a) -> m # ifolded :: IndexedFold k (k, a) a # ifoldr :: (k -> a -> b -> b) -> b -> (k, a) -> b # ifoldl :: (k -> b -> a -> b) -> b -> (k, a) -> b # ifoldr' :: (k -> a -> b -> b) -> b -> (k, a) -> b # ifoldl' :: (k -> b -> a -> b) -> b -> (k, a) -> b #
FoldableWithIndex i (Level i)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (i -> a -> m) -> Level i a -> m # ifolded :: IndexedFold i (Level i a) a # ifoldr :: (i -> a -> b -> b) -> b -> Level i a -> b # ifoldl :: (i -> b -> a -> b) -> b -> Level i a -> b # ifoldr' :: (i -> a -> b -> b) -> b -> Level i a -> b # ifoldl' :: (i -> b -> a -> b) -> b -> Level i a -> b #
Ix i => FoldableWithIndex i (Array i)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (i -> a -> m) -> Array i a -> m # ifolded :: IndexedFold i (Array i a) a # ifoldr :: (i -> a -> b -> b) -> b -> Array i a -> b # ifoldl :: (i -> b -> a -> b) -> b -> Array i a -> b # ifoldr' :: (i -> a -> b -> b) -> b -> Array i a -> b # ifoldl' :: (i -> b -> a -> b) -> b -> Array i a -> b #
FoldableWithIndex Void (V1 :: Type -> Type)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Void -> a -> m) -> V1 a -> m # ifolded :: IndexedFold Void (V1 a) a # ifoldr :: (Void -> a -> b -> b) -> b -> V1 a -> b # ifoldl :: (Void -> b -> a -> b) -> b -> V1 a -> b # ifoldr' :: (Void -> a -> b -> b) -> b -> V1 a -> b # ifoldl' :: (Void -> b -> a -> b) -> b -> V1 a -> b #
FoldableWithIndex Void (U1 :: Type -> Type)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Void -> a -> m) -> U1 a -> m # ifolded :: IndexedFold Void (U1 a) a # ifoldr :: (Void -> a -> b -> b) -> b -> U1 a -> b # ifoldl :: (Void -> b -> a -> b) -> b -> U1 a -> b # ifoldr' :: (Void -> a -> b -> b) -> b -> U1 a -> b # ifoldl' :: (Void -> b -> a -> b) -> b -> U1 a -> b #
FoldableWithIndex Void (Proxy :: Type -> Type)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Void -> a -> m) -> Proxy a -> m # ifolded :: IndexedFold Void (Proxy a) a # ifoldr :: (Void -> a -> b -> b) -> b -> Proxy a -> b # ifoldl :: (Void -> b -> a -> b) -> b -> Proxy a -> b # ifoldr' :: (Void -> a -> b -> b) -> b -> Proxy a -> b # ifoldl' :: (Void -> b -> a -> b) -> b -> Proxy a -> b #
FoldableWithIndex Int (V n)
Instance details Defined in Linear.V Methods ifoldMap :: Monoid m => (Int -> a -> m) -> V n a -> m # ifolded :: IndexedFold Int (V n a) a # ifoldr :: (Int -> a -> b -> b) -> b -> V n a -> b # ifoldl :: (Int -> b -> a -> b) -> b -> V n a -> b # ifoldr' :: (Int -> a -> b -> b) -> b -> V n a -> b # ifoldl' :: (Int -> b -> a -> b) -> b -> V n a -> b #
FoldableWithIndex () (Tagged a)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (() -> a0 -> m) -> Tagged a a0 -> m # ifolded :: IndexedFold () (Tagged a a0) a0 # ifoldr :: (() -> a0 -> b -> b) -> b -> Tagged a a0 -> b # ifoldl :: (() -> b -> a0 -> b) -> b -> Tagged a a0 -> b # ifoldr' :: (() -> a0 -> b -> b) -> b -> Tagged a a0 -> b # ifoldl' :: (() -> b -> a0 -> b) -> b -> Tagged a a0 -> b #
FoldableWithIndex i f => FoldableWithIndex i (Reverse f)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (i -> a -> m) -> Reverse f a -> m # ifolded :: IndexedFold i (Reverse f a) a # ifoldr :: (i -> a -> b -> b) -> b -> Reverse f a -> b # ifoldl :: (i -> b -> a -> b) -> b -> Reverse f a -> b # ifoldr' :: (i -> a -> b -> b) -> b -> Reverse f a -> b # ifoldl' :: (i -> b -> a -> b) -> b -> Reverse f a -> b #
FoldableWithIndex i f => FoldableWithIndex i (Rec1 f)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (i -> a -> m) -> Rec1 f a -> m # ifolded :: IndexedFold i (Rec1 f a) a # ifoldr :: (i -> a -> b -> b) -> b -> Rec1 f a -> b # ifoldl :: (i -> b -> a -> b) -> b -> Rec1 f a -> b # ifoldr' :: (i -> a -> b -> b) -> b -> Rec1 f a -> b # ifoldl' :: (i -> b -> a -> b) -> b -> Rec1 f a -> b #
FoldableWithIndex i m => FoldableWithIndex i (IdentityT m)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m0 => (i -> a -> m0) -> IdentityT m a -> m0 # ifolded :: IndexedFold i (IdentityT m a) a # ifoldr :: (i -> a -> b -> b) -> b -> IdentityT m a -> b # ifoldl :: (i -> b -> a -> b) -> b -> IdentityT m a -> b # ifoldr' :: (i -> a -> b -> b) -> b -> IdentityT m a -> b # ifoldl' :: (i -> b -> a -> b) -> b -> IdentityT m a -> b #
FoldableWithIndex i f => FoldableWithIndex i (Backwards f)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (i -> a -> m) -> Backwards f a -> m # ifolded :: IndexedFold i (Backwards f a) a # ifoldr :: (i -> a -> b -> b) -> b -> Backwards f a -> b # ifoldl :: (i -> b -> a -> b) -> b -> Backwards f a -> b # ifoldr' :: (i -> a -> b -> b) -> b -> Backwards f a -> b # ifoldl' :: (i -> b -> a -> b) -> b -> Backwards f a -> b #
FoldableWithIndex i (Magma i t b)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (i -> a -> m) -> Magma i t b a -> m # ifolded :: IndexedFold i (Magma i t b a) a # ifoldr :: (i -> a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 # ifoldl :: (i -> b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 # ifoldr' :: (i -> a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 # ifoldl' :: (i -> b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #
FoldableWithIndex Void (K1 i c :: Type -> Type)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Void -> a -> m) -> K1 i c a -> m # ifolded :: IndexedFold Void (K1 i c a) a # ifoldr :: (Void -> a -> b -> b) -> b -> K1 i c a -> b # ifoldl :: (Void -> b -> a -> b) -> b -> K1 i c a -> b # ifoldr' :: (Void -> a -> b -> b) -> b -> K1 i c a -> b # ifoldl' :: (Void -> b -> a -> b) -> b -> K1 i c a -> b #
FoldableWithIndex [Int] Tree
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => ([Int] -> a -> m) -> Tree a -> m # ifolded :: IndexedFold [Int] (Tree a) a # ifoldr :: ([Int] -> a -> b -> b) -> b -> Tree a -> b # ifoldl :: ([Int] -> b -> a -> b) -> b -> Tree a -> b # ifoldr' :: ([Int] -> a -> b -> b) -> b -> Tree a -> b # ifoldl' :: ([Int] -> b -> a -> b) -> b -> Tree a -> b #
FoldableWithIndex (E V2) V2
Instance details Defined in Linear.V2 Methods ifoldMap :: Monoid m => (E V2 -> a -> m) -> V2 a -> m # ifolded :: IndexedFold (E V2) (V2 a) a # ifoldr :: (E V2 -> a -> b -> b) -> b -> V2 a -> b # ifoldl :: (E V2 -> b -> a -> b) -> b -> V2 a -> b # ifoldr' :: (E V2 -> a -> b -> b) -> b -> V2 a -> b # ifoldl' :: (E V2 -> b -> a -> b) -> b -> V2 a -> b #
FoldableWithIndex (E V3) V3
Instance details Defined in Linear.V3 Methods ifoldMap :: Monoid m => (E V3 -> a -> m) -> V3 a -> m # ifolded :: IndexedFold (E V3) (V3 a) a # ifoldr :: (E V3 -> a -> b -> b) -> b -> V3 a -> b # ifoldl :: (E V3 -> b -> a -> b) -> b -> V3 a -> b # ifoldr' :: (E V3 -> a -> b -> b) -> b -> V3 a -> b # ifoldl' :: (E V3 -> b -> a -> b) -> b -> V3 a -> b #
FoldableWithIndex (E V4) V4
Instance details Defined in Linear.V4 Methods ifoldMap :: Monoid m => (E V4 -> a -> m) -> V4 a -> m # ifolded :: IndexedFold (E V4) (V4 a) a # ifoldr :: (E V4 -> a -> b -> b) -> b -> V4 a -> b # ifoldl :: (E V4 -> b -> a -> b) -> b -> V4 a -> b # ifoldr' :: (E V4 -> a -> b -> b) -> b -> V4 a -> b # ifoldl' :: (E V4 -> b -> a -> b) -> b -> V4 a -> b #
FoldableWithIndex (E V1) V1
Instance details Defined in Linear.V1 Methods ifoldMap :: Monoid m => (E V1 -> a -> m) -> V1 a -> m # ifolded :: IndexedFold (E V1) (V1 a) a # ifoldr :: (E V1 -> a -> b -> b) -> b -> V1 a -> b # ifoldl :: (E V1 -> b -> a -> b) -> b -> V1 a -> b # ifoldr' :: (E V1 -> a -> b -> b) -> b -> V1 a -> b # ifoldl' :: (E V1 -> b -> a -> b) -> b -> V1 a -> b #
FoldableWithIndex (E Plucker) Plucker
Instance details Defined in Linear.Plucker Methods ifoldMap :: Monoid m => (E Plucker -> a -> m) -> Plucker a -> m # ifolded :: IndexedFold (E Plucker) (Plucker a) a # ifoldr :: (E Plucker -> a -> b -> b) -> b -> Plucker a -> b # ifoldl :: (E Plucker -> b -> a -> b) -> b -> Plucker a -> b # ifoldr' :: (E Plucker -> a -> b -> b) -> b -> Plucker a -> b # ifoldl' :: (E Plucker -> b -> a -> b) -> b -> Plucker a -> b #
FoldableWithIndex (E Quaternion) Quaternion
Instance details Defined in Linear.Quaternion Methods ifoldMap :: Monoid m => (E Quaternion -> a -> m) -> Quaternion a -> m # ifolded :: IndexedFold (E Quaternion) (Quaternion a) a # ifoldr :: (E Quaternion -> a -> b -> b) -> b -> Quaternion a -> b # ifoldl :: (E Quaternion -> b -> a -> b) -> b -> Quaternion a -> b # ifoldr' :: (E Quaternion -> a -> b -> b) -> b -> Quaternion a -> b # ifoldl' :: (E Quaternion -> b -> a -> b) -> b -> Quaternion a -> b #
FoldableWithIndex (E V0) V0
Instance details Defined in Linear.V0 Methods ifoldMap :: Monoid m => (E V0 -> a -> m) -> V0 a -> m # ifolded :: IndexedFold (E V0) (V0 a) a # ifoldr :: (E V0 -> a -> b -> b) -> b -> V0 a -> b # ifoldl :: (E V0 -> b -> a -> b) -> b -> V0 a -> b # ifoldr' :: (E V0 -> a -> b -> b) -> b -> V0 a -> b # ifoldl' :: (E V0 -> b -> a -> b) -> b -> V0 a -> b #
FoldableWithIndex i f => FoldableWithIndex [i] (Free f)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => ([i] -> a -> m) -> Free f a -> m # ifolded :: IndexedFold [i] (Free f a) a # ifoldr :: ([i] -> a -> b -> b) -> b -> Free f a -> b # ifoldl :: ([i] -> b -> a -> b) -> b -> Free f a -> b # ifoldr' :: ([i] -> a -> b -> b) -> b -> Free f a -> b # ifoldl' :: ([i] -> b -> a -> b) -> b -> Free f a -> b #
FoldableWithIndex i f => FoldableWithIndex [i] (Cofree f)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => ([i] -> a -> m) -> Cofree f a -> m # ifolded :: IndexedFold [i] (Cofree f a) a # ifoldr :: ([i] -> a -> b -> b) -> b -> Cofree f a -> b # ifoldl :: ([i] -> b -> a -> b) -> b -> Cofree f a -> b # ifoldr' :: ([i] -> a -> b -> b) -> b -> Cofree f a -> b # ifoldl' :: ([i] -> b -> a -> b) -> b -> Cofree f a -> b #
(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Sum f g)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> Sum f g a -> m # ifolded :: IndexedFold (Either i j) (Sum f g a) a # ifoldr :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b # ifoldl :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b # ifoldr' :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b # ifoldl' :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b #
(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Product f g)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> Product f g a -> m # ifolded :: IndexedFold (Either i j) (Product f g a) a # ifoldr :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b # ifoldl :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b # ifoldr' :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b # ifoldl' :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b #
(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :+: g)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :+: g) a -> m # ifolded :: IndexedFold (Either i j) ((f :+: g) a) a # ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b # ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b # ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b # ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b #
(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :*: g)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :: g) a -> m # ifolded :: IndexedFold (Either i j) ((f :: g) a) a # ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :: g) a -> b # ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :: g) a -> b # ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :: g) a -> b # ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :: g) a -> b #
(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (i, j) (Compose f g)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => ((i, j) -> a -> m) -> Compose f g a -> m # ifolded :: IndexedFold (i, j) (Compose f g a) a # ifoldr :: ((i, j) -> a -> b -> b) -> b -> Compose f g a -> b # ifoldl :: ((i, j) -> b -> a -> b) -> b -> Compose f g a -> b # ifoldr' :: ((i, j) -> a -> b -> b) -> b -> Compose f g a -> b # ifoldl' :: ((i, j) -> b -> a -> b) -> b -> Compose f g a -> b #
(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (i, j) (f :.: g)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => ((i, j) -> a -> m) -> (f :.: g) a -> m # ifolded :: IndexedFold (i, j) ((f :.: g) a) a # ifoldr :: ((i, j) -> a -> b -> b) -> b -> (f :.: g) a -> b # ifoldl :: ((i, j) -> b -> a -> b) -> b -> (f :.: g) a -> b # ifoldr' :: ((i, j) -> a -> b -> b) -> b -> (f :.: g) a -> b # ifoldl' :: ((i, j) -> b -> a -> b) -> b -> (f :.: g) a -> b #

class Functor f => FunctorWithIndex i (f :: Type -> Type) | f -> i where #

Minimal complete definition

Nothing

Methods

imap :: (i -> a -> b) -> f a -> f b #

imapped :: IndexedSetter i (f a) (f b) a b #

Instances

FunctorWithIndex Int []
Instance details Defined in Control.Lens.Indexed Methods imap :: (Int -> a -> b) -> [a] -> [b] # imapped :: IndexedSetter Int [a] [b] a b #
FunctorWithIndex Int ZipList
Instance details Defined in Control.Lens.Indexed Methods imap :: (Int -> a -> b) -> ZipList a -> ZipList b # imapped :: IndexedSetter Int (ZipList a) (ZipList b) a b #
FunctorWithIndex Int NonEmpty
Instance details Defined in Control.Lens.Indexed Methods imap :: (Int -> a -> b) -> NonEmpty a -> NonEmpty b # imapped :: IndexedSetter Int (NonEmpty a) (NonEmpty b) a b #
FunctorWithIndex Int IntMap
Instance details Defined in Control.Lens.Indexed Methods imap :: (Int -> a -> b) -> IntMap a -> IntMap b # imapped :: IndexedSetter Int (IntMap a) (IntMap b) a b #
FunctorWithIndex Int Seq
Instance details Defined in Control.Lens.Indexed Methods imap :: (Int -> a -> b) -> Seq a -> Seq b # imapped :: IndexedSetter Int (Seq a) (Seq b) a b #
FunctorWithIndex Int Vector
Instance details Defined in Control.Lens.Indexed Methods imap :: (Int -> a -> b) -> Vector a -> Vector b # imapped :: IndexedSetter Int (Vector a) (Vector b) a b #
FunctorWithIndex () Maybe
Instance details Defined in Control.Lens.Indexed Methods imap :: (() -> a -> b) -> Maybe a -> Maybe b # imapped :: IndexedSetter () (Maybe a) (Maybe b) a b #
FunctorWithIndex () Par1
Instance details Defined in Control.Lens.Indexed Methods imap :: (() -> a -> b) -> Par1 a -> Par1 b # imapped :: IndexedSetter () (Par1 a) (Par1 b) a b #
FunctorWithIndex () Identity
Instance details Defined in Control.Lens.Indexed Methods imap :: (() -> a -> b) -> Identity a -> Identity b # imapped :: IndexedSetter () (Identity a) (Identity b) a b #
FunctorWithIndex k (Map k)
Instance details Defined in Control.Lens.Indexed Methods imap :: (k -> a -> b) -> Map k a -> Map k b # imapped :: IndexedSetter k (Map k a) (Map k b) a b #
FunctorWithIndex k (HashMap k)
Instance details Defined in Control.Lens.Indexed Methods imap :: (k -> a -> b) -> HashMap k a -> HashMap k b # imapped :: IndexedSetter k (HashMap k a) (HashMap k b) a b #
FunctorWithIndex k ((,) k)
Instance details Defined in Control.Lens.Indexed Methods imap :: (k -> a -> b) -> (k, a) -> (k, b) # imapped :: IndexedSetter k (k, a) (k, b) a b #
FunctorWithIndex i (Level i)
Instance details Defined in Control.Lens.Indexed Methods imap :: (i -> a -> b) -> Level i a -> Level i b # imapped :: IndexedSetter i (Level i a) (Level i b) a b #
Ix i => FunctorWithIndex i (Array i)
Instance details Defined in Control.Lens.Indexed Methods imap :: (i -> a -> b) -> Array i a -> Array i b # imapped :: IndexedSetter i (Array i a) (Array i b) a b #
FunctorWithIndex Void (V1 :: Type -> Type)
Instance details Defined in Control.Lens.Indexed Methods imap :: (Void -> a -> b) -> V1 a -> V1 b # imapped :: IndexedSetter Void (V1 a) (V1 b) a b #
FunctorWithIndex Void (U1 :: Type -> Type)
Instance details Defined in Control.Lens.Indexed Methods imap :: (Void -> a -> b) -> U1 a -> U1 b # imapped :: IndexedSetter Void (U1 a) (U1 b) a b #
FunctorWithIndex Void (Proxy :: Type -> Type)
Instance details Defined in Control.Lens.Indexed Methods imap :: (Void -> a -> b) -> Proxy a -> Proxy b # imapped :: IndexedSetter Void (Proxy a) (Proxy b) a b #
FunctorWithIndex Int (V n)
Instance details Defined in Linear.V Methods imap :: (Int -> a -> b) -> V n a -> V n b # imapped :: IndexedSetter Int (V n a) (V n b) a b #
FunctorWithIndex () (Tagged a)
Instance details Defined in Control.Lens.Indexed Methods imap :: (() -> a0 -> b) -> Tagged a a0 -> Tagged a b # imapped :: IndexedSetter () (Tagged a a0) (Tagged a b) a0 b #
FunctorWithIndex i f => FunctorWithIndex i (Reverse f)
Instance details Defined in Control.Lens.Indexed Methods imap :: (i -> a -> b) -> Reverse f a -> Reverse f b # imapped :: IndexedSetter i (Reverse f a) (Reverse f b) a b #
FunctorWithIndex i f => FunctorWithIndex i (Rec1 f)
Instance details Defined in Control.Lens.Indexed Methods imap :: (i -> a -> b) -> Rec1 f a -> Rec1 f b # imapped :: IndexedSetter i (Rec1 f a) (Rec1 f b) a b #
FunctorWithIndex i m => FunctorWithIndex i (IdentityT m)
Instance details Defined in Control.Lens.Indexed Methods imap :: (i -> a -> b) -> IdentityT m a -> IdentityT m b # imapped :: IndexedSetter i (IdentityT m a) (IdentityT m b) a b #
FunctorWithIndex i f => FunctorWithIndex i (Backwards f)
Instance details Defined in Control.Lens.Indexed Methods imap :: (i -> a -> b) -> Backwards f a -> Backwards f b # imapped :: IndexedSetter i (Backwards f a) (Backwards f b) a b #
FunctorWithIndex r ((->) r :: Type -> Type)
Instance details Defined in Control.Lens.Indexed Methods imap :: (r -> a -> b) -> (r -> a) -> r -> b # imapped :: IndexedSetter r (r -> a) (r -> b) a b #
FunctorWithIndex i (Magma i t b)
Instance details Defined in Control.Lens.Indexed Methods imap :: (i -> a -> b0) -> Magma i t b a -> Magma i t b b0 # imapped :: IndexedSetter i (Magma i t b a) (Magma i t b b0) a b0 #
FunctorWithIndex Void (K1 i c :: Type -> Type)
Instance details Defined in Control.Lens.Indexed Methods imap :: (Void -> a -> b) -> K1 i c a -> K1 i c b # imapped :: IndexedSetter Void (K1 i c a) (K1 i c b) a b #
FunctorWithIndex [Int] Tree
Instance details Defined in Control.Lens.Indexed Methods imap :: ([Int] -> a -> b) -> Tree a -> Tree b # imapped :: IndexedSetter [Int] (Tree a) (Tree b) a b #
FunctorWithIndex (E V2) V2
Instance details Defined in Linear.V2 Methods imap :: (E V2 -> a -> b) -> V2 a -> V2 b # imapped :: IndexedSetter (E V2) (V2 a) (V2 b) a b #
FunctorWithIndex (E V3) V3
Instance details Defined in Linear.V3 Methods imap :: (E V3 -> a -> b) -> V3 a -> V3 b # imapped :: IndexedSetter (E V3) (V3 a) (V3 b) a b #
FunctorWithIndex (E V4) V4
Instance details Defined in Linear.V4 Methods imap :: (E V4 -> a -> b) -> V4 a -> V4 b # imapped :: IndexedSetter (E V4) (V4 a) (V4 b) a b #
FunctorWithIndex (E V1) V1
Instance details Defined in Linear.V1 Methods imap :: (E V1 -> a -> b) -> V1 a -> V1 b # imapped :: IndexedSetter (E V1) (V1 a) (V1 b) a b #
FunctorWithIndex (E Plucker) Plucker
Instance details Defined in Linear.Plucker Methods imap :: (E Plucker -> a -> b) -> Plucker a -> Plucker b # imapped :: IndexedSetter (E Plucker) (Plucker a) (Plucker b) a b #
FunctorWithIndex (E Quaternion) Quaternion
Instance details Defined in Linear.Quaternion Methods imap :: (E Quaternion -> a -> b) -> Quaternion a -> Quaternion b # imapped :: IndexedSetter (E Quaternion) (Quaternion a) (Quaternion b) a b #
FunctorWithIndex (E V0) V0
Instance details Defined in Linear.V0 Methods imap :: (E V0 -> a -> b) -> V0 a -> V0 b # imapped :: IndexedSetter (E V0) (V0 a) (V0 b) a b #
FunctorWithIndex i f => FunctorWithIndex [i] (Free f)
Instance details Defined in Control.Lens.Indexed Methods imap :: ([i] -> a -> b) -> Free f a -> Free f b # imapped :: IndexedSetter [i] (Free f a) (Free f b) a b #
FunctorWithIndex i f => FunctorWithIndex [i] (Cofree f)
Instance details Defined in Control.Lens.Indexed Methods imap :: ([i] -> a -> b) -> Cofree f a -> Cofree f b # imapped :: IndexedSetter [i] (Cofree f a) (Cofree f b) a b #
FunctorWithIndex i w => FunctorWithIndex (s, i) (TracedT s w)
Instance details Defined in Control.Lens.Indexed Methods imap :: ((s, i) -> a -> b) -> TracedT s w a -> TracedT s w b # imapped :: IndexedSetter (s, i) (TracedT s w a) (TracedT s w b) a b #
FunctorWithIndex i m => FunctorWithIndex (e, i) (ReaderT e m)
Instance details Defined in Control.Lens.Indexed Methods imap :: ((e, i) -> a -> b) -> ReaderT e m a -> ReaderT e m b # imapped :: IndexedSetter (e, i) (ReaderT e m a) (ReaderT e m b) a b #
(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Sum f g)
Instance details Defined in Control.Lens.Indexed Methods imap :: (Either i j -> a -> b) -> Sum f g a -> Sum f g b # imapped :: IndexedSetter (Either i j) (Sum f g a) (Sum f g b) a b #
(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Product f g)
Instance details Defined in Control.Lens.Indexed Methods imap :: (Either i j -> a -> b) -> Product f g a -> Product f g b # imapped :: IndexedSetter (Either i j) (Product f g a) (Product f g b) a b #
(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :+: g)
Instance details Defined in Control.Lens.Indexed Methods imap :: (Either i j -> a -> b) -> (f :+: g) a -> (f :+: g) b # imapped :: IndexedSetter (Either i j) ((f :+: g) a) ((f :+: g) b) a b #
(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :*: g)
Instance details Defined in Control.Lens.Indexed Methods imap :: (Either i j -> a -> b) -> (f :: g) a -> (f :: g) b # imapped :: IndexedSetter (Either i j) ((f :: g) a) ((f :: g) b) a b #
(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (i, j) (Compose f g)
Instance details Defined in Control.Lens.Indexed Methods imap :: ((i, j) -> a -> b) -> Compose f g a -> Compose f g b # imapped :: IndexedSetter (i, j) (Compose f g a) (Compose f g b) a b #
(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (i, j) (f :.: g)
Instance details Defined in Control.Lens.Indexed Methods imap :: ((i, j) -> a -> b) -> (f :.: g) a -> (f :.: g) b # imapped :: IndexedSetter (i, j) ((f :.: g) a) ((f :.: g) b) a b #

class (FunctorWithIndex i t, FoldableWithIndex i t, Traversable t) => TraversableWithIndex i (t :: Type -> Type) | t -> i where #

Minimal complete definition

Nothing

Methods

itraverse :: Applicative f => (i -> a -> f b) -> t a -> f (t b) #

itraversed :: IndexedTraversal i (t a) (t b) a b #

Instances

TraversableWithIndex Int []
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Int -> a -> f b) -> [a] -> f [b] # itraversed :: IndexedTraversal Int [a] [b] a b #
TraversableWithIndex Int ZipList
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Int -> a -> f b) -> ZipList a -> f (ZipList b) # itraversed :: IndexedTraversal Int (ZipList a) (ZipList b) a b #
TraversableWithIndex Int NonEmpty
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Int -> a -> f b) -> NonEmpty a -> f (NonEmpty b) # itraversed :: IndexedTraversal Int (NonEmpty a) (NonEmpty b) a b #
TraversableWithIndex Int IntMap
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Int -> a -> f b) -> IntMap a -> f (IntMap b) # itraversed :: IndexedTraversal Int (IntMap a) (IntMap b) a b #
TraversableWithIndex Int Seq
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Int -> a -> f b) -> Seq a -> f (Seq b) # itraversed :: IndexedTraversal Int (Seq a) (Seq b) a b #
TraversableWithIndex Int Vector
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Int -> a -> f b) -> Vector a -> f (Vector b) # itraversed :: IndexedTraversal Int (Vector a) (Vector b) a b #
TraversableWithIndex () Maybe
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (() -> a -> f b) -> Maybe a -> f (Maybe b) # itraversed :: IndexedTraversal () (Maybe a) (Maybe b) a b #
TraversableWithIndex () Par1
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (() -> a -> f b) -> Par1 a -> f (Par1 b) # itraversed :: IndexedTraversal () (Par1 a) (Par1 b) a b #
TraversableWithIndex () Identity
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (() -> a -> f b) -> Identity a -> f (Identity b) # itraversed :: IndexedTraversal () (Identity a) (Identity b) a b #
TraversableWithIndex k (Map k)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (k -> a -> f b) -> Map k a -> f (Map k b) # itraversed :: IndexedTraversal k (Map k a) (Map k b) a b #
TraversableWithIndex k (HashMap k)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (k -> a -> f b) -> HashMap k a -> f (HashMap k b) # itraversed :: IndexedTraversal k (HashMap k a) (HashMap k b) a b #
TraversableWithIndex k ((,) k)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (k -> a -> f b) -> (k, a) -> f (k, b) # itraversed :: IndexedTraversal k (k, a) (k, b) a b #
TraversableWithIndex i (Level i)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (i -> a -> f b) -> Level i a -> f (Level i b) # itraversed :: IndexedTraversal i (Level i a) (Level i b) a b #
Ix i => TraversableWithIndex i (Array i)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (i -> a -> f b) -> Array i a -> f (Array i b) # itraversed :: IndexedTraversal i (Array i a) (Array i b) a b #
TraversableWithIndex Void (V1 :: Type -> Type)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Void -> a -> f b) -> V1 a -> f (V1 b) # itraversed :: IndexedTraversal Void (V1 a) (V1 b) a b #
TraversableWithIndex Void (U1 :: Type -> Type)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Void -> a -> f b) -> U1 a -> f (U1 b) # itraversed :: IndexedTraversal Void (U1 a) (U1 b) a b #
TraversableWithIndex Void (Proxy :: Type -> Type)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Void -> a -> f b) -> Proxy a -> f (Proxy b) # itraversed :: IndexedTraversal Void (Proxy a) (Proxy b) a b #
TraversableWithIndex Int (V n)
Instance details Defined in Linear.V Methods itraverse :: Applicative f => (Int -> a -> f b) -> V n a -> f (V n b) # itraversed :: IndexedTraversal Int (V n a) (V n b) a b #
TraversableWithIndex () (Tagged a)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (() -> a0 -> f b) -> Tagged a a0 -> f (Tagged a b) # itraversed :: IndexedTraversal () (Tagged a a0) (Tagged a b) a0 b #
TraversableWithIndex i f => TraversableWithIndex i (Reverse f)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => (i -> a -> f0 b) -> Reverse f a -> f0 (Reverse f b) # itraversed :: IndexedTraversal i (Reverse f a) (Reverse f b) a b #
TraversableWithIndex i f => TraversableWithIndex i (Rec1 f)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => (i -> a -> f0 b) -> Rec1 f a -> f0 (Rec1 f b) # itraversed :: IndexedTraversal i (Rec1 f a) (Rec1 f b) a b #
TraversableWithIndex i m => TraversableWithIndex i (IdentityT m)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (i -> a -> f b) -> IdentityT m a -> f (IdentityT m b) # itraversed :: IndexedTraversal i (IdentityT m a) (IdentityT m b) a b #
TraversableWithIndex i f => TraversableWithIndex i (Backwards f)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => (i -> a -> f0 b) -> Backwards f a -> f0 (Backwards f b) # itraversed :: IndexedTraversal i (Backwards f a) (Backwards f b) a b #
TraversableWithIndex i (Magma i t b)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (i -> a -> f b0) -> Magma i t b a -> f (Magma i t b b0) # itraversed :: IndexedTraversal i (Magma i t b a) (Magma i t b b0) a b0 #
TraversableWithIndex Void (K1 i c :: Type -> Type)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (Void -> a -> f b) -> K1 i c a -> f (K1 i c b) # itraversed :: IndexedTraversal Void (K1 i c a) (K1 i c b) a b #
TraversableWithIndex [Int] Tree
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => ([Int] -> a -> f b) -> Tree a -> f (Tree b) # itraversed :: IndexedTraversal [Int] (Tree a) (Tree b) a b #
TraversableWithIndex (E V2) V2
Instance details Defined in Linear.V2 Methods itraverse :: Applicative f => (E V2 -> a -> f b) -> V2 a -> f (V2 b) # itraversed :: IndexedTraversal (E V2) (V2 a) (V2 b) a b #
TraversableWithIndex (E V3) V3
Instance details Defined in Linear.V3 Methods itraverse :: Applicative f => (E V3 -> a -> f b) -> V3 a -> f (V3 b) # itraversed :: IndexedTraversal (E V3) (V3 a) (V3 b) a b #
TraversableWithIndex (E V4) V4
Instance details Defined in Linear.V4 Methods itraverse :: Applicative f => (E V4 -> a -> f b) -> V4 a -> f (V4 b) # itraversed :: IndexedTraversal (E V4) (V4 a) (V4 b) a b #
TraversableWithIndex (E V1) V1
Instance details Defined in Linear.V1 Methods itraverse :: Applicative f => (E V1 -> a -> f b) -> V1 a -> f (V1 b) # itraversed :: IndexedTraversal (E V1) (V1 a) (V1 b) a b #
TraversableWithIndex (E Plucker) Plucker
Instance details Defined in Linear.Plucker Methods itraverse :: Applicative f => (E Plucker -> a -> f b) -> Plucker a -> f (Plucker b) # itraversed :: IndexedTraversal (E Plucker) (Plucker a) (Plucker b) a b #
TraversableWithIndex (E Quaternion) Quaternion
Instance details Defined in Linear.Quaternion Methods itraverse :: Applicative f => (E Quaternion -> a -> f b) -> Quaternion a -> f (Quaternion b) # itraversed :: IndexedTraversal (E Quaternion) (Quaternion a) (Quaternion b) a b #
TraversableWithIndex (E V0) V0
Instance details Defined in Linear.V0 Methods itraverse :: Applicative f => (E V0 -> a -> f b) -> V0 a -> f (V0 b) # itraversed :: IndexedTraversal (E V0) (V0 a) (V0 b) a b #
TraversableWithIndex i f => TraversableWithIndex [i] (Free f)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => ([i] -> a -> f0 b) -> Free f a -> f0 (Free f b) # itraversed :: IndexedTraversal [i] (Free f a) (Free f b) a b #
TraversableWithIndex i f => TraversableWithIndex [i] (Cofree f)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => ([i] -> a -> f0 b) -> Cofree f a -> f0 (Cofree f b) # itraversed :: IndexedTraversal [i] (Cofree f a) (Cofree f b) a b #
(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Sum f g)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> Sum f g a -> f0 (Sum f g b) # itraversed :: IndexedTraversal (Either i j) (Sum f g a) (Sum f g b) a b #
(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Product f g)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> Product f g a -> f0 (Product f g b) # itraversed :: IndexedTraversal (Either i j) (Product f g a) (Product f g b) a b #
(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :+: g)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) # itraversed :: IndexedTraversal (Either i j) ((f :+: g) a) ((f :+: g) b) a b #
(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :*: g)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> (f :: g) a -> f0 ((f :: g) b) # itraversed :: IndexedTraversal (Either i j) ((f :: g) a) ((f :: g) b) a b #
(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (i, j) (Compose f g)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => ((i, j) -> a -> f0 b) -> Compose f g a -> f0 (Compose f g b) # itraversed :: IndexedTraversal (i, j) (Compose f g a) (Compose f g b) a b #
(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (i, j) (f :.: g)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => ((i, j) -> a -> f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) # itraversed :: IndexedTraversal (i, j) ((f :.: g) a) ((f :.: g) b) a b #

newtype Bazaar (p :: Type -> Type -> Type) a b t #

Constructors

Bazaar
Fields runBazaar :: forall (f :: Type -> Type). Applicative f => p a (f b) -> f t

Instances

Profunctor p => Bizarre p (Bazaar p)
Instance details Defined in Control.Lens.Internal.Bazaar Methods bazaar :: Applicative f => p a (f b) -> Bazaar p a b t -> f t
Corepresentable p => Sellable p (Bazaar p)
Instance details Defined in Control.Lens.Internal.Bazaar Methods sell :: p a (Bazaar p a b b)
Conjoined p => IndexedComonad (Bazaar p)
Instance details Defined in Control.Lens.Internal.Bazaar Methods iextract :: Bazaar p a a t -> t iduplicate :: Bazaar p a c t -> Bazaar p a b (Bazaar p b c t) iextend :: (Bazaar p b c t -> r) -> Bazaar p a c t -> Bazaar p a b r
IndexedFunctor (Bazaar p)
Instance details Defined in Control.Lens.Internal.Bazaar Methods ifmap :: (s -> t) -> Bazaar p a b s -> Bazaar p a b t
Functor (Bazaar p a b)
Instance details Defined in Control.Lens.Internal.Bazaar Methods fmap :: (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 # (<$) :: a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #
Applicative (Bazaar p a b)
Instance details Defined in Control.Lens.Internal.Bazaar Methods pure :: a0 -> Bazaar p a b a0 # (<>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 # liftA2 :: (a0 -> b0 -> c) -> Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b c # (>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0 # (<*) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #
(a ~ b, Conjoined p) => Comonad (Bazaar p a b)
Instance details Defined in Control.Lens.Internal.Bazaar Methods extract :: Bazaar p a b a0 -> a0 duplicate :: Bazaar p a b a0 -> Bazaar p a b (Bazaar p a b a0) extend :: (Bazaar p a b a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0
Apply (Bazaar p a b)
Instance details Defined in Control.Lens.Internal.Bazaar Methods (<.>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 (.>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0 (<.) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0 liftF2 :: (a0 -> b0 -> c) -> Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b c
(a ~ b, Conjoined p) => ComonadApply (Bazaar p a b)
Instance details Defined in Control.Lens.Internal.Bazaar Methods (<@>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 (@>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0 (<@) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0

type Bazaar' (p :: Type -> Type -> Type) a = Bazaar p a a #

newtype Bazaar1 (p :: Type -> Type -> Type) a b t #

Constructors

Bazaar1
Fields runBazaar1 :: forall (f :: Type -> Type). Apply f => p a (f b) -> f t

Instances

Corepresentable p => Sellable p (Bazaar1 p)
Instance details Defined in Control.Lens.Internal.Bazaar Methods sell :: p a (Bazaar1 p a b b)
Profunctor p => Bizarre1 p (Bazaar1 p)
Instance details Defined in Control.Lens.Internal.Bazaar Methods bazaar1 :: Apply f => p a (f b) -> Bazaar1 p a b t -> f t
Conjoined p => IndexedComonad (Bazaar1 p)
Instance details Defined in Control.Lens.Internal.Bazaar Methods iextract :: Bazaar1 p a a t -> t iduplicate :: Bazaar1 p a c t -> Bazaar1 p a b (Bazaar1 p b c t) iextend :: (Bazaar1 p b c t -> r) -> Bazaar1 p a c t -> Bazaar1 p a b r
IndexedFunctor (Bazaar1 p)
Instance details Defined in Control.Lens.Internal.Bazaar Methods ifmap :: (s -> t) -> Bazaar1 p a b s -> Bazaar1 p a b t
Functor (Bazaar1 p a b)
Instance details Defined in Control.Lens.Internal.Bazaar Methods fmap :: (a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0 # (<$) :: a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b a0 #
(a ~ b, Conjoined p) => Comonad (Bazaar1 p a b)
Instance details Defined in Control.Lens.Internal.Bazaar Methods extract :: Bazaar1 p a b a0 -> a0 duplicate :: Bazaar1 p a b a0 -> Bazaar1 p a b (Bazaar1 p a b a0) extend :: (Bazaar1 p a b a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0
Apply (Bazaar1 p a b)
Instance details Defined in Control.Lens.Internal.Bazaar Methods (<.>) :: Bazaar1 p a b (a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0 (.>) :: Bazaar1 p a b a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b b0 (<.) :: Bazaar1 p a b a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b a0 liftF2 :: (a0 -> b0 -> c) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b c
(a ~ b, Conjoined p) => ComonadApply (Bazaar1 p a b)
Instance details Defined in Control.Lens.Internal.Bazaar Methods (<@>) :: Bazaar1 p a b (a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0 (@>) :: Bazaar1 p a b a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b b0 (<@) :: Bazaar1 p a b a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b a0

type Bazaar1' (p :: Type -> Type -> Type) a = Bazaar1 p a a #

data Context a b t #

Constructors

Context (b -> t) a

Instances

IndexedComonad Context
Instance details Defined in Control.Lens.Internal.Context Methods iextract :: Context a a t -> t iduplicate :: Context a c t -> Context a b (Context b c t) iextend :: (Context b c t -> r) -> Context a c t -> Context a b r
IndexedFunctor Context
Instance details Defined in Control.Lens.Internal.Context Methods ifmap :: (s -> t) -> Context a b s -> Context a b t
IndexedComonadStore Context
Instance details Defined in Control.Lens.Internal.Context Methods ipos :: Context a c t -> a ipeek :: c -> Context a c t -> t ipeeks :: (a -> c) -> Context a c t -> t iseek :: b -> Context a c t -> Context b c t iseeks :: (a -> b) -> Context a c t -> Context b c t iexperiment :: Functor f => (b -> f c) -> Context b c t -> f t context :: Context a b t -> Context a b t
a ~ b => ComonadStore a (Context a b)
Instance details Defined in Control.Lens.Internal.Context Methods pos :: Context a b a0 -> a peek :: a -> Context a b a0 -> a0 peeks :: (a -> a) -> Context a b a0 -> a0 seek :: a -> Context a b a0 -> Context a b a0 seeks :: (a -> a) -> Context a b a0 -> Context a b a0 experiment :: Functor f => (a -> f a) -> Context a b a0 -> f a0
Functor (Context a b)
Instance details Defined in Control.Lens.Internal.Context Methods fmap :: (a0 -> b0) -> Context a b a0 -> Context a b b0 # (<$) :: a0 -> Context a b b0 -> Context a b a0 #
a ~ b => Comonad (Context a b)
Instance details Defined in Control.Lens.Internal.Context Methods extract :: Context a b a0 -> a0 duplicate :: Context a b a0 -> Context a b (Context a b a0) extend :: (Context a b a0 -> b0) -> Context a b a0 -> Context a b b0
Sellable ((->) :: Type -> Type -> Type) Context
Instance details Defined in Control.Lens.Internal.Context Methods sell :: a -> Context a b b

type Context' a = Context a a #

type ClassyNamer = Name -> Maybe (Name, Name) #

data DefName #

Constructors

TopName Name
MethodName Name Name

Instances

Eq DefName
Instance details Defined in Control.Lens.Internal.FieldTH Methods (==) :: DefName -> DefName -> Bool # (/=) :: DefName -> DefName -> Bool #
Ord DefName
Instance details Defined in Control.Lens.Internal.FieldTH Methods compare :: DefName -> DefName -> Ordering # (<) :: DefName -> DefName -> Bool # (<=) :: DefName -> DefName -> Bool # (>) :: DefName -> DefName -> Bool # (>=) :: DefName -> DefName -> Bool # max :: DefName -> DefName -> DefName # min :: DefName -> DefName -> DefName #
Show DefName
Instance details Defined in Control.Lens.Internal.FieldTH Methods showsPrec :: Int -> DefName -> ShowS # show :: DefName -> String # showList :: [DefName] -> ShowS #

type FieldNamer = Name -> [Name] -> Name -> [DefName] #

data LensRules #

data Leftmost a #

Instances

Semigroup (Leftmost a)
Instance details Defined in Control.Lens.Internal.Fold Methods (<>) :: Leftmost a -> Leftmost a -> Leftmost a # sconcat :: NonEmpty (Leftmost a) -> Leftmost a # stimes :: Integral b => b -> Leftmost a -> Leftmost a #
Monoid (Leftmost a)
Instance details Defined in Control.Lens.Internal.Fold Methods mempty :: Leftmost a # mappend :: Leftmost a -> Leftmost a -> Leftmost a # mconcat :: [Leftmost a] -> Leftmost a #

data Rightmost a #

Instances

Semigroup (Rightmost a)
Instance details Defined in Control.Lens.Internal.Fold Methods (<>) :: Rightmost a -> Rightmost a -> Rightmost a # sconcat :: NonEmpty (Rightmost a) -> Rightmost a # stimes :: Integral b => b -> Rightmost a -> Rightmost a #
Monoid (Rightmost a)
Instance details Defined in Control.Lens.Internal.Fold Methods mempty :: Rightmost a # mappend :: Rightmost a -> Rightmost a -> Rightmost a # mconcat :: [Rightmost a] -> Rightmost a #

data Sequenced a (m :: Type -> Type) #

Instances

Monad m => Semigroup (Sequenced a m)
Instance details Defined in Control.Lens.Internal.Fold Methods (<>) :: Sequenced a m -> Sequenced a m -> Sequenced a m # sconcat :: NonEmpty (Sequenced a m) -> Sequenced a m # stimes :: Integral b => b -> Sequenced a m -> Sequenced a m #
Monad m => Monoid (Sequenced a m)
Instance details Defined in Control.Lens.Internal.Fold Methods mempty :: Sequenced a m # mappend :: Sequenced a m -> Sequenced a m -> Sequenced a m # mconcat :: [Sequenced a m] -> Sequenced a m #

data Traversed a (f :: Type -> Type) #

Instances

Applicative f => Semigroup (Traversed a f)
Instance details Defined in Control.Lens.Internal.Fold Methods (<>) :: Traversed a f -> Traversed a f -> Traversed a f # sconcat :: NonEmpty (Traversed a f) -> Traversed a f # stimes :: Integral b => b -> Traversed a f -> Traversed a f #
Applicative f => Monoid (Traversed a f)
Instance details Defined in Control.Lens.Internal.Fold Methods mempty :: Traversed a f # mappend :: Traversed a f -> Traversed a f -> Traversed a f # mconcat :: [Traversed a f] -> Traversed a f #

class (Choice p, Corepresentable p, Comonad (Corep p), Traversable (Corep p), Strong p, Representable p, Monad (Rep p), MonadFix (Rep p), Distributive (Rep p), Costrong p, ArrowLoop p, ArrowApply p, ArrowChoice p, Closed p) => Conjoined (p :: Type -> Type -> Type) where #

Minimal complete definition

Nothing

Methods

distrib :: Functor f => p a b -> p (f a) (f b) #

conjoined :: ((p ~ ((->) :: Type -> Type -> Type)) -> q (a -> b) r) -> q (p a b) r -> q (p a b) r #

Instances

Conjoined ReifiedGetter
Instance details Defined in Control.Lens.Reified Methods distrib :: Functor f => ReifiedGetter a b -> ReifiedGetter (f a) (f b) # conjoined :: ((ReifiedGetter ~ (->)) -> q (a -> b) r) -> q (ReifiedGetter a b) r -> q (ReifiedGetter a b) r #
Conjoined (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed Methods distrib :: Functor f => Indexed i a b -> Indexed i (f a) (f b) # conjoined :: ((Indexed i ~ (->)) -> q (a -> b) r) -> q (Indexed i a b) r -> q (Indexed i a b) r #
Conjoined ((->) :: Type -> Type -> Type)
Instance details Defined in Control.Lens.Internal.Indexed Methods distrib :: Functor f => (a -> b) -> f a -> f b # conjoined :: (((->) ~ (->)) -> q (a -> b) r) -> q (a -> b) r -> q (a -> b) r #

class Conjoined p => Indexable i (p :: Type -> Type -> Type) #

Minimal complete definition

indexed

Instances

i ~ j => Indexable i (Indexed j)
Instance details Defined in Control.Lens.Internal.Indexed Methods indexed :: Indexed j a b -> i -> a -> b
Indexable i ((->) :: Type -> Type -> Type)
Instance details Defined in Control.Lens.Internal.Indexed Methods indexed :: (a -> b) -> i -> a -> b

newtype Indexed i a b #

Constructors

Indexed
Fields runIndexed :: i -> a -> b

Instances

i ~ j => Indexable i (Indexed j)
Instance details Defined in Control.Lens.Internal.Indexed Methods indexed :: Indexed j a b -> i -> a -> b
Arrow (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed Methods arr :: (b -> c) -> Indexed i b c # first :: Indexed i b c -> Indexed i (b, d) (c, d) # second :: Indexed i b c -> Indexed i (d, b) (d, c) # (***) :: Indexed i b c -> Indexed i b' c' -> Indexed i (b, b') (c, c') # (&&&) :: Indexed i b c -> Indexed i b c' -> Indexed i b (c, c') #
ArrowChoice (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed Methods left :: Indexed i b c -> Indexed i (Either b d) (Either c d) # right :: Indexed i b c -> Indexed i (Either d b) (Either d c) # (+++) :: Indexed i b c -> Indexed i b' c' -> Indexed i (Either b b') (Either c c') # (\|\|\|) :: Indexed i b d -> Indexed i c d -> Indexed i (Either b c) d #
ArrowApply (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed Methods app :: Indexed i (Indexed i b c, b) c #
ArrowLoop (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed Methods loop :: Indexed i (b, d) (c, d) -> Indexed i b c #
Profunctor (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed Methods dimap :: (a -> b) -> (c -> d) -> Indexed i b c -> Indexed i a d # lmap :: (a -> b) -> Indexed i b c -> Indexed i a c # rmap :: (b -> c) -> Indexed i a b -> Indexed i a c # (#.) :: Coercible c b => q b c -> Indexed i a b -> Indexed i a c (.#) :: Coercible b a => Indexed i b c -> q a b -> Indexed i a c
Conjoined (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed Methods distrib :: Functor f => Indexed i a b -> Indexed i (f a) (f b) # conjoined :: ((Indexed i ~ (->)) -> q (a -> b) r) -> q (Indexed i a b) r -> q (Indexed i a b) r #
Choice (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed Methods left' :: Indexed i a b -> Indexed i (Either a c) (Either b c) # right' :: Indexed i a b -> Indexed i (Either c a) (Either c b) #
Closed (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed Methods closed :: Indexed i a b -> Indexed i (x -> a) (x -> b)
Corepresentable (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed Associated Types type Corep (Indexed i) :: Type -> Type Methods cotabulate :: (Corep (Indexed i) d -> c) -> Indexed i d c
Costrong (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed Methods unfirst :: Indexed i (a, d) (b, d) -> Indexed i a b unsecond :: Indexed i (d, a) (d, b) -> Indexed i a b
Representable (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed Associated Types type Rep (Indexed i) :: Type -> Type Methods tabulate :: (d -> Rep (Indexed i) c) -> Indexed i d c
Strong (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed Methods first' :: Indexed i a b -> Indexed i (a, c) (b, c) second' :: Indexed i a b -> Indexed i (c, a) (c, b)
Bizarre (Indexed Int) Mafic
Instance details Defined in Control.Lens.Internal.Magma Methods bazaar :: Applicative f => Indexed Int a (f b) -> Mafic a b t -> f t
Category (Indexed i :: Type -> Type -> Type)
Instance details Defined in Control.Lens.Internal.Indexed Methods id :: Indexed i a a # (.) :: Indexed i b c -> Indexed i a b -> Indexed i a c #
Cosieve (Indexed i) ((,) i)
Instance details Defined in Control.Lens.Internal.Indexed Methods cosieve :: Indexed i a b -> (i, a) -> b
Bizarre (Indexed i) (Molten i)
Instance details Defined in Control.Lens.Internal.Magma Methods bazaar :: Applicative f => Indexed i a (f b) -> Molten i a b t -> f t
Sellable (Indexed i) (Molten i)
Instance details Defined in Control.Lens.Internal.Magma Methods sell :: Indexed i a (Molten i a b b)
Sieve (Indexed i) ((->) i :: Type -> Type)
Instance details Defined in Control.Lens.Internal.Indexed Methods sieve :: Indexed i a b -> a -> i -> b
Monad (Indexed i a)
Instance details Defined in Control.Lens.Internal.Indexed Methods (>>=) :: Indexed i a a0 -> (a0 -> Indexed i a b) -> Indexed i a b # (>>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b # return :: a0 -> Indexed i a a0 # fail :: String -> Indexed i a a0 #
Functor (Indexed i a)
Instance details Defined in Control.Lens.Internal.Indexed Methods fmap :: (a0 -> b) -> Indexed i a a0 -> Indexed i a b # (<$) :: a0 -> Indexed i a b -> Indexed i a a0 #
MonadFix (Indexed i a)
Instance details Defined in Control.Lens.Internal.Indexed Methods mfix :: (a0 -> Indexed i a a0) -> Indexed i a a0 #
Applicative (Indexed i a)
Instance details Defined in Control.Lens.Internal.Indexed Methods pure :: a0 -> Indexed i a a0 # (<>) :: Indexed i a (a0 -> b) -> Indexed i a a0 -> Indexed i a b # liftA2 :: (a0 -> b -> c) -> Indexed i a a0 -> Indexed i a b -> Indexed i a c # (>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b # (<*) :: Indexed i a a0 -> Indexed i a b -> Indexed i a a0 #
Apply (Indexed i a)
Instance details Defined in Control.Lens.Internal.Indexed Methods (<.>) :: Indexed i a (a0 -> b) -> Indexed i a a0 -> Indexed i a b (.>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b (<.) :: Indexed i a a0 -> Indexed i a b -> Indexed i a a0 liftF2 :: (a0 -> b -> c) -> Indexed i a a0 -> Indexed i a b -> Indexed i a c
Bind (Indexed i a)
Instance details Defined in Control.Lens.Internal.Indexed Methods (>>-) :: Indexed i a a0 -> (a0 -> Indexed i a b) -> Indexed i a b join :: Indexed i a (Indexed i a a0) -> Indexed i a a0
type Corep (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed type Corep (Indexed i) = (,) i
type Rep (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed type Rep (Indexed i) = ((->) i :: Type -> Type)

class Reversing t where #

Methods

reversing :: t -> t #

Instances

Reversing ByteString
Instance details Defined in Control.Lens.Internal.Iso Methods reversing :: ByteString -> ByteString #
Reversing ByteString
Instance details Defined in Control.Lens.Internal.Iso Methods reversing :: ByteString -> ByteString #
Reversing Text
Instance details Defined in Control.Lens.Internal.Iso Methods reversing :: Text -> Text #
Reversing Text
Instance details Defined in Control.Lens.Internal.Iso Methods reversing :: Text -> Text #
Reversing [a]
Instance details Defined in Control.Lens.Internal.Iso Methods reversing :: [a] -> [a] #
Reversing (NonEmpty a)
Instance details Defined in Control.Lens.Internal.Iso Methods reversing :: NonEmpty a -> NonEmpty a #
Reversing (Seq a)
Instance details Defined in Control.Lens.Internal.Iso Methods reversing :: Seq a -> Seq a #
Unbox a => Reversing (Vector a)
Instance details Defined in Control.Lens.Internal.Iso Methods reversing :: Vector a -> Vector a #
Reversing (Vector a)
Instance details Defined in Control.Lens.Internal.Iso Methods reversing :: Vector a -> Vector a #
Prim a => Reversing (Vector a)
Instance details Defined in Control.Lens.Internal.Iso Methods reversing :: Vector a -> Vector a #
Storable a => Reversing (Vector a)
Instance details Defined in Control.Lens.Internal.Iso Methods reversing :: Vector a -> Vector a #
(Metric v, OrderedField n) => Reversing (Located (Trail v n))
Instance details Defined in Diagrams.Trail Methods reversing :: Located (Trail v n) -> Located (Trail v n) #
(Metric v, OrderedField n) => Reversing (Located (Trail' l v n))
Instance details Defined in Diagrams.Trail Methods reversing :: Located (Trail' l v n) -> Located (Trail' l v n) #
(Metric v, OrderedField n) => Reversing (Path v n)
Instance details Defined in Diagrams.Path Methods reversing :: Path v n -> Path v n #
Reversing (FixedSegment v n)
Instance details Defined in Diagrams.Segment Methods reversing :: FixedSegment v n -> FixedSegment v n #
(Metric v, OrderedField n) => Reversing (Trail v n)
Instance details Defined in Diagrams.Trail Methods reversing :: Trail v n -> Trail v n #
(Additive v, Num n) => Reversing (Offset c v n)
Instance details Defined in Diagrams.Segment Methods reversing :: Offset c v n -> Offset c v n #
(Additive v, Num n) => Reversing (Segment Closed v n)
Instance details Defined in Diagrams.Segment Methods reversing :: Segment Closed v n -> Segment Closed v n #
(Metric v, OrderedField n) => Reversing (Trail' l v n)
Instance details Defined in Diagrams.Trail Methods reversing :: Trail' l v n -> Trail' l v n #

data Level i a #

Instances

FoldableWithIndex i (Level i)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (i -> a -> m) -> Level i a -> m # ifolded :: IndexedFold i (Level i a) a # ifoldr :: (i -> a -> b -> b) -> b -> Level i a -> b # ifoldl :: (i -> b -> a -> b) -> b -> Level i a -> b # ifoldr' :: (i -> a -> b -> b) -> b -> Level i a -> b # ifoldl' :: (i -> b -> a -> b) -> b -> Level i a -> b #
FunctorWithIndex i (Level i)
Instance details Defined in Control.Lens.Indexed Methods imap :: (i -> a -> b) -> Level i a -> Level i b # imapped :: IndexedSetter i (Level i a) (Level i b) a b #
TraversableWithIndex i (Level i)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (i -> a -> f b) -> Level i a -> f (Level i b) # itraversed :: IndexedTraversal i (Level i a) (Level i b) a b #
Functor (Level i)
Instance details Defined in Control.Lens.Internal.Level Methods fmap :: (a -> b) -> Level i a -> Level i b # (<$) :: a -> Level i b -> Level i a #
Foldable (Level i)
Instance details Defined in Control.Lens.Internal.Level Methods fold :: Monoid m => Level i m -> m # foldMap :: Monoid m => (a -> m) -> Level i a -> m # foldr :: (a -> b -> b) -> b -> Level i a -> b # foldr' :: (a -> b -> b) -> b -> Level i a -> b # foldl :: (b -> a -> b) -> b -> Level i a -> b # foldl' :: (b -> a -> b) -> b -> Level i a -> b # foldr1 :: (a -> a -> a) -> Level i a -> a # foldl1 :: (a -> a -> a) -> Level i a -> a # toList :: Level i a -> [a] # null :: Level i a -> Bool # length :: Level i a -> Int # elem :: Eq a => a -> Level i a -> Bool # maximum :: Ord a => Level i a -> a # minimum :: Ord a => Level i a -> a # sum :: Num a => Level i a -> a # product :: Num a => Level i a -> a #
Traversable (Level i)
Instance details Defined in Control.Lens.Internal.Level Methods traverse :: Applicative f => (a -> f b) -> Level i a -> f (Level i b) # sequenceA :: Applicative f => Level i (f a) -> f (Level i a) # mapM :: Monad m => (a -> m b) -> Level i a -> m (Level i b) # sequence :: Monad m => Level i (m a) -> m (Level i a) #
(Eq i, Eq a) => Eq (Level i a)
Instance details Defined in Control.Lens.Internal.Level Methods (==) :: Level i a -> Level i a -> Bool # (/=) :: Level i a -> Level i a -> Bool #
(Ord i, Ord a) => Ord (Level i a)
Instance details Defined in Control.Lens.Internal.Level Methods compare :: Level i a -> Level i a -> Ordering # (<) :: Level i a -> Level i a -> Bool # (<=) :: Level i a -> Level i a -> Bool # (>) :: Level i a -> Level i a -> Bool # (>=) :: Level i a -> Level i a -> Bool # max :: Level i a -> Level i a -> Level i a # min :: Level i a -> Level i a -> Level i a #
(Read i, Read a) => Read (Level i a)
Instance details Defined in Control.Lens.Internal.Level Methods readsPrec :: Int -> ReadS (Level i a) # readList :: ReadS [Level i a] # readPrec :: ReadPrec (Level i a) # readListPrec :: ReadPrec [Level i a] #
(Show i, Show a) => Show (Level i a)
Instance details Defined in Control.Lens.Internal.Level Methods showsPrec :: Int -> Level i a -> ShowS # show :: Level i a -> String # showList :: [Level i a] -> ShowS #

data Magma i t b a #

Instances

FoldableWithIndex i (Magma i t b)
Instance details Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (i -> a -> m) -> Magma i t b a -> m # ifolded :: IndexedFold i (Magma i t b a) a # ifoldr :: (i -> a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 # ifoldl :: (i -> b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 # ifoldr' :: (i -> a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 # ifoldl' :: (i -> b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #
FunctorWithIndex i (Magma i t b)
Instance details Defined in Control.Lens.Indexed Methods imap :: (i -> a -> b0) -> Magma i t b a -> Magma i t b b0 # imapped :: IndexedSetter i (Magma i t b a) (Magma i t b b0) a b0 #
TraversableWithIndex i (Magma i t b)
Instance details Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (i -> a -> f b0) -> Magma i t b a -> f (Magma i t b b0) # itraversed :: IndexedTraversal i (Magma i t b a) (Magma i t b b0) a b0 #
Functor (Magma i t b)
Instance details Defined in Control.Lens.Internal.Magma Methods fmap :: (a -> b0) -> Magma i t b a -> Magma i t b b0 # (<$) :: a -> Magma i t b b0 -> Magma i t b a #
Foldable (Magma i t b)
Instance details Defined in Control.Lens.Internal.Magma Methods fold :: Monoid m => Magma i t b m -> m # foldMap :: Monoid m => (a -> m) -> Magma i t b a -> m # foldr :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 # foldr' :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 # foldl :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 # foldl' :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 # foldr1 :: (a -> a -> a) -> Magma i t b a -> a # foldl1 :: (a -> a -> a) -> Magma i t b a -> a # toList :: Magma i t b a -> [a] # null :: Magma i t b a -> Bool # length :: Magma i t b a -> Int # elem :: Eq a => a -> Magma i t b a -> Bool # maximum :: Ord a => Magma i t b a -> a # minimum :: Ord a => Magma i t b a -> a # sum :: Num a => Magma i t b a -> a # product :: Num a => Magma i t b a -> a #
Traversable (Magma i t b)
Instance details Defined in Control.Lens.Internal.Magma Methods traverse :: Applicative f => (a -> f b0) -> Magma i t b a -> f (Magma i t b b0) # sequenceA :: Applicative f => Magma i t b (f a) -> f (Magma i t b a) # mapM :: Monad m => (a -> m b0) -> Magma i t b a -> m (Magma i t b b0) # sequence :: Monad m => Magma i t b (m a) -> m (Magma i t b a) #
(Show i, Show a) => Show (Magma i t b a)
Instance details Defined in Control.Lens.Internal.Magma Methods showsPrec :: Int -> Magma i t b a -> ShowS # show :: Magma i t b a -> String # showList :: [Magma i t b a] -> ShowS #

class (Profunctor p, Bifunctor p) => Reviewable (p :: Type -> Type -> Type) #

Instances

(Profunctor p, Bifunctor p) => Reviewable p
Instance details Defined in Control.Lens.Internal.Review

class (Applicative f, Distributive f, Traversable f) => Settable (f :: Type -> Type) #

Minimal complete definition

untainted

Instances

Settable Identity
Instance details Defined in Control.Lens.Internal.Setter Methods untainted :: Identity a -> a untaintedDot :: Profunctor p => p a (Identity b) -> p a b taintedDot :: Profunctor p => p a b -> p a (Identity b)
Settable f => Settable (Backwards f)
Instance details Defined in Control.Lens.Internal.Setter Methods untainted :: Backwards f a -> a untaintedDot :: Profunctor p => p a (Backwards f b) -> p a b taintedDot :: Profunctor p => p a b -> p a (Backwards f b)
(Settable f, Settable g) => Settable (Compose f g)
Instance details Defined in Control.Lens.Internal.Setter Methods untainted :: Compose f g a -> a untaintedDot :: Profunctor p => p a (Compose f g b) -> p a b taintedDot :: Profunctor p => p a b -> p a (Compose f g b)

type AnIso s t a b = Exchange a b a (Identity b) -> Exchange a b s (Identity t) #

type AnIso' s a = AnIso s s a a #

class Strict lazy strict | lazy -> strict, strict -> lazy where #

Methods

strict :: Iso' lazy strict #

Instances

Strict ByteString ByteString
Instance details Defined in Control.Lens.Iso Methods strict :: Iso' ByteString0 ByteString #
Strict Text Text
Instance details Defined in Control.Lens.Iso Methods strict :: Iso' Text0 Text #
Strict (ST s a) (ST s a)
Instance details Defined in Control.Lens.Iso Methods strict :: Iso' (ST s a) (ST0 s a) #
Strict (StateT s m a) (StateT s m a)
Instance details Defined in Control.Lens.Iso Methods strict :: Iso' (StateT0 s m a) (StateT s m a) #
Strict (WriterT w m a) (WriterT w m a)
Instance details Defined in Control.Lens.Iso Methods strict :: Iso' (WriterT0 w m a) (WriterT w m a) #
Strict (RWST r w s m a) (RWST r w s m a)
Instance details Defined in Control.Lens.Iso Methods strict :: Iso' (RWST0 r w s m a) (RWST r w s m a) #

class Bifunctor p => Swapped (p :: Type -> Type -> Type) where #

Methods

swapped :: Iso (p a b) (p c d) (p b a) (p d c) #

Instances

Swapped Either
Instance details Defined in Control.Lens.Iso Methods swapped :: Iso (Either a b) (Either c d) (Either b a) (Either d c) #
Swapped (,)
Instance details Defined in Control.Lens.Iso Methods swapped :: Iso (a, b) (c, d) (b, a) (d, c) #

type ALens s t a b = LensLike (Pretext ((->) :: Type -> Type -> Type) a b) s t a b #

type ALens' s a = ALens s s a a #

type AnIndexedLens i s t a b = Optical (Indexed i) ((->) :: Type -> Type -> Type) (Pretext (Indexed i) a b) s t a b #

type AnIndexedLens' i s a = AnIndexedLens i s s a a #

class GPlated a (g :: k -> Type) #

Minimal complete definition

gplate'

Instances

GPlated a (V1 :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate' :: Traversal' (V1 p) a
GPlated a (U1 :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate' :: Traversal' (U1 p) a
GPlated a (URec b :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate' :: Traversal' (URec b p) a
GPlated a (K1 i a :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate' :: Traversal' (K1 i a p) a
GPlated a (K1 i b :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate' :: Traversal' (K1 i b p) a
(GPlated a f, GPlated a g) => GPlated a (f :+: g :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate' :: Traversal' ((f :+: g) p) a
(GPlated a f, GPlated a g) => GPlated a (f :*: g :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate' :: Traversal' ((f :*: g) p) a
GPlated a f => GPlated a (M1 i c f :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate' :: Traversal' (M1 i c f p) a

class GPlated1 (f :: k -> Type) (g :: k -> Type) #

Minimal complete definition

gplate1'

Instances

GPlated1 (f :: k -> Type) (V1 :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate1' :: Traversal' (V1 a) (f a)
GPlated1 (f :: k -> Type) (U1 :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate1' :: Traversal' (U1 a) (f a)
GPlated1 (f :: k -> Type) (URec a :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate1' :: Traversal' (URec a a0) (f a0)
GPlated1 (f :: k -> Type) (Rec1 f :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate1' :: Traversal' (Rec1 f a) (f a)
GPlated1 (f :: k -> Type) (Rec1 g :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate1' :: Traversal' (Rec1 g a) (f a)
GPlated1 (f :: k -> Type) (K1 i a :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate1' :: Traversal' (K1 i a a0) (f a0)
(GPlated1 f g, GPlated1 f h) => GPlated1 (f :: k -> Type) (g :+: h :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate1' :: Traversal' ((g :+: h) a) (f a)
(GPlated1 f g, GPlated1 f h) => GPlated1 (f :: k -> Type) (g :*: h :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate1' :: Traversal' ((g :*: h) a) (f a)
GPlated1 f g => GPlated1 (f :: k -> Type) (M1 i c g :: k -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate1' :: Traversal' (M1 i c g a) (f a)
(Traversable t, GPlated1 f g) => GPlated1 (f :: k1 -> Type) (t :.: g :: k1 -> Type)
Instance details Defined in Control.Lens.Plated Methods gplate1' :: Traversal' ((t :.: g) a) (f a)
GPlated1 (f :: Type -> Type) Par1
Instance details Defined in Control.Lens.Plated Methods gplate1' :: Traversal' (Par1 a) (f a)

class Plated a where #

Minimal complete definition

Nothing

Methods

plate :: Traversal' a a #

Instances

Plated Exp
Instance details Defined in Control.Lens.Plated Methods plate :: Traversal' Exp Exp #
Plated Pat
Instance details Defined in Control.Lens.Plated Methods plate :: Traversal' Pat Pat #
Plated Type
Instance details Defined in Control.Lens.Plated Methods plate :: Traversal' Type Type #
Plated Dec
Instance details Defined in Control.Lens.Plated Methods plate :: Traversal' Dec Dec #
Plated Stmt
Instance details Defined in Control.Lens.Plated Methods plate :: Traversal' Stmt Stmt #
Plated Con
Instance details Defined in Control.Lens.Plated Methods plate :: Traversal' Con Con #
Plated [a]
Instance details Defined in Control.Lens.Plated Methods plate :: Traversal' [a] [a] #
Plated (Tree a)
Instance details Defined in Control.Lens.Plated Methods plate :: Traversal' (Tree a) (Tree a) #
Traversable f => Plated (Cofree f a)
Instance details Defined in Control.Lens.Plated Methods plate :: Traversal' (Cofree f a) (Cofree f a) #
Traversable f => Plated (Free f a)
Instance details Defined in Control.Lens.Plated Methods plate :: Traversal' (Free f a) (Free f a) #
Traversable f => Plated (F f a)
Instance details Defined in Control.Lens.Plated Methods plate :: Traversal' (F f a) (F f a) #
(Traversable f, Traversable m) => Plated (FreeT f m a)
Instance details Defined in Control.Lens.Plated Methods plate :: Traversal' (FreeT f m a) (FreeT f m a) #
(Traversable f, Traversable w) => Plated (CofreeT f w a)
Instance details Defined in Control.Lens.Plated Methods plate :: Traversal' (CofreeT f w a) (CofreeT f w a) #

type APrism s t a b = Market a b a (Identity b) -> Market a b s (Identity t) #

type APrism' s a = APrism s s a a #

newtype ReifiedFold s a #

Constructors

Fold
Fields runFold :: Fold s a

Instances

Arrow ReifiedFold
Instance details Defined in Control.Lens.Reified Methods arr :: (b -> c) -> ReifiedFold b c # first :: ReifiedFold b c -> ReifiedFold (b, d) (c, d) # second :: ReifiedFold b c -> ReifiedFold (d, b) (d, c) # (***) :: ReifiedFold b c -> ReifiedFold b' c' -> ReifiedFold (b, b') (c, c') # (&&&) :: ReifiedFold b c -> ReifiedFold b c' -> ReifiedFold b (c, c') #
ArrowChoice ReifiedFold
Instance details Defined in Control.Lens.Reified Methods left :: ReifiedFold b c -> ReifiedFold (Either b d) (Either c d) # right :: ReifiedFold b c -> ReifiedFold (Either d b) (Either d c) # (+++) :: ReifiedFold b c -> ReifiedFold b' c' -> ReifiedFold (Either b b') (Either c c') # (\|\|\|) :: ReifiedFold b d -> ReifiedFold c d -> ReifiedFold (Either b c) d #
ArrowApply ReifiedFold
Instance details Defined in Control.Lens.Reified Methods app :: ReifiedFold (ReifiedFold b c, b) c #
Profunctor ReifiedFold
Instance details Defined in Control.Lens.Reified Methods dimap :: (a -> b) -> (c -> d) -> ReifiedFold b c -> ReifiedFold a d # lmap :: (a -> b) -> ReifiedFold b c -> ReifiedFold a c # rmap :: (b -> c) -> ReifiedFold a b -> ReifiedFold a c # (#.) :: Coercible c b => q b c -> ReifiedFold a b -> ReifiedFold a c (.#) :: Coercible b a => ReifiedFold b c -> q a b -> ReifiedFold a c
Choice ReifiedFold
Instance details Defined in Control.Lens.Reified Methods left' :: ReifiedFold a b -> ReifiedFold (Either a c) (Either b c) # right' :: ReifiedFold a b -> ReifiedFold (Either c a) (Either c b) #
Representable ReifiedFold
Instance details Defined in Control.Lens.Reified Associated Types type Rep ReifiedFold :: Type -> Type Methods tabulate :: (d -> Rep ReifiedFold c) -> ReifiedFold d c
Strong ReifiedFold
Instance details Defined in Control.Lens.Reified Methods first' :: ReifiedFold a b -> ReifiedFold (a, c) (b, c) second' :: ReifiedFold a b -> ReifiedFold (c, a) (c, b)
Sieve ReifiedFold []
Instance details Defined in Control.Lens.Reified Methods sieve :: ReifiedFold a b -> a -> [b]
MonadReader s (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods ask :: ReifiedFold s s # local :: (s -> s) -> ReifiedFold s a -> ReifiedFold s a # reader :: (s -> a) -> ReifiedFold s a #
Monad (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods (>>=) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b # (>>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b # return :: a -> ReifiedFold s a # fail :: String -> ReifiedFold s a #
Functor (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedFold s a -> ReifiedFold s b # (<$) :: a -> ReifiedFold s b -> ReifiedFold s a #
Applicative (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods pure :: a -> ReifiedFold s a # (<>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b # liftA2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c # (>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b # (<*) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a #
Alternative (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods empty :: ReifiedFold s a # (<\|>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a # some :: ReifiedFold s a -> ReifiedFold s [a] # many :: ReifiedFold s a -> ReifiedFold s [a] #
MonadPlus (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods mzero :: ReifiedFold s a # mplus :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #
Apply (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods (<.>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b (.>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b (<.) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a liftF2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c
Bind (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods (>>-) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b join :: ReifiedFold s (ReifiedFold s a) -> ReifiedFold s a
Alt (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods (<!>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a some :: Applicative (ReifiedFold s) => ReifiedFold s a -> ReifiedFold s [a] many :: Applicative (ReifiedFold s) => ReifiedFold s a -> ReifiedFold s [a]
Plus (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods zero :: ReifiedFold s a
Category ReifiedFold
Instance details Defined in Control.Lens.Reified Methods id :: ReifiedFold a a # (.) :: ReifiedFold b c -> ReifiedFold a b -> ReifiedFold a c #
Semigroup (ReifiedFold s a)
Instance details Defined in Control.Lens.Reified Methods (<>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a # sconcat :: NonEmpty (ReifiedFold s a) -> ReifiedFold s a # stimes :: Integral b => b -> ReifiedFold s a -> ReifiedFold s a #
Monoid (ReifiedFold s a)
Instance details Defined in Control.Lens.Reified Methods mempty :: ReifiedFold s a # mappend :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a # mconcat :: [ReifiedFold s a] -> ReifiedFold s a #
type Rep ReifiedFold
Instance details Defined in Control.Lens.Reified type Rep ReifiedFold = []

newtype ReifiedGetter s a #

Constructors

Getter
Fields runGetter :: Getter s a

Instances

Arrow ReifiedGetter
Instance details Defined in Control.Lens.Reified Methods arr :: (b -> c) -> ReifiedGetter b c # first :: ReifiedGetter b c -> ReifiedGetter (b, d) (c, d) # second :: ReifiedGetter b c -> ReifiedGetter (d, b) (d, c) # (***) :: ReifiedGetter b c -> ReifiedGetter b' c' -> ReifiedGetter (b, b') (c, c') # (&&&) :: ReifiedGetter b c -> ReifiedGetter b c' -> ReifiedGetter b (c, c') #
ArrowChoice ReifiedGetter
Instance details Defined in Control.Lens.Reified Methods left :: ReifiedGetter b c -> ReifiedGetter (Either b d) (Either c d) # right :: ReifiedGetter b c -> ReifiedGetter (Either d b) (Either d c) # (+++) :: ReifiedGetter b c -> ReifiedGetter b' c' -> ReifiedGetter (Either b b') (Either c c') # (\|\|\|) :: ReifiedGetter b d -> ReifiedGetter c d -> ReifiedGetter (Either b c) d #
ArrowApply ReifiedGetter
Instance details Defined in Control.Lens.Reified Methods app :: ReifiedGetter (ReifiedGetter b c, b) c #
ArrowLoop ReifiedGetter
Instance details Defined in Control.Lens.Reified Methods loop :: ReifiedGetter (b, d) (c, d) -> ReifiedGetter b c #
Profunctor ReifiedGetter
Instance details Defined in Control.Lens.Reified Methods dimap :: (a -> b) -> (c -> d) -> ReifiedGetter b c -> ReifiedGetter a d # lmap :: (a -> b) -> ReifiedGetter b c -> ReifiedGetter a c # rmap :: (b -> c) -> ReifiedGetter a b -> ReifiedGetter a c # (#.) :: Coercible c b => q b c -> ReifiedGetter a b -> ReifiedGetter a c (.#) :: Coercible b a => ReifiedGetter b c -> q a b -> ReifiedGetter a c
Conjoined ReifiedGetter
Instance details Defined in Control.Lens.Reified Methods distrib :: Functor f => ReifiedGetter a b -> ReifiedGetter (f a) (f b) # conjoined :: ((ReifiedGetter ~ (->)) -> q (a -> b) r) -> q (ReifiedGetter a b) r -> q (ReifiedGetter a b) r #
Choice ReifiedGetter
Instance details Defined in Control.Lens.Reified Methods left' :: ReifiedGetter a b -> ReifiedGetter (Either a c) (Either b c) # right' :: ReifiedGetter a b -> ReifiedGetter (Either c a) (Either c b) #
Closed ReifiedGetter
Instance details Defined in Control.Lens.Reified Methods closed :: ReifiedGetter a b -> ReifiedGetter (x -> a) (x -> b)
Corepresentable ReifiedGetter
Instance details Defined in Control.Lens.Reified Associated Types type Corep ReifiedGetter :: Type -> Type Methods cotabulate :: (Corep ReifiedGetter d -> c) -> ReifiedGetter d c
Costrong ReifiedGetter
Instance details Defined in Control.Lens.Reified Methods unfirst :: ReifiedGetter (a, d) (b, d) -> ReifiedGetter a b unsecond :: ReifiedGetter (d, a) (d, b) -> ReifiedGetter a b
Representable ReifiedGetter
Instance details Defined in Control.Lens.Reified Associated Types type Rep ReifiedGetter :: Type -> Type Methods tabulate :: (d -> Rep ReifiedGetter c) -> ReifiedGetter d c
Strong ReifiedGetter
Instance details Defined in Control.Lens.Reified Methods first' :: ReifiedGetter a b -> ReifiedGetter (a, c) (b, c) second' :: ReifiedGetter a b -> ReifiedGetter (c, a) (c, b)
Cosieve ReifiedGetter Identity
Instance details Defined in Control.Lens.Reified Methods cosieve :: ReifiedGetter a b -> Identity a -> b
Sieve ReifiedGetter Identity
Instance details Defined in Control.Lens.Reified Methods sieve :: ReifiedGetter a b -> a -> Identity b
MonadReader s (ReifiedGetter s)
Instance details Defined in Control.Lens.Reified Methods ask :: ReifiedGetter s s # local :: (s -> s) -> ReifiedGetter s a -> ReifiedGetter s a # reader :: (s -> a) -> ReifiedGetter s a #
Monad (ReifiedGetter s)
Instance details Defined in Control.Lens.Reified Methods (>>=) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b # (>>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b # return :: a -> ReifiedGetter s a # fail :: String -> ReifiedGetter s a #
Functor (ReifiedGetter s)
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b # (<$) :: a -> ReifiedGetter s b -> ReifiedGetter s a #
Applicative (ReifiedGetter s)
Instance details Defined in Control.Lens.Reified Methods pure :: a -> ReifiedGetter s a # (<>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b # liftA2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c # (>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b # (<*) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a #
Monoid s => Comonad (ReifiedGetter s)
Instance details Defined in Control.Lens.Reified Methods extract :: ReifiedGetter s a -> a duplicate :: ReifiedGetter s a -> ReifiedGetter s (ReifiedGetter s a) extend :: (ReifiedGetter s a -> b) -> ReifiedGetter s a -> ReifiedGetter s b
Apply (ReifiedGetter s)
Instance details Defined in Control.Lens.Reified Methods (<.>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b (.>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b (<.) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a liftF2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c
Bind (ReifiedGetter s)
Instance details Defined in Control.Lens.Reified Methods (>>-) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b join :: ReifiedGetter s (ReifiedGetter s a) -> ReifiedGetter s a
Distributive (ReifiedGetter s)
Instance details Defined in Control.Lens.Reified Methods distribute :: Functor f => f (ReifiedGetter s a) -> ReifiedGetter s (f a) collect :: Functor f => (a -> ReifiedGetter s b) -> f a -> ReifiedGetter s (f b) distributeM :: Monad m => m (ReifiedGetter s a) -> ReifiedGetter s (m a) collectM :: Monad m => (a -> ReifiedGetter s b) -> m a -> ReifiedGetter s (m b)
Semigroup s => Extend (ReifiedGetter s)
Instance details Defined in Control.Lens.Reified Methods duplicated :: ReifiedGetter s a -> ReifiedGetter s (ReifiedGetter s a) extended :: (ReifiedGetter s a -> b) -> ReifiedGetter s a -> ReifiedGetter s b
Monoid s => ComonadApply (ReifiedGetter s)
Instance details Defined in Control.Lens.Reified Methods (<@>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b (@>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b (<@) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a
Category ReifiedGetter
Instance details Defined in Control.Lens.Reified Methods id :: ReifiedGetter a a # (.) :: ReifiedGetter b c -> ReifiedGetter a b -> ReifiedGetter a c #
type Corep ReifiedGetter
Instance details Defined in Control.Lens.Reified type Corep ReifiedGetter = Identity
type Rep ReifiedGetter
Instance details Defined in Control.Lens.Reified type Rep ReifiedGetter = Identity

newtype ReifiedIndexedFold i s a #

Constructors

IndexedFold
Fields runIndexedFold :: IndexedFold i s a

Instances

Profunctor (ReifiedIndexedFold i)
Instance details Defined in Control.Lens.Reified Methods dimap :: (a -> b) -> (c -> d) -> ReifiedIndexedFold i b c -> ReifiedIndexedFold i a d # lmap :: (a -> b) -> ReifiedIndexedFold i b c -> ReifiedIndexedFold i a c # rmap :: (b -> c) -> ReifiedIndexedFold i a b -> ReifiedIndexedFold i a c # (#.) :: Coercible c b => q b c -> ReifiedIndexedFold i a b -> ReifiedIndexedFold i a c (.#) :: Coercible b a => ReifiedIndexedFold i b c -> q a b -> ReifiedIndexedFold i a c
Representable (ReifiedIndexedFold i)
Instance details Defined in Control.Lens.Reified Associated Types type Rep (ReifiedIndexedFold i) :: Type -> Type Methods tabulate :: (d -> Rep (ReifiedIndexedFold i) c) -> ReifiedIndexedFold i d c
Strong (ReifiedIndexedFold i)
Instance details Defined in Control.Lens.Reified Methods first' :: ReifiedIndexedFold i a b -> ReifiedIndexedFold i (a, c) (b, c) second' :: ReifiedIndexedFold i a b -> ReifiedIndexedFold i (c, a) (c, b)
Sieve (ReifiedIndexedFold i) (Compose [] ((,) i))
Instance details Defined in Control.Lens.Reified Methods sieve :: ReifiedIndexedFold i a b -> a -> Compose [] ((,) i) b
Functor (ReifiedIndexedFold i s)
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s b # (<$) :: a -> ReifiedIndexedFold i s b -> ReifiedIndexedFold i s a #
Alt (ReifiedIndexedFold i s)
Instance details Defined in Control.Lens.Reified Methods (<!>) :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a some :: Applicative (ReifiedIndexedFold i s) => ReifiedIndexedFold i s a -> ReifiedIndexedFold i s [a] many :: Applicative (ReifiedIndexedFold i s) => ReifiedIndexedFold i s a -> ReifiedIndexedFold i s [a]
Plus (ReifiedIndexedFold i s)
Instance details Defined in Control.Lens.Reified Methods zero :: ReifiedIndexedFold i s a
Semigroup (ReifiedIndexedFold i s a)
Instance details Defined in Control.Lens.Reified Methods (<>) :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a # sconcat :: NonEmpty (ReifiedIndexedFold i s a) -> ReifiedIndexedFold i s a # stimes :: Integral b => b -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #
Monoid (ReifiedIndexedFold i s a)
Instance details Defined in Control.Lens.Reified Methods mempty :: ReifiedIndexedFold i s a # mappend :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a # mconcat :: [ReifiedIndexedFold i s a] -> ReifiedIndexedFold i s a #
type Rep (ReifiedIndexedFold i)
Instance details Defined in Control.Lens.Reified type Rep (ReifiedIndexedFold i) = Compose [] ((,) i)

newtype ReifiedIndexedGetter i s a #

Constructors

IndexedGetter
Fields runIndexedGetter :: IndexedGetter i s a

Instances

Profunctor (ReifiedIndexedGetter i)
Instance details Defined in Control.Lens.Reified Methods dimap :: (a -> b) -> (c -> d) -> ReifiedIndexedGetter i b c -> ReifiedIndexedGetter i a d # lmap :: (a -> b) -> ReifiedIndexedGetter i b c -> ReifiedIndexedGetter i a c # rmap :: (b -> c) -> ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i a c # (#.) :: Coercible c b => q b c -> ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i a c (.#) :: Coercible b a => ReifiedIndexedGetter i b c -> q a b -> ReifiedIndexedGetter i a c
Representable (ReifiedIndexedGetter i)
Instance details Defined in Control.Lens.Reified Associated Types type Rep (ReifiedIndexedGetter i) :: Type -> Type Methods tabulate :: (d -> Rep (ReifiedIndexedGetter i) c) -> ReifiedIndexedGetter i d c
Strong (ReifiedIndexedGetter i)
Instance details Defined in Control.Lens.Reified Methods first' :: ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i (a, c) (b, c) second' :: ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i (c, a) (c, b)
Sieve (ReifiedIndexedGetter i) ((,) i)
Instance details Defined in Control.Lens.Reified Methods sieve :: ReifiedIndexedGetter i a b -> a -> (i, b)
Functor (ReifiedIndexedGetter i s)
Instance details Defined in Control.Lens.Reified Methods fmap :: (a -> b) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b # (<$) :: a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s a #
Semigroup i => Apply (ReifiedIndexedGetter i s)
Instance details Defined in Control.Lens.Reified Methods (<.>) :: ReifiedIndexedGetter i s (a -> b) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b (.>) :: ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s b (<.) :: ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s a liftF2 :: (a -> b -> c) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s c
type Rep (ReifiedIndexedGetter i)
Instance details Defined in Control.Lens.Reified type Rep (ReifiedIndexedGetter i) = (,) i

newtype ReifiedIndexedLens i s t a b #

Constructors

IndexedLens
Fields runIndexedLens :: IndexedLens i s t a b

type ReifiedIndexedLens' i s a = ReifiedIndexedLens i s s a a #

newtype ReifiedIndexedSetter i s t a b #

Constructors

IndexedSetter
Fields runIndexedSetter :: IndexedSetter i s t a b

type ReifiedIndexedSetter' i s a = ReifiedIndexedSetter i s s a a #

newtype ReifiedIndexedTraversal i s t a b #

Constructors

IndexedTraversal
Fields runIndexedTraversal :: IndexedTraversal i s t a b

type ReifiedIndexedTraversal' i s a = ReifiedIndexedTraversal i s s a a #

newtype ReifiedIso s t a b #

Constructors

Iso
Fields runIso :: Iso s t a b

type ReifiedIso' s a = ReifiedIso s s a a #

newtype ReifiedLens s t a b #

Constructors

Lens
Fields runLens :: Lens s t a b

type ReifiedLens' s a = ReifiedLens s s a a #

newtype ReifiedPrism s t a b #

Constructors

Prism
Fields runPrism :: Prism s t a b

type ReifiedPrism' s a = ReifiedPrism s s a a #

newtype ReifiedSetter s t a b #

Constructors

Setter
Fields runSetter :: Setter s t a b

type ReifiedSetter' s a = ReifiedSetter s s a a #

newtype ReifiedTraversal s t a b #

Constructors

Traversal
Fields runTraversal :: Traversal s t a b

type ReifiedTraversal' s a = ReifiedTraversal s s a a #

type ASetter s t a b = (a -> Identity b) -> s -> Identity t #

type ASetter' s a = ASetter s s a a #

type AnIndexedSetter i s t a b = Indexed i a (Identity b) -> s -> Identity t #

type AnIndexedSetter' i s a = AnIndexedSetter i s s a a #

type Setting (p :: Type -> Type -> Type) s t a b = p a (Identity b) -> s -> Identity t #

type Setting' (p :: Type -> Type -> Type) s a = Setting p s s a a #

type ATraversal s t a b = LensLike (Bazaar ((->) :: Type -> Type -> Type) a b) s t a b #

type ATraversal' s a = ATraversal s s a a #

type ATraversal1 s t a b = LensLike (Bazaar1 ((->) :: Type -> Type -> Type) a b) s t a b #

type ATraversal1' s a = ATraversal1 s s a a #

type AnIndexedTraversal i s t a b = Over (Indexed i) (Bazaar (Indexed i) a b) s t a b #

type AnIndexedTraversal' i s a = AnIndexedTraversal i s s a a #

type AnIndexedTraversal1 i s t a b = Over (Indexed i) (Bazaar1 (Indexed i) a b) s t a b #

type AnIndexedTraversal1' i s a = AnIndexedTraversal1 i s s a a #

class Ord k => TraverseMax k (m :: Type -> Type) | m -> k where #

Methods

traverseMax :: IndexedTraversal' k (m v) v #

Instances

TraverseMax Int IntMap
Instance details Defined in Control.Lens.Traversal Methods traverseMax :: IndexedTraversal' Int (IntMap v) v #
Ord k => TraverseMax k (Map k)
Instance details Defined in Control.Lens.Traversal Methods traverseMax :: IndexedTraversal' k (Map k v) v #

class Ord k => TraverseMin k (m :: Type -> Type) | m -> k where #

Methods

traverseMin :: IndexedTraversal' k (m v) v #

Instances

TraverseMin Int IntMap
Instance details Defined in Control.Lens.Traversal Methods traverseMin :: IndexedTraversal' Int (IntMap v) v #
Ord k => TraverseMin k (Map k)
Instance details Defined in Control.Lens.Traversal Methods traverseMin :: IndexedTraversal' k (Map k v) v #

type Traversing (p :: Type -> Type -> Type) (f :: Type -> Type) s t a b = Over p (BazaarT p f a b) s t a b #

type Traversing' (p :: Type -> Type -> Type) (f :: Type -> Type) s a = Traversing p f s s a a #

type Traversing1 (p :: Type -> Type -> Type) (f :: Type -> Type) s t a b = Over p (BazaarT1 p f a b) s t a b #

type Traversing1' (p :: Type -> Type -> Type) (f :: Type -> Type) s a = Traversing1 p f s s a a #

class Field1 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_1 :: Lens s t a b #

Instances

Field1 (Identity a) (Identity b) a b
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (Identity a) (Identity b) a b #
Field1 (V2 a) (V2 a) a a
Instance details Defined in Linear.V2 Methods _1 :: Lens (V2 a) (V2 a) a a #
Field1 (V3 a) (V3 a) a a
Instance details Defined in Linear.V3 Methods _1 :: Lens (V3 a) (V3 a) a a #
Field1 (V4 a) (V4 a) a a
Instance details Defined in Linear.V4 Methods _1 :: Lens (V4 a) (V4 a) a a #
Field1 (V1 a) (V1 b) a b
Instance details Defined in Linear.V1 Methods _1 :: Lens (V1 a) (V1 b) a b #
Field1 (Plucker a) (Plucker a) a a
Instance details Defined in Linear.Plucker Methods _1 :: Lens (Plucker a) (Plucker a) a a #
Field1 (Quaternion a) (Quaternion a) a a
Instance details Defined in Linear.Quaternion Methods _1 :: Lens (Quaternion a) (Quaternion a) a a #
Field1 (a, b) (a', b) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b) (a', b) a a' #
Field1 (a, b, c) (a', b, c) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c) (a', b, c) a a' #
1 <= n => Field1 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _1 :: Lens (V n a) (V n a) a a #
Field1 (a, b, c, d) (a', b, c, d) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d) (a', b, c, d) a a' #
Field1 ((f :: g) p) ((f' :: g) p) (f p) (f' p)
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens ((f :: g) p) ((f' :: g) p) (f p) (f' p) #
Field1 (Product f g a) (Product f' g a) (f a) (f' a)
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (Product f g a) (Product f' g a) (f a) (f' a) #
Field1 (a, b, c, d, e) (a', b, c, d, e) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d, e) (a', b, c, d, e) a a' #
Field1 (a, b, c, d, e, f) (a', b, c, d, e, f) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d, e, f) (a', b, c, d, e, f) a a' #
Field1 (a, b, c, d, e, f, g) (a', b, c, d, e, f, g) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d, e, f, g) (a', b, c, d, e, f, g) a a' #
Field1 (a, b, c, d, e, f, g, h) (a', b, c, d, e, f, g, h) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d, e, f, g, h) (a', b, c, d, e, f, g, h) a a' #
Field1 (a, b, c, d, e, f, g, h, i) (a', b, c, d, e, f, g, h, i) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d, e, f, g, h, i) (a', b, c, d, e, f, g, h, i) a a' #
Field1 (a, b, c, d, e, f, g, h, i, j) (a', b, c, d, e, f, g, h, i, j) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d, e, f, g, h, i, j) (a', b, c, d, e, f, g, h, i, j) a a' #
Field1 (a, b, c, d, e, f, g, h, i, j, kk) (a', b, c, d, e, f, g, h, i, j, kk) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a', b, c, d, e, f, g, h, i, j, kk) a a' #
Field1 (a, b, c, d, e, f, g, h, i, j, kk, l) (a', b, c, d, e, f, g, h, i, j, kk, l) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a', b, c, d, e, f, g, h, i, j, kk, l) a a' #
Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a', b, c, d, e, f, g, h, i, j, kk, l, m) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a', b, c, d, e, f, g, h, i, j, kk, l, m) a a' #
Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n) a a' #
Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o) a a' #
Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) a a' #
Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) a a' #
Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) a a' #
Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) a a'
Instance details Defined in Control.Lens.Tuple Methods _1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) a a' #

class Field10 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_10 :: Lens s t a b #

Instances

10 <= n => Field10 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _10 :: Lens (V n a) (V n a) a a #
Field10 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h, i, j') j j'
Instance details Defined in Control.Lens.Tuple Methods _10 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h, i, j') j j' #
Field10 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i, j', kk) j j'
Instance details Defined in Control.Lens.Tuple Methods _10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i, j', kk) j j' #
Field10 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j', kk, l) j j'
Instance details Defined in Control.Lens.Tuple Methods _10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j', kk, l) j j' #
Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j', kk, l, m) j j'
Instance details Defined in Control.Lens.Tuple Methods _10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j', kk, l, m) j j' #
Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n) j j'
Instance details Defined in Control.Lens.Tuple Methods _10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n) j j' #
Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o) j j'
Instance details Defined in Control.Lens.Tuple Methods _10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o) j j' #
Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p) j j'
Instance details Defined in Control.Lens.Tuple Methods _10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p) j j' #
Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q) j j'
Instance details Defined in Control.Lens.Tuple Methods _10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q) j j' #
Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q, r) j j'
Instance details Defined in Control.Lens.Tuple Methods _10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q, r) j j' #
Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q, r, s) j j'
Instance details Defined in Control.Lens.Tuple Methods _10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q, r, s) j j' #

class Field11 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_11 :: Lens s t a b #

Instances

11 <= n => Field11 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _11 :: Lens (V n a) (V n a) a a #
Field11 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i, j, kk') kk kk'
Instance details Defined in Control.Lens.Tuple Methods _11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i, j, kk') kk kk' #
Field11 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j, kk', l) kk kk'
Instance details Defined in Control.Lens.Tuple Methods _11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j, kk', l) kk kk' #
Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk', l, m) kk kk'
Instance details Defined in Control.Lens.Tuple Methods _11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk', l, m) kk kk' #
Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n) kk kk'
Instance details Defined in Control.Lens.Tuple Methods _11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n) kk kk' #
Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o) kk kk'
Instance details Defined in Control.Lens.Tuple Methods _11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o) kk kk' #
Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p) kk kk'
Instance details Defined in Control.Lens.Tuple Methods _11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p) kk kk' #
Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q) kk kk'
Instance details Defined in Control.Lens.Tuple Methods _11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q) kk kk' #
Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q, r) kk kk'
Instance details Defined in Control.Lens.Tuple Methods _11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q, r) kk kk' #
Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q, r, s) kk kk'
Instance details Defined in Control.Lens.Tuple Methods _11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q, r, s) kk kk' #

class Field12 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_12 :: Lens s t a b #

Instances

12 <= n => Field12 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _12 :: Lens (V n a) (V n a) a a #
Field12 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j, kk, l') l l'
Instance details Defined in Control.Lens.Tuple Methods _12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j, kk, l') l l' #
Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk, l', m) l l'
Instance details Defined in Control.Lens.Tuple Methods _12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk, l', m) l l' #
Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n) l l'
Instance details Defined in Control.Lens.Tuple Methods _12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n) l l' #
Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o) l l'
Instance details Defined in Control.Lens.Tuple Methods _12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o) l l' #
Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p) l l'
Instance details Defined in Control.Lens.Tuple Methods _12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p) l l' #
Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q) l l'
Instance details Defined in Control.Lens.Tuple Methods _12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q) l l' #
Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q, r) l l'
Instance details Defined in Control.Lens.Tuple Methods _12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q, r) l l' #
Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q, r, s) l l'
Instance details Defined in Control.Lens.Tuple Methods _12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q, r, s) l l' #

class Field13 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_13 :: Lens s t a b #

Instances

13 <= n => Field13 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _13 :: Lens (V n a) (V n a) a a #
Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk, l, m') m m'
Instance details Defined in Control.Lens.Tuple Methods _13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk, l, m') m m' #
Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n) m m'
Instance details Defined in Control.Lens.Tuple Methods _13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n) m m' #
Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o) m m'
Instance details Defined in Control.Lens.Tuple Methods _13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o) m m' #
Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p) m m'
Instance details Defined in Control.Lens.Tuple Methods _13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p) m m' #
Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q) m m'
Instance details Defined in Control.Lens.Tuple Methods _13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q) m m' #
Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q, r) m m'
Instance details Defined in Control.Lens.Tuple Methods _13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q, r) m m' #
Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q, r, s) m m'
Instance details Defined in Control.Lens.Tuple Methods _13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q, r, s) m m' #

class Field14 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_14 :: Lens s t a b #

Instances

14 <= n => Field14 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _14 :: Lens (V n a) (V n a) a a #
Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n') n n'
Instance details Defined in Control.Lens.Tuple Methods _14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n') n n' #
Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o) n n'
Instance details Defined in Control.Lens.Tuple Methods _14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o) n n' #
Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p) n n'
Instance details Defined in Control.Lens.Tuple Methods _14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p) n n' #
Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q) n n'
Instance details Defined in Control.Lens.Tuple Methods _14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q) n n' #
Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q, r) n n'
Instance details Defined in Control.Lens.Tuple Methods _14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q, r) n n' #
Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q, r, s) n n'
Instance details Defined in Control.Lens.Tuple Methods _14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q, r, s) n n' #

class Field15 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_15 :: Lens s t a b #

Instances

15 <= n => Field15 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _15 :: Lens (V n a) (V n a) a a #
Field15 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o') o o'
Instance details Defined in Control.Lens.Tuple Methods _15 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o') o o' #
Field15 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p) o o'
Instance details Defined in Control.Lens.Tuple Methods _15 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p) o o' #
Field15 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q) o o'
Instance details Defined in Control.Lens.Tuple Methods _15 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q) o o' #
Field15 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q, r) o o'
Instance details Defined in Control.Lens.Tuple Methods _15 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q, r) o o' #
Field15 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q, r, s) o o'
Instance details Defined in Control.Lens.Tuple Methods _15 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q, r, s) o o' #

class Field16 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_16 :: Lens s t a b #

Instances

16 <= n => Field16 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _16 :: Lens (V n a) (V n a) a a #
Field16 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p') p p'
Instance details Defined in Control.Lens.Tuple Methods _16 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p') p p' #
Field16 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q) p p'
Instance details Defined in Control.Lens.Tuple Methods _16 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q) p p' #
Field16 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q, r) p p'
Instance details Defined in Control.Lens.Tuple Methods _16 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q, r) p p' #
Field16 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q, r, s) p p'
Instance details Defined in Control.Lens.Tuple Methods _16 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q, r, s) p p' #

class Field17 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_17 :: Lens s t a b #

Instances

17 <= n => Field17 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _17 :: Lens (V n a) (V n a) a a #
Field17 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q') q q'
Instance details Defined in Control.Lens.Tuple Methods _17 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q') q q' #
Field17 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q', r) q q'
Instance details Defined in Control.Lens.Tuple Methods _17 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q', r) q q' #
Field17 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q', r, s) q q'
Instance details Defined in Control.Lens.Tuple Methods _17 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q', r, s) q q' #

class Field18 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_18 :: Lens s t a b #

Instances

18 <= n => Field18 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _18 :: Lens (V n a) (V n a) a a #
Field18 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r') r r'
Instance details Defined in Control.Lens.Tuple Methods _18 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r') r r' #
Field18 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r', s) r r'
Instance details Defined in Control.Lens.Tuple Methods _18 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r', s) r r' #

class Field19 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_19 :: Lens s t a b #

Instances

19 <= n => Field19 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _19 :: Lens (V n a) (V n a) a a #
Field19 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s') s s'
Instance details Defined in Control.Lens.Tuple Methods _19 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s') s s' #

class Field2 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_2 :: Lens s t a b #

Instances

Field2 (V2 a) (V2 a) a a
Instance details Defined in Linear.V2 Methods _2 :: Lens (V2 a) (V2 a) a a #
Field2 (V3 a) (V3 a) a a
Instance details Defined in Linear.V3 Methods _2 :: Lens (V3 a) (V3 a) a a #
Field2 (V4 a) (V4 a) a a
Instance details Defined in Linear.V4 Methods _2 :: Lens (V4 a) (V4 a) a a #
Field2 (Plucker a) (Plucker a) a a
Instance details Defined in Linear.Plucker Methods _2 :: Lens (Plucker a) (Plucker a) a a #
Field2 (Quaternion a) (Quaternion a) a a
Instance details Defined in Linear.Quaternion Methods _2 :: Lens (Quaternion a) (Quaternion a) a a #
Field2 (a, b) (a, b') b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b) (a, b') b b' #
Field2 (a, b, c) (a, b', c) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c) (a, b', c) b b' #
2 <= n => Field2 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _2 :: Lens (V n a) (V n a) a a #
Field2 (a, b, c, d) (a, b', c, d) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d) (a, b', c, d) b b' #
Field2 ((f :: g) p) ((f :: g') p) (g p) (g' p)
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens ((f :: g) p) ((f :: g') p) (g p) (g' p) #
Field2 (Product f g a) (Product f g' a) (g a) (g' a)
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (Product f g a) (Product f g' a) (g a) (g' a) #
Field2 (a, b, c, d, e) (a, b', c, d, e) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d, e) (a, b', c, d, e) b b' #
Field2 (a, b, c, d, e, f) (a, b', c, d, e, f) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d, e, f) (a, b', c, d, e, f) b b' #
Field2 (a, b, c, d, e, f, g) (a, b', c, d, e, f, g) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d, e, f, g) (a, b', c, d, e, f, g) b b' #
Field2 (a, b, c, d, e, f, g, h) (a, b', c, d, e, f, g, h) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d, e, f, g, h) (a, b', c, d, e, f, g, h) b b' #
Field2 (a, b, c, d, e, f, g, h, i) (a, b', c, d, e, f, g, h, i) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d, e, f, g, h, i) (a, b', c, d, e, f, g, h, i) b b' #
Field2 (a, b, c, d, e, f, g, h, i, j) (a, b', c, d, e, f, g, h, i, j) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b', c, d, e, f, g, h, i, j) b b' #
Field2 (a, b, c, d, e, f, g, h, i, j, kk) (a, b', c, d, e, f, g, h, i, j, kk) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b', c, d, e, f, g, h, i, j, kk) b b' #
Field2 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b', c, d, e, f, g, h, i, j, kk, l) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b', c, d, e, f, g, h, i, j, kk, l) b b' #
Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b', c, d, e, f, g, h, i, j, kk, l, m) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b', c, d, e, f, g, h, i, j, kk, l, m) b b' #
Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n) b b' #
Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o) b b' #
Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p) b b' #
Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) b b' #
Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) b b' #
Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) b b'
Instance details Defined in Control.Lens.Tuple Methods _2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) b b' #

class Field3 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_3 :: Lens s t a b #

Instances

Field3 (V3 a) (V3 a) a a
Instance details Defined in Linear.V3 Methods _3 :: Lens (V3 a) (V3 a) a a #
Field3 (V4 a) (V4 a) a a
Instance details Defined in Linear.V4 Methods _3 :: Lens (V4 a) (V4 a) a a #
Field3 (Plucker a) (Plucker a) a a
Instance details Defined in Linear.Plucker Methods _3 :: Lens (Plucker a) (Plucker a) a a #
Field3 (Quaternion a) (Quaternion a) a a
Instance details Defined in Linear.Quaternion Methods _3 :: Lens (Quaternion a) (Quaternion a) a a #
Field3 (a, b, c) (a, b, c') c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c) (a, b, c') c c' #
3 <= n => Field3 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _3 :: Lens (V n a) (V n a) a a #
Field3 (a, b, c, d) (a, b, c', d) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d) (a, b, c', d) c c' #
Field3 (a, b, c, d, e) (a, b, c', d, e) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d, e) (a, b, c', d, e) c c' #
Field3 (a, b, c, d, e, f) (a, b, c', d, e, f) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d, e, f) (a, b, c', d, e, f) c c' #
Field3 (a, b, c, d, e, f, g) (a, b, c', d, e, f, g) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d, e, f, g) (a, b, c', d, e, f, g) c c' #
Field3 (a, b, c, d, e, f, g, h) (a, b, c', d, e, f, g, h) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d, e, f, g, h) (a, b, c', d, e, f, g, h) c c' #
Field3 (a, b, c, d, e, f, g, h, i) (a, b, c', d, e, f, g, h, i) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c', d, e, f, g, h, i) c c' #
Field3 (a, b, c, d, e, f, g, h, i, j) (a, b, c', d, e, f, g, h, i, j) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c', d, e, f, g, h, i, j) c c' #
Field3 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c', d, e, f, g, h, i, j, kk) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c', d, e, f, g, h, i, j, kk) c c' #
Field3 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c', d, e, f, g, h, i, j, kk, l) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c', d, e, f, g, h, i, j, kk, l) c c' #
Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c', d, e, f, g, h, i, j, kk, l, m) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c', d, e, f, g, h, i, j, kk, l, m) c c' #
Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n) c c' #
Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o) c c' #
Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p) c c' #
Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q) c c' #
Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) c c' #
Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) c c'
Instance details Defined in Control.Lens.Tuple Methods _3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) c c' #

class Field4 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_4 :: Lens s t a b #

Instances

Field4 (V4 a) (V4 a) a a
Instance details Defined in Linear.V4 Methods _4 :: Lens (V4 a) (V4 a) a a #
Field4 (Plucker a) (Plucker a) a a
Instance details Defined in Linear.Plucker Methods _4 :: Lens (Plucker a) (Plucker a) a a #
Field4 (Quaternion a) (Quaternion a) a a
Instance details Defined in Linear.Quaternion Methods _4 :: Lens (Quaternion a) (Quaternion a) a a #
4 <= n => Field4 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _4 :: Lens (V n a) (V n a) a a #
Field4 (a, b, c, d) (a, b, c, d') d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d) (a, b, c, d') d d' #
Field4 (a, b, c, d, e) (a, b, c, d', e) d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d, e) (a, b, c, d', e) d d' #
Field4 (a, b, c, d, e, f) (a, b, c, d', e, f) d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d, e, f) (a, b, c, d', e, f) d d' #
Field4 (a, b, c, d, e, f, g) (a, b, c, d', e, f, g) d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d, e, f, g) (a, b, c, d', e, f, g) d d' #
Field4 (a, b, c, d, e, f, g, h) (a, b, c, d', e, f, g, h) d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d, e, f, g, h) (a, b, c, d', e, f, g, h) d d' #
Field4 (a, b, c, d, e, f, g, h, i) (a, b, c, d', e, f, g, h, i) d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d', e, f, g, h, i) d d' #
Field4 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d', e, f, g, h, i, j) d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d', e, f, g, h, i, j) d d' #
Field4 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d', e, f, g, h, i, j, kk) d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d', e, f, g, h, i, j, kk) d d' #
Field4 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d', e, f, g, h, i, j, kk, l) d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d', e, f, g, h, i, j, kk, l) d d' #
Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d', e, f, g, h, i, j, kk, l, m) d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d', e, f, g, h, i, j, kk, l, m) d d' #
Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n) d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n) d d' #
Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o) d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o) d d' #
Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p) d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p) d d' #
Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q) d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q) d d' #
Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q, r) d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q, r) d d' #
Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) d d'
Instance details Defined in Control.Lens.Tuple Methods _4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) d d' #

class Field5 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_5 :: Lens s t a b #

Instances

Field5 (Plucker a) (Plucker a) a a
Instance details Defined in Linear.Plucker Methods _5 :: Lens (Plucker a) (Plucker a) a a #
5 <= n => Field5 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _5 :: Lens (V n a) (V n a) a a #
Field5 (a, b, c, d, e) (a, b, c, d, e') e e'
Instance details Defined in Control.Lens.Tuple Methods _5 :: Lens (a, b, c, d, e) (a, b, c, d, e') e e' #
Field5 (a, b, c, d, e, f) (a, b, c, d, e', f) e e'
Instance details Defined in Control.Lens.Tuple Methods _5 :: Lens (a, b, c, d, e, f) (a, b, c, d, e', f) e e' #
Field5 (a, b, c, d, e, f, g) (a, b, c, d, e', f, g) e e'
Instance details Defined in Control.Lens.Tuple Methods _5 :: Lens (a, b, c, d, e, f, g) (a, b, c, d, e', f, g) e e' #
Field5 (a, b, c, d, e, f, g, h) (a, b, c, d, e', f, g, h) e e'
Instance details Defined in Control.Lens.Tuple Methods _5 :: Lens (a, b, c, d, e, f, g, h) (a, b, c, d, e', f, g, h) e e' #
Field5 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e', f, g, h, i) e e'
Instance details Defined in Control.Lens.Tuple Methods _5 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d, e', f, g, h, i) e e' #
Field5 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e', f, g, h, i, j) e e'
Instance details Defined in Control.Lens.Tuple Methods _5 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e', f, g, h, i, j) e e' #
Field5 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e', f, g, h, i, j, kk) e e'
Instance details Defined in Control.Lens.Tuple Methods _5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e', f, g, h, i, j, kk) e e' #
Field5 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e', f, g, h, i, j, kk, l) e e'
Instance details Defined in Control.Lens.Tuple Methods _5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e', f, g, h, i, j, kk, l) e e' #
Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e', f, g, h, i, j, kk, l, m) e e'
Instance details Defined in Control.Lens.Tuple Methods _5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e', f, g, h, i, j, kk, l, m) e e' #
Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n) e e'
Instance details Defined in Control.Lens.Tuple Methods _5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n) e e' #
Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o) e e'
Instance details Defined in Control.Lens.Tuple Methods _5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o) e e' #
Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p) e e'
Instance details Defined in Control.Lens.Tuple Methods _5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p) e e' #
Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q) e e'
Instance details Defined in Control.Lens.Tuple Methods _5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q) e e' #
Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q, r) e e'
Instance details Defined in Control.Lens.Tuple Methods _5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q, r) e e' #
Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q, r, s) e e'
Instance details Defined in Control.Lens.Tuple Methods _5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q, r, s) e e' #

class Field6 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_6 :: Lens s t a b #

Instances

Field6 (Plucker a) (Plucker a) a a
Instance details Defined in Linear.Plucker Methods _6 :: Lens (Plucker a) (Plucker a) a a #
6 <= n => Field6 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _6 :: Lens (V n a) (V n a) a a #
Field6 (a, b, c, d, e, f) (a, b, c, d, e, f') f f'
Instance details Defined in Control.Lens.Tuple Methods _6 :: Lens (a, b, c, d, e, f) (a, b, c, d, e, f') f f' #
Field6 (a, b, c, d, e, f, g) (a, b, c, d, e, f', g) f f'
Instance details Defined in Control.Lens.Tuple Methods _6 :: Lens (a, b, c, d, e, f, g) (a, b, c, d, e, f', g) f f' #
Field6 (a, b, c, d, e, f, g, h) (a, b, c, d, e, f', g, h) f f'
Instance details Defined in Control.Lens.Tuple Methods _6 :: Lens (a, b, c, d, e, f, g, h) (a, b, c, d, e, f', g, h) f f' #
Field6 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f', g, h, i) f f'
Instance details Defined in Control.Lens.Tuple Methods _6 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f', g, h, i) f f' #
Field6 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f', g, h, i, j) f f'
Instance details Defined in Control.Lens.Tuple Methods _6 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f', g, h, i, j) f f' #
Field6 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f', g, h, i, j, kk) f f'
Instance details Defined in Control.Lens.Tuple Methods _6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f', g, h, i, j, kk) f f' #
Field6 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f', g, h, i, j, kk, l) f f'
Instance details Defined in Control.Lens.Tuple Methods _6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f', g, h, i, j, kk, l) f f' #
Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f', g, h, i, j, kk, l, m) f f'
Instance details Defined in Control.Lens.Tuple Methods _6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f', g, h, i, j, kk, l, m) f f' #
Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n) f f'
Instance details Defined in Control.Lens.Tuple Methods _6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n) f f' #
Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o) f f'
Instance details Defined in Control.Lens.Tuple Methods _6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o) f f' #
Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p) f f'
Instance details Defined in Control.Lens.Tuple Methods _6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p) f f' #
Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q) f f'
Instance details Defined in Control.Lens.Tuple Methods _6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q) f f' #
Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q, r) f f'
Instance details Defined in Control.Lens.Tuple Methods _6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q, r) f f' #
Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q, r, s) f f'
Instance details Defined in Control.Lens.Tuple Methods _6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q, r, s) f f' #

class Field7 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_7 :: Lens s t a b #

Instances

7 <= n => Field7 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _7 :: Lens (V n a) (V n a) a a #
Field7 (a, b, c, d, e, f, g) (a, b, c, d, e, f, g') g g'
Instance details Defined in Control.Lens.Tuple Methods _7 :: Lens (a, b, c, d, e, f, g) (a, b, c, d, e, f, g') g g' #
Field7 (a, b, c, d, e, f, g, h) (a, b, c, d, e, f, g', h) g g'
Instance details Defined in Control.Lens.Tuple Methods _7 :: Lens (a, b, c, d, e, f, g, h) (a, b, c, d, e, f, g', h) g g' #
Field7 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g', h, i) g g'
Instance details Defined in Control.Lens.Tuple Methods _7 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g', h, i) g g' #
Field7 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g', h, i, j) g g'
Instance details Defined in Control.Lens.Tuple Methods _7 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g', h, i, j) g g' #
Field7 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g', h, i, j, kk) g g'
Instance details Defined in Control.Lens.Tuple Methods _7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g', h, i, j, kk) g g' #
Field7 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g', h, i, j, kk, l) g g'
Instance details Defined in Control.Lens.Tuple Methods _7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g', h, i, j, kk, l) g g' #
Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g', h, i, j, kk, l, m) g g'
Instance details Defined in Control.Lens.Tuple Methods _7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g', h, i, j, kk, l, m) g g' #
Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n) g g'
Instance details Defined in Control.Lens.Tuple Methods _7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n) g g' #
Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o) g g'
Instance details Defined in Control.Lens.Tuple Methods _7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o) g g' #
Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p) g g'
Instance details Defined in Control.Lens.Tuple Methods _7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p) g g' #
Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q) g g'
Instance details Defined in Control.Lens.Tuple Methods _7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q) g g' #
Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q, r) g g'
Instance details Defined in Control.Lens.Tuple Methods _7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q, r) g g' #
Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q, r, s) g g'
Instance details Defined in Control.Lens.Tuple Methods _7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q, r, s) g g' #

class Field8 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_8 :: Lens s t a b #

Instances

8 <= n => Field8 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _8 :: Lens (V n a) (V n a) a a #
Field8 (a, b, c, d, e, f, g, h) (a, b, c, d, e, f, g, h') h h'
Instance details Defined in Control.Lens.Tuple Methods _8 :: Lens (a, b, c, d, e, f, g, h) (a, b, c, d, e, f, g, h') h h' #
Field8 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g, h', i) h h'
Instance details Defined in Control.Lens.Tuple Methods _8 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g, h', i) h h' #
Field8 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h', i, j) h h'
Instance details Defined in Control.Lens.Tuple Methods _8 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h', i, j) h h' #
Field8 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h', i, j, kk) h h'
Instance details Defined in Control.Lens.Tuple Methods _8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h', i, j, kk) h h' #
Field8 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h', i, j, kk, l) h h'
Instance details Defined in Control.Lens.Tuple Methods _8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h', i, j, kk, l) h h' #
Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h', i, j, kk, l, m) h h'
Instance details Defined in Control.Lens.Tuple Methods _8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h', i, j, kk, l, m) h h' #
Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n) h h'
Instance details Defined in Control.Lens.Tuple Methods _8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n) h h' #
Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o) h h'
Instance details Defined in Control.Lens.Tuple Methods _8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o) h h' #
Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p) h h'
Instance details Defined in Control.Lens.Tuple Methods _8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p) h h' #
Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q) h h'
Instance details Defined in Control.Lens.Tuple Methods _8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q) h h' #
Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q, r) h h'
Instance details Defined in Control.Lens.Tuple Methods _8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q, r) h h' #
Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q, r, s) h h'
Instance details Defined in Control.Lens.Tuple Methods _8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q, r, s) h h' #

class Field9 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_9 :: Lens s t a b #

Instances

9 <= n => Field9 (V n a) (V n a) a a
Instance details Defined in Linear.V Methods _9 :: Lens (V n a) (V n a) a a #
Field9 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g, h, i') i i'
Instance details Defined in Control.Lens.Tuple Methods _9 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g, h, i') i i' #
Field9 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h, i', j) i i'
Instance details Defined in Control.Lens.Tuple Methods _9 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h, i', j) i i' #
Field9 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i', j, kk) i i'
Instance details Defined in Control.Lens.Tuple Methods _9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i', j, kk) i i' #
Field9 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i', j, kk, l) i i'
Instance details Defined in Control.Lens.Tuple Methods _9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i', j, kk, l) i i' #
Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i', j, kk, l, m) i i'
Instance details Defined in Control.Lens.Tuple Methods _9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i', j, kk, l, m) i i' #
Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n) i i'
Instance details Defined in Control.Lens.Tuple Methods _9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n) i i' #
Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o) i i'
Instance details Defined in Control.Lens.Tuple Methods _9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o) i i' #
Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p) i i'
Instance details Defined in Control.Lens.Tuple Methods _9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p) i i' #
Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q) i i'
Instance details Defined in Control.Lens.Tuple Methods _9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q) i i' #
Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q, r) i i'
Instance details Defined in Control.Lens.Tuple Methods _9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q, r) i i' #
Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q, r, s) i i'
Instance details Defined in Control.Lens.Tuple Methods _9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q, r, s) i i' #

type AReview t b = Optic' (Tagged :: Type -> Type -> Type) Identity t b #

type As (a :: k2) = Equality' a a #

type Equality (s :: k1) (t :: k2) (a :: k1) (b :: k2) = forall k3 (p :: k1 -> k3 -> Type) (f :: k2 -> k3). p a (f b) -> p s (f t) #

type Equality' (s :: k2) (a :: k2) = Equality s s a a #

type Fold s a = forall (f :: Type -> Type). (Contravariant f, Applicative f) => (a -> f a) -> s -> f s #

type Fold1 s a = forall (f :: Type -> Type). (Contravariant f, Apply f) => (a -> f a) -> s -> f s #

type Getter s a = forall (f :: Type -> Type). (Contravariant f, Functor f) => (a -> f a) -> s -> f s #

type IndexPreservingFold s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Contravariant f, Applicative f) => p a (f a) -> p s (f s) #

type IndexPreservingFold1 s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Contravariant f, Apply f) => p a (f a) -> p s (f s) #

type IndexPreservingGetter s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Contravariant f, Functor f) => p a (f a) -> p s (f s) #

type IndexPreservingLens s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Functor f) => p a (f b) -> p s (f t) #

type IndexPreservingLens' s a = IndexPreservingLens s s a a #

type IndexPreservingSetter s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Settable f) => p a (f b) -> p s (f t) #

type IndexPreservingSetter' s a = IndexPreservingSetter s s a a #

type IndexPreservingTraversal s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Applicative f) => p a (f b) -> p s (f t) #

type IndexPreservingTraversal' s a = IndexPreservingTraversal s s a a #

type IndexPreservingTraversal1 s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Apply f) => p a (f b) -> p s (f t) #

type IndexPreservingTraversal1' s a = IndexPreservingTraversal1 s s a a #

type IndexedFold i s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Contravariant f, Applicative f) => p a (f a) -> s -> f s #

type IndexedFold1 i s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Contravariant f, Apply f) => p a (f a) -> s -> f s #

type IndexedGetter i s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Contravariant f, Functor f) => p a (f a) -> s -> f s #

type IndexedLens i s t a b = forall (f :: Type -> Type) (p :: Type -> Type -> Type). (Indexable i p, Functor f) => p a (f b) -> s -> f t #

type IndexedLens' i s a = IndexedLens i s s a a #

type IndexedLensLike i (f :: k -> Type) s (t :: k) a (b :: k) = forall (p :: Type -> Type -> Type). Indexable i p => p a (f b) -> s -> f t #

type IndexedLensLike' i (f :: Type -> Type) s a = IndexedLensLike i f s s a a #

type IndexedSetter i s t a b = forall (f :: Type -> Type) (p :: Type -> Type -> Type). (Indexable i p, Settable f) => p a (f b) -> s -> f t #

type IndexedSetter' i s a = IndexedSetter i s s a a #

type IndexedTraversal i s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Applicative f) => p a (f b) -> s -> f t #

type IndexedTraversal' i s a = IndexedTraversal i s s a a #

type IndexedTraversal1 i s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Apply f) => p a (f b) -> s -> f t #

type IndexedTraversal1' i s a = IndexedTraversal1 i s s a a #

type Iso s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Profunctor p, Functor f) => p a (f b) -> p s (f t) #

type Iso' s a = Iso s s a a #

type Lens s t a b = forall (f :: Type -> Type). Functor f => (a -> f b) -> s -> f t #

type Lens' s a = Lens s s a a #

type LensLike (f :: k -> Type) s (t :: k) a (b :: k) = (a -> f b) -> s -> f t #

type LensLike' (f :: Type -> Type) s a = LensLike f s s a a #

type Optic (p :: k1 -> k -> Type) (f :: k2 -> k) (s :: k1) (t :: k2) (a :: k1) (b :: k2) = p a (f b) -> p s (f t) #

type Optic' (p :: k1 -> k -> Type) (f :: k1 -> k) (s :: k1) (a :: k1) = Optic p f s s a a #

type Optical (p :: k2 -> k -> Type) (q :: k1 -> k -> Type) (f :: k3 -> k) (s :: k1) (t :: k3) (a :: k2) (b :: k3) = p a (f b) -> q s (f t) #

type Optical' (p :: k1 -> k -> Type) (q :: k1 -> k -> Type) (f :: k1 -> k) (s :: k1) (a :: k1) = Optical p q f s s a a #

type Over (p :: k -> Type -> Type) (f :: k1 -> Type) s (t :: k1) (a :: k) (b :: k1) = p a (f b) -> s -> f t #

type Over' (p :: Type -> Type -> Type) (f :: Type -> Type) s a = Over p f s s a a #

type Prism s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Choice p, Applicative f) => p a (f b) -> p s (f t) #

type Prism' s a = Prism s s a a #

type Review t b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Choice p, Bifunctor p, Settable f) => Optic' p f t b #

type Setter s t a b = forall (f :: Type -> Type). Settable f => (a -> f b) -> s -> f t #

type Setter' s a = Setter s s a a #

type Simple (f :: k -> k -> k1 -> k1 -> k2) (s :: k) (a :: k1) = f s s a a #

type Traversal s t a b = forall (f :: Type -> Type). Applicative f => (a -> f b) -> s -> f t #

type Traversal' s a = Traversal s s a a #

type Traversal1 s t a b = forall (f :: Type -> Type). Apply f => (a -> f b) -> s -> f t #

type Traversal1' s a = Traversal1 s s a a #

class Wrapped s => Rewrapped s t #

Instances

t ~ PatternMatchFail => Rewrapped PatternMatchFail t
Instance details Defined in Control.Lens.Wrapped
t ~ RecSelError => Rewrapped RecSelError t
Instance details Defined in Control.Lens.Wrapped
t ~ RecConError => Rewrapped RecConError t
Instance details Defined in Control.Lens.Wrapped
t ~ RecUpdError => Rewrapped RecUpdError t
Instance details Defined in Control.Lens.Wrapped
t ~ NoMethodError => Rewrapped NoMethodError t
Instance details Defined in Control.Lens.Wrapped
t ~ TypeError => Rewrapped TypeError t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CDev t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CIno t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CMode t
Instance details Defined in Control.Lens.Wrapped
Rewrapped COff t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CPid t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CSsize t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CGid t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CNlink t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CUid t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CCc t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CSpeed t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CTcflag t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CRLim t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CBlkSize t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CBlkCnt t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CClockId t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CFsBlkCnt t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CFsFilCnt t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CId t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CKey t
Instance details Defined in Control.Lens.Wrapped
Rewrapped Fd t
Instance details Defined in Control.Lens.Wrapped
Rewrapped Errno t
Instance details Defined in Control.Lens.Wrapped
t ~ CompactionFailed => Rewrapped CompactionFailed t
Instance details Defined in Control.Lens.Wrapped
t ~ AssertionFailed => Rewrapped AssertionFailed t
Instance details Defined in Control.Lens.Wrapped
t ~ ErrorCall => Rewrapped ErrorCall t
Instance details Defined in Control.Lens.Wrapped
t ~ All => Rewrapped All t
Instance details Defined in Control.Lens.Wrapped
t ~ Any => Rewrapped Any t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CChar t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CSChar t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CUChar t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CShort t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CUShort t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CInt t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CUInt t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CLong t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CULong t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CLLong t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CULLong t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CBool t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CFloat t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CDouble t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CPtrdiff t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CSize t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CWchar t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CSigAtomic t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CClock t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CTime t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CUSeconds t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CSUSeconds t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CIntPtr t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CUIntPtr t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CIntMax t
Instance details Defined in Control.Lens.Wrapped
Rewrapped CUIntMax t
Instance details Defined in Control.Lens.Wrapped
t ~ IntSet => Rewrapped IntSet t
Instance details Defined in Control.Lens.Wrapped
Rewrapped Name Name
Instance details Defined in Diagrams.Core.Names
Rewrapped SegCount SegCount
Instance details Defined in Diagrams.Segment
t ~ Par1 p' => Rewrapped (Par1 p) t
Instance details Defined in Control.Lens.Wrapped
t ~ Predicate b => Rewrapped (Predicate a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Comparison b => Rewrapped (Comparison a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Equivalence b => Rewrapped (Equivalence a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Min b => Rewrapped (Min a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Max b => Rewrapped (Max a) t
Instance details Defined in Control.Lens.Wrapped
t ~ First b => Rewrapped (First a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Last b => Rewrapped (Last a) t
Instance details Defined in Control.Lens.Wrapped
t ~ WrappedMonoid b => Rewrapped (WrappedMonoid a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Option b => Rewrapped (Option a) t
Instance details Defined in Control.Lens.Wrapped
t ~ ZipList b => Rewrapped (ZipList a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Identity b => Rewrapped (Identity a) t
Instance details Defined in Control.Lens.Wrapped
t ~ First b => Rewrapped (First a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Last b => Rewrapped (Last a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Dual b => Rewrapped (Dual a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Endo b => Rewrapped (Endo a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Sum b => Rewrapped (Sum a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Product b => Rewrapped (Product a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Down b => Rewrapped (Down a) t
Instance details Defined in Control.Lens.Wrapped
t ~ NonEmpty b => Rewrapped (NonEmpty a) t
Instance details Defined in Control.Lens.Wrapped
t ~ IntMap a' => Rewrapped (IntMap a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Seq a' => Rewrapped (Seq a) t
Instance details Defined in Control.Lens.Wrapped
(t ~ Set a', Ord a) => Rewrapped (Set a) t
Instance details Defined in Control.Lens.Wrapped
(t ~ HashSet a', Hashable a, Eq a) => Rewrapped (HashSet a) t
Instance details Defined in Control.Lens.Wrapped
(Unbox a, t ~ Vector a') => Rewrapped (Vector a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Vector a' => Rewrapped (Vector a) t
Instance details Defined in Control.Lens.Wrapped
(Prim a, t ~ Vector a') => Rewrapped (Vector a) t
Instance details Defined in Control.Lens.Wrapped
(Storable a, t ~ Vector a') => Rewrapped (Vector a) t
Instance details Defined in Control.Lens.Wrapped
Active a1 ~ t => Rewrapped (Active a2) t
Instance details Defined in Data.Active
Duration n1 ~ t => Rewrapped (Duration n2) t
Instance details Defined in Data.Active
Time n1 ~ t => Rewrapped (Time n2) t
Instance details Defined in Data.Active
Clip n1 ~ t => Rewrapped (Clip n2) t
Instance details Defined in Diagrams.TwoD.Path
Rewrapped (TransInv t) (TransInv t')
Instance details Defined in Diagrams.Core.Transform
Rewrapped (ArcLength n) (ArcLength n')
Instance details Defined in Diagrams.Segment
t ~ Op a' b' => Rewrapped (Op a b) t
Instance details Defined in Control.Lens.Wrapped
t ~ WrappedMonad m' a' => Rewrapped (WrappedMonad m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ ArrowMonad m' a' => Rewrapped (ArrowMonad m a) t
Instance details Defined in Control.Lens.Wrapped
(t ~ Map k' a', Ord k) => Rewrapped (Map k a) t
Instance details Defined in Control.Lens.Wrapped
t ~ MaybeT n b => Rewrapped (MaybeT m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ ListT n b => Rewrapped (ListT m a) t
Instance details Defined in Control.Lens.Wrapped
(t ~ HashMap k' a', Hashable k, Eq k) => Rewrapped (HashMap k a) t
Instance details Defined in Control.Lens.Wrapped
t ~ CatchT m' a' => Rewrapped (CatchT m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Point g b => Rewrapped (Point f a) t
Instance details Defined in Linear.Affine
t ~ MaybeApply f' a' => Rewrapped (MaybeApply f a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Alt f' a' => Rewrapped (Alt f a) t
Instance details Defined in Control.Lens.Wrapped
t ~ CoiterT w' a' => Rewrapped (CoiterT w a) t
Instance details Defined in Control.Lens.Wrapped
t ~ IterT m' a' => Rewrapped (IterT m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ WrappedApplicative f' a' => Rewrapped (WrappedApplicative f a) t
Instance details Defined in Control.Lens.Wrapped
Rewrapped (Envelope v n) (Envelope v' n')
Instance details Defined in Diagrams.Core.Envelope
Rewrapped (Style v n) (Style v' n')
Instance details Defined in Diagrams.Core.Style
Rewrapped (Trace v n) (Trace v' n')
Instance details Defined in Diagrams.Core.Trace
Rewrapped (Path v n) (Path v' n')
Instance details Defined in Diagrams.Path
Rewrapped (TotalOffset v n) (TotalOffset v' n')
Instance details Defined in Diagrams.Segment
Rewrapped (SegTree v n) (SegTree v' n')
Instance details Defined in Diagrams.Trail
Rewrapped (Trail v n) (Trail v' n')
Instance details Defined in Diagrams.Trail
t ~ Rec1 f' p' => Rewrapped (Rec1 f p) t
Instance details Defined in Control.Lens.Wrapped
t ~ WrappedArrow a' b' c' => Rewrapped (WrappedArrow a b c) t
Instance details Defined in Control.Lens.Wrapped
t ~ Kleisli m' a' b' => Rewrapped (Kleisli m a b) t
Instance details Defined in Control.Lens.Wrapped
t ~ Const a' x' => Rewrapped (Const a x) t
Instance details Defined in Control.Lens.Wrapped
t ~ Ap g b => Rewrapped (Ap f a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Alt g b => Rewrapped (Alt f a) t
Instance details Defined in Control.Lens.Wrapped
t ~ IdentityT n b => Rewrapped (IdentityT m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ ErrorT e' m' a' => Rewrapped (ErrorT e m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ ExceptT e' m' a' => Rewrapped (ExceptT e m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ ReaderT s n b => Rewrapped (ReaderT r m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ StateT s' m' a' => Rewrapped (StateT s m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ StateT s' m' a' => Rewrapped (StateT s m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ WriterT w' m' a' => Rewrapped (WriterT w m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ WriterT w' m' a' => Rewrapped (WriterT w m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Reverse g b => Rewrapped (Reverse f a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Constant a' b' => Rewrapped (Constant a b) t
Instance details Defined in Control.Lens.Wrapped
t ~ Backwards g b => Rewrapped (Backwards f a) t
Instance details Defined in Control.Lens.Wrapped
t ~ FreeT f' m' a' => Rewrapped (FreeT f m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Join p' a' => Rewrapped (Join p a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Tagged s' a' => Rewrapped (Tagged s a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Fix p' a' => Rewrapped (Fix p a) t
Instance details Defined in Control.Lens.Wrapped
t ~ ApT f' g' a' => Rewrapped (ApT f g a) t
Instance details Defined in Control.Lens.Wrapped
t ~ CofreeT f' w' a' => Rewrapped (CofreeT f w a) t
Instance details Defined in Control.Lens.Wrapped
t ~ ComposeCF f' g' a' => Rewrapped (ComposeCF f g a) t
Instance details Defined in Control.Lens.Wrapped
t ~ ComposeFC f' g' a' => Rewrapped (ComposeFC f g a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Compose f' g' a' => Rewrapped (Compose f g a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Costar f' d' c' => Rewrapped (Costar f d c) t
Instance details Defined in Control.Lens.Wrapped
t ~ Forget r' a' b' => Rewrapped (Forget r a b) t
Instance details Defined in Control.Lens.Wrapped
t ~ Star f' d' c' => Rewrapped (Star f d c) t
Instance details Defined in Control.Lens.Wrapped
t ~ Static f' a' b' => Rewrapped (Static f a b) t
Instance details Defined in Control.Lens.Wrapped
t ~ TracedT m' w' a' => Rewrapped (TracedT m w a) t
Instance details Defined in Control.Lens.Wrapped
t ~ WrappedArrow p' a' b' => Rewrapped (WrappedArrow p a b) t
Instance details Defined in Control.Lens.Wrapped
Rewrapped (Query v a m) (Query v' a' m')
Instance details Defined in Diagrams.Core.Query
Rewrapped (Trail' Line v n) (Trail' Line v' n')
Instance details Defined in Diagrams.Trail
t ~ K1 i' c' p' => Rewrapped (K1 i c p) t
Instance details Defined in Control.Lens.Wrapped
t ~ ContT r' m' a' => Rewrapped (ContT r m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Cayley f' p' a' b' => Rewrapped (Cayley f p a b) t
Instance details Defined in Control.Lens.Wrapped
Rewrapped (QDiagram b v n m) (QDiagram b' v' n' m')
Instance details Defined in Diagrams.Core.Types
Rewrapped (SubMap b v n m) (SubMap b' v' n' m')
Instance details Defined in Diagrams.Core.Types
t ~ M1 i' c' f' p' => Rewrapped (M1 i c f p) t
Instance details Defined in Control.Lens.Wrapped
t ~ (f' :.: g') p' => Rewrapped ((f :.: g) p) t
Instance details Defined in Control.Lens.Wrapped
t ~ Compose f' g' a' => Rewrapped (Compose f g a) t
Instance details Defined in Control.Lens.Wrapped
t ~ RWST r' w' s' m' a' => Rewrapped (RWST r w s m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ RWST r' w' s' m' a' => Rewrapped (RWST r w s m a) t
Instance details Defined in Control.Lens.Wrapped
t ~ Clown f' a' b' => Rewrapped (Clown f a b) t
Instance details Defined in Control.Lens.Wrapped
t ~ Flip p' a' b' => Rewrapped (Flip p a b) t
Instance details Defined in Control.Lens.Wrapped
t ~ Joker g' a' b' => Rewrapped (Joker g a b) t
Instance details Defined in Control.Lens.Wrapped
t ~ WrappedBifunctor p' a' b' => Rewrapped (WrappedBifunctor p a b) t
Instance details Defined in Control.Lens.Wrapped
t ~ Dual k' a' b' => Rewrapped (Dual k6 a b) t
Instance details Defined in Control.Lens.Wrapped
t ~ Semi m' a' b' => Rewrapped (Semi m a b) t
Instance details Defined in Control.Lens.Wrapped
t ~ WrappedCategory k' a' b' => Rewrapped (WrappedCategory k6 a b) t
Instance details Defined in Control.Lens.Wrapped
t ~ Tannen f' p' a' b' => Rewrapped (Tannen f p a b) t
Instance details Defined in Control.Lens.Wrapped
t ~ Biff p' f' g' a' b' => Rewrapped (Biff p f g a b) t
Instance details Defined in Control.Lens.Wrapped

class (Rewrapped s t, Rewrapped t s) => Rewrapping s t #

Instances

(Rewrapped s t, Rewrapped t s) => Rewrapping s t
Instance details Defined in Control.Lens.Wrapped

class Wrapped s where #

Minimal complete definition

Nothing

Associated Types

type Unwrapped s :: Type #

Methods

_Wrapped' :: Iso' s (Unwrapped s) #

Instances

Wrapped PatternMatchFail
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped PatternMatchFail :: Type # Methods _Wrapped' :: Iso' PatternMatchFail (Unwrapped PatternMatchFail) #
Wrapped RecSelError
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped RecSelError :: Type # Methods _Wrapped' :: Iso' RecSelError (Unwrapped RecSelError) #
Wrapped RecConError
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped RecConError :: Type # Methods _Wrapped' :: Iso' RecConError (Unwrapped RecConError) #
Wrapped RecUpdError
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped RecUpdError :: Type # Methods _Wrapped' :: Iso' RecUpdError (Unwrapped RecUpdError) #
Wrapped NoMethodError
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped NoMethodError :: Type # Methods _Wrapped' :: Iso' NoMethodError (Unwrapped NoMethodError) #
Wrapped TypeError
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped TypeError :: Type # Methods _Wrapped' :: Iso' TypeError (Unwrapped TypeError) #
Wrapped CDev
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CDev :: Type # Methods _Wrapped' :: Iso' CDev (Unwrapped CDev) #
Wrapped CIno
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CIno :: Type # Methods _Wrapped' :: Iso' CIno (Unwrapped CIno) #
Wrapped CMode
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CMode :: Type # Methods _Wrapped' :: Iso' CMode (Unwrapped CMode) #
Wrapped COff
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped COff :: Type # Methods _Wrapped' :: Iso' COff (Unwrapped COff) #
Wrapped CPid
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CPid :: Type # Methods _Wrapped' :: Iso' CPid (Unwrapped CPid) #
Wrapped CSsize
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CSsize :: Type # Methods _Wrapped' :: Iso' CSsize (Unwrapped CSsize) #
Wrapped CGid
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CGid :: Type # Methods _Wrapped' :: Iso' CGid (Unwrapped CGid) #
Wrapped CNlink
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CNlink :: Type # Methods _Wrapped' :: Iso' CNlink (Unwrapped CNlink) #
Wrapped CUid
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CUid :: Type # Methods _Wrapped' :: Iso' CUid (Unwrapped CUid) #
Wrapped CCc
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CCc :: Type # Methods _Wrapped' :: Iso' CCc (Unwrapped CCc) #
Wrapped CSpeed
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CSpeed :: Type # Methods _Wrapped' :: Iso' CSpeed (Unwrapped CSpeed) #
Wrapped CTcflag
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CTcflag :: Type # Methods _Wrapped' :: Iso' CTcflag (Unwrapped CTcflag) #
Wrapped CRLim
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CRLim :: Type # Methods _Wrapped' :: Iso' CRLim (Unwrapped CRLim) #
Wrapped CBlkSize
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CBlkSize :: Type # Methods _Wrapped' :: Iso' CBlkSize (Unwrapped CBlkSize) #
Wrapped CBlkCnt
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CBlkCnt :: Type # Methods _Wrapped' :: Iso' CBlkCnt (Unwrapped CBlkCnt) #
Wrapped CClockId
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CClockId :: Type # Methods _Wrapped' :: Iso' CClockId (Unwrapped CClockId) #
Wrapped CFsBlkCnt
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CFsBlkCnt :: Type # Methods _Wrapped' :: Iso' CFsBlkCnt (Unwrapped CFsBlkCnt) #
Wrapped CFsFilCnt
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CFsFilCnt :: Type # Methods _Wrapped' :: Iso' CFsFilCnt (Unwrapped CFsFilCnt) #
Wrapped CId
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CId :: Type # Methods _Wrapped' :: Iso' CId (Unwrapped CId) #
Wrapped CKey
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CKey :: Type # Methods _Wrapped' :: Iso' CKey (Unwrapped CKey) #
Wrapped Fd
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped Fd :: Type # Methods _Wrapped' :: Iso' Fd (Unwrapped Fd) #
Wrapped Errno
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped Errno :: Type # Methods _Wrapped' :: Iso' Errno (Unwrapped Errno) #
Wrapped CompactionFailed
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CompactionFailed :: Type # Methods _Wrapped' :: Iso' CompactionFailed (Unwrapped CompactionFailed) #
Wrapped AssertionFailed
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped AssertionFailed :: Type # Methods _Wrapped' :: Iso' AssertionFailed (Unwrapped AssertionFailed) #
Wrapped ErrorCall
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped ErrorCall :: Type # Methods _Wrapped' :: Iso' ErrorCall (Unwrapped ErrorCall) #
Wrapped All
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped All :: Type # Methods _Wrapped' :: Iso' All (Unwrapped All) #
Wrapped Any
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped Any :: Type # Methods _Wrapped' :: Iso' Any (Unwrapped Any) #
Wrapped CChar
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CChar :: Type # Methods _Wrapped' :: Iso' CChar (Unwrapped CChar) #
Wrapped CSChar
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CSChar :: Type # Methods _Wrapped' :: Iso' CSChar (Unwrapped CSChar) #
Wrapped CUChar
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CUChar :: Type # Methods _Wrapped' :: Iso' CUChar (Unwrapped CUChar) #
Wrapped CShort
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CShort :: Type # Methods _Wrapped' :: Iso' CShort (Unwrapped CShort) #
Wrapped CUShort
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CUShort :: Type # Methods _Wrapped' :: Iso' CUShort (Unwrapped CUShort) #
Wrapped CInt
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CInt :: Type # Methods _Wrapped' :: Iso' CInt (Unwrapped CInt) #
Wrapped CUInt
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CUInt :: Type # Methods _Wrapped' :: Iso' CUInt (Unwrapped CUInt) #
Wrapped CLong
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CLong :: Type # Methods _Wrapped' :: Iso' CLong (Unwrapped CLong) #
Wrapped CULong
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CULong :: Type # Methods _Wrapped' :: Iso' CULong (Unwrapped CULong) #
Wrapped CLLong
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CLLong :: Type # Methods _Wrapped' :: Iso' CLLong (Unwrapped CLLong) #
Wrapped CULLong
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CULLong :: Type # Methods _Wrapped' :: Iso' CULLong (Unwrapped CULLong) #
Wrapped CBool
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CBool :: Type # Methods _Wrapped' :: Iso' CBool (Unwrapped CBool) #
Wrapped CFloat
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CFloat :: Type # Methods _Wrapped' :: Iso' CFloat (Unwrapped CFloat) #
Wrapped CDouble
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CDouble :: Type # Methods _Wrapped' :: Iso' CDouble (Unwrapped CDouble) #
Wrapped CPtrdiff
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CPtrdiff :: Type # Methods _Wrapped' :: Iso' CPtrdiff (Unwrapped CPtrdiff) #
Wrapped CSize
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CSize :: Type # Methods _Wrapped' :: Iso' CSize (Unwrapped CSize) #
Wrapped CWchar
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CWchar :: Type # Methods _Wrapped' :: Iso' CWchar (Unwrapped CWchar) #
Wrapped CSigAtomic
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CSigAtomic :: Type # Methods _Wrapped' :: Iso' CSigAtomic (Unwrapped CSigAtomic) #
Wrapped CClock
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CClock :: Type # Methods _Wrapped' :: Iso' CClock (Unwrapped CClock) #
Wrapped CTime
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CTime :: Type # Methods _Wrapped' :: Iso' CTime (Unwrapped CTime) #
Wrapped CUSeconds
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CUSeconds :: Type # Methods _Wrapped' :: Iso' CUSeconds (Unwrapped CUSeconds) #
Wrapped CSUSeconds
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CSUSeconds :: Type # Methods _Wrapped' :: Iso' CSUSeconds (Unwrapped CSUSeconds) #
Wrapped CIntPtr
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CIntPtr :: Type # Methods _Wrapped' :: Iso' CIntPtr (Unwrapped CIntPtr) #
Wrapped CUIntPtr
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CUIntPtr :: Type # Methods _Wrapped' :: Iso' CUIntPtr (Unwrapped CUIntPtr) #
Wrapped CIntMax
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CIntMax :: Type # Methods _Wrapped' :: Iso' CIntMax (Unwrapped CIntMax) #
Wrapped CUIntMax
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped CUIntMax :: Type # Methods _Wrapped' :: Iso' CUIntMax (Unwrapped CUIntMax) #
Wrapped IntSet
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped IntSet :: Type # Methods _Wrapped' :: Iso' IntSet (Unwrapped IntSet) #
Wrapped Name
Instance details Defined in Diagrams.Core.Names Associated Types type Unwrapped Name :: Type # Methods _Wrapped' :: Iso' Name (Unwrapped Name) #
Wrapped SegCount
Instance details Defined in Diagrams.Segment Associated Types type Unwrapped SegCount :: Type # Methods _Wrapped' :: Iso' SegCount (Unwrapped SegCount) #
Wrapped (Par1 p)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Par1 p) :: Type # Methods _Wrapped' :: Iso' (Par1 p) (Unwrapped (Par1 p)) #
Wrapped (Predicate a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Predicate a) :: Type # Methods _Wrapped' :: Iso' (Predicate a) (Unwrapped (Predicate a)) #
Wrapped (Comparison a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Comparison a) :: Type # Methods _Wrapped' :: Iso' (Comparison a) (Unwrapped (Comparison a)) #
Wrapped (Equivalence a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Equivalence a) :: Type # Methods _Wrapped' :: Iso' (Equivalence a) (Unwrapped (Equivalence a)) #
Wrapped (Min a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Min a) :: Type # Methods _Wrapped' :: Iso' (Min a) (Unwrapped (Min a)) #
Wrapped (Max a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Max a) :: Type # Methods _Wrapped' :: Iso' (Max a) (Unwrapped (Max a)) #
Wrapped (First a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (First a) :: Type # Methods _Wrapped' :: Iso' (First a) (Unwrapped (First a)) #
Wrapped (Last a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Last a) :: Type # Methods _Wrapped' :: Iso' (Last a) (Unwrapped (Last a)) #
Wrapped (WrappedMonoid a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (WrappedMonoid a) :: Type # Methods _Wrapped' :: Iso' (WrappedMonoid a) (Unwrapped (WrappedMonoid a)) #
Wrapped (Option a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Option a) :: Type # Methods _Wrapped' :: Iso' (Option a) (Unwrapped (Option a)) #
Wrapped (ZipList a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (ZipList a) :: Type # Methods _Wrapped' :: Iso' (ZipList a) (Unwrapped (ZipList a)) #
Wrapped (Identity a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Identity a) :: Type # Methods _Wrapped' :: Iso' (Identity a) (Unwrapped (Identity a)) #
Wrapped (First a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (First a) :: Type # Methods _Wrapped' :: Iso' (First a) (Unwrapped (First a)) #
Wrapped (Last a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Last a) :: Type # Methods _Wrapped' :: Iso' (Last a) (Unwrapped (Last a)) #
Wrapped (Dual a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Dual a) :: Type # Methods _Wrapped' :: Iso' (Dual a) (Unwrapped (Dual a)) #
Wrapped (Endo a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Endo a) :: Type # Methods _Wrapped' :: Iso' (Endo a) (Unwrapped (Endo a)) #
Wrapped (Sum a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Sum a) :: Type # Methods _Wrapped' :: Iso' (Sum a) (Unwrapped (Sum a)) #
Wrapped (Product a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Product a) :: Type # Methods _Wrapped' :: Iso' (Product a) (Unwrapped (Product a)) #
Wrapped (Down a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Down a) :: Type # Methods _Wrapped' :: Iso' (Down a) (Unwrapped (Down a)) #
Wrapped (NonEmpty a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (NonEmpty a) :: Type # Methods _Wrapped' :: Iso' (NonEmpty a) (Unwrapped (NonEmpty a)) #
Wrapped (IntMap a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (IntMap a) :: Type # Methods _Wrapped' :: Iso' (IntMap a) (Unwrapped (IntMap a)) #
Wrapped (Seq a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Seq a) :: Type # Methods _Wrapped' :: Iso' (Seq a) (Unwrapped (Seq a)) #
Ord a => Wrapped (Set a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Set a) :: Type # Methods _Wrapped' :: Iso' (Set a) (Unwrapped (Set a)) #
(Hashable a, Eq a) => Wrapped (HashSet a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (HashSet a) :: Type # Methods _Wrapped' :: Iso' (HashSet a) (Unwrapped (HashSet a)) #
Unbox a => Wrapped (Vector a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Vector a) :: Type # Methods _Wrapped' :: Iso' (Vector a) (Unwrapped (Vector a)) #
Wrapped (Vector a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Vector a) :: Type # Methods _Wrapped' :: Iso' (Vector a) (Unwrapped (Vector a)) #
Prim a => Wrapped (Vector a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Vector a) :: Type # Methods _Wrapped' :: Iso' (Vector a) (Unwrapped (Vector a)) #
Storable a => Wrapped (Vector a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Vector a) :: Type # Methods _Wrapped' :: Iso' (Vector a) (Unwrapped (Vector a)) #
Wrapped (Active a)
Instance details Defined in Data.Active Associated Types type Unwrapped (Active a) :: Type # Methods _Wrapped' :: Iso' (Active a) (Unwrapped (Active a)) #
Wrapped (Duration n)
Instance details Defined in Data.Active Associated Types type Unwrapped (Duration n) :: Type # Methods _Wrapped' :: Iso' (Duration n) (Unwrapped (Duration n)) #
Wrapped (Time n)
Instance details Defined in Data.Active Associated Types type Unwrapped (Time n) :: Type # Methods _Wrapped' :: Iso' (Time n) (Unwrapped (Time n)) #
Wrapped (TransInv t)
Instance details Defined in Diagrams.Core.Transform Associated Types type Unwrapped (TransInv t) :: Type # Methods _Wrapped' :: Iso' (TransInv t) (Unwrapped (TransInv t)) #
Wrapped (ArcLength n)
Instance details Defined in Diagrams.Segment Associated Types type Unwrapped (ArcLength n) :: Type # Methods _Wrapped' :: Iso' (ArcLength n) (Unwrapped (ArcLength n)) #
Wrapped (Clip n)
Instance details Defined in Diagrams.TwoD.Path Associated Types type Unwrapped (Clip n) :: Type # Methods _Wrapped' :: Iso' (Clip n) (Unwrapped (Clip n)) #
Wrapped (Op a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Op a b) :: Type # Methods _Wrapped' :: Iso' (Op a b) (Unwrapped (Op a b)) #
Wrapped (WrappedMonad m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (WrappedMonad m a) :: Type # Methods _Wrapped' :: Iso' (WrappedMonad m a) (Unwrapped (WrappedMonad m a)) #
Wrapped (ArrowMonad m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (ArrowMonad m a) :: Type # Methods _Wrapped' :: Iso' (ArrowMonad m a) (Unwrapped (ArrowMonad m a)) #
Ord k => Wrapped (Map k a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Map k a) :: Type # Methods _Wrapped' :: Iso' (Map k a) (Unwrapped (Map k a)) #
Wrapped (MaybeT m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (MaybeT m a) :: Type # Methods _Wrapped' :: Iso' (MaybeT m a) (Unwrapped (MaybeT m a)) #
Wrapped (ListT m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (ListT m a) :: Type # Methods _Wrapped' :: Iso' (ListT m a) (Unwrapped (ListT m a)) #
(Hashable k, Eq k) => Wrapped (HashMap k a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (HashMap k a) :: Type # Methods _Wrapped' :: Iso' (HashMap k a) (Unwrapped (HashMap k a)) #
Wrapped (CatchT m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (CatchT m a) :: Type # Methods _Wrapped' :: Iso' (CatchT m a) (Unwrapped (CatchT m a)) #
Wrapped (Envelope v n)
Instance details Defined in Diagrams.Core.Envelope Associated Types type Unwrapped (Envelope v n) :: Type # Methods _Wrapped' :: Iso' (Envelope v n) (Unwrapped (Envelope v n)) #
Wrapped (Style v n)
Instance details Defined in Diagrams.Core.Style Associated Types type Unwrapped (Style v n) :: Type # Methods _Wrapped' :: Iso' (Style v n) (Unwrapped (Style v n)) #
Wrapped (Trace v n)
Instance details Defined in Diagrams.Core.Trace Associated Types type Unwrapped (Trace v n) :: Type # Methods _Wrapped' :: Iso' (Trace v n) (Unwrapped (Trace v n)) #
Wrapped (Path v n)
Instance details Defined in Diagrams.Path Associated Types type Unwrapped (Path v n) :: Type # Methods _Wrapped' :: Iso' (Path v n) (Unwrapped (Path v n)) #
Wrapped (TotalOffset v n)
Instance details Defined in Diagrams.Segment Associated Types type Unwrapped (TotalOffset v n) :: Type # Methods _Wrapped' :: Iso' (TotalOffset v n) (Unwrapped (TotalOffset v n)) #
Wrapped (SegTree v n)
Instance details Defined in Diagrams.Trail Associated Types type Unwrapped (SegTree v n) :: Type # Methods _Wrapped' :: Iso' (SegTree v n) (Unwrapped (SegTree v n)) #
Wrapped (Trail v n)
Instance details Defined in Diagrams.Trail Associated Types type Unwrapped (Trail v n) :: Type # Methods _Wrapped' :: Iso' (Trail v n) (Unwrapped (Trail v n)) #
Wrapped (Point f a)
Instance details Defined in Linear.Affine Associated Types type Unwrapped (Point f a) :: Type # Methods _Wrapped' :: Iso' (Point f a) (Unwrapped (Point f a)) #
Wrapped (MaybeApply f a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (MaybeApply f a) :: Type # Methods _Wrapped' :: Iso' (MaybeApply f a) (Unwrapped (MaybeApply f a)) #
Wrapped (Alt f a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Alt f a) :: Type # Methods _Wrapped' :: Iso' (Alt f a) (Unwrapped (Alt f a)) #
Wrapped (CoiterT w a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (CoiterT w a) :: Type # Methods _Wrapped' :: Iso' (CoiterT w a) (Unwrapped (CoiterT w a)) #
Wrapped (IterT m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (IterT m a) :: Type # Methods _Wrapped' :: Iso' (IterT m a) (Unwrapped (IterT m a)) #
Wrapped (WrappedApplicative f a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (WrappedApplicative f a) :: Type # Methods _Wrapped' :: Iso' (WrappedApplicative f a) (Unwrapped (WrappedApplicative f a)) #
Wrapped (Rec1 f p)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Rec1 f p) :: Type # Methods _Wrapped' :: Iso' (Rec1 f p) (Unwrapped (Rec1 f p)) #
Wrapped (WrappedArrow a b c)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (WrappedArrow a b c) :: Type # Methods _Wrapped' :: Iso' (WrappedArrow a b c) (Unwrapped (WrappedArrow a b c)) #
Wrapped (Kleisli m a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Kleisli m a b) :: Type # Methods _Wrapped' :: Iso' (Kleisli m a b) (Unwrapped (Kleisli m a b)) #
Wrapped (Const a x)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Const a x) :: Type # Methods _Wrapped' :: Iso' (Const a x) (Unwrapped (Const a x)) #
Wrapped (Ap f a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Ap f a) :: Type # Methods _Wrapped' :: Iso' (Ap f a) (Unwrapped (Ap f a)) #
Wrapped (Alt f a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Alt f a) :: Type # Methods _Wrapped' :: Iso' (Alt f a) (Unwrapped (Alt f a)) #
Wrapped (IdentityT m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (IdentityT m a) :: Type # Methods _Wrapped' :: Iso' (IdentityT m a) (Unwrapped (IdentityT m a)) #
Wrapped (ErrorT e m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (ErrorT e m a) :: Type # Methods _Wrapped' :: Iso' (ErrorT e m a) (Unwrapped (ErrorT e m a)) #
Wrapped (ExceptT e m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (ExceptT e m a) :: Type # Methods _Wrapped' :: Iso' (ExceptT e m a) (Unwrapped (ExceptT e m a)) #
Wrapped (ReaderT r m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (ReaderT r m a) :: Type # Methods _Wrapped' :: Iso' (ReaderT r m a) (Unwrapped (ReaderT r m a)) #
Wrapped (StateT s m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (StateT s m a) :: Type # Methods _Wrapped' :: Iso' (StateT s m a) (Unwrapped (StateT s m a)) #
Wrapped (StateT s m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (StateT s m a) :: Type # Methods _Wrapped' :: Iso' (StateT s m a) (Unwrapped (StateT s m a)) #
Wrapped (WriterT w m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (WriterT w m a) :: Type # Methods _Wrapped' :: Iso' (WriterT w m a) (Unwrapped (WriterT w m a)) #
Wrapped (WriterT w m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (WriterT w m a) :: Type # Methods _Wrapped' :: Iso' (WriterT w m a) (Unwrapped (WriterT w m a)) #
Wrapped (Reverse f a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Reverse f a) :: Type # Methods _Wrapped' :: Iso' (Reverse f a) (Unwrapped (Reverse f a)) #
Wrapped (Constant a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Constant a b) :: Type # Methods _Wrapped' :: Iso' (Constant a b) (Unwrapped (Constant a b)) #
Wrapped (Backwards f a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Backwards f a) :: Type # Methods _Wrapped' :: Iso' (Backwards f a) (Unwrapped (Backwards f a)) #
Wrapped (FreeT f m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (FreeT f m a) :: Type # Methods _Wrapped' :: Iso' (FreeT f m a) (Unwrapped (FreeT f m a)) #
Wrapped (Join p a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Join p a) :: Type # Methods _Wrapped' :: Iso' (Join p a) (Unwrapped (Join p a)) #
Wrapped (Tagged s a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Tagged s a) :: Type # Methods _Wrapped' :: Iso' (Tagged s a) (Unwrapped (Tagged s a)) #
Wrapped (Query v n m)
Instance details Defined in Diagrams.Core.Query Associated Types type Unwrapped (Query v n m) :: Type # Methods _Wrapped' :: Iso' (Query v n m) (Unwrapped (Query v n m)) #
Wrapped (Trail' Line v n)
Instance details Defined in Diagrams.Trail Associated Types type Unwrapped (Trail' Line v n) :: Type # Methods _Wrapped' :: Iso' (Trail' Line v n) (Unwrapped (Trail' Line v n)) #
Wrapped (Fix p a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Fix p a) :: Type # Methods _Wrapped' :: Iso' (Fix p a) (Unwrapped (Fix p a)) #
Wrapped (ApT f g a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (ApT f g a) :: Type # Methods _Wrapped' :: Iso' (ApT f g a) (Unwrapped (ApT f g a)) #
Wrapped (CofreeT f w a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (CofreeT f w a) :: Type # Methods _Wrapped' :: Iso' (CofreeT f w a) (Unwrapped (CofreeT f w a)) #
Wrapped (ComposeCF f g a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (ComposeCF f g a) :: Type # Methods _Wrapped' :: Iso' (ComposeCF f g a) (Unwrapped (ComposeCF f g a)) #
Wrapped (ComposeFC f g a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (ComposeFC f g a) :: Type # Methods _Wrapped' :: Iso' (ComposeFC f g a) (Unwrapped (ComposeFC f g a)) #
Wrapped (Compose f g a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Compose f g a) :: Type # Methods _Wrapped' :: Iso' (Compose f g a) (Unwrapped (Compose f g a)) #
Wrapped (Costar f d c)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Costar f d c) :: Type # Methods _Wrapped' :: Iso' (Costar f d c) (Unwrapped (Costar f d c)) #
Wrapped (Forget r a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Forget r a b) :: Type # Methods _Wrapped' :: Iso' (Forget r a b) (Unwrapped (Forget r a b)) #
Wrapped (Star f d c)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Star f d c) :: Type # Methods _Wrapped' :: Iso' (Star f d c) (Unwrapped (Star f d c)) #
Wrapped (Static f a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Static f a b) :: Type # Methods _Wrapped' :: Iso' (Static f a b) (Unwrapped (Static f a b)) #
Wrapped (TracedT m w a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (TracedT m w a) :: Type # Methods _Wrapped' :: Iso' (TracedT m w a) (Unwrapped (TracedT m w a)) #
Wrapped (WrappedArrow p a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (WrappedArrow p a b) :: Type # Methods _Wrapped' :: Iso' (WrappedArrow p a b) (Unwrapped (WrappedArrow p a b)) #
Wrapped (K1 i c p)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (K1 i c p) :: Type # Methods _Wrapped' :: Iso' (K1 i c p) (Unwrapped (K1 i c p)) #
Wrapped (ContT r m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (ContT r m a) :: Type # Methods _Wrapped' :: Iso' (ContT r m a) (Unwrapped (ContT r m a)) #
Wrapped (QDiagram b v n m)
Instance details Defined in Diagrams.Core.Types Associated Types type Unwrapped (QDiagram b v n m) :: Type # Methods _Wrapped' :: Iso' (QDiagram b v n m) (Unwrapped (QDiagram b v n m)) #
Wrapped (SubMap b v n m)
Instance details Defined in Diagrams.Core.Types Associated Types type Unwrapped (SubMap b v n m) :: Type # Methods _Wrapped' :: Iso' (SubMap b v n m) (Unwrapped (SubMap b v n m)) #
Wrapped (Cayley f p a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Cayley f p a b) :: Type # Methods _Wrapped' :: Iso' (Cayley f p a b) (Unwrapped (Cayley f p a b)) #
Wrapped (M1 i c f p)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (M1 i c f p) :: Type # Methods _Wrapped' :: Iso' (M1 i c f p) (Unwrapped (M1 i c f p)) #
Wrapped ((f :.: g) p)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped ((f :.: g) p) :: Type # Methods _Wrapped' :: Iso' ((f :.: g) p) (Unwrapped ((f :.: g) p)) #
Wrapped (Compose f g a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Compose f g a) :: Type # Methods _Wrapped' :: Iso' (Compose f g a) (Unwrapped (Compose f g a)) #
Wrapped (RWST r w s m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (RWST r w s m a) :: Type # Methods _Wrapped' :: Iso' (RWST r w s m a) (Unwrapped (RWST r w s m a)) #
Wrapped (RWST r w s m a)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (RWST r w s m a) :: Type # Methods _Wrapped' :: Iso' (RWST r w s m a) (Unwrapped (RWST r w s m a)) #
Wrapped (Clown f a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Clown f a b) :: Type # Methods _Wrapped' :: Iso' (Clown f a b) (Unwrapped (Clown f a b)) #
Wrapped (Flip p a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Flip p a b) :: Type # Methods _Wrapped' :: Iso' (Flip p a b) (Unwrapped (Flip p a b)) #
Wrapped (Joker g a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Joker g a b) :: Type # Methods _Wrapped' :: Iso' (Joker g a b) (Unwrapped (Joker g a b)) #
Wrapped (WrappedBifunctor p a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (WrappedBifunctor p a b) :: Type # Methods _Wrapped' :: Iso' (WrappedBifunctor p a b) (Unwrapped (WrappedBifunctor p a b)) #
Wrapped (Dual k3 a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Dual k3 a b) :: Type # Methods _Wrapped' :: Iso' (Dual k3 a b) (Unwrapped (Dual k3 a b)) #
Wrapped (Semi m a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Semi m a b) :: Type # Methods _Wrapped' :: Iso' (Semi m a b) (Unwrapped (Semi m a b)) #
Wrapped (WrappedCategory k3 a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (WrappedCategory k3 a b) :: Type # Methods _Wrapped' :: Iso' (WrappedCategory k3 a b) (Unwrapped (WrappedCategory k3 a b)) #
Wrapped (Tannen f p a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Tannen f p a b) :: Type # Methods _Wrapped' :: Iso' (Tannen f p a b) (Unwrapped (Tannen f p a b)) #
Wrapped (Biff p f g a b)
Instance details Defined in Control.Lens.Wrapped Associated Types type Unwrapped (Biff p f g a b) :: Type # Methods _Wrapped' :: Iso' (Biff p f g a b) (Unwrapped (Biff p f g a b)) #

type family Magnified (m :: Type -> Type) :: Type -> Type -> Type #

Instances

type Magnified (IdentityT m)
Instance details Defined in Control.Lens.Zoom type Magnified (IdentityT m) = Magnified m
type Magnified (ReaderT b m)
Instance details Defined in Control.Lens.Zoom type Magnified (ReaderT b m) = Effect m
type Magnified ((->) b :: Type -> Type)
Instance details Defined in Control.Lens.Zoom type Magnified ((->) b :: Type -> Type) = (Const :: Type -> Type -> Type)
type Magnified (RWST a w s m)
Instance details Defined in Control.Lens.Zoom type Magnified (RWST a w s m) = EffectRWS w s m
type Magnified (RWST a w s m)
Instance details Defined in Control.Lens.Zoom type Magnified (RWST a w s m) = EffectRWS w s m

class (Magnified m ~ Magnified n, MonadReader b m, MonadReader a n) => Magnify (m :: Type -> Type) (n :: Type -> Type) b a | m -> b, n -> a, m a -> n, n b -> m where #

Methods

magnify :: LensLike' (Magnified m c) a b -> m c -> n c #

Instances

Magnify m n b a => Magnify (IdentityT m) (IdentityT n) b a
Instance details Defined in Control.Lens.Zoom Methods magnify :: LensLike' (Magnified (IdentityT m) c) a b -> IdentityT m c -> IdentityT n c #
Monad m => Magnify (ReaderT b m) (ReaderT a m) b a
Instance details Defined in Control.Lens.Zoom Methods magnify :: LensLike' (Magnified (ReaderT b m) c) a b -> ReaderT b m c -> ReaderT a m c #
Magnify ((->) b :: Type -> Type) ((->) a :: Type -> Type) b a
Instance details Defined in Control.Lens.Zoom Methods magnify :: LensLike' (Magnified ((->) b) c) a b -> (b -> c) -> a -> c #
(Monad m, Monoid w) => Magnify (RWST b w s m) (RWST a w s m) b a
Instance details Defined in Control.Lens.Zoom Methods magnify :: LensLike' (Magnified (RWST b w s m) c) a b -> RWST b w s m c -> RWST a w s m c #
(Monad m, Monoid w) => Magnify (RWST b w s m) (RWST a w s m) b a
Instance details Defined in Control.Lens.Zoom Methods magnify :: LensLike' (Magnified (RWST b w s m) c) a b -> RWST b w s m c -> RWST a w s m c #

class (MonadState s m, MonadState t n) => Zoom (m :: Type -> Type) (n :: Type -> Type) s t | m -> s, n -> t, m t -> n, n s -> m where #

Methods

zoom :: LensLike' (Zoomed m c) t s -> m c -> n c #

Instances

Zoom m n s t => Zoom (MaybeT m) (MaybeT n) s t
Instance details Defined in Control.Lens.Zoom Methods zoom :: LensLike' (Zoomed (MaybeT m) c) t s -> MaybeT m c -> MaybeT n c #
Zoom m n s t => Zoom (ListT m) (ListT n) s t
Instance details Defined in Control.Lens.Zoom Methods zoom :: LensLike' (Zoomed (ListT m) c) t s -> ListT m c -> ListT n c #
Zoom m n s t => Zoom (IdentityT m) (IdentityT n) s t
Instance details Defined in Control.Lens.Zoom Methods zoom :: LensLike' (Zoomed (IdentityT m) c) t s -> IdentityT m c -> IdentityT n c #
(Error e, Zoom m n s t) => Zoom (ErrorT e m) (ErrorT e n) s t
Instance details Defined in Control.Lens.Zoom Methods zoom :: LensLike' (Zoomed (ErrorT e m) c) t s -> ErrorT e m c -> ErrorT e n c #
Zoom m n s t => Zoom (ExceptT e m) (ExceptT e n) s t
Instance details Defined in Control.Lens.Zoom Methods zoom :: LensLike' (Zoomed (ExceptT e m) c) t s -> ExceptT e m c -> ExceptT e n c #
Zoom m n s t => Zoom (ReaderT e m) (ReaderT e n) s t
Instance details Defined in Control.Lens.Zoom Methods zoom :: LensLike' (Zoomed (ReaderT e m) c) t s -> ReaderT e m c -> ReaderT e n c #
Monad z => Zoom (StateT s z) (StateT t z) s t
Instance details Defined in Control.Lens.Zoom Methods zoom :: LensLike' (Zoomed (StateT s z) c) t s -> StateT s z c -> StateT t z c #
Monad z => Zoom (StateT s z) (StateT t z) s t
Instance details Defined in Control.Lens.Zoom Methods zoom :: LensLike' (Zoomed (StateT s z) c) t s -> StateT s z c -> StateT t z c #
(Monoid w, Zoom m n s t) => Zoom (WriterT w m) (WriterT w n) s t
Instance details Defined in Control.Lens.Zoom Methods zoom :: LensLike' (Zoomed (WriterT w m) c) t s -> WriterT w m c -> WriterT w n c #
(Monoid w, Zoom m n s t) => Zoom (WriterT w m) (WriterT w n) s t
Instance details Defined in Control.Lens.Zoom Methods zoom :: LensLike' (Zoomed (WriterT w m) c) t s -> WriterT w m c -> WriterT w n c #
(Functor f, Zoom m n s t) => Zoom (FreeT f m) (FreeT f n) s t
Instance details Defined in Control.Lens.Zoom Methods zoom :: LensLike' (Zoomed (FreeT f m) c) t s -> FreeT f m c -> FreeT f n c #
(Monoid w, Monad z) => Zoom (RWST r w s z) (RWST r w t z) s t
Instance details Defined in Control.Lens.Zoom Methods zoom :: LensLike' (Zoomed (RWST r w s z) c) t s -> RWST r w s z c -> RWST r w t z c #
(Monoid w, Monad z) => Zoom (RWST r w s z) (RWST r w t z) s t
Instance details Defined in Control.Lens.Zoom Methods zoom :: LensLike' (Zoomed (RWST r w s z) c) t s -> RWST r w s z c -> RWST r w t z c #

type family Zoomed (m :: Type -> Type) :: Type -> Type -> Type #

Instances

type Zoomed (MaybeT m)
Instance details Defined in Control.Lens.Zoom type Zoomed (MaybeT m) = FocusingMay (Zoomed m)
type Zoomed (ListT m)
Instance details Defined in Control.Lens.Zoom type Zoomed (ListT m) = FocusingOn [] (Zoomed m)
type Zoomed (IdentityT m)
Instance details Defined in Control.Lens.Zoom type Zoomed (IdentityT m) = Zoomed m
type Zoomed (ErrorT e m)
Instance details Defined in Control.Lens.Zoom type Zoomed (ErrorT e m) = FocusingErr e (Zoomed m)
type Zoomed (ExceptT e m)
Instance details Defined in Control.Lens.Zoom type Zoomed (ExceptT e m) = FocusingErr e (Zoomed m)
type Zoomed (ReaderT e m)
Instance details Defined in Control.Lens.Zoom type Zoomed (ReaderT e m) = Zoomed m
type Zoomed (StateT s z)
Instance details Defined in Control.Lens.Zoom type Zoomed (StateT s z) = Focusing z
type Zoomed (StateT s z)
Instance details Defined in Control.Lens.Zoom type Zoomed (StateT s z) = Focusing z
type Zoomed (WriterT w m)
Instance details Defined in Control.Lens.Zoom type Zoomed (WriterT w m) = FocusingPlus w (Zoomed m)
type Zoomed (WriterT w m)
Instance details Defined in Control.Lens.Zoom type Zoomed (WriterT w m) = FocusingPlus w (Zoomed m)
type Zoomed (FreeT f m)
Instance details Defined in Control.Lens.Zoom type Zoomed (FreeT f m) = FocusingFree f m (Zoomed m)
type Zoomed (RWST r w s z)
Instance details Defined in Control.Lens.Zoom type Zoomed (RWST r w s z) = FocusingWith w z
type Zoomed (RWST r w s z)
Instance details Defined in Control.Lens.Zoom type Zoomed (RWST r w s z) = FocusingWith w z

type Monoid' = Monoid #

class Profunctor p => Choice (p :: Type -> Type -> Type) where #

Minimal complete definition

left' | right'

Methods

left' :: p a b -> p (Either a c) (Either b c) #

right' :: p a b -> p (Either c a) (Either c b) #

Instances

Choice ReifiedFold
Instance details Defined in Control.Lens.Reified Methods left' :: ReifiedFold a b -> ReifiedFold (Either a c) (Either b c) # right' :: ReifiedFold a b -> ReifiedFold (Either c a) (Either c b) #
Choice ReifiedGetter
Instance details Defined in Control.Lens.Reified Methods left' :: ReifiedGetter a b -> ReifiedGetter (Either a c) (Either b c) # right' :: ReifiedGetter a b -> ReifiedGetter (Either c a) (Either c b) #
Monad m => Choice (Kleisli m)
Instance details Defined in Data.Profunctor.Choice Methods left' :: Kleisli m a b -> Kleisli m (Either a c) (Either b c) # right' :: Kleisli m a b -> Kleisli m (Either c a) (Either c b) #
Choice (Tagged :: Type -> Type -> Type)
Instance details Defined in Data.Profunctor.Choice Methods left' :: Tagged a b -> Tagged (Either a c) (Either b c) # right' :: Tagged a b -> Tagged (Either c a) (Either c b) #
Choice (Indexed i)
Instance details Defined in Control.Lens.Internal.Indexed Methods left' :: Indexed i a b -> Indexed i (Either a c) (Either b c) # right' :: Indexed i a b -> Indexed i (Either c a) (Either c b) #
Traversable w => Choice (Costar w)
Instance details Defined in Data.Profunctor.Choice Methods left' :: Costar w a b -> Costar w (Either a c) (Either b c) # right' :: Costar w a b -> Costar w (Either c a) (Either c b) #
Monoid r => Choice (Forget r)
Instance details Defined in Data.Profunctor.Choice Methods left' :: Forget r a b -> Forget r (Either a c) (Either b c) # right' :: Forget r a b -> Forget r (Either c a) (Either c b) #
Applicative f => Choice (Star f)
Instance details Defined in Data.Profunctor.Choice Methods left' :: Star f a b -> Star f (Either a c) (Either b c) # right' :: Star f a b -> Star f (Either c a) (Either c b) #
ArrowChoice p => Choice (WrappedArrow p)
Instance details Defined in Data.Profunctor.Choice Methods left' :: WrappedArrow p a b -> WrappedArrow p (Either a c) (Either b c) # right' :: WrappedArrow p a b -> WrappedArrow p (Either c a) (Either c b) #
Choice (PastroSum p)
Instance details Defined in Data.Profunctor.Choice Methods left' :: PastroSum p a b -> PastroSum p (Either a c) (Either b c) # right' :: PastroSum p a b -> PastroSum p (Either c a) (Either c b) #
Profunctor p => Choice (TambaraSum p)
Instance details Defined in Data.Profunctor.Choice Methods left' :: TambaraSum p a b -> TambaraSum p (Either a c) (Either b c) # right' :: TambaraSum p a b -> TambaraSum p (Either c a) (Either c b) #
Choice p => Choice (Tambara p)
Instance details Defined in Data.Profunctor.Choice Methods left' :: Tambara p a b -> Tambara p (Either a c) (Either b c) # right' :: Tambara p a b -> Tambara p (Either c a) (Either c b) #
Choice ((->) :: Type -> Type -> Type)
Instance details Defined in Data.Profunctor.Choice Methods left' :: (a -> b) -> Either a c -> Either b c # right' :: (a -> b) -> Either c a -> Either c b #
(Choice p, Choice q) => Choice (Procompose p q)
Instance details Defined in Data.Profunctor.Composition Methods left' :: Procompose p q a b -> Procompose p q (Either a c) (Either b c) # right' :: Procompose p q a b -> Procompose p q (Either c a) (Either c b) #
Comonad w => Choice (Cokleisli w)
Instance details Defined in Data.Profunctor.Choice Methods left' :: Cokleisli w a b -> Cokleisli w (Either a c) (Either b c) # right' :: Cokleisli w a b -> Cokleisli w (Either c a) (Either c b) #
Functor f => Choice (Joker f :: Type -> Type -> Type)
Instance details Defined in Data.Profunctor.Choice Methods left' :: Joker f a b -> Joker f (Either a c) (Either b c) # right' :: Joker f a b -> Joker f (Either c a) (Either c b) #
(Choice p, Choice q) => Choice (Product p q)
Instance details Defined in Data.Profunctor.Choice Methods left' :: Product p q a b -> Product p q (Either a c) (Either b c) # right' :: Product p q a b -> Product p q (Either c a) (Either c b) #
(Functor f, Choice p) => Choice (Tannen f p)
Instance details Defined in Data.Profunctor.Choice Methods left' :: Tannen f p a b -> Tannen f p (Either a c) (Either b c) # right' :: Tannen f p a b -> Tannen f p (Either c a) (Either c b) #

class (Foldable1 t, Traversable t) => Traversable1 (t :: Type -> Type) where #

Minimal complete definition

traverse1 | sequence1

Methods

traverse1 :: Apply f => (a -> f b) -> t a -> f (t b) #

Instances

Traversable1 Par1
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Par1 a -> f (Par1 b) # sequence1 :: Apply f => Par1 (f b) -> f (Par1 b)
Traversable1 Complex
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Complex a -> f (Complex b) # sequence1 :: Apply f => Complex (f b) -> f (Complex b)
Traversable1 Min
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Min a -> f (Min b) # sequence1 :: Apply f => Min (f b) -> f (Min b)
Traversable1 Max
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Max a -> f (Max b) # sequence1 :: Apply f => Max (f b) -> f (Max b)
Traversable1 First
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> First a -> f (First b) # sequence1 :: Apply f => First (f b) -> f (First b)
Traversable1 Last
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Last a -> f (Last b) # sequence1 :: Apply f => Last (f b) -> f (Last b)
Traversable1 Identity
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Identity a -> f (Identity b) # sequence1 :: Apply f => Identity (f b) -> f (Identity b)
Traversable1 Dual
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Dual a -> f (Dual b) # sequence1 :: Apply f => Dual (f b) -> f (Dual b)
Traversable1 Sum
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Sum a -> f (Sum b) # sequence1 :: Apply f => Sum (f b) -> f (Sum b)
Traversable1 Product
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Product a -> f (Product b) # sequence1 :: Apply f => Product (f b) -> f (Product b)
Traversable1 NonEmpty
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> NonEmpty a -> f (NonEmpty b) # sequence1 :: Apply f => NonEmpty (f b) -> f (NonEmpty b)
Traversable1 Tree
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Tree a -> f (Tree b) # sequence1 :: Apply f => Tree (f b) -> f (Tree b)
Traversable1 V2
Instance details Defined in Linear.V2 Methods traverse1 :: Apply f => (a -> f b) -> V2 a -> f (V2 b) # sequence1 :: Apply f => V2 (f b) -> f (V2 b)
Traversable1 V3
Instance details Defined in Linear.V3 Methods traverse1 :: Apply f => (a -> f b) -> V3 a -> f (V3 b) # sequence1 :: Apply f => V3 (f b) -> f (V3 b)
Traversable1 V4
Instance details Defined in Linear.V4 Methods traverse1 :: Apply f => (a -> f b) -> V4 a -> f (V4 b) # sequence1 :: Apply f => V4 (f b) -> f (V4 b)
Traversable1 V1
Instance details Defined in Linear.V1 Methods traverse1 :: Apply f => (a -> f b) -> V1 a -> f (V1 b) # sequence1 :: Apply f => V1 (f b) -> f (V1 b)
Traversable1 Plucker
Instance details Defined in Linear.Plucker Methods traverse1 :: Apply f => (a -> f b) -> Plucker a -> f (Plucker b) # sequence1 :: Apply f => Plucker (f b) -> f (Plucker b)
Traversable1 (V1 :: Type -> Type)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> V1 a -> f (V1 b) # sequence1 :: Apply f => V1 (f b) -> f (V1 b)
Traversable1 ((,) a)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a0 -> f b) -> (a, a0) -> f (a, b) # sequence1 :: Apply f => (a, f b) -> f (a, b)
Traversable1 f => Traversable1 (Lift f)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f0 => (a -> f0 b) -> Lift f a -> f0 (Lift f b) # sequence1 :: Apply f0 => Lift f (f0 b) -> f0 (Lift f b)
Traversable1 f => Traversable1 (Cofree f)
Instance details Defined in Control.Comonad.Cofree Methods traverse1 :: Apply f0 => (a -> f0 b) -> Cofree f a -> f0 (Cofree f b) # sequence1 :: Apply f0 => Cofree f (f0 b) -> f0 (Cofree f b)
Traversable1 f => Traversable1 (Free f)
Instance details Defined in Control.Monad.Free Methods traverse1 :: Apply f0 => (a -> f0 b) -> Free f a -> f0 (Free f b) # sequence1 :: Apply f0 => Free f (f0 b) -> f0 (Free f b)
Traversable1 f => Traversable1 (Yoneda f)
Instance details Defined in Data.Functor.Yoneda Methods traverse1 :: Apply f0 => (a -> f0 b) -> Yoneda f a -> f0 (Yoneda f b) # sequence1 :: Apply f0 => Yoneda f (f0 b) -> f0 (Yoneda f b)
Traversable1 f => Traversable1 (Rec1 f)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f0 => (a -> f0 b) -> Rec1 f a -> f0 (Rec1 f b) # sequence1 :: Apply f0 => Rec1 f (f0 b) -> f0 (Rec1 f b)
Traversable1 f => Traversable1 (Alt f)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f0 => (a -> f0 b) -> Alt f a -> f0 (Alt f b) # sequence1 :: Apply f0 => Alt f (f0 b) -> f0 (Alt f b)
Traversable1 f => Traversable1 (IdentityT f)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f0 => (a -> f0 b) -> IdentityT f a -> f0 (IdentityT f b) # sequence1 :: Apply f0 => IdentityT f (f0 b) -> f0 (IdentityT f b)
Traversable1 f => Traversable1 (Reverse f)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f0 => (a -> f0 b) -> Reverse f a -> f0 (Reverse f b) # sequence1 :: Apply f0 => Reverse f (f0 b) -> f0 (Reverse f b)
Traversable1 f => Traversable1 (Backwards f)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f0 => (a -> f0 b) -> Backwards f a -> f0 (Backwards f b) # sequence1 :: Apply f0 => Backwards f (f0 b) -> f0 (Backwards f b)
Bitraversable1 p => Traversable1 (Join p)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a -> f b) -> Join p a -> f (Join p b) # sequence1 :: Apply f => Join p (f b) -> f (Join p b)
Traversable1 (Tagged a)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a0 -> f b) -> Tagged a a0 -> f (Tagged a b) # sequence1 :: Apply f => Tagged a (f b) -> f (Tagged a b)
Traversable1 f => Traversable1 (AlongsideLeft f b)
Instance details Defined in Control.Lens.Internal.Getter Methods traverse1 :: Apply f0 => (a -> f0 b0) -> AlongsideLeft f b a -> f0 (AlongsideLeft f b b0) # sequence1 :: Apply f0 => AlongsideLeft f b (f0 b0) -> f0 (AlongsideLeft f b b0)
Traversable1 f => Traversable1 (AlongsideRight f a)
Instance details Defined in Control.Lens.Internal.Getter Methods traverse1 :: Apply f0 => (a0 -> f0 b) -> AlongsideRight f a a0 -> f0 (AlongsideRight f a b) # sequence1 :: Apply f0 => AlongsideRight f a (f0 b) -> f0 (AlongsideRight f a b)
(Traversable1 f, Traversable1 g) => Traversable1 (f :+: g)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f0 => (a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) # sequence1 :: Apply f0 => (f :+: g) (f0 b) -> f0 ((f :+: g) b)
(Traversable1 f, Traversable1 g) => Traversable1 (f :*: g)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f0 => (a -> f0 b) -> (f :: g) a -> f0 ((f :: g) b) # sequence1 :: Apply f0 => (f :: g) (f0 b) -> f0 ((f :: g) b)
(Traversable1 f, Traversable1 g) => Traversable1 (Product f g)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f0 => (a -> f0 b) -> Product f g a -> f0 (Product f g b) # sequence1 :: Apply f0 => Product f g (f0 b) -> f0 (Product f g b)
(Traversable1 f, Traversable1 g) => Traversable1 (Sum f g)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f0 => (a -> f0 b) -> Sum f g a -> f0 (Sum f g b) # sequence1 :: Apply f0 => Sum f g (f0 b) -> f0 (Sum f g b)
Traversable1 f => Traversable1 (M1 i c f)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f0 => (a -> f0 b) -> M1 i c f a -> f0 (M1 i c f b) # sequence1 :: Apply f0 => M1 i c f (f0 b) -> f0 (M1 i c f b)
(Traversable1 f, Traversable1 g) => Traversable1 (f :.: g)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f0 => (a -> f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) # sequence1 :: Apply f0 => (f :.: g) (f0 b) -> f0 ((f :.: g) b)
(Traversable1 f, Traversable1 g) => Traversable1 (Compose f g)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f0 => (a -> f0 b) -> Compose f g a -> f0 (Compose f g b) # sequence1 :: Apply f0 => Compose f g (f0 b) -> f0 (Compose f g b)
Traversable1 g => Traversable1 (Joker g a)
Instance details Defined in Data.Semigroup.Traversable.Class Methods traverse1 :: Apply f => (a0 -> f b) -> Joker g a a0 -> f (Joker g a b) # sequence1 :: Apply f => Joker g a (f b) -> f (Joker g a b)