Hoogle Search

Within Stackage Nightly 2025-09-30 (ghc-9.12.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. argSet :: Map k a -> Set (Arg k a)

    containers Data.Map.Strict

    The set of all elements of the map contained in Args. 

    argSet (fromList [(5,"a"), (3,"b")]) == Data.Set.fromList [Arg 3 "b",Arg 5 "a"]
argSet empty == Data.Set.empty

  2. fromArgSet :: Set (Arg k a) -> Map k a

    containers Data.Map.Strict

    Build a map from a set of elements contained inside Args. 

    fromArgSet (Data.Set.fromList [Arg 3 "aaa", Arg 5 "aaaaa"]) == fromList [(5,"aaaaa"), (3,"aaa")]
fromArgSet Data.Set.empty == empty

  3. fromSet :: (k -> a) -> Set k -> Map k a

    containers Data.Map.Strict

    Build a map from a set of keys and a function which for each key computes its value. 

    fromSet (\k -> replicate k 'a') (Data.Set.fromList [3, 5]) == fromList [(5,"aaaaa"), (3,"aaa")]
fromSet undefined Data.Set.empty == empty

  4. keysSet :: Map k a -> Set k

    containers Data.Map.Strict

    The set of all keys of the map. 

    keysSet (fromList [(5,"a"), (3,"b")]) == Data.Set.fromList [3,5]
keysSet empty == Data.Set.empty

  5. argSet :: Map k a -> Set (Arg k a)

    containers Data.Map.Strict.Internal

    The set of all elements of the map contained in Args. 

    argSet (fromList [(5,"a"), (3,"b")]) == Data.Set.fromList [Arg 3 "b",Arg 5 "a"]
argSet empty == Data.Set.empty

  6. fromArgSet :: Set (Arg k a) -> Map k a

    containers Data.Map.Strict.Internal

    Build a map from a set of elements contained inside Args. 

    fromArgSet (Data.Set.fromList [Arg 3 "aaa", Arg 5 "aaaaa"]) == fromList [(5,"aaaaa"), (3,"aaa")]
fromArgSet Data.Set.empty == empty

  7. fromSet :: (k -> a) -> Set k -> Map k a

    containers Data.Map.Strict.Internal

    Build a map from a set of keys and a function which for each key computes its value. 

    fromSet (\k -> replicate k 'a') (Data.Set.fromList [3, 5]) == fromList [(5,"aaaaa"), (3,"aaa")]
fromSet undefined Data.Set.empty == empty

  8. keysSet :: Map k a -> Set k

    containers Data.Map.Strict.Internal

    The set of all keys of the map. 

    keysSet (fromList [(5,"a"), (3,"b")]) == Data.Set.fromList [3,5]
keysSet empty == Data.Set.empty

  9. isProperSubsetOf :: Ord a => Set a -> Set a -> Bool

    containers Data.Set

    (s1 `isProperSubsetOf` s2) indicates whether s1 is a proper subset of s2. 

    s1 `isProperSubsetOf` s2 = s1 `isSubsetOf` s2 && s1 /= s2

  10. isSubsetOf :: Ord a => Set a -> Set a -> Bool

    containers Data.Set

    (s1 `isSubsetOf` s2) indicates whether s1 is a subset of s2. 

    s1 `isSubsetOf` s2 = all (`member` s2) s1
s1 `isSubsetOf` s2 = null (s1 `difference` s2)
s1 `isSubsetOf` s2 = s1 `union` s2 == s2
s1 `isSubsetOf` s2 = s1 `intersection` s2 == s1

Page 72 of many | Previous | Next