/*
GNU LESSER GENERAL PUBLIC LICENSE
Copyright (C) 2006 The Lobo Project
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
Contact info: lobochief@users.sourceforge.net
*/
/*
* Created on Sep 3, 2005
*/
import java.util.*;
public class ListSet implements List, Set {
private final List list = new ArrayList();
private final Set set = new HashSet();
public ListSet() {
super();
}
/* (non-Javadoc)
* @see java.util.List#add(int, E)
*/
public void add(int index, Object element) {
if(this.set.add(element)) {
list.add(index, element);
}
}
/* (non-Javadoc)
* @see java.util.List#add(E)
*/
public boolean add(Object o) {
if(this.set.add(o)) {
return this.list.add(o);
}
else {
return false;
}
}
/* (non-Javadoc)
* @see java.util.List#addAll(java.util.Collection)
*/
public boolean addAll(Collection c) {
boolean changed = false;
Iterator i = c.iterator();
while(i.hasNext()) {
Object element = i.next();
if(this.add(element)) {
changed = true;
}
}
return changed;
}
/* (non-Javadoc)
* @see java.util.List#addAll(int, java.util.Collection)
*/
public boolean addAll(int index, Collection c) {
boolean changed = false;
int insertIndex = index;
Iterator i = c.iterator();
while(i.hasNext()) {
Object element = i.next();
if(this.set.add(element)) {
this.list.add(insertIndex++, element);
changed = true;
}
}
return changed;
}
/* (non-Javadoc)
* @see java.util.List#clear()
*/
public void clear() {
this.set.clear();
this.list.clear();
}
/* (non-Javadoc)
* @see java.util.List#contains(java.lang.Object)
*/
public boolean contains(Object o) {
return this.set.contains(o);
}
/* (non-Javadoc)
* @see java.util.List#containsAll(java.util.Collection)
*/
public boolean containsAll(Collection c) {
return this.set.containsAll(c);
}
/* (non-Javadoc)
* @see java.util.List#get(int)
*/
public Object get(int index) {
return this.list.get(index);
}
/* (non-Javadoc)
* @see java.util.List#indexOf(java.lang.Object)
*/
public int indexOf(Object o) {
return this.list.indexOf(o);
}
/* (non-Javadoc)
* @see java.util.List#isEmpty()
*/
public boolean isEmpty() {
return this.set.isEmpty();
}
/* (non-Javadoc)
* @see java.util.List#iterator()
*/
public Iterator iterator() {
return this.list.iterator();
}
/* (non-Javadoc)
* @see java.util.List#lastIndexOf(java.lang.Object)
*/
public int lastIndexOf(Object o) {
return this.list.lastIndexOf(o);
}
/* (non-Javadoc)
* @see java.util.List#listIterator()
*/
public ListIterator listIterator() {
return this.list.listIterator();
}
/* (non-Javadoc)
* @see java.util.List#listIterator(int)
*/
public ListIterator listIterator(int index) {
return this.list.listIterator(index);
}
/* (non-Javadoc)
* @see java.util.List#remove(int)
*/
public Object remove(int index) {
Object element = this.list.remove(index);
if(element != null) {
this.set.remove(element);
}
return element;
}
/* (non-Javadoc)
* @see java.util.List#remove(java.lang.Object)
*/
public boolean remove(Object o) {
if(this.set.remove(o)) {
this.list.remove(o);
return true;
}
else {
return false;
}
}
/* (non-Javadoc)
* @see java.util.List#removeAll(java.util.Collection)
*/
public boolean removeAll(Collection c) {
if(this.set.removeAll(c)) {
this.list.removeAll(c);
return true;
}
else {
return false;
}
}
/* (non-Javadoc)
* @see java.util.List#retainAll(java.util.Collection)
*/
public boolean retainAll(Collection c) {
if(this.set.retainAll(c)) {
this.list.retainAll(c);
return true;
}
else {
return false;
}
}
/* (non-Javadoc)
* @see java.util.List#set(int, E)
*/
public Object set(int index, Object element) {
this.set.add(element);
return this.list.set(index, element);
}
/* (non-Javadoc)
* @see java.util.List#size()
*/
public int size() {
return this.list.size();
}
/* (non-Javadoc)
* @see java.util.List#subList(int, int)
*/
public List subList(int fromIndex, int toIndex) {
return this.list.subList(fromIndex, toIndex);
}
/* (non-Javadoc)
* @see java.util.List#toArray()
*/
public Object[] toArray() {
return this.list.toArray();
}
/* (non-Javadoc)
* @see java.util.List#toArray(T[])
*/
public Object[] toArray(Object[] a) {
return this.list.toArray(a);
}
public boolean equals(Object other) {
return other instanceof ListSet && this.list.equals(((ListSet) other).list);
}
public int hashCode() {
return this.list.hashCode();
}
}
9.18.Set |
| 9.18.1. | Convert a List to a Set |
| 9.18.2. | Convert an ArrayList to HashSet |
| 9.18.3. | Creating a Sorted Set |
| 9.18.4. | Create new sets from Iterable, var argv |
| 9.18.5. | Create an array containing the elements in a set |
| 9.18.6. | Comparable with a sorted collection. |
| 9.18.7. | Duplicate elements are discarded |
| 9.18.8. | Creating a Set That Retains Order-of-Insertion |
| 9.18.9. | Convert Set into array |
| 9.18.10. | Convert Set into List |
| 9.18.11. | Copy all the elements from set2 to set1 (set1 += set2), set1 becomes the union of set1 and set2 |
| 9.18.12. | Remove all the elements in set1 from set2 (set1 -= set2), set1 becomes the asymmetric difference of set1 and set2 |
| 9.18.13. | Get the intersection of set1 and set2, set1 becomes the intersection of set1 and set2 |
| 9.18.14. | Set operations: union, intersection, difference, symmetric difference, is subset, is superset |
| 9.18.15. | Remove all elements from a set |
| 9.18.16. | List Set |
| 9.18.17. | Set implementation that use == instead of equals() |
| 9.18.18. | Set union and intersection |
| 9.18.19. | Set with values iterated in insertion order. |
| 9.18.20. | Implements the Set interface, backed by a ConcurrentHashMap instance |
| 9.18.21. | A weak HashSet: element stored in the WeakHashSet might be garbage collected |
| 9.18.22. | An IdentitySet that uses reference-equality instead of object-equality |
| 9.18.23. | A thin wrapper around a List transforming it into a modifiable Set. |
| 9.18.24. | Concurrent set |
| 9.18.25. | Set that compares object by identity rather than equality |