Hoogle Search
Within LTS Haskell 24.62 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
range-set-list Data.RangeSet.Map fromRangeList :: (Ord a, Enum a) => [(a, a)] -> RSet arange-set-list Data.RangeSet.Map O(n*log n). Create a set from a list of range pairs. Note that unlike Data.Set and other binary trees, this always requires a full sort and traversal to create distinct, disjoint ranges before constructing the tree.
toAscList :: Enum a => RSet a -> [a]range-set-list Data.RangeSet.Map O(n*r). Convert the set to an ascending list of elements.
toList :: Enum a => RSet a -> [a]range-set-list Data.RangeSet.Map O(n*r). Convert the set to a list of elements (in arbitrary order). r is the size of longest range.
-
range-set-list Data.RangeSet.Map toRangeList :: RSet a -> [(a, a)]range-set-list Data.RangeSet.Map O(n). Convert the set to a list of range pairs.
liftList :: POrder b => ([a] -> b) -> [Prop a] -> Prop b -> IO ()rec-def Data.Propagator.Naive Whenever any of the cells in the list change, update the other, using the given function
defList :: (Propagator pa a, Propagator pb b) => ([pa] -> pb -> IO ()) -> [Purify pa] -> Purify pbrec-def Data.Propagator.Purify Defines a value of type Purify b to be a function of the values of a list of Purify a values. The action passed should declare that relation to the underlying propagator. The Prop a propagators must only be used for reading values from.
decodeListOf :: Typeable a => Typed (Decoder a -> Decoder [a])registry-aeson Data.Registry.Aeson.Decoder Add a Decoder [a] to a registry of decoders usage: decoders = decodeListOf @a <: otherDecoders the list of otherDecoders must contain a Decoder a otherwise there will be a compilation error
encodeListOf :: Typeable a => Typed (Encoder a -> Encoder [a])registry-aeson Data.Registry.Aeson.Encoder Create an Encoder for a list [a]