Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

Exact lookup

1. hashMap :: forall a p f . (Profunctor p, Functor f) => p (HashMap a ()) (f (HashMap a ())) -> p (HashSet a) (f (HashSet a))

   lens	Data.HashSet.Lens

   An Iso between a HashSet and a HashMap with unit values. <math>.

2. setmapped :: (Eq j, Hashable j) => IndexPreservingSetter (HashSet i) (HashSet j) i j

   lens	Data.HashSet.Lens

   This Setter can be used to change the type of a HashSet by mapping the elements to new values. Sadly, you can't create a valid Traversal for a Set, but you can manipulate it by reading using folded and reindexing it via setmapped.

3. setmapped :: IndexPreservingSetter' IntSet Int

   lens	Data.IntSet.Lens

   This Setter can be used to change the contents of an IntSet by mapping the elements to new values. Sadly, you can't create a valid Traversal for an IntSet, because the number of elements might change but you can manipulate it by reading using folded and reindexing it via setmapped.

   >>> over setmapped (+1) (IntSet.fromList [1,2,3,4])
   fromList [2,3,4,5]
   

4. toMapOf :: IndexedGetting i (Map i a) s a -> s -> Map i a

   lens	Data.Map.Lens

   Construct a map from a IndexedGetter, IndexedFold, IndexedTraversal or IndexedLens The construction is left-biased (see union), i.e. the first occurrences of keys in the fold or traversal order are preferred.

   >>> toMapOf folded ["hello", "world"]
   fromList [(0,"hello"),(1,"world")]
   

   >>> toMapOf (folded . ifolded) [('a',"alpha"),('b', "beta")]
   fromList [('a',"alpha"),('b',"beta")]
   

   >>> toMapOf (folded <.> folded) ["foo", "bar"]
   fromList [((0,0),'f'),((0,1),'o'),((0,2),'o'),((1,0),'b'),((1,1),'a'),((1,2),'r')]
   

   >>> toMapOf ifolded $ Map.fromList [('a', "hello"), ('b', "world")]
   fromList [('a',"hello"),('b',"world")]
   

   toMapOf ::          IndexedGetter i s a     -> s -> Map i a
   toMapOf :: Ord i => IndexedFold i s a       -> s -> Map i a
   toMapOf ::          IndexedLens' i s a      -> s -> Map i a
   toMapOf :: Ord i => IndexedTraversal' i s a -> s -> Map i a
   

5. setmapped :: Ord j => IndexPreservingSetter (Set i) (Set j) i j

   lens	Data.Set.Lens

   This Setter can be used to change the type of a Set by mapping the elements to new values. Sadly, you can't create a valid Traversal for a Set, but you can manipulate it by reading using folded and reindexing it via setmapped.

   >>> over setmapped (+1) (Set.fromList [1,2,3,4])
   fromList [2,3,4,5]
   

6. AI_V4MAPPED :: AddrInfoFlag

   network	Network.Socket

   If an IPv6 lookup is performed, and no IPv6 addresses are found, IPv6-mapped IPv4 addresses will be returned. (Only some platforms support this.)

7. parsecMap :: forall a b s u (m :: Type -> Type) . (a -> b) -> ParsecT s u m a -> ParsecT s u m b

   parsec	Text.Parsec

   No documentation available.

8. parsecMap :: forall a b s u (m :: Type -> Type) . (a -> b) -> ParsecT s u m a -> ParsecT s u m b

   parsec	Text.Parsec.Prim

   No documentation available.

9. module System.Posix.Semaphore

   POSIX named semaphore support.

10. data Semaphore

    unix	System.Posix.Semaphore

    No documentation available.

Page 424 of many | Previous | Next