DataService.h

Go to the documentation of this file.

// Mantid Repository : https://github.com/mantidproject/mantid
//
// Copyright © 2008 ISIS Rutherford Appleton Laboratory UKRI,
//   NScD Oak Ridge National Laboratory, European Spallation Source,
//   Institut Laue - Langevin & CSNS, Institute of High Energy Physics, CAS
// SPDX - License - Identifier: GPL - 3.0 +
#pragma once
 
//----------------------------------------------------------------------
// Includes
//----------------------------------------------------------------------
#ifndef Q_MOC_RUN
#include <memory>
#endif
#include "MantidKernel/ConfigService.h"
#include "MantidKernel/Exception.h"
#include "MantidKernel/Logger.h"
#include <Poco/Notification.h>
#include <Poco/NotificationCenter.h>
#include <mutex>
 
#ifdef _WIN32
#define strcasecmp _stricmp
#else
#include "Strings.h"
#endif
 
namespace Mantid {
namespace Kernel {
 
enum class DataServiceSort { Sorted, Unsorted };
enum class DataServiceHidden { Auto, Include, Exclude };
 
// Case-insensitive comparison functor for std::map
struct CaseInsensitiveCmp {
  bool operator()(const std::string &lhs, const std::string &rhs) const {
    return strcasecmp(lhs.c_str(), rhs.c_str()) < 0;
  }
};
 
template <typename T> class DLLExport DataService {
private:
  using svcmap = std::map<std::string, std::shared_ptr<T>, CaseInsensitiveCmp>;
  using svc_it = typename svcmap::iterator;
  using svc_constit = typename svcmap::const_iterator;
 
public:
  class NamedObjectNotification : public Poco::Notification {
  public:
    NamedObjectNotification(const std::string &name) : Poco::Notification(), m_name(name) {}
 
    const std::string &objectName() const { return m_name; }
 
  private:
    std::string m_name; 
  };
 
  class DataServiceNotification : public NamedObjectNotification {
  public:
    DataServiceNotification(const std::string &name, const std::shared_ptr<T> &obj)
        : NamedObjectNotification(name), m_object(obj) {}
    const std::shared_ptr<T> &object() const { return m_object; }
 
  private:
    std::shared_ptr<T> m_object; 
  };
 
  class AddNotification : public DataServiceNotification {
  public:
    AddNotification(const std::string &name, const std::shared_ptr<T> &obj)
        : DataServiceNotification(name, obj) {} 
  };
 
  class BeforeReplaceNotification : public DataServiceNotification {
  public:
    BeforeReplaceNotification(const std::string &name, const std::shared_ptr<T> &obj, const std::shared_ptr<T> &newObj)
        : DataServiceNotification(name, obj), m_newObject(newObj), m_oldObject(obj) {}
    const std::shared_ptr<T> &newObject() const { return m_newObject; } 
    const std::shared_ptr<T> &oldObject() const { return m_oldObject; }
 
  private:
    std::shared_ptr<T> m_newObject; 
    std::shared_ptr<T> m_oldObject;
  };
 
  class AfterReplaceNotification : public DataServiceNotification {
  public:
    AfterReplaceNotification(const std::string &name, const std::shared_ptr<T> &newObj)
        : DataServiceNotification(name, newObj) {}
  };
 
  class PreDeleteNotification : public DataServiceNotification {
  public:
    PreDeleteNotification(const std::string &name, const std::shared_ptr<T> &obj)
        : DataServiceNotification(name, obj) {}
  };
 
  class PostDeleteNotification : public NamedObjectNotification {
  public:
    PostDeleteNotification(const std::string &name) : NamedObjectNotification(name) {}
  };
 
  class ClearNotification : public NamedObjectNotification {
  public:
    ClearNotification() : NamedObjectNotification("") {}
  };
  class RenameNotification : public NamedObjectNotification {
  public:
    RenameNotification(const std::string &name, const std::string &newName)
        : NamedObjectNotification(name), m_newName(newName) {}
 
    const std::string &newObjectName() const { return m_newName; }
 
  private:
    std::string m_newName; 
  };
 
  //--------------------------------------------------------------------------
  virtual void add(const std::string &name, const std::shared_ptr<T> &Tobject) {
    checkForEmptyName(name);
    checkForNullPointer(Tobject);
 
    bool success = false;
    {
      // Make DataService access thread-safe
      std::lock_guard<std::recursive_mutex> lock(m_mutex);
      // At the moment, you can't overwrite an object (i.e. pass in a name
      // that's already in the map with a pointer to a different object).
      // Also, there's nothing to stop the same object from being added
      // more than once with different names.
      success = datamap.insert(std::make_pair(name, Tobject)).second;
    }
    if (!success) {
      std::string error = " add : Unable to insert Data Object : '" + name + "'";
      g_log.error(error);
      throw std::runtime_error(error);
    } else {
      g_log.debug() << "Add Data Object " << name << " successful\n";
      notificationCenter.postNotification(new AddNotification(name, Tobject));
    }
  }
 
  //--------------------------------------------------------------------------
  virtual void addOrReplace(const std::string &name, const std::shared_ptr<T> &Tobject) {
    checkForNullPointer(Tobject);
 
    // Make DataService access thread-safe
    std::unique_lock<std::recursive_mutex> lock(m_mutex);
 
    // find if the Tobject already exists
    auto it = datamap.find(name);
    if (it != datamap.end()) {
      lock.unlock();
      g_log.debug("Data Object '" + name + "' replaced in data service.\n");
 
      notificationCenter.postNotification(new BeforeReplaceNotification(name, it->second, Tobject));
 
      lock.lock();
      it->second = Tobject;
      lock.unlock();
 
      notificationCenter.postNotification(new AfterReplaceNotification(name, Tobject));
    } else {
      // Avoid double-locking
      lock.unlock();
      DataService::add(name, Tobject);
    }
  }
 
  //--------------------------------------------------------------------------
  void remove(const std::string &name) {
    // Make DataService access thread-safe
    std::unique_lock<std::recursive_mutex> lock(m_mutex);
 
    auto it = datamap.find(name);
    if (it == datamap.end()) {
      lock.unlock();
      g_log.debug(" remove '" + name + "' cannot be found");
      return;
    }
    // The map is shared across threads so the item is erased from the map
    // before unlocking the mutex and is held in a local stack variable.
    // This protects it from being modified by another thread.
    auto data = std::move(it->second);
    datamap.erase(it);
 
    // Do NOT use "it" iterator after this point. Other threads may modify the
    // map
    lock.unlock();
    notificationCenter.postNotification(new PreDeleteNotification(name, data));
    data.reset(); // DataService now has no references to the object
    g_log.debug("Data Object '" + name + "' deleted from data service.");
    notificationCenter.postNotification(new PostDeleteNotification(name));
  }
 
  //--------------------------------------------------------------------------
  void rename(const std::string &oldName, const std::string &newName) {
    checkForEmptyName(newName);
 
    if (oldName == newName) {
      g_log.warning("Rename: The existing name matches the new name");
      return;
    }
 
    // Make DataService access thread-safe
    std::unique_lock<std::recursive_mutex> lock(m_mutex);
 
    auto existingNameIter = datamap.find(oldName);
    if (existingNameIter == datamap.end()) {
      lock.unlock();
      g_log.warning(" rename '" + oldName + "' cannot be found");
      return;
    }
 
    auto existingNameObject = std::move(existingNameIter->second);
    auto targetNameIter = datamap.find(newName);
 
    // If we are overriding send a notification for observers
    if (targetNameIter != datamap.end()) {
      auto targetNameObject = targetNameIter->second;
      // As we are renaming the existing name turns into the new name
      lock.unlock();
      notificationCenter.postNotification(new BeforeReplaceNotification(newName, targetNameObject, existingNameObject));
      lock.lock();
    }
 
    datamap.erase(existingNameIter);
 
    if (targetNameIter != datamap.end()) {
      targetNameIter->second = std::move(existingNameObject);
      lock.unlock();
      notificationCenter.postNotification(new AfterReplaceNotification(newName, targetNameIter->second));
    } else {
      if (!(datamap.emplace(newName, std::move(existingNameObject)).second)) {
        // should never happen
        lock.unlock();
        std::string error = " add : Unable to insert Data Object : '" + newName + "'";
        g_log.error(error);
        throw std::runtime_error(error);
      } else {
        lock.unlock();
      }
    }
    g_log.debug("Data Object '" + oldName + "' renamed to '" + newName + "'");
    notificationCenter.postNotification(new RenameNotification(oldName, newName));
  }
 
  //--------------------------------------------------------------------------
  void clear() {
    {
      // Make DataService access thread-safe
      std::lock_guard<std::recursive_mutex> lock(m_mutex);
      datamap.clear();
    }
    notificationCenter.postNotification(new ClearNotification());
    g_log.debug() << typeid(this).name() << " cleared.\n";
  }
 
  virtual void shutdown() { clear(); }
 
  //--------------------------------------------------------------------------
  std::shared_ptr<T> retrieve(const std::string &name) const {
    // Make DataService access thread-safe
    std::lock_guard<std::recursive_mutex> _lock(m_mutex);
 
    auto it = datamap.find(name);
    if (it != datamap.end()) {
      return it->second;
    } else {
      throw Kernel::Exception::NotFoundError("Unable to find Data Object type with name '" + name + "': data service ",
                                             name);
    }
  }
 
  bool doAllWsExist(const std::vector<std::string> &listOfNames) {
    return std::all_of(listOfNames.cbegin(), listOfNames.cend(),
                       [this](auto const &name) { return this->doesExist(name); });
  }
 
  bool doesExist(const std::string &name) const {
    // Make DataService access thread-safe
    std::lock_guard<std::recursive_mutex> _lock(m_mutex);
    auto it = datamap.find(name);
    return it != datamap.end();
  }
 
  size_t size() const {
    std::lock_guard<std::recursive_mutex> _lock(m_mutex);
 
    if (showingHiddenObjects()) {
      return datamap.size();
    } else {
      return std::count_if(datamap.cbegin(), datamap.cend(),
                           [](const auto &it) { return !isHiddenDataServiceObject(it.first); });
    }
  }
 
  std::vector<std::string> getObjectNames(DataServiceSort sortState = DataServiceSort::Unsorted,
                                          DataServiceHidden hiddenState = DataServiceHidden::Auto,
                                          const std::string &contain = "") const {
 
    std::vector<std::string> foundNames;
 
    // First test if auto flag is set whether to include hidden
    if (hiddenState == DataServiceHidden::Auto) {
      if (showingHiddenObjects()) {
        hiddenState = DataServiceHidden::Include;
      } else {
        hiddenState = DataServiceHidden::Exclude;
      }
    }
 
    // Use the scoping of an if to handle our lock for duration
    if (hiddenState == DataServiceHidden::Include) {
      // Getting hidden items
      std::lock_guard<std::recursive_mutex> _lock(m_mutex);
      foundNames.reserve(datamap.size());
      for (const auto &item : datamap) {
        if (contain.empty()) {
          foundNames.emplace_back(item.first);
        } else if (item.first.find(contain) != std::string::npos) {
          foundNames.emplace_back(item.first);
        }
      }
      // Lock released at end of scope here
    } else {
      std::lock_guard<std::recursive_mutex> _lock(m_mutex);
      foundNames.reserve(datamap.size());
      for (const auto &item : datamap) {
        if (!isHiddenDataServiceObject(item.first)) {
          // This item is not hidden add it
          if (contain.empty()) {
            foundNames.emplace_back(item.first);
          } else if (item.first.find(contain) != std::string::npos) {
            foundNames.emplace_back(item.first);
          }
        }
      }
      // Lock released at end of scope here
    }
 
    // Now sort if told to
    if (sortState == DataServiceSort::Sorted) {
      std::sort(foundNames.begin(), foundNames.end());
    }
 
    return foundNames;
  }
 
  std::vector<std::shared_ptr<T>> getObjects(DataServiceHidden includeHidden = DataServiceHidden::Auto) const {
    std::lock_guard<std::recursive_mutex> _lock(m_mutex);
 
    const bool alwaysIncludeHidden = includeHidden == DataServiceHidden::Include;
    const bool usingAuto = includeHidden == DataServiceHidden::Auto && showingHiddenObjects();
 
    const bool showingHidden = alwaysIncludeHidden || usingAuto;
 
    std::vector<std::shared_ptr<T>> objects;
    objects.reserve(datamap.size());
    for (const auto &it : datamap) {
      if (showingHidden || !isHiddenDataServiceObject(it.first)) {
        objects.emplace_back(it.second);
      }
    }
    return objects;
  }
 
  inline static std::string prefixToHide() { return "__"; }
 
  inline static bool isHiddenDataServiceObject(const std::string &name) { return name.starts_with(prefixToHide()); }
 
  static bool showingHiddenObjects() {
    auto showingHiddenFlag = ConfigService::Instance().getValue<bool>("MantidOptions.InvisibleWorkspaces");
    return showingHiddenFlag.value_or(false);
  }
 
  Poco::NotificationCenter notificationCenter;
  DataService(const DataService &) = delete;
  DataService &operator=(const DataService &) = delete;
 
protected:
  DataService(const std::string &name) : svcName(name), g_log(svcName) {}
  virtual ~DataService() = default;
 
private:
  void checkForEmptyName(const std::string &name) {
    if (name.empty()) {
      const std::string error = "Add Data Object with empty name";
      g_log.debug() << error << '\n';
      throw std::runtime_error(error);
    }
  }
 
  void checkForNullPointer(const std::shared_ptr<T> &Tobject) {
    if (!Tobject) {
      const std::string error = "Attempt to add empty shared pointer";
      g_log.debug() << error << '\n';
      throw std::runtime_error(error);
    }
  }
 
  const std::string svcName;
  svcmap datamap;
  mutable std::recursive_mutex m_mutex;
  Logger g_log;
}; // End Class Data service
 
} // Namespace Kernel
} // Namespace Mantid