| 639 | } |
| 640 | |
| 641 | void QmitkDataStorageTreeModel::AddNode(const mitk::DataNode *node) |
| 642 | { |
| 643 | auto dataStorage = m_DataStorage.Lock(); |
| 644 | |
| 645 | if (node == nullptr || m_BlockDataStorageEvents || dataStorage.IsNull() || !dataStorage->Exists(node) || |
| 646 | m_Root->Find(node) != nullptr) |
| 647 | return; |
| 648 | |
| 649 | this->AddNodeInternal(node); |
| 650 | } |
| 651 | |
| 652 | void QmitkDataStorageTreeModel::SetPlaceNewNodesOnTop(bool _PlaceNewNodesOnTop) |
| 653 | { |
no test coverage detected