Enhance external rules example scripts

[bspwm.git] / tree.h

diff --git a/tree.h b/tree.h
index 63fd2ed416102b4f9f8f0cbee566906e1157abf7..962454e485db11f6860e9384a9d0e00f96732ae6 100644 (file)
--- a/tree.h
+++ b/tree.h
@@ -1,5 +1,29 @@
-#ifndef _TREE_H
-#define _TREE_H
+/* * Copyright (c) 2012-2013 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:
+ *
+ *  * Redistributions of source code must retain the above copyright notice, this
+ * list of conditions and the following disclaimer.
+ *  * 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 HOLDER 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.
+ */
+
+#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);
@@ -9,7 +33,6 @@ 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);
-bool is_visible(desktop_t *d, node_t *n);
 bool is_leaf(node_t *n);
 bool is_tiled(client_t *c);
 bool is_floating(client_t *c);
@@ -18,21 +41,21 @@ bool is_second_child(node_t *n);
 void change_split_ratio(node_t *n, value_change_t chg);
 void reset_mode(coordinates_t *loc);
 node_t *brother_tree(node_t *n);
-node_t *closest_visible(desktop_t *d, 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_visible_leaf(desktop_t *d, node_t *n, node_t *r);
-node_t *prev_visible_leaf(desktop_t *d, 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(desktop_t *d, node_t *n, direction_t dir, client_select_t sel);
-node_t *nearest_from_history(desktop_t *d, node_t *n, direction_t dir, client_select_t sel);
-node_t *nearest_from_distance(desktop_t *d, node_t *n, direction_t dir, client_select_t sel);
+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(desktop_t *d, node_t *c, client_select_t sel);
+node_t *find_biggest(monitor_t *m, desktop_t *d, node_t *n, client_select_t sel);
 void move_fence(node_t *n, direction_t dir, fence_move_t mov);
 void rotate_tree(node_t *n, int deg);
 void rotate_brother(node_t *n);
@@ -45,8 +68,9 @@ 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(desktop_t *d, node_t *n, cycle_dir_t dir, client_select_t sel);
+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