--- a/wlan_bearer/wlanldd/wlan_common/osa_common/inc/osalist.inl Sun Mar 28 16:41:03 2010 +0100
+++ b/wlan_bearer/wlanldd/wlan_common/osa_common/inc/osalist.inl Thu Apr 08 11:33:33 2010 +0100
@@ -37,7 +37,7 @@
// -----------------------------------------------------------------------------
//
template<class T>
-inline list<T>::iterator list<T>::begin()
+inline typename list<T>::iterator list<T>::begin()
{
// for empty ranges begin() == end()
return ( !(empty()) ? list_iterator<Node, T>( iFirst ) : end() );
@@ -48,7 +48,7 @@
// -----------------------------------------------------------------------------
//
template<class T>
-inline list<T>::const_iterator list<T>::begin() const
+inline typename list<T>::const_iterator list<T>::begin() const
{
// for empty ranges begin() == end()
return ( !(empty()) ? list_iterator<Node, T>( iFirst ) : end() );
@@ -59,7 +59,7 @@
// -----------------------------------------------------------------------------
//
template<class T>
-inline list<T>::iterator list<T>::end()
+inline typename list<T>::iterator list<T>::end()
{
return list_iterator<Node, T>();
}
@@ -69,7 +69,7 @@
// -----------------------------------------------------------------------------
//
template<class T>
-inline list<T>::const_iterator list<T>::end() const
+inline typename list<T>::const_iterator list<T>::end() const
{
return list_iterator<Node, T>();
}
@@ -79,7 +79,7 @@
// -----------------------------------------------------------------------------
//
template<class T>
-inline list<T>::size_type list<T>::size() const
+inline typename list<T>::size_type list<T>::size() const
{
return iNumOfElems;
}
@@ -99,7 +99,7 @@
// -----------------------------------------------------------------------------
//
template<class T>
-inline list<T>::reference list<T>::front()
+inline typename list<T>::reference list<T>::front()
{
// front() for empty sequence is undefined so assert
MWlanOsa::Assert(
@@ -112,7 +112,7 @@
// -----------------------------------------------------------------------------
//
template<class T>
-inline list<T>::const_reference list<T>::front() const
+inline typename list<T>::const_reference list<T>::front() const
{
// front() for empty sequence is undefined so assert
MWlanOsa::Assert(
@@ -125,7 +125,7 @@
// -----------------------------------------------------------------------------
//
template<class T>
-inline list<T>::reference list<T>::back()
+inline typename list<T>::reference list<T>::back()
{
// back() for empty sequence is undefined so assert
MWlanOsa::Assert(
@@ -138,7 +138,7 @@
// -----------------------------------------------------------------------------
//
template<class T>
-inline list<T>::const_reference list<T>::back() const
+inline typename list<T>::const_reference list<T>::back() const
{
// back() for empty sequence is undefined so assert
MWlanOsa::Assert(
@@ -304,7 +304,7 @@
// -----------------------------------------------------------------------------
//
template<class T>
-inline list<T>::iterator list<T>::insert( iterator aPos, const T& aElem )
+inline typename list<T>::iterator list<T>::insert( iterator aPos, const T& aElem )
{
// allocate a new node for the element
Node* node = new Node( aElem );
@@ -355,7 +355,7 @@
// -----------------------------------------------------------------------------
//
template<class T>
-inline list<T>::iterator list<T>::erase( iterator aPos )
+inline typename list<T>::iterator list<T>::erase( iterator aPos )
{
// extract node to be erased
Node* node = aPos();