001    ///////////////////////////////////////////////////////////////////////////////
002    // Copyright (c) 2006, Frank S. Nestel, All Rights Reserved.
003    //
004    // This library is free software; you can redistribute it and/or
005    // modify it under the terms of the GNU Lesser General Public
006    // License as published by the Free Software Foundation; either
007    // version 2.1 of the License, or (at your option) any later version.
008    //
009    // This library is distributed in the hope that it will be useful,
010    // but WITHOUT ANY WARRANTY; without even the implied warranty of
011    // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
012    // GNU General Public License for more details.
013    //
014    // You should have received a copy of the GNU Lesser General Public
015    // License along with this program; if not, write to the Free Software
016    // Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
017    ///////////////////////////////////////////////////////////////////////////////
018    
019    package de.spieleck.app.turn.pairing;
020    
021    import java.util.Arrays;
022    import java.util.Random;
023    
024    import de.spieleck.app.turn.Game;
025    import de.spieleck.app.turn.Player;
026    import de.spieleck.app.turn.SplittingMode;
027    import de.spieleck.app.turn.PlayerRegistry;
028    
029    /**
030     * This is a simple pairing mode, which simply chooses the
031     * top-N number of players to play a true final.
032     *
033     * <p><a href="$URL: https://svn.sourceforge.net/svnroot/jtourney/src/de/spieleck/app/turn/pairing/FinalPairing.java $">$URL: https://svn.sourceforge.net/svnroot/jtourney/src/de/spieleck/app/turn/pairing/FinalPairing.java $</a></p>
034     *
035     * @author Frank S. Nestel
036     * @author $Author: nestefan $
037     * @version $Revision: 2 $ $Date: 2006-03-20 14:33:27 +0100 (Mo, 20 Mrz 2006) $ $Author: nestefan $
038     */
039    public class FinalPairing
040        extends BasePairing
041    {
042        public Game[] pairing(int round, PlayerRegistry pRegistry, SplittingMode sm)
043        {
044            Player[] standing = pRegistry.getActivePlayers();
045            Arrays.sort(standing);
046            GameImpl[] res = new GameImpl[1];
047            res[0] = new GameImpl(1);
048            for(int i = 0; i < sm.optimal(); i++)
049                res[0].add(standing[i]);
050            return res;
051        }
052    }