Gerrit Renker 2bbf29acd8 [DCCP] tfrc: Binary search for reverse TFRC lookup ... This replaces the linear search algorithm for reverse lookup with binary search. It has the advantage of better scalability: O(log2(N)) instead of O(N). This means that the average number of iterations is reduced from 250 (linear search if each value appears equally likely) down to at most 9. Signed-off-by: Gerrit Renker <gerrit@erg.abdn.ac.uk> Acked-by: Ian McDonald <ian.mcdonald@jandi.co.nz> Signed-off-by: Arnaldo Carvalho de Melo <acme@mandriva.com>		2006-12-03 14:53:27 -02:00
..
ccids	[DCCP] tfrc: Binary search for reverse TFRC lookup	2006-12-03 14:53:27 -02:00
ackvec.c
ackvec.h
ccid.c
ccid.h	[DCCP]: Use `unsigned' for packet lengths	2006-12-02 21:31:02 -08:00
dccp.h
diag.c
feat.c
feat.h
input.c
ipv4.c
ipv6.c
ipv6.h
Kconfig
Makefile
minisocks.c
options.c
output.c	[DCCP]: Use `unsigned' for packet lengths	2006-12-02 21:31:02 -08:00
probe.c
proto.c	[DCCP]: Make {set,get}sockopt(DCCP_SOCKOPT_PACKET_SIZE) return 0	2006-12-02 21:31:00 -08:00
sysctl.c	[DCCP]: Remove allocation of sysctl numbers	2006-12-02 21:30:56 -08:00
timer.c