| 234 | } |
| 235 | |
| 236 | Monitor::TreeNode* |
| 237 | Monitor::MonitorDataStorage::createParticipantNode( |
| 238 | const ProcessKey& pid, |
| 239 | const OpenDDS::DCPS::GUID_t& id, |
| 240 | bool& create |
| 241 | ) |
| 242 | { |
| 243 | if( id == OpenDDS::DCPS::GUID_UNKNOWN) { |
| 244 | return 0; |
| 245 | } |
| 246 | |
| 247 | // Find the parent node, if any. It is ok to not have a parent node |
| 248 | // for cases of out-of-order udpates. We handle that as the updates |
| 249 | // are actually processed. |
| 250 | TreeNode* parent = this->getProcessNode( pid, create); |
| 251 | |
| 252 | // DomainParticipant data. |
| 253 | QList<QVariant> list; |
| 254 | list << QString("DomainParticipant") |
| 255 | << QString( QObject::tr( OpenDDS::DCPS::LogGuid(id).c_str())); |
| 256 | TreeNode* node = new TreeNode( list, parent); |
| 257 | if( parent) { |
| 258 | parent->append( node); |
| 259 | } |
| 260 | |
| 261 | // Install the new node. |
| 262 | this->guidToTreeMap_[ id] = std::make_pair( node->row(), node); |
| 263 | |
| 264 | return node; |
| 265 | } |
| 266 | |
| 267 | Monitor::TreeNode* |
| 268 | Monitor::MonitorDataStorage::getParticipantNode( |
no test coverage detected