mllnode<_Tp> *tmp = head;
head = head->next;
if (head == NULL)
- tail = NULL;
+ tail = NULL;
else
- head->prev = NULL;
+ head->prev = NULL;
delete tmp;
_size--;
}
mllnode<_Tp> *tmp = tail;
tail = tail->prev;
if (tail == NULL)
- head = NULL;
+ head = NULL;
else
- tail->next = NULL;
+ tail->next = NULL;
delete tmp;
_size--;
}
if (tail == node) {
tail = node->prev;
} else {
- tail->next->prev = node->prev;
+ node->next->prev = node->prev;
}
mllnode<_Tp> *next = node->next;
delete node;
_size++;
}
+ sllnode<_Tp>* add_front(_Tp val) {
+ sllnode<_Tp> * tmp = new sllnode<_Tp>();
+ tmp->prev = NULL;
+ tmp->next = head;
+ tmp->val = val;
+ if (head == NULL)
+ tail = tmp;
+ else
+ head->prev = tmp;
+ head = tmp;
+ _size++;
+ return tmp;
+ }
+
+ sllnode<_Tp> * add_back(_Tp val) {
+ sllnode<_Tp> * tmp = new sllnode<_Tp>();
+ tmp->prev = tail;
+ tmp->next = NULL;
+ tmp->val = val;
+ if (tail == NULL)
+ head = tmp;
+ else tail->next = tmp;
+ tail = tmp;
+ _size++;
+ return tmp;
+ }
+
void pop_front() {
sllnode<_Tp> *tmp = head;
head = head->next;
if (head == NULL)
- tail = NULL;
+ tail = NULL;
else
- head->prev = NULL;
+ head->prev = NULL;
delete tmp;
_size--;
}
sllnode<_Tp> *tmp = tail;
tail = tail->prev;
if (tail == NULL)
- head = NULL;
+ head = NULL;
else
- tail->next = NULL;
+ tail->next = NULL;
delete tmp;
_size--;
}
_size=0;
}
- void insertAfter(sllnode<_Tp> * node, _Tp val) {
+ sllnode<_Tp> * insertAfter(sllnode<_Tp> * node, _Tp val) {
sllnode<_Tp> *tmp = new sllnode<_Tp>();
tmp->val = val;
tmp->prev = node;
tmp->next->prev = tmp;
}
_size++;
+ return tmp;
}
void insertBefore(sllnode<_Tp> * node, _Tp val) {
if (tail == node) {
tail = node->prev;
} else {
- tail->next->prev = node->prev;
+ node->next->prev = node->prev;
}
sllnode<_Tp> *next = node->next;
}
type back() const {
- return array[size - 1];
+ return array[_size - 1];
}
void resize(uint psize) {