hiro/bspwm
1
0
Fork 0
mirror of https://github.com/vale981/bspwm synced 2025-03-06 02:01:42 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions
bspwm/tree.h

49 lines
2 KiB
C
Raw Normal View History

Starting the tree functions
2012-08-17 22:18:26 +02:00
#ifndef _TREE_H
#define _TREE_H
Split types.c into {monitor,desktop,history}.c
2013-09-19 15:02:49 +02:00
node_t *make_node(void);
client_t *make_client(xcb_window_t);
Rewrite message handling The new message syntax: - Provides 10 commands instead of 60. - Allows multiple actions to be applied in one call. The client now returns an non zero exit code when a message fails. The `is_adjacent` function now handles vacant nodes.
2013-07-08 11:42:05 +02:00
void arrange(monitor_t *, desktop_t *);
void apply_layout(monitor_t *, desktop_t *, node_t *, xcb_rectangle_t, xcb_rectangle_t);
void focus_node(monitor_t *, desktop_t *, node_t *);
void insert_node(monitor_t *, desktop_t *, node_t *, node_t *);
void unlink_node(desktop_t *, node_t *);
void remove_node(desktop_t *, node_t *);
History is global and stacking is independent 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.
2013-10-01 10:48:03 +02:00
void transfer_node(monitor_t *, desktop_t *, node_t *, monitor_t *, desktop_t *, node_t *);
void swap_nodes(monitor_t *, desktop_t *, node_t *, monitor_t *, desktop_t *, node_t *);
Rewrite message handling The new message syntax: - Provides 10 commands instead of 60. - Allows multiple actions to be applied in one call. The client now returns an non zero exit code when a message fails. The `is_adjacent` function now handles vacant nodes.
2013-07-08 11:42:05 +02:00
void pseudo_focus(desktop_t *, node_t *);
void update_current(void);
node_t *find_fence(node_t *, direction_t);
Apply modifiers to all objects Window: * cycle - no change * direction - only consider matching nodes * last - walk history * focused - match or NULL * biggest - find biggest matching Desktop: * cycle - no change * focused - match or NULL * last - match or NULL Monitor: * cycle - no change * direction - only consider matching nodes * last - match or NULL * focused - match or NULL
2013-07-13 15:12:59 -04:00
node_t *nearest_neighbor(desktop_t *, node_t *, direction_t, client_select_t);
node_t *nearest_from_distance(desktop_t *, node_t *, direction_t, client_select_t);
History is global and stacking is independent 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.
2013-10-01 10:48:03 +02:00
node_t *nearest_from_history(desktop_t *, node_t *, direction_t, client_select_t);
Apply modifiers to all objects Window: * cycle - no change * direction - only consider matching nodes * last - walk history * focused - match or NULL * biggest - find biggest matching Desktop: * cycle - no change * focused - match or NULL * last - match or NULL Monitor: * cycle - no change * direction - only consider matching nodes * last - match or NULL * focused - match or NULL
2013-07-13 15:12:59 -04:00
node_t *find_biggest(desktop_t *, node_t *, client_select_t);
C style structure names
2012-08-29 18:37:31 +02:00
bool is_leaf(node_t *);
Numerous fixes
2012-09-18 17:21:04 +02:00
bool is_tiled(client_t *);
bool is_floating(client_t *);
bool is_first_child(node_t *);
bool is_second_child(node_t *);
C style structure names
2012-08-29 18:37:31 +02:00
void change_split_ratio(node_t *, value_change_t);
Rewrite message handling The new message syntax: - Provides 10 commands instead of 60. - Allows multiple actions to be applied in one call. The client now returns an non zero exit code when a message fails. The `is_adjacent` function now handles vacant nodes.
2013-07-08 11:42:05 +02:00
void reset_mode(coordinates_t *);
Add a `--rotate` option to the `window` command
2013-08-27 23:48:50 +02:00
node_t *brother_tree(node_t *);
C style structure names
2012-08-29 18:37:31 +02:00
node_t *first_extrema(node_t *);
node_t *second_extrema(node_t *);
New setting: `focus_by_distance` The aforementioned setting, when set, makes the focus movements based on the distances between the window sides. The `{prev,next}_leaf` functions were taught not to climb above their roofs.
2013-05-07 22:45:14 +02:00
node_t *next_leaf(node_t *, node_t *);
node_t *prev_leaf(node_t *, node_t *);
Rewrite message handling The new message syntax: - Provides 10 commands instead of 60. - Allows multiple actions to be applied in one call. The client now returns an non zero exit code when a message fails. The `is_adjacent` function now handles vacant nodes.
2013-07-08 11:42:05 +02:00
bool is_adjacent(node_t *, node_t *, direction_t);
New setting: `history_aware_focus`
2013-06-24 16:25:50 +02:00
void get_opposite(direction_t, direction_t *);
New arguments for `swap`: `biggest` and `smallest`
2013-04-02 15:02:45 +02:00
int tiled_area(node_t *);
C style structure names
2012-08-29 18:37:31 +02:00
void move_fence(node_t *, direction_t, fence_move_t);
Rewrite message handling The new message syntax: - Provides 10 commands instead of 60. - Allows multiple actions to be applied in one call. The client now returns an non zero exit code when a message fails. The `is_adjacent` function now handles vacant nodes.
2013-07-08 11:42:05 +02:00
void rotate_tree(node_t *, int);
The `birth_rotation` attribute replaces `birth_mode` The `birth_mode` was not sufficient for properly unrotate the brother of a removed node. The `birth_rotation` stores the rotation applied to the brother subtree when the node was inserted. This should help to enforce that (L + n) - n = L in every possible cases. Which means that adding a node and removing it should leave the layout unchanged.
2013-05-08 14:10:53 +02:00
void rotate_brother(node_t *);
Rewrite message handling The new message syntax: - Provides 10 commands instead of 60. - Allows multiple actions to be applied in one call. The client now returns an non zero exit code when a message fails. The `is_adjacent` function now handles vacant nodes.
2013-07-08 11:42:05 +02:00
void unrotate_tree(node_t *, int);
The `birth_rotation` attribute replaces `birth_mode` The `birth_mode` was not sufficient for properly unrotate the brother of a removed node. The `birth_rotation` stores the rotation applied to the brother subtree when the node was inserted. This should help to enforce that (L + n) - n = L in every possible cases. Which means that adding a node and removing it should leave the layout unchanged.
2013-05-08 14:10:53 +02:00
void unrotate_brother(node_t *);
New message: 'flip'
2013-02-26 12:54:01 +01:00
void flip_tree(node_t *, flip_t);
New message: `balance`
2013-03-10 18:28:30 +01:00
int balance_tree(node_t *);
New message: 'restore'
2012-12-27 22:36:06 +01:00
void destroy_tree(node_t *);
Rewrite message handling The new message syntax: - Provides 10 commands instead of 60. - Allows multiple actions to be applied in one call. The client now returns an non zero exit code when a message fails. The `is_adjacent` function now handles vacant nodes.
2013-07-08 11:42:05 +02:00
node_t *closest_node(desktop_t *, node_t *, cycle_dir_t, client_select_t);
New message: 'circulate'
2012-11-01 22:47:03 +01:00
void circulate_leaves(monitor_t *, desktop_t *, circulate_dir_t);
A few messages
2012-09-11 16:29:43 +02:00
void update_vacant_state(node_t *);
Starting the tree functions
2012-08-17 22:18:26 +02:00
#endif
Reference in a new issue Copy permalink