steven/TinySTL
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

bug fix

Browse Source
This commit is contained in:
邹晓航
2015-01-13 20:28:08 +08:00
parent 4d84582df9
commit 7d0ebc8e8e
1 changed files with 15 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
TinySTL/Detail/List.impl.h
View File

@@ -44,9 +44,14 @@ namespace TinySTL{
template<class T> template<class T>
template<class InputIterator> template<class InputIterator>
void list<T>::insert_aux(iterator position, InputIterator first, InputIterator last, std::false_type){ void list<T>::insert_aux(iterator position, InputIterator first, InputIterator last, std::false_type){
for (; first != last; ++first){ //for (; first != last; ++first){
insert(position, *first); // insert(position, *first);
// position = insert(position, *first);
//}
for (--last; first != last; --last){
position = insert(position, *last);
} }
insert(position, *last);
} }
template<class T> template<class T>
typename list<T>::nodePtr list<T>::newNode(const T& val = T()){ typename list<T>::nodePtr list<T>::newNode(const T& val = T()){
@@ -156,6 +161,14 @@ namespace TinySTL{
} }
template<class T> template<class T>
typename list<T>::iterator list<T>::insert(iterator position, const value_type& val){ typename list<T>::iterator list<T>::insert(iterator position, const value_type& val){
if (position == begin()){
push_front(val);
return begin();
}else if (position == end()){
auto ret = position;
push_back(val);
return ret;
}
auto node = newNode(val); auto node = newNode(val);
auto prev = position.p->prev; auto prev = position.p->prev;
node->next = position.p; node->next = position.p;