File: glh_array.h

package info (click to toggle)
openni2 2.2.0.33%2Bdfsg-18
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 22,240 kB
  • sloc: cpp: 111,183; ansic: 35,511; sh: 10,556; python: 1,313; java: 952; makefile: 575; xml: 12
file content (274 lines) | stat: -rw-r--r-- 5,460 bytes parent folder | download | duplicates (36)
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
270
271
272
273
274
/*
    glh - is a platform-indepenedent C++ OpenGL helper library 

    Copyright (c) 2000 Cass Everitt
	Copyright (c) 2000 NVIDIA Corporation
    All rights reserved.

    Redistribution and use in source and binary forms, with or
	without modification, are permitted provided that the following
	conditions are met:

     * Redistributions of source code must retain the above
	   copyright notice, this list of conditions and the following
	   disclaimer.

     * Redistributions in binary form must reproduce the above
	   copyright notice, this list of conditions and the following
	   disclaimer in the documentation and/or other materials
	   provided with the distribution.

     * The names of contributors to this software may not be used
	   to endorse or promote products derived from this software
	   without specific prior written permission. 

       THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
	   ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
	   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
	   FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
	   REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
	   INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
	   BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
	   LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
	   CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
	   LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
	   ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 
	   POSSIBILITY OF SUCH DAMAGE. 

    Cass Everitt - cass@r3.nu
*/

// Simple array template.
// Copyright (c) Cass W. Everitt 1999 
// Copyright (c) NVIDIA 2000

#ifndef _GLH_ARRAY_H_
#define _GLH_ARRAY_H_

namespace glh
{
  //
  // Template for array2
  //

  template <class T> class array2
  {
  public:
	typedef T value_type;

	array2(int width=1, int height=1) 
    {
      w = width;
      h = height;
      data = new T [w * h];
      clear(T());
    }
	
	array2(const array2<T> & t)
    {
      w = h = 0;
      data=0;
      (*this) = t;
    }
	
	// intentionally non-virtual 
	~array2() { delete [] data; }
	
	const array2 & operator = (const array2<T> & t)
    {
      if(w != t.w || h != t.h) set_size(t.w, t.h);
	  int sz = w * h;
      for(int i = 0; i < sz; i++) data[i] = t.data[i];
      return *this;
    }
	

	void set_size(int width, int height)

	{

		if(w == width && h == height) return;

		delete [] data;

		w = width;

		h = height;

		data = new T [w * h];

	}


	T & operator () (int i, int j)
    { return data[i + j * w]; }
	
	const T & operator () (int i, int j) const
    { return data[i + j * w]; }


	int get_width() const { return w; }

	int get_height() const { return h; }
	
	void clear(const T & val) 
    {
      int sz = w * h;
      for(int i = 0; i < sz; i++) data[i] = val;
    }


	void copy(const array2<T> & src, int i_offset = 0, int j_offset = 0,
		      int width = 0, int height = 0)

	{

		int io = i_offset;

		int jo = j_offset;

		if(width == 0) width = src.get_width();

		if(height == 0) height = src.get_height();

		if(io + width > w) return;

		if(jo + height > h) return;

		for(int i=0; i < width; i++)

			for(int j=0; j < height; j++)

				(*this)(io+i, jo+j) = src(i,j);

	}



	T * get_pointer() { return data; }

	const T * get_pointer() const { return data; }
  private:
	
	int w, h;
	T * data;	
  };

	//
	// Template for array3
	//

	template <class T> class array3
	{
	public:
	typedef T value_type;

	array3(int width=1, int height=1, int depth=1) 
	{
		w = width;
		h = height;
		d = depth;
		data = new T [w * h * d];
		clear(T());
	}
	
	array3(const array3<T> & t)
	{
		w = h = d = 0;
		data=0;
		(*this) = t;
	}
	
	// intentionally non-virtual 
	~array3() { delete [] data; }
	
	const array3 & operator = (const array3<T> & t)
	{
		if(w != t.w || h != t.h || d != t.d)
			set_size(t.w, t.h, t.d);
		int sz = w * h * d;
		for(int i = 0; i < sz; i++)
			data[i] = t.data[i];
		return *this;
	}
	

	void set_size(int width, int height, int depth)

	{
		if(w == width && h == height && d == depth)
			return;

		delete [] data;

		w = width;
		h = height;
		d = depth;

		data = new T [w * h * d];
	}


	T & operator () (int i, int j, int k)
	{ return data[i + j * w + k * w * h]; }
	
	const T & operator () (int i, int j, int k) const
	{ return data[i + j * w + k * w * h]; }


	int get_width() const
	{ return w; }

	int get_height() const
	{ return h; }
	
	int get_depth() const
	{ return d; }
	
	void clear(const T & val) 
	{
		int sz = w * h * d;
		for(int i = 0; i < sz; i++)
			data[i] = val;
	}


	void copy(const array3<T> & src,
			int i_offset = 0, int j_offset = 0, int k_offset = 0,
			int width = 0, int height = 0, int depth = 0)
	{

		int io = i_offset;
		int jo = j_offset;
		int ko = k_offset;

		if(width == 0)
			width = src.get_width();
		if(height == 0)
			height = src.get_height();
		if(depth == 0)
			depth = src.get_depth();

		if(io + width > w || jo + height > h || ko + depth > d)
			return;

		for(int i=0; i < width; i++)
			for(int j=0; j < height; j++)
				for(int k=0; k < depth; k++)
					(*this)(io+i, jo+j, ko+k) = src(i,j,k);
	}



	T * get_pointer()
	{ return data; }

	const T * get_pointer() const
	{ return data; }

	private:
	int w, h, d;
	T * data;	
	}; // template <class T> class array3
} // namespace glh
#endif