Hoogle Search
Within Stackage Nightly 2026-07-01 (ghc-9.12.4)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
relational-schemas Database.Custom.PostgreSQL Type tag for aggregatings GROUPING SETS
-
relational-schemas Database.Custom.SQLServer Type tag for aggregatings GROUPING SETS
-
relational-schemas Database.Custom.SQLite3 Type tag for aggregatings GROUPING SETS
-
riak-protobuf Data.Riak.Proto Fields :
- adds :: Lens' SetOp [Data.ByteString.ByteString]
- vec'adds :: Lens' SetOp (Data.Vector.Vector Data.ByteString.ByteString)
- removes :: Lens' SetOp [Data.ByteString.ByteString]
- vec'removes :: Lens' SetOp (Data.Vector.Vector Data.ByteString.ByteString)
newtype
Setter (m :: Type -> Type) astateref Data.Accessor No documentation available.
Setter :: (a -> m ()) -> Setter (m :: Type -> Type) astateref Data.Accessor No documentation available.
setBit :: Bits a => a -> Int -> abase Data.Bits x `setBit` i is the same as x .|. bit i
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.
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.
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.