diff options
| author | Rainer Gerhards <rgerhards@adiscon.com> | 2013-01-24 16:06:49 +0100 |
|---|---|---|
| committer | Rainer Gerhards <rgerhards@adiscon.com> | 2013-01-24 16:06:49 +0100 |
| commit | a63e98712757a9f287e648075aa143bbb23cbd7d (patch) | |
| tree | 29799158ffd466ff382a79ee56f4a4a2de8f2819 | |
| parent | 42461433c8f0d1c4531d981fc669b45e3ff64051 (diff) | |
| download | rsyslog-a63e98712757a9f287e648075aa143bbb23cbd7d.tar.gz rsyslog-a63e98712757a9f287e648075aa143bbb23cbd7d.tar.bz2 rsyslog-a63e98712757a9f287e648075aa143bbb23cbd7d.zip | |
doc: fix time complexity in lookup table spec
| -rw-r--r-- | doc/lookup_tables.html | 4 |
1 files 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>] |