Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

1. visualSubmapSorted :: ([((KeyMask, KeySym), String)] -> [((KeyMask, KeySym), String)]) -> WindowConfig -> Map (KeyMask, KeySym) (String, X ()) -> X ()

   xmonad-contrib	XMonad.Actions.Submap

   Like visualSubmap, but is able to sort the descriptions. For example,

   import Data.Ord (comparing, Down)
   
   visualSubmapSorted (sortBy (comparing Down)) def
   

   would sort the (key, description) pairs by their keys in descending order.

2. ppSort :: PP -> X ([WindowSpace] -> [WindowSpace])

   xmonad-contrib	XMonad.Hooks.DynamicLog

   how to sort the workspaces. See XMonad.Util.WorkspaceCompare for some useful sorts.

3. addEwmhWorkspaceSort :: forall (l :: Type -> Type) . X WorkspaceSort -> XConfig l -> XConfig l

   xmonad-contrib	XMonad.Hooks.EwmhDesktops

   Add (compose after) an arbitrary user-specified function to sort/filter the workspace list. The default/initial function is getSortByIndex. This can be used to e.g. filter out scratchpad workspaces. Workspaces must not be renamed here.

4. setEwmhWorkspaceSort :: forall (l :: Type -> Type) . X WorkspaceSort -> XConfig l -> XConfig l

   xmonad-contrib	XMonad.Hooks.EwmhDesktops

   Like addEwmhWorkspaceSort, but replace it instead of adding/composing.

5. ppSort :: PP -> X ([WindowSpace] -> [WindowSpace])

   xmonad-contrib	XMonad.Hooks.StatusBar.PP

   how to sort the workspaces. See XMonad.Util.WorkspaceCompare for some useful sorts.

6. marshallSort :: ScreenId -> ([VirtualWindowSpace] -> [VirtualWindowSpace]) -> [PhysicalWindowSpace] -> [PhysicalWindowSpace]

   xmonad-contrib	XMonad.Layout.IndependentScreens

   vSort is a function that sorts VirtualWindowSpaces with virtual names. marshallSort s vSort is a function which sorts PhysicalWindowSpaces with virtual names, but keeps only the WindowSpace's on screen s. NOTE: vSort operating on virtual names comes with some caveats, see this issue for more information. You can use marshallSort like in the following example:

   Example

   pp' :: ScreenId -> PP -> PP
   pp' s pp = (marshallPP s pp) { ppSort = fmap (marshallSort s) (ppSort pp) }
   
   mySBL = statusBarProp "xmobar" $ pure (pp' (S 0) pp)
   mySBR = statusBarProp "xmobar" $ pure (pp' (S 1) pp)
   main = xmonad $ withEasySB (mySBL <> mySBR) defToggleStrutsKey def
   

   In this way, you have a custom virtual names sort on top of marshallPP.

7. uniqSort :: Ord a => [a] -> [a]

   xmonad-contrib	XMonad.Prompt

   Sort a list and remove duplicates. Like deleteAllDuplicates, but trades off laziness and stability for efficiency.

8. fuzzySort :: String -> [String] -> [String]

   xmonad-contrib	XMonad.Prompt.FuzzyMatch

   Sort the given set of strings by how well they match. Match quality is measured first by the length of the substring containing the match and second by the positions of the matching characters in the string.

9. type WorkspaceSort = [WindowSpace] -> [WindowSpace]

   xmonad-contrib	XMonad.Util.WorkspaceCompare

   No documentation available.

10. getSortByIndex :: X WorkspaceSort

    xmonad-contrib	XMonad.Util.WorkspaceCompare

    Sort several workspaces according to their tags' indices in the user's config.

Page 315 of many | Previous | Next