X-Git-Url: https://git.lizzy.rs/?a=blobdiff_plain;f=history.h;h=5df4629fe3324207c7952dc1fc093e199ce9d109;hb=a7821774c50aefa8c758b964814818b4634b77ce;hp=70683eed7e1bd2223824585a2f38cd887c9abd56;hpb=a75979be62bd2b34bbdd06560c5879b6055456fe;p=bspwm.git

diff --git a/history.h b/history.h
index 70683ee..5df4629 100644
--- a/history.h
+++ b/history.h
@@ -1,5 +1,29 @@
-#ifndef _HISTORY_H
-#define _HISTORY_H
+/* Copyright (c) 2012, 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.
+ */
+
+#ifndef BSPWM_HISTORY_H
+#define BSPWM_HISTORY_H
 
 #include "types.h"
 
@@ -9,14 +33,14 @@ void history_transfer_node(monitor_t *m, desktop_t *d, node_t *n);
 void history_transfer_desktop(monitor_t *m, desktop_t *d);
 void history_swap_nodes(monitor_t *m1, desktop_t *d1, node_t *n1, monitor_t *m2, desktop_t *d2, node_t *n2);
 void history_swap_desktops(monitor_t *m1, desktop_t *d1, monitor_t *m2, desktop_t *d2);
-void history_remove(desktop_t *d, node_t *n);
+void history_remove(desktop_t *d, node_t *n, bool deep);
 void empty_history(void);
-node_t *history_get_node(desktop_t *d, node_t *n);
-desktop_t *history_get_desktop(monitor_t *m, desktop_t *d);
-monitor_t *history_get_monitor(monitor_t *m);
-bool history_last_node(node_t *n, client_select_t sel, coordinates_t *loc);
-bool history_last_desktop(desktop_t *d, desktop_select_t sel, coordinates_t *loc);
-bool history_last_monitor(monitor_t *m, desktop_select_t sel, coordinates_t *loc);
-int history_rank(desktop_t *d, node_t *n);
+node_t *history_last_node(desktop_t *d, node_t *n);
+desktop_t *history_last_desktop(monitor_t *m, desktop_t *d);
+monitor_t *history_last_monitor(monitor_t *m);
+bool history_find_node(history_dir_t hdi, coordinates_t *ref, coordinates_t *dst, node_select_t sel);
+bool history_find_desktop(history_dir_t hdi, coordinates_t *ref, coordinates_t *dst, desktop_select_t sel);
+bool history_find_monitor(history_dir_t hdi, coordinates_t *ref, coordinates_t *dst, monitor_select_t sel);
+uint32_t history_rank(node_t *n);
 
 #endif