NewtypeZoo.New
Description
Indicate that something is New.
New
newtype New a Source #
Constructors
Defined in NewtypeZoo.New
Methods
(>>=) :: New a -> (a -> New b) -> New b #
(>>) :: New a -> New b -> New b #
return :: a -> New a #
fmap :: (a -> b) -> New a -> New b #
(<$) :: a -> New b -> New a #
mfix :: (a -> New a) -> New a #
pure :: a -> New a #
(<*>) :: New (a -> b) -> New a -> New b #
liftA2 :: (a -> b -> c) -> New a -> New b -> New c #
(*>) :: New a -> New b -> New b #
(<*) :: New a -> New b -> New a #
fold :: Monoid m => New m -> m #
foldMap :: Monoid m => (a -> m) -> New a -> m #
foldMap' :: Monoid m => (a -> m) -> New a -> m #
foldr :: (a -> b -> b) -> b -> New a -> b #
foldr' :: (a -> b -> b) -> b -> New a -> b #
foldl :: (b -> a -> b) -> b -> New a -> b #
foldl' :: (b -> a -> b) -> b -> New a -> b #
foldr1 :: (a -> a -> a) -> New a -> a #
foldl1 :: (a -> a -> a) -> New a -> a #
toList :: New a -> [a] #
null :: New a -> Bool #
length :: New a -> Int #
elem :: Eq a => a -> New a -> Bool #
maximum :: Ord a => New a -> a #
minimum :: Ord a => New a -> a #
sum :: Num a => New a -> a #
product :: Num a => New a -> a #
traverse :: Applicative f => (a -> f b) -> New a -> f (New b) #
sequenceA :: Applicative f => New (f a) -> f (New a) #
mapM :: Monad m => (a -> m b) -> New a -> m (New b) #
sequence :: Monad m => New (m a) -> m (New a) #
liftEq :: (a -> b -> Bool) -> New a -> New b -> Bool #
liftCompare :: (a -> b -> Ordering) -> New a -> New b -> Ordering #
liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (New a) #
liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [New a] #
liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (New a) #
liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [New a] #
liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> New a -> ShowS #
liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [New a] -> ShowS #
mzip :: New a -> New b -> New (a, b) #
mzipWith :: (a -> b -> c) -> New a -> New b -> New c #
munzip :: New (a, b) -> (New a, New b) #
point :: a -> New a #
copoint :: New a -> a #
minBound :: New a #
maxBound :: New a #
succ :: New a -> New a #
pred :: New a -> New a #
toEnum :: Int -> New a #
fromEnum :: New a -> Int #
enumFrom :: New a -> [New a] #
enumFromThen :: New a -> New a -> [New a] #
enumFromTo :: New a -> New a -> [New a] #
enumFromThenTo :: New a -> New a -> New a -> [New a] #
(==) :: New a -> New a -> Bool #
(/=) :: New a -> New a -> Bool #
pi :: New a #
exp :: New a -> New a #
log :: New a -> New a #
sqrt :: New a -> New a #
(**) :: New a -> New a -> New a #
logBase :: New a -> New a -> New a #
sin :: New a -> New a #
cos :: New a -> New a #
tan :: New a -> New a #
asin :: New a -> New a #
acos :: New a -> New a #
atan :: New a -> New a #
sinh :: New a -> New a #
cosh :: New a -> New a #
tanh :: New a -> New a #
asinh :: New a -> New a #
acosh :: New a -> New a #
atanh :: New a -> New a #
log1p :: New a -> New a #
expm1 :: New a -> New a #
log1pexp :: New a -> New a #
log1mexp :: New a -> New a #
(/) :: New a -> New a -> New a #
recip :: New a -> New a #
fromRational :: Rational -> New a #
quot :: New a -> New a -> New a #
rem :: New a -> New a -> New a #
div :: New a -> New a -> New a #
mod :: New a -> New a -> New a #
quotRem :: New a -> New a -> (New a, New a) #
divMod :: New a -> New a -> (New a, New a) #
toInteger :: New a -> Integer #
(+) :: New a -> New a -> New a #
(-) :: New a -> New a -> New a #
(*) :: New a -> New a -> New a #
negate :: New a -> New a #
abs :: New a -> New a #
signum :: New a -> New a #
fromInteger :: Integer -> New a #
compare :: New a -> New a -> Ordering #
(<) :: New a -> New a -> Bool #
(<=) :: New a -> New a -> Bool #
(>) :: New a -> New a -> Bool #
(>=) :: New a -> New a -> Bool #
max :: New a -> New a -> New a #
min :: New a -> New a -> New a #
readsPrec :: Int -> ReadS (New a) #
readList :: ReadS [New a] #
readPrec :: ReadPrec (New a) #
readListPrec :: ReadPrec [New a] #
toRational :: New a -> Rational #
floatRadix :: New a -> Integer #
floatDigits :: New a -> Int #
floatRange :: New a -> (Int, Int) #
decodeFloat :: New a -> (Integer, Int) #
encodeFloat :: Integer -> Int -> New a #
exponent :: New a -> Int #
significand :: New a -> New a #
scaleFloat :: Int -> New a -> New a #
isNaN :: New a -> Bool #
isInfinite :: New a -> Bool #
isDenormalized :: New a -> Bool #
isNegativeZero :: New a -> Bool #
isIEEE :: New a -> Bool #
atan2 :: New a -> New a -> New a #
properFraction :: Integral b => New a -> (b, New a) #
truncate :: Integral b => New a -> b #
round :: Integral b => New a -> b #
ceiling :: Integral b => New a -> b #
floor :: Integral b => New a -> b #
showsPrec :: Int -> New a -> ShowS #
show :: New a -> String #
showList :: [New a] -> ShowS #
range :: (New a, New a) -> [New a] #
index :: (New a, New a) -> New a -> Int #
unsafeIndex :: (New a, New a) -> New a -> Int #
inRange :: (New a, New a) -> New a -> Bool #
rangeSize :: (New a, New a) -> Int #
unsafeRangeSize :: (New a, New a) -> Int #
fromString :: String -> New a #
Associated Types
type Rep (New a) :: Type -> Type #
from :: New a -> Rep (New a) x #
to :: Rep (New a) x -> New a #
(<>) :: New a -> New a -> New a #
sconcat :: NonEmpty (New a) -> New a #
stimes :: Integral b => b -> New a -> New a #
mempty :: New a #
mappend :: New a -> New a -> New a #
mconcat :: [New a] -> New a #
arbitrary :: Gen (New a) #
shrink :: New a -> [New a] #
(.&.) :: New a -> New a -> New a #
(.|.) :: New a -> New a -> New a #
xor :: New a -> New a -> New a #
complement :: New a -> New a #
shift :: New a -> Int -> New a #
rotate :: New a -> Int -> New a #
zeroBits :: New a #
bit :: Int -> New a #
setBit :: New a -> Int -> New a #
clearBit :: New a -> Int -> New a #
complementBit :: New a -> Int -> New a #
testBit :: New a -> Int -> Bool #
bitSizeMaybe :: New a -> Maybe Int #
bitSize :: New a -> Int #
isSigned :: New a -> Bool #
shiftL :: New a -> Int -> New a #
unsafeShiftL :: New a -> Int -> New a #
shiftR :: New a -> Int -> New a #
unsafeShiftR :: New a -> Int -> New a #
rotateL :: New a -> Int -> New a #
rotateR :: New a -> Int -> New a #
popCount :: New a -> Int #
finiteBitSize :: New a -> Int #
countLeadingZeros :: New a -> Int #
countTrailingZeros :: New a -> Int #
def :: New a #
rnf :: New a -> () #
randomR :: RandomGen g => (New a, New a) -> g -> (New a, g) #
random :: RandomGen g => g -> (New a, g) #
randomRs :: RandomGen g => (New a, New a) -> g -> [New a] #
randoms :: RandomGen g => g -> [New a] #
type Rep1 New :: k -> Type #
from1 :: forall (a :: k). New a -> Rep1 New a #
to1 :: forall (a :: k). Rep1 New a -> New a #
_theNew :: New x -> x Source #
theNew :: forall a b p f. (Profunctor p, Functor f) => p a (f b) -> p (New a) (f (New b)) Source #