Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. sortListModelNew :: (HasCallStack, MonadIO m, IsListModel a, IsSorter b) => Maybe a -> Maybe b -> m SortListModel

   gi-gtk4	GI.Gtk.Objects.SortListModel

   Creates a new sort list model that uses the sorter to sort model.

2. sortListModelSetIncremental :: (HasCallStack, MonadIO m, IsSortListModel a) => a -> Bool -> m ()

   gi-gtk4	GI.Gtk.Objects.SortListModel

   Sets the sort model to do an incremental sort. When incremental sorting is enabled, the GtkSortListModel will not do a complete sort immediately, but will instead queue an idle handler that incrementally sorts the items towards their correct position. This of course means that items do not instantly appear in the right place. It also means that the total sorting time is a lot slower. When your filter blocks the UI while sorting, you might consider turning this on. Depending on your model and sorters, this may become interesting around 10,000 to 100,000 items. By default, incremental sorting is disabled. See sortListModelGetPending for progress information about an ongoing incremental sorting operation.

3. sortListModelSetModel :: (HasCallStack, MonadIO m, IsSortListModel a, IsListModel b) => a -> Maybe b -> m ()

   gi-gtk4	GI.Gtk.Objects.SortListModel

   Sets the model to be sorted. The model's item type must conform to the item type of self.

4. sortListModelSetSectionSorter :: (HasCallStack, MonadIO m, IsSortListModel a, IsSorter b) => a -> Maybe b -> m ()

   gi-gtk4	GI.Gtk.Objects.SortListModel

   Sets a new section sorter on self. Since: 4.12

5. sortListModelSetSorter :: (HasCallStack, MonadIO m, IsSortListModel a, IsSorter b) => a -> Maybe b -> m ()

   gi-gtk4	GI.Gtk.Objects.SortListModel

   Sets a new sorter on self.

6. sorterChanged :: (HasCallStack, MonadIO m, IsSorter a) => a -> SorterChange -> m ()

   gi-gtk4	GI.Gtk.Objects.Sorter

   Notifies all users of the sorter that it has changed. This emits the Sorter::changed signal. Users of the sorter should then update the sort order via sorterCompare. 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. This function is intended for implementers of GtkSorter subclasses and should not be called from other functions.

7. sorterCompare :: (HasCallStack, MonadIO m, IsSorter a, IsObject b, IsObject c) => a -> b -> c -> m Ordering

   gi-gtk4	GI.Gtk.Objects.Sorter

   Compares two given items according to the sort order implemented by the sorter. Sorters implement a partial order:

   • It is reflexive, ie a = a
   • It is antisymmetric, ie if a < b and b < a, then a = b
   • It is transitive, ie given any 3 items with a ≤ b and b ≤ c, then a ≤ c
   The sorter may signal it conforms to additional constraints via the return value of sorterGetOrder.

8. sorterGetOrder :: (HasCallStack, MonadIO m, IsSorter a) => a -> m SorterOrder

   gi-gtk4	GI.Gtk.Objects.Sorter

   Gets the order that self conforms to. See SorterOrder for details of the possible return values. This function is intended to allow optimizations.

9. sortColumnChanged :: TreeSortableClass self => Signal self (IO ())

   gtk	Graphics.UI.Gtk.ModelView.TreeSortable

   No documentation available.

10. sortMulSig :: Ctx -> ScriptOutput -> ScriptOutput

    haskoin-core	Haskoin.Script.Standard

    Sort the public keys of a multisig output in ascending order by comparing their compressed serialized representations. Refer to BIP-67.

Page 33 of many | Previous | Next