X-Git-Url: https://git.syn-net.org/debian/?a=blobdiff_plain;f=src%2FroutingTreeNode.cpp;h=9d652486275bd8699e619d102fdc8aad0864332e;hb=bd02a5f6be4815d46524d613f727199ca756c971;hp=eed501b96ab36ad31e00f31e0b7b4a41734d3411;hpb=058ae090a970436caec3b3059e9e18b310dd6b0d;p=anytun.git

diff --git a/src/routingTreeNode.cpp b/src/routingTreeNode.cpp
index eed501b..9d65248 100644
--- a/src/routingTreeNode.cpp
+++ b/src/routingTreeNode.cpp
@@ -11,14 +11,15 @@
  *  tunneling and relaying of packets of any protocol.
  *
  *
- *  Copyright (C) 2007-2008 Othmar Gsenger, Erwin Nindl, 
+ *  Copyright (C) 2007-2009 Othmar Gsenger, Erwin Nindl,
  *                          Christian Pointner <satp@wirdorange.org>
  *
  *  This file is part of Anytun.
  *
  *  Anytun is free software: you can redistribute it and/or modify
- *  it under the terms of the GNU General Public License version 3 as
- *  published by the Free Software Foundation.
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation, either version 3 of the License, or
+ *  any later version.
  *
  *  Anytun is distributed in the hope that it will be useful,
  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
@@ -33,32 +34,32 @@
 
 RoutingTreeNode::RoutingTreeNode():mux_(0),valid_(false)
 {
-	for(int i=0; i<256; i++)
-		nodes_[i]=NULL;
+  for(int i=0; i<256; i++) {
+    nodes_[i]=NULL;
+  }
 }
 
 void RoutingTreeNode::print(int level) const
 {
-	if (valid_)
-	{	
-		std::cout << " -> " <<mux_ ;
-	}
-	std::cout  << std::endl;
-  for(int i=0; i<256; i++)
-	{
-		if ( nodes_[i])
-		{
-			for(int l=0;l<level;l++)
-				std::cout << " ";
-			std::cout << (int) i;
-			nodes_[i]->print(level+1);
-		}
-	}
+  if(valid_) {
+    std::cout << " -> " <<mux_ ;
+  }
+  std::cout  << std::endl;
+  for(int i=0; i<256; i++) {
+    if(nodes_[i]) {
+      for(int l=0; l<level; l++) {
+        std::cout << " ";
+      }
+      std::cout << (int) i;
+      nodes_[i]->print(level+1);
+    }
+  }
 }
 
 RoutingTreeNode::~RoutingTreeNode()
 {
-	for(int i=0; i<256; i++)
-		if(nodes_[i])
-			delete nodes_[i];
-} 
+  for(int i=0; i<256; i++)
+    if(nodes_[i]) {
+      delete nodes_[i];
+    }
+}