summaryrefslogtreecommitdiffstats
path: root/raul/ListImpl.hpp
diff options
context:
space:
mode:
authorDavid Robillard <d@drobilla.net>2011-05-18 15:52:39 +0000
committerDavid Robillard <d@drobilla.net>2011-05-18 15:52:39 +0000
commit7bd4febfdb799cd359a380d23640654f476dadae (patch)
tree7acf0526548382e3768b45628a47f094120b7724 /raul/ListImpl.hpp
parent3a1a098d7d41468a74862777d3085f537fb6b894 (diff)
downloadraul-7bd4febfdb799cd359a380d23640654f476dadae.tar.gz
raul-7bd4febfdb799cd359a380d23640654f476dadae.tar.bz2
raul-7bd4febfdb799cd359a380d23640654f476dadae.zip
Strip double blank lines.
git-svn-id: http://svn.drobilla.net/lad/trunk/raul@3279 a436a847-0d15-0410-975c-d299462d15a1
Diffstat (limited to 'raul/ListImpl.hpp')
-rw-r--r--raul/ListImpl.hpp30
1 files changed, 0 insertions, 30 deletions
diff --git a/raul/ListImpl.hpp b/raul/ListImpl.hpp
index e4ade03..c5f9fd3 100644
--- a/raul/ListImpl.hpp
+++ b/raul/ListImpl.hpp
@@ -20,14 +20,12 @@
namespace Raul {
-
template <typename T>
List<T>::~List<T>()
{
clear();
}
-
/** Clear the list, deleting all Nodes contained (but NOT their contents!)
*
* Not realtime safe.
@@ -50,7 +48,6 @@ List<T>::clear()
_size = 0;
}
-
/** Add an element to the list.
*
* Thread safe (may be called while another thread is reading the list).
@@ -76,7 +73,6 @@ List<T>::push_back(Node* const ln)
++_size;
}
-
/** Add an element to the list.
*
* Thread safe (may be called while another thread is reading the list).
@@ -104,7 +100,6 @@ List<T>::push_back(T& elem)
++_size;
}
-
/** Append a list to this list.
*
* This operation is fast ( O(1) ).
@@ -148,7 +143,6 @@ List<T>::append(List<T>& list)
list._size = 0;
}
-
/** Find an element in the list.
*
* This will return the first element equal to @a val found in the list.
@@ -164,7 +158,6 @@ List<T>::find(const T& val)
return end();
}
-
/** Remove an element from the list using an iterator.
*
* This function is realtime safe - it is the caller's responsibility to
@@ -205,7 +198,6 @@ List<T>::erase(const iterator iter)
return n;
}
-
template <typename T>
void
List<T>::chop_front(List<T>& front, size_t front_size, Node* front_tail)
@@ -231,7 +223,6 @@ List<T>::chop_front(List<T>& front, size_t front_size, Node* front_tail)
assert((_head.get() && _tail.get()) || (!_head.get() && !_tail.get()));
}
-
//// Iterator stuff ////
template <typename T>
@@ -241,7 +232,6 @@ List<T>::iterator::iterator(List<T>* list)
{
}
-
template <typename T>
T&
List<T>::iterator::operator*()
@@ -250,7 +240,6 @@ List<T>::iterator::operator*()
return _listnode->elem();
}
-
template <typename T>
T*
List<T>::iterator::operator->()
@@ -259,7 +248,6 @@ List<T>::iterator::operator->()
return &_listnode->elem();
}
-
template <typename T>
inline typename List<T>::iterator&
List<T>::iterator::operator++()
@@ -270,7 +258,6 @@ List<T>::iterator::operator++()
return *this;
}
-
template <typename T>
inline bool
List<T>::iterator::operator!=(const iterator& iter) const
@@ -278,7 +265,6 @@ List<T>::iterator::operator!=(const iterator& iter) const
return (_listnode != iter._listnode);
}
-
template <typename T>
inline bool
List<T>::iterator::operator!=(const const_iterator& iter) const
@@ -286,7 +272,6 @@ List<T>::iterator::operator!=(const const_iterator& iter) const
return (_listnode != iter._listnode);
}
-
template <typename T>
inline bool
List<T>::iterator::operator==(const iterator& iter) const
@@ -294,7 +279,6 @@ List<T>::iterator::operator==(const iterator& iter) const
return (_listnode == iter._listnode);
}
-
template <typename T>
inline bool
List<T>::iterator::operator==(const const_iterator& iter) const
@@ -302,7 +286,6 @@ List<T>::iterator::operator==(const const_iterator& iter) const
return (_listnode == iter._listnode);
}
-
template <typename T>
inline typename List<T>::iterator
List<T>::begin()
@@ -314,7 +297,6 @@ List<T>::begin()
return iter;
}
-
template <typename T>
inline const typename List<T>::iterator
List<T>::end() const
@@ -322,11 +304,8 @@ List<T>::end() const
return _end_iter;
}
-
-
/// const_iterator stuff ///
-
template <typename T>
List<T>::const_iterator::const_iterator(const List<T>* const list)
: _list(list),
@@ -334,7 +313,6 @@ List<T>::const_iterator::const_iterator(const List<T>* const list)
{
}
-
template <typename T>
const T&
List<T>::const_iterator::operator*()
@@ -343,7 +321,6 @@ List<T>::const_iterator::operator*()
return _listnode->elem();
}
-
template <typename T>
const T*
List<T>::const_iterator::operator->()
@@ -352,7 +329,6 @@ List<T>::const_iterator::operator->()
return &_listnode->elem();
}
-
template <typename T>
inline typename List<T>::const_iterator&
List<T>::const_iterator::operator++()
@@ -363,7 +339,6 @@ List<T>::const_iterator::operator++()
return *this;
}
-
template <typename T>
inline bool
List<T>::const_iterator::operator!=(const const_iterator& iter) const
@@ -371,7 +346,6 @@ List<T>::const_iterator::operator!=(const const_iterator& iter) const
return (_listnode != iter._listnode);
}
-
template <typename T>
inline bool
List<T>::const_iterator::operator!=(const iterator& iter) const
@@ -379,7 +353,6 @@ List<T>::const_iterator::operator!=(const iterator& iter) const
return (_listnode != iter._listnode);
}
-
template <typename T>
inline bool
List<T>::const_iterator::operator==(const const_iterator& iter) const
@@ -387,7 +360,6 @@ List<T>::const_iterator::operator==(const const_iterator& iter) const
return (_listnode == iter._listnode);
}
-
template <typename T>
inline bool
List<T>::const_iterator::operator==(const iterator& iter) const
@@ -404,8 +376,6 @@ List<T>::begin() const
return iter;
}
-
} // namespace Raul
-
#endif // RAUL_LIST_IMPL_HPP