Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. sortLimit :: SortOpts -> (Integer, Integer)

   hedis	Database.Redis

   No documentation available.

2. sortOrder :: SortOpts -> SortOrder

   hedis	Database.Redis

   No documentation available.

3. sortStore :: RedisCtx m f => ByteString -> ByteString -> SortOpts -> m (f Integer)

   hedis	Database.Redis

   No documentation available.

4. sortAlpha :: SortOpts -> Bool

   hedis	Database.Redis.Sentinel

   No documentation available.

5. sortBy :: SortOpts -> Maybe ByteString

   hedis	Database.Redis.Sentinel

   No documentation available.

6. sortGet :: SortOpts -> [ByteString]

   hedis	Database.Redis.Sentinel

   No documentation available.

7. sortLimit :: SortOpts -> (Integer, Integer)

   hedis	Database.Redis.Sentinel

   No documentation available.

8. sortOrder :: SortOpts -> SortOrder

   hedis	Database.Redis.Sentinel

   No documentation available.

9. sortStore :: RedisCtx m f => ByteString -> ByteString -> SortOpts -> m (f Integer)

   hedis	Database.Redis.Sentinel

   No documentation available.

10. sortBy :: (a -> a -> Ordering) -> [a] -> [a]

    relude	Relude.List.Reexport

    The sortBy function is the non-overloaded version of sort. The argument must be finite. The supplied comparison relation is supposed to be reflexive and antisymmetric, otherwise, e. g., for _ _ -> GT, the ordered list simply does not exist. The relation is also expected to be transitive: if it is not then sortBy might fail to find an ordered permutation, even if it exists.

    Examples

    >>> sortBy (\(a,_) (b,_) -> compare a b) [(2, "world"), (4, "!"), (1, "Hello")]
    [(1,"Hello"),(2,"world"),(4,"!")]
    

Page 22 of many | Previous | Next