Niels Thykier cc58511c09 Avoid O(n^2) duplication handling when building hints
Use a set to filter out seen items to avoid doing O(n^2)
de-duplication.  For very large hints, this can take considerable
time.

Using "seen_items" to build the actual hints on the (unverified)
assumption that Python can do something "smart" to turn a set into a
frozenset faster than it can with a list.

Signed-off-by: Niels Thykier <niels@thykier.net>
2015-06-02 21:33:52 +02:00
2011-12-23 11:16:32 +01:00
2008-05-20 17:37:56 +02:00
2015-06-02 21:29:47 +02:00
2013-11-27 19:46:59 +01:00
2015-04-26 18:20:11 +02:00
2015-04-26 18:20:10 +02:00
2011-07-06 18:31:45 +00:00

README for britney v2.0
=======================

Please write here some useful stuff.

Description
britney2-ubuntu fork which runs on ci.lubuntu.me
Readme GPL-2.0 9.2 MiB
Languages
Python 99.6%
Shell 0.3%