KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > org > snipsnap > util > WeblogQueue


1 /*
2  * This file is part of "SnipSnap Wiki/Weblog".
3  *
4  * Copyright (c) 2002 Stephan J. Schmidt, Matthias L. Jugel
5  * All Rights Reserved.
6  *
7  * Please visit http://snipsnap.org/ for updates and contact.
8  *
9  * --LICENSE NOTICE--
10  * This program is free software; you can redistribute it and/or
11  * modify it under the terms of the GNU General Public License
12  * as published by the Free Software Foundation; either version 2
13  * of the License, or (at your option) any later version.
14  *
15  * This program is distributed in the hope that it will be useful,
16  * but WITHOUT ANY WARRANTY; without even the implied warranty of
17  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18  * GNU General Public License for more details.
19  *
20  * You should have received a copy of the GNU General Public License
21  * along with this program; if not, write to the Free Software
22  * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
23  * --LICENSE NOTICE--
24  */
25 package org.snipsnap.util;
26
27 import java.util.LinkedList JavaDoc;
28 import java.util.List JavaDoc;
29
30 /**
31  * Queue implementation for Weblogs.
32  * @author Stephan J. Schmidt
33  * @version $Id: WeblogQueue.java 419 2002-10-09 14:26:01Z stephan $
34  */
35 public class WeblogQueue {
36   private LinkedList JavaDoc queue;
37   private int size;
38
39   public WeblogQueue(int size) {
40     this.size = size;
41     queue = new LinkedList JavaDoc();
42   }
43
44   public Weblog add(Weblog weblog) {
45     if (queue.contains(weblog)) {
46       queue.remove(weblog);
47     }
48
49     if (queue.size() == size) {
50       queue.removeLast();
51     }
52     queue.addFirst(weblog);
53     return weblog;
54   }
55
56   public void remove(Weblog weblog) {
57     queue.remove(weblog);
58   }
59
60   public List JavaDoc get() {
61     return (List JavaDoc) queue;
62   }
63
64   public List JavaDoc get(int count) {
65     count = Math.min(count, queue.size());
66     return (List JavaDoc) queue.subList(0, count);
67   }
68
69 }
70
Popular Tags