Method UpdateNode

Modules/RESTAPI/src/mitkDataStorageBridge.cpp:709–778

  }

  bool DataStorageBridge::UpdateNode(const std::string& uid, const Json& updates)
  {
    std::lock_guard<std::mutex> lock(m_Mutex);
    return this->DispatchTask<bool>([this, uid, updates]()
    {
      auto dataStorage = m_DataStorage.Lock();
      if (dataStorage.IsNull())
      {
        return false;
      }

      mitk::DataNode::Pointer node = m_UidMapper->FindNodeByUid(uid);
      if (node == nullptr)
      {
        return false;
      }

      // Handle parent_uid for reparenting
      if (!updates.contains("parent_uid"))
      {
        return false;
      }

      DataNode::Pointer newParent;
      if (!updates["parent_uid"].is_null())
      {
        std::string newParentUid = updates["parent_uid"].get<std::string>();
        newParent = m_UidMapper->FindNodeByUid(newParentUid);
      }

      if (newParent == node)
      { // Prevent circular references: new parent cannot be the node itself or a descendant
        return false;
      }

      // Check if newParent is a descendant of node
      auto descendants = dataStorage->GetDerivations(node, nullptr, true);
      for (auto it = descendants->Begin(); it != descendants->End(); ++it)
      {
        if (it->Value() == newParent)
        {
          return false;  // Would create circular reference
        }
      }

      // Reparent: remove and re-add under new parent
      // This is the same approach used by QmitkDataStorageTreeModel
      //
      // Important: Preserve the UID across reparenting operation.
      // The NodeUidMapper clears mappings when a node is removed from DataStorage,
      // so we save the UID and restore the mapping after re-adding.
      const std::string preservedUid = uid;

      dataStorage->Remove(node);
      if (newParent != nullptr)
      {
        dataStorage->Add(node, newParent);
      }