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