X-Git-Url: https://git.lizzy.rs/?a=blobdiff_plain;f=stack.h;h=52b4017446b29796eae68f7c514ad4e33cbf7b15;hb=c9925de1825cd5701ab6b09af9626a5622bb9172;hp=75cdeba211ae3e5119d9293880567cd73c315056;hpb=34b8692796039cad5aaa2d70a427dcffb88ce9a6;p=bspwm.git

diff --git a/stack.h b/stack.h
index 75cdeba..52b4017 100644
--- a/stack.h
+++ b/stack.h
@@ -1,12 +1,40 @@
-#ifndef STACK_H
-#define STACK_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_STACK_H
+#define BSPWM_STACK_H
+
+typedef enum {
+	STACK_ABOVE,
+	STACK_BELOW
+} stack_flavor_t;
 
 stacking_list_t *make_stack(node_t *n);
 void stack_insert_after(stacking_list_t *a, node_t *n);
 void stack_insert_before(stacking_list_t *a, node_t *n);
 void remove_stack(stacking_list_t *s);
 void remove_stack_node(node_t *n);
-void stack(node_t *n);
-void stack_under(node_t *n);
+void stack(node_t *n, stack_flavor_t f);
 
 #endif