X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=include%2Flibfirm%2Fadt%2Funionfind.h;h=13c70cacf4861aa95e653fb49b76f750fb8eb0ab;hb=15ad7ccd8dff64e1808e1d093d4a8d7cda5af33e;hp=2c2316d801c1805f4d38f64eb00ccd53805c3484;hpb=de8f567353c055dad17398c38f6467f9d6020b52;p=libfirm

diff --git a/include/libfirm/adt/unionfind.h b/include/libfirm/adt/unionfind.h
index 2c2316d80..13c70cacf 100644
--- a/include/libfirm/adt/unionfind.h
+++ b/include/libfirm/adt/unionfind.h
@@ -33,6 +33,8 @@
 
 #include <assert.h>
 
+#include "../begin.h"
+
 /**
  * Call this to initialize an array of @p count elements to be used by the
  * union find functions.
@@ -52,9 +54,9 @@ static inline void uf_init(int* data, size_t n_elems)
  * Merge 2 sets (union operation). Note that you have to pass the
  * representatives of the sets and not just random elements
  *
- * @param data	The union find data
- * @param set1	Representative of set1
- * @param set2	Representative of set2
+ * @param data  The union find data
+ * @param set1  Representative of set1
+ * @param set2  Representative of set2
  * @return      the new representative of the set (which is set1 or set2)
  */
 static inline int uf_union(int* data, int set1, int set2)
@@ -89,9 +91,9 @@ static inline int uf_union(int* data, int set1, int set2)
  * the same/different representatives, then the elements are in the
  * the same/different sets.
  *
- * @param data	The union find data
- * @param e		The element
- * @return		The representative of the set that contains @p e
+ * @param data  The union find data
+ * @param e     The element
+ * @return      The representative of the set that contains @p e
  */
 static inline int uf_find(int* data, int e)
 {
@@ -111,4 +113,6 @@ static inline int uf_find(int* data, int e)
 	return repr;
 }
 
+#include "../end.h"
+
 #endif