Method AddNodeInternal

Modules/QtWidgets/src/QmitkDataStorageSimpleTreeModel.cpp:312–361

}

void QmitkDataStorageSimpleTreeModel::AddNodeInternal(const mitk::DataNode *node)
{
  auto dataStorage = m_DataStorage.Lock();

  if (node == nullptr || dataStorage.IsNull() || !dataStorage->Exists(node) || m_Root->Find(node) != nullptr)
    return;

  // find out if we have a root node
  TreeItem *parentTreeItem = m_Root;
  QModelIndex index;
  mitk::DataNode *parentDataNode = this->GetParentNode(node);

  if (parentDataNode) // no top level data node
  {
    parentTreeItem = m_Root->Find(parentDataNode); // find the corresponding tree item
    if (!parentTreeItem)
    {
      this->NodeAdded(parentDataNode);
      parentTreeItem = m_Root->Find(parentDataNode);
      if (!parentTreeItem)
        return;
    }

    // get the index of this parent with the help of the grand parent
    index = this->createIndex(parentTreeItem->GetIndex(), 0, parentTreeItem);
  }

  int firstRowWithASiblingBelow = 0;
  int nodeLayer = -1;
  node->GetIntProperty("layer", nodeLayer);
  for (TreeItem *siblingTreeItem : parentTreeItem->GetChildren())
  {
    int siblingLayer = -1;
    if (mitk::DataNode *siblingNode = siblingTreeItem->GetDataNode())
    {
      siblingNode->GetIntProperty("layer", siblingLayer);
    }
    if (nodeLayer > siblingLayer)
    {
      break;
    }
    ++firstRowWithASiblingBelow;
  }
  beginInsertRows(index, firstRowWithASiblingBelow, firstRowWithASiblingBelow);
  auto newNode = new TreeItem(const_cast<mitk::DataNode *>(node));
  parentTreeItem->InsertChild(newNode, firstRowWithASiblingBelow);
  m_TreeItems.push_back(newNode);

  endInsertRows();
}

QModelIndex QmitkDataStorageSimpleTreeModel::IndexFromTreeItem(TreeItem *item) const
{