Jordan Lee cac5c360f2 (trunk libT) #4690 "getPeerCandidates() uses more CPU than necessary" -- fixed. ... Once we've scored all n candidates, we sort them by score so that we can pick out the k best candidates. If n is large, sorting them can be expensive. If we use the Selection Algorithm, we select in O(n) without having to sort.		2011-12-31 21:28:53 +00:00
..
announcer-common.h
announcer-http.c
announcer-udp.c
announcer.c
announcer.h
bandwidth.c
bandwidth.h
bencode-test.c
bencode.c
bencode.h
bitfield.c
bitfield.h
blocklist-test.c
blocklist.c
blocklist.h
cache.c
cache.h
clients-test.c
clients.c
clients.h
completion.c
completion.h
ConvertUTF.c
ConvertUTF.h
crypto.c
crypto.h
fdlimit.c
fdlimit.h
handshake.c
handshake.h
history-test.c
history.c
history.h
inout.c
inout.h
json-test.c
json.c
json.h
JSON_parser.c
JSON_parser.h
libt.dox
list.c
list.h
magnet-test.c
magnet.c
magnet.h
Makefile.am
makemeta.c
makemeta.h
metainfo.c
metainfo.h
natpmp.c
natpmp.h
net.c
net.h
peer-common.h
peer-io.c
peer-io.h
peer-mgr.c
peer-mgr.h
peer-msgs-test.c
peer-msgs.c
peer-msgs.h
platform.c
platform.h
port-forwarding.c
port-forwarding.h
ptrarray.c
ptrarray.h
resume.c
resume.h
rpc-server.c
rpc-server.h
rpc-test.c
rpcimpl.c
rpcimpl.h
session.c
session.h
stats.c
stats.h
test-peer-id.c
torrent-ctor.c
torrent-magnet.c
torrent-magnet.h
torrent.c
torrent.h
tr-dht.c
tr-dht.h
tr-getopt.c
tr-getopt.h
tr-lpd.c
tr-lpd.h
tr-udp.c
tr-udp.h
tr-utp.c
tr-utp.h
transmission.h
trevent.c
trevent.h
upnp.c
upnp.h
utils-test.c
utils.c
utils.h
verify.c
verify.h
web.c
web.h
webseed.c
webseed.h
wildmat.c