void List::insert(T x) {
Node *p = new Node(x, mark);
mark->prev = p;
if (atBegin())
begin = p;
else
p->prev->next = p;
}
void List::remove() {
if (atEnd()) return;
Node *p = mark;
mark->next->prev = mark->prev;
if (atBegin()) begin = mark->next;
else mark->prev->next = mark->next;
mark = mark->next;
delete p;
}
int main()
{
///The metafunction @Metafunction.Iterator@ returns the iterator type for a given container type.
seqan::String<char> str = "admn";
seqan::Iterator<seqan::String<char> >::Type it = begin(str);
seqan::Iterator<seqan::String<char> >::Type itEnd = end(str);
///We can use iterators to iterate over the elements of a container.
while (it != itEnd) {
::std::cout << *it;
++it;
}
::std::cout << ::std::endl;
///Rooted iterators know their container (@Concept.RootedIteratorConcept|Rooted Iterator@).
///Hence, the functions @Function.goBegin@ and @Function.atEnd@ do
///not get $str$ as an argument.
///The following loop increments each character in $str$.
seqan::Iterator<seqan::String<char>, seqan::Rooted >::Type it2 = begin(str);
for (goBegin(it2); !atEnd(it2); goNext(it2))
{
++value(it2);
}
///Some iterators support an iteration in reverse order.
///Note that @Function.goPrevious@ is called before the value of $it2$ is accessed.
///Remember that the end position of a container is always the position behind the last item in the container.
goEnd(it2);
while (!atBegin(it2))
{
goPrevious(it2);
::std::cout << getValue(it2);
}
::std::cout << ::std::endl;
///@Function.assignValue@ can be used to change the value of an iterator.
assignValue(begin(str), 'X');
::std::cout << str << ::std::endl;
return 0;
}
void List::removePrev() {
if (atBegin()) return;
toPrev();
remove();
}
void List::toPrev() {
if (atBegin()) return;
mark = mark->prev;
}
