#include <QmitkDataStorageTreeModelInternalItem.h>
Helper class to represent a tree structure of DataNodes
Definition at line 26 of file QmitkDataStorageTreeModelInternalItem.h.
◆ QmitkDataStorageTreeModelInternalItem()
◆ ~QmitkDataStorageTreeModelInternalItem()
| virtual QmitkDataStorageTreeModelInternalItem::~QmitkDataStorageTreeModelInternalItem |
( |
| ) |
|
|
virtual |
Removes itself as child from its parent-> Does not delete its children
- See also
- Delete()
◆ AddChild()
add another item as a child of this (only if not already in that list)
◆ Delete()
| void QmitkDataStorageTreeModelInternalItem::Delete |
( |
| ) |
|
Deletes the whole tree branch
◆ Find()
◆ GetChild()
- Returns
- The child at pos index or 0 if it not exists
◆ GetChildCount()
| int QmitkDataStorageTreeModelInternalItem::GetChildCount |
( |
| ) |
const |
Get the amount of children
◆ GetChildren()
Get all children as vector
◆ GetDataNode()
| mitk::DataNode::Pointer QmitkDataStorageTreeModelInternalItem::GetDataNode |
( |
| ) |
const |
Return the DataNode associated with this node
◆ GetIndex()
| int QmitkDataStorageTreeModelInternalItem::GetIndex |
( |
| ) |
const |
- Returns
- the index of this node in its parent list
◆ GetParent()
- Returns
- the parent of this tree item
◆ IndexOfChild()
Find the index of an item
◆ InsertChild()
inserts a child at the given position. if pos is not in range the element is added at the end
◆ RemoveChild()
remove another item as child from this
◆ SetParent()
◆ m_Children
◆ m_DataNode
◆ m_Parent
The documentation for this class was generated from the following file: