summaryrefslogtreecommitdiffhomepage
path: root/src/nxt_http_request.c
diff options
context:
space:
mode:
authorValentin Bartenev <vbart@nginx.com>2018-10-22 16:02:14 +0300
committerValentin Bartenev <vbart@nginx.com>2018-10-22 16:02:14 +0300
commitb20e995e80d236945ec8388dfee37257ce9e5445 (patch)
tree3b97bbd7d41000f645a739fa6ab55530d5900f1a /src/nxt_http_request.c
parenta4aaf906794d9f82710614ba368a36500e8a8254 (diff)
downloadunit-b20e995e80d236945ec8388dfee37257ce9e5445.tar.gz
unit-b20e995e80d236945ec8388dfee37257ce9e5445.tar.bz2
Timers: separation of delete and insert operations on rbtree.
Delete/insert operation complexity for a red-black tree is O(log n), where n is the total number of tree elements. If all delete operations are performed before all insert operations, the average number of tree elements during an operation will be lower than in the mixed-operations case.
Diffstat (limited to '')
0 files changed, 0 insertions, 0 deletions