13 #ifndef mitkDataStorageAccessRule_h
14 #define mitkDataStorageAccessRule_h
16 #include <org_mitk_core_jobs_Export.h>
108 bool CompareTwoAddorRemoveRules()
const ;
119 bool CompareDataStorages(mitk::DataStorage::Pointer otherDataStorage)
const;
125 bool TestDataNode(mitk::DataNode::Pointer dataTreeToBeStored)
const;
130 mitk::DataNode::Pointer GetDataNode()
const;
135 mitk::DataStorage::Pointer GetDataStorage()
const;
142 DataStorage::Pointer m_sptrMyDataStorage ;
143 DataNode::Pointer m_sptrMyDataNode ;
Implements transparent reference counting.
The DataStorageAccessRule inherits from the ISchedulingRule class. DataStorageAccessRule are used to ...
berryObjectMacro(DataStorageAccessRule)
bool IsConflicting(berry::ISchedulingRule::Pointer otherISchedulingRule) const override
bool Contains(berry::ISchedulingRule::Pointer otherISchedulingRule) const override
DataStorageAccessRule(mitk::DataStorage::Pointer myDataStorage, mitk::DataNode::Pointer myDataNode, DataStorageAccessRule::RuleType myRule)
Find image slices visible on a given plane.