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
|
<html>
<head>
<title>NVIDIA(R) Blast(R) SDK 1.1 Source Reference: sdk/extensions/authoring/source/VHACD/inc/vhacdSArray.h Source File</title>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<LINK HREF="NVIDIA.css" REL="stylesheet" TYPE="text/css">
</head>
<body bgcolor="#FFFFFF">
<div id="header">
<hr class="first">
<img alt="" src="blast_logo.png">
<br>
<center>
<a class="qindex" href="main.html">Main Page</a>
<!-- <a class="qindex" href="hierarchy.html">Class Hierarchy</a> //-->
<a class="qindex" href="annotated.html">Class List</a>
<a class="qindex" href="functions.html">Class Members</a>
</center>
<hr class="second">
</div>
<!-- Generated by Doxygen 1.5.8 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="main.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>User's Guide</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<h1>sdk/extensions/authoring/source/VHACD/inc/vhacdSArray.h</h1><a href="vhacd_s_array_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* Copyright (c) 2011 Khaled Mamou (kmamou at gmail dot com)</span>
<a name="l00002"></a>00002 <span class="comment"> All rights reserved.</span>
<a name="l00003"></a>00003 <span class="comment"> </span>
<a name="l00004"></a>00004 <span class="comment"> </span>
<a name="l00005"></a>00005 <span class="comment"> Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:</span>
<a name="l00006"></a>00006 <span class="comment"> </span>
<a name="l00007"></a>00007 <span class="comment"> 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.</span>
<a name="l00008"></a>00008 <span class="comment"> </span>
<a name="l00009"></a>00009 <span class="comment"> 2. 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.</span>
<a name="l00010"></a>00010 <span class="comment"> </span>
<a name="l00011"></a>00011 <span class="comment"> 3. The names of the contributors may not be used to endorse or promote products derived from this software without specific prior written permission.</span>
<a name="l00012"></a>00012 <span class="comment"> </span>
<a name="l00013"></a>00013 <span class="comment"> 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 COPYRIGHT HOLDER 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.</span>
<a name="l00014"></a>00014 <span class="comment"> */</span>
<a name="l00015"></a>00015 <span class="preprocessor">#pragma once</span>
<a name="l00016"></a>00016 <span class="preprocessor"></span><span class="preprocessor">#ifndef VHACD_SARRAY_H</span>
<a name="l00017"></a>00017 <span class="preprocessor"></span><span class="preprocessor">#define VHACD_SARRAY_H</span>
<a name="l00018"></a>00018 <span class="preprocessor"></span><span class="preprocessor">#include <stdio.h></span>
<a name="l00019"></a>00019 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00020"></a>00020 <span class="preprocessor">#include <string.h></span>
<a name="l00021"></a>00021
<a name="l00022"></a><a class="code" href="vhacd_s_array_8h.html#eec8eb5a000d3e7b5d7c4fcf0bddb0d0">00022</a> <span class="preprocessor">#define SARRAY_DEFAULT_MIN_SIZE 16</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span>
<a name="l00024"></a>00024 <span class="keyword">namespace </span>VHACD {
<a name="l00026"></a>00026 <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keywordtype">size_t</span> N = 64>
<a name="l00027"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html">00027</a> <span class="keyword">class </span><a class="code" href="class_v_h_a_c_d_1_1_s_array.html" title="SArray.">SArray</a> {
<a name="l00028"></a>00028 <span class="keyword">public</span>:
<a name="l00029"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#f0a62725c5f457cc563a865aaaa6d696">00029</a> T& <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#f0a62725c5f457cc563a865aaaa6d696">operator[]</a>(<span class="keywordtype">size_t</span> i)
<a name="l00030"></a>00030 {
<a name="l00031"></a>00031 T* <span class="keyword">const</span> data = <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#427d1ea7c1a4686a63579dede8cfd888">Data</a>();
<a name="l00032"></a>00032 <span class="keywordflow">return</span> data[i];
<a name="l00033"></a>00033 }
<a name="l00034"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#7b08a1a4d74f9af4ae32a5370a9bfd06">00034</a> <span class="keyword">const</span> T& <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#f0a62725c5f457cc563a865aaaa6d696">operator[]</a>(<span class="keywordtype">size_t</span> i)<span class="keyword"> const</span>
<a name="l00035"></a>00035 <span class="keyword"> </span>{
<a name="l00036"></a>00036 <span class="keyword">const</span> T* <span class="keyword">const</span> data = <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#427d1ea7c1a4686a63579dede8cfd888">Data</a>();
<a name="l00037"></a>00037 <span class="keywordflow">return</span> data[i];
<a name="l00038"></a>00038 }
<a name="l00039"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#d72193179c4d43b70d14fb2ea6a11f0a">00039</a> <span class="keywordtype">size_t</span> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#d72193179c4d43b70d14fb2ea6a11f0a">Size</a>()<span class="keyword"> const</span>
<a name="l00040"></a>00040 <span class="keyword"> </span>{
<a name="l00041"></a>00041 <span class="keywordflow">return</span> m_size;
<a name="l00042"></a>00042 }
<a name="l00043"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#427d1ea7c1a4686a63579dede8cfd888">00043</a> T* <span class="keyword">const</span> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#427d1ea7c1a4686a63579dede8cfd888">Data</a>()
<a name="l00044"></a>00044 {
<a name="l00045"></a>00045 <span class="keywordflow">return</span> (m_maxSize == N) ? m_data0 : m_data;
<a name="l00046"></a>00046 }
<a name="l00047"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#868ce3a41c2db6a535a551f59943eac1">00047</a> <span class="keyword">const</span> T* <span class="keyword">const</span> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#427d1ea7c1a4686a63579dede8cfd888">Data</a>()<span class="keyword"> const</span>
<a name="l00048"></a>00048 <span class="keyword"> </span>{
<a name="l00049"></a>00049 <span class="keywordflow">return</span> (m_maxSize == N) ? m_data0 : m_data;
<a name="l00050"></a>00050 }
<a name="l00051"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#beb520e448c4b4f6b53b001a5fe6f609">00051</a> <span class="keywordtype">void</span> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#beb520e448c4b4f6b53b001a5fe6f609">Clear</a>()
<a name="l00052"></a>00052 {
<a name="l00053"></a>00053 m_size = 0;
<a name="l00054"></a>00054 <span class="keyword">delete</span>[] m_data;
<a name="l00055"></a>00055 m_data = 0;
<a name="l00056"></a>00056 m_maxSize = N;
<a name="l00057"></a>00057 }
<a name="l00058"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#326e224bd11d7717bf01269e28a153fe">00058</a> <span class="keywordtype">void</span> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#326e224bd11d7717bf01269e28a153fe">PopBack</a>()
<a name="l00059"></a>00059 {
<a name="l00060"></a>00060 --m_size;
<a name="l00061"></a>00061 }
<a name="l00062"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#0c04c8ffd6c9e8681a664f71e778f67e">00062</a> <span class="keywordtype">void</span> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#0c04c8ffd6c9e8681a664f71e778f67e">Allocate</a>(<span class="keywordtype">size_t</span> size)
<a name="l00063"></a>00063 {
<a name="l00064"></a>00064 <span class="keywordflow">if</span> (size > m_maxSize) {
<a name="l00065"></a>00065 T* temp = <span class="keyword">new</span> T[size];
<a name="l00066"></a>00066 memcpy(temp, <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#427d1ea7c1a4686a63579dede8cfd888">Data</a>(), m_size * <span class="keyword">sizeof</span>(T));
<a name="l00067"></a>00067 <span class="keyword">delete</span>[] m_data;
<a name="l00068"></a>00068 m_data = temp;
<a name="l00069"></a>00069 m_maxSize = size;
<a name="l00070"></a>00070 }
<a name="l00071"></a>00071 }
<a name="l00072"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#da45d2e351a21b54becd729c1df416cf">00072</a> <span class="keywordtype">void</span> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#da45d2e351a21b54becd729c1df416cf">Resize</a>(<span class="keywordtype">size_t</span> size)
<a name="l00073"></a>00073 {
<a name="l00074"></a>00074 <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#0c04c8ffd6c9e8681a664f71e778f67e">Allocate</a>(size);
<a name="l00075"></a>00075 m_size = size;
<a name="l00076"></a>00076 }
<a name="l00077"></a>00077
<a name="l00078"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#5dee93011225ab51bc07149d77791e8a">00078</a> <span class="keywordtype">void</span> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#5dee93011225ab51bc07149d77791e8a">PushBack</a>(<span class="keyword">const</span> T& value)
<a name="l00079"></a>00079 {
<a name="l00080"></a>00080 <span class="keywordflow">if</span> (m_size == m_maxSize) {
<a name="l00081"></a>00081 <span class="keywordtype">size_t</span> maxSize = (m_maxSize << 1);
<a name="l00082"></a>00082 T* temp = <span class="keyword">new</span> T[maxSize];
<a name="l00083"></a>00083 memcpy(temp, <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#427d1ea7c1a4686a63579dede8cfd888">Data</a>(), m_maxSize * <span class="keyword">sizeof</span>(T));
<a name="l00084"></a>00084 <span class="keyword">delete</span>[] m_data;
<a name="l00085"></a>00085 m_data = temp;
<a name="l00086"></a>00086 m_maxSize = maxSize;
<a name="l00087"></a>00087 }
<a name="l00088"></a>00088 T* <span class="keyword">const</span> data = <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#427d1ea7c1a4686a63579dede8cfd888">Data</a>();
<a name="l00089"></a>00089 data[m_size++] = value;
<a name="l00090"></a>00090 }
<a name="l00091"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#d7205f318876d68953133f4b11438668">00091</a> <span class="keywordtype">bool</span> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#d7205f318876d68953133f4b11438668">Find</a>(<span class="keyword">const</span> T& value, <span class="keywordtype">size_t</span>& pos)
<a name="l00092"></a>00092 {
<a name="l00093"></a>00093 T* <span class="keyword">const</span> data = <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#427d1ea7c1a4686a63579dede8cfd888">Data</a>();
<a name="l00094"></a>00094 <span class="keywordflow">for</span> (pos = 0; pos < m_size; ++pos)
<a name="l00095"></a>00095 <span class="keywordflow">if</span> (value == data[pos])
<a name="l00096"></a>00096 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00097"></a>00097 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00098"></a>00098 }
<a name="l00099"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#de7cfa68a615fcee7e68ca51c13f2d70">00099</a> <span class="keywordtype">bool</span> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#de7cfa68a615fcee7e68ca51c13f2d70">Insert</a>(<span class="keyword">const</span> T& value)
<a name="l00100"></a>00100 {
<a name="l00101"></a>00101 <span class="keywordtype">size_t</span> pos;
<a name="l00102"></a>00102 <span class="keywordflow">if</span> (<a class="code" href="class_v_h_a_c_d_1_1_s_array.html#d7205f318876d68953133f4b11438668">Find</a>(value, pos))
<a name="l00103"></a>00103 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00104"></a>00104 <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#5dee93011225ab51bc07149d77791e8a">PushBack</a>(value);
<a name="l00105"></a>00105 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00106"></a>00106 }
<a name="l00107"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#4f40920e5e5f4f42d634be5fd02208d4">00107</a> <span class="keywordtype">bool</span> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#4f40920e5e5f4f42d634be5fd02208d4">Erase</a>(<span class="keyword">const</span> T& value)
<a name="l00108"></a>00108 {
<a name="l00109"></a>00109 <span class="keywordtype">size_t</span> pos;
<a name="l00110"></a>00110 T* <span class="keyword">const</span> data = <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#427d1ea7c1a4686a63579dede8cfd888">Data</a>();
<a name="l00111"></a>00111 <span class="keywordflow">if</span> (<a class="code" href="class_v_h_a_c_d_1_1_s_array.html#d7205f318876d68953133f4b11438668">Find</a>(value, pos)) {
<a name="l00112"></a>00112 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = pos + 1; j < m_size; ++j)
<a name="l00113"></a>00113 data[j - 1] = data[j];
<a name="l00114"></a>00114 --m_size;
<a name="l00115"></a>00115 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00116"></a>00116 }
<a name="l00117"></a>00117 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00118"></a>00118 }
<a name="l00119"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#6c9019d277b1c6273afda04ec0500bc2">00119</a> <span class="keywordtype">void</span> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#6c9019d277b1c6273afda04ec0500bc2">operator=</a>(<span class="keyword">const</span> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html" title="SArray.">SArray</a>& rhs)
<a name="l00120"></a>00120 {
<a name="l00121"></a>00121 <span class="keywordflow">if</span> (m_maxSize < rhs.<a class="code" href="class_v_h_a_c_d_1_1_s_array.html#931fe4f3a4bec04168f6da0b20ea3a05">m_size</a>) {
<a name="l00122"></a>00122 <span class="keyword">delete</span>[] m_data;
<a name="l00123"></a>00123 m_maxSize = rhs.<a class="code" href="class_v_h_a_c_d_1_1_s_array.html#080ae93e9ba4409b757aa1e38b3e4f5c">m_maxSize</a>;
<a name="l00124"></a>00124 m_data = <span class="keyword">new</span> T[m_maxSize];
<a name="l00125"></a>00125 }
<a name="l00126"></a>00126 m_size = rhs.<a class="code" href="class_v_h_a_c_d_1_1_s_array.html#931fe4f3a4bec04168f6da0b20ea3a05">m_size</a>;
<a name="l00127"></a>00127 memcpy(<a class="code" href="class_v_h_a_c_d_1_1_s_array.html#427d1ea7c1a4686a63579dede8cfd888">Data</a>(), rhs.<a class="code" href="class_v_h_a_c_d_1_1_s_array.html#427d1ea7c1a4686a63579dede8cfd888">Data</a>(), m_size * <span class="keyword">sizeof</span>(T));
<a name="l00128"></a>00128 }
<a name="l00129"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#dc93a60bfe19ac9e2245d290278c502a">00129</a> <span class="keywordtype">void</span> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#dc93a60bfe19ac9e2245d290278c502a">Initialize</a>()
<a name="l00130"></a>00130 {
<a name="l00131"></a>00131 m_data = 0;
<a name="l00132"></a>00132 m_size = 0;
<a name="l00133"></a>00133 m_maxSize = N;
<a name="l00134"></a>00134 }
<a name="l00135"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#2bceb265ab8379ece611e65f71bdd015">00135</a> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#52ae77c5ff1302db8a13b37d8a742e90">SArray</a>(<span class="keyword">const</span> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html" title="SArray.">SArray</a>& rhs)
<a name="l00136"></a>00136 {
<a name="l00137"></a>00137 m_data = 0;
<a name="l00138"></a>00138 m_size = 0;
<a name="l00139"></a>00139 m_maxSize = N;
<a name="l00140"></a>00140 *<span class="keyword">this</span> = rhs;
<a name="l00141"></a>00141 }
<a name="l00142"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#52ae77c5ff1302db8a13b37d8a742e90">00142</a> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#52ae77c5ff1302db8a13b37d8a742e90">SArray</a>()
<a name="l00143"></a>00143 {
<a name="l00144"></a>00144 <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#dc93a60bfe19ac9e2245d290278c502a">Initialize</a>();
<a name="l00145"></a>00145 }
<a name="l00146"></a><a class="code" href="class_v_h_a_c_d_1_1_s_array.html#e321b8f3201c1ee9cea29121f3717595">00146</a> <a class="code" href="class_v_h_a_c_d_1_1_s_array.html#e321b8f3201c1ee9cea29121f3717595">~SArray</a>()
<a name="l00147"></a>00147 {
<a name="l00148"></a>00148 <span class="keyword">delete</span>[] m_data;
<a name="l00149"></a>00149 }
<a name="l00150"></a>00150
<a name="l00151"></a>00151 <span class="keyword">private</span>:
<a name="l00152"></a>00152 T m_data0[N];
<a name="l00153"></a>00153 T* m_data;
<a name="l00154"></a>00154 <span class="keywordtype">size_t</span> m_size;
<a name="l00155"></a>00155 <span class="keywordtype">size_t</span> m_maxSize;
<a name="l00156"></a>00156 };
<a name="l00157"></a>00157 }
<a name="l00158"></a>00158 <span class="preprocessor">#endif</span>
</pre></div></div>
<!-- start footer part -->
<div class="footer">
Copyright © 2015-2017 NVIDIA Corporation, 2701 San Tomas Expressway, Santa Clara, CA 95050 U.S.A. All rights reserved. <a href="http://www.nvidia.com ">www.nvidia.com</a>
</div>
</body>
</html>
|