Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. (.&.) :: Bits a => a -> a -> a

   protolude	Protolude

   Bitwise "and"

2. (.|.) :: Bits a => a -> a -> a

   protolude	Protolude

   Bitwise "or"

3. (.:??) :: FromJSON a => Object -> Text -> Parser (Maybe a)

   webdriver	Test.WebDriver.JSON

   Due to a breaking change in the .:? operator of aeson 0.10 (see https://github.com/bos/aeson/issues/287) that was subsequently reverted, this operator was added to provide consistent behavior compatible with all aeson versions. If the field is either missing or Null, this operator should return a Nothing result.

4. (...) :: Enum a => a -> Infinite a

   infinite-list	Data.List.Infinite

   Generate an infinite progression, starting from a given element, similar to [x..]. For better user experience consider enabling {-# LANGUAGE PostfixOperators #-}:

   >>> :set -XPostfixOperators
   
   >>> Data.List.Infinite.take 10 (0...)
   [0,1,2,3,4,5,6,7,8,9]
   

   Beware that for finite types (...) applies cycle atop of [x..]:

   >>> :set -XPostfixOperators
   
   >>> Data.List.Infinite.take 10 (EQ...)
   [EQ,GT,EQ,GT,EQ,GT,EQ,GT,EQ,GT]
   

   Remember that Int is a finite type as well. One is unlikely to hit this on a 64-bit architecture, but on a 32-bit machine it's fairly possible to traverse ((0 :: Int) ...) far enough to encounter 0 again.

5. (....) :: Enum a => (a, a) -> Infinite a

   infinite-list	Data.List.Infinite

   Generate an infinite arithmetic progression, starting from given elements, similar to [x,y..]. For better user experience consider enabling {-# LANGUAGE PostfixOperators #-}:

   >>> :set -XPostfixOperators
   
   >>> Data.List.Infinite.take 10 ((1,3)....)
   [1,3,5,7,9,11,13,15,17,19]
   

   Beware that for finite types (....) applies cycle atop of [x,y..]:

   >>> :set -XPostfixOperators
   
   >>> Data.List.Infinite.take 10 ((EQ,GT)....)
   [EQ,GT,EQ,GT,EQ,GT,EQ,GT,EQ,GT]
   

   Remember that Int is a finite type as well: for a sufficiently large step of progression y - x one may observe ((x :: Int, y)....) cycling back to emit x fairly soon.

6. (.+^) :: AffineSpace p => p -> Diff p -> p

   vector-space	Data.AffineSpace

   Point plus vector

7. (.-.) :: AffineSpace p => p -> p -> Diff p

   vector-space	Data.AffineSpace

   Subtract points

8. (.-^) :: AffineSpace p => p -> Diff p -> p

   vector-space	Data.AffineSpace

   Point minus vector

9. (.!=) :: Parser (Maybe a) -> a -> Parser a

   HsYAML	Data.YAML

   Defaulting helper to be used with .:? or .:!.

10. (.:) :: FromYAML a => Mapping Pos -> Text -> Parser a

    HsYAML	Data.YAML

    Retrieve value in Mapping indexed by a !!str Text key. This parser fails if the key doesn't exist.

Page 24 of many | Previous | Next