bspwm/tree.h
2012-09-12 14:56:51 +02:00

32 lines
1 KiB
C

#ifndef _TREE_H
#define _TREE_H
#define INC_EXP 0.9
#define DEC_EXP 1.1
bool is_leaf(node_t *);
bool is_first_child(node_t *n);
bool is_second_child(node_t *n);
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 *find_fence(node_t *, direction_t);
node_t *find_neighbor(node_t *, direction_t);
void move_fence(node_t *, direction_t, fence_move_t);
void rotate_tree(node_t *, rotate_t);
void update_root_dimensions(void);
void apply_layout(desktop_t *, node_t *);
void insert_node(desktop_t *, node_t *);
void dump_tree(node_t *, char *, int);
void focus_node(desktop_t *, node_t *);
void unlink_node(desktop_t *, node_t *);
void remove_node(desktop_t *, node_t *);
void transfer_node(desktop_t *, desktop_t *, node_t *);
void select_desktop(desktop_t *);
void cycle_leaf(desktop_t *, node_t *, cycle_dir_t, skip_client_t);
void update_vacant_state(node_t *);
bool is_tiled(client_t *);
#endif