Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. setAddrRange# :: Addr# -> Int# -> Int# -> State# RealWorld -> State# RealWorld

   ghc-prim	GHC.Prim

   setAddrRange# dest len c sets all of the bytes in [dest, dest+len) to the value c. Analogous to the standard C function memset, but with a different argument order. Warning: this can fail with an unchecked exception.

2. setByteArray# :: MutableByteArray# d -> Int# -> Int# -> Int# -> State# d -> State# d

   ghc-prim	GHC.Prim

   setByteArray# ba off len c sets the byte range [off, off+len) of the MutableByteArray# to the byte c. Warning: this can fail with an unchecked exception.

3. setThreadAllocationCounter# :: Int64# -> State# RealWorld -> State# RealWorld

   ghc-prim	GHC.Prim

   Sets the allocation counter for the current thread to the given value.

4. setAddrRange# :: Addr# -> Int# -> Int# -> State# RealWorld -> State# RealWorld

   ghc-prim	GHC.PrimopWrappers

   No documentation available.

5. setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int# -> State# s -> State# s

   ghc-prim	GHC.PrimopWrappers

   No documentation available.

6. setThreadAllocationCounter# :: Int64# -> State# RealWorld -> State# RealWorld

   ghc-prim	GHC.PrimopWrappers

   No documentation available.

7. set' :: ASetter' s a -> a -> s -> s

   lens	Control.Lens.Combinators

   Replace the target of a Lens or all of the targets of a Setter' or Traversal with a constant value, without changing its type. This is a type restricted version of set, which retains the type of the original.

   >>> set' mapped x [a,b,c,d]
   [x,x,x,x]
   

   >>> set' _2 "hello" (1,"world")
   (1,"hello")
   

   >>> set' mapped 0 [1,2,3,4]
   [0,0,0,0]
   

   Note: Attempting to adjust set' a Fold or Getter will fail at compile time with an relatively nice error message.

   set' :: Setter' s a    -> a -> s -> s
   set' :: Iso' s a       -> a -> s -> s
   set' :: Lens' s a      -> a -> s -> s
   set' :: Traversal' s a -> a -> s -> s
   

8. sets :: (Profunctor p, Profunctor q, Settable f) => (p a b -> q s t) -> Optical p q f s t a b

   lens	Control.Lens.Combinators

   Build a Setter, IndexedSetter or IndexPreservingSetter depending on your choice of Profunctor.

   sets :: ((a -> b) -> s -> t) -> Setter s t a b
   

9. setting :: ((a -> b) -> s -> t) -> IndexPreservingSetter s t a b

   lens	Control.Lens.Combinators

   Build an index-preserving Setter from a map-like function. Your supplied function f is required to satisfy:

   f id ≡ id
   f g . f h ≡ f (g . h)
   

   Equational reasoning:

   setting . over ≡ id
   over . setting ≡ id
   

   Another way to view sets is that it takes a "semantic editor combinator" and transforms it into a Setter.

   setting :: ((a -> b) -> s -> t) -> Setter s t a b
   

10. set' :: ASetter' s a -> a -> s -> s

    lens	Control.Lens.Setter

    Replace the target of a Lens or all of the targets of a Setter' or Traversal with a constant value, without changing its type. This is a type restricted version of set, which retains the type of the original.

    >>> set' mapped x [a,b,c,d]
    [x,x,x,x]
    

    >>> set' _2 "hello" (1,"world")
    (1,"hello")
    

    >>> set' mapped 0 [1,2,3,4]
    [0,0,0,0]
    

    Note: Attempting to adjust set' a Fold or Getter will fail at compile time with an relatively nice error message.

    set' :: Setter' s a    -> a -> s -> s
    set' :: Iso' s a       -> a -> s -> s
    set' :: Lens' s a      -> a -> s -> s
    set' :: Traversal' s a -> a -> s -> s
    

Page 132 of many | Previous | Next