b20e995e80
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.
NGINX Unit ---------- The documentation and binary packages are available online: http://unit.nginx.org The source code is provided under the terms of Apache License 2.0: http://hg.nginx.org/unit Please ask questions, report issues, and send patches to the mailing list: unit@nginx.org (http://mailman.nginx.org/mailman/listinfo/unit) or via Github: https://github.com/nginx/unit -- NGINX, Inc. http://nginx.com