Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. set :: (Ord k, MonoidNull v) => k -> v -> MonoidMap k v -> MonoidMap k v

    monoidmap Data.MonoidMap

    Sets the value associated with the given key. Satisfies the following property:

    get k (set k v m) == v
    

  2. set :: PrimMonad m => NonEmptyMVector (PrimState m) a -> a -> m ()

    nonempty-vector Data.Vector.NonEmpty.Mutable

    Set all elements of the vector to the given value.

  3. set :: AggregatingSet a -> AggregatingSetList a

    relational-query Database.Relational

    Finalize and specify single grouping set.

  4. set :: AggregatingSetList (AggregatingSet () a) a

    relational-query Database.Relational.Arrow

    Same as set. This arrow is designed to be injected by locally built AggregtingSet arrow.

  5. set :: AggregatingSet a -> AggregatingSetList a

    relational-query Database.Relational.Monad.Trans.Aggregating

    Finalize and specify single grouping set.

  6. set :: Counter -> Int -> IO ()

    atomic-counter Control.Concurrent.Counter

    Atomically assign new value to the counter.

  7. set :: Counter -> Int -> IO ()

    atomic-counter Control.Concurrent.Counter.Lifted.IO

    Atomically assign new value to the counter.

  8. set :: Counter s -> Int -> ST s ()

    atomic-counter Control.Concurrent.Counter.Lifted.ST

    Atomically assign new value to the counter.

  9. set :: Counter s -> Int# -> State# s -> (# State# s #)

    atomic-counter Control.Concurrent.Counter.Unlifted

    Atomically assign new value to the counter.

  10. set :: Event -> IO ()

    concurrent-extra Control.Concurrent.Event

    Changes the state of the event to "set". All threads that where waiting for this event are woken. Threads that wait after the state is changed to "set" will not block at all.

Page 17 of many | Previous | Next