<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>The MRPT project: CompressedStorage.h Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<div align="left"><a href="http://www.mrpt.org/">Main MRPT website</a> > <b>C++ reference</b> </div>
<div align="right">
<a href="index.html"><img border="0" src="mrpt_logo.png" alt="MRPT logo"></a>
</div>
<!-- Generated by Doxygen 1.7.2 -->
<script type="text/javascript"><!--
var searchBox = new SearchBox("searchBox", "search",false,'Search');
--></script>
<div class="navigation" id="top">
<div class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</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>
<li id="searchli">
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<form id="FSearchBox" action="search.php" method="get">
<img id="MSearchSelect" src="search/mag.png" alt=""/>
<input type="text" id="MSearchField" name="query" value="Search" size="20" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"/>
</form>
</span><span class="right"></span>
</div>
</li>
</ul>
</div>
<div class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<div class="header">
<div class="headertitle">
<h1>CompressedStorage.h</h1> </div>
</div>
<div class="contents">
<a href="_compressed_storage_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// This file is part of Eigen, a lightweight C++ template library</span>
<a name="l00002"></a>00002 <span class="comment">// for linear algebra.</span>
<a name="l00003"></a>00003 <span class="comment">//</span>
<a name="l00004"></a>00004 <span class="comment">// Copyright (C) 2008 Gael Guennebaud <gael.guennebaud@inria.fr></span>
<a name="l00005"></a>00005 <span class="comment">//</span>
<a name="l00006"></a>00006 <span class="comment">// Eigen is free software; you can redistribute it and/or</span>
<a name="l00007"></a>00007 <span class="comment">// modify it under the terms of the GNU Lesser General Public</span>
<a name="l00008"></a>00008 <span class="comment">// License as published by the Free Software Foundation; either</span>
<a name="l00009"></a>00009 <span class="comment">// version 3 of the License, or (at your option) any later version.</span>
<a name="l00010"></a>00010 <span class="comment">//</span>
<a name="l00011"></a>00011 <span class="comment">// Alternatively, you can redistribute it and/or</span>
<a name="l00012"></a>00012 <span class="comment">// modify it under the terms of the GNU General Public License as</span>
<a name="l00013"></a>00013 <span class="comment">// published by the Free Software Foundation; either version 2 of</span>
<a name="l00014"></a>00014 <span class="comment">// the License, or (at your option) any later version.</span>
<a name="l00015"></a>00015 <span class="comment">//</span>
<a name="l00016"></a>00016 <span class="comment">// Eigen is distributed in the hope that it will be useful, but WITHOUT ANY</span>
<a name="l00017"></a>00017 <span class="comment">// WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS</span>
<a name="l00018"></a>00018 <span class="comment">// FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License or the</span>
<a name="l00019"></a>00019 <span class="comment">// GNU General Public License for more details.</span>
<a name="l00020"></a>00020 <span class="comment">//</span>
<a name="l00021"></a>00021 <span class="comment">// You should have received a copy of the GNU Lesser General Public</span>
<a name="l00022"></a>00022 <span class="comment">// License and a copy of the GNU General Public License along with</span>
<a name="l00023"></a>00023 <span class="comment">// Eigen. If not, see <http://www.gnu.org/licenses/>.</span>
<a name="l00024"></a>00024
<a name="l00025"></a>00025 <span class="preprocessor">#ifndef EIGEN_COMPRESSED_STORAGE_H</span>
<a name="l00026"></a>00026 <span class="preprocessor"></span><span class="preprocessor">#define EIGEN_COMPRESSED_STORAGE_H</span>
<a name="l00027"></a>00027 <span class="preprocessor"></span><span class="comment"></span>
<a name="l00028"></a>00028 <span class="comment">/** Stores a sparse set of values as a list of values and a list of indices.</span>
<a name="l00029"></a>00029 <span class="comment"> *</span>
<a name="l00030"></a>00030 <span class="comment"> */</span>
<a name="l00031"></a>00031 <span class="keyword">template</span><<span class="keyword">typename</span> _Scalar,<span class="keyword">typename</span> _Index>
<a name="l00032"></a><a class="code" href="class_compressed_storage.html">00032</a> <span class="keyword">class </span><a class="code" href="class_compressed_storage.html" title="Stores a sparse set of values as a list of values and a list of indices.">CompressedStorage</a>
<a name="l00033"></a>00033 {
<a name="l00034"></a>00034 <span class="keyword">public</span>:
<a name="l00035"></a>00035
<a name="l00036"></a><a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">00036</a> <span class="keyword">typedef</span> _Scalar <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a>;
<a name="l00037"></a><a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">00037</a> <span class="keyword">typedef</span> _Index <a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a>;
<a name="l00038"></a>00038
<a name="l00039"></a>00039 <span class="keyword">protected</span>:
<a name="l00040"></a>00040
<a name="l00041"></a><a class="code" href="class_compressed_storage.html#a75a1bed765b4b719354273894d797b8b">00041</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="struct_num_traits.html" title="Holds information about the various numeric (i.e.">NumTraits<Scalar>::Real</a> <a class="code" href="class_compressed_storage.html#a75a1bed765b4b719354273894d797b8b">RealScalar</a>;
<a name="l00042"></a>00042
<a name="l00043"></a>00043 <span class="keyword">public</span>:
<a name="l00044"></a>00044
<a name="l00045"></a><a class="code" href="class_compressed_storage.html#ae2979ba04d240b9b9a4b4202692b7c99">00045</a> <a class="code" href="class_compressed_storage.html#ae2979ba04d240b9b9a4b4202692b7c99">CompressedStorage</a>()
<a name="l00046"></a>00046 : <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>(0), <a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>(0), <a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>(0), <a class="code" href="class_compressed_storage.html#acac16d3eaff9ecc1c50f98b61d67e860">m_allocatedSize</a>(0)
<a name="l00047"></a>00047 {}
<a name="l00048"></a>00048
<a name="l00049"></a><a class="code" href="class_compressed_storage.html#aead03a8285763da536701d256024befb">00049</a> <a class="code" href="class_compressed_storage.html#ae2979ba04d240b9b9a4b4202692b7c99">CompressedStorage</a>(<span class="keywordtype">size_t</span> <a class="code" href="class_compressed_storage.html#a329259914e3ab20f9303401ab06bdae8">size</a>)
<a name="l00050"></a>00050 : <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>(0), <a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>(0), <a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>(0), <a class="code" href="class_compressed_storage.html#acac16d3eaff9ecc1c50f98b61d67e860">m_allocatedSize</a>(0)
<a name="l00051"></a>00051 {
<a name="l00052"></a>00052 <a class="code" href="class_compressed_storage.html#a9af0087ac21df447128a46b80631c8c1">resize</a>(size);
<a name="l00053"></a>00053 }
<a name="l00054"></a>00054
<a name="l00055"></a><a class="code" href="class_compressed_storage.html#ad5487520e578b8e3bbb5cd554102e0fc">00055</a> <a class="code" href="class_compressed_storage.html#ae2979ba04d240b9b9a4b4202692b7c99">CompressedStorage</a>(<span class="keyword">const</span> <a class="code" href="class_compressed_storage.html" title="Stores a sparse set of values as a list of values and a list of indices.">CompressedStorage</a>& other)
<a name="l00056"></a>00056 : <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>(0), <a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>(0), <a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>(0), <a class="code" href="class_compressed_storage.html#acac16d3eaff9ecc1c50f98b61d67e860">m_allocatedSize</a>(0)
<a name="l00057"></a>00057 {
<a name="l00058"></a>00058 *<span class="keyword">this</span> = other;
<a name="l00059"></a>00059 }
<a name="l00060"></a>00060
<a name="l00061"></a><a class="code" href="class_compressed_storage.html#a7e39dd28b9ae41389c7dc2e31dd60aba">00061</a> <a class="code" href="class_compressed_storage.html" title="Stores a sparse set of values as a list of values and a list of indices.">CompressedStorage</a>& <a class="code" href="class_compressed_storage.html#a7e39dd28b9ae41389c7dc2e31dd60aba">operator=</a>(<span class="keyword">const</span> <a class="code" href="class_compressed_storage.html" title="Stores a sparse set of values as a list of values and a list of indices.">CompressedStorage</a>& other)
<a name="l00062"></a>00062 {
<a name="l00063"></a>00063 <a class="code" href="class_compressed_storage.html#a9af0087ac21df447128a46b80631c8c1">resize</a>(other.<a class="code" href="class_compressed_storage.html#a329259914e3ab20f9303401ab06bdae8">size</a>());
<a name="l00064"></a>00064 <a class="code" href="namespacemrpt_1_1system_1_1os.html#ae1184cfb1f617787dc4c9da98becbe3a" title="An OS and compiler independent version of &quot;memcpy&quot;.">memcpy</a>(<a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>, other.<a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>, <a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a> * <span class="keyword">sizeof</span>(<a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a>));
<a name="l00065"></a>00065 <a class="code" href="namespacemrpt_1_1system_1_1os.html#ae1184cfb1f617787dc4c9da98becbe3a" title="An OS and compiler independent version of &quot;memcpy&quot;.">memcpy</a>(<a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>, other.<a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>, <a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a> * <span class="keyword">sizeof</span>(<a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a>));
<a name="l00066"></a>00066 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00067"></a>00067 }
<a name="l00068"></a>00068
<a name="l00069"></a><a class="code" href="class_compressed_storage.html#a6a04ef3cb2cebc50d62a66b59619451e">00069</a> <span class="keywordtype">void</span> <a class="code" href="class_compressed_storage.html#a6a04ef3cb2cebc50d62a66b59619451e">swap</a>(<a class="code" href="class_compressed_storage.html" title="Stores a sparse set of values as a list of values and a list of indices.">CompressedStorage</a>& other)
<a name="l00070"></a>00070 {
<a name="l00071"></a>00071 <a class="code" href="class_compressed_storage.html#a6a04ef3cb2cebc50d62a66b59619451e">std::swap</a>(<a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>, other.<a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>);
<a name="l00072"></a>00072 <a class="code" href="class_compressed_storage.html#a6a04ef3cb2cebc50d62a66b59619451e">std::swap</a>(<a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>, other.<a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>);
<a name="l00073"></a>00073 <a class="code" href="class_compressed_storage.html#a6a04ef3cb2cebc50d62a66b59619451e">std::swap</a>(<a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>, other.<a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>);
<a name="l00074"></a>00074 <a class="code" href="class_compressed_storage.html#a6a04ef3cb2cebc50d62a66b59619451e">std::swap</a>(<a class="code" href="class_compressed_storage.html#acac16d3eaff9ecc1c50f98b61d67e860">m_allocatedSize</a>, other.<a class="code" href="class_compressed_storage.html#acac16d3eaff9ecc1c50f98b61d67e860">m_allocatedSize</a>);
<a name="l00075"></a>00075 }
<a name="l00076"></a>00076
<a name="l00077"></a><a class="code" href="class_compressed_storage.html#a6a9bb8951a247f8a5e9d2870d1bb60ba">00077</a> <a class="code" href="class_compressed_storage.html#a6a9bb8951a247f8a5e9d2870d1bb60ba">~CompressedStorage</a>()
<a name="l00078"></a>00078 {
<a name="l00079"></a>00079 <span class="keyword">delete</span>[] <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>;
<a name="l00080"></a>00080 <span class="keyword">delete</span>[] <a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>;
<a name="l00081"></a>00081 }
<a name="l00082"></a>00082
<a name="l00083"></a><a class="code" href="class_compressed_storage.html#a9a2e7bb3746af16a7ab5b923f61d24f6">00083</a> <span class="keywordtype">void</span> <a class="code" href="class_compressed_storage.html#a9a2e7bb3746af16a7ab5b923f61d24f6">reserve</a>(<span class="keywordtype">size_t</span> <a class="code" href="class_compressed_storage.html#a329259914e3ab20f9303401ab06bdae8">size</a>)
<a name="l00084"></a>00084 {
<a name="l00085"></a>00085 <span class="keywordtype">size_t</span> newAllocatedSize = <a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a> + <a class="code" href="class_compressed_storage.html#a329259914e3ab20f9303401ab06bdae8">size</a>;
<a name="l00086"></a>00086 <span class="keywordflow">if</span> (newAllocatedSize > <a class="code" href="class_compressed_storage.html#acac16d3eaff9ecc1c50f98b61d67e860">m_allocatedSize</a>)
<a name="l00087"></a>00087 <a class="code" href="class_compressed_storage.html#a5236328e0cb465321c29cae10d312d88">reallocate</a>(newAllocatedSize);
<a name="l00088"></a>00088 }
<a name="l00089"></a>00089
<a name="l00090"></a><a class="code" href="class_compressed_storage.html#a0fe1b94ddcedb043f34808cdd770782b">00090</a> <span class="keywordtype">void</span> <a class="code" href="class_compressed_storage.html#a0fe1b94ddcedb043f34808cdd770782b">squeeze</a>()
<a name="l00091"></a>00091 {
<a name="l00092"></a>00092 <span class="keywordflow">if</span> (<a class="code" href="class_compressed_storage.html#acac16d3eaff9ecc1c50f98b61d67e860">m_allocatedSize</a>><a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>)
<a name="l00093"></a>00093 <a class="code" href="class_compressed_storage.html#a5236328e0cb465321c29cae10d312d88">reallocate</a>(<a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>);
<a name="l00094"></a>00094 }
<a name="l00095"></a>00095
<a name="l00096"></a><a class="code" href="class_compressed_storage.html#a9af0087ac21df447128a46b80631c8c1">00096</a> <span class="keywordtype">void</span> <a class="code" href="class_compressed_storage.html#a9af0087ac21df447128a46b80631c8c1">resize</a>(<span class="keywordtype">size_t</span> <a class="code" href="class_compressed_storage.html#a329259914e3ab20f9303401ab06bdae8">size</a>, <span class="keywordtype">float</span> reserveSizeFactor = 0)
<a name="l00097"></a>00097 {
<a name="l00098"></a>00098 <span class="keywordflow">if</span> (<a class="code" href="class_compressed_storage.html#acac16d3eaff9ecc1c50f98b61d67e860">m_allocatedSize</a><size)
<a name="l00099"></a>00099 <a class="code" href="class_compressed_storage.html#a5236328e0cb465321c29cae10d312d88">reallocate</a>(size + <span class="keywordtype">size_t</span>(reserveSizeFactor*size));
<a name="l00100"></a>00100 <a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a> = <a class="code" href="class_compressed_storage.html#a329259914e3ab20f9303401ab06bdae8">size</a>;
<a name="l00101"></a>00101 }
<a name="l00102"></a>00102
<a name="l00103"></a><a class="code" href="class_compressed_storage.html#a0fadaaf875137eeeb2d24c91c05bd0fd">00103</a> <span class="keywordtype">void</span> <a class="code" href="class_compressed_storage.html#a0fadaaf875137eeeb2d24c91c05bd0fd">append</a>(<span class="keyword">const</span> <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a>& v, <a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a> i)
<a name="l00104"></a>00104 {
<a name="l00105"></a>00105 <a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a> <span class="keywordtype">id</span> = <span class="keyword">static_cast<</span><a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a><span class="keyword">></span>(<a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>);
<a name="l00106"></a>00106 <a class="code" href="class_compressed_storage.html#a9af0087ac21df447128a46b80631c8c1">resize</a>(<a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>+1, 1);
<a name="l00107"></a>00107 <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>[id] = v;
<a name="l00108"></a>00108 <a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>[id] = i;
<a name="l00109"></a>00109 }
<a name="l00110"></a>00110
<a name="l00111"></a><a class="code" href="class_compressed_storage.html#a329259914e3ab20f9303401ab06bdae8">00111</a> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> <a class="code" href="class_compressed_storage.html#a329259914e3ab20f9303401ab06bdae8">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>; }
<a name="l00112"></a><a class="code" href="class_compressed_storage.html#a7947dc70ad0e4938d0d50519f9351cf4">00112</a> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> <a class="code" href="class_compressed_storage.html#a7947dc70ad0e4938d0d50519f9351cf4">allocatedSize</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="class_compressed_storage.html#acac16d3eaff9ecc1c50f98b61d67e860">m_allocatedSize</a>; }
<a name="l00113"></a><a class="code" href="class_compressed_storage.html#aecb4867a0f73fd3ff9c24ea4d8923ad8">00113</a> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="class_compressed_storage.html#aecb4867a0f73fd3ff9c24ea4d8923ad8">clear</a>() { <a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a> = 0; }
<a name="l00114"></a>00114
<a name="l00115"></a><a class="code" href="class_compressed_storage.html#a5969d6b59a14821d2a5bf07b60a3fd5a">00115</a> <span class="keyword">inline</span> <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a>& <a class="code" href="class_compressed_storage.html#a5969d6b59a14821d2a5bf07b60a3fd5a">value</a>(<span class="keywordtype">size_t</span> i) { <span class="keywordflow">return</span> <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>[i]; }
<a name="l00116"></a><a class="code" href="class_compressed_storage.html#a6004f62ac1b18570a571db93f570232a">00116</a> <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a>& <a class="code" href="class_compressed_storage.html#a6004f62ac1b18570a571db93f570232a">value</a>(<span class="keywordtype">size_t</span> i)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>[i]; }
<a name="l00117"></a>00117
<a name="l00118"></a><a class="code" href="class_compressed_storage.html#af2d4ccb3624505ffbd7efcd34605d478">00118</a> <span class="keyword">inline</span> <a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a>& <a class="code" href="class_compressed_storage.html#af2d4ccb3624505ffbd7efcd34605d478">index</a>(<span class="keywordtype">size_t</span> i) { <span class="keywordflow">return</span> <a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>[i]; }
<a name="l00119"></a><a class="code" href="class_compressed_storage.html#ab8db71503baf6eaa60466208576a8511">00119</a> <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a>& <a class="code" href="class_compressed_storage.html#ab8db71503baf6eaa60466208576a8511">index</a>(<span class="keywordtype">size_t</span> i)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>[i]; }
<a name="l00120"></a>00120
<a name="l00121"></a><a class="code" href="class_compressed_storage.html#ad7b771825be1e0ed6eb4d33dcf9d1e87">00121</a> <span class="keyword">static</span> <a class="code" href="class_compressed_storage.html" title="Stores a sparse set of values as a list of values and a list of indices.">CompressedStorage</a> <a class="code" href="class_compressed_storage.html#ad7b771825be1e0ed6eb4d33dcf9d1e87">Map</a>(<a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a>* indices, <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a>* values, <span class="keywordtype">size_t</span> <a class="code" href="class_compressed_storage.html#a329259914e3ab20f9303401ab06bdae8">size</a>)
<a name="l00122"></a>00122 {
<a name="l00123"></a>00123 <a class="code" href="class_compressed_storage.html" title="Stores a sparse set of values as a list of values and a list of indices.">CompressedStorage</a> res;
<a name="l00124"></a>00124 res.<a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a> = indices;
<a name="l00125"></a>00125 res.<a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a> = values;
<a name="l00126"></a>00126 res.<a class="code" href="class_compressed_storage.html#acac16d3eaff9ecc1c50f98b61d67e860">m_allocatedSize</a> = res.<a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a> = <a class="code" href="class_compressed_storage.html#a329259914e3ab20f9303401ab06bdae8">size</a>;
<a name="l00127"></a>00127 <span class="keywordflow">return</span> res;
<a name="l00128"></a>00128 }
<a name="l00129"></a>00129 <span class="comment"></span>
<a name="l00130"></a>00130 <span class="comment"> /** \returns the largest \c k such that for all \c j in [0,k) index[\c j]<\a key */</span>
<a name="l00131"></a><a class="code" href="class_compressed_storage.html#a6be9c866ca0010771566ef28aea11a8e">00131</a> <span class="keyword">inline</span> <a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a> <a class="code" href="class_compressed_storage.html#a6be9c866ca0010771566ef28aea11a8e">searchLowerIndex</a>(<a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a> key)<span class="keyword"> const</span>
<a name="l00132"></a>00132 <span class="keyword"> </span>{
<a name="l00133"></a>00133 <span class="keywordflow">return</span> <a class="code" href="class_compressed_storage.html#a6be9c866ca0010771566ef28aea11a8e">searchLowerIndex</a>(0, <a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>, key);
<a name="l00134"></a>00134 }
<a name="l00135"></a>00135 <span class="comment"></span>
<a name="l00136"></a>00136 <span class="comment"> /** \returns the largest \c k in [start,end) such that for all \c j in [start,k) index[\c j]<\a key */</span>
<a name="l00137"></a><a class="code" href="class_compressed_storage.html#afa99ea37fd081c8ebb4d82b37d8743ef">00137</a> <span class="keyword">inline</span> <a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a> <a class="code" href="class_compressed_storage.html#a6be9c866ca0010771566ef28aea11a8e">searchLowerIndex</a>(<span class="keywordtype">size_t</span> start, <span class="keywordtype">size_t</span> <a class="code" href="eigen__plugins_8h.html#ade5b39864c905cbb824d0ff6eb0d888c">end</a>, <a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a> key)<span class="keyword"> const</span>
<a name="l00138"></a>00138 <span class="keyword"> </span>{
<a name="l00139"></a>00139 <span class="keywordflow">while</span>(end>start)
<a name="l00140"></a>00140 {
<a name="l00141"></a>00141 <span class="keywordtype">size_t</span> mid = (end+start)>>1;
<a name="l00142"></a>00142 <span class="keywordflow">if</span> (<a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>[mid]<key)
<a name="l00143"></a>00143 start = mid+1;
<a name="l00144"></a>00144 <span class="keywordflow">else</span>
<a name="l00145"></a>00145 end = mid;
<a name="l00146"></a>00146 }
<a name="l00147"></a>00147 <span class="keywordflow">return</span> <span class="keyword">static_cast<</span><a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a><span class="keyword">></span>(start);
<a name="l00148"></a>00148 }
<a name="l00149"></a>00149 <span class="comment"></span>
<a name="l00150"></a>00150 <span class="comment"> /** \returns the stored value at index \a key</span>
<a name="l00151"></a>00151 <span class="comment"> * If the value does not exist, then the value \a defaultValue is returned without any insertion. */</span>
<a name="l00152"></a><a class="code" href="class_compressed_storage.html#a8255fb717d0b2b2c685f123ccf138142">00152</a> <span class="keyword">inline</span> <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a> <a class="code" href="class_compressed_storage.html#a8255fb717d0b2b2c685f123ccf138142">at</a>(<a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a> key, <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a> defaultValue = <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a>(0))<span class="keyword"> const</span>
<a name="l00153"></a>00153 <span class="keyword"> </span>{
<a name="l00154"></a>00154 <span class="keywordflow">if</span> (<a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>==0)
<a name="l00155"></a>00155 <span class="keywordflow">return</span> defaultValue;
<a name="l00156"></a>00156 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (key==<a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>[<a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>-1])
<a name="l00157"></a>00157 <span class="keywordflow">return</span> <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>[<a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>-1];
<a name="l00158"></a>00158 <span class="comment">// ^^ optimization: let's first check if it is the last coefficient</span>
<a name="l00159"></a>00159 <span class="comment">// (very common in high level algorithms)</span>
<a name="l00160"></a>00160 <span class="keyword">const</span> <span class="keywordtype">size_t</span> <span class="keywordtype">id</span> = <a class="code" href="class_compressed_storage.html#a6be9c866ca0010771566ef28aea11a8e">searchLowerIndex</a>(0,<a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>-1,key);
<a name="l00161"></a>00161 <span class="keywordflow">return</span> ((<span class="keywordtype">id</span><<a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>) && (<a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>[<span class="keywordtype">id</span>]==key)) ? <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>[id] : defaultValue;
<a name="l00162"></a>00162 }
<a name="l00163"></a>00163 <span class="comment"></span>
<a name="l00164"></a>00164 <span class="comment"> /** Like at(), but the search is performed in the range [start,end) */</span>
<a name="l00165"></a><a class="code" href="class_compressed_storage.html#a4da5ec68b431743f05d00eba6de70b62">00165</a> <span class="keyword">inline</span> <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a> <a class="code" href="class_compressed_storage.html#a4da5ec68b431743f05d00eba6de70b62" title="Like at(), but the search is performed in the range [start,end)">atInRange</a>(<span class="keywordtype">size_t</span> start, <span class="keywordtype">size_t</span> <a class="code" href="eigen__plugins_8h.html#ade5b39864c905cbb824d0ff6eb0d888c">end</a>, <a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a> key, <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a> defaultValue = <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a>(0))<span class="keyword"> const</span>
<a name="l00166"></a>00166 <span class="keyword"> </span>{
<a name="l00167"></a>00167 <span class="keywordflow">if</span> (start>=end)
<a name="l00168"></a>00168 <span class="keywordflow">return</span> <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a>(0);
<a name="l00169"></a>00169 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (end>start && key==<a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>[end-1])
<a name="l00170"></a>00170 <span class="keywordflow">return</span> <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>[end-1];
<a name="l00171"></a>00171 <span class="comment">// ^^ optimization: let's first check if it is the last coefficient</span>
<a name="l00172"></a>00172 <span class="comment">// (very common in high level algorithms)</span>
<a name="l00173"></a>00173 <span class="keyword">const</span> <span class="keywordtype">size_t</span> <span class="keywordtype">id</span> = <a class="code" href="class_compressed_storage.html#a6be9c866ca0010771566ef28aea11a8e">searchLowerIndex</a>(start,end-1,key);
<a name="l00174"></a>00174 <span class="keywordflow">return</span> ((<span class="keywordtype">id</span><end) && (<a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>[<span class="keywordtype">id</span>]==key)) ? <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>[id] : defaultValue;
<a name="l00175"></a>00175 }
<a name="l00176"></a>00176 <span class="comment"></span>
<a name="l00177"></a>00177 <span class="comment"> /** \returns a reference to the value at index \a key</span>
<a name="l00178"></a>00178 <span class="comment"> * If the value does not exist, then the value \a defaultValue is inserted</span>
<a name="l00179"></a>00179 <span class="comment"> * such that the keys are sorted. */</span>
<a name="l00180"></a><a class="code" href="class_compressed_storage.html#aae5052d60dd5747ca1ab741e5275886f">00180</a> <span class="keyword">inline</span> <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a>& <a class="code" href="class_compressed_storage.html#aae5052d60dd5747ca1ab741e5275886f">atWithInsertion</a>(<a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a> key, <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a> defaultValue = <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a>(0))
<a name="l00181"></a>00181 {
<a name="l00182"></a>00182 <span class="keywordtype">size_t</span> <span class="keywordtype">id</span> = <a class="code" href="class_compressed_storage.html#a6be9c866ca0010771566ef28aea11a8e">searchLowerIndex</a>(0,<a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>,key);
<a name="l00183"></a>00183 <span class="keywordflow">if</span> (<span class="keywordtype">id</span>>=<a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a> || <a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>[<span class="keywordtype">id</span>]!=key)
<a name="l00184"></a>00184 {
<a name="l00185"></a>00185 <a class="code" href="class_compressed_storage.html#a9af0087ac21df447128a46b80631c8c1">resize</a>(<a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>+1,1);
<a name="l00186"></a>00186 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j=<a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>-1; j>id; --j)
<a name="l00187"></a>00187 {
<a name="l00188"></a>00188 <a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>[j] = <a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>[j-1];
<a name="l00189"></a>00189 <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>[j] = <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>[j-1];
<a name="l00190"></a>00190 }
<a name="l00191"></a>00191 <a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>[id] = key;
<a name="l00192"></a>00192 <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>[id] = defaultValue;
<a name="l00193"></a>00193 }
<a name="l00194"></a>00194 <span class="keywordflow">return</span> <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>[id];
<a name="l00195"></a>00195 }
<a name="l00196"></a>00196
<a name="l00197"></a><a class="code" href="class_compressed_storage.html#a0d50aece973e6cd9cb721017ed81613b">00197</a> <span class="keywordtype">void</span> <a class="code" href="class_compressed_storage.html#a0d50aece973e6cd9cb721017ed81613b">prune</a>(<a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a> reference, <a class="code" href="class_compressed_storage.html#a75a1bed765b4b719354273894d797b8b">RealScalar</a> epsilon = <a class="code" href="struct_num_traits.html" title="Holds information about the various numeric (i.e.">NumTraits<RealScalar>::dummy_precision</a>())
<a name="l00198"></a>00198 {
<a name="l00199"></a>00199 <span class="keywordtype">size_t</span> k = 0;
<a name="l00200"></a>00200 <span class="keywordtype">size_t</span> n = <a class="code" href="class_compressed_storage.html#a329259914e3ab20f9303401ab06bdae8">size</a>();
<a name="l00201"></a>00201 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i=0; i<n; ++i)
<a name="l00202"></a>00202 {
<a name="l00203"></a>00203 <span class="keywordflow">if</span> (!<a class="code" href="namespaceinternal.html#a734df4b9b4cc7c4e7aa66738d113b36e">internal::isMuchSmallerThan</a>(<a class="code" href="class_compressed_storage.html#a5969d6b59a14821d2a5bf07b60a3fd5a">value</a>(i), reference, epsilon))
<a name="l00204"></a>00204 {
<a name="l00205"></a>00205 <a class="code" href="class_compressed_storage.html#a5969d6b59a14821d2a5bf07b60a3fd5a">value</a>(k) = <a class="code" href="class_compressed_storage.html#a5969d6b59a14821d2a5bf07b60a3fd5a">value</a>(i);
<a name="l00206"></a>00206 <a class="code" href="class_compressed_storage.html#af2d4ccb3624505ffbd7efcd34605d478">index</a>(k) = <a class="code" href="class_compressed_storage.html#af2d4ccb3624505ffbd7efcd34605d478">index</a>(i);
<a name="l00207"></a>00207 ++k;
<a name="l00208"></a>00208 }
<a name="l00209"></a>00209 }
<a name="l00210"></a>00210 <a class="code" href="class_compressed_storage.html#a9af0087ac21df447128a46b80631c8c1">resize</a>(k,0);
<a name="l00211"></a>00211 }
<a name="l00212"></a>00212
<a name="l00213"></a>00213 <span class="keyword">protected</span>:
<a name="l00214"></a>00214
<a name="l00215"></a><a class="code" href="class_compressed_storage.html#a5236328e0cb465321c29cae10d312d88">00215</a> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="class_compressed_storage.html#a5236328e0cb465321c29cae10d312d88">reallocate</a>(<span class="keywordtype">size_t</span> <a class="code" href="class_compressed_storage.html#a329259914e3ab20f9303401ab06bdae8">size</a>)
<a name="l00216"></a>00216 {
<a name="l00217"></a>00217 <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a>* newValues = <span class="keyword">new</span> <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a>[<a class="code" href="class_compressed_storage.html#a329259914e3ab20f9303401ab06bdae8">size</a>];
<a name="l00218"></a>00218 <a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a>* newIndices = <span class="keyword">new</span> <a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a>[<a class="code" href="class_compressed_storage.html#a329259914e3ab20f9303401ab06bdae8">size</a>];
<a name="l00219"></a>00219 <span class="keywordtype">size_t</span> copySize = std::min(size, <a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>);
<a name="l00220"></a>00220 <span class="comment">// copy</span>
<a name="l00221"></a>00221 <a class="code" href="namespacemrpt_1_1system_1_1os.html#ae1184cfb1f617787dc4c9da98becbe3a" title="An OS and compiler independent version of &quot;memcpy&quot;.">memcpy</a>(newValues, <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>, copySize * <span class="keyword">sizeof</span>(<a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a>));
<a name="l00222"></a>00222 <a class="code" href="namespacemrpt_1_1system_1_1os.html#ae1184cfb1f617787dc4c9da98becbe3a" title="An OS and compiler independent version of &quot;memcpy&quot;.">memcpy</a>(newIndices, <a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>, copySize * <span class="keyword">sizeof</span>(<a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a>));
<a name="l00223"></a>00223 <span class="comment">// delete old stuff</span>
<a name="l00224"></a>00224 <span class="keyword">delete</span>[] <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>;
<a name="l00225"></a>00225 <span class="keyword">delete</span>[] <a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>;
<a name="l00226"></a>00226 <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a> = newValues;
<a name="l00227"></a>00227 <a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a> = newIndices;
<a name="l00228"></a>00228 <a class="code" href="class_compressed_storage.html#acac16d3eaff9ecc1c50f98b61d67e860">m_allocatedSize</a> = <a class="code" href="class_compressed_storage.html#a329259914e3ab20f9303401ab06bdae8">size</a>;
<a name="l00229"></a>00229 }
<a name="l00230"></a>00230
<a name="l00231"></a>00231 <span class="keyword">protected</span>:
<a name="l00232"></a><a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">00232</a> <a class="code" href="class_compressed_storage.html#a53bc37d78bd6e9c8152ec324c9812cc1">Scalar</a>* <a class="code" href="class_compressed_storage.html#a1081dae07c94b660c41075bd93cfda4c">m_values</a>;
<a name="l00233"></a><a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">00233</a> <a class="code" href="class_compressed_storage.html#a12a847c1edd7884276fc5b54a8384e8f">Index</a>* <a class="code" href="class_compressed_storage.html#ab2f998a7d59c8296315b42aa52c31c3c">m_indices</a>;
<a name="l00234"></a><a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">00234</a> <span class="keywordtype">size_t</span> <a class="code" href="class_compressed_storage.html#a6f3d88645a4f095da894bdc4dcb579b8">m_size</a>;
<a name="l00235"></a><a class="code" href="class_compressed_storage.html#acac16d3eaff9ecc1c50f98b61d67e860">00235</a> <span class="keywordtype">size_t</span> <a class="code" href="class_compressed_storage.html#acac16d3eaff9ecc1c50f98b61d67e860">m_allocatedSize</a>;
<a name="l00236"></a>00236
<a name="l00237"></a>00237 };
<a name="l00238"></a>00238
<a name="l00239"></a>00239 <span class="preprocessor">#endif // EIGEN_COMPRESSED_STORAGE_H</span>
</pre></div></div>
</div>
<br><hr><br> <table border="0" width="100%"> <tr> <td> Page generated by <a href="http://www.doxygen.org" target="_blank">Doxygen 1.7.2</a> for MRPT 0.9.4 SVN: at Mon Jan 10 22:30:30 UTC 2011</td><td></td> <td width="100"> </td> <td width="150"> </td></tr> </table> </body></html>
