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. fromTSet :: ([c] -> a) -> TSet c -> TMap c a

   trie-simple	Data.Trie.Map

   No documentation available.

2. keysTSet :: TMap c a -> TSet c

   trie-simple	Data.Trie.Map

   No documentation available.

3. data TSet c

   trie-simple	Data.Trie.Set

   No documentation available.

4. fromSet :: Eq c => Set [c] -> TSet c

   trie-simple	Data.Trie.Set

   No documentation available.

5. toSet :: TSet c -> Set [c]

   trie-simple	Data.Trie.Set

   No documentation available.

6. newtype TSet c

   trie-simple	Data.Trie.Set.Internal

   No documentation available.

7. TSet :: Node c (TSet c) -> TSet c

   trie-simple	Data.Trie.Set.Internal

   No documentation available.

8. foldTSet :: (Node c r -> r) -> TSet c -> r

   trie-simple	Data.Trie.Set.Internal

   No documentation available.

9. paraTSet :: (Node c (TSet c, r) -> r) -> TSet c -> r

   trie-simple	Data.Trie.Set.Internal

   No documentation available.

10. reverseT :: ReverseT s t => s -> t

    tuple-sop	Data.Tuple.Ops

    Reverses the order of elements in an n-ary tuple

    >>> reverseT (1,2,3,4)
    (4,3,2,1)
    

Page 217 of many | Previous | Next