From 2ac272cfbfb5f199a27a3f4026e804c3d616ba68 Mon Sep 17 00:00:00 2001
From: hermens <hermens@6c8d7289-2bf4-0310-a012-ef5d649a1542>
Date: Thu, 1 Dec 2011 23:51:39 +0000
Subject: [PATCH] Fix for PeerSelection.seedsByAge() for big networks (>1000
 Peers) To get the most(least) recent peers search those with highest(lowest)
 LastSeen instead of the first by peerhash

git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@8129 6c8d7289-2bf4-0310-a012-ef5d649a1542
---
 source/net/yacy/peers/dht/PeerSelection.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/source/net/yacy/peers/dht/PeerSelection.java b/source/net/yacy/peers/dht/PeerSelection.java
index 419de300e..4b1542a72 100755
--- a/source/net/yacy/peers/dht/PeerSelection.java
+++ b/source/net/yacy/peers/dht/PeerSelection.java
@@ -439,7 +439,7 @@ public class PeerSelection {
         final ScoreMap<String> seedScore = new ConcurrentScoreMap<String>();
         Seed ys;
         long absage;
-        final Iterator<Seed> s = seedDB.seedsConnected(true, false, null, (float) 0.0);
+        final Iterator<Seed> s = seedDB.seedsSortedConnected(!up, Seed.LASTSEEN); 
         int searchcount = 1000;
         if (searchcount > seedDB.sizeConnected()) searchcount = seedDB.sizeConnected();
         try {