cd5c4ee622
This used to be a linear search O(n), but is now done as a red-black tree O(log n) instead. These operations can be further opimized with a hash-table which would acheive near constant time lookups. |
||
---|---|---|
admin | ||
autotest | ||
cmake/Modules | ||
debian | ||
doc | ||
src | ||
thirdparty | ||
tools | ||
.gitignore | ||
.gitmodules | ||
AUTHORS | ||
BUGS | ||
CMakeLists.txt | ||
COPYING | ||
COPYING.OpenSSL | ||
ChangeLog | ||
README | ||
TODO |
README
Welcome and thanks for downloading uHub, a high performance ADC p2p hub. For the official documentation, bugs and other information, please visit: http://www.uhub.org/ For a list of compatible ADC clients, see: http://en.wikipedia.org/wiki/Advanced_Direct_Connect#Client_software