From: Mukund Sivaraman <muks@isc.org>
Date: Mon, 24 Sep 2012 05:00:33 +0000 (+0530)
Subject: [2218] Rearrange method in domaintree.h
X-Git-Tag: trac2351_base~37^2~1^2~3^2~45
X-Git-Url: http://git.ipfire.org/gitweb.cgi?a=commitdiff_plain;h=3aeb78fd7a34c736a4ba3b985ef6a0f8432bfafa;p=thirdparty%2Fkea.git

[2218] Rearrange method in domaintree.h
---

diff --git a/src/lib/datasrc/memory/domaintree.h b/src/lib/datasrc/memory/domaintree.h
index 5d98d48cb0..9087a95982 100644
--- a/src/lib/datasrc/memory/domaintree.h
+++ b/src/lib/datasrc/memory/domaintree.h
@@ -391,6 +391,14 @@ public:
     /// This method never throws an exception.
     const DomainTreeNode<T>* getSubTreeRoot() const;
 
+    /// \brief returns the largest node of this node's subtree
+    ///
+    /// This method takes a node and returns the largest node in its
+    /// subtree.
+    ///
+    /// This method never throws an exception.
+    const DomainTreeNode<T>* getLargestInSubTree() const;
+
     /// \brief returns the parent of the root of its subtree
     ///
     /// This method takes a node and returns the parent of the root of
@@ -401,14 +409,6 @@ public:
     /// This method never throws an exception.
     const DomainTreeNode<T>* getUpperNode() const;
 
-    /// \brief returns the largest node of this node's subtree
-    ///
-    /// This method takes a node and returns the largest node in its
-    /// subtree.
-    ///
-    /// This method never throws an exception.
-    const DomainTreeNode<T>* getLargestInSubTree() const;
-
     /// \brief return the next node which is bigger than current node
     /// in the same subtree
     ///