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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
|
// Cyphesis Online RPG Server and AI Engine
// Copyright (C) 2007 Alistair Riddoch
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software Foundation,
// Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
#include "TypeNode.h"
#include "debug.h"
#include "Property.h"
#include "PropertyManager.h"
#include <set>
static const bool debug_flag = false;
using Atlas::Message::MapType;
TypeNode::TypeNode(const std::string & name) : m_name(name), m_parent(0)
{
}
TypeNode::TypeNode(const std::string & name,
const Atlas::Objects::Root & d) : m_name(name),
m_description(d),
m_parent(0)
{
}
TypeNode::~TypeNode()
{
PropertyDict::const_iterator I = m_defaults.begin();
PropertyDict::const_iterator Iend = m_defaults.end();
for (; I != Iend; ++I) {
delete I->second;
}
}
void TypeNode::addProperty(const std::string & name,
PropertyBase * p)
{
m_defaults[name] = p;
}
void TypeNode::addProperties(const MapType & attributes)
{
MapType::const_iterator J = attributes.begin();
MapType::const_iterator Jend = attributes.end();
PropertyBase * p;
for (; J != Jend; ++J) {
p = PropertyManager::instance()->addProperty(J->first,
J->second.getType());
assert(p != 0);
p->set(J->second);
p->setFlags(flag_class);
m_defaults[J->first] = p;
}
}
void TypeNode::updateProperties(const MapType & attributes)
{
// Discover the default attributes which are no longer
// present after the update.
std::set<std::string> removed_properties;
PropertyDict::const_iterator I = m_defaults.begin();
PropertyDict::const_iterator Iend = m_defaults.end();
MapType::const_iterator Jend = attributes.end();
for (; I != Iend; ++I) {
if (attributes.find(I->first) == Jend) {
debug( std::cout << I->first << " removed" << std::endl; );
removed_properties.insert(I->first);
}
}
// Remove the class properties for the default attributes that
// no longer exist
std::set<std::string>::const_iterator L = removed_properties.begin();
std::set<std::string>::const_iterator Lend = removed_properties.end();
for (; L != Lend; ++L) {
PropertyDict::iterator M = m_defaults.find(*L);
delete M->second;
m_defaults.erase(M);
}
// Update the values of existing class properties, and add new class
// properties for added default attributes.
MapType::const_iterator J = attributes.begin();
PropertyBase * p;
for (; J != Jend; ++J) {
PropertyDict::const_iterator I = m_defaults.find(J->first);
if (I == Iend) {
p = PropertyManager::instance()->addProperty(J->first,
J->second.getType());
assert(p != 0);
p->setFlags(flag_class);
m_defaults[J->first] = p;
} else {
p = I->second;
}
p->set(J->second);
}
}
bool TypeNode::isTypeOf(const std::string & base_type) const
{
const TypeNode * node = this;
do {
if (node->name() == base_type) {
return true;
}
node = node->parent();
} while (node != 0);
return false;
}
bool TypeNode::isTypeOf(const TypeNode * base_type) const
{
const TypeNode * node = this;
do {
if (node == base_type) {
return true;
}
node = node->parent();
} while (node != 0);
return false;
}
|
