1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
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
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
95
96
97
98
99
100
101
102
103
104
105
106
|
// Created on: 2017-06-16
// Created by: Natalia ERMOLAEVA
// Copyright (c) 2017 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the GNU Lesser General Public License version 2.1 as published
// by the Free Software Foundation, with special exception defined in the file
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
// distribution for complete text of the license and disclaimer of any warranty.
//
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.
#include <inspector/TreeModel_ItemBase.hxx>
#include <inspector/TreeModel_ItemRole.hxx>
#include <Standard_WarningsDisable.hxx>
#include <QStringList>
#include <Standard_WarningsRestore.hxx>
// =======================================================================
// function : Constructor
// purpose :
// =======================================================================
TreeModel_ItemBase::TreeModel_ItemBase (TreeModel_ItemBasePtr theParent, const int theRow, const int theColumn)
: m_bInitialized (false)
{
m_pParent = theParent;
m_iRow = theRow;
m_iColumn = theColumn;
}
// =======================================================================
// function : reset
// purpose :
// =======================================================================
void TreeModel_ItemBase::Reset()
{
for (PositionToItemHash::const_iterator aChildrenIt = m_ChildItems.begin(); aChildrenIt != m_ChildItems.end(); aChildrenIt++)
{
TreeModel_ItemBasePtr anItem = aChildrenIt.value();
if (anItem)
anItem->Reset();
}
m_bInitialized = false;
myCachedValues.clear();
}
// =======================================================================
// function : Reset
// purpose :
// =======================================================================
void TreeModel_ItemBase::Reset (int theRole)
{
if (!myCachedValues.contains (theRole))
return;
myCachedValues.remove (theRole);
}
// =======================================================================
// function : child
// purpose :
// =======================================================================
TreeModel_ItemBasePtr TreeModel_ItemBase::Child (int theRow, int theColumn, const bool isToCreate)
{
QPair<int, int> aPos = qMakePair (theRow, theColumn);
if (m_ChildItems.contains (aPos))
return m_ChildItems[aPos];
TreeModel_ItemBasePtr anItem;
if (isToCreate) {
anItem = createChild (theRow, theColumn);
if (anItem)
m_ChildItems[aPos] = anItem;
}
return anItem;
}
// =======================================================================
// function : currentItem
// purpose :
// =======================================================================
const TreeModel_ItemBasePtr TreeModel_ItemBase::currentItem()
{
return TreeModel_ItemBasePtr (this);
}
// =======================================================================
// function : cachedValue
// purpose :
// =======================================================================
QVariant TreeModel_ItemBase::cachedValue (const int theItemRole) const
{
if (myCachedValues.contains (theItemRole))
return myCachedValues[theItemRole];
const_cast<TreeModel_ItemBase*>(this)->myCachedValues.insert (theItemRole,
theItemRole == TreeModel_ItemRole_RowCountRole ? QVariant (initRowCount()) : initValue (theItemRole));
return myCachedValues.contains (theItemRole) ? myCachedValues[theItemRole] : QVariant();
}
|
