Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package aufgabe1;
- import java.util.HashSet;
- import java.util.Iterator;
- import java.util.Set;
- public class Bag {
- Set<Object> multiSet = new HashSet<Object>();
- private int index = 0;
- Bag() {
- }
- private class Note {
- private Object ob;
- Note(Object ob) {
- this.ob = ob;
- }
- public Object getData() {
- return ob;
- }
- }
- public boolean add(Object ob) {
- multiSet.add(new Note(ob));
- return true;
- }
- public boolean contains(Object ob) {
- for (Object coob : toArray())
- if (((Note) coob).getData() != null)
- if (((Note) coob).getData().equals(ob))
- return true;
- return false;
- }
- public Object[] toArray() {
- return multiSet.toArray();
- }
- public int getSize() {
- return multiSet.size();
- }
- public boolean isEmpty() {
- return multiSet.isEmpty();
- }
- public Iterator<Object> iterator() {
- return new BagIterator();
- }
- private class BagIterator implements Iterator<Object> {
- Object[] iob = toArray();
- public boolean hasNext() {
- return index < iob.length;
- }
- public Object next() {
- return ((Note) iob[index++]).getData();
- }
- public void remove() {
- throw new UnsupportedOperationException();
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement