KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > net > jforum > repository > RankingRepository


1 /*
2  * Copyright (c) 2003, Rafael Steil
3  * All rights reserved.
4
5  * Redistribution and use in source and binary forms,
6  * with or without modification, are permitted provided
7  * that the following conditions are met:
8
9  * 1) Redistributions of source code must retain the above
10  * copyright notice, this list of conditions and the
11  * following disclaimer.
12  * 2) Redistributions in binary form must reproduce the
13  * above copyright notice, this list of conditions and
14  * the following disclaimer in the documentation and/or
15  * other materials provided with the distribution.
16  * 3) Neither the name of "Rafael Steil" nor
17  * the names of its contributors may be used to endorse
18  * or promote products derived from this software without
19  * specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT
22  * HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
23  * EXPRESS OR IMPLIED WARRANTIES, INCLUDING,
24  * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
25  * MERCHANTABILITY AND FITNESS FOR A PARTICULAR
26  * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
27  * THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
29  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES
30  * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
32  * OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
33  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
34  * IN CONTRACT, STRICT LIABILITY, OR TORT
35  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
36  * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
37  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE
38  *
39  * This file creation date: 03/09/2003 / 23:42:55
40  * The JForum Project
41  * http://www.jforum.net
42  */
43 package net.jforum.repository;
44
45 import java.util.Iterator JavaDoc;
46 import java.util.List JavaDoc;
47
48 import net.jforum.cache.CacheEngine;
49 import net.jforum.cache.Cacheable;
50 import net.jforum.dao.DataAccessDriver;
51 import net.jforum.dao.RankingDAO;
52 import net.jforum.entities.Ranking;
53 import net.jforum.exceptions.RankingLoadException;
54
55 /**
56  * @author Rafael Steil
57  * @version $Id: RankingRepository.java,v 1.10 2005/07/26 03:04:54 rafaelsteil Exp $
58  */
59 public class RankingRepository implements Cacheable
60 {
61     private static CacheEngine cache;
62     private static final String JavaDoc FQN = "ranking";
63     private static final String JavaDoc ENTRIES = "entries";
64
65     /**
66      * @see net.jforum.cache.Cacheable#setCacheEngine(net.jforum.cache.CacheEngine)
67      */
68     public void setCacheEngine(CacheEngine engine)
69     {
70         cache = engine;
71     }
72     
73     public static void loadRanks()
74     {
75         try {
76             RankingDAO rm = DataAccessDriver.getInstance().newRankingDAO();
77             cache.add(FQN, ENTRIES, rm.selectAll());
78         }
79         catch (Exception JavaDoc e) {
80             throw new RankingLoadException("Error while loading the rankings: " + e);
81         }
82     }
83     
84     public static int size()
85     {
86         return ((List JavaDoc)cache.get(FQN, ENTRIES)).size();
87     }
88     
89     /**
90      * Gets the title associated to total of messages the user have
91      * @param total Number of messages the user have. The ranking will be
92      * returned according to the range to which this total belongs to.
93      * @return String with the ranking title.
94      */
95     public static String JavaDoc getRankTitle(int total)
96     {
97         Ranking lastRank = new Ranking();
98
99         List JavaDoc entries = (List JavaDoc)cache.get(FQN, ENTRIES);
100         for (Iterator JavaDoc iter = entries.iterator(); iter.hasNext(); ) {
101             Ranking r = (Ranking)iter.next();
102             
103             if (total == r.getMin()) {
104                 return r.getTitle();
105             }
106             else if (total > lastRank.getMin() && total < r.getMin()) {
107                 return lastRank.getTitle();
108             }
109             
110             lastRank = r;
111         }
112         
113         return lastRank.getTitle();
114     }
115
116 }
117
Popular Tags