// Replace del_help with the rightmost node in pp bool TreeSetImpl::nodeDel(TreeSetNode *&pp) { if(pp->m_right) { if(nodeDel(pp->m_right)) { return balanceR(pp); } else { return false; } } swapContent(m_deleteHelper,pp); m_deleteHelper = pp; pp = m_deleteHelper->m_left; return true; }
DenseTransitionMatrix<T>& DenseTransitionMatrix<T>::operator=( DenseTransitionMatrix<T> m) { swapContent(m); return *this; }