| 252 | } |
| 253 | |
| 254 | inline void Node::AssignNode(const Node& rhs) { |
| 255 | if (!m_isValid) |
| 256 | throw InvalidNode(m_invalidKey); |
| 257 | rhs.EnsureNodeExists(); |
| 258 | |
| 259 | if (!m_pNode) { |
| 260 | m_pNode = rhs.m_pNode; |
| 261 | m_pMemory = rhs.m_pMemory; |
| 262 | return; |
| 263 | } |
| 264 | |
| 265 | m_pNode->set_ref(*rhs.m_pNode); |
| 266 | m_pMemory->merge(*rhs.m_pMemory); |
| 267 | m_pNode = rhs.m_pNode; |
| 268 | } |
| 269 | |
| 270 | // size/iterator |
| 271 | inline std::size_t Node::size() const { |
nothing calls this directly
no test coverage detected