1 /*
2 * Copyright (c) 2003, Henri Yandell
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or
6 * without modification, are permitted provided that the
7 * following conditions are met:
8 *
9 * + Redistributions of source code must retain the above copyright notice,
10 * this list of conditions and the following disclaimer.
11 *
12 * + Redistributions in binary form must reproduce the above copyright notice,
13 * this list of conditions and the following disclaimer in the documentation
14 * and/or other materials provided with the distribution.
15 *
16 * + Neither the name of Genjava-Core nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
21 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
24 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30 * POSSIBILITY OF SUCH DAMAGE.
31 */
32 package com.generationjava.collections;
33
34 import java.util.ArrayList;
35 import java.util.Collection;
36 import java.util.Comparator;
37 import java.util.List;
38
39 /***
40 * Only allows N elements in. Once size N is reached, all
41 * new adds are ignored and inserts mean the one on the end
42 * of the list is removed.
43 * The List is kept in a sorted order.
44 */
45 public class SortedLimitedList extends LimitedList {
46
47 private Comparator comparator;
48
49 public SortedLimitedList(int capacity, Comparator comparator) {
50 this(new ArrayList(), capacity, comparator);
51 }
52
53 public SortedLimitedList(List list, int capacity, Comparator comparator) {
54 super(list, capacity);
55 this.comparator = comparator;
56 }
57
58 public boolean add(Object obj) {
59 if(isEmpty()) {
60 return super.add(obj);
61 }
62 if(isFull()) {
63 if(comparator.compare(obj, get(size()-1)) <= 0) {
64 return false;
65 }
66 }
67 insertIntoSort(obj);
68 return true;
69 }
70
71 // inserts into correctly sorted position
72 private void insertIntoSort(Object obj) {
73 int sz = size();
74 int i; // used outside loop
75 for(i=sz-1; i>-1; i--) {
76 if(comparator.compare(obj, get(i)) > 0) {
77 continue;
78 } else {
79 break;
80 }
81 }
82 super.add(i+1, obj);
83 }
84
85 public boolean addAll(Collection coll) {
86 return super.addAll(coll);
87 }
88
89 public boolean addAll(int i, Collection coll) {
90 return super.addAll(i,coll);
91 }
92
93 /// TODO
94 public boolean retainAll(Collection coll) {
95 return super.retainAll(coll);
96 }
97
98 public void add(int i, Object obj) {
99 super.add(i,obj);
100 }
101
102 public String toString() {
103 return super.toString();
104 }
105 }
This page was automatically generated by Maven