Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
data
MenuButtonGetAlwaysShowArrowMethodInfo gi-gtk GI.Gtk.Objects.MenuButton No documentation available.
data
MenuButtonSetAlwaysShowArrowMethodInfo gi-gtk GI.Gtk.Objects.MenuButton No documentation available.
menuButtonAlwaysShowArrow :: AttrLabelProxy "alwaysShowArrow"gi-gtk GI.Gtk.Objects.MenuButton No documentation available.
data
PopoverGetHasArrowMethodInfo gi-gtk GI.Gtk.Objects.Popover No documentation available.
data
PopoverHasArrowPropertyInfo gi-gtk GI.Gtk.Objects.Popover No documentation available.
data
PopoverSetHasArrowMethodInfo gi-gtk GI.Gtk.Objects.Popover No documentation available.
popoverHasArrow :: AttrLabelProxy "hasArrow"gi-gtk GI.Gtk.Objects.Popover No documentation available.
data
SettingsGtkAlternativeSortArrowsPropertyInfo gi-gtk GI.Gtk.Objects.Settings No documentation available.
settingsGtkAlternativeSortArrows :: AttrLabelProxy "gtkAlternativeSortArrows"gi-gtk GI.Gtk.Objects.Settings No documentation available.
narrow :: Key k => k -> k -> (k, k)haskey-btree Data.BTree.Primitives.Key Given two keys a, b such that 'a < b' compute two new keys a2, b2 such that 'a <= a2 < b2 <= b'. Obviously this always holds for 'a2 == a' and 'b2 = b' but for ByteStrings we can potentially find smaller a2 and b2. If a equals b, the behaviour is undefined.