<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>Irrlicht Engine: irrArray.h Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<table class="irrlicht" >
<tr valign="middle">
<td><font size="2"><a class="qindex" href="index.html"><font color="#FFFFFF">Home</font></a>
| <a class="qindex" href="namespaces.html"><font color="#FFFFFF">Namespaces</font></a>
| <a class="qindex" href="hierarchy.html"><font color="#FFFFFF">Hierarchy</font></a>
| <a class="qindex" href="classes.html"><font color="#FFFFFF">Alphabetical
List</font></a> | <a class="qindex" href="annotated.html"><font color="#FFFFFF">
Class list</font></a> | <a class="qindex" href="files.html"><font color="#FFFFFF">Files</font></a>
| <a class="qindex" href="namespacemembers.html"><font color="#FFFFFF">
Namespace Members</font></a> | <a class="qindex" href="functions.html"><font color="#FFFFFF">Class
members</font></a> | <a class="qindex" href="globals.html"><font color="#FFFFFF">File
members</font></a> | <a class="qindex" href="pages.html"><font color="#FFFFFF">Tutorials</font></a></font> </td>
</tr>
</table>
<!-- Generated by Doxygen 1.5.6 -->
<h1>irrArray.h</h1><a href="irr_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) 2002-2009 Nikolaus Gebhardt</span>
<a name="l00002"></a>00002 <span class="comment">// This file is part of the "Irrlicht Engine" and the "irrXML" project.</span>
<a name="l00003"></a>00003 <span class="comment">// For conditions of distribution and use, see copyright notice in irrlicht.h and irrXML.h</span>
<a name="l00004"></a>00004
<a name="l00005"></a>00005 <span class="preprocessor">#ifndef __IRR_ARRAY_H_INCLUDED__</span>
<a name="l00006"></a>00006 <span class="preprocessor"></span><span class="preprocessor">#define __IRR_ARRAY_H_INCLUDED__</span>
<a name="l00007"></a>00007 <span class="preprocessor"></span>
<a name="l00008"></a>00008 <span class="preprocessor">#include "<a class="code" href="irr_types_8h.html">irrTypes.h</a>"</span>
<a name="l00009"></a>00009 <span class="preprocessor">#include "<a class="code" href="heapsort_8h.html">heapsort.h</a>"</span>
<a name="l00010"></a>00010 <span class="preprocessor">#include "<a class="code" href="irr_allocator_8h.html">irrAllocator.h</a>"</span>
<a name="l00011"></a>00011
<a name="l00012"></a>00012 <span class="keyword">namespace </span>irr
<a name="l00013"></a>00013 {
<a name="l00014"></a>00014 <span class="keyword">namespace </span>core
<a name="l00015"></a>00015 {
<a name="l00016"></a>00016
<a name="l00018"></a>00018
<a name="l00020"></a>00020 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">typename</span> TAlloc = irrAllocator<T> >
<a name="l00021"></a><a class="code" href="classirr_1_1core_1_1array.html">00021</a> <span class="keyword">class </span><a class="code" href="classirr_1_1core_1_1array.html" title="Self reallocating template array (like stl vector) with additional features.">array</a>
<a name="l00022"></a>00022 {
<a name="l00023"></a>00023
<a name="l00024"></a>00024 <span class="keyword">public</span>:
<a name="l00025"></a>00025
<a name="l00027"></a><a class="code" href="classirr_1_1core_1_1array.html#5e0dd817352068af92448a08716f1252">00027</a> <a class="code" href="classirr_1_1core_1_1array.html#5e0dd817352068af92448a08716f1252" title="Default constructor for empty array.">array</a>()
<a name="l00028"></a>00028 : data(0), allocated(0), used(0),
<a name="l00029"></a>00029 strategy(<a class="code" href="namespaceirr_1_1core.html#a2e91971d5e6e84de235bfabe3c7adba1fa5aed132891361601560ed3e067fe8">ALLOC_STRATEGY_DOUBLE</a>), free_when_destroyed(true), is_sorted(true)
<a name="l00030"></a>00030 {
<a name="l00031"></a>00031 }
<a name="l00032"></a>00032
<a name="l00034"></a>00034
<a name="l00035"></a><a class="code" href="classirr_1_1core_1_1array.html#b58c4b2c09693190b43ee16e99722b43">00035</a> <a class="code" href="classirr_1_1core_1_1array.html#5e0dd817352068af92448a08716f1252" title="Default constructor for empty array.">array</a>(<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> start_count)
<a name="l00036"></a>00036 : data(0), allocated(0), used(0),
<a name="l00037"></a>00037 strategy(<a class="code" href="namespaceirr_1_1core.html#a2e91971d5e6e84de235bfabe3c7adba1fa5aed132891361601560ed3e067fe8">ALLOC_STRATEGY_DOUBLE</a>), free_when_destroyed(true), is_sorted(true)
<a name="l00038"></a>00038 {
<a name="l00039"></a>00039 <a class="code" href="classirr_1_1core_1_1array.html#84e5d8a76ddfeb408168e4beb0d2d5d7" title="Reallocates the array, make it bigger or smaller.">reallocate</a>(start_count);
<a name="l00040"></a>00040 }
<a name="l00041"></a>00041
<a name="l00042"></a>00042
<a name="l00044"></a><a class="code" href="classirr_1_1core_1_1array.html#1a23eef88db0b1e6b0ba15c29eff78e1">00044</a> <a class="code" href="classirr_1_1core_1_1array.html#5e0dd817352068af92448a08716f1252" title="Default constructor for empty array.">array</a>(<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1array.html" title="Self reallocating template array (like stl vector) with additional features.">array<T></a>& other)
<a name="l00045"></a>00045 : data(0)
<a name="l00046"></a>00046 {
<a name="l00047"></a>00047 *<span class="keyword">this</span> = other;
<a name="l00048"></a>00048 }
<a name="l00049"></a>00049
<a name="l00050"></a>00050
<a name="l00051"></a>00051
<a name="l00053"></a>00053
<a name="l00055"></a><a class="code" href="classirr_1_1core_1_1array.html#ac1853f45d4c18feaacac9859efe9836">00055</a> <a class="code" href="classirr_1_1core_1_1array.html#ac1853f45d4c18feaacac9859efe9836" title="Destructor.">~array</a>()
<a name="l00056"></a>00056 {
<a name="l00057"></a>00057 <span class="keywordflow">if</span> (free_when_destroyed)
<a name="l00058"></a>00058 {
<a name="l00059"></a>00059 <span class="keywordflow">for</span> (<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> i=0; i<used; ++i)
<a name="l00060"></a>00060 allocator.destruct(&data[i]);
<a name="l00061"></a>00061
<a name="l00062"></a>00062 allocator.deallocate(data);
<a name="l00063"></a>00063 }
<a name="l00064"></a>00064 }
<a name="l00065"></a>00065
<a name="l00066"></a>00066
<a name="l00068"></a>00068
<a name="l00069"></a><a class="code" href="classirr_1_1core_1_1array.html#84e5d8a76ddfeb408168e4beb0d2d5d7">00069</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1array.html#84e5d8a76ddfeb408168e4beb0d2d5d7" title="Reallocates the array, make it bigger or smaller.">reallocate</a>(<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> new_size)
<a name="l00070"></a>00070 {
<a name="l00071"></a>00071 T* old_data = data;
<a name="l00072"></a>00072
<a name="l00073"></a>00073 data = allocator.allocate(new_size); <span class="comment">//new T[new_size];</span>
<a name="l00074"></a>00074 allocated = new_size;
<a name="l00075"></a>00075
<a name="l00076"></a>00076 <span class="comment">// copy old data</span>
<a name="l00077"></a>00077 <a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a> end = used < new_size ? used : new_size;
<a name="l00078"></a>00078
<a name="l00079"></a>00079 <span class="keywordflow">for</span> (<a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a> i=0; i<end; ++i)
<a name="l00080"></a>00080 {
<a name="l00081"></a>00081 <span class="comment">// data[i] = old_data[i];</span>
<a name="l00082"></a>00082 allocator.construct(&data[i], old_data[i]);
<a name="l00083"></a>00083 }
<a name="l00084"></a>00084
<a name="l00085"></a>00085 <span class="comment">// destruct old data</span>
<a name="l00086"></a>00086 <span class="keywordflow">for</span> (<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> j=0; j<used; ++j)
<a name="l00087"></a>00087 allocator.destruct(&old_data[j]);
<a name="l00088"></a>00088
<a name="l00089"></a>00089 <span class="keywordflow">if</span> (allocated < used)
<a name="l00090"></a>00090 used = allocated;
<a name="l00091"></a>00091
<a name="l00092"></a>00092 allocator.deallocate(old_data); <span class="comment">//delete [] old_data;</span>
<a name="l00093"></a>00093 }
<a name="l00094"></a>00094
<a name="l00095"></a>00095
<a name="l00097"></a>00097
<a name="l00100"></a><a class="code" href="classirr_1_1core_1_1array.html#7aef3e5dbf91f8d1e8f365039e2497ae">00100</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1array.html#7aef3e5dbf91f8d1e8f365039e2497ae" title="set a new allocation strategy">setAllocStrategy</a> ( <a class="code" href="namespaceirr_1_1core.html#a2e91971d5e6e84de235bfabe3c7adba" title="defines an allocation strategy">eAllocStrategy</a> newStrategy = <a class="code" href="namespaceirr_1_1core.html#a2e91971d5e6e84de235bfabe3c7adba1fa5aed132891361601560ed3e067fe8">ALLOC_STRATEGY_DOUBLE</a> )
<a name="l00101"></a>00101 {
<a name="l00102"></a>00102 strategy = newStrategy;
<a name="l00103"></a>00103 }
<a name="l00104"></a>00104
<a name="l00106"></a>00106
<a name="l00108"></a><a class="code" href="classirr_1_1core_1_1array.html#d2c9dff8592b95c25c59f5383fc633fe">00108</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1array.html#d2c9dff8592b95c25c59f5383fc633fe" title="Adds an element at back of array.">push_back</a>(<span class="keyword">const</span> T& element)
<a name="l00109"></a>00109 {
<a name="l00110"></a>00110 <span class="keywordflow">if</span> (used + 1 > allocated)
<a name="l00111"></a>00111 {
<a name="l00112"></a>00112 <span class="comment">// this doesn't work if the element is in the same array. So</span>
<a name="l00113"></a>00113 <span class="comment">// we'll copy the element first to be sure we'll get no data</span>
<a name="l00114"></a>00114 <span class="comment">// corruption</span>
<a name="l00115"></a>00115
<a name="l00116"></a>00116 T e(element);
<a name="l00117"></a>00117 <span class="comment">//reallocate(used * 2 +1); // increase data block</span>
<a name="l00118"></a>00118 <span class="comment">// TA: okt, 2008. it's only allowed to alloc one element, if</span>
<a name="l00119"></a>00119 <span class="comment">// default constructor has to be called</span>
<a name="l00120"></a>00120
<a name="l00121"></a>00121 <span class="comment">// increase data block</span>
<a name="l00122"></a>00122 <a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> newAlloc;
<a name="l00123"></a>00123 <span class="keywordflow">switch</span> ( strategy )
<a name="l00124"></a>00124 {
<a name="l00125"></a>00125 <span class="keywordflow">case</span> <a class="code" href="namespaceirr_1_1core.html#a2e91971d5e6e84de235bfabe3c7adba1fa5aed132891361601560ed3e067fe8">ALLOC_STRATEGY_DOUBLE</a>:
<a name="l00126"></a>00126 newAlloc = used + 1 + (allocated < 500 ?
<a name="l00127"></a>00127 (allocated < 5 ? 5 : used) : used >> 2);
<a name="l00128"></a>00128 <span class="keywordflow">break</span>;
<a name="l00129"></a>00129 <span class="keywordflow">default</span>:
<a name="l00130"></a>00130 <span class="keywordflow">case</span> <a class="code" href="namespaceirr_1_1core.html#a2e91971d5e6e84de235bfabe3c7adbabfc6be96075564e1e0d92477e657f746">ALLOC_STRATEGY_SAFE</a>:
<a name="l00131"></a>00131 newAlloc = used + 1;
<a name="l00132"></a>00132 <span class="keywordflow">break</span>;
<a name="l00133"></a>00133 }
<a name="l00134"></a>00134 <a class="code" href="classirr_1_1core_1_1array.html#84e5d8a76ddfeb408168e4beb0d2d5d7" title="Reallocates the array, make it bigger or smaller.">reallocate</a>( newAlloc);
<a name="l00135"></a>00135 <span class="comment">// construct new element</span>
<a name="l00136"></a>00136 <span class="comment">// Attention!. in missing default constructors for faster alloc methods</span>
<a name="l00137"></a>00137 allocator.construct(&data[used++], e); <span class="comment">// data[used++] = e; // push_back</span>
<a name="l00138"></a>00138 }
<a name="l00139"></a>00139 <span class="keywordflow">else</span>
<a name="l00140"></a>00140 {
<a name="l00141"></a>00141 <span class="comment">//data[used++] = element;</span>
<a name="l00142"></a>00142 <span class="comment">// instead of using this here, we copy it the safe way:</span>
<a name="l00143"></a>00143 allocator.construct(&data[used++], element);
<a name="l00144"></a>00144 }
<a name="l00145"></a>00145
<a name="l00146"></a>00146 is_sorted = <span class="keyword">false</span>;
<a name="l00147"></a>00147 }
<a name="l00148"></a>00148
<a name="l00149"></a>00149
<a name="l00151"></a>00151
<a name="l00155"></a><a class="code" href="classirr_1_1core_1_1array.html#31b686ce4b1ebae930f22bc40d30efbd">00155</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1array.html#31b686ce4b1ebae930f22bc40d30efbd" title="Adds an element at the front of the array.">push_front</a>(<span class="keyword">const</span> T& element)
<a name="l00156"></a>00156 {
<a name="l00157"></a>00157 <a class="code" href="classirr_1_1core_1_1array.html#3b0f73c95dd449a4de576c6b1943566c" title="Insert item into array at specified position.">insert</a>(element);
<a name="l00158"></a>00158 }
<a name="l00159"></a>00159
<a name="l00160"></a>00160
<a name="l00162"></a>00162
<a name="l00167"></a><a class="code" href="classirr_1_1core_1_1array.html#3b0f73c95dd449a4de576c6b1943566c">00167</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1array.html#3b0f73c95dd449a4de576c6b1943566c" title="Insert item into array at specified position.">insert</a>(<span class="keyword">const</span> T& element, <a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> index=0)
<a name="l00168"></a>00168 {
<a name="l00169"></a>00169 <a class="code" href="irr_types_8h.html#12f3b5fd18ca108f90c5c74db602267e" title="define a break macro for debugging.">_IRR_DEBUG_BREAK_IF</a>(index>used) <span class="comment">// access violation</span>
<a name="l00170"></a>00170
<a name="l00171"></a>00171 <span class="keywordflow">if</span> (used + 1 > allocated)
<a name="l00172"></a>00172 <a class="code" href="classirr_1_1core_1_1array.html#84e5d8a76ddfeb408168e4beb0d2d5d7" title="Reallocates the array, make it bigger or smaller.">reallocate</a>(used +1);
<a name="l00173"></a>00173
<a name="l00174"></a>00174 <span class="keywordflow">for</span> (<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> i=used; i>index; --i)
<a name="l00175"></a>00175 {
<a name="l00176"></a>00176 <span class="keywordflow">if</span> (i<used)
<a name="l00177"></a>00177 allocator.destruct(&data[i]);
<a name="l00178"></a>00178 allocator.construct(&data[i], data[i-1]); <span class="comment">// data[i] = data[i-1];</span>
<a name="l00179"></a>00179 }
<a name="l00180"></a>00180
<a name="l00181"></a>00181 <span class="keywordflow">if</span> (used > index)
<a name="l00182"></a>00182 allocator.destruct(&data[index]);
<a name="l00183"></a>00183 allocator.construct(&data[index], element); <span class="comment">// data[index] = element;</span>
<a name="l00184"></a>00184 is_sorted = <span class="keyword">false</span>;
<a name="l00185"></a>00185 ++used;
<a name="l00186"></a>00186 }
<a name="l00187"></a>00187
<a name="l00188"></a>00188
<a name="l00190"></a><a class="code" href="classirr_1_1core_1_1array.html#236e08ca44ddf3c2b47b726f90db8d39">00190</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1array.html#236e08ca44ddf3c2b47b726f90db8d39" title="Clears the array and deletes all allocated memory.">clear</a>()
<a name="l00191"></a>00191 {
<a name="l00192"></a>00192 <span class="keywordflow">for</span> (<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> i=0; i<used; ++i)
<a name="l00193"></a>00193 allocator.destruct(&data[i]);
<a name="l00194"></a>00194
<a name="l00195"></a>00195 allocator.deallocate(data); <span class="comment">// delete [] data;</span>
<a name="l00196"></a>00196 data = 0;
<a name="l00197"></a>00197 used = 0;
<a name="l00198"></a>00198 allocated = 0;
<a name="l00199"></a>00199 is_sorted = <span class="keyword">true</span>;
<a name="l00200"></a>00200 }
<a name="l00201"></a>00201
<a name="l00202"></a>00202
<a name="l00204"></a>00204
<a name="l00206"></a><a class="code" href="classirr_1_1core_1_1array.html#09445c5c7b132fa203847fe65caeb560">00206</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1array.html#09445c5c7b132fa203847fe65caeb560" title="Sets pointer to new array, using this as new workspace.">set_pointer</a>(T* newPointer, <a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> <a class="code" href="classirr_1_1core_1_1array.html#bc592bab637d54799b6c86d6d0e8adf8" title="Get number of occupied elements of the array.">size</a>)
<a name="l00207"></a>00207 {
<a name="l00208"></a>00208 <span class="keywordflow">for</span> (<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> i=0; i<used; ++i)
<a name="l00209"></a>00209 allocator.destruct(&data[i]);
<a name="l00210"></a>00210
<a name="l00211"></a>00211 allocator.deallocate(data); <span class="comment">// delete [] data;</span>
<a name="l00212"></a>00212 data = newPointer;
<a name="l00213"></a>00213 allocated = size;
<a name="l00214"></a>00214 used = size;
<a name="l00215"></a>00215 is_sorted = <span class="keyword">false</span>;
<a name="l00216"></a>00216 }
<a name="l00217"></a>00217
<a name="l00218"></a>00218
<a name="l00220"></a>00220
<a name="l00222"></a><a class="code" href="classirr_1_1core_1_1array.html#fddd43e25d3ad6b1a3d75ceab13e6c56">00222</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1array.html#fddd43e25d3ad6b1a3d75ceab13e6c56" title="Sets if the array should delete the memory it uses upon destruction.">set_free_when_destroyed</a>(<span class="keywordtype">bool</span> f)
<a name="l00223"></a>00223 {
<a name="l00224"></a>00224 free_when_destroyed = f;
<a name="l00225"></a>00225 }
<a name="l00226"></a>00226
<a name="l00227"></a>00227
<a name="l00229"></a>00229
<a name="l00232"></a><a class="code" href="classirr_1_1core_1_1array.html#64d70ab89f03e2ec4deae3b6c0161305">00232</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1array.html#64d70ab89f03e2ec4deae3b6c0161305" title="Sets the size of the array and allocates new elements if necessary.">set_used</a>(<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> usedNow)
<a name="l00233"></a>00233 {
<a name="l00234"></a>00234 <span class="keywordflow">if</span> (allocated < usedNow)
<a name="l00235"></a>00235 <a class="code" href="classirr_1_1core_1_1array.html#84e5d8a76ddfeb408168e4beb0d2d5d7" title="Reallocates the array, make it bigger or smaller.">reallocate</a>(usedNow);
<a name="l00236"></a>00236
<a name="l00237"></a>00237 used = usedNow;
<a name="l00238"></a>00238 }
<a name="l00239"></a>00239
<a name="l00240"></a>00240
<a name="l00242"></a><a class="code" href="classirr_1_1core_1_1array.html#9da7241438af97cf4a8a62a4a136e81c">00242</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1array.html#9da7241438af97cf4a8a62a4a136e81c" title="Assignment operator.">operator=</a>(<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1array.html" title="Self reallocating template array (like stl vector) with additional features.">array<T></a>& other)
<a name="l00243"></a>00243 {
<a name="l00244"></a>00244 strategy = other.<a class="code" href="classirr_1_1core_1_1array.html#7183473cff3c879c85d651746c2e6bcf">strategy</a>;
<a name="l00245"></a>00245
<a name="l00246"></a>00246 <span class="keywordflow">if</span> (data)
<a name="l00247"></a>00247 {
<a name="l00248"></a>00248 <span class="keywordflow">for</span> (<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> i=0; i<used; ++i)
<a name="l00249"></a>00249 allocator.destruct(&data[i]);
<a name="l00250"></a>00250
<a name="l00251"></a>00251 allocator.deallocate(data); <span class="comment">// delete [] data;</span>
<a name="l00252"></a>00252 }
<a name="l00253"></a>00253
<a name="l00254"></a>00254 <span class="comment">//if (allocated < other.allocated)</span>
<a name="l00255"></a>00255 <span class="keywordflow">if</span> (other.<a class="code" href="classirr_1_1core_1_1array.html#f93cd340b534e22ec610acaee07373be">allocated</a> == 0)
<a name="l00256"></a>00256 data = 0;
<a name="l00257"></a>00257 <span class="keywordflow">else</span>
<a name="l00258"></a>00258 data = allocator.allocate(other.<a class="code" href="classirr_1_1core_1_1array.html#f93cd340b534e22ec610acaee07373be">allocated</a>); <span class="comment">// new T[other.allocated];</span>
<a name="l00259"></a>00259
<a name="l00260"></a>00260 used = other.<a class="code" href="classirr_1_1core_1_1array.html#cdb1805e5975543b12b1fd0c22f7ce65">used</a>;
<a name="l00261"></a>00261 free_when_destroyed = other.<a class="code" href="classirr_1_1core_1_1array.html#258af2e429ed216e806ff98efc9c62fc">free_when_destroyed</a>;
<a name="l00262"></a>00262 is_sorted = other.<a class="code" href="classirr_1_1core_1_1array.html#80a506737343ad9a72a398626a176265">is_sorted</a>;
<a name="l00263"></a>00263 allocated = other.<a class="code" href="classirr_1_1core_1_1array.html#f93cd340b534e22ec610acaee07373be">allocated</a>;
<a name="l00264"></a>00264
<a name="l00265"></a>00265 <span class="keywordflow">for</span> (<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> i=0; i<other.<a class="code" href="classirr_1_1core_1_1array.html#cdb1805e5975543b12b1fd0c22f7ce65">used</a>; ++i)
<a name="l00266"></a>00266 allocator.construct(&data[i], other.<a class="code" href="classirr_1_1core_1_1array.html#c10ede53755658ab77c745ff6b4319fa">data</a>[i]); <span class="comment">// data[i] = other.data[i];</span>
<a name="l00267"></a>00267 }
<a name="l00268"></a>00268
<a name="l00269"></a>00269
<a name="l00271"></a><a class="code" href="classirr_1_1core_1_1array.html#d7ea1b7ee5cc2b92e119a62e865e640d">00271</a> <span class="keywordtype">bool</span> <a class="code" href="classirr_1_1core_1_1array.html#d7ea1b7ee5cc2b92e119a62e865e640d" title="Equality operator.">operator == </a>(<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1array.html" title="Self reallocating template array (like stl vector) with additional features.">array<T></a>& other)<span class="keyword"> const</span>
<a name="l00272"></a>00272 <span class="keyword"> </span>{
<a name="l00273"></a>00273 <span class="keywordflow">if</span> (used != other.<a class="code" href="classirr_1_1core_1_1array.html#cdb1805e5975543b12b1fd0c22f7ce65">used</a>)
<a name="l00274"></a>00274 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00275"></a>00275
<a name="l00276"></a>00276 <span class="keywordflow">for</span> (<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> i=0; i<other.<a class="code" href="classirr_1_1core_1_1array.html#cdb1805e5975543b12b1fd0c22f7ce65">used</a>; ++i)
<a name="l00277"></a>00277 <span class="keywordflow">if</span> (data[i] != other[i])
<a name="l00278"></a>00278 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00279"></a>00279 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00280"></a>00280 }
<a name="l00281"></a>00281
<a name="l00283"></a><a class="code" href="classirr_1_1core_1_1array.html#e8ddab362881579a11b43c8bc5fdcd0b">00283</a> <span class="keywordtype">bool</span> <a class="code" href="classirr_1_1core_1_1array.html#e8ddab362881579a11b43c8bc5fdcd0b" title="Inequality operator.">operator != </a>(<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1array.html" title="Self reallocating template array (like stl vector) with additional features.">array<T></a>& other)<span class="keyword"> const</span>
<a name="l00284"></a>00284 <span class="keyword"> </span>{
<a name="l00285"></a>00285 <span class="keywordflow">return</span> !(*<span class="keyword">this</span>==other);
<a name="l00286"></a>00286 }
<a name="l00287"></a>00287
<a name="l00288"></a>00288
<a name="l00290"></a><a class="code" href="classirr_1_1core_1_1array.html#1e09dc5cc93e88fd3a37cad011b3b531">00290</a> T& <a class="code" href="classirr_1_1core_1_1array.html#1e09dc5cc93e88fd3a37cad011b3b531" title="Direct access operator.">operator []</a>(<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> index)
<a name="l00291"></a>00291 {
<a name="l00292"></a>00292 <a class="code" href="irr_types_8h.html#12f3b5fd18ca108f90c5c74db602267e" title="define a break macro for debugging.">_IRR_DEBUG_BREAK_IF</a>(index>=used) <span class="comment">// access violation</span>
<a name="l00293"></a>00293
<a name="l00294"></a>00294 <span class="keywordflow">return</span> data[index];
<a name="l00295"></a>00295 }
<a name="l00296"></a>00296
<a name="l00297"></a>00297
<a name="l00299"></a><a class="code" href="classirr_1_1core_1_1array.html#432981694ff74f416764bfbf71c76b4c">00299</a> <span class="keyword">const</span> T& <a class="code" href="classirr_1_1core_1_1array.html#1e09dc5cc93e88fd3a37cad011b3b531" title="Direct access operator.">operator []</a>(<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> index)<span class="keyword"> const</span>
<a name="l00300"></a>00300 <span class="keyword"> </span>{
<a name="l00301"></a>00301 <a class="code" href="irr_types_8h.html#12f3b5fd18ca108f90c5c74db602267e" title="define a break macro for debugging.">_IRR_DEBUG_BREAK_IF</a>(index>=used) <span class="comment">// access violation</span>
<a name="l00302"></a>00302
<a name="l00303"></a>00303 <span class="keywordflow">return</span> data[index];
<a name="l00304"></a>00304 }
<a name="l00305"></a>00305
<a name="l00306"></a>00306
<a name="l00308"></a><a class="code" href="classirr_1_1core_1_1array.html#d87dc5db8bf6ec1033c945a0d3724e09">00308</a> T& <a class="code" href="classirr_1_1core_1_1array.html#d87dc5db8bf6ec1033c945a0d3724e09" title="Gets last element.">getLast</a>()
<a name="l00309"></a>00309 {
<a name="l00310"></a>00310 <a class="code" href="irr_types_8h.html#12f3b5fd18ca108f90c5c74db602267e" title="define a break macro for debugging.">_IRR_DEBUG_BREAK_IF</a>(!used) <span class="comment">// access violation</span>
<a name="l00311"></a>00311
<a name="l00312"></a>00312 <span class="keywordflow">return</span> data[used-1];
<a name="l00313"></a>00313 }
<a name="l00314"></a>00314
<a name="l00315"></a>00315
<a name="l00317"></a><a class="code" href="classirr_1_1core_1_1array.html#d531932175e210c17429878411490932">00317</a> <span class="keyword">const</span> T& <a class="code" href="classirr_1_1core_1_1array.html#d87dc5db8bf6ec1033c945a0d3724e09" title="Gets last element.">getLast</a>()<span class="keyword"> const</span>
<a name="l00318"></a>00318 <span class="keyword"> </span>{
<a name="l00319"></a>00319 <a class="code" href="irr_types_8h.html#12f3b5fd18ca108f90c5c74db602267e" title="define a break macro for debugging.">_IRR_DEBUG_BREAK_IF</a>(!used) <span class="comment">// access violation</span>
<a name="l00320"></a>00320
<a name="l00321"></a>00321 <span class="keywordflow">return</span> data[used-1];
<a name="l00322"></a>00322 }
<a name="l00323"></a>00323
<a name="l00324"></a>00324
<a name="l00326"></a>00326
<a name="l00327"></a><a class="code" href="classirr_1_1core_1_1array.html#7b29797486e1c2ab3e7821082dab998c">00327</a> T* <a class="code" href="classirr_1_1core_1_1array.html#7b29797486e1c2ab3e7821082dab998c" title="Gets a pointer to the array.">pointer</a>()
<a name="l00328"></a>00328 {
<a name="l00329"></a>00329 <span class="keywordflow">return</span> data;
<a name="l00330"></a>00330 }
<a name="l00331"></a>00331
<a name="l00332"></a>00332
<a name="l00334"></a>00334
<a name="l00335"></a><a class="code" href="classirr_1_1core_1_1array.html#8bf5bc844936a56632038524942f89f1">00335</a> <span class="keyword">const</span> T* <a class="code" href="classirr_1_1core_1_1array.html#8bf5bc844936a56632038524942f89f1" title="Gets a const pointer to the array.">const_pointer</a>()<span class="keyword"> const</span>
<a name="l00336"></a>00336 <span class="keyword"> </span>{
<a name="l00337"></a>00337 <span class="keywordflow">return</span> data;
<a name="l00338"></a>00338 }
<a name="l00339"></a>00339
<a name="l00340"></a>00340
<a name="l00342"></a>00342
<a name="l00343"></a><a class="code" href="classirr_1_1core_1_1array.html#bc592bab637d54799b6c86d6d0e8adf8">00343</a> <a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> <a class="code" href="classirr_1_1core_1_1array.html#bc592bab637d54799b6c86d6d0e8adf8" title="Get number of occupied elements of the array.">size</a>()<span class="keyword"> const</span>
<a name="l00344"></a>00344 <span class="keyword"> </span>{
<a name="l00345"></a>00345 <span class="keywordflow">return</span> used;
<a name="l00346"></a>00346 }
<a name="l00347"></a>00347
<a name="l00348"></a>00348
<a name="l00350"></a>00350
<a name="l00352"></a><a class="code" href="classirr_1_1core_1_1array.html#2a15ea5df83792bce4366969d5b164c4">00352</a> <a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> <a class="code" href="classirr_1_1core_1_1array.html#2a15ea5df83792bce4366969d5b164c4" title="Get amount of memory allocated.">allocated_size</a>()<span class="keyword"> const</span>
<a name="l00353"></a>00353 <span class="keyword"> </span>{
<a name="l00354"></a>00354 <span class="keywordflow">return</span> allocated;
<a name="l00355"></a>00355 }
<a name="l00356"></a>00356
<a name="l00357"></a>00357
<a name="l00359"></a>00359
<a name="l00360"></a><a class="code" href="classirr_1_1core_1_1array.html#1de2f5999968e104bf0ec6f057f097c2">00360</a> <span class="keywordtype">bool</span> <a class="code" href="classirr_1_1core_1_1array.html#1de2f5999968e104bf0ec6f057f097c2" title="Check if array is empty.">empty</a>()<span class="keyword"> const</span>
<a name="l00361"></a>00361 <span class="keyword"> </span>{
<a name="l00362"></a>00362 <span class="keywordflow">return</span> used == 0;
<a name="l00363"></a>00363 }
<a name="l00364"></a>00364
<a name="l00365"></a>00365
<a name="l00367"></a>00367
<a name="l00369"></a><a class="code" href="classirr_1_1core_1_1array.html#870e52dd57dd67a9d59e5ca5f82bca94">00369</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1array.html#870e52dd57dd67a9d59e5ca5f82bca94" title="Sorts the array using heapsort.">sort</a>()
<a name="l00370"></a>00370 {
<a name="l00371"></a>00371 <span class="keywordflow">if</span> (is_sorted || used<2)
<a name="l00372"></a>00372 <span class="keywordflow">return</span>;
<a name="l00373"></a>00373
<a name="l00374"></a>00374 <a class="code" href="namespaceirr_1_1core.html#4f062bd63b7d3048b4af2127e4a708c5" title="Sorts an array with size &#39;size&#39; using heapsort.">heapsort</a>(data, used);
<a name="l00375"></a>00375 is_sorted = <span class="keyword">true</span>;
<a name="l00376"></a>00376 }
<a name="l00377"></a>00377
<a name="l00378"></a>00378
<a name="l00380"></a>00380
<a name="l00386"></a><a class="code" href="classirr_1_1core_1_1array.html#35412f669b983eaaf3792b82966db24a">00386</a> <a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a> <a class="code" href="classirr_1_1core_1_1array.html#35412f669b983eaaf3792b82966db24a" title="Performs a binary search for an element, returns -1 if not found.">binary_search</a>(<span class="keyword">const</span> T& element)
<a name="l00387"></a>00387 {
<a name="l00388"></a>00388 <a class="code" href="classirr_1_1core_1_1array.html#870e52dd57dd67a9d59e5ca5f82bca94" title="Sorts the array using heapsort.">sort</a>();
<a name="l00389"></a>00389 <span class="keywordflow">return</span> <a class="code" href="classirr_1_1core_1_1array.html#35412f669b983eaaf3792b82966db24a" title="Performs a binary search for an element, returns -1 if not found.">binary_search</a>(element, 0, used-1);
<a name="l00390"></a>00390 }
<a name="l00391"></a>00391
<a name="l00392"></a>00392
<a name="l00394"></a>00394
<a name="l00399"></a><a class="code" href="classirr_1_1core_1_1array.html#f9cd0644165ab0d40f97799acd3f2c22">00399</a> <a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a> <a class="code" href="classirr_1_1core_1_1array.html#35412f669b983eaaf3792b82966db24a" title="Performs a binary search for an element, returns -1 if not found.">binary_search</a>(<span class="keyword">const</span> T& element)<span class="keyword"> const</span>
<a name="l00400"></a>00400 <span class="keyword"> </span>{
<a name="l00401"></a>00401 <span class="keywordflow">if</span> (is_sorted)
<a name="l00402"></a>00402 <span class="keywordflow">return</span> <a class="code" href="classirr_1_1core_1_1array.html#35412f669b983eaaf3792b82966db24a" title="Performs a binary search for an element, returns -1 if not found.">binary_search</a>(element, 0, used-1);
<a name="l00403"></a>00403 <span class="keywordflow">else</span>
<a name="l00404"></a>00404 <span class="keywordflow">return</span> <a class="code" href="classirr_1_1core_1_1array.html#06327f3b1a87117a57a617cbb7738beb" title="Finds an element in linear time, which is very slow.">linear_search</a>(element);
<a name="l00405"></a>00405 }
<a name="l00406"></a>00406
<a name="l00407"></a>00407
<a name="l00409"></a>00409
<a name="l00414"></a><a class="code" href="classirr_1_1core_1_1array.html#e2f68111b6899a63454d2956ee58ba6c">00414</a> <a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a> <a class="code" href="classirr_1_1core_1_1array.html#35412f669b983eaaf3792b82966db24a" title="Performs a binary search for an element, returns -1 if not found.">binary_search</a>(<span class="keyword">const</span> T& element, <a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a> left, <a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a> right)<span class="keyword"> const</span>
<a name="l00415"></a>00415 <span class="keyword"> </span>{
<a name="l00416"></a>00416 <span class="keywordflow">if</span> (!used)
<a name="l00417"></a>00417 <span class="keywordflow">return</span> -1;
<a name="l00418"></a>00418
<a name="l00419"></a>00419 <a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a> m;
<a name="l00420"></a>00420
<a name="l00421"></a>00421 <span class="keywordflow">do</span>
<a name="l00422"></a>00422 {
<a name="l00423"></a>00423 m = (left+right)>>1;
<a name="l00424"></a>00424
<a name="l00425"></a>00425 <span class="keywordflow">if</span> (element < data[m])
<a name="l00426"></a>00426 right = m - 1;
<a name="l00427"></a>00427 <span class="keywordflow">else</span>
<a name="l00428"></a>00428 left = m + 1;
<a name="l00429"></a>00429
<a name="l00430"></a>00430 } <span class="keywordflow">while</span>((element < data[m] || data[m] < element) && left<=right);
<a name="l00431"></a>00431 <span class="comment">// this last line equals to:</span>
<a name="l00432"></a>00432 <span class="comment">// " while((element != array[m]) && left<=right);"</span>
<a name="l00433"></a>00433 <span class="comment">// but we only want to use the '<' operator.</span>
<a name="l00434"></a>00434 <span class="comment">// the same in next line, it is "(element == array[m])"</span>
<a name="l00435"></a>00435
<a name="l00436"></a>00436
<a name="l00437"></a>00437 <span class="keywordflow">if</span> (!(element < data[m]) && !(data[m] < element))
<a name="l00438"></a>00438 <span class="keywordflow">return</span> m;
<a name="l00439"></a>00439
<a name="l00440"></a>00440 <span class="keywordflow">return</span> -1;
<a name="l00441"></a>00441 }
<a name="l00442"></a>00442
<a name="l00443"></a>00443
<a name="l00446"></a>00446
<a name="l00452"></a><a class="code" href="classirr_1_1core_1_1array.html#62821cac92125dd76f96f21e60ca94a4">00452</a> <a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a> <a class="code" href="classirr_1_1core_1_1array.html#62821cac92125dd76f96f21e60ca94a4">binary_search_multi</a>(<span class="keyword">const</span> T& element, <a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a> &last)
<a name="l00453"></a>00453 {
<a name="l00454"></a>00454 <a class="code" href="classirr_1_1core_1_1array.html#870e52dd57dd67a9d59e5ca5f82bca94" title="Sorts the array using heapsort.">sort</a>();
<a name="l00455"></a>00455 <a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a> index = <a class="code" href="classirr_1_1core_1_1array.html#35412f669b983eaaf3792b82966db24a" title="Performs a binary search for an element, returns -1 if not found.">binary_search</a>(element, 0, used-1);
<a name="l00456"></a>00456 <span class="keywordflow">if</span> ( index < 0 )
<a name="l00457"></a>00457 <span class="keywordflow">return</span> index;
<a name="l00458"></a>00458
<a name="l00459"></a>00459 <span class="comment">// The search can be somewhere in the middle of the set</span>
<a name="l00460"></a>00460 <span class="comment">// look linear previous and past the index</span>
<a name="l00461"></a>00461 last = index;
<a name="l00462"></a>00462
<a name="l00463"></a>00463 <span class="keywordflow">while</span> ( index > 0 && !(element < data[index - 1]) && !(data[index - 1] < element) )
<a name="l00464"></a>00464 {
<a name="l00465"></a>00465 index -= 1;
<a name="l00466"></a>00466 }
<a name="l00467"></a>00467 <span class="comment">// look linear up</span>
<a name="l00468"></a>00468 <span class="keywordflow">while</span> ( last < (<a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a>) used - 1 && !(element < data[last + 1]) && !(data[last + 1] < element) )
<a name="l00469"></a>00469 {
<a name="l00470"></a>00470 last += 1;
<a name="l00471"></a>00471 }
<a name="l00472"></a>00472
<a name="l00473"></a>00473 <span class="keywordflow">return</span> index;
<a name="l00474"></a>00474 }
<a name="l00475"></a>00475
<a name="l00477"></a>00477
<a name="l00482"></a><a class="code" href="classirr_1_1core_1_1array.html#06327f3b1a87117a57a617cbb7738beb">00482</a> <a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a> <a class="code" href="classirr_1_1core_1_1array.html#06327f3b1a87117a57a617cbb7738beb" title="Finds an element in linear time, which is very slow.">linear_search</a>(<span class="keyword">const</span> T& element)<span class="keyword"> const</span>
<a name="l00483"></a>00483 <span class="keyword"> </span>{
<a name="l00484"></a>00484 <span class="keywordflow">for</span> (<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> i=0; i<used; ++i)
<a name="l00485"></a>00485 <span class="keywordflow">if</span> (element == data[i])
<a name="l00486"></a>00486 <span class="keywordflow">return</span> (<a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a>)i;
<a name="l00487"></a>00487
<a name="l00488"></a>00488 <span class="keywordflow">return</span> -1;
<a name="l00489"></a>00489 }
<a name="l00490"></a>00490
<a name="l00491"></a>00491
<a name="l00493"></a>00493
<a name="l00498"></a><a class="code" href="classirr_1_1core_1_1array.html#c4a756f807ae06a74cc71cfd05dc22de">00498</a> <a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a> <a class="code" href="classirr_1_1core_1_1array.html#c4a756f807ae06a74cc71cfd05dc22de" title="Finds an element in linear time, which is very slow.">linear_reverse_search</a>(<span class="keyword">const</span> T& element)<span class="keyword"> const</span>
<a name="l00499"></a>00499 <span class="keyword"> </span>{
<a name="l00500"></a>00500 <span class="keywordflow">for</span> (<a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a> i=used-1; i>=0; --i)
<a name="l00501"></a>00501 <span class="keywordflow">if</span> (data[i] == element)
<a name="l00502"></a>00502 <span class="keywordflow">return</span> i;
<a name="l00503"></a>00503
<a name="l00504"></a>00504 <span class="keywordflow">return</span> -1;
<a name="l00505"></a>00505 }
<a name="l00506"></a>00506
<a name="l00507"></a>00507
<a name="l00509"></a>00509
<a name="l00512"></a><a class="code" href="classirr_1_1core_1_1array.html#5ba14e37dddaecd9c3e813a78c157dc8">00512</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1array.html#5ba14e37dddaecd9c3e813a78c157dc8" title="Erases an element from the array.">erase</a>(<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> index)
<a name="l00513"></a>00513 {
<a name="l00514"></a>00514 <a class="code" href="irr_types_8h.html#12f3b5fd18ca108f90c5c74db602267e" title="define a break macro for debugging.">_IRR_DEBUG_BREAK_IF</a>(index>=used) <span class="comment">// access violation</span>
<a name="l00515"></a>00515
<a name="l00516"></a>00516 <span class="keywordflow">for</span> (<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> i=index+1; i<used; ++i)
<a name="l00517"></a>00517 {
<a name="l00518"></a>00518 allocator.destruct(&data[i-1]);
<a name="l00519"></a>00519 allocator.construct(&data[i-1], data[i]); <span class="comment">// data[i-1] = data[i];</span>
<a name="l00520"></a>00520 }
<a name="l00521"></a>00521
<a name="l00522"></a>00522 allocator.destruct(&data[used-1]);
<a name="l00523"></a>00523
<a name="l00524"></a>00524 --used;
<a name="l00525"></a>00525 }
<a name="l00526"></a>00526
<a name="l00527"></a>00527
<a name="l00529"></a>00529
<a name="l00533"></a><a class="code" href="classirr_1_1core_1_1array.html#b9bb8cb0e6ebc4839fa2f7bc8e626800">00533</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1array.html#5ba14e37dddaecd9c3e813a78c157dc8" title="Erases an element from the array.">erase</a>(<a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> index, <a class="code" href="namespaceirr.html#c66849b7a6ed16e30ebede579f9b47c6" title="32 bit signed variable.">s32</a> count)
<a name="l00534"></a>00534 {
<a name="l00535"></a>00535 <a class="code" href="irr_types_8h.html#12f3b5fd18ca108f90c5c74db602267e" title="define a break macro for debugging.">_IRR_DEBUG_BREAK_IF</a>(index>=used || count<1 || index+count>used) <span class="comment">// access violation</span>
<a name="l00536"></a>00536
<a name="l00537"></a>00537 <a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> i;
<a name="l00538"></a>00538 <span class="keywordflow">for</span> (i=index; i<index+count; ++i)
<a name="l00539"></a>00539 allocator.destruct(&data[i]);
<a name="l00540"></a>00540
<a name="l00541"></a>00541 <span class="keywordflow">for</span> (i=index+count; i<used; ++i)
<a name="l00542"></a>00542 {
<a name="l00543"></a>00543 <span class="keywordflow">if</span> (i > index+count)
<a name="l00544"></a>00544 allocator.destruct(&data[i-count]);
<a name="l00545"></a>00545
<a name="l00546"></a>00546 allocator.construct(&data[i-count], data[i]); <span class="comment">// data[i-count] = data[i];</span>
<a name="l00547"></a>00547
<a name="l00548"></a>00548 <span class="keywordflow">if</span> (i >= used-count)
<a name="l00549"></a>00549 allocator.destruct(&data[i]);
<a name="l00550"></a>00550 }
<a name="l00551"></a>00551
<a name="l00552"></a>00552 used-= count;
<a name="l00553"></a>00553 }
<a name="l00554"></a>00554
<a name="l00555"></a>00555
<a name="l00557"></a><a class="code" href="classirr_1_1core_1_1array.html#b73d5838db931996f66f9efcc7127b49">00557</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1array.html#b73d5838db931996f66f9efcc7127b49" title="Sets if the array is sorted.">set_sorted</a>(<span class="keywordtype">bool</span> _is_sorted)
<a name="l00558"></a>00558 {
<a name="l00559"></a>00559 is_sorted = _is_sorted;
<a name="l00560"></a>00560 }
<a name="l00561"></a>00561
<a name="l00562"></a>00562 <span class="keyword">private</span>:
<a name="l00563"></a>00563
<a name="l00564"></a>00564 T* data;
<a name="l00565"></a>00565 TAlloc allocator;
<a name="l00566"></a>00566 <a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> allocated;
<a name="l00567"></a>00567 <a class="code" href="namespaceirr.html#0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> used;
<a name="l00568"></a>00568 <a class="code" href="namespaceirr_1_1core.html#a2e91971d5e6e84de235bfabe3c7adba" title="defines an allocation strategy">eAllocStrategy</a> strategy;
<a name="l00569"></a>00569 <span class="keywordtype">bool</span> free_when_destroyed:1;
<a name="l00570"></a>00570 <span class="keywordtype">bool</span> is_sorted:1;
<a name="l00571"></a>00571 };
<a name="l00572"></a>00572
<a name="l00573"></a>00573
<a name="l00574"></a>00574 } <span class="comment">// end namespace core</span>
<a name="l00575"></a>00575 } <span class="comment">// end namespace irr</span>
<a name="l00576"></a>00576
<a name="l00577"></a>00577
<a name="l00578"></a>00578 <span class="preprocessor">#endif</span>
<a name="l00579"></a>00579 <span class="preprocessor"></span>
</pre></div></div>
<hr size="1">
<address style="align: right;">
<small> </small>
</address>
<table width="100%" border="0" cellspacing="0" cellpadding="2">
<tr>
<td width="0"> <div align="left"><small><a href="http://irrlicht.sourceforge.net" target="_blank"><img src="irrlicht.png" alt="The Irrlicht Engine" align="middle" border=0 width=88 height=31></a></small></div></td>
<td> <div align="left"><small><em><font size="2">The <a href="http://irrlicht.sourceforge.net" target="_blank">Irrlicht
Engine</a> Documentation © 2003-2009 by Nikolaus Gebhardt. Generated
on Sun Jan 10 09:24:04 2010 by <a href="http://www.doxygen.org" target="_blank">Doxygen</a>
(1.5.6)</font></em></small></div></td>
</tr>
</table>
<address style="align: right;">
</address>
</body>
</html>
distrib
>
Mandriva
>
2010.1
>
x86_64
>
media
>
contrib-release
>
by-pkgid
>
58828b263d8f56d90ac336dea07a4586
>
files
>
847
