X-Git-Url: https://blacka.com/cgi-bin/gitweb.cgi?p=python-rwhoisd.git;a=blobdiff_plain;f=rwhoisd%2FMemIndex.py;fp=rwhoisd%2FMemIndex.py;h=996ef42b19ce814fbc1b156d2b87301e82872ec1;hp=4d3c5e3188f1c5ba35bdfc814b34c87341875b09;hb=aadd4ff214890fc6ea7a660cca3e819ce67dcbcb;hpb=ba4c9a9831b4b889e82078810a24295df18ce718

diff --git a/rwhoisd/MemIndex.py b/rwhoisd/MemIndex.py
index 4d3c5e3..996ef42 100644
--- a/rwhoisd/MemIndex.py
+++ b/rwhoisd/MemIndex.py
@@ -130,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