forked from uroni/urbackup_backend
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTable.cpp
147 lines (126 loc) · 2.94 KB
/
Table.cpp
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
/*************************************************************************
* UrBackup - Client/Server backup system
* Copyright (C) 2011-2014 Martin Raiber
*
* 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 3 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, see <http://www.gnu.org/licenses/>.
**************************************************************************/
#include "Table.h"
CRATable::~CRATable()
{
for(size_t i=0;i<tables.size();++i)
{
delete tables[i];
}
}
void CRATable::addObject(std::wstring key, ITable *tab)
{
table_map[key]=tab;
tables.push_back(tab);
}
ITable* CRATable::getObject(size_t n)
{
if( n<tables.size() )
return tables[n];
else
return NULL;
}
ITable* CRATable::getObject(std::wstring str)
{
std::map<std::wstring, ITable*>::iterator iter=table_map.find(str);
if( iter!= table_map.end() )
{
return iter->second;
}
else
return NULL;
}
std::wstring CRATable::getValue()
{
return L"";
}
size_t CRATable::getSize()
{
return tables.size();
}
void CRATable::addString(std::wstring key, std::wstring str)
{
CTablestring *ts=new CTablestring(str);
this->addObject(key, ts);
}
//-------------------------
CTable::~CTable()
{
for(std::map<std::wstring, ITable*>::iterator i=table_map.begin();i!=table_map.end();++i)
{
delete i->second;
}
}
void CTable::addObject(std::wstring key, ITable *tab)
{
table_map[key]=tab;
}
ITable* CTable::getObject(size_t n)
{
return NULL;
}
ITable* CTable::getObject(std::wstring str)
{
std::map<std::wstring, ITable*>::iterator iter=table_map.find(str);
if( iter!= table_map.end() )
{
return iter->second;
}
else
return NULL;
}
std::wstring CTable::getValue()
{
return L"";
}
size_t CTable::getSize()
{
return table_map.size();
}
void CTable::addString(std::wstring key, std::wstring str)
{
CTablestring *ts=new CTablestring(str);
this->addObject(key, ts);
}
//------------------------
CTablestring::CTablestring(std::wstring pStr)
{
str=pStr;
}
void CTablestring::addObject(std::wstring key, ITable *tab)
{
}
ITable* CTablestring::getObject(size_t n)
{
return NULL;
}
ITable* CTablestring::getObject(std::wstring key)
{
return NULL;
}
std::wstring CTablestring::getValue()
{
return str;
}
size_t CTablestring::getSize()
{
return 1;
}
void CTablestring::addString(std::wstring key, std::wstring str)
{
}