{-# LANGUAGE ViewPatterns #-}
module XMonad.Actions.RotateSome (
surfaceNext,
surfacePrev,
rotateSome,
) where
import Control.Arrow ((***))
import XMonad.Prelude (NonEmpty(..), notEmpty, partition, sortOn, (\\))
import qualified Data.Map as M
import XMonad (Window, WindowSpace, Rectangle, X, runLayout, screenRect, windows, withWindowSet)
import XMonad.StackSet (Screen (Screen), Stack (Stack), current, floating, modify', stack)
import XMonad.Util.Stack (reverseS)
surfaceNext :: X ()
surfaceNext :: X ()
surfaceNext = do
ring <- X [Word64]
surfaceRing
windows . modify' $ rotateSome (`elem` ring)
surfacePrev :: X ()
surfacePrev :: X ()
surfacePrev = do
ring <- X [Word64]
surfaceRing
windows . modify' $ reverseS . rotateSome (`elem` ring) . reverseS
surfaceRing :: X [Window]
surfaceRing :: X [Word64]
surfaceRing = (WindowSet -> X [Word64]) -> X [Word64]
forall a. (WindowSet -> X a) -> X a
withWindowSet ((WindowSet -> X [Word64]) -> X [Word64])
-> (WindowSet -> X [Word64]) -> X [Word64]
forall a b. (a -> b) -> a -> b
$ \WindowSet
wset -> do
let Screen Workspace WorkspaceId (Layout Word64) Word64
wsp ScreenId
_ ScreenDetail
sd = WindowSet
-> Screen WorkspaceId (Layout Word64) Word64 ScreenId ScreenDetail
forall i l a sid sd. StackSet i l a sid sd -> Screen i l a sid sd
current WindowSet
wset
case Workspace WorkspaceId (Layout Word64) Word64
-> Maybe (Stack Word64)
forall i l a. Workspace i l a -> Maybe (Stack a)
stack Workspace WorkspaceId (Layout Word64) Word64
wsp Maybe (Stack Word64)
-> (Stack Word64 -> Maybe (Stack Word64)) -> Maybe (Stack Word64)
forall a b. Maybe a -> (a -> Maybe b) -> Maybe b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= (Word64 -> Bool) -> Stack Word64 -> Maybe (Stack Word64)
forall a. (a -> Bool) -> Stack a -> Maybe (Stack a)
filter' (Word64 -> Map Word64 RationalRect -> Bool
forall k a. Ord k => k -> Map k a -> Bool
`M.notMember` WindowSet -> Map Word64 RationalRect
forall i l a sid sd. StackSet i l a sid sd -> Map a RationalRect
floating WindowSet
wset) of
Maybe (Stack Word64)
Nothing -> [Word64] -> X [Word64]
forall a. a -> X a
forall (f :: * -> *) a. Applicative f => a -> f a
pure []
Just Stack Word64
st -> Stack Word64 -> [Word64] -> [Word64]
go Stack Word64
st ([Word64] -> [Word64]) -> X [Word64] -> X [Word64]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Workspace WorkspaceId (Layout Word64) Word64
-> Rectangle -> X [Word64]
layoutWindows Workspace WorkspaceId (Layout Word64) Word64
wsp {stack = Just st} (ScreenDetail -> Rectangle
screenRect ScreenDetail
sd)
where
go :: Stack Window -> [Window] -> [Window]
go :: Stack Word64 -> [Word64] -> [Word64]
go (Stack Word64
t [Word64]
ls [Word64]
rs) [Word64]
shown = Word64
t Word64 -> [Word64] -> [Word64]
forall a. a -> [a] -> [a]
: (([Word64]
ls [Word64] -> [Word64] -> [Word64]
forall a. [a] -> [a] -> [a]
++ [Word64]
rs) [Word64] -> [Word64] -> [Word64]
forall a. Eq a => [a] -> [a] -> [a]
\\ [Word64]
shown)
layoutWindows :: WindowSpace -> Rectangle -> X [Window]
layoutWindows :: Workspace WorkspaceId (Layout Word64) Word64
-> Rectangle -> X [Word64]
layoutWindows Workspace WorkspaceId (Layout Word64) Word64
wsp Rectangle
rect = ((Word64, Rectangle) -> Word64)
-> [(Word64, Rectangle)] -> [Word64]
forall a b. (a -> b) -> [a] -> [b]
map (Word64, Rectangle) -> Word64
forall a b. (a, b) -> a
fst ([(Word64, Rectangle)] -> [Word64])
-> (([(Word64, Rectangle)], Maybe (Layout Word64))
-> [(Word64, Rectangle)])
-> ([(Word64, Rectangle)], Maybe (Layout Word64))
-> [Word64]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ([(Word64, Rectangle)], Maybe (Layout Word64))
-> [(Word64, Rectangle)]
forall a b. (a, b) -> a
fst (([(Word64, Rectangle)], Maybe (Layout Word64)) -> [Word64])
-> X ([(Word64, Rectangle)], Maybe (Layout Word64)) -> X [Word64]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Workspace WorkspaceId (Layout Word64) Word64
-> Rectangle -> X ([(Word64, Rectangle)], Maybe (Layout Word64))
forall (layout :: * -> *) a.
LayoutClass layout a =>
Workspace WorkspaceId (layout a) a
-> Rectangle -> X ([(a, Rectangle)], Maybe (layout a))
runLayout Workspace WorkspaceId (Layout Word64) Word64
wsp Rectangle
rect
filter' :: (a -> Bool) -> Stack a -> Maybe (Stack a)
filter' :: forall a. (a -> Bool) -> Stack a -> Maybe (Stack a)
filter' a -> Bool
p (Stack a
f [a]
ls [a]
rs)
| a -> Bool
p a
f = Stack a -> Maybe (Stack a)
forall a. a -> Maybe a
Just (Stack a -> Maybe (Stack a)) -> Stack a -> Maybe (Stack a)
forall a b. (a -> b) -> a -> b
$ a -> [a] -> [a] -> Stack a
forall a. a -> [a] -> [a] -> Stack a
Stack a
f ((a -> Bool) -> [a] -> [a]
forall a. (a -> Bool) -> [a] -> [a]
filter a -> Bool
p [a]
ls) ((a -> Bool) -> [a] -> [a]
forall a. (a -> Bool) -> [a] -> [a]
filter a -> Bool
p [a]
rs)
| Bool
otherwise = Maybe (Stack a)
forall a. Maybe a
Nothing
rotateSome :: (a -> Bool) -> Stack a -> Stack a
rotateSome :: forall a. (a -> Bool) -> Stack a -> Stack a
rotateSome a -> Bool
p (Stack a
t [a]
ls [a]
rs) =
let
([(Int, a)]
movables, [(Int, a)]
anchors) =
((Int, a) -> Bool) -> [(Int, a)] -> ([(Int, a)], [(Int, a)])
forall a. (a -> Bool) -> [a] -> ([a], [a])
partition (a -> Bool
p (a -> Bool) -> ((Int, a) -> a) -> (Int, a) -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Int, a) -> a
forall a b. (a, b) -> b
snd) ([(Int, a)] -> ([(Int, a)], [(Int, a)]))
-> [(Int, a)] -> ([(Int, a)], [(Int, a)])
forall a b. (a -> b) -> a -> b
$
[Int] -> [a] -> [(Int, a)]
forall a b. [a] -> [b] -> [(a, b)]
zip
[Int -> Int
forall a. Num a => a -> a
negate ([a] -> Int
forall a. [a] -> Int
forall (t :: * -> *) a. Foldable t => t a -> Int
length [a]
ls)..]
([a] -> [a]
forall a. [a] -> [a]
reverse [a]
ls [a] -> [a] -> [a]
forall a. [a] -> [a] -> [a]
++ a
t a -> [a] -> [a]
forall a. a -> [a] -> [a]
: [a]
rs)
([a]
ls', [a] -> NonEmpty a
forall a. HasCallStack => [a] -> NonEmpty a
notEmpty -> a
t' :| [a]
rs') =
(((Int, a) -> a) -> [(Int, a)] -> [a]
forall a b. (a -> b) -> [a] -> [b]
map (Int, a) -> a
forall a b. (a, b) -> b
snd ([(Int, a)] -> [a])
-> ([(Int, a)] -> [a]) -> ([(Int, a)], [(Int, a)]) -> ([a], [a])
forall b c b' c'. (b -> c) -> (b' -> c') -> (b, b') -> (c, c')
forall (a :: * -> * -> *) b c b' c'.
Arrow a =>
a b c -> a b' c' -> a (b, b') (c, c')
*** ((Int, a) -> a) -> [(Int, a)] -> [a]
forall a b. (a -> b) -> [a] -> [b]
map (Int, a) -> a
forall a b. (a, b) -> b
snd)
(([(Int, a)], [(Int, a)]) -> ([a], [a]))
-> ([(Int, a)] -> ([(Int, a)], [(Int, a)]))
-> [(Int, a)]
-> ([a], [a])
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ((Int, a) -> Bool) -> [(Int, a)] -> ([(Int, a)], [(Int, a)])
forall a. (a -> Bool) -> [a] -> ([a], [a])
span ((Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
< Int
0) (Int -> Bool) -> ((Int, a) -> Int) -> (Int, a) -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Int, a) -> Int
forall a b. (a, b) -> a
fst)
([(Int, a)] -> ([(Int, a)], [(Int, a)]))
-> ([(Int, a)] -> [(Int, a)])
-> [(Int, a)]
-> ([(Int, a)], [(Int, a)])
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ((Int, a) -> Int) -> [(Int, a)] -> [(Int, a)]
forall b a. Ord b => (a -> b) -> [a] -> [a]
sortOn (Int, a) -> Int
forall a b. (a, b) -> a
fst
([(Int, a)] -> [(Int, a)])
-> ([(Int, a)] -> [(Int, a)]) -> [(Int, a)] -> [(Int, a)]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [(Int, a)] -> [(Int, a)] -> [(Int, a)]
forall a. [a] -> [a] -> [a]
(++) [(Int, a)]
anchors
([(Int, a)] -> ([a], [a])) -> [(Int, a)] -> ([a], [a])
forall a b. (a -> b) -> a -> b
$ ((Int, a) -> (Int, a) -> (Int, a))
-> [(Int, a)] -> [(Int, a)] -> [(Int, a)]
forall a b c. (a -> b -> c) -> [a] -> [b] -> [c]
zipWith ((((Int, a), (Int, a)) -> (Int, a))
-> (Int, a) -> (Int, a) -> (Int, a)
forall a b c. ((a, b) -> c) -> a -> b -> c
curry ((Int, a) -> Int
forall a b. (a, b) -> a
fst ((Int, a) -> Int)
-> ((Int, a) -> a) -> ((Int, a), (Int, a)) -> (Int, a)
forall b c b' c'. (b -> c) -> (b' -> c') -> (b, b') -> (c, c')
forall (a :: * -> * -> *) b c b' c'.
Arrow a =>
a b c -> a b' c' -> a (b, b') (c, c')
*** (Int, a) -> a
forall a b. (a, b) -> b
snd)) [(Int, a)]
movables ([(Int, a)] -> [(Int, a)]
forall a. [a] -> [a]
rotate [(Int, a)]
movables)
in
a -> [a] -> [a] -> Stack a
forall a. a -> [a] -> [a] -> Stack a
Stack a
t' ([a] -> [a]
forall a. [a] -> [a]
reverse [a]
ls') [a]
rs'
rotate :: [a] -> [a]
rotate :: forall a. [a] -> [a]
rotate = ([a] -> [a] -> [a]) -> ([a], [a]) -> [a]
forall a b c. (a -> b -> c) -> (a, b) -> c
uncurry (([a] -> [a] -> [a]) -> [a] -> [a] -> [a]
forall a b c. (a -> b -> c) -> b -> a -> c
flip [a] -> [a] -> [a]
forall a. [a] -> [a] -> [a]
(++)) (([a], [a]) -> [a]) -> ([a] -> ([a], [a])) -> [a] -> [a]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> [a] -> ([a], [a])
forall a. Int -> [a] -> ([a], [a])
splitAt Int
1