Hoogle Search

Within LTS Haskell 24.37 (ghc-9.10.3)

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

Exact lookup

1. toList :: forall (b :: Bin) a . RAVec b a -> [a]

   ral	Data.RAVec

   No documentation available.

2. toList :: forall (b :: BinP) a . NERAVec b a -> [a]

   ral	Data.RAVec.NonEmpty

   No documentation available.

3. toList' :: forall (n :: Nat) (b :: BinP) a . NERAVec' n b a -> [a]

   ral	Data.RAVec.NonEmpty

   No documentation available.

4. toList :: forall (n :: Nat) a . Tree n a -> [a]

   ral	Data.RAVec.Tree

   Convert Tree to list.

   >>> toList $ Node (Node (Leaf 'a') (Leaf 'b')) (Node (Leaf 'c') (Leaf 'd'))
   "abcd"
   

5. toList :: forall (n :: Nat) a . SNatI n => Tree n a -> [a]

   ral	Data.RAVec.Tree.DF

   Convert Tree to list.

   >>> toList $ Node (Node (Leaf 'f') (Leaf 'o')) (Node (Leaf 'o') (Leaf 'd'))
   "food"
   

6. fromAscList :: [Int] -> RIntSet

   range-set-list	Data.RangeSet.IntMap

   O(n). Create a set from a list of ascending elements. The precondition is not checked. You may use valid to check the result. Note that unlike Data.Set and other binary trees, this always requires a full traversal to create distinct, disjoint ranges before constructing the tree.

7. fromList :: [Int] -> RIntSet

   range-set-list	Data.RangeSet.IntMap

   O(n*log n). Create a set from a list of elements. 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.

8. fromNormalizedRangeList :: [(Int, Int)] -> RIntSet

   range-set-list	Data.RangeSet.IntMap

   O(n). Convert a normalized, non-adjacent, ascending list of ranges to a set. The precondition is not checked. In general you should only use this function on the result of toRangeList or ensure valid on the result.

9. fromRList :: RSet Int -> RIntSet

   range-set-list	Data.RangeSet.IntMap

   O(n). Convert a list-based RSet to a map-based RIntSet.

10. fromRangeList :: [(Int, Int)] -> RIntSet

    range-set-list	Data.RangeSet.IntMap

    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.

Page 214 of many | Previous | Next