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
107
108
109
110
111
112
113
114
115
116
117
118
119
|
#include "SelectedNodeList.h"
const scene::INodePtr& SelectedNodeList::ultimate() {
if (size() == 0) {
return end()->first; // return invalid iterator
}
std::size_t latestTime(0);
iterator latest;
for (iterator i = begin(); i != end(); i++) {
if (i->second > latestTime) {
latestTime = i->second;
latest = i;
}
}
return latest->first;
}
const scene::INodePtr& SelectedNodeList::ultimate() const {
if (size() == 0) {
return end()->first; // return invalid iterator
}
std::size_t latestTime(0);
const_iterator latest;
for (const_iterator i = begin(); i != end(); i++) {
if (i->second > latestTime) {
latestTime = i->second;
latest = i;
}
}
return latest->first;
}
const scene::INodePtr& SelectedNodeList::penultimate() const {
if (size() <= 1) {
return end()->first; // return invalid iterator
}
std::size_t ultimateTime(0);
std::size_t penUltimateTime(0);
const_iterator ultimate;
const_iterator penUltimate;
for (const_iterator i = begin(); i != end(); i++) {
if (i->second > ultimateTime) {
penUltimateTime = ultimateTime;
penUltimate = ultimate;
ultimateTime = i->second;
ultimate = i;
}
else if (i->second > penUltimateTime) {
penUltimateTime = i->second;
penUltimate = i;
}
}
return penUltimate->first;
}
const scene::INodePtr& SelectedNodeList::penultimate() {
if (size() <= 1) {
return end()->first; // return invalid iterator
}
std::size_t ultimateTime(0);
std::size_t penUltimateTime(0);
iterator ultimate;
iterator penUltimate;
for (iterator i = begin(); i != end(); i++) {
if (i->second > ultimateTime) {
penUltimateTime = ultimateTime;
penUltimate = ultimate;
ultimateTime = i->second;
ultimate = i;
}
else if (i->second > penUltimateTime) {
penUltimateTime = i->second;
penUltimate = i;
}
}
return penUltimate->first;
}
void SelectedNodeList::append(const scene::INodePtr& selected) {
time++;
MapType::insert(value_type(selected, time));
}
void SelectedNodeList::erase(const scene::INodePtr& selected) {
iterator last;
std::size_t lastTime(0);
// Lookup the instance selected last
for (iterator it = MapType::find(selected);
it != upper_bound(selected) && it != end();
it++)
{
if (it->second > lastTime) {
last = it;
lastTime = it->second;
}
}
assert(last != end());
// Remove the element selected last, leave the others
MapType::erase(last);
}
std::size_t SelectedNodeList::time = 1;
|
