UniqueList.java |
1 /** 2 * Copyright (c) 2000-2009 Liferay, Inc. All rights reserved. 3 * 4 * 5 * 6 * 7 * The contents of this file are subject to the terms of the Liferay Enterprise 8 * Subscription License ("License"). You may not use this file except in 9 * compliance with the License. You can obtain a copy of the License by 10 * contacting Liferay, Inc. See the License for the specific language governing 11 * permissions and limitations under the License, including but not limited to 12 * distribution rights of the Software. 13 * 14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 16 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 17 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 18 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 19 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 20 * SOFTWARE. 21 */ 22 23 package com.liferay.util; 24 25 import java.util.ArrayList; 26 import java.util.Collection; 27 import java.util.Iterator; 28 29 /** 30 * <a href="UniqueList.java.html"><b><i>View Source</i></b></a> 31 * 32 * @author Brian Wing Shun Chan 33 */ 34 public class UniqueList<E> extends ArrayList<E> { 35 36 public UniqueList() { 37 super(); 38 } 39 40 public boolean add(E e) { 41 if (!contains(e)) { 42 return super.add(e); 43 } 44 else { 45 return false; 46 } 47 } 48 49 public void add(int index, E e) { 50 if (!contains(e)) { 51 super.add(index, e); 52 } 53 } 54 55 public boolean addAll(Collection<? extends E> c) { 56 c = new ArrayList<E>(c); 57 58 Iterator<? extends E> itr = c.iterator(); 59 60 while (itr.hasNext()) { 61 E e = itr.next(); 62 63 if (contains(e)) { 64 itr.remove(); 65 } 66 } 67 68 return super.addAll(c); 69 } 70 71 public boolean addAll(int index, Collection<? extends E> c) { 72 c = new ArrayList<E>(c); 73 74 Iterator<? extends E> itr = c.iterator(); 75 76 while (itr.hasNext()) { 77 E e = itr.next(); 78 79 if (contains(e)) { 80 itr.remove(); 81 } 82 } 83 84 return super.addAll(index, c); 85 } 86 87 public E set(int index, E e) { 88 if (!contains(e)) { 89 return super.set(index, e); 90 } 91 else { 92 return e; 93 } 94 } 95 96 }