Jan Vidar Krey cd5c4ee622 Optimize lookups by CID and nick. ... 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.		2013-03-23 22:11:05 +01:00
..
cbuffer.c	Updated copyright year.	2013-03-22 20:00:40 +01:00
cbuffer.h	Updated copyright year.	2013-03-22 20:00:40 +01:00
config_token.c	Updated copyright year.	2013-03-22 20:00:40 +01:00
config_token.h	Updated copyright year.	2013-03-22 20:00:40 +01:00
credentials.c	Updated copyright year.	2013-03-22 20:00:40 +01:00
credentials.h	Updated copyright year.	2013-03-22 20:00:40 +01:00
floodctl.c	Updated copyright year.	2013-03-22 20:00:40 +01:00
floodctl.h	Updated copyright year.	2013-03-22 20:00:40 +01:00
getopt.c	Updated copyright year.	2013-03-22 20:00:40 +01:00
getopt.h	Updated copyright year.	2013-03-22 20:00:40 +01:00
list.c	Updated copyright year.	2013-03-22 20:00:40 +01:00
list.h	Updated copyright year.	2013-03-22 20:00:40 +01:00
log.c	Updated copyright year.	2013-03-22 20:00:40 +01:00
log.h	Updated copyright year.	2013-03-22 20:00:40 +01:00
memory.c	Updated copyright year.	2013-03-22 20:00:40 +01:00
memory.h	Updated copyright year.	2013-03-22 20:00:40 +01:00
misc.c	Updated copyright year.	2013-03-22 20:00:40 +01:00
misc.h	Updated copyright year.	2013-03-22 20:00:40 +01:00
rbtree.c	Optimize lookups by CID and nick.	2013-03-23 22:11:05 +01:00
rbtree.h	Updated copyright year.	2013-03-22 20:00:40 +01:00
threads.c	Updated copyright year.	2013-03-22 20:00:40 +01:00
threads.h	Updated copyright year.	2013-03-22 20:00:40 +01:00
tiger.c	Updated copyright year.	2013-03-22 20:00:40 +01:00
tiger.h	Updated copyright year.	2013-03-22 20:00:40 +01:00