diff options
| author | Rainer Gerhards <rgerhards@adiscon.com> | 2013-11-27 17:47:10 +0100 |
|---|---|---|
| committer | Rainer Gerhards <rgerhards@adiscon.com> | 2013-11-27 17:47:10 +0100 |
| commit | 54f41ae512ddd5c5555bcbfa49da56a72d94ad9f (patch) | |
| tree | 6e18a833d0bd66f0a2364b8beff78bdf5450cac9 | |
| parent | a2b4a8ac920434afc11d55a447a121a1236409e1 (diff) | |
| download | rsyslog-54f41ae512ddd5c5555bcbfa49da56a72d94ad9f.tar.gz rsyslog-54f41ae512ddd5c5555bcbfa49da56a72d94ad9f.tar.bz2 rsyslog-54f41ae512ddd5c5555bcbfa49da56a72d94ad9f.zip | |
doc: remove some implementation details
| -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 d72810f1..4ef5d59d 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>] |