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.

Exact lookup

1. toAdjacencySets :: DenseAdjMatrix -> AdjacencySets

   digraph	Data.DiGraph.FloydWarshall

   Converts an adjacency matrix into a graph in adjacnency set representation.

2. sortingSet :: Foldable f => Sort k -> Sort (f k)

   discrimination	Data.Discrimination

   Construct a stable ordered discriminator that sorts a list as sets of elements from another stable ordered discriminator. The resulting discriminator only cares about the set of keys, and is sorted as if we'd sorted each key in turn before comparing.

3. toIntSet :: [Int] -> IntSet

   discrimination	Data.Discrimination

   O(n). Construct an IntSet in linear time. This is an asymptotically faster version of fromList, which exploits ordered discrimination.

4. toSet :: Sorting k => [k] -> Set k

   discrimination	Data.Discrimination

   O(n). Construct a Set in linear time. This is an asymptotically faster version of fromList, which exploits ordered discrimination.

5. updateSet :: [Int] -> Int -> [Int]

   discrimination	Data.Discrimination.Internal

   No documentation available.

6. sortingSet :: Foldable f => Sort k -> Sort (f k)

   discrimination	Data.Discrimination.Sorting

   Construct a stable ordered discriminator that sorts a list as sets of elements from another stable ordered discriminator. The resulting discriminator only cares about the set of keys, and is sorted as if we'd sorted each key in turn before comparing.

7. toIntSet :: [Int] -> IntSet

   discrimination	Data.Discrimination.Sorting

   O(n). Construct an IntSet in linear time. This is an asymptotically faster version of fromList, which exploits ordered discrimination.

8. toSet :: Sorting k => [k] -> Set k

   discrimination	Data.Discrimination.Sorting

   O(n). Construct a Set in linear time. This is an asymptotically faster version of fromList, which exploits ordered discrimination.

9. elfRelOffset :: ElfRel -> Word64

   elf	Data.Elf

   No documentation available.

10. appendSetFocusFL :: FocusList a -> a -> FocusList a

    focuslist	Data.FocusList

    A combination of appendFL and setFocusFL.

    >>> let Just fl = fromListFL (Focus 1) ["hello", "bye", "tree"]
    
    >>> appendSetFocusFL fl "pie"
    FocusList (Focus 3) ["hello","bye","tree","pie"]
    

    The Focus will always be updated after calling appendSetFocusFL.

    getFocusFL (appendSetFocusFL fl a) > getFocusFL fl
    

    complexity: O(log n) where n is the length of the FocusList.

Page 186 of many | Previous | Next