Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

  1. 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.

  2. 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.

  3. 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.

  4. 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.

  5. 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.

  6. 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

  7. 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.

  8. 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

  9. setmapped :: IndexPreservingSetter' IntSet Int

    lens Data.IntSet.Lens

    This Setter can be used to change the contents of an IntSet by mapping the elements to new values. Sadly, you can't create a valid Traversal for an IntSet, because the number of elements might change but you can manipulate it by reading using folded and reindexing it via setmapped. 

    >>> over setmapped (+1) (IntSet.fromList [1,2,3,4])
fromList [2,3,4,5]

  10. setOf :: Getting (Set a) s a -> s -> Set a

    lens Data.Set.Lens

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

    >>> setOf folded ["hello","world"]
fromList ["hello","world"]

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

    setOf ::          Getter s a     -> s -> Set a
setOf :: Ord a => Fold s a       -> s -> Set a
setOf ::          Iso' s a       -> s -> Set a
setOf ::          Lens' s a      -> s -> Set a
setOf :: Ord a => Traversal' s a -> s -> Set a

Page 22 of many | Previous | Next