fix

[libfirm] / ir / adt / unionfind.h

diff --git a/ir/adt/unionfind.h b/ir/adt/unionfind.h
index 9698184..a4fb551 100644 (file)
--- a/ir/adt/unionfind.h
+++ b/ir/adt/unionfind.h
@@ -1,26 +1,35 @@
 /*
- * Project:     libFIRM
- * File name:   ir/adt/unionfind.h
- * Purpose:     Union-Find datastructure
- * Author:      Matthias Braun
- * Modified by:
- * CVS-ID:      $Id$
- * Copyright:   (c) 2006, Matthias Braun
- * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
+ * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
  */
 
 /**
- * @file unionfind.h
- *
- * Union-Find datastructure
+ * @file
+ * @brief      Union-Find datastructure
+ * @author     Matthias Braun
+ * @version    $Id$
+ * @summary
+ *  Union-Find datastructure
  *
- * This implementation uses weighted sets and path compression which results
- * in O(n) complexity for n find and union operations (actually it's
- * n * alpha(n) with alpha being the inverse of the ackermann function and
- * therefore smaller than 5 for all 64bit values of n)
+ *  This implementation uses weighted sets and path compression which results
+ *  in (nearly) O(n) complexity for n find and union operations
  */
-#ifndef _UNIONFIND_H
-#define _UNIONFIND_H
+#ifndef FIRM_ADT_UNIONFIND_H
+#define FIRM_ADT_UNIONFIND_H
 
 #include <assert.h>
 
@@ -29,11 +38,10 @@
  * union find functions.
  *
  * @param data The array (you have to allocate it yourself)
- * @param from The first element that should be intialized
+ * @param from The first element that should be initialized
  * @param to   the index of the first element which is not initialized anymore
  */
-static INLINE void uf_init(int* data, int from, int to)
-{
+static INLINE void uf_init(int* data, int from, int to) {
        int i;
        for(i = from; i < to; ++i) {
                data[i] = -1;
@@ -58,7 +66,7 @@ static INLINE int uf_union(int* data, int set1, int set2) {
        if(set1 == set2)
                return 0;
 
-       // need 2 set represantatives
+       /* need 2 set representatives */
        assert(d1 < 0 && d2 < 0);
 
        newcount = d1 + d2;
@@ -84,13 +92,13 @@ static INLINE int uf_union(int* data, int set1, int set2) {
  * @return             The representative of the set that contains @p e
  */
 static INLINE int uf_find(int* data, int e) {
-       // go through list to find representative
-    int repr = e;
+       /* go through list to find representative */
+       int repr = e;
        while(data[repr] >= 0) {
                repr = data[repr];
        }
 
-       // update list to point to new representative (path compression)
+       /* update list to point to new representative (path compression) */
        while(e != repr) {
                int next = data[e];
                data[e] = repr;
@@ -100,4 +108,4 @@ static INLINE int uf_find(int* data, int e) {
        return repr;
 }
 
-#endif
+#endif /* FIRM_ADT_UNIONFIND_H */