IRegistry * find(const IRegistry *obj) const
Try to find an object identified by its pointer.
RegistryEntry * findLeaf(std::string_view path) const
Find identified leaf in this registry node.
bool isSoft() const
Is the link soft or hard.
Iterator begin() const
Return starting point for container iteration.
RegistryEntry * findLeaf(const DataObject *key) const
Find identified leaf in this registry node.
size_t size() const
Return the size of the container(=number of objects)
std::string m_fullpath
String containing full path of the object (volatile)
std::vector< IRegistry * > Store
Definition of datastore type.
unsigned long addRef() override
IInterface implementation: Dereference the object.
IRegistry * find(std::string_view path) const
Try to find an object identified by its relative name to the directory.
IOpaqueAddress * address() const override
Retrieve opaque storage address.
const Store & leaves() const
Access the leaves of the object.
DataObject * object() const override
Retrive object behind the link.
const std::string & name() const override
Retrieve name of the entry.
bool isEmpty() const
Simple check if the Container is empty.
IRegistry * parent() const
Pointer to parent directory entry.
void setDataSvc(IDataProviderSvc *s)
Set the transient data store.
Iterator end() const
Return end elemtn if the container.
IDataProviderSvc * dataSvc() const override
Retrieve pointer to Transient Store.
const std::string & identifier() const override
Full identifier (or key)
Store::const_iterator Iterator
Iterator definition.
RegistryEntry * parentEntry()
Pointer to parent registry entry.