forked from TheAlgorithms/Java
- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBag.java
More file actions
Latest commit
126 lines (106 loc) · 2.59 KB
/
Copy pathBag.java
File metadata and controls
126 lines (106 loc) · 2.59 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
packageBags;
importjava.util.Iterator;
importjava.util.NoSuchElementException;
/**
* Collection which does not allow removing elements (only collect and iterate)
*
* @param <Element> - the generic type of an element in this bag
*/
publicclassBag<Element> implementsIterable<Element> {
privateNode<Element> firstElement; // first element of the bag
privateintsize; // size of bag
privatestaticclassNode<Element> {
privateElementcontent;
privateNode<Element> nextElement;
}
/**
* Create an empty bag
*/
publicBag() {
firstElement = null;
size = 0;
}
/**
* @return true if this bag is empty, false otherwise
*/
publicbooleanisEmpty() {
returnfirstElement == null;
}
/**
* @return the number of elements
*/
publicintsize() {
returnsize;
}
/**
* @param element - the element to add
*/
publicvoidadd(Elementelement) {
Node<Element> oldfirst = firstElement;
firstElement = newNode<>();
firstElement.content = element;
firstElement.nextElement = oldfirst;
size++;
}
/**
* Checks if the bag contains a specific element
*
* @param element which you want to look for
* @return true if bag contains element, otherwise false
*/
publicbooleancontains(Elementelement) {
Iterator<Element> iterator = this.iterator();
while(iterator.hasNext()) {
if (iterator.next().equals(element)) {
returntrue;
}
}
returnfalse;
}
/**
* @return an iterator that iterates over the elements in this bag in arbitrary order
*/
publicIterator<Element> iterator() {
returnnewListIterator<>(firstElement);
}
@SuppressWarnings("hiding")
privateclassListIterator<Element> implementsIterator<Element> {
privateNode<Element> currentElement;
publicListIterator(Node<Element> firstElement) {
currentElement = firstElement;
}
publicbooleanhasNext() {
returncurrentElement != null;
}
/**
* remove is not allowed in a bag
*/
@Override
publicvoidremove() {
thrownewUnsupportedOperationException();
}
publicElementnext() {
if (!hasNext())
thrownewNoSuchElementException();
Elementelement = currentElement.content;
currentElement = currentElement.nextElement;
returnelement;
}
}
/**
* main-method for testing
*/
publicstaticvoidmain(String[] args) {
Bag<String> bag = newBag<>();
bag.add("1");
bag.add("1");
bag.add("2");
System.out.println("size of bag = " + bag.size());
for (Strings : bag) {
System.out.println(s);
}
System.out.println(bag.contains(null));
System.out.println(bag.contains("1"));
System.out.println(bag.contains("3"));
}
}