Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
Data.Strict.Tuple
Description
The strict variant of the standard Haskell pairs and the corresponding variants of the functions from Data.Tuple.
Note that unlike regular Haskell pairs, (x :!: _|_) = (_|_ :!: y) = _|_
Documentation
The type of strict pairs.
Constructors
!a :!: !b infix 2 |
Instances
Assoc Pair Source # | |||||
Swap Pair Source # | |||||
Defined in Data.Strict.Tuple | |||||
Bifoldable Pair Source # | |||||
Bifunctor Pair Source # | |||||
Bitraversable Pair Source # | |||||
Defined in Data.Strict.Tuple Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Pair a b -> f (Pair c d) | |||||
Eq2 Pair Source # | |||||
Defined in Data.Strict.Tuple | |||||
Ord2 Pair Source # | |||||
Defined in Data.Strict.Tuple Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Pair a c -> Pair b d -> Ordering | |||||
Read2 Pair Source # |
| ||||
Defined in Data.Strict.Tuple Methods liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Pair a b) liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Pair a b] liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Pair a b) liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Pair a b] | |||||
Show2 Pair Source # | |||||
Defined in Data.Strict.Tuple Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Pair a b -> ShowS liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Pair a b] -> ShowS | |||||
NFData2 Pair Source # | |||||
Defined in Data.Strict.Tuple | |||||
Hashable2 Pair Source # | |||||
Defined in Data.Strict.Tuple Methods liftHashWithSalt2 :: (Int -> a -> Int) -> (Int -> b -> Int) -> Int -> Pair a b -> Int | |||||
Generic1 (Pair a :: Type -> Type) Source # | |||||
Defined in Data.Strict.Tuple Associated Types
| |||||
Eq a => Eq1 (Pair a) Source # | |||||
Defined in Data.Strict.Tuple | |||||
Ord a => Ord1 (Pair a) Source # | |||||
Defined in Data.Strict.Tuple Methods liftCompare :: (a0 -> b -> Ordering) -> Pair a a0 -> Pair a b -> Ordering | |||||
Read a => Read1 (Pair a) Source # | |||||
Defined in Data.Strict.Tuple Methods liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Pair a a0) liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Pair a a0] liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Pair a a0) liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Pair a a0] | |||||
Show a => Show1 (Pair a) Source # | |||||
Defined in Data.Strict.Tuple Methods liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> Pair a a0 -> ShowS liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [Pair a a0] -> ShowS | |||||
NFData a => NFData1 (Pair a) Source # | |||||
Defined in Data.Strict.Tuple | |||||
Functor (Pair e) Source # | |||||
Foldable (Pair e) Source # | |||||
Defined in Data.Strict.Tuple Methods fold :: Monoid m => Pair e m -> m foldMap :: Monoid m => (a -> m) -> Pair e a -> m foldMap' :: Monoid m => (a -> m) -> Pair e a -> m foldr :: (a -> b -> b) -> b -> Pair e a -> b foldr' :: (a -> b -> b) -> b -> Pair e a -> b foldl :: (b -> a -> b) -> b -> Pair e a -> b foldl' :: (b -> a -> b) -> b -> Pair e a -> b foldr1 :: (a -> a -> a) -> Pair e a -> a foldl1 :: (a -> a -> a) -> Pair e a -> a elem :: Eq a => a -> Pair e a -> Bool maximum :: Ord a => Pair e a -> a | |||||
Traversable (Pair e) Source # | |||||
Hashable a => Hashable1 (Pair a) Source # | |||||
Defined in Data.Strict.Tuple Methods liftHashWithSalt :: (Int -> a0 -> Int) -> Int -> Pair a a0 -> Int | |||||
(Binary a, Binary b) => Binary (Pair a b) Source # | |||||
(NFData a, NFData b) => NFData (Pair a b) Source # | |||||
Defined in Data.Strict.Tuple | |||||
(Monoid a, Monoid b) => Monoid (Pair a b) Source # | |||||
(Semigroup a, Semigroup b) => Semigroup (Pair a b) Source # | |||||
(Data a, Data b) => Data (Pair a b) Source # | |||||
Defined in Data.Strict.Tuple Methods gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Pair a b -> c (Pair a b) gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Pair a b) toConstr :: Pair a b -> Constr dataTypeOf :: Pair a b -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Pair a b)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Pair a b)) gmapT :: (forall b0. Data b0 => b0 -> b0) -> Pair a b -> Pair a b gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Pair a b -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Pair a b -> r gmapQ :: (forall d. Data d => d -> u) -> Pair a b -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Pair a b -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Pair a b -> m (Pair a b) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Pair a b -> m (Pair a b) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Pair a b -> m (Pair a b) | |||||
(Bounded a, Bounded b) => Bounded (Pair a b) Source # | |||||
Defined in Data.Strict.Tuple | |||||
Generic (Pair a b) Source # | |||||
Defined in Data.Strict.Tuple Associated Types
| |||||
(Ix a, Ix b) => Ix (Pair a b) Source # | |||||
Defined in Data.Strict.Tuple | |||||
(Read a, Read b) => Read (Pair a b) Source # | |||||
Defined in Data.Strict.Tuple | |||||
(Show a, Show b) => Show (Pair a b) Source # | |||||
(Eq a, Eq b) => Eq (Pair a b) Source # | |||||
(Ord a, Ord b) => Ord (Pair a b) Source # | |||||
(Hashable a, Hashable b) => Hashable (Pair a b) Source # | |||||
Defined in Data.Strict.Tuple | |||||
Strict (a, b) (Pair a b) Source # | |||||
type Rep1 (Pair a :: Type -> Type) Source # | |||||
Defined in Data.Strict.Tuple type Rep1 (Pair a :: Type -> Type) = D1 ('MetaData "Pair" "Data.Strict.Tuple" "strict-0.5.1-2Zig5sSDxGd7Tu79bnpU1b" 'False) (C1 ('MetaCons ":!:" ('InfixI 'NotAssociative 2) 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) Par1)) | |||||
type Rep (Pair a b) Source # | |||||
Defined in Data.Strict.Tuple type Rep (Pair a b) = D1 ('MetaData "Pair" "Data.Strict.Tuple" "strict-0.5.1-2Zig5sSDxGd7Tu79bnpU1b" 'False) (C1 ('MetaCons ":!:" ('InfixI 'NotAssociative 2) 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 b))) |