Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

  1. keymapTranslateKeyboardState :: KeymapClass self => self -> Int -> Modifier -> Int -> IO (Maybe (Int, Int, Int, Modifier))

    gtk3 Graphics.UI.Gtk.Gdk.Keymap

    Translates the contents of a EventKey into a keyval, effective group, and level. Modifiers that affected the translation and are thus unavailable for application use are returned in consumedModifiers. See keyvalGetKeys for an explanation of groups and levels. The effectiveGroup is the group that was actually used for the translation; some keys such as Enter are not affected by the active keyboard group. The level is derived from state. For convenience, EventKey already contains the translated keyval, so this function isn't as useful as you might think.

  2. toKeymap :: KeymapClass o => o -> Keymap

    gtk3 Graphics.UI.Gtk.Gdk.Keymap

    No documentation available.

  3. treeViewMapExpandedRows :: TreeViewClass self => self -> (TreePath -> IO ()) -> IO ()

    gtk3 Graphics.UI.Gtk.ModelView.TreeView

    Call function for every expanded row.

  4. printContextGetPangoFontmap :: PrintContextClass self => self -> IO FontMap

    gtk3 Graphics.UI.Gtk.Printing.PrintContext

    Returns a FontMap that is suitable for use with the PrintContext.

  5. windowFocusOnMap :: WindowClass self => Attr self Bool

    gtk3 Graphics.UI.Gtk.Windows.Window

    True if the window should receive the input focus when mapped. Default value: True

  6. paginateMap :: Paginate -> Map PageNumber [Identifier]

    hakyll Hakyll.Web.Paginate

    No documentation available.

  7. tagsMap :: Tags -> [(String, [Identifier])]

    hakyll Hakyll.Web.Tags

    No documentation available.

  8. package hashmap

    Persistent containers Map and Set based on hashing. An implementation of persistent Map and Set containers based on hashing. The implementation is build on top of Data.IntMap.IntMap and Data.IntSet.IntSet, with very similar API. It uses Hashable class from the hashable package for hashing. This package can be used as a drop-in replacement for Data.Map and Data.Set modules. The Map key value is an Data.IntMap.IntMap indexed by the hash value, containing either one (key, value) or a Data.Map.Map key value for all keys with the same hash value. The Set elem is an Data.IntMap.IntMap indexed by the hash value, containing either one elem or Data.Set.Set elem for all elements with the same hash value.

  9. module Data.HashMap

    Persistent Map based on hashing, which is defined as 

    data Map k v = IntMap (Some k v)
    is an IntMap indexed by hash values of keys, containing a value of Some e. That contains either one (k, v) pair or a Map k v with keys of the same hash values. The interface of a Map is a suitable subset of IntMap and can be used as a drop-in replacement of Map. The complexity of operations is determined by the complexities of IntMap and Map operations. See the sources of Map to see which operations from containers package are used.

  10. type HashMap k v = Map k v

    hashmap Data.HashMap

    Deprecated: HashMap is deprecated. Please use Map instead.

Page 1177 of many | Previous | Next