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.

  1. listStoreInsertSorted :: (HasCallStack, MonadIO m, IsListStore a, IsObject b) => a -> b -> CompareDataFunc -> m Word32

    gi-gio GI.Gio.Objects.ListStore

    Inserts item into store at a position to be determined by the compareFunc. The list must already be sorted before calling this function or the result is undefined. Usually you would approach this by only ever inserting items by way of this function. This function takes a ref on item. Since: 2.44

  2. listStoreSort :: (HasCallStack, MonadIO m, IsListStore a) => a -> CompareDataFunc -> m ()

    gi-gio GI.Gio.Objects.ListStore

    Sort the items in store according to compareFunc. Since: 2.46

  3. defaultSortOpts :: SortOpts

    hedis Database.Redis

    Redis default SortOpts. Equivalent to omitting all optional parameters.

    SortOpts
    { sortBy    = Nothing -- omit the BY option
    , sortLimit = (0,-1)  -- return entire collection
    , sortGet   = []      -- omit the GET option
    , sortOrder = Asc     -- sort in ascending order
    , sortAlpha = False   -- sort numerically, not lexicographically
    }
    

  4. defaultSortOpts :: SortOpts

    hedis Database.Redis.Sentinel

    Redis default SortOpts. Equivalent to omitting all optional parameters.

    SortOpts
    { sortBy    = Nothing -- omit the BY option
    , sortLimit = (0,-1)  -- return entire collection
    , sortGet   = []      -- omit the GET option
    , sortOrder = Asc     -- sort in ascending order
    , sortAlpha = False   -- sort numerically, not lexicographically
    }
    

  5. getSortedList :: SortedList a -> [a]

    diagrams-core Diagrams.Core

    Project the (guaranteed sorted) list out of a SortedList wrapper.

  6. mkSortedList :: Ord a => [a] -> SortedList a

    diagrams-core Diagrams.Core

    A smart constructor for the SortedList type, which sorts the input to ensure the SortedList invariant.

  7. getSortedList :: SortedList a -> [a]

    diagrams-core Diagrams.Core.Trace

    Project the (guaranteed sorted) list out of a SortedList wrapper.

  8. mkSortedList :: Ord a => [a] -> SortedList a

    diagrams-core Diagrams.Core.Trace

    A smart constructor for the SortedList type, which sorts the input to ensure the SortedList invariant.

  9. onSortedList :: Ord b => ([a] -> [b]) -> SortedList a -> SortedList b

    diagrams-core Diagrams.Core.Trace

    Apply a list function to a SortedList. The function need not result in a sorted list; the result will be sorted before being rewrapped as a SortedList.

  10. unsafeOnSortedList :: ([a] -> [b]) -> SortedList a -> SortedList b

    diagrams-core Diagrams.Core.Trace

    Apply an order-preserving list function to a SortedList. No sorts or checks are done.

Page 107 of many | Previous | Next