mirror of
https://github.com/vale981/bspwm
synced 2025-03-06 10:11:43 -05:00
bfded1effc
The last desktop and monitor are now deduced from the history. The stacking order is now independent from the history of the focused nodes: this prevents hacks on both sides. All windows are now considered in the stacking algorithm: it prevents tiled windows from one monitor to appear above the floating windows of another monitor. Transfered windows are stacked below the windows of the same kind.
12 lines
281 B
C
12 lines
281 B
C
#ifndef _STACK_H
|
|
#define _STACK_H
|
|
|
|
stack_t *make_stack(node_t *);
|
|
void stack_insert_after(stack_t *, node_t *);
|
|
void stack_insert_before(stack_t *, node_t *);
|
|
void remove_stack(stack_t *);
|
|
void remove_stack_node(node_t *);
|
|
void stack(node_t *);
|
|
void stack_under(node_t *);
|
|
|
|
#endif
|