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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
|
/****************************************************************************
* Copyright (C) from 2009 to Present EPAM Systems.
*
* This file is part of Indigo toolkit.
*
* 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
*
* 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.
***************************************************************************/
#include "base_cpp/properties_map.h"
using namespace indigo;
IMPL_ERROR(PropertiesMap, "properties map");
void PropertiesMap::copy(RedBlackStringObjMap<Array<char>>& other)
{
clear();
for (int i = other.begin(); i != other.end(); i = other.next(i))
{
insert(other.key(i), other.value(i).ptr());
}
}
void PropertiesMap::copy(PropertiesMap& other)
{
clear();
for (auto p : other.elements())
{
insert(other.key(p), other.value(p));
}
}
void PropertiesMap::insert(const char* key, const char* value)
{
if (_properties.find(key))
{
auto& val = _properties.at(key);
if (value != 0)
val.readString(value, true);
}
else
{
auto& name = _propertyNames.push();
name.readString(key, true);
int k = _properties.insert(key);
if (value != 0)
_properties.value(k).readString(value, true);
}
}
Array<char>& PropertiesMap::insert(const char* key)
{
insert(key, 0);
return valueBuf(key);
}
const char* PropertiesMap::key(int i)
{
return _propertyNames.at(i).ptr();
}
const char* PropertiesMap::value(int i)
{
auto& buf = valueBuf(_propertyNames.at(i).ptr());
if (buf.size() > 0)
{
return buf.ptr();
}
else
{
return "";
}
}
Array<char>& PropertiesMap::valueBuf(const char* key)
{
return _properties.at(key);
}
void PropertiesMap::clear()
{
_properties.clear();
_propertyNames.clear();
}
bool PropertiesMap::contains(const char* key)
{
return _properties.find(key);
}
const char* PropertiesMap::at(const char* key)
{
return _properties.at(key).ptr();
}
void PropertiesMap::remove(const char* key)
{
if (_properties.find(key))
{
_properties.remove(key);
int to_remove = -1;
for (auto i = 0; i < _propertyNames.size(); i++)
{
if (strcmp(_propertyNames.at(i).ptr(), key) == 0)
{
to_remove = i;
break;
}
}
if (to_remove >= 0)
{
_propertyNames.remove(to_remove);
}
else
{
throw Error("internal error with properties");
}
}
}
PropertiesMap::PrAuto PropertiesMap::elements()
{
return PrAuto(*this);
}
PropertiesMap::PrIter::PrIter(PropertiesMap& owner, int idx) : AutoIterator(idx), _owner(owner)
{
}
PropertiesMap::PrIter& PropertiesMap::PrIter::operator++()
{
_idx += 1;
return *this;
}
PropertiesMap::PrIter PropertiesMap::PrAuto::begin()
{
return PropertiesMap::PrIter(_owner, 0);
}
int PropertiesMap::PrAuto::next(int k)
{
return k + 1;
}
PropertiesMap::PrIter PropertiesMap::PrAuto::end()
{
return PropertiesMap::PrIter(_owner, _owner._propertyNames.size());
}
|
