Hoogle Search

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

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

Exact lookup

1. isProperSubsetOf :: IntSet -> IntSet -> Bool

   containers	Data.IntSet.Internal

   Is this a proper subset? (ie. a subset but not equal).

2. isSubsetOf :: IntSet -> IntSet -> Bool

   containers	Data.IntSet.Internal

   Is this a subset? (s1 `isSubsetOf` s2) tells whether s1 is a subset of s2.

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

   containers	Data.Map.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
   

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

   containers	Data.Map.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
   

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

   containers	Data.Map.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
   

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

   containers	Data.Map.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
   

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

   containers	Data.Map.Lazy

   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
   

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

   containers	Data.Map.Lazy

   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
   

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

   containers	Data.Map.Lazy

   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
   

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

    containers	Data.Map.Lazy

    The set of all keys of the map.

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

Page 71 of many | Previous | Next