At 01:10 PM 7/21/2010 +0100, Paul Nasrat wrote:
Given the fragility of this it seems that we might want to consider alternative mirrorlist discovery mechanism.
As a fallback, you can of course probe addresses on a binary search, or even just select a random mirror in the first place. (If you overshoot the list, you just decrease the max on your binary lookup.)
Non-random selection is tougher to implement, since you'd need to keep some kind of history to make it work effectively. Determining the length of the list is a trivial problem by comparison.
_______________________________________________ Catalog-SIG mailing list [email protected] http://mail.python.org/mailman/listinfo/catalog-sig
