Beginnings of support V6 data objects

[python-rwhoisd.git] / rwhoisd / MemIndex.py

diff --git a/rwhoisd/MemIndex.py b/rwhoisd/MemIndex.py
index 24a64e2..996ef42 100644 (file)
--- a/rwhoisd/MemIndex.py
+++ b/rwhoisd/MemIndex.py
@@ -1,3 +1,24 @@
+# This file is part of python-rwhoisd
+#
+# Copyright (C) 2003, David E. Blacka
+#
+# $Id: MemIndex.py,v 1.2 2003/04/28 16:43:19 davidb Exp $
+#
+# This program is free software; you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation; either version 2 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, write to the Free Software
+# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
+# USA
+
 import bisect, types
 import Cidr
 
@@ -109,8 +130,8 @@ class CidrMemIndex(MemIndex):
     searching semantics."""
 
     # NOTE: this structure lends to fairly efficient exact searches
-    # (O[log2N]), effience subnet searches (also O[log2N]), but not
-    # terribly efficient supernet searches (O[32log2N]), because we
+    # (O[log2N]), efficient subnet searches (also O[log2N]), but not
+    # terribly efficient supernet searches (O[32 * log2N]), because we
     # have to potentially do 32 exact matches.  If we want efficient
     # supernet searches, we will probably have to use some sort of
     # general (i.e., not binary) search tree datastructure, as there