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. (.-.) :: (Affine p, Num a) => p a -> p a -> Diff p a

   linear	Linear.Affine

   Get the difference between two points as a vector offset.

2. (.-^) :: (Affine p, Num a) => p a -> Diff p a -> p a

   linear	Linear.Affine

   Subtract a vector offset from a point.

3. type x ./. (n :: Nat) = Mod n x

   hmatrix	Numeric.LinearAlgebra.Data

   No documentation available.

4. (.=) :: ObjectCodec oldInput output -> (newInput -> oldInput) -> ObjectCodec newInput output

   autodocodec	Autodocodec

   Infix version of lmapCodec Use this function to supply the rendering side of a codec.

   (.=) = flip lmapCodec
   

   Example usage

   data Example = Example
   { exampleText :: !Text,
   exampleBool :: !Bool
   }
   instance HasCodec Example where
   codec =
   object "Example" $
   Example
   <$> requiredField "text" .= exampleText
   <*> requiredField "bool" .= exampleBool
   

5. (.=) :: ObjectCodec oldInput output -> (newInput -> oldInput) -> ObjectCodec newInput output

   autodocodec	Autodocodec.Codec

   Infix version of lmapCodec Use this function to supply the rendering side of a codec.

   (.=) = flip lmapCodec
   

   Example usage

   data Example = Example
   { exampleText :: !Text,
   exampleBool :: !Bool
   }
   instance HasCodec Example where
   codec =
   object "Example" $
   Example
   <$> requiredField "text" .= exampleText
   <*> requiredField "bool" .= exampleBool
   

6. (.~) :: ASetter s t a b -> b -> s -> t

   rio	RIO

   (.~) assigns a value to the target. It's the same thing as using (%~) with const:

   l .~ x = l %~ const x
   

   See set if you want a non-operator synonym. Here it is used to change 2 fields of a 3-tuple:

   >>> (0,0,0) & _1 .~ 1 & _3 .~ 3
   (1,0,3)
   

7. (.>) :: (IsName a1, IsName a2) => a1 -> a2 -> Name

   diagrams-lib	Diagrams.Names

   Convenient operator for writing qualified names with atomic components of different types. Instead of writing toName a1 <> toName a2 <> toName a3 you can just write a1 .> a2 .> a3.

8. (.>>) :: (Qualifiable q, IsName a) => a -> q -> q

   diagrams-lib	Diagrams.Names

   Qualify with the given name.

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

   diagrams-lib	Diagrams.Prelude

   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.

10. (.@=) :: MonadState s m => AnIndexedSetter i s s a b -> (i -> b) -> m ()

    diagrams-lib	Diagrams.Prelude

    Replace every target in the current state of an IndexedSetter, IndexedLens or IndexedTraversal with access to the index. When you do not need access to the index then (.=) is more liberal in what it can accept.

    l .= b ≡ l .@= const b
    

    (.@=) :: MonadState s m => IndexedSetter i s s a b    -> (i -> b) -> m ()
    (.@=) :: MonadState s m => IndexedLens i s s a b      -> (i -> b) -> m ()
    (.@=) :: MonadState s m => IndexedTraversal i s t a b -> (i -> b) -> m ()
    

Page 17 of many | Previous | Next