21 |
|
~DoublyLinkedList() { while (front.getNext() != &back) front.removeNext(); } |
22 |
|
void addFront(const Type& value) { front.addNext(value); } |
23 |
|
void addBack(const Type& value) { back.addPrevious(value); } |
24 |
< |
bool contains(const Type& value) { return front.contains(value, &back); } |
25 |
< |
void removeFirst(const Type& value) { front.remove(value, &back); } |
26 |
< |
void removeLast(const Type& value) { back.remove(value, &front, false); } |
24 |
> |
bool contains(const Type& value); |
25 |
> |
void removeFirst(const Type& value); |
26 |
> |
void removeLast(const Type& value); |
27 |
|
Iterator<Type> iterator(void) { return Iterator<Type>(&front, &back); } |
28 |
< |
void accept(Visitor<Type>* visitor) { front.accept(visitor, &back); } |
28 |
> |
void accept(Visitor<Type>* visitor); |
29 |
|
}; |
30 |
|
|
31 |
+ |
template<typename Type> |
32 |
+ |
bool DoublyLinkedList<Type>::contains(const Type& value) |
33 |
+ |
{ |
34 |
+ |
return front.contains(value, dynamic_cast<Node<Type>*>(&back), true); |
35 |
+ |
} |
36 |
+ |
|
37 |
+ |
template<typename Type> |
38 |
+ |
void DoublyLinkedList<Type>::removeFirst(const Type& value) |
39 |
+ |
{ |
40 |
+ |
front.remove(value, dynamic_cast<Node<Type>*>(&back), true); |
41 |
+ |
} |
42 |
+ |
|
43 |
+ |
template<typename Type> |
44 |
+ |
void DoublyLinkedList<Type>::removeLast(const Type& value) |
45 |
+ |
{ |
46 |
+ |
back.remove(value, dynamic_cast<Node<Type>*>(&front), false); |
47 |
+ |
} |
48 |
+ |
|
49 |
+ |
template<typename Type> |
50 |
+ |
void DoublyLinkedList<Type>::accept(Visitor<Type>* visitor) |
51 |
+ |
{ |
52 |
+ |
front.accept(visitor, dynamic_cast<Node<Type>*>(&back), true); |
53 |
+ |
} |
54 |
+ |
|
55 |
|
#endif // _DoublyLinkedList_hpp_ |