Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. gconstmap :: (Generic1 f, Functor (Rep1 f)) => a -> f b -> f a

   generic-data	Generic.Data.Internal.Prelude

   Generic (<$). See also gfmap.

2. eventRequestMotions :: (HasCallStack, MonadIO m) => EventMotion -> m ()

   gi-gdk3	GI.Gdk.Unions.Event

   Request more motion notifies if event is a motion notify hint event. This function should be used instead of windowGetPointer to request further motion notifies, because it also works for extension events where motion notifies are provided for devices other than the core pointer. Coordinate extraction, processing and requesting more motion events from a EventTypeMotionNotify event usually works like this:

   C code

   {
   // motion_event handler
   x = motion_event->x;
   y = motion_event->y;
   // handle (x,y) motion
   gdk_event_request_motions (motion_event); // handles is_hint events
   }
   

   Since: 2.12

3. runStmt :: MonadInterpreter m => String -> m ()

   hint	Language.Haskell.Interpreter

   Evaluate a statement in the IO monad, possibly binding new names. Example:

   runStmt "x <- return 42"
   runStmt "print x"
   

4. adjustMax :: (a -> a) -> NEIntMap a -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty

   O(log n). A version of updateMax that disallows deletion, allowing us to guarantee that the result is also non-empty.

5. adjustMaxWithKey :: (Key -> a -> a) -> NEIntMap a -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty

   O(log n). A version of updateMaxWithKey that disallows deletion, allowing us to guarantee that the result is also non-empty.

6. adjustMin :: (a -> a) -> NEIntMap a -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty

   O(1). A version of updateMin that disallows deletion, allowing us to guarantee that the result is also non-empty.

7. adjustMinWithKey :: (Key -> a -> a) -> NEIntMap a -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty

   O(1). A version of adjustMaxWithKey that disallows deletion, allowing us to guarantee that the result is also non-empty. Note that it also is able to have better asymptotics than updateMinWithKey in general.

8. adjustMax :: (a -> a) -> NEMap k a -> NEMap k a

   nonempty-containers	Data.Map.NonEmpty

   O(log n). A version of updateMax that disallows deletion, allowing us to guarantee that the result is also non-empty.

9. adjustMaxWithKey :: (k -> a -> a) -> NEMap k a -> NEMap k a

   nonempty-containers	Data.Map.NonEmpty

   O(log n). A version of updateMaxWithKey that disallows deletion, allowing us to guarantee that the result is also non-empty.

10. adjustMin :: (a -> a) -> NEMap k a -> NEMap k a

    nonempty-containers	Data.Map.NonEmpty

    O(1). A version of updateMin that disallows deletion, allowing us to guarantee that the result is also non-empty.

Page 85 of many | Previous | Next