Hoogle Search

Within Stackage Nightly 2025-09-25 (ghc-9.12.2)

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

Exact lookup

1. Setter :: (a -> m ()) -> Setter (m :: Type -> Type) a

   stateref	Data.Accessor

   No documentation available.

2. setBit :: Bits a => a -> Int -> a

   base	Data.Bits

   x `setBit` i is the same as x .|. bit i

3. setByteArray :: (Prim a, PrimMonad m) => MutableByteArray (PrimState m) -> Int -> Int -> a -> m ()

   primitive	Data.Primitive.ByteArray

   Fill a slice of a mutable byte array with a value. The offset and length are given in elements of type a rather than in bytes. Note: this function does not do bounds checking.

4. setPrimArray :: (Prim a, PrimMonad m) => MutablePrimArray (PrimState m) a -> Int -> Int -> a -> m ()

   primitive	Data.Primitive.PrimArray

   Fill a slice of a mutable primitive array with a value. Note: this function does not do bounds checking.

5. setPtr :: (Prim a, PrimMonad m) => Ptr a -> Int -> a -> m ()

   primitive	Data.Primitive.Ptr

   Fill a memory block with the given value. The length is in elements of type a rather than in bytes.

6. setByteArray# :: Prim a => MutableByteArray# s -> Int# -> Int# -> a -> State# s -> State# s

   primitive	Data.Primitive.Types

   Fill a slice of the mutable array with a value. The offset and length of the chunk are in elements of type a rather than in bytes.

7. setOffAddr# :: Prim a => Addr# -> Int# -> Int# -> a -> State# s -> State# s

   primitive	Data.Primitive.Types

   Fill a memory block given by an address, an offset and a length. The offset and length are in elements of type a rather than in bytes.

8. setOf :: Hashable a => Getting (HashSet a) s a -> s -> HashSet a

   lens	Data.HashSet.Lens

   Construct a set from a Getter, Fold, Traversal, Lens or Iso.

   setOf :: Hashable a         => Getter s a     -> s -> HashSet a
   setOf :: (Eq a, Hashable a) => Fold s a       -> s -> HashSet a
   setOf :: Hashable a         => Iso' s a       -> s -> HashSet a
   setOf :: Hashable a         => Lens' s a      -> s -> HashSet a
   setOf :: (Eq a, Hashable a) => Traversal' s a -> s -> HashSet a
   

9. setmapped :: (Eq j, Hashable j) => IndexPreservingSetter (HashSet i) (HashSet j) i j

   lens	Data.HashSet.Lens

   This Setter can be used to change the type of a HashSet by mapping the elements to new values. Sadly, you can't create a valid Traversal for a Set, but you can manipulate it by reading using folded and reindexing it via setmapped.

10. setOf :: Getting IntSet s Int -> s -> IntSet

    lens	Data.IntSet.Lens

    Construct an IntSet from a Getter, Fold, Traversal, Lens or Iso.

    >>> setOf folded [1,2,3,4]
    fromList [1,2,3,4]
    

    >>> setOf (folded._2) [("hello",1),("world",2),("!!!",3)]
    fromList [1,2,3]
    

    setOf :: Getter s Int     -> s -> IntSet
    setOf :: Fold s Int       -> s -> IntSet
    setOf :: Iso' s Int       -> s -> IntSet
    setOf :: Lens' s Int      -> s -> IntSet
    setOf :: Traversal' s Int -> s -> IntSet
    

Page 23 of many | Previous | Next