treeitem.cpp 2.99 KB
Newer Older
schultezub's avatar
schultezub committed
1
2
3
4
// ================================================================================================
// 
// This file is part of the CAMPVis Software Framework.
// 
5
// If not explicitly stated otherwise: Copyright (C) 2012-2014, all rights reserved,
schultezub's avatar
schultezub committed
6
7
//      Christian Schulte zu Berge <christian.szb@in.tum.de>
//      Chair for Computer Aided Medical Procedures
8
9
//      Technische Universitaet Muenchen
//      Boltzmannstr. 3, 85748 Garching b. Muenchen, Germany
10
// 
schultezub's avatar
schultezub committed
11
12
// For a full list of authors and contributors, please refer to the file "AUTHORS.txt".
// 
13
14
15
16
// Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file 
// except in compliance with the License. You may obtain a copy of the License at
// 
// http://www.apache.org/licenses/LICENSE-2.0
schultezub's avatar
schultezub committed
17
// 
18
19
20
21
// Unless required by applicable law or agreed to in writing, software distributed under the 
// License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, 
// either express or implied. See the License for the specific language governing permissions 
// and limitations under the License.
schultezub's avatar
schultezub committed
22
23
24
// 
// ================================================================================================

25
#include "tgt/assert.h"
26
27
#include "treeitem.h"

schultezub's avatar
schultezub committed
28
namespace campvis {
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63

    TreeItem::TreeItem(TreeItem* parent /*= 0*/)
        : _parent(parent)
    {
        if (_parent != 0)
            _parent->_children.append(this);
    }

    TreeItem::~TreeItem() {
        qDeleteAll(_children);
    }

    TreeItem* TreeItem::getParent() {
        return _parent;
    }

    TreeItem* TreeItem::getChild(int row) {
        return _children.value(row);
    }

    int TreeItem::getRow() {
        if (_parent)
            return _parent->_children.indexOf(const_cast<TreeItem*>(this));

        return 0;
    }

    int TreeItem::getChildCount() {
        return _children.count();
    }

    bool TreeItem::setData(int column, int role, const QVariant& value) const {
        return false;
    }

64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
    void TreeItem::insertChild(int row, TreeItem* child) {
        tgtAssert(row < 0 || row > _children.size(), "Row index out of bounds!");

        _children.insert(row, child);
        child->_parent = this;
    }

    void TreeItem::removeChild(int row) {
        tgtAssert(row < 0 || row > _children.size(), "Row index out of bounds!");
        delete _children.takeAt(row);
    }

    void TreeItem::replaceChild(int row, TreeItem* child) {
        tgtAssert(row < getChildCount(), "Row out of bounds!");
        delete _children[row];
        _children[row] = child;
        child->_parent = this;
    }

    void TreeItem::clearChildren() {
        qDeleteAll(_children);
        _children.clear();
    }

    void TreeItem::dumpTree(TreeItem* t, int level /*= 0*/) {
        std::cout << std::string(level, ' ') << t << "\n";
        for (int i = 0; i < t->getChildCount(); ++i) {
            TreeItem::dumpTree(t->getChild(i), level + 1);
        }
    }

95
}