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. keysTSet :: TMap c a -> TSet c

   trie-simple	Data.Trie.Map

   No documentation available.

2. data TSet c

   trie-simple	Data.Trie.Set

   No documentation available.

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

   trie-simple	Data.Trie.Set

   No documentation available.

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

   trie-simple	Data.Trie.Set

   No documentation available.

5. newtype TSet c

   trie-simple	Data.Trie.Set.Internal

   No documentation available.

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

   trie-simple	Data.Trie.Set.Internal

   No documentation available.

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

   trie-simple	Data.Trie.Set.Internal

   No documentation available.

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

   trie-simple	Data.Trie.Set.Internal

   No documentation available.

9. 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)
   

10. atEarliestOffset :: TZTime -> TZTime

    tztime	Data.Time.TZTime

    If this local time happens to be on an overlap, switch to the earliest of the two offsets.

    >>> atEarliestOffset [tz|2022-11-06 01:30:00 -06:00 [America/Winnipeg]|]
    2022-11-06 01:30:00 -05:00 [America/Winnipeg]
    

Page 216 of many | Previous | Next