Refresh TODO list

[bspwm.git] / tree.h

diff --git a/tree.h b/tree.h
index 2d1603b4442ad0ff1b0656e34db4b41a6e96b3f7..7cc6d241c3389366062c8a1185513af1b0b69a5f 100644 (file)
--- a/tree.h
+++ b/tree.h
@@ -12,13 +12,21 @@ bool is_second_child(node_t *);
 void change_split_ratio(node_t *, value_change_t);
 node_t *first_extrema(node_t *);
 node_t *second_extrema(node_t *);
-node_t *next_leaf(node_t *);
-node_t *prev_leaf(node_t *);
+node_t *next_leaf(node_t *, node_t *);
+node_t *prev_leaf(node_t *, node_t *);
 node_t *find_fence(node_t *, direction_t);
 node_t *find_neighbor(node_t *, direction_t);
+void get_opposite(direction_t, direction_t*);
+node_t *nearest_neighbor(desktop_t *, node_t *, direction_t);
+int tiled_area(node_t *);
+node_t *find_by_area(desktop_t *, swap_arg_t);
 void move_fence(node_t *, direction_t, fence_move_t);
 void rotate_tree(node_t *, rotate_t);
+void rotate_brother(node_t *);
+void unrotate_tree(node_t *, rotate_t);
+void unrotate_brother(node_t *);
 void flip_tree(node_t *, flip_t);
+int balance_tree(node_t *);
 void arrange(monitor_t *, desktop_t *);
 void apply_layout(monitor_t *, desktop_t *, node_t *, xcb_rectangle_t, xcb_rectangle_t);
 void insert_node(monitor_t *, desktop_t *, node_t *);
@@ -39,10 +47,11 @@ void nearest_leaf(monitor_t *, desktop_t *, node_t *, nearest_arg_t, skip_client
 void circulate_leaves(monitor_t *, desktop_t *, circulate_dir_t);
 void update_vacant_state(node_t *);
 void put_status(void);
-void list_history(desktop_t *, char *);
+void list_history(char *);
 void list_monitors(list_option_t, char *);
 void list_desktops(monitor_t *, list_option_t, unsigned int, char *);
 void list(desktop_t *, node_t *, char *, unsigned int);
-void restore(char *);
+void restore_layout(char *);
+void restore_history(char *);
 
 #endif