Hoogle Search
Within LTS Haskell 24.35 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
fromDistinctAscList :: [a] -> Set acontainers Data.Set.Internal Build a set from an ascending list of distinct elements in linear time. The precondition (input list is strictly ascending) is not checked.
fromDistinctDescList :: [a] -> Set acontainers Data.Set.Internal Build a set from a descending list of distinct elements in linear time. The precondition (input list is strictly descending) is not checked.
fromList :: Ord a => [a] -> Set acontainers Data.Set.Internal Create a set from a list of elements. If the elements are ordered, a linear-time implementation is used.
-
containers Data.Set.Internal Convert the set to an ascending list of elements. Subject to list fusion.
-
containers Data.Set.Internal Convert the set to a descending list of elements. Subject to list fusion.
-
containers Data.Set.Internal Convert the set to a list of elements. Subject to list fusion.
fromJSONKeyList :: FromJSONKey a => FromJSONKeyFunction [a]aeson Data.Aeson This is similar in spirit to the readList method of Read. It makes it possible to give String keys special treatment without using OverlappingInstances. End users should always be able to use the default implementation of this method.
-
aeson Data.Aeson No documentation available.
-
aeson Data.Aeson No documentation available.
-
aeson Data.Aeson No documentation available.