ConCat.Pair
Description
Uniform pairs
data Pair a Source #
Constructors
Defined in ConCat.Pair
Associated Types
type Rep Pair Source #
Methods
tabulate :: (Rep Pair -> a) -> Pair a Source #
index :: Pair a -> Rep Pair -> a Source #
fold :: Monoid m => Pair m -> m Source #
foldMap :: Monoid m => (a -> m) -> Pair a -> m Source #
foldMap' :: Monoid m => (a -> m) -> Pair a -> m Source #
foldr :: (a -> b -> b) -> b -> Pair a -> b Source #
foldr' :: (a -> b -> b) -> b -> Pair a -> b Source #
foldl :: (b -> a -> b) -> b -> Pair a -> b Source #
foldl' :: (b -> a -> b) -> b -> Pair a -> b Source #
foldr1 :: (a -> a -> a) -> Pair a -> a Source #
foldl1 :: (a -> a -> a) -> Pair a -> a Source #
toList :: Pair a -> [a] Source #
null :: Pair a -> Bool Source #
length :: Pair a -> Int Source #
elem :: Eq a => a -> Pair a -> Bool Source #
maximum :: Ord a => Pair a -> a Source #
minimum :: Ord a => Pair a -> a Source #
sum :: Num a => Pair a -> a Source #
product :: Num a => Pair a -> a Source #
traverse :: Applicative f => (a -> f b) -> Pair a -> f (Pair b) Source #
sequenceA :: Applicative f => Pair (f a) -> f (Pair a) Source #
mapM :: Monad m => (a -> m b) -> Pair a -> m (Pair b) Source #
sequence :: Monad m => Pair (m a) -> m (Pair a) Source #
pure :: a -> Pair a Source #
(<*>) :: Pair (a -> b) -> Pair a -> Pair b Source #
liftA2 :: (a -> b -> c) -> Pair a -> Pair b -> Pair c Source #
(*>) :: Pair a -> Pair b -> Pair b Source #
(<*) :: Pair a -> Pair b -> Pair a Source #
fmap :: (a -> b) -> Pair a -> Pair b Source #
(<$) :: a -> Pair b -> Pair a Source #
additive1 :: Sat Additive a |- Sat Additive (Pair a) Source #
Defined in ConCat.FFT
type FFO Pair :: Type -> Type Source #
fft :: DFTTy Pair Source #
fftDummy :: Pair a Source #
lscan :: Monoid a => Pair a -> Pair a :* a Source #
lscanDummy :: Pair a Source #
size :: Int Source #
distribute :: Functor f => f (Pair a) -> Pair (f a) Source #
collect :: Functor f => (a -> Pair b) -> f a -> Pair (f b) Source #
distributeM :: Monad m => m (Pair a) -> Pair (m a) Source #
collectM :: Monad m => (a -> Pair b) -> m a -> Pair (m b) Source #
zipWith :: (a -> b -> c) -> Pair a -> Pair b -> Pair c Source #
zip :: Pair a -> Pair b -> Pair (a, b) Source #
zap :: Pair (a -> b) -> Pair a -> Pair b Source #
point :: a -> Pair a Source #
okFunctor :: Ok' (:>) a |- Ok' (:>) (Pair a) Source #
type V s (Pair a) :: Type -> Type Source #
toV :: Pair a -> V s (Pair a) s Source #
unV :: V s (Pair a) s -> Pair a Source #
showsPrec :: Int -> Pair a -> ShowS Source #
show :: Pair a -> String Source #
showList :: [Pair a] -> ShowS Source #
zero :: Pair a Source #
(^+^) :: Pair a -> Pair a -> Pair a Source #
type Rep (Pair a) Source #
repr :: Pair a -> Rep (Pair a) Source #
abst :: Rep (Pair a) -> Pair a Source #
genBuses' :: Template u v -> [Source] -> BusesM (Buses (Pair a)) Source #
ty :: Ty Source #
unflattenB' :: State [Source] (Buses (Pair a)) Source #
type O (Pair a) Source #
pack :: O (Pair a) -> Pair a Source #
unpack :: Pair a -> O (Pair a) Source #