Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
GtkSorter is an object to describe sorting criteria. Its primary user is SortListModel The model will use a sorter to determine the order in which its items should appear by calling sorterCompare for pairs of items. Sorters may change their sorting behavior through their lifetime. In that case, they will emit the Sorter::changed signal to notify that the sort order is no longer valid and should be updated by calling sorterCompare again. GTK provides various pre-made sorter implementations for common sorting operations. ColumnView has built-in support for sorting lists via the ColumnViewColumn:sorter property, where the user can change the sorting by clicking on list headers. Of course, in particular for large lists, it is also possible to subclass GtkSorter and provide one's own sorter.
-
gi-gtk4 GI.Gtk.Objects.Sorter Memory-managed wrapper type.
Sorter :: ManagedPtr Sorter -> Sortergi-gtk4 GI.Gtk.Objects.Sorter No documentation available.
type
SorterChangedCallback = SorterChange -> IO ()gi-gtk4 GI.Gtk.Objects.Sorter Emitted whenever the sorter changed. Users of the sorter should then update the sort order again via sorterCompare. SortListModel handles this signal automatically. Depending on the change parameter, it may be possible to update the sort order without a full resorting. Refer to the SorterChange documentation for details.
-
gitlab-haskell GitLab.Types Sort objects in ascending or descending order
-
grisette Grisette.Core Sorted mergeable strategy. For Integers, we can implement its merge strategy as follows:
SortedStrategy id (\_ -> SimpleStrategy $ \_ t _ -> t)
For Maybe SymBool, we can implement its merge strategy as follows:SortedStrategy (\case; Nothing -> False; Just _ -> True) (\idx -> if idx then SimpleStrategy $ \_ t _ -> t else SimpleStrategy $ \cond (Just l) (Just r) -> Just $ symIte cond l r)
-
grisette Grisette.Internal.Core.Data.Class.Mergeable Sorted mergeable strategy. For Integers, we can implement its merge strategy as follows:
SortedStrategy id (\_ -> SimpleStrategy $ \_ t _ -> t)
For Maybe SymBool, we can implement its merge strategy as follows:SortedStrategy (\case; Nothing -> False; Just _ -> True) (\idx -> if idx then SimpleStrategy $ \_ t _ -> t else SimpleStrategy $ \cond (Just l) (Just r) -> Just $ symIte cond l r)
-
gtk3 Graphics.UI.Gtk.General.Enums No documentation available.
-
gtk3 Graphics.UI.Gtk.General.Enums No documentation available.
-
gtk3 Graphics.UI.Gtk.General.Enums No documentation available.