From a63e98712757a9f287e648075aa143bbb23cbd7d Mon Sep 17 00:00:00 2001
From: Rainer Gerhards <rgerhards@adiscon.com>
Date: Thu, 24 Jan 2013 16:06:49 +0100
Subject: doc: fix time complexity in lookup table spec

---
 doc/lookup_tables.html | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/doc/lookup_tables.html b/doc/lookup_tables.html
index 9d4fabb7..e6a0fd71 100644
--- a/doc/lookup_tables.html
+++ b/doc/lookup_tables.html
@@ -190,8 +190,8 @@ be sufficiently secured, e.g. via TLS mutual auth.
 
 <h2>Implementation Details</h2>
 <p>The lookup table functionality is implemented via highly efficient algorithms.
-The string lookup is based on a parse tree and has O(1) time complexity. The other
-types are also O(1).
+The string lookup is based on a parse tree and has O(1) time complexity. The array
+lookup is also O(1). In case of sparseArray, we have O(log n).
 <p>To preserve space and, more important, increase cache hit performance, equal
 data values are only stored once, no matter how often a lookup index points to them.
 <p>[<a href="rsyslog_conf.html">rsyslog.conf overview</a>]
-- 
cgit v1.2.3