Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. (.=) :: (KeyValue e kv, ToJSON v) => Key -> v -> kv

   aeson	Data.Aeson.Types

   No documentation available.

2. (.?=) :: (KeyValueOmit e kv, ToJSON v) => Key -> v -> kv

   aeson	Data.Aeson.Types

   No documentation available.

3. (.&&.) :: (Testable prop1, Testable prop2) => prop1 -> prop2 -> Property

   tasty-quickcheck	Test.Tasty.QuickCheck

   Conjunction: p1 .&&. p2 passes if both p1 and p2 pass.

4. (.&.) :: (Testable prop1, Testable prop2) => prop1 -> prop2 -> Property

   tasty-quickcheck	Test.Tasty.QuickCheck

   Nondeterministic choice: p1 .&. p2 picks randomly one of p1 and p2 to test. If you test the property 100 times it makes 100 random choices.

5. (.||.) :: (Testable prop1, Testable prop2) => prop1 -> prop2 -> Property

   tasty-quickcheck	Test.Tasty.QuickCheck

   Disjunction: p1 .||. p2 passes unless p1 and p2 simultaneously fail.

6. (.*>) :: ByteString -> Parser a -> Parser a

   attoparsec	Data.Attoparsec.ByteString.Char8

   Deprecated: This is no longer necessary, and will be removed. Use *> instead.

7. (.*>) :: Text -> Parser a -> Parser a

   attoparsec	Data.Attoparsec.Text

   Deprecated: This is no longer necessary, and will be removed. Use *> instead.

8. (.*>) :: Text -> Parser a -> Parser a

   attoparsec	Data.Attoparsec.Text.Lazy

   Deprecated: This is no longer necessary, and will be removed. Use *> instead.

9. (.>) :: (st -> r) -> (kab -> st) -> kab -> r

   lens	Control.Lens.Indexed

   Compose a non-indexed function with an Indexed function. Mnemonically, the > points to the indexing we want to preserve. This is the same as (.). f . g (and f .> g) gives you the index of g unless g is index-preserving, like a Prism, Iso or Equality, in which case it'll pass through the index of f.

   >>> let nestedMap = (fmap Map.fromList . Map.fromList) [(1, [(10, "one,ten"), (20, "one,twenty")]), (2, [(30, "two,thirty"), (40,"two,forty")])]
   
   >>> nestedMap^..(itraversed.>itraversed).withIndex
   [(10,"one,ten"),(20,"one,twenty"),(30,"two,thirty"),(40,"two,forty")]
   

10. (.=) :: MonadState s m => ASetter s s a b -> b -> m ()

    lens	Control.Lens.Operators

    Replace the target of a Lens or all of the targets of a Setter or Traversal in our monadic state with a new value, irrespective of the old. This is an infix version of assign.

    >>> execState (do _1 .= c; _2 .= d) (a,b)
    (c,d)
    

    >>> execState (both .= c) (a,b)
    (c,c)
    

    (.=) :: MonadState s m => Iso' s a       -> a -> m ()
    (.=) :: MonadState s m => Lens' s a      -> a -> m ()
    (.=) :: MonadState s m => Traversal' s a -> a -> m ()
    (.=) :: MonadState s m => Setter' s a    -> a -> m ()
    

    It puts the state in the monad or it gets the hose again.

Page 8 of many | Previous | Next