| 108 | } |
| 109 | |
| 110 | void QmitkDataStorageTreeModelInternalItem::InsertChild(QmitkDataStorageTreeModelInternalItem *item, int index) |
| 111 | { |
| 112 | std::vector<QmitkDataStorageTreeModelInternalItem *>::iterator it = std::find(m_Children.begin(), m_Children.end(), item); |
| 113 | if (it == m_Children.end()) |
| 114 | { |
| 115 | if (m_Children.size() > 0 && index >= 0 && index < (int)m_Children.size()) |
| 116 | { |
| 117 | it = m_Children.begin(); |
| 118 | std::advance(it, index); |
| 119 | m_Children.insert(it, item); |
| 120 | } |
| 121 | else |
| 122 | m_Children.push_back(item); |
| 123 | |
| 124 | // add parent if necessary |
| 125 | if (item->GetParent() != this) |
| 126 | item->SetParent(this); |
| 127 | } |
| 128 | } |
| 129 | |
| 130 | std::vector<QmitkDataStorageTreeModelInternalItem *> QmitkDataStorageTreeModelInternalItem::GetChildren() const |
| 131 | { |
no test coverage detected