Hoogle Search

Within LTS Haskell 24.61 (ghc-9.10.3)

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

Exact lookup

1. data RSet a

   range-set-list	Data.RangeSet.Map

   Internally set is represented as sorted list of distinct inclusive ranges.

2. isSubsetOf :: Ord a => RSet a -> RSet a -> Bool

   range-set-list	Data.RangeSet.Map

   O(n+m). Is this a subset? (s1 isSubsetOf s2) tells whether s1 is a subset of s2.

3. toSet :: Ord a => Ranges a -> Set (Range a)

   ranges	Data.Ranges

   Allows quick lookups using ranges.

4. parseTriple :: Parser Triple

   rdf	Data.RDF.Parser.NQuads

   Parse a single N-Quads Triple.

5. newtype RSet a

   rec-def	Data.Recursive.Internal

   Like Set, but admits recursive definitions.

6. RSet :: Purify (Prop (Set a)) -> RSet a

   rec-def	Data.Recursive.Internal

   No documentation available.

7. fromSet :: (a -> b) -> RSet a -> RMap a b

   rec-def	Data.Recursive.Map

   RM.get (RM.singleton k v) === M.singleton k v
   

8. keysSet :: RMap a b -> RSet a

   rec-def	Data.Recursive.Map

   RS.get (RM.keysSet m) === M.keysSet (RM.get m)
   

9. data RSet a

   rec-def	Data.Recursive.Set

   Like Set, but admits recursive definitions.

10. type OffsetMapWithAlignment = Map Int (Int, Int)

    reflex-vty	Data.Text.Zipper

    A map from the index (row) of display line to (fst,snd) fst: leading empty spaces from left (may be negative) to adjust for alignment snd: the text offset from the beginning of the document to the first character of the display line

Page 209 of many | Previous | Next