Go to the documentation of this file. 1 #ifndef __sLinkListIncluded
2 #define __sLinkListIncluded
5 #include <initializer_list>
98 sLinkList(
const std::initializer_list<T> &il);
105 virtual void clear();
106 virtual int length()
const;
107 virtual void insert(
int i,
const T &obj);
108 virtual void remove(
int i);
109 virtual int search(
const T &obj)
const;
110 virtual T
visit(
int i)
const;
112 void erase(
const T &lb,
const T &rb);
119 virtual iterator
end() =
delete;
120 virtual const_iterator
end()
const =
delete;
141 for (
int k = 0; k <= i; ++k)
150 return currentLength;
172 node *pre = move(i - 1);
180 node *pre = move(i - 1);
197 if (ptr->
data == obj)
210 return move(i)->data;
221 std::cout << ptr->
data <<
' ';
224 std::cout << std::endl;
250 head->
next =
nullptr;
268 for (
int i = 0; i < k; ++i)
283 std::cout <<
"The " << k <<
"-th last element is " << p->
data << std::endl;
virtual bool operator!=(const const_iterator &rhs) const
virtual iterator end()=delete
virtual const T & operator*() const
const_iterator operator++(int)
virtual const T & operator*() const
node(const T &obj=T(), node *next=nullptr)
virtual T visit(int i) const
virtual void insert(int i, const T &obj)
void erase(const T &lb, const T &rb)
virtual const_iterator begin() const
virtual void traverse() const
virtual bool operator==(const const_iterator &rhs) const
virtual int search(const T &obj) const
virtual int length() const
virtual void remove(int i)
virtual const_iterator & operator++()