Copyright | (c) 2016 Stephen Diehl (c) 2016-2018 Serokell (c) 2018-2019 Kowainik |
---|---|
License | MIT |
Maintainer | Kowainik <xrom.xkov@gmail.com> |
Safe Haskell | None |
Language | Haskell2010 |
Relude.Container.Reexport
Description
Reexports all container-related stuff from base
, containers
and
unordered-containers
packages.
Synopsis
Documentation
The class of types that can be converted to a hash value.
Minimal implementation: hashWithSalt
.
Minimal complete definition
Nothing
Methods
hashWithSalt :: Int -> a -> Int infixl 0 #
Return a hash value for the argument, using the given salt.
The general contract of hashWithSalt
is:
- If two values are equal according to the
==
method, then applying thehashWithSalt
method on each of the two values must produce the same integer result if the same salt is used in each case. - It is not required that if two values are unequal
according to the
==
method, then applying thehashWithSalt
method on each of the two values must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal values may improve the performance of hashing-based data structures. - This method can be used to compute different hash values for
the same input by providing a different salt in each
application of the method. This implies that any instance
that defines
hashWithSalt
must make use of the salt in its implementation.
Instances
A map from keys to values. A map cannot contain duplicate keys; each key can map to at most one value.
Instances
Hashable2 HashMap | |
Defined in Data.HashMap.Base | |
Eq2 HashMap | |
Ord2 HashMap | |
Defined in Data.HashMap.Base | |
Show2 HashMap | |
Defined in Data.HashMap.Base Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> HashMap a b -> ShowS liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [HashMap a b] -> ShowS | |
Functor (HashMap k) | |
Foldable (HashMap k) | |
Defined in Data.HashMap.Base Methods fold :: Monoid m => HashMap k m -> m # foldMap :: Monoid m => (a -> m) -> HashMap k a -> m # foldr :: (a -> b -> b) -> b -> HashMap k a -> b # foldr' :: (a -> b -> b) -> b -> HashMap k a -> b foldl :: (b -> a -> b) -> b -> HashMap k a -> b foldl' :: (b -> a -> b) -> b -> HashMap k a -> b # foldr1 :: (a -> a -> a) -> HashMap k a -> a foldl1 :: (a -> a -> a) -> HashMap k a -> a toList :: HashMap k a -> [a] # length :: HashMap k a -> Int # elem :: Eq a => a -> HashMap k a -> Bool maximum :: Ord a => HashMap k a -> a minimum :: Ord a => HashMap k a -> a | |
Traversable (HashMap k) | |
Defined in Data.HashMap.Base | |
Hashable k => Hashable1 (HashMap k) | |
Defined in Data.HashMap.Base | |
Eq k => Eq1 (HashMap k) | |
Ord k => Ord1 (HashMap k) | |
Defined in Data.HashMap.Base Methods liftCompare :: (a -> b -> Ordering) -> HashMap k a -> HashMap k b -> Ordering | |
(Eq k, Hashable k, Read k) => Read1 (HashMap k) | |
Defined in Data.HashMap.Base Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (HashMap k a) liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [HashMap k a] liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (HashMap k a) liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [HashMap k a] | |
Show k => Show1 (HashMap k) | |
Defined in Data.HashMap.Base Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> HashMap k a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [HashMap k a] -> ShowS | |
(Eq k, Hashable k) => IsList (HashMap k v) | |
(Eq k, Eq v) => Eq (HashMap k v) | |
(Data k, Data v, Eq k, Hashable k) => Data (HashMap k v) | |
Defined in Data.HashMap.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HashMap k v -> c (HashMap k v) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HashMap k v) toConstr :: HashMap k v -> Constr dataTypeOf :: HashMap k v -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HashMap k v)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HashMap k v)) gmapT :: (forall b. Data b => b -> b) -> HashMap k v -> HashMap k v gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HashMap k v -> r gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HashMap k v -> r gmapQ :: (forall d. Data d => d -> u) -> HashMap k v -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> HashMap k v -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> HashMap k v -> m (HashMap k v) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HashMap k v -> m (HashMap k v) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HashMap k v -> m (HashMap k v) | |
(Ord k, Ord v) => Ord (HashMap k v) | The order is total. Note: Because the hash is not guaranteed to be stable across library
versions, OSes, or architectures, neither is an actual order of elements in
|
Defined in Data.HashMap.Base | |
(Eq k, Hashable k, Read k, Read e) => Read (HashMap k e) | |
Defined in Data.HashMap.Base | |
(Show k, Show v) => Show (HashMap k v) | |
(Eq k, Hashable k) => Semigroup (HashMap k v) | |
(Eq k, Hashable k) => Monoid (HashMap k v) | |
(Hashable k, Hashable v) => Hashable (HashMap k v) | |
Defined in Data.HashMap.Base | |
(NFData k, NFData v) => NFData (HashMap k v) | |
Defined in Data.HashMap.Base | |
Hashable k => One (HashMap k v) # | Create singleton
length (one @(HashMap Int String) x) == 1 |
(Eq k, Hashable k) => DynamicMap (HashMap k v) # | |
Defined in Relude.Extra.Map Methods insert :: Key (HashMap k v) -> Val (HashMap k v) -> HashMap k v -> HashMap k v # insertWith :: (Val (HashMap k v) -> Val (HashMap k v) -> Val (HashMap k v)) -> Key (HashMap k v) -> Val (HashMap k v) -> HashMap k v -> HashMap k v # delete :: Key (HashMap k v) -> HashMap k v -> HashMap k v # alter :: (Maybe (Val (HashMap k v)) -> Maybe (Val (HashMap k v))) -> Key (HashMap k v) -> HashMap k v -> HashMap k v # | |
(Eq k, Hashable k) => StaticMap (HashMap k v) # | |
type Item (HashMap k v) | |
Defined in Data.HashMap.Base type Item (HashMap k v) = (k, v) | |
type OneItem (HashMap k v) # | |
Defined in Relude.Container.One | |
type Key (HashMap k v) # | |
Defined in Relude.Extra.Map | |
type Val (HashMap k v) # | |
Defined in Relude.Extra.Map |
A set of values. A set cannot contain duplicate values.
Instances
Foldable HashSet | |
Defined in Data.HashSet.Base Methods fold :: Monoid m => HashSet m -> m # foldMap :: Monoid m => (a -> m) -> HashSet a -> m # foldr :: (a -> b -> b) -> b -> HashSet a -> b # foldr' :: (a -> b -> b) -> b -> HashSet a -> b foldl :: (b -> a -> b) -> b -> HashSet a -> b foldl' :: (b -> a -> b) -> b -> HashSet a -> b # foldr1 :: (a -> a -> a) -> HashSet a -> a foldl1 :: (a -> a -> a) -> HashSet a -> a elem :: Eq a => a -> HashSet a -> Bool maximum :: Ord a => HashSet a -> a minimum :: Ord a => HashSet a -> a | |
Hashable1 HashSet | |
Defined in Data.HashSet.Base | |
Eq1 HashSet | |
Ord1 HashSet | |
Defined in Data.HashSet.Base Methods liftCompare :: (a -> b -> Ordering) -> HashSet a -> HashSet b -> Ordering | |
Show1 HashSet | |
Defined in Data.HashSet.Base Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> HashSet a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [HashSet a] -> ShowS | |
(Eq a, Hashable a) => IsList (HashSet a) | |
Eq a => Eq (HashSet a) | |
(Data a, Eq a, Hashable a) => Data (HashSet a) | |
Defined in Data.HashSet.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HashSet a -> c (HashSet a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HashSet a) toConstr :: HashSet a -> Constr dataTypeOf :: HashSet a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HashSet a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HashSet a)) gmapT :: (forall b. Data b => b -> b) -> HashSet a -> HashSet a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HashSet a -> r gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HashSet a -> r gmapQ :: (forall d. Data d => d -> u) -> HashSet a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> HashSet a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> HashSet a -> m (HashSet a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HashSet a -> m (HashSet a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HashSet a -> m (HashSet a) | |
Ord a => Ord (HashSet a) | |
(Eq a, Hashable a, Read a) => Read (HashSet a) | |
Defined in Data.HashSet.Base | |
Show a => Show (HashSet a) | |
(Hashable a, Eq a) => Semigroup (HashSet a) | |
(Hashable a, Eq a) => Monoid (HashSet a) | |
Hashable a => Hashable (HashSet a) | |
Defined in Data.HashSet.Base | |
NFData a => NFData (HashSet a) | |
Defined in Data.HashSet.Base | |
Hashable v => One (HashSet v) # | Create singleton
length (one @(HashSet Int) x) == 1 |
(Eq a, Hashable a) => StaticMap (HashSet a) # | |
type Item (HashSet a) | |
Defined in Data.HashSet.Base type Item (HashSet a) = a | |
type OneItem (HashSet v) # | |
Defined in Relude.Container.One | |
type Key (HashSet a) # | |
Defined in Relude.Extra.Map | |
type Val (HashSet a) # | |
Defined in Relude.Extra.Map |
Instances
Functor IntMap | |
Foldable IntMap | |
Defined in Data.IntMap.Internal Methods fold :: Monoid m => IntMap m -> m # foldMap :: Monoid m => (a -> m) -> IntMap a -> m # foldr :: (a -> b -> b) -> b -> IntMap a -> b # foldr' :: (a -> b -> b) -> b -> IntMap a -> b foldl :: (b -> a -> b) -> b -> IntMap a -> b foldl' :: (b -> a -> b) -> b -> IntMap a -> b # foldr1 :: (a -> a -> a) -> IntMap a -> a foldl1 :: (a -> a -> a) -> IntMap a -> a elem :: Eq a => a -> IntMap a -> Bool maximum :: Ord a => IntMap a -> a | |
Traversable IntMap | |
Eq1 IntMap | |
Ord1 IntMap | |
Defined in Data.IntMap.Internal Methods liftCompare :: (a -> b -> Ordering) -> IntMap a -> IntMap b -> Ordering | |
Read1 IntMap | |
Defined in Data.IntMap.Internal Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (IntMap a) liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [IntMap a] liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (IntMap a) liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [IntMap a] | |
Show1 IntMap | |
Defined in Data.IntMap.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> IntMap a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [IntMap a] -> ShowS | |
IsList (IntMap a) | |
Eq a => Eq (IntMap a) | |
Data a => Data (IntMap a) | |
Defined in Data.IntMap.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IntMap a -> c (IntMap a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (IntMap a) toConstr :: IntMap a -> Constr dataTypeOf :: IntMap a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (IntMap a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (IntMap a)) gmapT :: (forall b. Data b => b -> b) -> IntMap a -> IntMap a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IntMap a -> r gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IntMap a -> r gmapQ :: (forall d. Data d => d -> u) -> IntMap a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> IntMap a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> IntMap a -> m (IntMap a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IntMap a -> m (IntMap a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IntMap a -> m (IntMap a) | |
Ord a => Ord (IntMap a) | |
Defined in Data.IntMap.Internal | |
Read e => Read (IntMap e) | |
Defined in Data.IntMap.Internal | |
Show a => Show (IntMap a) | |
Semigroup (IntMap a) | |
Monoid (IntMap a) | |
NFData a => NFData (IntMap a) | |
Defined in Data.IntMap.Internal | |
One (IntMap v) # | Create singleton
length (one @(IntMap String) x) == 1 |
DynamicMap (IntMap v) # | |
Defined in Relude.Extra.Map Methods insert :: Key (IntMap v) -> Val (IntMap v) -> IntMap v -> IntMap v # insertWith :: (Val (IntMap v) -> Val (IntMap v) -> Val (IntMap v)) -> Key (IntMap v) -> Val (IntMap v) -> IntMap v -> IntMap v # delete :: Key (IntMap v) -> IntMap v -> IntMap v # alter :: (Maybe (Val (IntMap v)) -> Maybe (Val (IntMap v))) -> Key (IntMap v) -> IntMap v -> IntMap v # | |
StaticMap (IntMap v) # | |
type Item (IntMap a) | |
Defined in Data.IntMap.Internal type Item (IntMap a) = (Key, a) | |
type OneItem (IntMap v) # | |
Defined in Relude.Container.One | |
type Key (IntMap v) # | |
Defined in Relude.Extra.Map | |
type Val (IntMap v) # | |
Defined in Relude.Extra.Map |
Instances
IsList IntSet | |
Eq IntSet | |
Data IntSet | |
Defined in Data.IntSet.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IntSet -> c IntSet gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IntSet dataTypeOf :: IntSet -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c IntSet) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IntSet) gmapT :: (forall b. Data b => b -> b) -> IntSet -> IntSet gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IntSet -> r gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IntSet -> r gmapQ :: (forall d. Data d => d -> u) -> IntSet -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> IntSet -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> IntSet -> m IntSet gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IntSet -> m IntSet gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IntSet -> m IntSet | |
Ord IntSet | |
Read IntSet | |
Defined in Data.IntSet.Internal | |
Show IntSet | |
Semigroup IntSet | |
Monoid IntSet | |
NFData IntSet | |
Defined in Data.IntSet.Internal | |
One IntSet # | Create singleton
IntSet.size (one x) == 1 |
StaticMap IntSet # | |
type Item IntSet | |
Defined in Data.IntSet.Internal type Item IntSet = Key | |
type OneItem IntSet # | |
Defined in Relude.Container.One | |
type Key IntSet # | |
Defined in Relude.Extra.Map | |
type Val IntSet # | |
Defined in Relude.Extra.Map |
Instances
Eq2 Map | |
Ord2 Map | |
Defined in Data.Map.Internal | |
Show2 Map | |
Defined in Data.Map.Internal Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Map a b -> ShowS liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Map a b] -> ShowS | |
Functor (Map k) | |
Foldable (Map k) | |
Defined in Data.Map.Internal Methods fold :: Monoid m => Map k m -> m # foldMap :: Monoid m => (a -> m) -> Map k a -> m # foldr :: (a -> b -> b) -> b -> Map k a -> b # foldr' :: (a -> b -> b) -> b -> Map k a -> b foldl :: (b -> a -> b) -> b -> Map k a -> b foldl' :: (b -> a -> b) -> b -> Map k a -> b # foldr1 :: (a -> a -> a) -> Map k a -> a foldl1 :: (a -> a -> a) -> Map k a -> a elem :: Eq a => a -> Map k a -> Bool maximum :: Ord a => Map k a -> a | |
Traversable (Map k) | |
Eq k => Eq1 (Map k) | |
Ord k => Ord1 (Map k) | |
Defined in Data.Map.Internal Methods liftCompare :: (a -> b -> Ordering) -> Map k a -> Map k b -> Ordering | |
(Ord k, Read k) => Read1 (Map k) | |
Defined in Data.Map.Internal Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Map k a) liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Map k a] liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Map k a) liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Map k a] | |
Show k => Show1 (Map k) | |
Defined in Data.Map.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Map k a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Map k a] -> ShowS | |
Ord k => IsList (Map k v) | |
(Eq k, Eq a) => Eq (Map k a) | |
(Data k, Data a, Ord k) => Data (Map k a) | |
Defined in Data.Map.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Map k a -> c (Map k a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Map k a) dataTypeOf :: Map k a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Map k a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Map k a)) gmapT :: (forall b. Data b => b -> b) -> Map k a -> Map k a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r gmapQ :: (forall d. Data d => d -> u) -> Map k a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Map k a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) | |
(Ord k, Ord v) => Ord (Map k v) | |
(Ord k, Read k, Read e) => Read (Map k e) | |
Defined in Data.Map.Internal | |
(Show k, Show a) => Show (Map k a) | |
Ord k => Semigroup (Map k v) | |
Ord k => Monoid (Map k v) | |
(NFData k, NFData a) => NFData (Map k a) | |
Defined in Data.Map.Internal | |
One (Map k v) # | Create singleton
length (one @(Map Int String) x) == 1 |
Ord k => DynamicMap (Map k v) # | |
Defined in Relude.Extra.Map Methods insert :: Key (Map k v) -> Val (Map k v) -> Map k v -> Map k v # insertWith :: (Val (Map k v) -> Val (Map k v) -> Val (Map k v)) -> Key (Map k v) -> Val (Map k v) -> Map k v -> Map k v # delete :: Key (Map k v) -> Map k v -> Map k v # alter :: (Maybe (Val (Map k v)) -> Maybe (Val (Map k v))) -> Key (Map k v) -> Map k v -> Map k v # | |
Ord k => StaticMap (Map k v) # | |
type Item (Map k v) | |
Defined in Data.Map.Internal type Item (Map k v) = (k, v) | |
type OneItem (Map k v) # | |
Defined in Relude.Container.One | |
type Key (Map k v) # | |
Defined in Relude.Extra.Map | |
type Val (Map k v) # | |
Defined in Relude.Extra.Map |
Instances
Monad Seq | |
Functor Seq | |
MonadFix Seq | |
Defined in Data.Sequence.Internal | |
Applicative Seq | |
Foldable Seq | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Seq m -> m # foldMap :: Monoid m => (a -> m) -> Seq a -> m # foldr :: (a -> b -> b) -> b -> Seq a -> b # foldr' :: (a -> b -> b) -> b -> Seq a -> b foldl :: (b -> a -> b) -> b -> Seq a -> b foldl' :: (b -> a -> b) -> b -> Seq a -> b # foldr1 :: (a -> a -> a) -> Seq a -> a foldl1 :: (a -> a -> a) -> Seq a -> a elem :: Eq a => a -> Seq a -> Bool maximum :: Ord a => Seq a -> a | |
Traversable Seq | |
Alternative Seq | |
MonadPlus Seq | |
Eq1 Seq | |
Ord1 Seq | |
Defined in Data.Sequence.Internal Methods liftCompare :: (a -> b -> Ordering) -> Seq a -> Seq b -> Ordering | |
Read1 Seq | |
Defined in Data.Sequence.Internal Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Seq a) liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Seq a] liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Seq a) liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Seq a] | |
Show1 Seq | |
Defined in Data.Sequence.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Seq a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Seq a] -> ShowS | |
MonadZip Seq | |
UnzipWith Seq | |
Defined in Data.Sequence.Internal Methods unzipWith' :: (x -> (a, b)) -> Seq x -> (Seq a, Seq b) | |
IsList (Seq a) | |
Eq a => Eq (Seq a) | |
Data a => Data (Seq a) | |
Defined in Data.Sequence.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Seq a -> c (Seq a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Seq a) dataTypeOf :: Seq a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Seq a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Seq a)) gmapT :: (forall b. Data b => b -> b) -> Seq a -> Seq a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Seq a -> r gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Seq a -> r gmapQ :: (forall d. Data d => d -> u) -> Seq a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Seq a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a) | |
Ord a => Ord (Seq a) | |
Read a => Read (Seq a) | |
Defined in Data.Sequence.Internal | |
Show a => Show (Seq a) | |
a ~ Char => IsString (Seq a) | |
Defined in Data.Sequence.Internal Methods fromString :: String -> Seq a # | |
Semigroup (Seq a) | |
Monoid (Seq a) | |
NFData a => NFData (Seq a) | |
Defined in Data.Sequence.Internal | |
One (Seq a) # | Create singleton
length (one @(Seq Int) x) == 1 |
type Item (Seq a) | |
Defined in Data.Sequence.Internal type Item (Seq a) = a | |
type OneItem (Seq a) # | |
Defined in Relude.Container.One |
Instances
Foldable Set | |
Defined in Data.Set.Internal Methods fold :: Monoid m => Set m -> m # foldMap :: Monoid m => (a -> m) -> Set a -> m # foldr :: (a -> b -> b) -> b -> Set a -> b # foldr' :: (a -> b -> b) -> b -> Set a -> b foldl :: (b -> a -> b) -> b -> Set a -> b foldl' :: (b -> a -> b) -> b -> Set a -> b # foldr1 :: (a -> a -> a) -> Set a -> a foldl1 :: (a -> a -> a) -> Set a -> a elem :: Eq a => a -> Set a -> Bool maximum :: Ord a => Set a -> a | |
Eq1 Set | |
Ord1 Set | |
Defined in Data.Set.Internal Methods liftCompare :: (a -> b -> Ordering) -> Set a -> Set b -> Ordering | |
Show1 Set | |
Defined in Data.Set.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Set a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Set a] -> ShowS | |
Ord a => IsList (Set a) | |
Eq a => Eq (Set a) | |
(Data a, Ord a) => Data (Set a) | |
Defined in Data.Set.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Set a -> c (Set a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Set a) dataTypeOf :: Set a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Set a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Set a)) gmapT :: (forall b. Data b => b -> b) -> Set a -> Set a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r gmapQ :: (forall d. Data d => d -> u) -> Set a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Set a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) | |
Ord a => Ord (Set a) | |
(Read a, Ord a) => Read (Set a) | |
Defined in Data.Set.Internal | |
Show a => Show (Set a) | |
Ord a => Semigroup (Set a) | |
Ord a => Monoid (Set a) | |
NFData a => NFData (Set a) | |
Defined in Data.Set.Internal | |
One (Set v) # | Create singleton
length (one @(Set Int) x) == 1 |
Ord a => StaticMap (Set a) # | |
type Item (Set a) | |
Defined in Data.Set.Internal type Item (Set a) = a | |
type OneItem (Set v) # | |
Defined in Relude.Container.One | |
type Key (Set a) # | |
Defined in Relude.Extra.Map | |
type Val (Set a) # | |
Defined in Relude.Extra.Map |