Copyright	(C) CSIRO 2017-2019
License	BSD3
Maintainer	Isaac Elliott <isaace71295@gmail.com>
Stability	experimental
Portability	non-portable
Safe Haskell	None
Language	Haskell2010

Language.Python.Syntax.Operator.Unary

Description

Unary operators

Synopsis

data UnOp a
- = Negate (Ann a) [Whitespace]
- | Positive (Ann a) [Whitespace]
- | Complement (Ann a) [Whitespace]

Documentation

data UnOp a #

An UnOp is a unary operator in Python, such as - for negation. An operator is stored with an annotation and its trailing whitespace.

Constructors

Negate (Ann a) [Whitespace]	-a
Positive (Ann a) [Whitespace]	+a
Complement (Ann a) [Whitespace]	~a

Instances

Functor UnOp #
Instance details Defined in Language.Python.Syntax.Operator.Unary Methods fmap :: (a -> b) -> UnOp a -> UnOp b # (<$) :: a -> UnOp b -> UnOp a #
Foldable UnOp #
Instance details Defined in Language.Python.Syntax.Operator.Unary Methods fold :: Monoid m => UnOp m -> m # foldMap :: Monoid m => (a -> m) -> UnOp a -> m # foldr :: (a -> b -> b) -> b -> UnOp a -> b # foldr' :: (a -> b -> b) -> b -> UnOp a -> b # foldl :: (b -> a -> b) -> b -> UnOp a -> b # foldl' :: (b -> a -> b) -> b -> UnOp a -> b # foldr1 :: (a -> a -> a) -> UnOp a -> a # foldl1 :: (a -> a -> a) -> UnOp a -> a # toList :: UnOp a -> [a] # null :: UnOp a -> Bool # length :: UnOp a -> Int # elem :: Eq a => a -> UnOp a -> Bool # maximum :: Ord a => UnOp a -> a # minimum :: Ord a => UnOp a -> a # sum :: Num a => UnOp a -> a # product :: Num a => UnOp a -> a #
Traversable UnOp #
Instance details Defined in Language.Python.Syntax.Operator.Unary Methods traverse :: Applicative f => (a -> f b) -> UnOp a -> f (UnOp b) # sequenceA :: Applicative f => UnOp (f a) -> f (UnOp a) # mapM :: Monad m => (a -> m b) -> UnOp a -> m (UnOp b) # sequence :: Monad m => UnOp (m a) -> m (UnOp a) #
HasAnn UnOp #
Instance details Defined in Language.Python.Syntax.Operator.Unary Methods annot :: Functor f => (Ann a -> f (Ann a)) -> UnOp a -> f (UnOp a) #
Eq a => Eq (UnOp a) #
Instance details Defined in Language.Python.Syntax.Operator.Unary Methods (==) :: UnOp a -> UnOp a -> Bool # (/=) :: UnOp a -> UnOp a -> Bool #
Show a => Show (UnOp a) #
Instance details Defined in Language.Python.Syntax.Operator.Unary Methods showsPrec :: Int -> UnOp a -> ShowS # show :: UnOp a -> String # showList :: [UnOp a] -> ShowS #
Generic (UnOp a) #
Instance details Defined in Language.Python.Syntax.Operator.Unary Associated Types type Rep (UnOp a) :: * -> * # Methods from :: UnOp a -> Rep (UnOp a) x # to :: Rep (UnOp a) x -> UnOp a #
HasTrailingWhitespace (UnOp a) #
Instance details Defined in Language.Python.Syntax.Operator.Unary Methods trailingWhitespace :: Lens' (UnOp a) [Whitespace] #
HasNewlines (UnOp a) #
Instance details Defined in Language.Python.Optics.Newlines Methods _Newlines :: Traversal' (UnOp a) Newline #
type Rep (UnOp a) #
Instance details Defined in Language.Python.Syntax.Operator.Unary type Rep (UnOp a) = D1 (MetaData "UnOp" "Language.Python.Syntax.Operator.Unary" "hpython-0.1.0.1-inplace" False) (C1 (MetaCons "Negate" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Ann a)) :: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Whitespace])) :+: (C1 (MetaCons "Positive" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Ann a)) :: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Whitespace])) :+: C1 (MetaCons "Complement" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Ann a)) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Whitespace]))))