mirror of
https://github.com/vale981/bspwm
synced 2025-03-06 10:11:43 -05:00
79 lines
4 KiB
C
79 lines
4 KiB
C
/* Copyright (c) 2012-2014, Bastien Dejean
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
|
|
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
* The views and conclusions contained in the software and documentation are those
|
|
* of the authors and should not be interpreted as representing official policies,
|
|
* either expressed or implied, of the FreeBSD Project.
|
|
*/
|
|
|
|
#ifndef BSPWM_TREE_H
|
|
#define BSPWM_TREE_H
|
|
|
|
void arrange(monitor_t *m, desktop_t *d);
|
|
void apply_layout(monitor_t *m, desktop_t *d, node_t *n, xcb_rectangle_t rect, xcb_rectangle_t root_rect);
|
|
void insert_node(monitor_t *m, desktop_t *d, node_t *n, node_t *f);
|
|
void pseudo_focus(monitor_t *m, desktop_t *d, node_t *n);
|
|
void focus_node(monitor_t *m, desktop_t *d, node_t *n);
|
|
void update_current(void);
|
|
node_t *make_node(void);
|
|
client_t *make_client(xcb_window_t win, unsigned int border_width);
|
|
bool is_leaf(node_t *n);
|
|
bool is_tiled(client_t *c);
|
|
bool is_floating(client_t *c);
|
|
bool is_first_child(node_t *n);
|
|
bool is_second_child(node_t *n);
|
|
void reset_mode(coordinates_t *loc);
|
|
node_t *brother_tree(node_t *n);
|
|
void closest_public(desktop_t *d, node_t *n, node_t **closest, node_t **public);
|
|
node_t *first_extrema(node_t *n);
|
|
node_t *second_extrema(node_t *n);
|
|
node_t *next_leaf(node_t *n, node_t *r);
|
|
node_t *prev_leaf(node_t *n, node_t *r);
|
|
node_t *next_tiled_leaf(desktop_t *d, node_t *n, node_t *r);
|
|
node_t *prev_tiled_leaf(desktop_t *d, node_t *n, node_t *r);
|
|
bool is_adjacent(node_t *a, node_t *b, direction_t dir);
|
|
node_t *find_fence(node_t *n, direction_t dir);
|
|
node_t *nearest_neighbor(monitor_t *m, desktop_t *d, node_t *n, direction_t dir, client_select_t sel);
|
|
node_t *nearest_from_history(monitor_t *m, desktop_t *d, node_t *n, direction_t dir, client_select_t sel);
|
|
node_t *nearest_from_distance(monitor_t *m, desktop_t *d, node_t *n, direction_t dir, client_select_t sel);
|
|
void get_opposite(direction_t src, direction_t *dst);
|
|
int tiled_area(node_t *n);
|
|
node_t *find_biggest(monitor_t *m, desktop_t *d, node_t *n, client_select_t sel);
|
|
void rotate_tree(node_t *n, int deg);
|
|
void rotate_brother(node_t *n);
|
|
void unrotate_tree(node_t *n, int rot);
|
|
void unrotate_brother(node_t *n);
|
|
void flip_tree(node_t *n, flip_t flp);
|
|
void equalize_tree(node_t *n);
|
|
int balance_tree(node_t *n);
|
|
void unlink_node(monitor_t *m, desktop_t *d, node_t *n);
|
|
void remove_node(monitor_t *m, desktop_t *d, node_t *n);
|
|
void destroy_tree(node_t *n);
|
|
bool swap_nodes(monitor_t *m1, desktop_t *d1, node_t *n1, monitor_t *m2, desktop_t *d2, node_t *n2);
|
|
bool transfer_node(monitor_t *ms, desktop_t *ds, node_t *ns, monitor_t *md, desktop_t *dd, node_t *nd);
|
|
node_t *closest_node(monitor_t *m, desktop_t *d, node_t *n, cycle_dir_t dir, client_select_t sel);
|
|
void circulate_leaves(monitor_t *m, desktop_t *d, circulate_dir_t dir);
|
|
void update_vacant_state(node_t *n);
|
|
void update_privacy_level(node_t *n, bool value);
|
|
|
|
#endif
|