Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. gmap1 :: forall c t t' a b . (ADT1 t t', Constraints1 t t' c) => (forall d e (s :: Type -> Type) (s' :: Type -> Type) . c s s' => (d -> e) -> s d -> s' e) -> (a -> b) -> t a -> t' b

   one-liner	Generics.OneLiner.Binary

   gmap1 is generic1 specialized to (->).

2. dimapForget :: Profunctor p => (a % 1 -> b) -> (c % 1 -> d) -> p b c -> p a d

   one-liner	Generics.OneLiner.Classes

   No documentation available.

3. toMapOf :: forall k (is :: IxList) i s a . (Is k A_Fold, HasSingleIndex is i, Eq i, Hashable i) => Optic' k is s a -> s -> HashMap i a

   optics-extra	Data.HashMap.Optics

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

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

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

   >>> toMapOf (folded % ifolded) [('a', "hello"), ('b', "world"), ('a', "dummy")]
   fromList [('a',"hello"),('b',"world")]
   

4. setmapped :: (Eq b, Hashable b) => Setter (HashSet a) (HashSet b) a b

   optics-extra	Data.HashSet.Optics

   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 HashSet, but you can manipulate it by reading using folded and reindexing it via setmapped.

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

5. ifoldMap :: (FoldableWithIndex i f, Monoid m) => (i -> a -> m) -> f a -> m

   optics-extra	Optics.Indexed

   Fold a container by mapping value to an arbitrary Monoid with access to the index i. When you don't need access to the index then foldMap is more flexible in what it accepts.

   foldMap ≡ ifoldMap . const
   

6. ifoldMap' :: (FoldableWithIndex i f, Monoid m) => (i -> a -> m) -> f a -> m

   optics-extra	Optics.Indexed

   A variant of ifoldMap that is strict in the accumulator. When you don't need access to the index then foldMap' is more flexible in what it accepts.

   foldMap' ≡ ifoldMap' . const
   

7. imap :: FunctorWithIndex i f => (i -> a -> b) -> f a -> f b

   optics-extra	Optics.Indexed

   Map with access to the index.

8. optionType_map :: Ord k => Char -> Char -> OptionType k -> OptionType v -> OptionType (Map k v)

   options	Options

   Store an option as a Map, using other option types for the keys and values The item separator is used to separate key/value pairs from each other. It should be a character that will not occur within either the keys or values. The value separator is used to separate the key from the value. It should be a character that will not occur within the keys. It may occur within the values. Duplicate keys in the input are permitted. The final value for each key is stored.

9. hStore_hashMap :: HashMap Text (Maybe Text) -> Encoding

   postgresql-binary	PostgreSQL.Binary.Encoding

   HSTORE encoder from HashMap.

10. hStore_map :: Map Text (Maybe Text) -> Encoding

    postgresql-binary	PostgreSQL.Binary.Encoding

    HSTORE encoder from Map.

Page 998 of many | Previous | Next