summaryrefslogtreecommitdiffstats
path: root/indexmgr/transdirix.cc
blob: 60129c3d18e6f293d1e25a99c7e0dee3db7b9d2a (plain)
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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
/*
* This file is part of rasdaman community.
*
* Rasdaman community 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.
*
* Rasdaman community 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 rasdaman community.  If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2003, 2004, 2005, 2006, 2007, 2008, 2009 Peter Baumann /
rasdaman GmbH.
*
* For more information please see <http://www.rasdaman.org>
* or contact Peter Baumann via <baumann@rasdaman.com>.
/
/**
 * SOURCE: transdirix.cc
 *
 * MODULE: indexmgr
 * CLASS:	TransDirIx
 *
 *
 * COMMENTS:
 *	none
 *
*/
static const char rcsid[] = "@(#)transdirix, TransDirIx: $Id: transdirix.cc,v 1.17 2002/05/16 16:26:10 coman Exp $";
	
#include <iostream>
#include "indexmgr/keyobject.hh"
#include "indexmgr/transdirix.hh"
#include "raslib/rmdebug.hh"
#include "reladminif/oidif.hh"
#include "tilemgr/tile.hh"

IndexDS*
TransDirIx::getNewInstance() const
	{
	return new TransDirIx(getDimension());
	}

void
TransDirIx::freeDS()
	{
	}

unsigned int
TransDirIx::getOptimalSize() const
	{
	return 1000;
	}

unsigned int	
TransDirIx::getDimension() const
	{
	return currDomain.dimension();
	}

bool	
TransDirIx::isPersistent() const
	{
	return false;
	}

TransDirIx::TransDirIx(r_Dimension dim)
	:       currDomain(dim),
		tiles()
	{
	 RMDBGONCE(2, RMDebug::module_indexif, "TransDirIx", "TransDirIx() " << (r_Ptr)this);	
	}

void
TransDirIx::printStatus(unsigned int level, std::ostream& stream) const
	{ 
	stream << "TransDirIx " << currDomain << endl;
	KeyObjectVector::const_iterator entryIt = tiles.begin();
	
	int i = 0; 
	while (entryIt != tiles.end())
		{
		stream << i << ". " << (*entryIt).getDomain() << endl;
		entryIt++;
		i++;
		}
	}

void 
TransDirIx::insertObject(const KeyObject& newKeyObject, unsigned int pos)
	{
	if (pos < 0 || pos > getSize())
		{
		RMInit::logOut << "TransDirIx::insertObject(" << newKeyObject << ", " << pos << ") pos out of range" << endl;
		throw r_Error(TRANSIENT_INDEX_OUT_OF_BOUNDS);
		} 
	else	{
		if (tiles.size() == 0)
			currDomain = newKeyObject.getDomain();
		else
			currDomain.closure_with(newKeyObject.getDomain());
		tiles.insert(tiles.begin() + pos, newKeyObject);
		}
	}

bool
TransDirIx::removeObject(const KeyObject& tileToRemove)
	{
	bool found = false;
	for (KeyObjectVector::iterator iter = tiles.begin(); iter != tiles.end(); iter++)
		{
		if ((*iter).getTransObject() == tileToRemove.getTransObject())
			{
			found = true;
			tiles.erase(iter);
			break;
			}
		}
	return found;
	}

OId::OIdPrimitive
TransDirIx::getIdentifier() const
	{
	return (OId::OIdPrimitive)(r_Ptr)this;
	}

void
TransDirIx::setAssignedDomain(const r_Minterval& newDomain)
	{
	currDomain = newDomain;
	}


const KeyObject&
TransDirIx::getObject(unsigned int pos) const
	{
	return tiles[pos];
	}

r_Minterval
TransDirIx::getObjectDomain(unsigned int pos) const
	{
	return tiles[pos].getDomain();
	}

void
TransDirIx::getObjects(KeyObjectVector& objs) const
	{	
	objs = tiles;
	}

r_Minterval 
TransDirIx::getCoveredDomain() const
	{
	return currDomain;
	}

unsigned int
TransDirIx::getSize() const
	{
	return tiles.size();
	}

r_Bytes
TransDirIx::getTotalStorageSize() const
	{
	// size of currDomain field:
	r_Bytes sz = currDomain.get_storage_size();
	
	// size of tiles vector
	// even though the size of each entry summed here corresponds to the 
	// KeyObject, it should be added here since it 
	// is "additional data" stored due to the storage structure adopted.
	// For each entry (tile), there is a domain specification, a pointer and 
	// an r_Bytes size field:
	sz += tiles.size() * (currDomain.get_storage_size() + sizeof(KeyObject) + sizeof (r_Bytes));
	
	return sz;
	}

TransDirIx::~TransDirIx()
	{ 
	RMDBGENTER(2, RMDebug::module_indexif, "TransDirIx", "~TransDirIx() " << (r_Ptr)this);
	for (unsigned int i = 0; i < tiles.size(); i++)
		{
		delete tiles[i].getTransObject();
		}
	RMDBGEXIT(2, RMDebug::module_indexif, "TransDirIx", "~TransDirIx() " << (r_Ptr)this);
	}

std::vector< r_Minterval* >*
TransDirIx::getObjectDomains(void) const 
	{
	std::vector< r_Minterval* >* te = new std::vector< r_Minterval* >();
	te->reserve(tiles.size());
	int end = tiles.size();
	for (int i = 0; i < end; i++)
		{
		(*te)[i] = new r_Minterval(tiles[i].getDomain());
		}
	return te;
	}

bool
TransDirIx::isValid() const 
	{
	return true;
	}

bool
TransDirIx::isUnderFull() const
	{
	return false;
	}
	
bool
TransDirIx::isOverFull() const
	{
	return false;
	}
	
bool
TransDirIx::isSameAs(const IndexDS* ix) const 
	{
	if (ix->isPersistent())
		return false;
	else
		if (ix == this)
			return true;
		else
			return false;
	}

void
TransDirIx::setObject(const KeyObject& theKey, unsigned int i) 
	{
	tiles[i] = theKey;
	}

void
TransDirIx::setObjectDomain(const r_Minterval& dom, unsigned int i) 
	{
	tiles[i].setDomain(dom);
	}

r_Minterval
TransDirIx::getAssignedDomain(void) const 
	{
	return currDomain;
	}

bool
TransDirIx::removeObject(unsigned int pos) 
	{
	bool found = false;
	if (pos < tiles.size())
		{
		found = true;
		tiles.erase(tiles.begin() + pos);
		}
	return found;
	}