template<class T >

stack< T > & csdbg::stack< T >::operator= ( const stack< T > &  rval )

virtual

Assignment operator.

Parameters

[in]

rval

the assigned object

Returns

*this

Exceptions

std::bad_alloc

Note

Automatically resolves collisions when the stacks overlap (when they have nodes with the same data pointer)

Definition at line 211 of file stack.hpp.

References likely, csdbg::stack< T >::m_top, csdbg::stack< T >::node_with(), and unlikely.

{
  if ( unlikely(this == &rval) )
    return *this;

  /* Check if the stacks overlap and detach shared data pointers */
  for (node<T> *n = m_top; likely(n != NULL); n = n->m_link)
    if ( unlikely(rval.node_with(n->m_data) != NULL) )
      n->detach();

  clear();
  for (node<T> *n = rval.m_top; likely(n != NULL); n = n->m_link) {
    T *copy = NULL;
    try {
      copy = new T(*n->m_data);
      push(copy);
    }

    catch (...) {
      delete copy;
      throw;
    }
  }

  return *this;
}

Here is the call graph for this function: