Ⅰ. list的用法
1. list对象的创建(构造)
函数名称 | 功能介绍 |
---|
list(n,val) | 使用n个val构造一个list |
list(list) | 使用list拷贝一个list |
void test_list1()
{
list<int> lt1(4, 7);
list<int> lt2(lt1);
}
2. list的销毁(析构)
3. list的遍历
第一种: 迭代器
void test_list2()
{
list<int> lt(4, 7);
list<int>::iterator it = lt.begin();
while (it != lt.end())
{
cout << *it << " ";
it++;
}
}
第二种: 范围for
void test_list2()
{
list<int> lt(4, 7);
for (int e : lt)
{
cout << e << ' ';
}
}
4. list的增
函数名称 | 功能介绍 |
---|
push_front(val) | 头插一个val |
push_back(val) | 尾插一个val |
insert(pos,val) | 向迭代器为pos的位置插入一个val |
void test_list3()
{
list<int> lt(4, 7);
lt.push_back(8);
}
void test_list3()
{
list<int> lt(4, 7);
lt.push_front(6);
}
void test_list3()
{
list<int> lt(4, 7);
list<int>::iterator it = lt.begin();
lt.insert(++it, 70);
}
5. list的删
函数名称 | 功能介绍 |
---|
pop_front() | 头删 |
pop_back() | 尾删 |
clear() | 清空list |
erase(pos) | 删除迭代器为pos位置的值,并返回该位置下一位置的迭代器 |
void test_list4()
{
list<int> lt;
lt.push_back(1);
lt.push_back(2);
lt.push_back(3);
lt.push_back(4);
lt.pop_front();
}
void test_list4()
{
list<int> lt;
lt.push_back(1);
lt.push_back(2);
lt.push_back(3);
lt.push_back(4);
lt.pop_back();
}
void test_list4()
{
list<int> lt;
lt.push_back(1);
lt.push_back(2);
lt.push_back(3);
lt.push_back(4);
lt.clear();
}
void test_list4()
{
list<int> lt;
lt.push_back(1);
lt.push_back(2);
lt.push_back(3);
lt.push_back(4);
list<int>::iterator it = lt.begin();
lt.erase(++it);
}
6. list的查
- list 中无find()接口,若想实现,其实也很简单,只需将链表遍历一遍即可
7. list的改
void test_list5()
{
list<int> lt;
lt.push_back(1);
lt.push_back(2);
lt.push_back(3);
lt.push_back(4);
lt.assign(4, 7);
}
Ⅱ. list的底层原理
1. 迭代器
template<class T,class Ref,class Ptr>
struct ListIterator
{
typedef ListNode<T> Node;
typedef ListIterator<T, Ref, Ptr> myself;
ListIterator(Node* node)
:_node(node)
{}
Ref operator*()
{
return _node->_data;
}
Ptr operator->()
{
return &(operator*());
}
myself& operator++()
{
_node = _node->_next;
return *this;
}
myself operator++(int)
{
myself tmp = myself(*this);
_node = _node->_next;
return tmp;
}
myself& operator--()
{
_node = _node->_prev;
return *this;
}
myself operator--(int)
{
myself tmp = myself(*this);
_node = _node->_prev;
return tmp;
}
bool operator==(const myself& it)
{
return _node == it._node;
}
bool operator!=(const myself& it)
{
return _node != it._node;
}
Node* _node;
};
2. 适配器的反向迭代器
template<class iterator, class Ref, class Ptr>
struct ReverseIterator
{
typedef ReverseIterator<iterator, Ref, Ptr> myself;
ReverseIterator(iterator it)
:_it(it)
{}
Ref operator*()
{
iterator tmp = _it;
return *(--tmp);
}
Ptr operator->()
{
return &(operator*());
}
myself& operator++()
{
--_it;
return *this;
}
myself& operator--()
{
++_it;
return *this;
}
bool operator==(const myself& it)
{
return _it == it._it;
}
bool operator!=(const myself& it)
{
return _it != it._it;
}
iterator _it;
};
3. 封装list
template<class T>
class list
{
public:
typedef ListNode<T> Node;
typedef ListIterator<T, T&, T*> iterator;
typedef ListIterator<T,const T&,const T*> const_iterator;
typedef ReverseIterator<iterator, T&, T*> reverse_iterator;
typedef ReverseIterator<const_iterator, const T&, const T*> const_reverse_iterator;
iterator begin()
{
return _head->_next;
}
iterator end()
{
return _head;
}
const_iterator begin() const
{
return _head->_next;
}
const_iterator end() const
{
return _head;
}
reverse_iterator rbegin()
{
return end();
}
reverse_iterator rend()
{
return begin();
}
const_reverse_iterator rbegin() const
{
return end();
}
const_reverse_iterator rend() const
{
return begin();
}
void empty_init()
{
_head = new Node();
_head->_next = _head;
_head->_prev = _head;
_size = 0;
}
list()
{
empty_init();
}
list(const list<T>& lt)
{
empty_init();
for (auto& e : lt)
{
push_back(e);
}
}
~list()
{
clear();
delete _head;
_head = nullptr;
}
list<T>& operator=(list<T> lt)
{
swap(lt);
return *this;
}
void swap(list<T>& lt)
{
std::swap(_head, lt._head);
std::swap(_size, lt._size);
}
void insert(iterator pos, const T& x)
{
Node* node = new Node(x);
Node* cur = pos._node;
Node* prev = cur->_prev;
prev->_next = node;
node->_prev = prev;
node->_next = cur;
cur->_prev = node;
_size++;
}
iterator erase(iterator pos)
{
Node* cur = pos._node;
Node* prev = cur->_prev;
Node* next = cur->_next;
prev->_next = next;
next->_prev = prev;
_size--;
return iterator(next);
}
void push_back(const T& x)
{
insert(end(),x);
}
void pop_back()
{
erase(--end());
}
void clear()
{
iterator it = begin();
while (it != end())
{
it = erase(it);
}
_size = 0;
}
bool empty() const
{
return _size == 0;
}
size_t size() const
{
return _size;
}
private:
Node* _head;
size_t _size;
};