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
|
/****************************************************************************
* VCGLib o o *
* Visual and Computer Graphics Library o o *
* _ O _ *
* Copyright(C) 2004 \/)\/ *
* Visual Computing Lab /\/| *
* ISTI - Italian National Research Council | *
* \ *
* All rights reserved. *
* *
* 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 (http://www.gnu.org/licenses/gpl.txt) *
* for more details. *
* *
****************************************************************************/
/****************************************************************************
History
$Log: not supported by cvs2svn $
Revision 1.7 2008/05/16 08:48:49 ganovelli
Enable() and Disable() removed. The memory is allocated by the contructor
Revision 1.6 2008/05/15 16:35:17 ganovelli
Start() Stop() removed. Allocation on creation, disallocaiton on distruction
Revision 1.5 2007/02/02 00:01:54 tarini
overloaded operator "[]" (once more) to make it possible to index the temp. structure with an iterator
Revision 1.4 2005/07/11 13:12:34 cignoni
small gcc-related compiling issues (typenames,ending cr, initialization order)
Revision 1.3 2004/12/11 15:37:47 ganovelli
added one more [], now it is polymorphic, added typenames
Revision 1.2 2004/03/31 22:36:44 ganovelli
First Working Release (with this comment)
****************************************************************************/
#ifndef __VCGLIB_SIMPLE__
#define __VCGLIB_SIMPLE__
#include <limits>
#include <vector>
#include <cstring>
namespace vcg {
class SimpleTempDataBase{
public:
virtual ~SimpleTempDataBase() {}
SimpleTempDataBase() {}
virtual void Resize(const int & sz) = 0;
virtual void Reorder(std::vector<size_t> & newVertIndex)=0;
virtual int SizeOf() const = 0;
virtual void * DataBegin() = 0;
virtual void * At(unsigned int i ) = 0;
};
template <class TYPE>
class VectorNBW: public std::vector<TYPE> {};
template <>
class VectorNBW<bool>{
public:
VectorNBW():data(0),datasize(0),datareserve(0){}
bool * data ;
void reserve (const int & sz) {
if(sz<=datareserve) return;
bool * newdataLoc = new bool[ sz ];
if(datasize!=0) memcpy(newdataLoc,data,sizeof(datasize));
std::swap(data,newdataLoc);
if(newdataLoc != 0) delete newdataLoc;
datareserve = sz;
}
void resize (const int & sz) {
int oldDatasize = datasize;
if(sz <= oldDatasize) return;
if(sz > datareserve)
reserve(sz);
datasize = sz;
memset(&data[oldDatasize],0,datasize-oldDatasize);
}
void push_back(const bool & v) { resize(datasize+1); data[datasize] = v;}
void clear(){ datasize = 0;}
unsigned int size() const { return datasize;}
bool empty() const {return datasize==0;}
bool * begin() const {return data;}
bool & operator [](const int & i){return data[i];}
private:
int datasize;
int datareserve;
};
template <class STL_CONT, class ATTR_TYPE>
class SimpleTempData:public SimpleTempDataBase{
public:
typedef SimpleTempData<STL_CONT,ATTR_TYPE> SimpTempDataType;
typedef ATTR_TYPE AttrType;
STL_CONT& c;
VectorNBW<ATTR_TYPE> data;
int padding;
SimpleTempData(STL_CONT &_c):c(_c),padding(0){data.reserve(c.capacity());data.resize(c.size());};
SimpleTempData(STL_CONT &_c, const ATTR_TYPE &val):c(_c){
data.reserve(c.capacity());data.resize(c.size());
Init(val);
};
~SimpleTempData(){data.clear();}
void Init(const ATTR_TYPE &val)
{
std::fill(data.begin(),data.end(),val);
}
// access to data
ATTR_TYPE & operator[](const typename STL_CONT::value_type & v){return data[&v-&*c.begin()];}
ATTR_TYPE & operator[](const typename STL_CONT::value_type * v){return data[v-&*c.begin()];}
ATTR_TYPE & operator[](const typename STL_CONT::iterator & cont){return data[&(*cont)-&*c.begin()];}
ATTR_TYPE & operator[](const int & i){return data[i];}
void * At(unsigned int i ) {return &(*this)[i];};
// update temporary data size
bool UpdateSize(){
if(data.size() != c.size())
{
data.resize(c.size());
return false;
}
return true;
}
void Resize(const int & sz){
data.resize(sz);
}
void Reorder(std::vector<size_t> & newVertIndex){
for(unsigned int i = 0 ; i < data.size(); ++i){
if( newVertIndex[i] != (std::numeric_limits<size_t>::max)())
data[newVertIndex[i]] = data[i];
}
}
int SizeOf() const {return sizeof(ATTR_TYPE);}
void * DataBegin() {return data.empty()?NULL:&(*data.begin());}
};
template <class ATTR_TYPE>
class Attribute: public SimpleTempDataBase {
public:
typedef ATTR_TYPE AttrType;
AttrType * attribute;
Attribute(){attribute = new ATTR_TYPE();}
~Attribute(){delete attribute;}
int SizeOf()const {return sizeof(ATTR_TYPE);}
void * DataBegin(){return attribute;}
void Resize(const int & ) {assert(0);}
void Reorder(std::vector<size_t> & ){assert(0);}
void * At(unsigned int ) {assert(0);return (void*)0;}
};
} // end namespace vcg
#endif
|
