Universum.Container.Reexport

This module reexports all container related stuff from Prelude.

Documentation

class Eq a => Hashable a where

The class of types that can be converted to a hash value.

Minimal implementation: hashWithSalt.

Note: the hash is not guaranteed to be stable across library versions, operating systems or architectures. For stable hashing use named hashes: SHA256, CRC32 etc.

If you are looking for Hashable instance in time package, check time-compat

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 the hashWithSalt 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 the hashWithSalt 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.
• hashWithSalt may return negative Int values.

Instances

Hashable Bool

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Bool -> Int

hash :: Bool -> Int

Hashable Char

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Char -> Int

hash :: Char -> Int

Hashable Double

Note: prior to hashable-1.3.0.0, hash 0.0 /= hash (-0.0)

The hash of NaN is not well defined.

Since: hashable-1.3.0.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Double -> Int

hash :: Double -> Int

Hashable Float

Note: prior to hashable-1.3.0.0, hash 0.0 /= hash (-0.0)

The hash of NaN is not well defined.

Since: hashable-1.3.0.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Float -> Int

hash :: Float -> Int

Hashable Int

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Int -> Int

hash :: Int -> Int

Hashable Int8

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Int8 -> Int

hash :: Int8 -> Int

Hashable Int16

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Int16 -> Int

hash :: Int16 -> Int

Hashable Int32

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Int32 -> Int

hash :: Int32 -> Int

Hashable Int64

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Int64 -> Int

hash :: Int64 -> Int

Hashable Integer

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Integer -> Int

hash :: Integer -> Int

Hashable Natural

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Natural -> Int

hash :: Natural -> Int

Hashable Ordering

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Ordering -> Int

hash :: Ordering -> Int

Hashable Word

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Word -> Int

hash :: Word -> Int

Hashable Word8

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Word8 -> Int

hash :: Word8 -> Int

Hashable Word16

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Word16 -> Int

hash :: Word16 -> Int

Hashable Word32

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Word32 -> Int

hash :: Word32 -> Int

Hashable Word64

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Word64 -> Int

hash :: Word64 -> Int

Hashable SomeTypeRep

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> SomeTypeRep -> Int

hash :: SomeTypeRep -> Int

Hashable ()

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> () -> Int

hash :: () -> Int

Hashable Void

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Void -> Int

hash :: Void -> Int

Hashable Unique

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Unique -> Int

hash :: Unique -> Int

Hashable Version

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Version -> Int

hash :: Version -> Int

Hashable ThreadId

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> ThreadId -> Int

hash :: ThreadId -> Int

Hashable WordPtr

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> WordPtr -> Int

hash :: WordPtr -> Int

Hashable IntPtr

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> IntPtr -> Int

hash :: IntPtr -> Int

Hashable Fingerprint

Since: hashable-1.3.0.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Fingerprint -> Int

hash :: Fingerprint -> Int

Hashable ShortByteString

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> ShortByteString -> Int

hash :: ShortByteString -> Int

Hashable ByteString

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> ByteString -> Int

hash :: ByteString -> Int

Hashable ByteString

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> ByteString -> Int

hash :: ByteString -> Int

Hashable IntSet

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> IntSet -> Int

hash :: IntSet -> Int

Hashable BigNat

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> BigNat -> Int

hash :: BigNat -> Int

Hashable Text

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Text -> Int

hash :: Text -> Int

Hashable Text

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Text -> Int

hash :: Text -> Int

Hashable a => Hashable [a]

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> [a] -> Int

hash :: [a] -> Int

Hashable a => Hashable (Maybe a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Maybe a -> Int

hash :: Maybe a -> Int

Hashable a => Hashable (Ratio a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Ratio a -> Int

hash :: Ratio a -> Int

Hashable (Ptr a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Ptr a -> Int

hash :: Ptr a -> Int

Hashable (FunPtr a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> FunPtr a -> Int

hash :: FunPtr a -> Int

Hashable a => Hashable (Complex a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Complex a -> Int

hash :: Complex a -> Int

Hashable a => Hashable (Min a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Min a -> Int

hash :: Min a -> Int

Hashable a => Hashable (Max a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Max a -> Int

hash :: Max a -> Int

Hashable a => Hashable (First a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> First a -> Int

hash :: First a -> Int

Hashable a => Hashable (Last a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Last a -> Int

hash :: Last a -> Int

Hashable a => Hashable (WrappedMonoid a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> WrappedMonoid a -> Int

hash :: WrappedMonoid a -> Int

Hashable a => Hashable (Option a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Option a -> Int

hash :: Option a -> Int

Hashable (StableName a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> StableName a -> Int

hash :: StableName a -> Int

Hashable a => Hashable (Identity a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Identity a -> Int

hash :: Identity a -> Int

Hashable a => Hashable (NonEmpty a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> NonEmpty a -> Int

hash :: NonEmpty a -> Int

Hashable v => Hashable (IntMap v)

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> IntMap v -> Int

hash :: IntMap v -> Int

Hashable v => Hashable (Tree v)

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Tree v -> Int

hash :: Tree v -> Int

Hashable v => Hashable (Seq v)

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Seq v -> Int

hash :: Seq v -> Int

Hashable v => Hashable (Set v)

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Set v -> Int

hash :: Set v -> Int

Eq a => Hashable (Hashed a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Hashed a -> Int

hash :: Hashed a -> Int

Hashable a => Hashable (HashSet a)

Defined in Data.HashSet.Internal

Methods

hashWithSalt :: Int -> HashSet a -> Int

hash :: HashSet a -> Int

(Hashable a, Hashable b) => Hashable (Either a b)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Either a b -> Int

hash :: Either a b -> Int

Hashable (TypeRep a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> TypeRep a -> Int

hash :: TypeRep a -> Int

(Hashable a1, Hashable a2) => Hashable (a1, a2)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> (a1, a2) -> Int

hash :: (a1, a2) -> Int

Hashable (Fixed a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Fixed a -> Int

hash :: Fixed a -> Int

Hashable a => Hashable (Arg a b)

Note: Prior to hashable-1.3.0.0 the hash computation included the second argument of Arg which wasn't consistent with its Eq instance.

Since: hashable-1.3.0.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Arg a b -> Int

hash :: Arg a b -> Int

Hashable (Proxy a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Proxy a -> Int

hash :: Proxy a -> Int

(Hashable k, Hashable v) => Hashable (Map k v)

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Map k v -> Int

hash :: Map k v -> Int

(Hashable k, Hashable v) => Hashable (HashMap k v)

Defined in Data.HashMap.Internal

Methods

hashWithSalt :: Int -> HashMap k v -> Int

hash :: HashMap k v -> Int

(Hashable a1, Hashable a2, Hashable a3) => Hashable (a1, a2, a3)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> (a1, a2, a3) -> Int

hash :: (a1, a2, a3) -> Int

Hashable a => Hashable (Const a b)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Const a b -> Int

hash :: Const a b -> Int

(Hashable a1, Hashable a2, Hashable a3, Hashable a4) => Hashable (a1, a2, a3, a4)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> (a1, a2, a3, a4) -> Int

hash :: (a1, a2, a3, a4) -> Int

(Hashable1 f, Hashable1 g, Hashable a) => Hashable (Product f g a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Product f g a -> Int

hash :: Product f g a -> Int

(Hashable1 f, Hashable1 g, Hashable a) => Hashable (Sum f g a)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Sum f g a -> Int

hash :: Sum f g a -> Int

(Hashable a1, Hashable a2, Hashable a3, Hashable a4, Hashable a5) => Hashable (a1, a2, a3, a4, a5)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> (a1, a2, a3, a4, a5) -> Int

hash :: (a1, a2, a3, a4, a5) -> Int

(Hashable1 f, Hashable1 g, Hashable a) => Hashable (Compose f g a)

In general, hash (Compose x) ≠ hash x. However, hashWithSalt satisfies its variant of this equivalence.

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Compose f g a -> Int

hash :: Compose f g a -> Int

(Hashable a1, Hashable a2, Hashable a3, Hashable a4, Hashable a5, Hashable a6) => Hashable (a1, a2, a3, a4, a5, a6)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> (a1, a2, a3, a4, a5, a6) -> Int

hash :: (a1, a2, a3, a4, a5, a6) -> Int

(Hashable a1, Hashable a2, Hashable a3, Hashable a4, Hashable a5, Hashable a6, Hashable a7) => Hashable (a1, a2, a3, a4, a5, a6, a7)

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> (a1, a2, a3, a4, a5, a6, a7) -> Int

hash :: (a1, a2, a3, a4, a5, a6, a7) -> Int

data HashMap k v

A map from keys to values. A map cannot contain duplicate keys; each key can map to at most one value.

Instances

Bifoldable HashMap

Since: unordered-containers-0.2.11

Defined in Data.HashMap.Internal

Methods

bifold :: Monoid m => HashMap m m -> m

bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> HashMap a b -> m

bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> HashMap a b -> c

bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> HashMap a b -> c

Eq2 HashMap

Defined in Data.HashMap.Internal

Methods

liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> HashMap a c -> HashMap b d -> Bool

Ord2 HashMap

Defined in Data.HashMap.Internal

Methods

liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> HashMap a c -> HashMap b d -> Ordering

Show2 HashMap

Defined in Data.HashMap.Internal

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

NFData2 HashMap

Since: unordered-containers-0.2.14.0

Defined in Data.HashMap.Internal

Methods

liftRnf2 :: (a -> ()) -> (b -> ()) -> HashMap a b -> ()

Hashable2 HashMap

Defined in Data.HashMap.Internal

Methods

liftHashWithSalt2 :: (Int -> a -> Int) -> (Int -> b -> Int) -> Int -> HashMap a b -> Int

(Lift k, Lift v) => Lift (HashMap k v :: Type)

Since: unordered-containers-0.2.17.0

Defined in Data.HashMap.Internal

Methods

lift :: HashMap k v -> Q Exp

liftTyped :: HashMap k v -> Q (TExp (HashMap k v))

Functor (HashMap k)

Defined in Data.HashMap.Internal

Methods

fmap :: (a -> b) -> HashMap k a -> HashMap k b

(<$) :: a -> HashMap k b -> HashMap k a

Foldable (HashMap k)

Defined in Data.HashMap.Internal

Methods

fold :: Monoid m => HashMap k m -> m

foldMap :: Monoid m => (a -> m) -> HashMap k a -> 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]

null :: HashMap k a -> Bool

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

sum :: Num a => HashMap k a -> a

product :: Num a => HashMap k a -> a

Traversable (HashMap k)

Defined in Data.HashMap.Internal

Methods

traverse :: Applicative f => (a -> f b) -> HashMap k a -> f (HashMap k b)

sequenceA :: Applicative f => HashMap k (f a) -> f (HashMap k a)

mapM :: Monad m => (a -> m b) -> HashMap k a -> m (HashMap k b)

sequence :: Monad m => HashMap k (m a) -> m (HashMap k a)

Eq k => Eq1 (HashMap k)

Defined in Data.HashMap.Internal

Methods

liftEq :: (a -> b -> Bool) -> HashMap k a -> HashMap k b -> Bool

Ord k => Ord1 (HashMap k)

Defined in Data.HashMap.Internal

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.Internal

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.Internal

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> HashMap k a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [HashMap k a] -> ShowS

NFData k => NFData1 (HashMap k)

Since: unordered-containers-0.2.14.0

Defined in Data.HashMap.Internal

Methods

liftRnf :: (a -> ()) -> HashMap k a -> ()

Hashable k => Hashable1 (HashMap k)

Defined in Data.HashMap.Internal

Methods

liftHashWithSalt :: (Int -> a -> Int) -> Int -> HashMap k a -> Int

(Eq k, Hashable k) => IsList (HashMap k v)

Defined in Data.HashMap.Internal

Associated Types

type Item (HashMap k v)

Methods

fromList :: [Item (HashMap k v)] -> HashMap k v

fromListN :: Int -> [Item (HashMap k v)] -> HashMap k v

toList :: HashMap k v -> [Item (HashMap k v)]

(Eq k, Eq v) => Eq (HashMap k v)

Note that, in the presence of hash collisions, equal HashMaps may behave differently, i.e. substitutivity may be violated:

>>> data D = A | B deriving (Eq, Show)
>>> instance Hashable D where hashWithSalt salt _d = salt

>>> x = fromList [(A,1), (B,2)]
>>> y = fromList [(B,2), (A,1)]

>>> x == y
True
>>> toList x
[(A,1),(B,2)]
>>> toList y
[(B,2),(A,1)]

In general, the lack of substitutivity can be observed with any function that depends on the key ordering, such as folds and traversals.

Defined in Data.HashMap.Internal

Methods

(==) :: HashMap k v -> HashMap k v -> Bool

(/=) :: HashMap k v -> HashMap k v -> Bool

(Data k, Data v, Eq k, Hashable k) => Data (HashMap k v)

Defined in Data.HashMap.Internal

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 :: forall r r'. (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 ordering is total and consistent with the Eq instance. However, nothing else about the ordering is specified, and it may change from version to version of either this package or of hashable.

Defined in Data.HashMap.Internal

Methods

compare :: HashMap k v -> HashMap k v -> Ordering

(<) :: HashMap k v -> HashMap k v -> Bool

(<=) :: HashMap k v -> HashMap k v -> Bool

(>) :: HashMap k v -> HashMap k v -> Bool

(>=) :: HashMap k v -> HashMap k v -> Bool

max :: HashMap k v -> HashMap k v -> HashMap k v

min :: HashMap k v -> HashMap k v -> HashMap k v

(Eq k, Hashable k, Read k, Read e) => Read (HashMap k e)

Defined in Data.HashMap.Internal

Methods

readsPrec :: Int -> ReadS (HashMap k e)

readList :: ReadS [HashMap k e]

readPrec :: ReadPrec (HashMap k e)

readListPrec :: ReadPrec [HashMap k e]

(Show k, Show v) => Show (HashMap k v)

Defined in Data.HashMap.Internal

Methods

showsPrec :: Int -> HashMap k v -> ShowS

show :: HashMap k v -> String

showList :: [HashMap k v] -> ShowS

(Eq k, Hashable k) => Semigroup (HashMap k v)

<> = union

If a key occurs in both maps, the mapping from the first will be the mapping in the result.

Examples

>>> fromList [(1,'a'),(2,'b')] <> fromList [(2,'c'),(3,'d')]
fromList [(1,'a'),(2,'b'),(3,'d')]

Defined in Data.HashMap.Internal

Methods

(<>) :: HashMap k v -> HashMap k v -> HashMap k v

sconcat :: NonEmpty (HashMap k v) -> HashMap k v

stimes :: Integral b => b -> HashMap k v -> HashMap k v

(Eq k, Hashable k) => Monoid (HashMap k v)

mempty = empty

mappend = union

If a key occurs in both maps, the mapping from the first will be the mapping in the result.

Examples

>>> mappend (fromList [(1,'a'),(2,'b')]) (fromList [(2,'c'),(3,'d')])
fromList [(1,'a'),(2,'b'),(3,'d')]

Defined in Data.HashMap.Internal

Methods

mempty :: HashMap k v

mappend :: HashMap k v -> HashMap k v -> HashMap k v

mconcat :: [HashMap k v] -> HashMap k v

(NFData k, NFData v) => NFData (HashMap k v)

Defined in Data.HashMap.Internal

Methods

rnf :: HashMap k v -> ()

(Hashable k, Hashable v) => Hashable (HashMap k v)

Defined in Data.HashMap.Internal

Methods

hashWithSalt :: Int -> HashMap k v -> Int

hash :: HashMap k v -> Int

Hashable k => One (HashMap k v)

Defined in Universum.Container.Class

Associated Types

type OneItem (HashMap k v)

Methods

one :: OneItem (HashMap k v) -> HashMap k v

Container (HashMap k v)

Defined in Universum.Container.Class

Associated Types

type Element (HashMap k v)

Methods

toList :: HashMap k v -> [Element (HashMap k v)]

null :: HashMap k v -> Bool

foldr :: (Element (HashMap k v) -> b -> b) -> b -> HashMap k v -> b

foldl :: (b -> Element (HashMap k v) -> b) -> b -> HashMap k v -> b

foldl' :: (b -> Element (HashMap k v) -> b) -> b -> HashMap k v -> b

length :: HashMap k v -> Int

elem :: Element (HashMap k v) -> HashMap k v -> Bool

foldMap :: Monoid m => (Element (HashMap k v) -> m) -> HashMap k v -> m

fold :: HashMap k v -> Element (HashMap k v)

foldr' :: (Element (HashMap k v) -> b -> b) -> b -> HashMap k v -> b

notElem :: Element (HashMap k v) -> HashMap k v -> Bool

all :: (Element (HashMap k v) -> Bool) -> HashMap k v -> Bool

any :: (Element (HashMap k v) -> Bool) -> HashMap k v -> Bool

and :: HashMap k v -> Bool

or :: HashMap k v -> Bool

find :: (Element (HashMap k v) -> Bool) -> HashMap k v -> Maybe (Element (HashMap k v))

safeHead :: HashMap k v -> Maybe (Element (HashMap k v))

safeMaximum :: HashMap k v -> Maybe (Element (HashMap k v))

safeMinimum :: HashMap k v -> Maybe (Element (HashMap k v))

safeFoldr1 :: (Element (HashMap k v) -> Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> Maybe (Element (HashMap k v))

safeFoldl1 :: (Element (HashMap k v) -> Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> Maybe (Element (HashMap k v))

(Eq k, Hashable k) => FromList (HashMap k v)

Defined in Universum.Container.Class

Associated Types

type ListElement (HashMap k v)

type FromListC (HashMap k v)

Methods

fromList :: [ListElement (HashMap k v)] -> HashMap k v

ToPairs (HashMap k v)

Defined in Universum.Container.Class

Associated Types

type Key (HashMap k v)

type Val (HashMap k v)

Methods

toPairs :: HashMap k v -> [(Key (HashMap k v), Val (HashMap k v))]

keys :: HashMap k v -> [Key (HashMap k v)]

elems :: HashMap k v -> [Val (HashMap k v)]

type Item (HashMap k v)

Defined in Data.HashMap.Internal

type Item (HashMap k v) = (k, v)

type OneItem (HashMap k v)

Defined in Universum.Container.Class

type OneItem (HashMap k v) = (k, v)

type Element (HashMap k v)

Defined in Universum.Container.Class

type Element (HashMap k v)

type ListElement (HashMap k v)

Defined in Universum.Container.Class

type ListElement (HashMap k v) = Item (HashMap k v)

type FromListC (HashMap k v)

Defined in Universum.Container.Class

type FromListC (HashMap k v) = ()

type Key (HashMap k v)

Defined in Universum.Container.Class

type Key (HashMap k v) = k

type Val (HashMap k v)

Defined in Universum.Container.Class

type Val (HashMap k v) = v

data HashSet a

A set of values. A set cannot contain duplicate values.

Instances

Foldable HashSet

Defined in Data.HashSet.Internal

Methods

fold :: Monoid m => HashSet m -> m

foldMap :: Monoid m => (a -> m) -> HashSet a -> 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

toList :: HashSet a -> [a]

null :: HashSet a -> Bool

length :: HashSet a -> Int

elem :: Eq a => a -> HashSet a -> Bool

maximum :: Ord a => HashSet a -> a

minimum :: Ord a => HashSet a -> a

sum :: Num a => HashSet a -> a

product :: Num a => HashSet a -> a

Eq1 HashSet

Defined in Data.HashSet.Internal

Methods

liftEq :: (a -> b -> Bool) -> HashSet a -> HashSet b -> Bool

Ord1 HashSet

Defined in Data.HashSet.Internal

Methods

liftCompare :: (a -> b -> Ordering) -> HashSet a -> HashSet b -> Ordering

Show1 HashSet

Defined in Data.HashSet.Internal

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> HashSet a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [HashSet a] -> ShowS

NFData1 HashSet

Since: unordered-containers-0.2.14.0

Defined in Data.HashSet.Internal

Methods

liftRnf :: (a -> ()) -> HashSet a -> ()

Hashable1 HashSet

Defined in Data.HashSet.Internal

Methods

liftHashWithSalt :: (Int -> a -> Int) -> Int -> HashSet a -> Int

Lift a => Lift (HashSet a :: Type)

Since: unordered-containers-0.2.17.0

Defined in Data.HashSet.Internal

Methods

lift :: HashSet a -> Q Exp

liftTyped :: HashSet a -> Q (TExp (HashSet a))

(Eq a, Hashable a) => IsList (HashSet a)

Defined in Data.HashSet.Internal

Associated Types

type Item (HashSet a)

Methods

fromList :: [Item (HashSet a)] -> HashSet a

fromListN :: Int -> [Item (HashSet a)] -> HashSet a

toList :: HashSet a -> [Item (HashSet a)]

Eq a => Eq (HashSet a)

Note that, in the presence of hash collisions, equal HashSets may behave differently, i.e. substitutivity may be violated:

>>> data D = A | B deriving (Eq, Show)
>>> instance Hashable D where hashWithSalt salt _d = salt

>>> x = fromList [A, B]
>>> y = fromList [B, A]

>>> x == y
True
>>> toList x
[A,B]
>>> toList y
[B,A]

In general, the lack of substitutivity can be observed with any function that depends on the key ordering, such as folds and traversals.

Defined in Data.HashSet.Internal

Methods

(==) :: HashSet a -> HashSet a -> Bool

(/=) :: HashSet a -> HashSet a -> Bool

(Data a, Eq a, Hashable a) => Data (HashSet a)

Defined in Data.HashSet.Internal

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 :: forall r r'. (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)

Defined in Data.HashSet.Internal

Methods

compare :: HashSet a -> HashSet a -> Ordering

(<) :: HashSet a -> HashSet a -> Bool

(<=) :: HashSet a -> HashSet a -> Bool

(>) :: HashSet a -> HashSet a -> Bool

(>=) :: HashSet a -> HashSet a -> Bool

max :: HashSet a -> HashSet a -> HashSet a

min :: HashSet a -> HashSet a -> HashSet a

(Eq a, Hashable a, Read a) => Read (HashSet a)

Defined in Data.HashSet.Internal

Methods

readsPrec :: Int -> ReadS (HashSet a)

readList :: ReadS [HashSet a]

readPrec :: ReadPrec (HashSet a)

readListPrec :: ReadPrec [HashSet a]

Show a => Show (HashSet a)

Defined in Data.HashSet.Internal

Methods

showsPrec :: Int -> HashSet a -> ShowS

show :: HashSet a -> String

showList :: [HashSet a] -> ShowS

(Hashable a, Eq a) => Semigroup (HashSet a)

<> = union

\(O(n+m)\)

To obtain good performance, the smaller set must be presented as the first argument.

Examples

>>> fromList [1,2] <> fromList [2,3]
fromList [1,2,3]

Defined in Data.HashSet.Internal

Methods

(<>) :: HashSet a -> HashSet a -> HashSet a

sconcat :: NonEmpty (HashSet a) -> HashSet a

stimes :: Integral b => b -> HashSet a -> HashSet a

(Hashable a, Eq a) => Monoid (HashSet a)

mempty = empty

mappend = union

\(O(n+m)\)

To obtain good performance, the smaller set must be presented as the first argument.

Examples

>>> mappend (fromList [1,2]) (fromList [2,3])
fromList [1,2,3]

Defined in Data.HashSet.Internal

Methods

mempty :: HashSet a

mappend :: HashSet a -> HashSet a -> HashSet a

mconcat :: [HashSet a] -> HashSet a

NFData a => NFData (HashSet a)

Defined in Data.HashSet.Internal

Methods

rnf :: HashSet a -> ()

Hashable a => Hashable (HashSet a)

Defined in Data.HashSet.Internal

Methods

hashWithSalt :: Int -> HashSet a -> Int

hash :: HashSet a -> Int

Hashable v => One (HashSet v)

Defined in Universum.Container.Class

Associated Types

type OneItem (HashSet v)

Methods

one :: OneItem (HashSet v) -> HashSet v

(Eq v, Hashable v) => Container (HashSet v)

Defined in Universum.Container.Class

Associated Types

type Element (HashSet v)

Methods

toList :: HashSet v -> [Element (HashSet v)]

null :: HashSet v -> Bool

foldr :: (Element (HashSet v) -> b -> b) -> b -> HashSet v -> b

foldl :: (b -> Element (HashSet v) -> b) -> b -> HashSet v -> b

foldl' :: (b -> Element (HashSet v) -> b) -> b -> HashSet v -> b

length :: HashSet v -> Int

elem :: Element (HashSet v) -> HashSet v -> Bool

foldMap :: Monoid m => (Element (HashSet v) -> m) -> HashSet v -> m

fold :: HashSet v -> Element (HashSet v)

foldr' :: (Element (HashSet v) -> b -> b) -> b -> HashSet v -> b

notElem :: Element (HashSet v) -> HashSet v -> Bool

all :: (Element (HashSet v) -> Bool) -> HashSet v -> Bool

any :: (Element (HashSet v) -> Bool) -> HashSet v -> Bool

and :: HashSet v -> Bool

or :: HashSet v -> Bool

find :: (Element (HashSet v) -> Bool) -> HashSet v -> Maybe (Element (HashSet v))

safeHead :: HashSet v -> Maybe (Element (HashSet v))

safeMaximum :: HashSet v -> Maybe (Element (HashSet v))

safeMinimum :: HashSet v -> Maybe (Element (HashSet v))

safeFoldr1 :: (Element (HashSet v) -> Element (HashSet v) -> Element (HashSet v)) -> HashSet v -> Maybe (Element (HashSet v))

safeFoldl1 :: (Element (HashSet v) -> Element (HashSet v) -> Element (HashSet v)) -> HashSet v -> Maybe (Element (HashSet v))

type Item (HashSet a)

Defined in Data.HashSet.Internal

type Item (HashSet a) = a

type OneItem (HashSet v)

Defined in Universum.Container.Class

type OneItem (HashSet v) = v

type Element (HashSet v)

Defined in Universum.Container.Class

type Element (HashSet v)

data IntMap a

A map of integers to values a.

Instances

Functor IntMap

Defined in Data.IntMap.Internal

Methods

fmap :: (a -> b) -> IntMap a -> IntMap b

(<$) :: a -> IntMap b -> IntMap a

Foldable IntMap

Folds in order of increasing key.

Defined in Data.IntMap.Internal

Methods

fold :: Monoid m => IntMap m -> m

foldMap :: Monoid m => (a -> m) -> IntMap a -> 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

toList :: IntMap a -> [a]

null :: IntMap a -> Bool

length :: IntMap a -> Int

elem :: Eq a => a -> IntMap a -> Bool

maximum :: Ord a => IntMap a -> a

minimum :: Ord a => IntMap a -> a

sum :: Num a => IntMap a -> a

product :: Num a => IntMap a -> a

Traversable IntMap

Traverses in order of increasing key.

Defined in Data.IntMap.Internal

Methods

traverse :: Applicative f => (a -> f b) -> IntMap a -> f (IntMap b)

sequenceA :: Applicative f => IntMap (f a) -> f (IntMap a)

mapM :: Monad m => (a -> m b) -> IntMap a -> m (IntMap b)

sequence :: Monad m => IntMap (m a) -> m (IntMap a)

Eq1 IntMap

Since: containers-0.5.9

Defined in Data.IntMap.Internal

Methods

liftEq :: (a -> b -> Bool) -> IntMap a -> IntMap b -> Bool

Ord1 IntMap

Since: containers-0.5.9

Defined in Data.IntMap.Internal

Methods

liftCompare :: (a -> b -> Ordering) -> IntMap a -> IntMap b -> Ordering

Read1 IntMap

Since: containers-0.5.9

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

Since: containers-0.5.9

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

Hashable1 IntMap

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

liftHashWithSalt :: (Int -> a -> Int) -> Int -> IntMap a -> Int

IsList (IntMap a)

Since: containers-0.5.6.2

Defined in Data.IntMap.Internal

Associated Types

type Item (IntMap a)

Methods

fromList :: [Item (IntMap a)] -> IntMap a

fromListN :: Int -> [Item (IntMap a)] -> IntMap a

toList :: IntMap a -> [Item (IntMap a)]

Eq a => Eq (IntMap a)

Defined in Data.IntMap.Internal

Methods

(==) :: IntMap a -> IntMap a -> Bool

(/=) :: IntMap a -> IntMap a -> Bool

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 :: forall r r'. (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

Methods

compare :: IntMap a -> IntMap a -> Ordering

(<) :: IntMap a -> IntMap a -> Bool

(<=) :: IntMap a -> IntMap a -> Bool

(>) :: IntMap a -> IntMap a -> Bool

(>=) :: IntMap a -> IntMap a -> Bool

max :: IntMap a -> IntMap a -> IntMap a

min :: IntMap a -> IntMap a -> IntMap a

Read e => Read (IntMap e)

Defined in Data.IntMap.Internal

Methods

readsPrec :: Int -> ReadS (IntMap e)

readList :: ReadS [IntMap e]

readPrec :: ReadPrec (IntMap e)

readListPrec :: ReadPrec [IntMap e]

Show a => Show (IntMap a)

Defined in Data.IntMap.Internal

Methods

showsPrec :: Int -> IntMap a -> ShowS

show :: IntMap a -> String

showList :: [IntMap a] -> ShowS

Semigroup (IntMap a)

Since: containers-0.5.7

Defined in Data.IntMap.Internal

Methods

(<>) :: IntMap a -> IntMap a -> IntMap a

sconcat :: NonEmpty (IntMap a) -> IntMap a

stimes :: Integral b => b -> IntMap a -> IntMap a

Monoid (IntMap a)

Defined in Data.IntMap.Internal

Methods

mempty :: IntMap a

mappend :: IntMap a -> IntMap a -> IntMap a

mconcat :: [IntMap a] -> IntMap a

NFData a => NFData (IntMap a)

Defined in Data.IntMap.Internal

Methods

rnf :: IntMap a -> ()

Hashable v => Hashable (IntMap v)

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> IntMap v -> Int

hash :: IntMap v -> Int

One (IntMap v)

Defined in Universum.Container.Class

Associated Types

type OneItem (IntMap v)

Methods

one :: OneItem (IntMap v) -> IntMap v

Container (IntMap v)

Defined in Universum.Container.Class

Associated Types

type Element (IntMap v)

Methods

toList :: IntMap v -> [Element (IntMap v)]

null :: IntMap v -> Bool

foldr :: (Element (IntMap v) -> b -> b) -> b -> IntMap v -> b

foldl :: (b -> Element (IntMap v) -> b) -> b -> IntMap v -> b

foldl' :: (b -> Element (IntMap v) -> b) -> b -> IntMap v -> b

length :: IntMap v -> Int

elem :: Element (IntMap v) -> IntMap v -> Bool

foldMap :: Monoid m => (Element (IntMap v) -> m) -> IntMap v -> m

fold :: IntMap v -> Element (IntMap v)

foldr' :: (Element (IntMap v) -> b -> b) -> b -> IntMap v -> b

notElem :: Element (IntMap v) -> IntMap v -> Bool

all :: (Element (IntMap v) -> Bool) -> IntMap v -> Bool

any :: (Element (IntMap v) -> Bool) -> IntMap v -> Bool

and :: IntMap v -> Bool

or :: IntMap v -> Bool

find :: (Element (IntMap v) -> Bool) -> IntMap v -> Maybe (Element (IntMap v))

safeHead :: IntMap v -> Maybe (Element (IntMap v))

safeMaximum :: IntMap v -> Maybe (Element (IntMap v))

safeMinimum :: IntMap v -> Maybe (Element (IntMap v))

safeFoldr1 :: (Element (IntMap v) -> Element (IntMap v) -> Element (IntMap v)) -> IntMap v -> Maybe (Element (IntMap v))

safeFoldl1 :: (Element (IntMap v) -> Element (IntMap v) -> Element (IntMap v)) -> IntMap v -> Maybe (Element (IntMap v))

FromList (IntMap v)

Defined in Universum.Container.Class

Associated Types

type ListElement (IntMap v)

type FromListC (IntMap v)

Methods

fromList :: [ListElement (IntMap v)] -> IntMap v

ToPairs (IntMap v)

Defined in Universum.Container.Class

Associated Types

type Key (IntMap v)

type Val (IntMap v)

Methods

toPairs :: IntMap v -> [(Key (IntMap v), Val (IntMap v))]

keys :: IntMap v -> [Key (IntMap v)]

elems :: IntMap v -> [Val (IntMap v)]

type Item (IntMap a)

Defined in Data.IntMap.Internal

type Item (IntMap a) = (Key, a)

type OneItem (IntMap v)

Defined in Universum.Container.Class

type OneItem (IntMap v) = (Int, v)

type Element (IntMap v)

Defined in Universum.Container.Class

type Element (IntMap v)

type ListElement (IntMap v)

Defined in Universum.Container.Class

type ListElement (IntMap v) = Item (IntMap v)

type FromListC (IntMap v)

Defined in Universum.Container.Class

type FromListC (IntMap v) = ()

type Key (IntMap v)

Defined in Universum.Container.Class

type Key (IntMap v) = Int

type Val (IntMap v)

Defined in Universum.Container.Class

type Val (IntMap v) = v

data IntSet

A set of integers.

Instances

IsList IntSet

Since: containers-0.5.6.2

Defined in Data.IntSet.Internal

Associated Types

type Item IntSet

Methods

fromList :: [Item IntSet] -> IntSet

fromListN :: Int -> [Item IntSet] -> IntSet

toList :: IntSet -> [Item IntSet]

Eq IntSet

Defined in Data.IntSet.Internal

Methods

(==) :: IntSet -> IntSet -> Bool

(/=) :: IntSet -> IntSet -> Bool

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

toConstr :: IntSet -> Constr

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 :: forall r r'. (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

Defined in Data.IntSet.Internal

Methods

compare :: IntSet -> IntSet -> Ordering

(<) :: IntSet -> IntSet -> Bool

(<=) :: IntSet -> IntSet -> Bool

(>) :: IntSet -> IntSet -> Bool

(>=) :: IntSet -> IntSet -> Bool

max :: IntSet -> IntSet -> IntSet

min :: IntSet -> IntSet -> IntSet

Read IntSet

Defined in Data.IntSet.Internal

Methods

readsPrec :: Int -> ReadS IntSet

readList :: ReadS [IntSet]

readPrec :: ReadPrec IntSet

readListPrec :: ReadPrec [IntSet]

Show IntSet

Defined in Data.IntSet.Internal

Methods

showsPrec :: Int -> IntSet -> ShowS

show :: IntSet -> String

showList :: [IntSet] -> ShowS

Semigroup IntSet

Since: containers-0.5.7

Defined in Data.IntSet.Internal

Methods

(<>) :: IntSet -> IntSet -> IntSet

sconcat :: NonEmpty IntSet -> IntSet

stimes :: Integral b => b -> IntSet -> IntSet

Monoid IntSet

Defined in Data.IntSet.Internal

Methods

mempty :: IntSet

mappend :: IntSet -> IntSet -> IntSet

mconcat :: [IntSet] -> IntSet

NFData IntSet

Defined in Data.IntSet.Internal

Methods

rnf :: IntSet -> ()

Hashable IntSet

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> IntSet -> Int

hash :: IntSet -> Int

One IntSet

Defined in Universum.Container.Class

Associated Types

type OneItem IntSet

Methods

one :: OneItem IntSet -> IntSet

Container IntSet

Defined in Universum.Container.Class

Associated Types

type Element IntSet

Methods

toList :: IntSet -> [Element IntSet]

null :: IntSet -> Bool

foldr :: (Element IntSet -> b -> b) -> b -> IntSet -> b

foldl :: (b -> Element IntSet -> b) -> b -> IntSet -> b

foldl' :: (b -> Element IntSet -> b) -> b -> IntSet -> b

length :: IntSet -> Int

elem :: Element IntSet -> IntSet -> Bool

foldMap :: Monoid m => (Element IntSet -> m) -> IntSet -> m

fold :: IntSet -> Element IntSet

foldr' :: (Element IntSet -> b -> b) -> b -> IntSet -> b

notElem :: Element IntSet -> IntSet -> Bool

all :: (Element IntSet -> Bool) -> IntSet -> Bool

any :: (Element IntSet -> Bool) -> IntSet -> Bool

and :: IntSet -> Bool

or :: IntSet -> Bool

find :: (Element IntSet -> Bool) -> IntSet -> Maybe (Element IntSet)

safeHead :: IntSet -> Maybe (Element IntSet)

safeMaximum :: IntSet -> Maybe (Element IntSet)

safeMinimum :: IntSet -> Maybe (Element IntSet)

safeFoldr1 :: (Element IntSet -> Element IntSet -> Element IntSet) -> IntSet -> Maybe (Element IntSet)

safeFoldl1 :: (Element IntSet -> Element IntSet -> Element IntSet) -> IntSet -> Maybe (Element IntSet)

FromList IntSet

Defined in Universum.Container.Class

Associated Types

type ListElement IntSet

type FromListC IntSet

Methods

fromList :: [ListElement IntSet] -> IntSet

type Item IntSet

Defined in Data.IntSet.Internal

type Item IntSet = Key

type OneItem IntSet

Defined in Universum.Container.Class

type OneItem IntSet = Int

type Element IntSet

Defined in Universum.Container.Class

type Element IntSet = Int

type ListElement IntSet

Defined in Universum.Container.Class

type ListElement IntSet = Item IntSet

type FromListC IntSet

Defined in Universum.Container.Class

type FromListC IntSet = ()

data Map k a

A Map from keys k to values a.

The Semigroup operation for Map is union, which prefers values from the left operand. If m1 maps a key k to a value a1, and m2 maps the same key to a different value a2, then their union m1 <> m2 maps k to a1.

Instances

Eq2 Map

Since: containers-0.5.9

Defined in Data.Map.Internal

Methods

liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Map a c -> Map b d -> Bool

Ord2 Map

Since: containers-0.5.9

Defined in Data.Map.Internal

Methods

liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Map a c -> Map b d -> Ordering

Show2 Map

Since: containers-0.5.9

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

Hashable2 Map

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

liftHashWithSalt2 :: (Int -> a -> Int) -> (Int -> b -> Int) -> Int -> Map a b -> Int

Functor (Map k)

Defined in Data.Map.Internal

Methods

fmap :: (a -> b) -> Map k a -> Map k b

(<$) :: a -> Map k b -> Map k a

Foldable (Map k)

Folds in order of increasing key.

Defined in Data.Map.Internal

Methods

fold :: Monoid m => Map k m -> m

foldMap :: Monoid m => (a -> m) -> Map k a -> 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

toList :: Map k a -> [a]

null :: Map k a -> Bool

length :: Map k a -> Int

elem :: Eq a => a -> Map k a -> Bool

maximum :: Ord a => Map k a -> a

minimum :: Ord a => Map k a -> a

sum :: Num a => Map k a -> a

product :: Num a => Map k a -> a

Traversable (Map k)

Traverses in order of increasing key.

Defined in Data.Map.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Map k a -> f (Map k b)

sequenceA :: Applicative f => Map k (f a) -> f (Map k a)

mapM :: Monad m => (a -> m b) -> Map k a -> m (Map k b)

sequence :: Monad m => Map k (m a) -> m (Map k a)

Eq k => Eq1 (Map k)

Since: containers-0.5.9

Defined in Data.Map.Internal

Methods

liftEq :: (a -> b -> Bool) -> Map k a -> Map k b -> Bool

Ord k => Ord1 (Map k)

Since: containers-0.5.9

Defined in Data.Map.Internal

Methods

liftCompare :: (a -> b -> Ordering) -> Map k a -> Map k b -> Ordering

(Ord k, Read k) => Read1 (Map k)

Since: containers-0.5.9

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)

Since: containers-0.5.9

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

Hashable k => Hashable1 (Map k)

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

liftHashWithSalt :: (Int -> a -> Int) -> Int -> Map k a -> Int

Ord k => IsList (Map k v)

Since: containers-0.5.6.2

Defined in Data.Map.Internal

Associated Types

type Item (Map k v)

Methods

fromList :: [Item (Map k v)] -> Map k v

fromListN :: Int -> [Item (Map k v)] -> Map k v

toList :: Map k v -> [Item (Map k v)]

(Eq k, Eq a) => Eq (Map k a)

Defined in Data.Map.Internal

Methods

(==) :: Map k a -> Map k a -> Bool

(/=) :: Map k a -> Map k a -> Bool

(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)

toConstr :: Map k a -> Constr

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 :: forall r r'. (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)

Defined in Data.Map.Internal

Methods

compare :: Map k v -> Map k v -> Ordering

(<) :: Map k v -> Map k v -> Bool

(<=) :: Map k v -> Map k v -> Bool

(>) :: Map k v -> Map k v -> Bool

(>=) :: Map k v -> Map k v -> Bool

max :: Map k v -> Map k v -> Map k v

min :: Map k v -> Map k v -> Map k v

(Ord k, Read k, Read e) => Read (Map k e)

Defined in Data.Map.Internal

Methods

readsPrec :: Int -> ReadS (Map k e)

readList :: ReadS [Map k e]

readPrec :: ReadPrec (Map k e)

readListPrec :: ReadPrec [Map k e]

(Show k, Show a) => Show (Map k a)

Defined in Data.Map.Internal

Methods

showsPrec :: Int -> Map k a -> ShowS

show :: Map k a -> String

showList :: [Map k a] -> ShowS

Ord k => Semigroup (Map k v)

Defined in Data.Map.Internal

Methods

(<>) :: Map k v -> Map k v -> Map k v

sconcat :: NonEmpty (Map k v) -> Map k v

stimes :: Integral b => b -> Map k v -> Map k v

Ord k => Monoid (Map k v)

Defined in Data.Map.Internal

Methods

mempty :: Map k v

mappend :: Map k v -> Map k v -> Map k v

mconcat :: [Map k v] -> Map k v

(NFData k, NFData a) => NFData (Map k a)

Defined in Data.Map.Internal

Methods

rnf :: Map k a -> ()

(Hashable k, Hashable v) => Hashable (Map k v)

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Map k v -> Int

hash :: Map k v -> Int

One (Map k v)

Defined in Universum.Container.Class

Associated Types

type OneItem (Map k v)

Methods

one :: OneItem (Map k v) -> Map k v

Container (Map k v)

Defined in Universum.Container.Class

Associated Types

type Element (Map k v)

Methods

toList :: Map k v -> [Element (Map k v)]

null :: Map k v -> Bool

foldr :: (Element (Map k v) -> b -> b) -> b -> Map k v -> b

foldl :: (b -> Element (Map k v) -> b) -> b -> Map k v -> b

foldl' :: (b -> Element (Map k v) -> b) -> b -> Map k v -> b

length :: Map k v -> Int

elem :: Element (Map k v) -> Map k v -> Bool

foldMap :: Monoid m => (Element (Map k v) -> m) -> Map k v -> m

fold :: Map k v -> Element (Map k v)

foldr' :: (Element (Map k v) -> b -> b) -> b -> Map k v -> b

notElem :: Element (Map k v) -> Map k v -> Bool

all :: (Element (Map k v) -> Bool) -> Map k v -> Bool

any :: (Element (Map k v) -> Bool) -> Map k v -> Bool

and :: Map k v -> Bool

or :: Map k v -> Bool

find :: (Element (Map k v) -> Bool) -> Map k v -> Maybe (Element (Map k v))

safeHead :: Map k v -> Maybe (Element (Map k v))

safeMaximum :: Map k v -> Maybe (Element (Map k v))

safeMinimum :: Map k v -> Maybe (Element (Map k v))

safeFoldr1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Maybe (Element (Map k v))

safeFoldl1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Maybe (Element (Map k v))

Ord k => FromList (Map k v)

Defined in Universum.Container.Class

Associated Types

type ListElement (Map k v)

type FromListC (Map k v)

Methods

fromList :: [ListElement (Map k v)] -> Map k v

ToPairs (Map k v)

Defined in Universum.Container.Class

Associated Types

type Key (Map k v)

type Val (Map k v)

Methods

toPairs :: Map k v -> [(Key (Map k v), Val (Map k v))]

keys :: Map k v -> [Key (Map k v)]

elems :: Map k v -> [Val (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 Universum.Container.Class

type OneItem (Map k v) = (k, v)

type Element (Map k v)

Defined in Universum.Container.Class

type Element (Map k v)

type ListElement (Map k v)

Defined in Universum.Container.Class

type ListElement (Map k v) = Item (Map k v)

type FromListC (Map k v)

Defined in Universum.Container.Class

type FromListC (Map k v) = ()

type Key (Map k v)

Defined in Universum.Container.Class

type Key (Map k v) = k

type Val (Map k v)

Defined in Universum.Container.Class

type Val (Map k v) = v

data Seq a

General-purpose finite sequences.

Instances

Monad Seq

Defined in Data.Sequence.Internal

Methods

(>>=) :: Seq a -> (a -> Seq b) -> Seq b

(>>) :: Seq a -> Seq b -> Seq b

return :: a -> Seq a

Functor Seq

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Seq a -> Seq b

(<$) :: a -> Seq b -> Seq a

MonadFix Seq

Since: containers-0.5.11

Defined in Data.Sequence.Internal

Methods

mfix :: (a -> Seq a) -> Seq a

Applicative Seq

Since: containers-0.5.4

Defined in Data.Sequence.Internal

Methods

pure :: a -> Seq a

(<*>) :: Seq (a -> b) -> Seq a -> Seq b

liftA2 :: (a -> b -> c) -> Seq a -> Seq b -> Seq c

(*>) :: Seq a -> Seq b -> Seq b

(<*) :: Seq a -> Seq b -> Seq a

Foldable Seq

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => Seq m -> m

foldMap :: Monoid m => (a -> m) -> Seq a -> 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

toList :: Seq a -> [a]

null :: Seq a -> Bool

length :: Seq a -> Int

elem :: Eq a => a -> Seq a -> Bool

maximum :: Ord a => Seq a -> a

minimum :: Ord a => Seq a -> a

sum :: Num a => Seq a -> a

product :: Num a => Seq a -> a

Traversable Seq

Defined in Data.Sequence.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Seq a -> f (Seq b)

sequenceA :: Applicative f => Seq (f a) -> f (Seq a)

mapM :: Monad m => (a -> m b) -> Seq a -> m (Seq b)

sequence :: Monad m => Seq (m a) -> m (Seq a)

Eq1 Seq

Since: containers-0.5.9

Defined in Data.Sequence.Internal

Methods

liftEq :: (a -> b -> Bool) -> Seq a -> Seq b -> Bool

Ord1 Seq

Since: containers-0.5.9

Defined in Data.Sequence.Internal

Methods

liftCompare :: (a -> b -> Ordering) -> Seq a -> Seq b -> Ordering

Read1 Seq

Since: containers-0.5.9

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

Since: containers-0.5.9

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

 mzipWith = zipWith

 munzip = unzip

Defined in Data.Sequence.Internal

Methods

mzip :: Seq a -> Seq b -> Seq (a, b)

mzipWith :: (a -> b -> c) -> Seq a -> Seq b -> Seq c

munzip :: Seq (a, b) -> (Seq a, Seq b)

Alternative Seq

Since: containers-0.5.4

Defined in Data.Sequence.Internal

Methods

empty :: Seq a

(<|>) :: Seq a -> Seq a -> Seq a

some :: Seq a -> Seq [a]

many :: Seq a -> Seq [a]

MonadPlus Seq

Defined in Data.Sequence.Internal

Methods

mzero :: Seq a

mplus :: Seq a -> Seq a -> Seq a

Hashable1 Seq

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

liftHashWithSalt :: (Int -> a -> Int) -> Int -> Seq a -> Int

UnzipWith Seq

Defined in Data.Sequence.Internal

Methods

unzipWith' :: (x -> (a, b)) -> Seq x -> (Seq a, Seq b)

IsList (Seq a)

Defined in Data.Sequence.Internal

Associated Types

type Item (Seq a)

Methods

fromList :: [Item (Seq a)] -> Seq a

fromListN :: Int -> [Item (Seq a)] -> Seq a

toList :: Seq a -> [Item (Seq a)]

Eq a => Eq (Seq a)

Defined in Data.Sequence.Internal

Methods

(==) :: Seq a -> Seq a -> Bool

(/=) :: Seq a -> Seq a -> Bool

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)

toConstr :: Seq a -> Constr

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 :: forall r r'. (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)

Defined in Data.Sequence.Internal

Methods

compare :: Seq a -> Seq a -> Ordering

(<) :: Seq a -> Seq a -> Bool

(<=) :: Seq a -> Seq a -> Bool

(>) :: Seq a -> Seq a -> Bool

(>=) :: Seq a -> Seq a -> Bool

max :: Seq a -> Seq a -> Seq a

min :: Seq a -> Seq a -> Seq a

Read a => Read (Seq a)

Defined in Data.Sequence.Internal

Methods

readsPrec :: Int -> ReadS (Seq a)

readList :: ReadS [Seq a]

readPrec :: ReadPrec (Seq a)

readListPrec :: ReadPrec [Seq a]

Show a => Show (Seq a)

Defined in Data.Sequence.Internal

Methods

showsPrec :: Int -> Seq a -> ShowS

show :: Seq a -> String

showList :: [Seq a] -> ShowS

a ~ Char => IsString (Seq a)

Since: containers-0.5.7

Defined in Data.Sequence.Internal

Methods

fromString :: String -> Seq a

Semigroup (Seq a)

Since: containers-0.5.7

Defined in Data.Sequence.Internal

Methods

(<>) :: Seq a -> Seq a -> Seq a

sconcat :: NonEmpty (Seq a) -> Seq a

stimes :: Integral b => b -> Seq a -> Seq a

Monoid (Seq a)

Defined in Data.Sequence.Internal

Methods

mempty :: Seq a

mappend :: Seq a -> Seq a -> Seq a

mconcat :: [Seq a] -> Seq a

NFData a => NFData (Seq a)

Defined in Data.Sequence.Internal

Methods

rnf :: Seq a -> ()

Hashable v => Hashable (Seq v)

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Seq v -> Int

hash :: Seq v -> Int

One (Seq a)

Defined in Universum.Container.Class

Associated Types

type OneItem (Seq a)

Methods

one :: OneItem (Seq a) -> Seq a

Container (Seq a)

Defined in Universum.Container.Class

Associated Types

type Element (Seq a)

Methods

toList :: Seq a -> [Element (Seq a)]

null :: Seq a -> Bool

foldr :: (Element (Seq a) -> b -> b) -> b -> Seq a -> b

foldl :: (b -> Element (Seq a) -> b) -> b -> Seq a -> b

foldl' :: (b -> Element (Seq a) -> b) -> b -> Seq a -> b

length :: Seq a -> Int

elem :: Element (Seq a) -> Seq a -> Bool

foldMap :: Monoid m => (Element (Seq a) -> m) -> Seq a -> m

fold :: Seq a -> Element (Seq a)

foldr' :: (Element (Seq a) -> b -> b) -> b -> Seq a -> b

notElem :: Element (Seq a) -> Seq a -> Bool

all :: (Element (Seq a) -> Bool) -> Seq a -> Bool

any :: (Element (Seq a) -> Bool) -> Seq a -> Bool

and :: Seq a -> Bool

or :: Seq a -> Bool

find :: (Element (Seq a) -> Bool) -> Seq a -> Maybe (Element (Seq a))

safeHead :: Seq a -> Maybe (Element (Seq a))

safeMaximum :: Seq a -> Maybe (Element (Seq a))

safeMinimum :: Seq a -> Maybe (Element (Seq a))

safeFoldr1 :: (Element (Seq a) -> Element (Seq a) -> Element (Seq a)) -> Seq a -> Maybe (Element (Seq a))

safeFoldl1 :: (Element (Seq a) -> Element (Seq a) -> Element (Seq a)) -> Seq a -> Maybe (Element (Seq a))

FromList (Seq a)

Defined in Universum.Container.Class

Associated Types

type ListElement (Seq a)

type FromListC (Seq a)

Methods

fromList :: [ListElement (Seq a)] -> Seq a

type Item (Seq a)

Defined in Data.Sequence.Internal

type Item (Seq a) = a

type OneItem (Seq a)

Defined in Universum.Container.Class

type OneItem (Seq a) = a

type Element (Seq a)

Defined in Universum.Container.Class

type Element (Seq a)

type ListElement (Seq a)

Defined in Universum.Container.Class

type ListElement (Seq a) = Item (Seq a)

type FromListC (Seq a)

Defined in Universum.Container.Class

type FromListC (Seq a) = ()

data Set a

A set of values a.

Instances

Foldable Set

Folds in order of increasing key.

Defined in Data.Set.Internal

Methods

fold :: Monoid m => Set m -> m

foldMap :: Monoid m => (a -> m) -> Set a -> 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

toList :: Set a -> [a]

null :: Set a -> Bool

length :: Set a -> Int

elem :: Eq a => a -> Set a -> Bool

maximum :: Ord a => Set a -> a

minimum :: Ord a => Set a -> a

sum :: Num a => Set a -> a

product :: Num a => Set a -> a

Eq1 Set

Since: containers-0.5.9

Defined in Data.Set.Internal

Methods

liftEq :: (a -> b -> Bool) -> Set a -> Set b -> Bool

Ord1 Set

Since: containers-0.5.9

Defined in Data.Set.Internal

Methods

liftCompare :: (a -> b -> Ordering) -> Set a -> Set b -> Ordering

Show1 Set

Since: containers-0.5.9

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

Hashable1 Set

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

liftHashWithSalt :: (Int -> a -> Int) -> Int -> Set a -> Int

Ord a => IsList (Set a)

Since: containers-0.5.6.2

Defined in Data.Set.Internal

Associated Types

type Item (Set a)

Methods

fromList :: [Item (Set a)] -> Set a

fromListN :: Int -> [Item (Set a)] -> Set a

toList :: Set a -> [Item (Set a)]

Eq a => Eq (Set a)

Defined in Data.Set.Internal

Methods

(==) :: Set a -> Set a -> Bool

(/=) :: Set a -> Set a -> Bool

(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)

toConstr :: Set a -> Constr

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 :: forall r r'. (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)

Defined in Data.Set.Internal

Methods

compare :: Set a -> Set a -> Ordering

(<) :: Set a -> Set a -> Bool

(<=) :: Set a -> Set a -> Bool

(>) :: Set a -> Set a -> Bool

(>=) :: Set a -> Set a -> Bool

max :: Set a -> Set a -> Set a

min :: Set a -> Set a -> Set a

(Read a, Ord a) => Read (Set a)

Defined in Data.Set.Internal

Methods

readsPrec :: Int -> ReadS (Set a)

readList :: ReadS [Set a]

readPrec :: ReadPrec (Set a)

readListPrec :: ReadPrec [Set a]

Show a => Show (Set a)

Defined in Data.Set.Internal

Methods

showsPrec :: Int -> Set a -> ShowS

show :: Set a -> String

showList :: [Set a] -> ShowS

Ord a => Semigroup (Set a)

Since: containers-0.5.7

Defined in Data.Set.Internal

Methods

(<>) :: Set a -> Set a -> Set a

sconcat :: NonEmpty (Set a) -> Set a

stimes :: Integral b => b -> Set a -> Set a

Ord a => Monoid (Set a)

Defined in Data.Set.Internal

Methods

mempty :: Set a

mappend :: Set a -> Set a -> Set a

mconcat :: [Set a] -> Set a

NFData a => NFData (Set a)

Defined in Data.Set.Internal

Methods

rnf :: Set a -> ()

Hashable v => Hashable (Set v)

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Set v -> Int

hash :: Set v -> Int

One (Set v)

Defined in Universum.Container.Class

Associated Types

type OneItem (Set v)

Methods

one :: OneItem (Set v) -> Set v

Ord v => Container (Set v)

Defined in Universum.Container.Class

Associated Types

type Element (Set v)

Methods

toList :: Set v -> [Element (Set v)]

null :: Set v -> Bool

foldr :: (Element (Set v) -> b -> b) -> b -> Set v -> b

foldl :: (b -> Element (Set v) -> b) -> b -> Set v -> b

foldl' :: (b -> Element (Set v) -> b) -> b -> Set v -> b

length :: Set v -> Int

elem :: Element (Set v) -> Set v -> Bool

foldMap :: Monoid m => (Element (Set v) -> m) -> Set v -> m

fold :: Set v -> Element (Set v)

foldr' :: (Element (Set v) -> b -> b) -> b -> Set v -> b

notElem :: Element (Set v) -> Set v -> Bool

all :: (Element (Set v) -> Bool) -> Set v -> Bool

any :: (Element (Set v) -> Bool) -> Set v -> Bool

and :: Set v -> Bool

or :: Set v -> Bool

find :: (Element (Set v) -> Bool) -> Set v -> Maybe (Element (Set v))

safeHead :: Set v -> Maybe (Element (Set v))

safeMaximum :: Set v -> Maybe (Element (Set v))

safeMinimum :: Set v -> Maybe (Element (Set v))

safeFoldr1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Maybe (Element (Set v))

safeFoldl1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Maybe (Element (Set v))

Ord a => FromList (Set a)

Defined in Universum.Container.Class

Associated Types

type ListElement (Set a)

type FromListC (Set a)

Methods

fromList :: [ListElement (Set a)] -> Set a

type Item (Set a)

Defined in Data.Set.Internal

type Item (Set a) = a

type OneItem (Set v)

Defined in Universum.Container.Class

type OneItem (Set v) = v

type Element (Set v)

Defined in Universum.Container.Class

type Element (Set v)

type ListElement (Set a)

Defined in Universum.Container.Class

type ListElement (Set a) = Item (Set a)

type FromListC (Set a)

Defined in Universum.Container.Class

type FromListC (Set a) = ()

fst :: (a, b) -> a

Extract the first component of a pair.

snd :: (a, b) -> b

Extract the second component of a pair.

swap :: (a, b) -> (b, a)

Swap the components of a pair.

uncurry :: (a -> b -> c) -> (a, b) -> c

uncurry converts a curried function to a function on pairs.

Examples

>>> uncurry (+) (1,2)
3

>>> uncurry ($) (show, 1)
"1"

>>> map (uncurry max) [(1,2), (3,4), (6,8)]
[2,4,8]

curry :: ((a, b) -> c) -> a -> b -> c

curry converts an uncurried function to a curried function.

Examples

>>> curry fst 1 2
1

data Vector a

Boxed vectors, supporting efficient slicing.

Instances

Monad Vector

Defined in Data.Vector

Methods

(>>=) :: Vector a -> (a -> Vector b) -> Vector b

(>>) :: Vector a -> Vector b -> Vector b

return :: a -> Vector a

Functor Vector

Defined in Data.Vector

Methods

fmap :: (a -> b) -> Vector a -> Vector b

(<$) :: a -> Vector b -> Vector a

MonadFix Vector

This instance has the same semantics as the one for lists.

Since: vector-0.12.2.0

Defined in Data.Vector

Methods

mfix :: (a -> Vector a) -> Vector a

MonadFail Vector

Since: vector-0.12.1.0

Defined in Data.Vector

Methods

fail :: String -> Vector a

Applicative Vector

Defined in Data.Vector

Methods

pure :: a -> Vector a

(<*>) :: Vector (a -> b) -> Vector a -> Vector b

liftA2 :: (a -> b -> c) -> Vector a -> Vector b -> Vector c

(*>) :: Vector a -> Vector b -> Vector b

(<*) :: Vector a -> Vector b -> Vector a

Foldable Vector

Defined in Data.Vector

Methods

fold :: Monoid m => Vector m -> m

foldMap :: Monoid m => (a -> m) -> Vector a -> m

foldMap' :: Monoid m => (a -> m) -> Vector a -> m

foldr :: (a -> b -> b) -> b -> Vector a -> b

foldr' :: (a -> b -> b) -> b -> Vector a -> b

foldl :: (b -> a -> b) -> b -> Vector a -> b

foldl' :: (b -> a -> b) -> b -> Vector a -> b

foldr1 :: (a -> a -> a) -> Vector a -> a

foldl1 :: (a -> a -> a) -> Vector a -> a

toList :: Vector a -> [a]

null :: Vector a -> Bool

length :: Vector a -> Int

elem :: Eq a => a -> Vector a -> Bool

maximum :: Ord a => Vector a -> a

minimum :: Ord a => Vector a -> a

sum :: Num a => Vector a -> a

product :: Num a => Vector a -> a

Traversable Vector

Defined in Data.Vector

Methods

traverse :: Applicative f => (a -> f b) -> Vector a -> f (Vector b)

sequenceA :: Applicative f => Vector (f a) -> f (Vector a)

mapM :: Monad m => (a -> m b) -> Vector a -> m (Vector b)

sequence :: Monad m => Vector (m a) -> m (Vector a)

Eq1 Vector

Defined in Data.Vector

Methods

liftEq :: (a -> b -> Bool) -> Vector a -> Vector b -> Bool

Ord1 Vector

Defined in Data.Vector

Methods

liftCompare :: (a -> b -> Ordering) -> Vector a -> Vector b -> Ordering

Read1 Vector

Defined in Data.Vector

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Vector a)

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Vector a]

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Vector a)

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Vector a]

Show1 Vector

Defined in Data.Vector

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Vector a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Vector a] -> ShowS

MonadZip Vector

Defined in Data.Vector

Methods

mzip :: Vector a -> Vector b -> Vector (a, b)

mzipWith :: (a -> b -> c) -> Vector a -> Vector b -> Vector c

munzip :: Vector (a, b) -> (Vector a, Vector b)

Alternative Vector

Defined in Data.Vector

Methods

empty :: Vector a

(<|>) :: Vector a -> Vector a -> Vector a

some :: Vector a -> Vector [a]

many :: Vector a -> Vector [a]

MonadPlus Vector

Defined in Data.Vector

Methods

mzero :: Vector a

mplus :: Vector a -> Vector a -> Vector a

NFData1 Vector

Since: vector-0.12.1.0

Defined in Data.Vector

Methods

liftRnf :: (a -> ()) -> Vector a -> ()

Vector Vector a

Defined in Data.Vector

Methods

basicUnsafeFreeze :: Mutable Vector s a -> ST s (Vector a)

basicUnsafeThaw :: Vector a -> ST s (Mutable Vector s a)

basicLength :: Vector a -> Int

basicUnsafeSlice :: Int -> Int -> Vector a -> Vector a

basicUnsafeIndexM :: Vector a -> Int -> Box a

basicUnsafeCopy :: Mutable Vector s a -> Vector a -> ST s ()

elemseq :: Vector a -> a -> b -> b

IsList (Vector a)

Defined in Data.Vector

Associated Types

type Item (Vector a)

Methods

fromList :: [Item (Vector a)] -> Vector a

fromListN :: Int -> [Item (Vector a)] -> Vector a

toList :: Vector a -> [Item (Vector a)]

Eq a => Eq (Vector a)

Defined in Data.Vector

Methods

(==) :: Vector a -> Vector a -> Bool

(/=) :: Vector a -> Vector a -> Bool

Data a => Data (Vector a)

Defined in Data.Vector

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Vector a -> c (Vector a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Vector a)

toConstr :: Vector a -> Constr

dataTypeOf :: Vector a -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Vector a))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Vector a))

gmapT :: (forall b. Data b => b -> b) -> Vector a -> Vector a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Vector a -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Vector a -> r

gmapQ :: (forall d. Data d => d -> u) -> Vector a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Vector a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a)

Ord a => Ord (Vector a)

Defined in Data.Vector

Methods

compare :: Vector a -> Vector a -> Ordering

(<) :: Vector a -> Vector a -> Bool

(<=) :: Vector a -> Vector a -> Bool

(>) :: Vector a -> Vector a -> Bool

(>=) :: Vector a -> Vector a -> Bool

max :: Vector a -> Vector a -> Vector a

min :: Vector a -> Vector a -> Vector a

Read a => Read (Vector a)

Defined in Data.Vector

Methods

readsPrec :: Int -> ReadS (Vector a)

readList :: ReadS [Vector a]

readPrec :: ReadPrec (Vector a)

readListPrec :: ReadPrec [Vector a]

Show a => Show (Vector a)

Defined in Data.Vector

Methods

showsPrec :: Int -> Vector a -> ShowS

show :: Vector a -> String

showList :: [Vector a] -> ShowS

Semigroup (Vector a)

Defined in Data.Vector

Methods

(<>) :: Vector a -> Vector a -> Vector a

sconcat :: NonEmpty (Vector a) -> Vector a

stimes :: Integral b => b -> Vector a -> Vector a

Monoid (Vector a)

Defined in Data.Vector

Methods

mempty :: Vector a

mappend :: Vector a -> Vector a -> Vector a

mconcat :: [Vector a] -> Vector a

NFData a => NFData (Vector a)

Defined in Data.Vector

Methods

rnf :: Vector a -> ()

One (Vector a)

Defined in Universum.Container.Class

Associated Types

type OneItem (Vector a)

Methods

one :: OneItem (Vector a) -> Vector a

Container (Vector a)

Defined in Universum.Container.Class

Associated Types

type Element (Vector a)

Methods

toList :: Vector a -> [Element (Vector a)]

null :: Vector a -> Bool

foldr :: (Element (Vector a) -> b -> b) -> b -> Vector a -> b

foldl :: (b -> Element (Vector a) -> b) -> b -> Vector a -> b

foldl' :: (b -> Element (Vector a) -> b) -> b -> Vector a -> b

length :: Vector a -> Int

elem :: Element (Vector a) -> Vector a -> Bool

foldMap :: Monoid m => (Element (Vector a) -> m) -> Vector a -> m

fold :: Vector a -> Element (Vector a)

foldr' :: (Element (Vector a) -> b -> b) -> b -> Vector a -> b

notElem :: Element (Vector a) -> Vector a -> Bool

all :: (Element (Vector a) -> Bool) -> Vector a -> Bool

any :: (Element (Vector a) -> Bool) -> Vector a -> Bool

and :: Vector a -> Bool

or :: Vector a -> Bool

find :: (Element (Vector a) -> Bool) -> Vector a -> Maybe (Element (Vector a))

safeHead :: Vector a -> Maybe (Element (Vector a))

safeMaximum :: Vector a -> Maybe (Element (Vector a))

safeMinimum :: Vector a -> Maybe (Element (Vector a))

safeFoldr1 :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Maybe (Element (Vector a))

safeFoldl1 :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Maybe (Element (Vector a))

FromList (Vector a)

Defined in Universum.Container.Class

Associated Types

type ListElement (Vector a)

type FromListC (Vector a)

Methods

fromList :: [ListElement (Vector a)] -> Vector a

type Mutable Vector

Defined in Data.Vector

type Mutable Vector = MVector

type Item (Vector a)

Defined in Data.Vector

type Item (Vector a) = a

type OneItem (Vector a)

Defined in Universum.Container.Class

type OneItem (Vector a) = a

type Element (Vector a)

Defined in Universum.Container.Class

type Element (Vector a)

type ListElement (Vector a)

Defined in Universum.Container.Class

type ListElement (Vector a) = Item (Vector a)

type FromListC (Vector a)

Defined in Universum.Container.Class

type FromListC (Vector a) = ()