summaryrefslogtreecommitdiff
path: root/doc/lookup_tables.html
diff options
context:
space:
mode:
authorMichael Biebl <biebl@debian.org>2014-03-11 19:04:23 +0100
committerMichael Biebl <biebl@debian.org>2014-03-11 19:04:23 +0100
commit5fccf771f37973a2cea543fbdf1ed94ed9706faf (patch)
tree80b547300bfb6f1c8ffae16a8af9dea03c3fb75d /doc/lookup_tables.html
parent0c656246c6818b9fd0426411ed1cf926fbbc907d (diff)
downloadrsyslog-upstream/7.4.8.tar.gz
Imported Upstream version 7.4.8upstream/7.4.8
Diffstat (limited to 'doc/lookup_tables.html')
-rw-r--r--doc/lookup_tables.html4
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/lookup_tables.html b/doc/lookup_tables.html
index d72810f..4ef5d59 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 array
-lookup is also O(1). In case of sparseArray, we have O(log n).
+The string lookup has O(log n) time complexity. The array
+lookup is 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>]