<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>ublas: storage_sparse.hpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.6.1 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<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="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>
</ul>
</div>
<h1>storage_sparse.hpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">//</span>
<a name="l00002"></a>00002 <span class="comment">// Copyright (c) 2000-2002</span>
<a name="l00003"></a>00003 <span class="comment">// Joerg Walter, Mathias Koch</span>
<a name="l00004"></a>00004 <span class="comment">//</span>
<a name="l00005"></a>00005 <span class="comment">// Distributed under the Boost Software License, Version 1.0. (See</span>
<a name="l00006"></a>00006 <span class="comment">// accompanying file LICENSE_1_0.txt or copy at</span>
<a name="l00007"></a>00007 <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span>
<a name="l00008"></a>00008 <span class="comment">//</span>
<a name="l00009"></a>00009 <span class="comment">// The authors gratefully acknowledge the support of</span>
<a name="l00010"></a>00010 <span class="comment">// GeNeSys mbH & Co. KG in producing this work.</span>
<a name="l00011"></a>00011 <span class="comment">//</span>
<a name="l00012"></a>00012
<a name="l00013"></a>00013 <span class="preprocessor">#ifndef _BOOST_UBLAS_STORAGE_SPARSE_</span>
<a name="l00014"></a>00014 <span class="preprocessor"></span><span class="preprocessor">#define _BOOST_UBLAS_STORAGE_SPARSE_</span>
<a name="l00015"></a>00015 <span class="preprocessor"></span>
<a name="l00016"></a>00016 <span class="preprocessor">#include <map></span>
<a name="l00017"></a>00017 <span class="preprocessor">#include <boost/serialization/collection_size_type.hpp></span>
<a name="l00018"></a>00018 <span class="preprocessor">#include <boost/serialization/nvp.hpp></span>
<a name="l00019"></a>00019 <span class="preprocessor">#include <boost/serialization/array.hpp></span>
<a name="l00020"></a>00020 <span class="preprocessor">#include <boost/serialization/map.hpp></span>
<a name="l00021"></a>00021 <span class="preprocessor">#include <boost/serialization/base_object.hpp></span>
<a name="l00022"></a>00022
<a name="l00023"></a>00023 <span class="preprocessor">#include <boost/numeric/ublas/storage.hpp></span>
<a name="l00024"></a>00024
<a name="l00025"></a>00025
<a name="l00026"></a>00026 <span class="keyword">namespace </span>boost { <span class="keyword">namespace </span>numeric { <span class="keyword">namespace </span>ublas {
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="keyword">namespace </span>detail {
<a name="l00029"></a>00029
<a name="l00030"></a>00030 <span class="keyword">template</span><<span class="keyword">class</span> I, <span class="keyword">class</span> T, <span class="keyword">class</span> C>
<a name="l00031"></a>00031 BOOST_UBLAS_INLINE
<a name="l00032"></a>00032 I lower_bound (<span class="keyword">const</span> I &begin, <span class="keyword">const</span> I &end, <span class="keyword">const</span> T &t, C compare) {
<a name="l00033"></a>00033 <span class="comment">// t <= *begin <=> ! (*begin < t)</span>
<a name="l00034"></a>00034 <span class="keywordflow">if</span> (begin == end || ! compare (*begin, t))
<a name="l00035"></a>00035 <span class="keywordflow">return</span> begin;
<a name="l00036"></a>00036 <span class="keywordflow">if</span> (compare (*(end - 1), t))
<a name="l00037"></a>00037 <span class="keywordflow">return</span> end;
<a name="l00038"></a>00038 <span class="keywordflow">return</span> std::lower_bound (begin, end, t, compare);
<a name="l00039"></a>00039 }
<a name="l00040"></a>00040 <span class="keyword">template</span><<span class="keyword">class</span> I, <span class="keyword">class</span> T, <span class="keyword">class</span> C>
<a name="l00041"></a>00041 BOOST_UBLAS_INLINE
<a name="l00042"></a>00042 I upper_bound (<span class="keyword">const</span> I &begin, <span class="keyword">const</span> I &end, <span class="keyword">const</span> T &t, C compare) {
<a name="l00043"></a>00043 <span class="keywordflow">if</span> (begin == end || compare (t, *begin))
<a name="l00044"></a>00044 <span class="keywordflow">return</span> begin;
<a name="l00045"></a>00045 <span class="comment">// (*end - 1) <= t <=> ! (t < *end)</span>
<a name="l00046"></a>00046 <span class="keywordflow">if</span> (! compare (t, *(end - 1)))
<a name="l00047"></a>00047 <span class="keywordflow">return</span> end;
<a name="l00048"></a>00048 <span class="keywordflow">return</span> std::upper_bound (begin, end, t, compare);
<a name="l00049"></a>00049 }
<a name="l00050"></a>00050
<a name="l00051"></a>00051 <span class="keyword">template</span><<span class="keyword">class</span> P>
<a name="l00052"></a><a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1less__pair.html">00052</a> <span class="keyword">struct </span><a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1less__pair.html">less_pair</a> {
<a name="l00053"></a>00053 BOOST_UBLAS_INLINE
<a name="l00054"></a>00054 <span class="keywordtype">bool</span> operator () (<span class="keyword">const</span> P &p1, <span class="keyword">const</span> P &p2) {
<a name="l00055"></a>00055 <span class="keywordflow">return</span> p1.first < p2.first;
<a name="l00056"></a>00056 }
<a name="l00057"></a>00057 };
<a name="l00058"></a>00058 <span class="keyword">template</span><<span class="keyword">class</span> T>
<a name="l00059"></a><a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1less__triple.html">00059</a> <span class="keyword">struct </span><a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1less__triple.html">less_triple</a> {
<a name="l00060"></a>00060 BOOST_UBLAS_INLINE
<a name="l00061"></a>00061 <span class="keywordtype">bool</span> operator () (<span class="keyword">const</span> T &t1, <span class="keyword">const</span> T &t2) {
<a name="l00062"></a>00062 <span class="keywordflow">return</span> t1.first.first < t2.first.first ||
<a name="l00063"></a>00063 (t1.first.first == t2.first.first && t1.first.second < t2.first.second);
<a name="l00064"></a>00064 }
<a name="l00065"></a>00065 };
<a name="l00066"></a>00066
<a name="l00067"></a>00067 }
<a name="l00068"></a>00068
<a name="l00069"></a>00069 <span class="preprocessor">#ifdef BOOST_UBLAS_STRICT_MAP_ARRAY</span>
<a name="l00070"></a>00070 <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">class</span> A>
<a name="l00071"></a>00071 <span class="keyword">class </span>sparse_storage_element:
<a name="l00072"></a>00072 <span class="keyword">public</span> container_reference<A> {
<a name="l00073"></a>00073 <span class="keyword">public</span>:
<a name="l00074"></a>00074 <span class="keyword">typedef</span> A array_type;
<a name="l00075"></a>00075 <span class="keyword">typedef</span> <span class="keyword">typename</span> A::key_type index_type;
<a name="l00076"></a>00076 <span class="keyword">typedef</span> <span class="keyword">typename</span> A::mapped_type data_value_type;
<a name="l00077"></a>00077 <span class="comment">// typedef const data_value_type &data_const_reference;</span>
<a name="l00078"></a>00078 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="structboost_1_1numeric_1_1ublas_1_1type__traits.html">type_traits<data_value_type>::const_reference</a> data_const_reference;
<a name="l00079"></a>00079 <span class="keyword">typedef</span> data_value_type &data_reference;
<a name="l00080"></a>00080 <span class="keyword">typedef</span> <span class="keyword">typename</span> A::value_type value_type;
<a name="l00081"></a>00081 <span class="keyword">typedef</span> value_type *pointer;
<a name="l00082"></a>00082
<a name="l00083"></a>00083 <span class="comment">// Construction and destruction</span>
<a name="l00084"></a>00084 BOOST_UBLAS_INLINE
<a name="l00085"></a>00085 sparse_storage_element (array_type &a, pointer it):
<a name="l00086"></a>00086 container_reference<array_type> (a), it_ (it), i_ (it->first), d_ (it->second), dirty_ (false) {}
<a name="l00087"></a>00087 BOOST_UBLAS_INLINE
<a name="l00088"></a>00088 sparse_storage_element (array_type &a, index_type i):
<a name="l00089"></a>00089 container_reference<array_type> (a), it_ (), i_ (i), d_ (), dirty_ (false) {
<a name="l00090"></a>00090 pointer it = (*this) ().find (i_);
<a name="l00091"></a>00091 <span class="keywordflow">if</span> (it == (*<span class="keyword">this</span>) ().end ())
<a name="l00092"></a>00092 it = (*this) ().insert ((*<span class="keyword">this</span>) ().end (), value_type (i_, d_));
<a name="l00093"></a>00093 d_ = it->second;
<a name="l00094"></a>00094 }
<a name="l00095"></a>00095 BOOST_UBLAS_INLINE
<a name="l00096"></a>00096 ~sparse_storage_element () {
<a name="l00097"></a>00097 <span class="keywordflow">if</span> (dirty_) {
<a name="l00098"></a>00098 <span class="keywordflow">if</span> (! it_)
<a name="l00099"></a>00099 it_ = (*this) ().find (i_);
<a name="l00100"></a>00100 BOOST_UBLAS_CHECK (it_ != (*<span class="keyword">this</span>) ().end (), internal_logic ());
<a name="l00101"></a>00101 it_->second = d_;
<a name="l00102"></a>00102 }
<a name="l00103"></a>00103 }
<a name="l00104"></a>00104
<a name="l00105"></a>00105 <span class="comment">// Element access - only if data_const_reference is defined</span>
<a name="l00106"></a>00106 BOOST_UBLAS_INLINE
<a name="l00107"></a>00107 <span class="keyword">typename</span> data_value_type::data_const_reference
<a name="l00108"></a>00108 operator [] (index_type i)<span class="keyword"> const </span>{
<a name="l00109"></a>00109 <span class="keywordflow">return</span> d_ [i];
<a name="l00110"></a>00110 }
<a name="l00111"></a>00111
<a name="l00112"></a>00112 <span class="comment">// Assignment</span>
<a name="l00113"></a>00113 BOOST_UBLAS_INLINE
<a name="l00114"></a>00114 sparse_storage_element &operator = (<span class="keyword">const</span> sparse_storage_element &p) {
<a name="l00115"></a>00115 <span class="comment">// Overide the implict copy assignment</span>
<a name="l00116"></a>00116 d_ = p.d_;
<a name="l00117"></a>00117 dirty_ = <span class="keyword">true</span>;
<a name="l00118"></a>00118 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00119"></a>00119 }
<a name="l00120"></a>00120 <span class="keyword">template</span><<span class="keyword">class</span> D>
<a name="l00121"></a>00121 BOOST_UBLAS_INLINE
<a name="l00122"></a>00122 sparse_storage_element &operator = (<span class="keyword">const</span> D &d) {
<a name="l00123"></a>00123 d_ = d;
<a name="l00124"></a>00124 dirty_ = <span class="keyword">true</span>;
<a name="l00125"></a>00125 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00126"></a>00126 }
<a name="l00127"></a>00127 <span class="keyword">template</span><<span class="keyword">class</span> D>
<a name="l00128"></a>00128 BOOST_UBLAS_INLINE
<a name="l00129"></a>00129 sparse_storage_element &operator += (<span class="keyword">const</span> D &d) {
<a name="l00130"></a>00130 d_ += d;
<a name="l00131"></a>00131 dirty_ = <span class="keyword">true</span>;
<a name="l00132"></a>00132 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00133"></a>00133 }
<a name="l00134"></a>00134 <span class="keyword">template</span><<span class="keyword">class</span> D>
<a name="l00135"></a>00135 BOOST_UBLAS_INLINE
<a name="l00136"></a>00136 sparse_storage_element &operator -= (<span class="keyword">const</span> D &d) {
<a name="l00137"></a>00137 d_ -= d;
<a name="l00138"></a>00138 dirty_ = <span class="keyword">true</span>;
<a name="l00139"></a>00139 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00140"></a>00140 }
<a name="l00141"></a>00141 <span class="keyword">template</span><<span class="keyword">class</span> D>
<a name="l00142"></a>00142 BOOST_UBLAS_INLINE
<a name="l00143"></a>00143 sparse_storage_element &operator *= (<span class="keyword">const</span> D &d) {
<a name="l00144"></a>00144 d_ *= d;
<a name="l00145"></a>00145 dirty_ = <span class="keyword">true</span>;
<a name="l00146"></a>00146 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00147"></a>00147 }
<a name="l00148"></a>00148 <span class="keyword">template</span><<span class="keyword">class</span> D>
<a name="l00149"></a>00149 BOOST_UBLAS_INLINE
<a name="l00150"></a>00150 sparse_storage_element &operator /= (<span class="keyword">const</span> D &d) {
<a name="l00151"></a>00151 d_ /= d;
<a name="l00152"></a>00152 dirty_ = <span class="keyword">true</span>;
<a name="l00153"></a>00153 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00154"></a>00154 }
<a name="l00155"></a>00155
<a name="l00156"></a>00156 <span class="comment">// Comparison</span>
<a name="l00157"></a>00157 <span class="keyword">template</span><<span class="keyword">class</span> D>
<a name="l00158"></a>00158 BOOST_UBLAS_INLINE
<a name="l00159"></a>00159 <span class="keywordtype">bool</span> operator == (<span class="keyword">const</span> D &d)<span class="keyword"> const </span>{
<a name="l00160"></a>00160 <span class="keywordflow">return</span> d_ == d;
<a name="l00161"></a>00161 }
<a name="l00162"></a>00162 <span class="keyword">template</span><<span class="keyword">class</span> D>
<a name="l00163"></a>00163 BOOST_UBLAS_INLINE
<a name="l00164"></a>00164 <span class="keywordtype">bool</span> operator != (<span class="keyword">const</span> D &d)<span class="keyword"> const </span>{
<a name="l00165"></a>00165 <span class="keywordflow">return</span> d_ != d;
<a name="l00166"></a>00166 }
<a name="l00167"></a>00167
<a name="l00168"></a>00168 <span class="comment">// Conversion</span>
<a name="l00169"></a>00169 BOOST_UBLAS_INLINE
<a name="l00170"></a>00170 operator data_const_reference ()<span class="keyword"> const </span>{
<a name="l00171"></a>00171 <span class="keywordflow">return</span> d_;
<a name="l00172"></a>00172 }
<a name="l00173"></a>00173
<a name="l00174"></a>00174 <span class="comment">// Swapping</span>
<a name="l00175"></a>00175 BOOST_UBLAS_INLINE
<a name="l00176"></a>00176 <span class="keywordtype">void</span> swap (sparse_storage_element p) {
<a name="l00177"></a>00177 <span class="keywordflow">if</span> (<span class="keyword">this</span> != &p) {
<a name="l00178"></a>00178 dirty_ = <span class="keyword">true</span>;
<a name="l00179"></a>00179 p.dirty_ = <span class="keyword">true</span>;
<a name="l00180"></a>00180 std::swap (d_, p.d_);
<a name="l00181"></a>00181 }
<a name="l00182"></a>00182 }
<a name="l00183"></a>00183 BOOST_UBLAS_INLINE
<a name="l00184"></a>00184 <span class="keyword">friend</span> <span class="keywordtype">void</span> swap (sparse_storage_element p1, sparse_storage_element p2) {
<a name="l00185"></a>00185 p1.swap (p2);
<a name="l00186"></a>00186 }
<a name="l00187"></a>00187
<a name="l00188"></a>00188 <span class="keyword">private</span>:
<a name="l00189"></a>00189 pointer it_;
<a name="l00190"></a>00190 index_type i_;
<a name="l00191"></a>00191 data_value_type d_;
<a name="l00192"></a>00192 <span class="keywordtype">bool</span> dirty_;
<a name="l00193"></a>00193 };
<a name="l00194"></a>00194 <span class="preprocessor">#endif</span>
<a name="l00195"></a>00195 <span class="preprocessor"></span>
<a name="l00196"></a>00196
<a name="l00197"></a>00197 <span class="comment">// Default map type is simply forwarded to std::map</span>
<a name="l00198"></a>00198 <span class="comment">// FIXME should use ALLOC for map but std::allocator of std::pair<const I, T> and std::pair<I,T> fail to compile</span>
<a name="l00199"></a>00199 <span class="keyword">template</span><<span class="keyword">class</span> I, <span class="keyword">class</span> T, <span class="keyword">class</span> ALLOC>
<a name="l00200"></a><a class="code" href="classboost_1_1numeric_1_1ublas_1_1map__std.html">00200</a> <span class="keyword">class </span><a class="code" href="classboost_1_1numeric_1_1ublas_1_1map__std.html">map_std</a> : <span class="keyword">public</span> std::map<I, T <span class="comment">/*, ALLOC */</span>> {
<a name="l00201"></a>00201 <span class="keyword">public</span>:
<a name="l00202"></a>00202 <span class="comment">// Serialization</span>
<a name="l00203"></a>00203 <span class="keyword">template</span><<span class="keyword">class</span> Archive>
<a name="l00204"></a>00204 <span class="keywordtype">void</span> serialize(Archive & ar, <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <span class="comment">/* file_version */</span>){
<a name="l00205"></a>00205 ar & serialization::make_nvp(<span class="stringliteral">"base"</span>, boost::serialization::base_object< std::map<I, T /*, ALLOC */> >(*<span class="keyword">this</span>));
<a name="l00206"></a>00206 }
<a name="l00207"></a>00207 };
<a name="l00208"></a>00208
<a name="l00209"></a>00209
<a name="l00210"></a>00210
<a name="l00211"></a>00211
<a name="l00212"></a>00212 <span class="comment">// Map array</span>
<a name="l00213"></a>00213 <span class="comment">// Implementation requires pair<I, T> allocator definition (without const)</span>
<a name="l00214"></a>00214 <span class="keyword">template</span><<span class="keyword">class</span> I, <span class="keyword">class</span> T, <span class="keyword">class</span> ALLOC>
<a name="l00215"></a><a class="code" href="classboost_1_1numeric_1_1ublas_1_1map__array.html">00215</a> <span class="keyword">class </span><a class="code" href="classboost_1_1numeric_1_1ublas_1_1map__array.html">map_array</a> {
<a name="l00216"></a>00216 <span class="keyword">public</span>:
<a name="l00217"></a>00217 <span class="keyword">typedef</span> ALLOC allocator_type;
<a name="l00218"></a>00218 <span class="keyword">typedef</span> <span class="keyword">typename</span> ALLOC::size_type size_type;
<a name="l00219"></a>00219 <span class="keyword">typedef</span> <span class="keyword">typename</span> ALLOC::difference_type difference_type;
<a name="l00220"></a>00220 <span class="keyword">typedef</span> std::pair<I,T> value_type;
<a name="l00221"></a>00221 <span class="keyword">typedef</span> I key_type;
<a name="l00222"></a>00222 <span class="keyword">typedef</span> T mapped_type;
<a name="l00223"></a>00223 <span class="keyword">typedef</span> <span class="keyword">const</span> value_type &const_reference;
<a name="l00224"></a>00224 <span class="keyword">typedef</span> value_type &reference;
<a name="l00225"></a>00225 <span class="keyword">typedef</span> <span class="keyword">const</span> value_type *const_pointer;
<a name="l00226"></a>00226 <span class="keyword">typedef</span> value_type *pointer;
<a name="l00227"></a>00227 <span class="comment">// Iterators simply are pointers.</span>
<a name="l00228"></a>00228 <span class="keyword">typedef</span> const_pointer const_iterator;
<a name="l00229"></a>00229 <span class="keyword">typedef</span> pointer iterator;
<a name="l00230"></a>00230
<a name="l00231"></a>00231 <span class="keyword">typedef</span> <span class="keyword">const</span> T &data_const_reference;
<a name="l00232"></a>00232 <span class="preprocessor">#ifndef BOOST_UBLAS_STRICT_MAP_ARRAY</span>
<a name="l00233"></a>00233 <span class="preprocessor"></span> <span class="keyword">typedef</span> T &data_reference;
<a name="l00234"></a>00234 <span class="preprocessor">#else</span>
<a name="l00235"></a>00235 <span class="preprocessor"></span> <span class="keyword">typedef</span> sparse_storage_element<map_array> data_reference;
<a name="l00236"></a>00236 <span class="preprocessor">#endif</span>
<a name="l00237"></a>00237 <span class="preprocessor"></span>
<a name="l00238"></a>00238 <span class="comment">// Construction and destruction</span>
<a name="l00239"></a>00239 BOOST_UBLAS_INLINE
<a name="l00240"></a>00240 <a class="code" href="classboost_1_1numeric_1_1ublas_1_1map__array.html">map_array</a> (<span class="keyword">const</span> ALLOC &a = ALLOC()):
<a name="l00241"></a>00241 alloc_(a), capacity_ (0), size_ (0) {
<a name="l00242"></a>00242 data_ = 0;
<a name="l00243"></a>00243 }
<a name="l00244"></a>00244 BOOST_UBLAS_INLINE
<a name="l00245"></a>00245 map_array (<span class="keyword">const</span> map_array &c):
<a name="l00246"></a>00246 alloc_ (c.alloc_), capacity_ (c.size_), size_ (c.size_) {
<a name="l00247"></a>00247 <span class="keywordflow">if</span> (capacity_) {
<a name="l00248"></a>00248 data_ = alloc_.allocate (capacity_);
<a name="l00249"></a>00249 std::uninitialized_copy (data_, data_ + capacity_, c.data_);
<a name="l00250"></a>00250 <span class="comment">// capacity != size_ requires uninitialized_fill (size_ to capacity_)</span>
<a name="l00251"></a>00251 }
<a name="l00252"></a>00252 <span class="keywordflow">else</span>
<a name="l00253"></a>00253 data_ = 0;
<a name="l00254"></a>00254 }
<a name="l00255"></a>00255 BOOST_UBLAS_INLINE
<a name="l00256"></a>00256 ~map_array () {
<a name="l00257"></a>00257 <span class="keywordflow">if</span> (capacity_) {
<a name="l00258"></a>00258 std::for_each (data_, data_ + capacity_, static_destroy);
<a name="l00259"></a>00259 alloc_.deallocate (data_, capacity_);
<a name="l00260"></a>00260 }
<a name="l00261"></a>00261 }
<a name="l00262"></a>00262
<a name="l00263"></a>00263 <span class="keyword">private</span>:
<a name="l00264"></a>00264 <span class="comment">// Resizing - implicitly exposses uninitialized (but default constructed) mapped_type</span>
<a name="l00265"></a>00265 BOOST_UBLAS_INLINE
<a name="l00266"></a>00266 <span class="keywordtype">void</span> resize (size_type size) {
<a name="l00267"></a>00267 BOOST_UBLAS_CHECK (size_ <= capacity_, <a class="code" href="structboost_1_1numeric_1_1ublas_1_1internal__logic.html" title="Expception raised when some interal errors occurs like computations errors, zeros...">internal_logic</a> ());
<a name="l00268"></a>00268 <span class="keywordflow">if</span> (size > capacity_) {
<a name="l00269"></a>00269 <span class="keyword">const</span> size_type capacity = size << 1;
<a name="l00270"></a>00270 BOOST_UBLAS_CHECK (capacity, <a class="code" href="structboost_1_1numeric_1_1ublas_1_1internal__logic.html" title="Expception raised when some interal errors occurs like computations errors, zeros...">internal_logic</a> ());
<a name="l00271"></a>00271 pointer data = alloc_.allocate (capacity);
<a name="l00272"></a>00272 std::uninitialized_copy (data_, data_ + (std::min) (size, size_), data);
<a name="l00273"></a>00273 std::uninitialized_fill (data + (std::min) (size, size_), data + capacity, value_type ());
<a name="l00274"></a>00274
<a name="l00275"></a>00275 <span class="keywordflow">if</span> (capacity_) {
<a name="l00276"></a>00276 std::for_each (data_, data_ + capacity_, static_destroy);
<a name="l00277"></a>00277 alloc_.deallocate (data_, capacity_);
<a name="l00278"></a>00278 }
<a name="l00279"></a>00279 capacity_ = capacity;
<a name="l00280"></a>00280 data_ = data;
<a name="l00281"></a>00281 }
<a name="l00282"></a>00282 size_ = size;
<a name="l00283"></a>00283 BOOST_UBLAS_CHECK (size_ <= capacity_, <a class="code" href="structboost_1_1numeric_1_1ublas_1_1internal__logic.html" title="Expception raised when some interal errors occurs like computations errors, zeros...">internal_logic</a> ());
<a name="l00284"></a>00284 }
<a name="l00285"></a>00285 <span class="keyword">public</span>:
<a name="l00286"></a>00286
<a name="l00287"></a>00287 <span class="comment">// Reserving</span>
<a name="l00288"></a>00288 BOOST_UBLAS_INLINE
<a name="l00289"></a>00289 <span class="keywordtype">void</span> reserve (size_type capacity) {
<a name="l00290"></a>00290 BOOST_UBLAS_CHECK (size_ <= capacity_, <a class="code" href="structboost_1_1numeric_1_1ublas_1_1internal__logic.html" title="Expception raised when some interal errors occurs like computations errors, zeros...">internal_logic</a> ());
<a name="l00291"></a>00291 <span class="comment">// Reduce capacity_ if size_ allows</span>
<a name="l00292"></a>00292 BOOST_UBLAS_CHECK (capacity >= size_, <a class="code" href="structboost_1_1numeric_1_1ublas_1_1bad__size.html">bad_size</a> ());
<a name="l00293"></a>00293 pointer data;
<a name="l00294"></a>00294 <span class="keywordflow">if</span> (capacity) {
<a name="l00295"></a>00295 data = alloc_.allocate (capacity);
<a name="l00296"></a>00296 std::uninitialized_copy (data_, data_ + size_, data);
<a name="l00297"></a>00297 std::uninitialized_fill (data + size_, data + capacity, value_type ());
<a name="l00298"></a>00298 }
<a name="l00299"></a>00299 <span class="keywordflow">else</span>
<a name="l00300"></a>00300 data = 0;
<a name="l00301"></a>00301
<a name="l00302"></a>00302 <span class="keywordflow">if</span> (capacity_) {
<a name="l00303"></a>00303 std::for_each (data_, data_ + capacity_, static_destroy);
<a name="l00304"></a>00304 alloc_.deallocate (data_, capacity_);
<a name="l00305"></a>00305 }
<a name="l00306"></a>00306 capacity_ = capacity;
<a name="l00307"></a>00307 data_ = data;
<a name="l00308"></a>00308 BOOST_UBLAS_CHECK (size_ <= capacity_, <a class="code" href="structboost_1_1numeric_1_1ublas_1_1internal__logic.html" title="Expception raised when some interal errors occurs like computations errors, zeros...">internal_logic</a> ());
<a name="l00309"></a>00309 }
<a name="l00310"></a>00310
<a name="l00311"></a>00311 <span class="comment">// Random Access Container</span>
<a name="l00312"></a>00312 BOOST_UBLAS_INLINE
<a name="l00313"></a>00313 size_type size ()<span class="keyword"> const </span>{
<a name="l00314"></a>00314 <span class="keywordflow">return</span> size_;
<a name="l00315"></a>00315 }
<a name="l00316"></a>00316 BOOST_UBLAS_INLINE
<a name="l00317"></a>00317 size_type capacity ()<span class="keyword"> const </span>{
<a name="l00318"></a>00318 <span class="keywordflow">return</span> capacity_;
<a name="l00319"></a>00319 }
<a name="l00320"></a>00320 BOOST_UBLAS_INLINE
<a name="l00321"></a>00321 size_type max_size ()<span class="keyword"> const </span>{
<a name="l00322"></a>00322 <span class="keywordflow">return</span> 0; <span class="comment">//TODO</span>
<a name="l00323"></a>00323 }
<a name="l00324"></a>00324
<a name="l00325"></a>00325 BOOST_UBLAS_INLINE
<a name="l00326"></a>00326 <span class="keywordtype">bool</span> empty ()<span class="keyword"> const </span>{
<a name="l00327"></a>00327 <span class="keywordflow">return</span> size_ == 0;
<a name="l00328"></a>00328 }
<a name="l00329"></a>00329
<a name="l00330"></a>00330 <span class="comment">// Element access</span>
<a name="l00331"></a>00331 BOOST_UBLAS_INLINE
<a name="l00332"></a>00332 data_reference operator [] (key_type i) {
<a name="l00333"></a>00333 <span class="preprocessor">#ifndef BOOST_UBLAS_STRICT_MAP_ARRAY</span>
<a name="l00334"></a>00334 <span class="preprocessor"></span> pointer it = find (i);
<a name="l00335"></a>00335 <span class="keywordflow">if</span> (it == end ())
<a name="l00336"></a>00336 it = insert (end (), value_type (i, mapped_type (0)));
<a name="l00337"></a>00337 BOOST_UBLAS_CHECK (it != end (), <a class="code" href="structboost_1_1numeric_1_1ublas_1_1internal__logic.html" title="Expception raised when some interal errors occurs like computations errors, zeros...">internal_logic</a> ());
<a name="l00338"></a>00338 <span class="keywordflow">return</span> it->second;
<a name="l00339"></a>00339 <span class="preprocessor">#else</span>
<a name="l00340"></a>00340 <span class="preprocessor"></span> <span class="keywordflow">return</span> data_reference (*<span class="keyword">this</span>, i);
<a name="l00341"></a>00341 <span class="preprocessor">#endif</span>
<a name="l00342"></a>00342 <span class="preprocessor"></span> }
<a name="l00343"></a>00343
<a name="l00344"></a>00344 <span class="comment">// Assignment</span>
<a name="l00345"></a>00345 BOOST_UBLAS_INLINE
<a name="l00346"></a>00346 map_array &operator = (<span class="keyword">const</span> map_array &a) {
<a name="l00347"></a>00347 <span class="keywordflow">if</span> (<span class="keyword">this</span> != &a) {
<a name="l00348"></a>00348 resize (a.size_);
<a name="l00349"></a>00349 std::copy (a.data_, a.data_ + a.size_, data_);
<a name="l00350"></a>00350 }
<a name="l00351"></a>00351 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00352"></a>00352 }
<a name="l00353"></a>00353 BOOST_UBLAS_INLINE
<a name="l00354"></a>00354 map_array &assign_temporary (map_array &a) {
<a name="l00355"></a>00355 swap (a);
<a name="l00356"></a>00356 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00357"></a>00357 }
<a name="l00358"></a>00358
<a name="l00359"></a>00359 <span class="comment">// Swapping</span>
<a name="l00360"></a>00360 BOOST_UBLAS_INLINE
<a name="l00361"></a>00361 <span class="keywordtype">void</span> swap (map_array &a) {
<a name="l00362"></a>00362 <span class="keywordflow">if</span> (<span class="keyword">this</span> != &a) {
<a name="l00363"></a>00363 std::swap (capacity_, a.capacity_);
<a name="l00364"></a>00364 std::swap (data_, a.data_);
<a name="l00365"></a>00365 std::swap (size_, a.size_);
<a name="l00366"></a>00366 }
<a name="l00367"></a>00367 }
<a name="l00368"></a>00368 BOOST_UBLAS_INLINE
<a name="l00369"></a>00369 <span class="keyword">friend</span> <span class="keywordtype">void</span> swap (map_array &a1, map_array &a2) {
<a name="l00370"></a>00370 a1.swap (a2);
<a name="l00371"></a>00371 }
<a name="l00372"></a>00372
<a name="l00373"></a>00373 <span class="comment">// Element insertion and deletion</span>
<a name="l00374"></a>00374
<a name="l00375"></a>00375 <span class="comment">// From Back Insertion Sequence concept</span>
<a name="l00376"></a>00376 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. </span>
<a name="l00377"></a>00377 iterator push_back (iterator it, <span class="keyword">const</span> value_type &p) {
<a name="l00378"></a>00378 <span class="keywordflow">if</span> (size () == 0 || (it = end () - 1)->first < p.first) {
<a name="l00379"></a>00379 resize (size () + 1);
<a name="l00380"></a>00380 *(it = end () - 1) = p;
<a name="l00381"></a>00381 <span class="keywordflow">return</span> it;
<a name="l00382"></a>00382 }
<a name="l00383"></a>00383 <a class="code" href="structboost_1_1numeric_1_1ublas_1_1external__logic.html">external_logic</a> ().raise ();
<a name="l00384"></a>00384 <span class="keywordflow">return</span> it;
<a name="l00385"></a>00385 }
<a name="l00386"></a>00386 <span class="comment">// Form Unique Associative Container concept</span>
<a name="l00387"></a>00387 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. </span>
<a name="l00388"></a>00388 std::pair<iterator,bool> insert (<span class="keyword">const</span> value_type &p) {
<a name="l00389"></a>00389 iterator it = detail::lower_bound (begin (), end (), p, <a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1less__pair.html">detail::less_pair<value_type></a> ());
<a name="l00390"></a>00390 <span class="keywordflow">if</span> (it != end () && it->first == p.first)
<a name="l00391"></a>00391 <span class="keywordflow">return</span> std::make_pair (it, <span class="keyword">false</span>);
<a name="l00392"></a>00392 difference_type n = it - begin ();
<a name="l00393"></a>00393 resize (size () + 1);
<a name="l00394"></a>00394 it = begin () + n; <span class="comment">// allow for invalidation</span>
<a name="l00395"></a>00395 std::copy_backward (it, end () - 1, end ());
<a name="l00396"></a>00396 *it = p;
<a name="l00397"></a>00397 <span class="keywordflow">return</span> std::make_pair (it, <span class="keyword">true</span>);
<a name="l00398"></a>00398 }
<a name="l00399"></a>00399 <span class="comment">// Form Sorted Associative Container concept</span>
<a name="l00400"></a>00400 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. </span>
<a name="l00401"></a>00401 iterator insert (iterator hint, <span class="keyword">const</span> value_type &p) {
<a name="l00402"></a>00402 <span class="keywordflow">return</span> insert (p).first;
<a name="l00403"></a>00403 }
<a name="l00404"></a>00404 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. </span>
<a name="l00405"></a>00405 <span class="keywordtype">void</span> erase (iterator it) {
<a name="l00406"></a>00406 BOOST_UBLAS_CHECK (begin () <= it && it < end (), <a class="code" href="structboost_1_1numeric_1_1ublas_1_1bad__index.html">bad_index</a> ());
<a name="l00407"></a>00407 std::copy (it + 1, end (), it);
<a name="l00408"></a>00408 resize (size () - 1);
<a name="l00409"></a>00409 }
<a name="l00410"></a>00410 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. </span>
<a name="l00411"></a>00411 <span class="keywordtype">void</span> erase (iterator it1, iterator it2) {
<a name="l00412"></a>00412 <span class="keywordflow">if</span> (it1 == it2) <span class="keywordflow">return</span> <span class="comment">/* nothing to erase */</span>;
<a name="l00413"></a>00413 BOOST_UBLAS_CHECK (begin () <= it1 && it1 < it2 && it2 <= end (), <a class="code" href="structboost_1_1numeric_1_1ublas_1_1bad__index.html">bad_index</a> ());
<a name="l00414"></a>00414 std::copy (it2, end (), it1);
<a name="l00415"></a>00415 resize (size () - (it2 - it1));
<a name="l00416"></a>00416 }
<a name="l00417"></a>00417 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. </span>
<a name="l00418"></a>00418 <span class="keywordtype">void</span> clear () {
<a name="l00419"></a>00419 resize (0);
<a name="l00420"></a>00420 }
<a name="l00421"></a>00421
<a name="l00422"></a>00422 <span class="comment">// Element lookup</span>
<a name="l00423"></a>00423 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. </span>
<a name="l00424"></a>00424 const_iterator find (key_type i)<span class="keyword"> const </span>{
<a name="l00425"></a>00425 const_iterator it (detail::lower_bound (begin (), end (), value_type (i, mapped_type (0)), <a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1less__pair.html">detail::less_pair<value_type></a> ()));
<a name="l00426"></a>00426 <span class="keywordflow">if</span> (it == end () || it->first != i)
<a name="l00427"></a>00427 it = end ();
<a name="l00428"></a>00428 <span class="keywordflow">return</span> it;
<a name="l00429"></a>00429 }
<a name="l00430"></a>00430 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. </span>
<a name="l00431"></a>00431 iterator find (key_type i) {
<a name="l00432"></a>00432 iterator it (detail::lower_bound (begin (), end (), value_type (i, mapped_type (0)), <a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1less__pair.html">detail::less_pair<value_type></a> ()));
<a name="l00433"></a>00433 <span class="keywordflow">if</span> (it == end () || it->first != i)
<a name="l00434"></a>00434 it = end ();
<a name="l00435"></a>00435 <span class="keywordflow">return</span> it;
<a name="l00436"></a>00436 }
<a name="l00437"></a>00437 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. </span>
<a name="l00438"></a>00438 const_iterator lower_bound (key_type i)<span class="keyword"> const </span>{
<a name="l00439"></a>00439 <span class="keywordflow">return</span> detail::lower_bound (begin (), end (), value_type (i, mapped_type (0)), <a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1less__pair.html">detail::less_pair<value_type></a> ());
<a name="l00440"></a>00440 }
<a name="l00441"></a>00441 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. </span>
<a name="l00442"></a>00442 iterator lower_bound (key_type i) {
<a name="l00443"></a>00443 <span class="keywordflow">return</span> detail::lower_bound (begin (), end (), value_type (i, mapped_type (0)), <a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1less__pair.html">detail::less_pair<value_type></a> ());
<a name="l00444"></a>00444 }
<a name="l00445"></a>00445
<a name="l00446"></a>00446 BOOST_UBLAS_INLINE
<a name="l00447"></a>00447 const_iterator begin ()<span class="keyword"> const </span>{
<a name="l00448"></a>00448 <span class="keywordflow">return</span> data_;
<a name="l00449"></a>00449 }
<a name="l00450"></a>00450 BOOST_UBLAS_INLINE
<a name="l00451"></a>00451 const_iterator end ()<span class="keyword"> const </span>{
<a name="l00452"></a>00452 <span class="keywordflow">return</span> data_ + size_;
<a name="l00453"></a>00453 }
<a name="l00454"></a>00454
<a name="l00455"></a>00455 BOOST_UBLAS_INLINE
<a name="l00456"></a>00456 iterator begin () {
<a name="l00457"></a>00457 <span class="keywordflow">return</span> data_;
<a name="l00458"></a>00458 }
<a name="l00459"></a>00459 BOOST_UBLAS_INLINE
<a name="l00460"></a>00460 iterator end () {
<a name="l00461"></a>00461 <span class="keywordflow">return</span> data_ + size_;
<a name="l00462"></a>00462 }
<a name="l00463"></a>00463
<a name="l00464"></a>00464 <span class="comment">// Reverse iterators</span>
<a name="l00465"></a>00465 <span class="keyword">typedef</span> std::reverse_iterator<const_iterator> const_reverse_iterator;
<a name="l00466"></a>00466 <span class="keyword">typedef</span> std::reverse_iterator<iterator> reverse_iterator;
<a name="l00467"></a>00467
<a name="l00468"></a>00468 BOOST_UBLAS_INLINE
<a name="l00469"></a>00469 const_reverse_iterator rbegin ()<span class="keyword"> const </span>{
<a name="l00470"></a>00470 <span class="keywordflow">return</span> const_reverse_iterator (end ());
<a name="l00471"></a>00471 }
<a name="l00472"></a>00472 BOOST_UBLAS_INLINE
<a name="l00473"></a>00473 const_reverse_iterator rend ()<span class="keyword"> const </span>{
<a name="l00474"></a>00474 <span class="keywordflow">return</span> const_reverse_iterator (begin ());
<a name="l00475"></a>00475 }
<a name="l00476"></a>00476 BOOST_UBLAS_INLINE
<a name="l00477"></a>00477 reverse_iterator rbegin () {
<a name="l00478"></a>00478 <span class="keywordflow">return</span> reverse_iterator (end ());
<a name="l00479"></a>00479 }
<a name="l00480"></a>00480 BOOST_UBLAS_INLINE
<a name="l00481"></a>00481 reverse_iterator rend () {
<a name="l00482"></a>00482 <span class="keywordflow">return</span> reverse_iterator (begin ());
<a name="l00483"></a>00483 }
<a name="l00484"></a>00484
<a name="l00485"></a>00485 <span class="comment">// Allocator</span>
<a name="l00486"></a>00486 allocator_type get_allocator () {
<a name="l00487"></a>00487 <span class="keywordflow">return</span> alloc_;
<a name="l00488"></a>00488 }
<a name="l00489"></a>00489
<a name="l00490"></a>00490 <span class="comment">// Serialization</span>
<a name="l00491"></a>00491 <span class="keyword">template</span><<span class="keyword">class</span> Archive>
<a name="l00492"></a>00492 <span class="keywordtype">void</span> serialize(Archive & ar, <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <span class="comment">/* file_version */</span>){
<a name="l00493"></a>00493 serialization::collection_size_type s (size_);
<a name="l00494"></a>00494 ar & serialization::make_nvp(<span class="stringliteral">"size"</span>,s);
<a name="l00495"></a>00495 <span class="keywordflow">if</span> (Archive::is_loading::value) {
<a name="l00496"></a>00496 resize(s);
<a name="l00497"></a>00497 }
<a name="l00498"></a>00498 ar & serialization::make_array(data_, s);
<a name="l00499"></a>00499 }
<a name="l00500"></a>00500
<a name="l00501"></a>00501 <span class="keyword">private</span>:
<a name="l00502"></a>00502 <span class="comment">// Provide destroy as a non member function</span>
<a name="l00503"></a>00503 BOOST_UBLAS_INLINE
<a name="l00504"></a>00504 <span class="keyword">static</span> <span class="keywordtype">void</span> static_destroy (reference p) {
<a name="l00505"></a>00505 (&p) -> ~value_type ();
<a name="l00506"></a>00506 }
<a name="l00507"></a>00507 ALLOC alloc_;
<a name="l00508"></a>00508 size_type capacity_;
<a name="l00509"></a>00509 pointer data_;
<a name="l00510"></a>00510 size_type size_;
<a name="l00511"></a>00511 };
<a name="l00512"></a>00512
<a name="l00513"></a>00513
<a name="l00514"></a>00514 <span class="keyword">namespace </span>detail {
<a name="l00515"></a>00515 <span class="keyword">template</span><<span class="keyword">class</span> A, <span class="keyword">class</span> T>
<a name="l00516"></a><a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1map__traits.html">00516</a> <span class="keyword">struct </span><a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1map__traits.html">map_traits</a> {
<a name="l00517"></a>00517 <span class="keyword">typedef</span> <span class="keyword">typename</span> A::mapped_type &reference;
<a name="l00518"></a>00518 };
<a name="l00519"></a>00519 <span class="keyword">template</span><<span class="keyword">class</span> I, <span class="keyword">class</span> T, <span class="keyword">class</span> ALLOC>
<a name="l00520"></a><a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1map__traits_3_01map__array_3_01_i_00_01_t_00_01_a_l_l_o_c_01_4_00_01_t_01_4.html">00520</a> <span class="keyword">struct </span><a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1map__traits.html">map_traits</a><<a class="code" href="classboost_1_1numeric_1_1ublas_1_1map__array.html">map_array</a><I, T, ALLOC>, T > {
<a name="l00521"></a>00521 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="classboost_1_1numeric_1_1ublas_1_1map__array.html">map_array<I, T, ALLOC>::data_reference</a> reference;
<a name="l00522"></a>00522 };
<a name="l00523"></a>00523
<a name="l00524"></a>00524 <span class="comment">// reserve helpers for map_array and generic maps</span>
<a name="l00525"></a>00525 <span class="comment">// ISSUE should be in map_traits but want to use on all compilers</span>
<a name="l00526"></a>00526
<a name="l00527"></a>00527 <span class="keyword">template</span><<span class="keyword">class</span> M>
<a name="l00528"></a>00528 BOOST_UBLAS_INLINE
<a name="l00529"></a>00529 <span class="keywordtype">void</span> map_reserve (M &<span class="comment">/* m */</span>, <span class="keyword">typename</span> M::size_type <span class="comment">/* capacity */</span>) {
<a name="l00530"></a>00530 }
<a name="l00531"></a>00531 <span class="keyword">template</span><<span class="keyword">class</span> I, <span class="keyword">class</span> T, <span class="keyword">class</span> ALLOC>
<a name="l00532"></a>00532 BOOST_UBLAS_INLINE
<a name="l00533"></a>00533 <span class="keywordtype">void</span> map_reserve (<a class="code" href="classboost_1_1numeric_1_1ublas_1_1map__array.html">map_array<I, T, ALLOC></a> &m, <span class="keyword">typename</span> <a class="code" href="classboost_1_1numeric_1_1ublas_1_1map__array.html">map_array<I, T, ALLOC>::size_type</a> capacity) {
<a name="l00534"></a>00534 m.reserve (capacity);
<a name="l00535"></a>00535 }
<a name="l00536"></a>00536
<a name="l00537"></a>00537 <span class="keyword">template</span><<span class="keyword">class</span> M>
<a name="l00538"></a><a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1map__capacity__traits.html">00538</a> <span class="keyword">struct </span><a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1map__capacity__traits.html">map_capacity_traits</a> {
<a name="l00539"></a>00539 <span class="keyword">typedef</span> <span class="keyword">typename</span> M::size_type type ;
<a name="l00540"></a>00540 type operator() ( M <span class="keyword">const</span>& m )<span class="keyword"> const </span>{
<a name="l00541"></a>00541 <span class="keywordflow">return</span> m.size ();
<a name="l00542"></a>00542 }
<a name="l00543"></a>00543 } ;
<a name="l00544"></a>00544
<a name="l00545"></a>00545 <span class="keyword">template</span><<span class="keyword">class</span> I, <span class="keyword">class</span> T, <span class="keyword">class</span> ALLOC>
<a name="l00546"></a><a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1map__capacity__traits_3_01map__array_3_01_i_00_01_t_00_01_a_l_l_o_c_01_4_01_4.html">00546</a> <span class="keyword">struct </span><a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1map__capacity__traits.html">map_capacity_traits</a>< <a class="code" href="classboost_1_1numeric_1_1ublas_1_1map__array.html">map_array</a><I, T, ALLOC> > {
<a name="l00547"></a>00547 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="classboost_1_1numeric_1_1ublas_1_1map__array.html">map_array<I, T, ALLOC>::size_type</a> type ;
<a name="l00548"></a>00548 type operator() ( <a class="code" href="classboost_1_1numeric_1_1ublas_1_1map__array.html">map_array<I, T, ALLOC></a> <span class="keyword">const</span>& m )<span class="keyword"> const </span>{
<a name="l00549"></a>00549 <span class="keywordflow">return</span> m.capacity ();
<a name="l00550"></a>00550 }
<a name="l00551"></a>00551 } ;
<a name="l00552"></a>00552
<a name="l00553"></a>00553 <span class="keyword">template</span><<span class="keyword">class</span> M>
<a name="l00554"></a>00554 BOOST_UBLAS_INLINE
<a name="l00555"></a>00555 <span class="keyword">typename</span> <a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1map__capacity__traits.html">map_capacity_traits<M>::type</a> map_capacity (M <span class="keyword">const</span>& m) {
<a name="l00556"></a>00556 <span class="keywordflow">return</span> <a class="code" href="structboost_1_1numeric_1_1ublas_1_1detail_1_1map__capacity__traits.html">map_capacity_traits<M></a>() ( m );
<a name="l00557"></a>00557 }
<a name="l00558"></a>00558 }
<a name="l00559"></a>00559
<a name="l00560"></a>00560 }}}
<a name="l00561"></a>00561
<a name="l00562"></a>00562 <span class="preprocessor">#endif</span>
</pre></div></div>
<hr size="1"/><address style="text-align: right;"><small>Generated on Sun Jul 4 20:30:58 2010 for ublas by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.1 </small></address>
</body>
</html>
