Hoogle Search

Within LTS Haskell 24.22 (ghc-9.10.3)

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

Exact lookup

1. (&.) :: forall (key :: Symbol) (kvs :: [Type]) v . (KnownSymbol key, HasKey key kvs v) => KVList kvs -> ListKey key -> v

   type-level-kv-list	Data.KVList

   No documentation available.

2. (&.?) :: forall (key :: Symbol) (kvs :: [Type]) v f . (KnownSymbol key, HasKey key kvs v, Functor f) => f (KVList kvs) -> ListKey key -> f v

   type-level-kv-list	Data.KVList

   Helper operator for optional chain.

   (&.?) mkvs k = fmap (&. k) mkvs
   

   >>> import Data.KVList ((&.?))
   
   >>> :{
   ( KVList.empty
   &= #foo := Just
   (KVList.empty
   &= #bar := "bar"
   )
   ) &. #foo &.? #bar
   :}
   Just "bar"
   

3. (&.??) :: forall (key :: Symbol) (kvs :: [Type]) m v . (KnownSymbol key, HasKey key kvs (m v), Monad m) => m (KVList kvs) -> ListKey key -> m v

   type-level-kv-list	Data.KVList

   Helper operator for optional chain.

   (&.??) mkvs k = (&. k) =<< mkvs
   

   >>> import Data.KVList ((&.??))
   
   >>> :{
   ( KVList.empty
   &= #foo := Just
   (KVList.empty
   &= #bar := Just "bar"
   )
   ) &. #foo &.?? #bar
   :}
   Just "bar"
   

4. (&=) :: forall (k :: Symbol) (kvs :: [Type]) v (appended :: [Type]) . (KnownSymbol k, Appended kvs '[k := v] ~ appended) => KVList kvs -> (k := v) -> KVList appended

   type-level-kv-list	Data.KVList

   No documentation available.

5. (&=>) :: forall f (k :: Symbol) (kvs :: [Type]) v (appended :: [Type]) . (Applicative f, KnownSymbol k, Appended kvs '[k := v] ~ appended) => f (KVList kvs) -> (k := f v) -> f (KVList appended)

   type-level-kv-list	Data.KVList

   Applicative version of (&=).

   >>> import Data.KVList ((&=>))
   
   >>> :{
   pure KVList.empty
   &=> #foo := (Just 3)
   &=> #bar := (Just "bar")
   :}
   Just (KVList.empty &= #foo := 3 &= #bar := "bar")
   

   >>> :{
   pure KVList.empty
   &=> #foo := (Just 3)
   &=> #bar := Nothing
   :}
   Nothing
   

6. (&.//) :: Axis node -> (Cursor node -> [a]) -> Cursor node -> [a]

   xml-indexed-cursor	Text.XML.Cursor.Indexed

   Combine two axes so that the second works on both the result nodes, and their descendants.

7. (&/) :: Axis node -> (Cursor node -> [a]) -> Cursor node -> [a]

   xml-indexed-cursor	Text.XML.Cursor.Indexed

   Combine two axes so that the second works on the children of the results of the first.

8. (&//) :: Axis node -> (Cursor node -> [a]) -> Cursor node -> [a]

   xml-indexed-cursor	Text.XML.Cursor.Indexed

   Combine two axes so that the second works on the descendants of the results of the first.

9. (&|) :: (Cursor node -> [a]) -> (a -> b) -> Cursor node -> [b]

   xml-indexed-cursor	Text.XML.Cursor.Indexed

   Apply a function to the result of an axis.

10. (&&^) :: Monad m => m Bool -> m Bool -> m Bool

    IfElse	Control.Monad.IfElse

    IO lifted &&

Page 23 of many | Previous | Next