| Maintainer | Toshio Ito <debug.ito@gmail.com> |
|---|---|
| Safe Haskell | Safe-Inferred |
| Language | Haskell2010 |
NetSpider.Pair
Description
Documentation
Pair is a two-element tuple of the same type that is
insensitive to swapping. Eq, Ord and Hashable instances treat
Pairs with swapped elements as equivalent.
Instances
| Functor Pair Source # | |
| Applicative Pair Source # | |
| Foldable Pair Source # | |
Defined in NetSpider.Pair Methods fold :: Monoid m => Pair m -> m # foldMap :: Monoid m => (a -> m) -> Pair a -> m # foldMap' :: Monoid m => (a -> m) -> Pair a -> m # foldr :: (a -> b -> b) -> b -> Pair a -> b # foldr' :: (a -> b -> b) -> b -> Pair a -> b # foldl :: (b -> a -> b) -> b -> Pair a -> b # foldl' :: (b -> a -> b) -> b -> Pair a -> b # foldr1 :: (a -> a -> a) -> Pair a -> a # foldl1 :: (a -> a -> a) -> Pair a -> a # elem :: Eq a => a -> Pair a -> Bool # maximum :: Ord a => Pair a -> a # | |
| Traversable Pair Source # | |
| Eq a => Eq (Pair a) Source # | |
| Ord a => Ord (Pair a) Source # | |
| Show a => Show (Pair a) Source # | |
| (Ord a, Hashable a) => Hashable (Pair a) Source # | |
Defined in NetSpider.Pair | |