mirror of
https://github.com/boostorg/ublas.git
synced 2026-02-22 15:52:18 +00:00
727 lines
83 KiB
HTML
727 lines
83 KiB
HTML
<!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>Boost.uBlas: vector_assign.hpp Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript">
|
|
$(document).ready(initResizable);
|
|
</script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body onload='searchBox.OnSelectItem(0);'>
|
|
<!-- Generated by Doxygen 1.7.3 -->
|
|
<script type="text/javascript"><!--
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
--></script>
|
|
<script type="text/javascript">
|
|
function hasClass(ele,cls) {
|
|
return ele.className.match(new RegExp('(\\s|^)'+cls+'(\\s|$)'));
|
|
}
|
|
|
|
function addClass(ele,cls) {
|
|
if (!this.hasClass(ele,cls)) ele.className += " "+cls;
|
|
}
|
|
|
|
function removeClass(ele,cls) {
|
|
if (hasClass(ele,cls)) {
|
|
var reg = new RegExp('(\\s|^)'+cls+'(\\s|$)');
|
|
ele.className=ele.className.replace(reg,' ');
|
|
}
|
|
}
|
|
|
|
function toggleVisibility(linkObj) {
|
|
var base = linkObj.getAttribute('id');
|
|
var summary = document.getElementById(base + '-summary');
|
|
var content = document.getElementById(base + '-content');
|
|
var trigger = document.getElementById(base + '-trigger');
|
|
if ( hasClass(linkObj,'closed') ) {
|
|
summary.style.display = 'none';
|
|
content.style.display = 'block';
|
|
trigger.src = 'open.png';
|
|
removeClass(linkObj,'closed');
|
|
addClass(linkObj,'opened');
|
|
} else if ( hasClass(linkObj,'opened') ) {
|
|
summary.style.display = 'block';
|
|
content.style.display = 'none';
|
|
trigger.src = 'closed.png';
|
|
removeClass(linkObj,'opened');
|
|
addClass(linkObj,'closed');
|
|
}
|
|
return false;
|
|
}
|
|
</script>
|
|
<div id="top">
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="logo boost ublas.png"></td>
|
|
<td style="padding-left: 0.5em;">
|
|
<div id="projectname">Boost.uBlas <span id="projectnumber">1.49</span></div>
|
|
<div id="projectbrief">Linear Algebra in C++: matrices, vectors and numeric algorithms</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="index.html"><span>Main Page</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">
|
|
<img id="MSearchSelect" src="search/mag_sel.png"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
alt=""/>
|
|
<input type="text" id="MSearchField" value="Search" accesskey="S"
|
|
onfocus="searchBox.OnSearchFieldFocus(true)"
|
|
onblur="searchBox.OnSearchFieldFocus(false)"
|
|
onkeyup="searchBox.OnSearchFieldChange(event)"/>
|
|
</span><span class="right">
|
|
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
|
|
</span>
|
|
</div>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
<div id="navrow2" 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>
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
initNavTree('a00642.html','');
|
|
</script>
|
|
<div id="doc-content">
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<h1>vector_assign.hpp</h1> </div>
|
|
</div>
|
|
<div class="contents">
|
|
<a href="a00642.html">Go to the documentation of this file.</a><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_VECTOR_ASSIGN_</span>
|
|
<a name="l00014"></a>00014 <span class="preprocessor"></span><span class="preprocessor">#define _BOOST_UBLAS_VECTOR_ASSIGN_</span>
|
|
<a name="l00015"></a>00015 <span class="preprocessor"></span>
|
|
<a name="l00016"></a>00016 <span class="preprocessor">#include <boost/numeric/ublas/functional.hpp></span> <span class="comment">// scalar_assign</span>
|
|
<a name="l00017"></a>00017 <span class="comment">// Required for make_conformant storage</span>
|
|
<a name="l00018"></a>00018 <span class="preprocessor">#include <vector></span>
|
|
<a name="l00019"></a>00019
|
|
<a name="l00020"></a>00020 <span class="comment">// Iterators based on ideas of Jeremy Siek</span>
|
|
<a name="l00021"></a>00021
|
|
<a name="l00022"></a>00022 <span class="keyword">namespace </span>boost { <span class="keyword">namespace </span>numeric { <span class="keyword">namespace </span>ublas {
|
|
<a name="l00023"></a>00023 <span class="keyword">namespace </span>detail {
|
|
<a name="l00024"></a>00024
|
|
<a name="l00025"></a>00025 <span class="comment">// Weak equality check - useful to compare equality two arbitary vector expression results.</span>
|
|
<a name="l00026"></a>00026 <span class="comment">// Since the actual expressions are unknown, we check for and arbitary error bound</span>
|
|
<a name="l00027"></a>00027 <span class="comment">// on the relative error.</span>
|
|
<a name="l00028"></a>00028 <span class="comment">// For a linear expression the infinity norm makes sense as we do not know how the elements will be</span>
|
|
<a name="l00029"></a>00029 <span class="comment">// combined in the expression. False positive results are inevitable for arbirary expressions!</span>
|
|
<a name="l00030"></a>00030 <span class="keyword">template</span><<span class="keyword">class</span> E1, <span class="keyword">class</span> E2, <span class="keyword">class</span> S>
|
|
<a name="l00031"></a>00031 <a class="code" href="a00603.html#a578c14139742374e9a04e5afcb6cd24c">BOOST_UBLAS_INLINE</a>
|
|
<a name="l00032"></a><a class="code" href="a00653.html#ab4511aea4026876301505ca0a1a27fe5">00032</a> <span class="keywordtype">bool</span> <a class="code" href="a00653.html#a1b4ae804e82da2f53176751b120b2005">equals</a> (<span class="keyword">const</span> <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E1></a> &e1, <span class="keyword">const</span> <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E2></a> &e2, S epsilon, S min_norm) {
|
|
<a name="l00033"></a>00033 <span class="keywordflow">return</span> <a class="code" href="a00595.html#a4ec479acd5e441d5b61ce20c8d13e8ac">norm_inf</a> (e1 - e2) < epsilon *
|
|
<a name="l00034"></a>00034 std::max<S> (std::max<S> (<a class="code" href="a00595.html#a4ec479acd5e441d5b61ce20c8d13e8ac">norm_inf</a> (e1), <a class="code" href="a00595.html#a4ec479acd5e441d5b61ce20c8d13e8ac">norm_inf</a> (e2)), min_norm);
|
|
<a name="l00035"></a>00035 }
|
|
<a name="l00036"></a>00036
|
|
<a name="l00037"></a>00037 <span class="keyword">template</span><<span class="keyword">class</span> E1, <span class="keyword">class</span> E2>
|
|
<a name="l00038"></a>00038 <a class="code" href="a00603.html#a578c14139742374e9a04e5afcb6cd24c">BOOST_UBLAS_INLINE</a>
|
|
<a name="l00039"></a><a class="code" href="a00653.html#aa0c567d79d28ff62e900036160e32284">00039</a> <span class="keywordtype">bool</span> <a class="code" href="a00653.html#a43a1eab42456d66c868af16c340e8246">expression_type_check</a> (<span class="keyword">const</span> <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E1></a> &e1, <span class="keyword">const</span> <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E2></a> &e2) {
|
|
<a name="l00040"></a>00040 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00465.html">type_traits</a><<span class="keyword">typename</span> <a class="code" href="a00364.html">promote_traits</a><<span class="keyword">typename</span> E1::value_type,
|
|
<a name="l00041"></a>00041 <span class="keyword">typename</span> E2::value_type>::promote_type>::real_type real_type;
|
|
<a name="l00042"></a>00042 <span class="keywordflow">return</span> <a class="code" href="a00653.html#a1b4ae804e82da2f53176751b120b2005">equals</a> (e1, e2, <a class="code" href="a00603.html#afa88d2d3bb1c8ca6365f7d0953a067d8">BOOST_UBLAS_TYPE_CHECK_EPSILON</a>, <a class="code" href="a00603.html#ada9c3113ffcce841cb3d16e3cf8c60c9">BOOST_UBLAS_TYPE_CHECK_MIN</a>);
|
|
<a name="l00043"></a>00043 }
|
|
<a name="l00044"></a>00044
|
|
<a name="l00045"></a>00045
|
|
<a name="l00046"></a>00046 <span class="comment">// Make sparse proxies conformant</span>
|
|
<a name="l00047"></a>00047 <span class="keyword">template</span><<span class="keyword">class</span> V, <span class="keyword">class</span> E>
|
|
<a name="l00048"></a>00048 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.</span>
|
|
<a name="l00049"></a><a class="code" href="a00653.html#af9bdbcdb6d9c52e924fc14f9c065dea8">00049</a> <span class="keywordtype">void</span> <a class="code" href="a00653.html#af86e444b5972e9b0ee8afbbcd533bd7a">make_conformant</a> (V &v, <span class="keyword">const</span> <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E></a> &e) {
|
|
<a name="l00050"></a>00050 <a class="code" href="a00610.html#aada705f9d1fd36fc1af3b703217ec69e">BOOST_UBLAS_CHECK</a> (v.size () == e ().size (), <a class="code" href="a00016.html">bad_size</a> ());
|
|
<a name="l00051"></a>00051 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::size_type size_type;
|
|
<a name="l00052"></a>00052 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::difference_type difference_type;
|
|
<a name="l00053"></a>00053 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::value_type value_type;
|
|
<a name="l00054"></a>00054 <span class="comment">// FIXME unbounded_array with push_back maybe better</span>
|
|
<a name="l00055"></a>00055 std::vector<size_type> <a class="code" href="a00655.html#a483aef59b0403ecbfbcab4d0598907d2">index</a>;
|
|
<a name="l00056"></a>00056 <span class="keyword">typename</span> V::iterator it (v.begin ());
|
|
<a name="l00057"></a>00057 <span class="keyword">typename</span> V::iterator it_end (v.end ());
|
|
<a name="l00058"></a>00058 <span class="keyword">typename</span> E::const_iterator ite (e ().<a class="code" href="a00595.html#ae2297dd9051333c2ec1d0f63175f66fe" title="An iterator to the first element of the given vector expression.">begin</a> ());
|
|
<a name="l00059"></a>00059 <span class="keyword">typename</span> E::const_iterator ite_end (e ().<a class="code" href="a00595.html#a5e8a7fc1352cd3e148064608dad9f38d" title="An iterator to the last element of the given vector expression.">end</a> ());
|
|
<a name="l00060"></a>00060 <span class="keywordflow">if</span> (it != it_end && ite != ite_end) {
|
|
<a name="l00061"></a>00061 size_type it_index = it.index (), ite_index = ite.index ();
|
|
<a name="l00062"></a>00062 <span class="keywordflow">while</span> (<span class="keyword">true</span>) {
|
|
<a name="l00063"></a>00063 difference_type compare = it_index - ite_index;
|
|
<a name="l00064"></a>00064 <span class="keywordflow">if</span> (compare == 0) {
|
|
<a name="l00065"></a>00065 ++ it, ++ ite;
|
|
<a name="l00066"></a>00066 <span class="keywordflow">if</span> (it != it_end && ite != ite_end) {
|
|
<a name="l00067"></a>00067 it_index = it.index ();
|
|
<a name="l00068"></a>00068 ite_index = ite.index ();
|
|
<a name="l00069"></a>00069 } <span class="keywordflow">else</span>
|
|
<a name="l00070"></a>00070 <span class="keywordflow">break</span>;
|
|
<a name="l00071"></a>00071 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (compare < 0) {
|
|
<a name="l00072"></a>00072 <a class="code" href="a00595.html#a00e524ed262cdf2bef30737b1ad05b3e">increment</a> (it, it_end, - compare);
|
|
<a name="l00073"></a>00073 <span class="keywordflow">if</span> (it != it_end)
|
|
<a name="l00074"></a>00074 it_index = it.index ();
|
|
<a name="l00075"></a>00075 <span class="keywordflow">else</span>
|
|
<a name="l00076"></a>00076 <span class="keywordflow">break</span>;
|
|
<a name="l00077"></a>00077 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (compare > 0) {
|
|
<a name="l00078"></a>00078 <span class="keywordflow">if</span> (*ite != value_type<span class="comment">/*zero*/</span>())
|
|
<a name="l00079"></a>00079 index.push_back (ite.index ());
|
|
<a name="l00080"></a>00080 ++ ite;
|
|
<a name="l00081"></a>00081 <span class="keywordflow">if</span> (ite != ite_end)
|
|
<a name="l00082"></a>00082 ite_index = ite.index ();
|
|
<a name="l00083"></a>00083 <span class="keywordflow">else</span>
|
|
<a name="l00084"></a>00084 <span class="keywordflow">break</span>;
|
|
<a name="l00085"></a>00085 }
|
|
<a name="l00086"></a>00086 }
|
|
<a name="l00087"></a>00087 }
|
|
<a name="l00088"></a>00088
|
|
<a name="l00089"></a>00089 <span class="keywordflow">while</span> (ite != ite_end) {
|
|
<a name="l00090"></a>00090 <span class="keywordflow">if</span> (*ite != value_type<span class="comment">/*zero*/</span>())
|
|
<a name="l00091"></a>00091 index.push_back (ite.index ());
|
|
<a name="l00092"></a>00092 ++ ite;
|
|
<a name="l00093"></a>00093 }
|
|
<a name="l00094"></a>00094 <span class="keywordflow">for</span> (size_type k = 0; k < index.size (); ++ k)
|
|
<a name="l00095"></a>00095 v (index [k]) = value_type<span class="comment">/*zero*/</span>();
|
|
<a name="l00096"></a>00096 }
|
|
<a name="l00097"></a>00097
|
|
<a name="l00098"></a>00098 }<span class="comment">//namespace detail</span>
|
|
<a name="l00099"></a>00099
|
|
<a name="l00100"></a>00100
|
|
<a name="l00101"></a>00101 <span class="comment">// Explicitly iterating</span>
|
|
<a name="l00102"></a>00102 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>T>
|
|
<a name="l00103"></a>00103 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.</span>
|
|
<a name="l00104"></a><a class="code" href="a00595.html#a7db5827dcae21ba9570361f816c097f8">00104</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#a7db5827dcae21ba9570361f816c097f8">iterating_vector_assign_scalar</a> (V &v, <span class="keyword">const</span> T &t) {
|
|
<a name="l00105"></a>00105 <span class="keyword">typedef</span> F<typename V::iterator::reference, T> functor_type;
|
|
<a name="l00106"></a>00106 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::difference_type difference_type;
|
|
<a name="l00107"></a>00107 difference_type <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> (v.size ());
|
|
<a name="l00108"></a>00108 <span class="keyword">typename</span> V::iterator it (v.begin ());
|
|
<a name="l00109"></a>00109 <a class="code" href="a00610.html#aada705f9d1fd36fc1af3b703217ec69e">BOOST_UBLAS_CHECK</a> (v.end () - it == <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>, <a class="code" href="a00016.html">bad_size</a> ());
|
|
<a name="l00110"></a>00110 <span class="preprocessor">#ifndef BOOST_UBLAS_USE_DUFF_DEVICE</span>
|
|
<a name="l00111"></a>00111 <span class="preprocessor"></span> <span class="keywordflow">while</span> (-- <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> >= 0)
|
|
<a name="l00112"></a>00112 functor_type::apply (*it, t), ++ it;
|
|
<a name="l00113"></a>00113 <span class="preprocessor">#else</span>
|
|
<a name="l00114"></a>00114 <span class="preprocessor"></span> <a class="code" href="a00608.html#acb571ebc7eb721ca2a32e3447a436e23">DD</a> (<a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>, 4, r, (functor_type::apply (*it, t), ++ it));
|
|
<a name="l00115"></a>00115 <span class="preprocessor">#endif</span>
|
|
<a name="l00116"></a>00116 <span class="preprocessor"></span> }
|
|
<a name="l00117"></a>00117 <span class="comment">// Explicitly case</span>
|
|
<a name="l00118"></a>00118 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>T>
|
|
<a name="l00119"></a>00119 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.</span>
|
|
<a name="l00120"></a><a class="code" href="a00595.html#a28e9a6ff7b98dab424ef800a00a2fcdd">00120</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#a28e9a6ff7b98dab424ef800a00a2fcdd">indexing_vector_assign_scalar</a> (V &v, <span class="keyword">const</span> T &t) {
|
|
<a name="l00121"></a>00121 <span class="keyword">typedef</span> F<typename V::reference, T> functor_type;
|
|
<a name="l00122"></a>00122 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::size_type size_type;
|
|
<a name="l00123"></a>00123 size_type <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> (v.size ());
|
|
<a name="l00124"></a>00124 <span class="preprocessor">#ifndef BOOST_UBLAS_USE_DUFF_DEVICE</span>
|
|
<a name="l00125"></a>00125 <span class="preprocessor"></span> <span class="keywordflow">for</span> (size_type i = 0; i < <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>; ++ i)
|
|
<a name="l00126"></a>00126 functor_type::apply (v (i), t);
|
|
<a name="l00127"></a>00127 <span class="preprocessor">#else</span>
|
|
<a name="l00128"></a>00128 <span class="preprocessor"></span> size_type i (0);
|
|
<a name="l00129"></a>00129 <a class="code" href="a00608.html#acb571ebc7eb721ca2a32e3447a436e23">DD</a> (size, 4, r, (functor_type::apply (v (i), t), ++ i));
|
|
<a name="l00130"></a>00130 <span class="preprocessor">#endif</span>
|
|
<a name="l00131"></a>00131 <span class="preprocessor"></span> }
|
|
<a name="l00132"></a>00132
|
|
<a name="l00133"></a>00133 <span class="comment">// Dense (proxy) case</span>
|
|
<a name="l00134"></a>00134 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>T>
|
|
<a name="l00135"></a>00135 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.</span>
|
|
<a name="l00136"></a><a class="code" href="a00595.html#a74f299d4a3b0b910e694bf9c2e84b6c5">00136</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#a74f299d4a3b0b910e694bf9c2e84b6c5">vector_assign_scalar</a> (V &v, <span class="keyword">const</span> T &t, <a class="code" href="a00081.html">dense_proxy_tag</a>) {
|
|
<a name="l00137"></a>00137 <span class="preprocessor">#ifdef BOOST_UBLAS_USE_INDEXING</span>
|
|
<a name="l00138"></a>00138 <span class="preprocessor"></span> indexing_vector_assign_scalar<F> (v, t);
|
|
<a name="l00139"></a>00139 <span class="preprocessor">#elif BOOST_UBLAS_USE_ITERATING</span>
|
|
<a name="l00140"></a>00140 <span class="preprocessor"></span> iterating_vector_assign_scalar<F> (v, t);
|
|
<a name="l00141"></a>00141 <span class="preprocessor">#else</span>
|
|
<a name="l00142"></a>00142 <span class="preprocessor"></span> <span class="keyword">typedef</span> <span class="keyword">typename</span> V::size_type size_type;
|
|
<a name="l00143"></a>00143 size_type <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> (v.size ());
|
|
<a name="l00144"></a>00144 <span class="keywordflow">if</span> (<a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> >= BOOST_UBLAS_ITERATOR_THRESHOLD)
|
|
<a name="l00145"></a>00145 iterating_vector_assign_scalar<F> (v, t);
|
|
<a name="l00146"></a>00146 <span class="keywordflow">else</span>
|
|
<a name="l00147"></a>00147 indexing_vector_assign_scalar<F> (v, t);
|
|
<a name="l00148"></a>00148 <span class="preprocessor">#endif</span>
|
|
<a name="l00149"></a>00149 <span class="preprocessor"></span> }
|
|
<a name="l00150"></a>00150 <span class="comment">// Packed (proxy) case</span>
|
|
<a name="l00151"></a>00151 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>T>
|
|
<a name="l00152"></a>00152 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.</span>
|
|
<a name="l00153"></a><a class="code" href="a00595.html#ae692bf35a0375b24c77a99eda0aafb89">00153</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#a74f299d4a3b0b910e694bf9c2e84b6c5">vector_assign_scalar</a> (V &v, <span class="keyword">const</span> T &t, <a class="code" href="a00360.html">packed_proxy_tag</a>) {
|
|
<a name="l00154"></a>00154 <span class="keyword">typedef</span> F<typename V::iterator::reference, T> functor_type;
|
|
<a name="l00155"></a>00155 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::difference_type difference_type;
|
|
<a name="l00156"></a>00156 <span class="keyword">typename</span> V::iterator it (v.begin ());
|
|
<a name="l00157"></a>00157 difference_type <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> (v.end () - it);
|
|
<a name="l00158"></a>00158 <span class="keywordflow">while</span> (-- <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> >= 0)
|
|
<a name="l00159"></a>00159 functor_type::apply (*it, t), ++ it;
|
|
<a name="l00160"></a>00160 }
|
|
<a name="l00161"></a>00161 <span class="comment">// Sparse (proxy) case</span>
|
|
<a name="l00162"></a>00162 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>T>
|
|
<a name="l00163"></a>00163 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.</span>
|
|
<a name="l00164"></a><a class="code" href="a00595.html#a4fd543032380a3eeb0560b5311501fc9">00164</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#a74f299d4a3b0b910e694bf9c2e84b6c5">vector_assign_scalar</a> (V &v, <span class="keyword">const</span> T &t, <a class="code" href="a00409.html">sparse_proxy_tag</a>) {
|
|
<a name="l00165"></a>00165 <span class="keyword">typedef</span> F<typename V::iterator::reference, T> functor_type;
|
|
<a name="l00166"></a>00166 <span class="keyword">typename</span> V::iterator it (v.begin ());
|
|
<a name="l00167"></a>00167 <span class="keyword">typename</span> V::iterator it_end (v.end ());
|
|
<a name="l00168"></a>00168 <span class="keywordflow">while</span> (it != it_end)
|
|
<a name="l00169"></a>00169 functor_type::apply (*it, t), ++ it;
|
|
<a name="l00170"></a>00170 }
|
|
<a name="l00171"></a>00171
|
|
<a name="l00172"></a>00172 <span class="comment">// Dispatcher</span>
|
|
<a name="l00173"></a>00173 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>T>
|
|
<a name="l00174"></a>00174 <a class="code" href="a00603.html#a578c14139742374e9a04e5afcb6cd24c">BOOST_UBLAS_INLINE</a>
|
|
<a name="l00175"></a><a class="code" href="a00595.html#aafc9992b13a2a93139abf09845a35e9d">00175</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#a74f299d4a3b0b910e694bf9c2e84b6c5">vector_assign_scalar</a> (V &v, <span class="keyword">const</span> T &t) {
|
|
<a name="l00176"></a>00176 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::storage_category storage_category;
|
|
<a name="l00177"></a>00177 vector_assign_scalar<F> (v, t, storage_category ());
|
|
<a name="l00178"></a>00178 }
|
|
<a name="l00179"></a>00179
|
|
<a name="l00180"></a>00180 <span class="keyword">template</span><<span class="keyword">class</span> SC, <span class="keywordtype">bool</span> COMPUTED, <span class="keyword">class</span> RI>
|
|
<a name="l00181"></a><a class="code" href="a00484.html">00181</a> <span class="keyword">struct </span><a class="code" href="a00484.html">vector_assign_traits</a> {
|
|
<a name="l00182"></a><a class="code" href="a00484.html#ad3cf2209de291c6cbd5a1ce0df118151">00182</a> <span class="keyword">typedef</span> SC <a class="code" href="a00484.html#ad3cf2209de291c6cbd5a1ce0df118151">storage_category</a>;
|
|
<a name="l00183"></a>00183 };
|
|
<a name="l00184"></a>00184
|
|
<a name="l00185"></a>00185 <span class="keyword">template</span><<span class="keywordtype">bool</span> COMPUTED>
|
|
<a name="l00186"></a><a class="code" href="a00488.html">00186</a> <span class="keyword">struct </span><a class="code" href="a00484.html">vector_assign_traits</a><<a class="code" href="a00083.html">dense_tag</a>, COMPUTED, <a class="code" href="a00361.html">packed_random_access_iterator_tag</a>> {
|
|
<a name="l00187"></a><a class="code" href="a00488.html#a6a286c8cca98496f75b8efcf163ad35d">00187</a> <span class="keyword">typedef</span> <a class="code" href="a00362.html">packed_tag</a> <a class="code" href="a00488.html#a6a286c8cca98496f75b8efcf163ad35d">storage_category</a>;
|
|
<a name="l00188"></a>00188 };
|
|
<a name="l00189"></a>00189 <span class="keyword">template</span><>
|
|
<a name="l00190"></a><a class="code" href="a00489.html">00190</a> <span class="keyword">struct </span><a class="code" href="a00484.html">vector_assign_traits</a><<a class="code" href="a00083.html">dense_tag</a>, false, <a class="code" href="a00408.html">sparse_bidirectional_iterator_tag</a>> {
|
|
<a name="l00191"></a><a class="code" href="a00489.html#ae4cf441f913752db2854b770261436b2">00191</a> <span class="keyword">typedef</span> <a class="code" href="a00410.html">sparse_tag</a> <a class="code" href="a00489.html#ae4cf441f913752db2854b770261436b2">storage_category</a>;
|
|
<a name="l00192"></a>00192 };
|
|
<a name="l00193"></a>00193 <span class="keyword">template</span><>
|
|
<a name="l00194"></a><a class="code" href="a00490.html">00194</a> <span class="keyword">struct </span><a class="code" href="a00484.html">vector_assign_traits</a><<a class="code" href="a00083.html">dense_tag</a>, true, <a class="code" href="a00408.html">sparse_bidirectional_iterator_tag</a>> {
|
|
<a name="l00195"></a><a class="code" href="a00490.html#ab63f7b4ed0e5092381b7da9171bb8963">00195</a> <span class="keyword">typedef</span> <a class="code" href="a00409.html">sparse_proxy_tag</a> <a class="code" href="a00490.html#ab63f7b4ed0e5092381b7da9171bb8963">storage_category</a>;
|
|
<a name="l00196"></a>00196 };
|
|
<a name="l00197"></a>00197
|
|
<a name="l00198"></a>00198 <span class="keyword">template</span><<span class="keywordtype">bool</span> COMPUTED>
|
|
<a name="l00199"></a><a class="code" href="a00485.html">00199</a> <span class="keyword">struct </span><a class="code" href="a00484.html">vector_assign_traits</a><<a class="code" href="a00081.html">dense_proxy_tag</a>, COMPUTED, <a class="code" href="a00361.html">packed_random_access_iterator_tag</a>> {
|
|
<a name="l00200"></a><a class="code" href="a00485.html#a42e75dee4c2254bff525a3a1f6e22178">00200</a> <span class="keyword">typedef</span> <a class="code" href="a00360.html">packed_proxy_tag</a> <a class="code" href="a00485.html#a42e75dee4c2254bff525a3a1f6e22178">storage_category</a>;
|
|
<a name="l00201"></a>00201 };
|
|
<a name="l00202"></a>00202 <span class="keyword">template</span><>
|
|
<a name="l00203"></a><a class="code" href="a00486.html">00203</a> <span class="keyword">struct </span><a class="code" href="a00484.html">vector_assign_traits</a><<a class="code" href="a00081.html">dense_proxy_tag</a>, false, <a class="code" href="a00408.html">sparse_bidirectional_iterator_tag</a>> {
|
|
<a name="l00204"></a><a class="code" href="a00486.html#ad962de44f7d4994435eb2bb63ea7bc68">00204</a> <span class="keyword">typedef</span> <a class="code" href="a00409.html">sparse_proxy_tag</a> <a class="code" href="a00486.html#ad962de44f7d4994435eb2bb63ea7bc68">storage_category</a>;
|
|
<a name="l00205"></a>00205 };
|
|
<a name="l00206"></a>00206 <span class="keyword">template</span><>
|
|
<a name="l00207"></a><a class="code" href="a00487.html">00207</a> <span class="keyword">struct </span><a class="code" href="a00484.html">vector_assign_traits</a><<a class="code" href="a00081.html">dense_proxy_tag</a>, true, <a class="code" href="a00408.html">sparse_bidirectional_iterator_tag</a>> {
|
|
<a name="l00208"></a><a class="code" href="a00487.html#af5974e00fa3087f669454bff2d413c63">00208</a> <span class="keyword">typedef</span> <a class="code" href="a00409.html">sparse_proxy_tag</a> <a class="code" href="a00487.html#af5974e00fa3087f669454bff2d413c63">storage_category</a>;
|
|
<a name="l00209"></a>00209 };
|
|
<a name="l00210"></a>00210
|
|
<a name="l00211"></a>00211 <span class="keyword">template</span><>
|
|
<a name="l00212"></a><a class="code" href="a00492.html">00212</a> <span class="keyword">struct </span><a class="code" href="a00484.html">vector_assign_traits</a><<a class="code" href="a00362.html">packed_tag</a>, false, <a class="code" href="a00408.html">sparse_bidirectional_iterator_tag</a>> {
|
|
<a name="l00213"></a><a class="code" href="a00492.html#ab10c081972d5e6bf5cc7d1a147211cef">00213</a> <span class="keyword">typedef</span> <a class="code" href="a00410.html">sparse_tag</a> <a class="code" href="a00492.html#ab10c081972d5e6bf5cc7d1a147211cef">storage_category</a>;
|
|
<a name="l00214"></a>00214 };
|
|
<a name="l00215"></a>00215 <span class="keyword">template</span><>
|
|
<a name="l00216"></a><a class="code" href="a00493.html">00216</a> <span class="keyword">struct </span><a class="code" href="a00484.html">vector_assign_traits</a><<a class="code" href="a00362.html">packed_tag</a>, true, <a class="code" href="a00408.html">sparse_bidirectional_iterator_tag</a>> {
|
|
<a name="l00217"></a><a class="code" href="a00493.html#a37e1dec09f3330abe02e212b3f499c5b">00217</a> <span class="keyword">typedef</span> <a class="code" href="a00409.html">sparse_proxy_tag</a> <a class="code" href="a00493.html#a37e1dec09f3330abe02e212b3f499c5b">storage_category</a>;
|
|
<a name="l00218"></a>00218 };
|
|
<a name="l00219"></a>00219
|
|
<a name="l00220"></a>00220 <span class="keyword">template</span><<span class="keywordtype">bool</span> COMPUTED>
|
|
<a name="l00221"></a><a class="code" href="a00491.html">00221</a> <span class="keyword">struct </span><a class="code" href="a00484.html">vector_assign_traits</a><<a class="code" href="a00360.html">packed_proxy_tag</a>, COMPUTED, <a class="code" href="a00408.html">sparse_bidirectional_iterator_tag</a>> {
|
|
<a name="l00222"></a><a class="code" href="a00491.html#a67b7de2e4f8039b4118ea68b60c03b86">00222</a> <span class="keyword">typedef</span> <a class="code" href="a00409.html">sparse_proxy_tag</a> <a class="code" href="a00491.html#a67b7de2e4f8039b4118ea68b60c03b86">storage_category</a>;
|
|
<a name="l00223"></a>00223 };
|
|
<a name="l00224"></a>00224
|
|
<a name="l00225"></a>00225 <span class="keyword">template</span><>
|
|
<a name="l00226"></a><a class="code" href="a00494.html">00226</a> <span class="keyword">struct </span><a class="code" href="a00484.html">vector_assign_traits</a><<a class="code" href="a00410.html">sparse_tag</a>, true, <a class="code" href="a00082.html">dense_random_access_iterator_tag</a>> {
|
|
<a name="l00227"></a><a class="code" href="a00494.html#ae3359db32cd0fd4628f10001fdb00323">00227</a> <span class="keyword">typedef</span> <a class="code" href="a00409.html">sparse_proxy_tag</a> <a class="code" href="a00494.html#ae3359db32cd0fd4628f10001fdb00323">storage_category</a>;
|
|
<a name="l00228"></a>00228 };
|
|
<a name="l00229"></a>00229 <span class="keyword">template</span><>
|
|
<a name="l00230"></a><a class="code" href="a00495.html">00230</a> <span class="keyword">struct </span><a class="code" href="a00484.html">vector_assign_traits</a><<a class="code" href="a00410.html">sparse_tag</a>, true, <a class="code" href="a00361.html">packed_random_access_iterator_tag</a>> {
|
|
<a name="l00231"></a><a class="code" href="a00495.html#a81607eb908ad35d2975507247a9a2388">00231</a> <span class="keyword">typedef</span> <a class="code" href="a00409.html">sparse_proxy_tag</a> <a class="code" href="a00495.html#a81607eb908ad35d2975507247a9a2388">storage_category</a>;
|
|
<a name="l00232"></a>00232 };
|
|
<a name="l00233"></a>00233 <span class="keyword">template</span><>
|
|
<a name="l00234"></a><a class="code" href="a00496.html">00234</a> <span class="keyword">struct </span><a class="code" href="a00484.html">vector_assign_traits</a><<a class="code" href="a00410.html">sparse_tag</a>, true, <a class="code" href="a00408.html">sparse_bidirectional_iterator_tag</a>> {
|
|
<a name="l00235"></a><a class="code" href="a00496.html#ab0e8a16e3ba4c24db90db3d74749efdc">00235</a> <span class="keyword">typedef</span> <a class="code" href="a00409.html">sparse_proxy_tag</a> <a class="code" href="a00496.html#ab0e8a16e3ba4c24db90db3d74749efdc">storage_category</a>;
|
|
<a name="l00236"></a>00236 };
|
|
<a name="l00237"></a>00237
|
|
<a name="l00238"></a>00238 <span class="comment">// Explicitly iterating</span>
|
|
<a name="l00239"></a>00239 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>E>
|
|
<a name="l00240"></a>00240 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.</span>
|
|
<a name="l00241"></a><a class="code" href="a00595.html#a036fb2034b31fe06a80cebe7fd6bb153">00241</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#a036fb2034b31fe06a80cebe7fd6bb153">iterating_vector_assign</a> (V &v, <span class="keyword">const</span> <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E></a> &e) {
|
|
<a name="l00242"></a>00242 <span class="keyword">typedef</span> F<typename V::iterator::reference, typename E::value_type> functor_type;
|
|
<a name="l00243"></a>00243 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::difference_type difference_type;
|
|
<a name="l00244"></a>00244 difference_type <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> (<a class="code" href="a00610.html#ad7bb3e64acf4cd355a9985bdf879cf2a">BOOST_UBLAS_SAME</a> (v.size (), e ().size ()));
|
|
<a name="l00245"></a>00245 <span class="keyword">typename</span> V::iterator it (v.begin ());
|
|
<a name="l00246"></a>00246 <a class="code" href="a00610.html#aada705f9d1fd36fc1af3b703217ec69e">BOOST_UBLAS_CHECK</a> (v.end () - it == <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>, <a class="code" href="a00016.html">bad_size</a> ());
|
|
<a name="l00247"></a>00247 <span class="keyword">typename</span> E::const_iterator ite (e ().<a class="code" href="a00595.html#ae2297dd9051333c2ec1d0f63175f66fe" title="An iterator to the first element of the given vector expression.">begin</a> ());
|
|
<a name="l00248"></a>00248 <a class="code" href="a00610.html#aada705f9d1fd36fc1af3b703217ec69e">BOOST_UBLAS_CHECK</a> (e ().<a class="code" href="a00595.html#a5e8a7fc1352cd3e148064608dad9f38d" title="An iterator to the last element of the given vector expression.">end</a> () - ite == size, <a class="code" href="a00016.html">bad_size</a> ());
|
|
<a name="l00249"></a>00249 <span class="preprocessor">#ifndef BOOST_UBLAS_USE_DUFF_DEVICE</span>
|
|
<a name="l00250"></a>00250 <span class="preprocessor"></span> <span class="keywordflow">while</span> (-- size >= 0)
|
|
<a name="l00251"></a>00251 functor_type::apply (*it, *ite), ++ it, ++ ite;
|
|
<a name="l00252"></a>00252 <span class="preprocessor">#else</span>
|
|
<a name="l00253"></a>00253 <span class="preprocessor"></span> <a class="code" href="a00608.html#acb571ebc7eb721ca2a32e3447a436e23">DD</a> (size, 2, r, (functor_type::apply (*it, *ite), ++ it, ++ ite));
|
|
<a name="l00254"></a>00254 <span class="preprocessor">#endif</span>
|
|
<a name="l00255"></a>00255 <span class="preprocessor"></span> }
|
|
<a name="l00256"></a>00256 <span class="comment">// Explicitly indexing</span>
|
|
<a name="l00257"></a>00257 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>E>
|
|
<a name="l00258"></a>00258 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.</span>
|
|
<a name="l00259"></a><a class="code" href="a00595.html#a660483129c5c165b945410a4d845ceee">00259</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#a660483129c5c165b945410a4d845ceee">indexing_vector_assign</a> (V &v, <span class="keyword">const</span> <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E></a> &e) {
|
|
<a name="l00260"></a>00260 <span class="keyword">typedef</span> F<typename V::reference, typename E::value_type> functor_type;
|
|
<a name="l00261"></a>00261 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::size_type size_type;
|
|
<a name="l00262"></a>00262 size_type <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> (<a class="code" href="a00610.html#ad7bb3e64acf4cd355a9985bdf879cf2a">BOOST_UBLAS_SAME</a> (v.size (), e ().size ()));
|
|
<a name="l00263"></a>00263 <span class="preprocessor">#ifndef BOOST_UBLAS_USE_DUFF_DEVICE</span>
|
|
<a name="l00264"></a>00264 <span class="preprocessor"></span> <span class="keywordflow">for</span> (size_type i = 0; i < <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>; ++ i)
|
|
<a name="l00265"></a>00265 functor_type::apply (v (i), e () (i));
|
|
<a name="l00266"></a>00266 <span class="preprocessor">#else</span>
|
|
<a name="l00267"></a>00267 <span class="preprocessor"></span> size_type i (0);
|
|
<a name="l00268"></a>00268 <a class="code" href="a00608.html#acb571ebc7eb721ca2a32e3447a436e23">DD</a> (size, 2, r, (functor_type::apply (v (i), e () (i)), ++ i));
|
|
<a name="l00269"></a>00269 <span class="preprocessor">#endif</span>
|
|
<a name="l00270"></a>00270 <span class="preprocessor"></span> }
|
|
<a name="l00271"></a>00271
|
|
<a name="l00272"></a>00272 <span class="comment">// Dense (proxy) case</span>
|
|
<a name="l00273"></a>00273 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>E>
|
|
<a name="l00274"></a>00274 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.</span>
|
|
<a name="l00275"></a><a class="code" href="a00595.html#a66ea598f5472db9beb803326323b9b88">00275</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#a66ea598f5472db9beb803326323b9b88">vector_assign</a> (V &v, <span class="keyword">const</span> <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E></a> &e, <a class="code" href="a00081.html">dense_proxy_tag</a>) {
|
|
<a name="l00276"></a>00276 <span class="preprocessor">#ifdef BOOST_UBLAS_USE_INDEXING</span>
|
|
<a name="l00277"></a>00277 <span class="preprocessor"></span> indexing_vector_assign<F> (v, e);
|
|
<a name="l00278"></a>00278 <span class="preprocessor">#elif BOOST_UBLAS_USE_ITERATING</span>
|
|
<a name="l00279"></a>00279 <span class="preprocessor"></span> iterating_vector_assign<F> (v, e);
|
|
<a name="l00280"></a>00280 <span class="preprocessor">#else</span>
|
|
<a name="l00281"></a>00281 <span class="preprocessor"></span> <span class="keyword">typedef</span> <span class="keyword">typename</span> V::size_type size_type;
|
|
<a name="l00282"></a>00282 size_type <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> (<a class="code" href="a00610.html#ad7bb3e64acf4cd355a9985bdf879cf2a">BOOST_UBLAS_SAME</a> (v.size (), e ().size ()));
|
|
<a name="l00283"></a>00283 <span class="keywordflow">if</span> (size >= BOOST_UBLAS_ITERATOR_THRESHOLD)
|
|
<a name="l00284"></a>00284 iterating_vector_assign<F> (v, e);
|
|
<a name="l00285"></a>00285 <span class="keywordflow">else</span>
|
|
<a name="l00286"></a>00286 indexing_vector_assign<F> (v, e);
|
|
<a name="l00287"></a>00287 <span class="preprocessor">#endif</span>
|
|
<a name="l00288"></a>00288 <span class="preprocessor"></span> }
|
|
<a name="l00289"></a>00289 <span class="comment">// Packed (proxy) case</span>
|
|
<a name="l00290"></a>00290 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>E>
|
|
<a name="l00291"></a>00291 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.</span>
|
|
<a name="l00292"></a><a class="code" href="a00595.html#a74d6b77fc69010dba485138887b63175">00292</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#a66ea598f5472db9beb803326323b9b88">vector_assign</a> (V &v, <span class="keyword">const</span> <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E></a> &e, <a class="code" href="a00360.html">packed_proxy_tag</a>) {
|
|
<a name="l00293"></a>00293 <a class="code" href="a00610.html#aada705f9d1fd36fc1af3b703217ec69e">BOOST_UBLAS_CHECK</a> (v.size () == e ().size (), <a class="code" href="a00016.html">bad_size</a> ());
|
|
<a name="l00294"></a>00294 <span class="keyword">typedef</span> F<typename V::iterator::reference, typename E::value_type> functor_type;
|
|
<a name="l00295"></a>00295 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::difference_type difference_type;
|
|
<a name="l00296"></a>00296 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::value_type value_type;
|
|
<a name="l00297"></a>00297 <span class="preprocessor">#if BOOST_UBLAS_TYPE_CHECK</span>
|
|
<a name="l00298"></a>00298 <span class="preprocessor"></span> <a class="code" href="a00481.html" title="A dense vector of values of type T.">vector<value_type></a> cv (v.size ());
|
|
<a name="l00299"></a>00299 indexing_vector_assign<scalar_assign> (cv, v);
|
|
<a name="l00300"></a>00300 indexing_vector_assign<F> (cv, e);
|
|
<a name="l00301"></a>00301 <span class="preprocessor">#endif</span>
|
|
<a name="l00302"></a>00302 <span class="preprocessor"></span> <span class="keyword">typename</span> V::iterator it (v.begin ());
|
|
<a name="l00303"></a>00303 <span class="keyword">typename</span> V::iterator it_end (v.end ());
|
|
<a name="l00304"></a>00304 <span class="keyword">typename</span> E::const_iterator ite (e ().<a class="code" href="a00595.html#ae2297dd9051333c2ec1d0f63175f66fe" title="An iterator to the first element of the given vector expression.">begin</a> ());
|
|
<a name="l00305"></a>00305 <span class="keyword">typename</span> E::const_iterator ite_end (e ().<a class="code" href="a00595.html#a5e8a7fc1352cd3e148064608dad9f38d" title="An iterator to the last element of the given vector expression.">end</a> ());
|
|
<a name="l00306"></a>00306 difference_type it_size (it_end - it);
|
|
<a name="l00307"></a>00307 difference_type ite_size (ite_end - ite);
|
|
<a name="l00308"></a>00308 <span class="keywordflow">if</span> (it_size > 0 && ite_size > 0) {
|
|
<a name="l00309"></a>00309 difference_type <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> ((std::min) (difference_type (it.index () - ite.index ()), ite_size));
|
|
<a name="l00310"></a>00310 <span class="keywordflow">if</span> (<a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> > 0) {
|
|
<a name="l00311"></a>00311 ite += <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>;
|
|
<a name="l00312"></a>00312 ite_size -= <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>;
|
|
<a name="l00313"></a>00313 }
|
|
<a name="l00314"></a>00314 }
|
|
<a name="l00315"></a>00315 <span class="keywordflow">if</span> (it_size > 0 && ite_size > 0) {
|
|
<a name="l00316"></a>00316 difference_type <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> ((std::min) (difference_type (ite.index () - it.index ()), it_size));
|
|
<a name="l00317"></a>00317 <span class="keywordflow">if</span> (<a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> > 0) {
|
|
<a name="l00318"></a>00318 it_size -= <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>;
|
|
<a name="l00319"></a>00319 <span class="keywordflow">if</span> (!functor_type::computed) {
|
|
<a name="l00320"></a>00320 <span class="keywordflow">while</span> (-- <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> >= 0) <span class="comment">// zeroing</span>
|
|
<a name="l00321"></a>00321 functor_type::apply (*it, value_type<span class="comment">/*zero*/</span>()), ++ it;
|
|
<a name="l00322"></a>00322 } <span class="keywordflow">else</span> {
|
|
<a name="l00323"></a>00323 it += <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>;
|
|
<a name="l00324"></a>00324 }
|
|
<a name="l00325"></a>00325 }
|
|
<a name="l00326"></a>00326 }
|
|
<a name="l00327"></a>00327 difference_type <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> ((std::min) (it_size, ite_size));
|
|
<a name="l00328"></a>00328 it_size -= <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>;
|
|
<a name="l00329"></a>00329 ite_size -= <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>;
|
|
<a name="l00330"></a>00330 <span class="keywordflow">while</span> (-- size >= 0)
|
|
<a name="l00331"></a>00331 functor_type::apply (*it, *ite), ++ it, ++ ite;
|
|
<a name="l00332"></a>00332 size = it_size;
|
|
<a name="l00333"></a>00333 <span class="keywordflow">if</span> (!functor_type::computed) {
|
|
<a name="l00334"></a>00334 <span class="keywordflow">while</span> (-- size >= 0) <span class="comment">// zeroing</span>
|
|
<a name="l00335"></a>00335 functor_type::apply (*it, value_type<span class="comment">/*zero*/</span>()), ++ it;
|
|
<a name="l00336"></a>00336 } <span class="keywordflow">else</span> {
|
|
<a name="l00337"></a>00337 it += <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>;
|
|
<a name="l00338"></a>00338 }
|
|
<a name="l00339"></a>00339 <span class="preprocessor">#if BOOST_UBLAS_TYPE_CHECK</span>
|
|
<a name="l00340"></a>00340 <span class="preprocessor"></span> <span class="keywordflow">if</span> (! <a class="code" href="a00592.html">disable_type_check<bool>::value</a>)
|
|
<a name="l00341"></a>00341 <a class="code" href="a00610.html#aada705f9d1fd36fc1af3b703217ec69e">BOOST_UBLAS_CHECK</a> (<a class="code" href="a00653.html#a43a1eab42456d66c868af16c340e8246">detail::expression_type_check</a> (v, cv),
|
|
<a name="l00342"></a>00342 <a class="code" href="a00132.html">external_logic</a> (<span class="stringliteral">"external logic or bad condition of inputs"</span>));
|
|
<a name="l00343"></a>00343 <span class="preprocessor">#endif</span>
|
|
<a name="l00344"></a>00344 <span class="preprocessor"></span> }
|
|
<a name="l00345"></a>00345 <span class="comment">// Sparse case</span>
|
|
<a name="l00346"></a>00346 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>E>
|
|
<a name="l00347"></a>00347 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.</span>
|
|
<a name="l00348"></a><a class="code" href="a00595.html#a96287029315deb4274a3bc65df79894f">00348</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#a66ea598f5472db9beb803326323b9b88">vector_assign</a> (V &v, <span class="keyword">const</span> <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E></a> &e, <a class="code" href="a00410.html">sparse_tag</a>) {
|
|
<a name="l00349"></a>00349 <a class="code" href="a00610.html#aada705f9d1fd36fc1af3b703217ec69e">BOOST_UBLAS_CHECK</a> (v.size () == e ().size (), <a class="code" href="a00016.html">bad_size</a> ());
|
|
<a name="l00350"></a>00350 <span class="keyword">typedef</span> F<typename V::iterator::reference, typename E::value_type> functor_type;
|
|
<a name="l00351"></a>00351 BOOST_STATIC_ASSERT ((!functor_type::computed));
|
|
<a name="l00352"></a>00352 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::value_type value_type;
|
|
<a name="l00353"></a>00353 <span class="preprocessor">#if BOOST_UBLAS_TYPE_CHECK</span>
|
|
<a name="l00354"></a>00354 <span class="preprocessor"></span> <a class="code" href="a00481.html" title="A dense vector of values of type T.">vector<value_type></a> cv (v.size ());
|
|
<a name="l00355"></a>00355 indexing_vector_assign<scalar_assign> (cv, v);
|
|
<a name="l00356"></a>00356 indexing_vector_assign<F> (cv, e);
|
|
<a name="l00357"></a>00357 <span class="preprocessor">#endif</span>
|
|
<a name="l00358"></a>00358 <span class="preprocessor"></span> v.<a class="code" href="a00481.html#aad56668044d71db97be9e44db273f09a" title="Clear the vector, i.e. set all values to the zero value.">clear</a> ();
|
|
<a name="l00359"></a>00359 <span class="keyword">typename</span> E::const_iterator ite (e ().<a class="code" href="a00595.html#ae2297dd9051333c2ec1d0f63175f66fe" title="An iterator to the first element of the given vector expression.">begin</a> ());
|
|
<a name="l00360"></a>00360 <span class="keyword">typename</span> E::const_iterator ite_end (e ().<a class="code" href="a00595.html#a5e8a7fc1352cd3e148064608dad9f38d" title="An iterator to the last element of the given vector expression.">end</a> ());
|
|
<a name="l00361"></a>00361 <span class="keywordflow">while</span> (ite != ite_end) {
|
|
<a name="l00362"></a>00362 value_type t (*ite);
|
|
<a name="l00363"></a>00363 <span class="keywordflow">if</span> (t != value_type<span class="comment">/*zero*/</span>())
|
|
<a name="l00364"></a>00364 v.insert_element (ite.index (), t);
|
|
<a name="l00365"></a>00365 ++ ite;
|
|
<a name="l00366"></a>00366 }
|
|
<a name="l00367"></a>00367 <span class="preprocessor">#if BOOST_UBLAS_TYPE_CHECK</span>
|
|
<a name="l00368"></a>00368 <span class="preprocessor"></span> <span class="keywordflow">if</span> (! <a class="code" href="a00592.html">disable_type_check<bool>::value</a>)
|
|
<a name="l00369"></a>00369 <a class="code" href="a00610.html#aada705f9d1fd36fc1af3b703217ec69e">BOOST_UBLAS_CHECK</a> (<a class="code" href="a00653.html#a43a1eab42456d66c868af16c340e8246">detail::expression_type_check</a> (v, cv),
|
|
<a name="l00370"></a>00370 <a class="code" href="a00132.html">external_logic</a> (<span class="stringliteral">"external logic or bad condition of inputs"</span>));
|
|
<a name="l00371"></a>00371 <span class="preprocessor">#endif</span>
|
|
<a name="l00372"></a>00372 <span class="preprocessor"></span> }
|
|
<a name="l00373"></a>00373 <span class="comment">// Sparse proxy or functional case</span>
|
|
<a name="l00374"></a>00374 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>E>
|
|
<a name="l00375"></a>00375 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.</span>
|
|
<a name="l00376"></a><a class="code" href="a00595.html#ab320575401e7ce8b16663caa12a069c4">00376</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#a66ea598f5472db9beb803326323b9b88">vector_assign</a> (V &v, <span class="keyword">const</span> <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E></a> &e, <a class="code" href="a00409.html">sparse_proxy_tag</a>) {
|
|
<a name="l00377"></a>00377 <a class="code" href="a00610.html#aada705f9d1fd36fc1af3b703217ec69e">BOOST_UBLAS_CHECK</a> (v.size () == e ().size (), <a class="code" href="a00016.html">bad_size</a> ());
|
|
<a name="l00378"></a>00378 <span class="keyword">typedef</span> F<typename V::iterator::reference, typename E::value_type> functor_type;
|
|
<a name="l00379"></a>00379 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::size_type size_type;
|
|
<a name="l00380"></a>00380 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::difference_type difference_type;
|
|
<a name="l00381"></a>00381 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::value_type value_type;
|
|
<a name="l00382"></a>00382 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::reference reference;
|
|
<a name="l00383"></a>00383 <span class="preprocessor">#if BOOST_UBLAS_TYPE_CHECK</span>
|
|
<a name="l00384"></a>00384 <span class="preprocessor"></span> <a class="code" href="a00481.html" title="A dense vector of values of type T.">vector<value_type></a> cv (v.size ());
|
|
<a name="l00385"></a>00385 indexing_vector_assign<scalar_assign> (cv, v);
|
|
<a name="l00386"></a>00386 indexing_vector_assign<F> (cv, e);
|
|
<a name="l00387"></a>00387 <span class="preprocessor">#endif</span>
|
|
<a name="l00388"></a>00388 <span class="preprocessor"></span> <a class="code" href="a00653.html#af86e444b5972e9b0ee8afbbcd533bd7a">detail::make_conformant</a> (v, e);
|
|
<a name="l00389"></a>00389
|
|
<a name="l00390"></a>00390 <span class="keyword">typename</span> V::iterator it (v.begin ());
|
|
<a name="l00391"></a>00391 <span class="keyword">typename</span> V::iterator it_end (v.end ());
|
|
<a name="l00392"></a>00392 <span class="keyword">typename</span> E::const_iterator ite (e ().<a class="code" href="a00595.html#ae2297dd9051333c2ec1d0f63175f66fe" title="An iterator to the first element of the given vector expression.">begin</a> ());
|
|
<a name="l00393"></a>00393 <span class="keyword">typename</span> E::const_iterator ite_end (e ().<a class="code" href="a00595.html#a5e8a7fc1352cd3e148064608dad9f38d" title="An iterator to the last element of the given vector expression.">end</a> ());
|
|
<a name="l00394"></a>00394 <span class="keywordflow">if</span> (it != it_end && ite != ite_end) {
|
|
<a name="l00395"></a>00395 size_type it_index = it.index (), ite_index = ite.index ();
|
|
<a name="l00396"></a>00396 <span class="keywordflow">while</span> (<span class="keyword">true</span>) {
|
|
<a name="l00397"></a>00397 difference_type compare = it_index - ite_index;
|
|
<a name="l00398"></a>00398 <span class="keywordflow">if</span> (compare == 0) {
|
|
<a name="l00399"></a>00399 functor_type::apply (*it, *ite);
|
|
<a name="l00400"></a>00400 ++ it, ++ ite;
|
|
<a name="l00401"></a>00401 <span class="keywordflow">if</span> (it != it_end && ite != ite_end) {
|
|
<a name="l00402"></a>00402 it_index = it.index ();
|
|
<a name="l00403"></a>00403 ite_index = ite.index ();
|
|
<a name="l00404"></a>00404 } <span class="keywordflow">else</span>
|
|
<a name="l00405"></a>00405 <span class="keywordflow">break</span>;
|
|
<a name="l00406"></a>00406 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (compare < 0) {
|
|
<a name="l00407"></a>00407 <span class="keywordflow">if</span> (!functor_type::computed) {
|
|
<a name="l00408"></a>00408 functor_type::apply (*it, value_type<span class="comment">/*zero*/</span>());
|
|
<a name="l00409"></a>00409 ++ it;
|
|
<a name="l00410"></a>00410 } <span class="keywordflow">else</span>
|
|
<a name="l00411"></a>00411 <a class="code" href="a00595.html#a00e524ed262cdf2bef30737b1ad05b3e">increment</a> (it, it_end, - compare);
|
|
<a name="l00412"></a>00412 <span class="keywordflow">if</span> (it != it_end)
|
|
<a name="l00413"></a>00413 it_index = it.index ();
|
|
<a name="l00414"></a>00414 <span class="keywordflow">else</span>
|
|
<a name="l00415"></a>00415 <span class="keywordflow">break</span>;
|
|
<a name="l00416"></a>00416 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (compare > 0) {
|
|
<a name="l00417"></a>00417 <a class="code" href="a00595.html#a00e524ed262cdf2bef30737b1ad05b3e">increment</a> (ite, ite_end, compare);
|
|
<a name="l00418"></a>00418 <span class="keywordflow">if</span> (ite != ite_end)
|
|
<a name="l00419"></a>00419 ite_index = ite.index ();
|
|
<a name="l00420"></a>00420 <span class="keywordflow">else</span>
|
|
<a name="l00421"></a>00421 <span class="keywordflow">break</span>;
|
|
<a name="l00422"></a>00422 }
|
|
<a name="l00423"></a>00423 }
|
|
<a name="l00424"></a>00424 }
|
|
<a name="l00425"></a>00425
|
|
<a name="l00426"></a>00426 <span class="keywordflow">if</span> (!functor_type::computed) {
|
|
<a name="l00427"></a>00427 <span class="keywordflow">while</span> (it != it_end) { <span class="comment">// zeroing</span>
|
|
<a name="l00428"></a>00428 functor_type::apply (*it, value_type<span class="comment">/*zero*/</span>());
|
|
<a name="l00429"></a>00429 ++ it;
|
|
<a name="l00430"></a>00430 }
|
|
<a name="l00431"></a>00431 } <span class="keywordflow">else</span> {
|
|
<a name="l00432"></a>00432 it = it_end;
|
|
<a name="l00433"></a>00433 }
|
|
<a name="l00434"></a>00434 <span class="preprocessor">#if BOOST_UBLAS_TYPE_CHECK</span>
|
|
<a name="l00435"></a>00435 <span class="preprocessor"></span> <span class="keywordflow">if</span> (! <a class="code" href="a00592.html">disable_type_check<bool>::value</a>)
|
|
<a name="l00436"></a>00436 <a class="code" href="a00610.html#aada705f9d1fd36fc1af3b703217ec69e">BOOST_UBLAS_CHECK</a> (<a class="code" href="a00653.html#a43a1eab42456d66c868af16c340e8246">detail::expression_type_check</a> (v, cv),
|
|
<a name="l00437"></a>00437 <a class="code" href="a00132.html">external_logic</a> (<span class="stringliteral">"external logic or bad condition of inputs"</span>));
|
|
<a name="l00438"></a>00438 <span class="preprocessor">#endif</span>
|
|
<a name="l00439"></a>00439 <span class="preprocessor"></span> }
|
|
<a name="l00440"></a>00440
|
|
<a name="l00441"></a>00441 <span class="comment">// Dispatcher</span>
|
|
<a name="l00442"></a>00442 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>E>
|
|
<a name="l00443"></a>00443 <a class="code" href="a00603.html#a578c14139742374e9a04e5afcb6cd24c">BOOST_UBLAS_INLINE</a>
|
|
<a name="l00444"></a><a class="code" href="a00595.html#aaae4fff2227150e8347b6641dfadfc7c">00444</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#a66ea598f5472db9beb803326323b9b88">vector_assign</a> (V &v, <span class="keyword">const</span> <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E></a> &e) {
|
|
<a name="l00445"></a>00445 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00484.html">vector_assign_traits</a><<span class="keyword">typename</span> V::storage_category,
|
|
<a name="l00446"></a>00446 F<typename V::reference, typename E::value_type>::computed,
|
|
<a name="l00447"></a>00447 <span class="keyword">typename</span> E::const_iterator::iterator_category>::storage_category storage_category;
|
|
<a name="l00448"></a>00448 vector_assign<F> (v, e, storage_category ());
|
|
<a name="l00449"></a>00449 }
|
|
<a name="l00450"></a>00450
|
|
<a name="l00451"></a>00451 <span class="keyword">template</span><<span class="keyword">class</span> SC, <span class="keyword">class</span> RI>
|
|
<a name="l00452"></a><a class="code" href="a00544.html">00452</a> <span class="keyword">struct </span><a class="code" href="a00544.html">vector_swap_traits</a> {
|
|
<a name="l00453"></a><a class="code" href="a00544.html#ab8323678b81c6290cc7fe6d21e864f29">00453</a> <span class="keyword">typedef</span> SC <a class="code" href="a00544.html#ab8323678b81c6290cc7fe6d21e864f29">storage_category</a>;
|
|
<a name="l00454"></a>00454 };
|
|
<a name="l00455"></a>00455
|
|
<a name="l00456"></a>00456 <span class="keyword">template</span><>
|
|
<a name="l00457"></a><a class="code" href="a00545.html">00457</a> <span class="keyword">struct </span><a class="code" href="a00544.html">vector_swap_traits</a><<a class="code" href="a00081.html">dense_proxy_tag</a>, <a class="code" href="a00408.html">sparse_bidirectional_iterator_tag</a>> {
|
|
<a name="l00458"></a><a class="code" href="a00545.html#a251a5f0c87e1ccdf3bb22462bc16ea6a">00458</a> <span class="keyword">typedef</span> <a class="code" href="a00409.html">sparse_proxy_tag</a> <a class="code" href="a00545.html#a251a5f0c87e1ccdf3bb22462bc16ea6a">storage_category</a>;
|
|
<a name="l00459"></a>00459 };
|
|
<a name="l00460"></a>00460
|
|
<a name="l00461"></a>00461 <span class="keyword">template</span><>
|
|
<a name="l00462"></a><a class="code" href="a00546.html">00462</a> <span class="keyword">struct </span><a class="code" href="a00544.html">vector_swap_traits</a><<a class="code" href="a00360.html">packed_proxy_tag</a>, <a class="code" href="a00408.html">sparse_bidirectional_iterator_tag</a>> {
|
|
<a name="l00463"></a><a class="code" href="a00546.html#a577452eaaa1a054c32fa6bc4fc88d5ff">00463</a> <span class="keyword">typedef</span> <a class="code" href="a00409.html">sparse_proxy_tag</a> <a class="code" href="a00546.html#a577452eaaa1a054c32fa6bc4fc88d5ff">storage_category</a>;
|
|
<a name="l00464"></a>00464 };
|
|
<a name="l00465"></a>00465
|
|
<a name="l00466"></a>00466 <span class="comment">// Dense (proxy) case</span>
|
|
<a name="l00467"></a>00467 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>E>
|
|
<a name="l00468"></a>00468 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.</span>
|
|
<a name="l00469"></a><a class="code" href="a00595.html#ad72e2ed90f4d1ce5a3ac8ae059419613">00469</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#ad72e2ed90f4d1ce5a3ac8ae059419613">vector_swap</a> (V &v, <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E></a> &e, <a class="code" href="a00081.html">dense_proxy_tag</a>) {
|
|
<a name="l00470"></a>00470 <span class="keyword">typedef</span> F<typename V::iterator::reference, typename E::iterator::reference> functor_type;
|
|
<a name="l00471"></a>00471 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::difference_type difference_type;
|
|
<a name="l00472"></a>00472 difference_type <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> (<a class="code" href="a00610.html#ad7bb3e64acf4cd355a9985bdf879cf2a">BOOST_UBLAS_SAME</a> (v.size (), e ().size ()));
|
|
<a name="l00473"></a>00473 <span class="keyword">typename</span> V::iterator it (v.begin ());
|
|
<a name="l00474"></a>00474 <span class="keyword">typename</span> E::iterator ite (e ().<a class="code" href="a00595.html#ae2297dd9051333c2ec1d0f63175f66fe" title="An iterator to the first element of the given vector expression.">begin</a> ());
|
|
<a name="l00475"></a>00475 <span class="keywordflow">while</span> (-- size >= 0)
|
|
<a name="l00476"></a>00476 functor_type::apply (*it, *ite), ++ it, ++ ite;
|
|
<a name="l00477"></a>00477 }
|
|
<a name="l00478"></a>00478 <span class="comment">// Packed (proxy) case</span>
|
|
<a name="l00479"></a>00479 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>E>
|
|
<a name="l00480"></a>00480 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.</span>
|
|
<a name="l00481"></a><a class="code" href="a00595.html#a733e8b32126f8e2de098677551bd1108">00481</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#ad72e2ed90f4d1ce5a3ac8ae059419613">vector_swap</a> (V &v, <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E></a> &e, <a class="code" href="a00360.html">packed_proxy_tag</a>) {
|
|
<a name="l00482"></a>00482 <span class="keyword">typedef</span> F<typename V::iterator::reference, typename E::iterator::reference> functor_type;
|
|
<a name="l00483"></a>00483 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::difference_type difference_type;
|
|
<a name="l00484"></a>00484 <span class="keyword">typename</span> V::iterator it (v.begin ());
|
|
<a name="l00485"></a>00485 <span class="keyword">typename</span> V::iterator it_end (v.end ());
|
|
<a name="l00486"></a>00486 <span class="keyword">typename</span> E::iterator ite (e ().<a class="code" href="a00595.html#ae2297dd9051333c2ec1d0f63175f66fe" title="An iterator to the first element of the given vector expression.">begin</a> ());
|
|
<a name="l00487"></a>00487 <span class="keyword">typename</span> E::iterator ite_end (e ().<a class="code" href="a00595.html#a5e8a7fc1352cd3e148064608dad9f38d" title="An iterator to the last element of the given vector expression.">end</a> ());
|
|
<a name="l00488"></a>00488 difference_type it_size (it_end - it);
|
|
<a name="l00489"></a>00489 difference_type ite_size (ite_end - ite);
|
|
<a name="l00490"></a>00490 <span class="keywordflow">if</span> (it_size > 0 && ite_size > 0) {
|
|
<a name="l00491"></a>00491 difference_type <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> ((std::min) (difference_type (it.index () - ite.index ()), ite_size));
|
|
<a name="l00492"></a>00492 <span class="keywordflow">if</span> (<a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> > 0) {
|
|
<a name="l00493"></a>00493 ite += <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>;
|
|
<a name="l00494"></a>00494 ite_size -= <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>;
|
|
<a name="l00495"></a>00495 }
|
|
<a name="l00496"></a>00496 }
|
|
<a name="l00497"></a>00497 <span class="keywordflow">if</span> (it_size > 0 && ite_size > 0) {
|
|
<a name="l00498"></a>00498 difference_type <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> ((std::min) (difference_type (ite.index () - it.index ()), it_size));
|
|
<a name="l00499"></a>00499 <span class="keywordflow">if</span> (<a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> > 0)
|
|
<a name="l00500"></a>00500 it_size -= <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>;
|
|
<a name="l00501"></a>00501 }
|
|
<a name="l00502"></a>00502 difference_type <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a> ((std::min) (it_size, ite_size));
|
|
<a name="l00503"></a>00503 it_size -= <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>;
|
|
<a name="l00504"></a>00504 ite_size -= <a class="code" href="a00595.html#a21019ef1d90c1854094dffa247fe1daf" title="Return the number of columns.">size</a>;
|
|
<a name="l00505"></a>00505 <span class="keywordflow">while</span> (-- size >= 0)
|
|
<a name="l00506"></a>00506 functor_type::apply (*it, *ite), ++ it, ++ ite;
|
|
<a name="l00507"></a>00507 }
|
|
<a name="l00508"></a>00508 <span class="comment">// Sparse proxy case</span>
|
|
<a name="l00509"></a>00509 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>E>
|
|
<a name="l00510"></a>00510 <span class="comment">// BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.</span>
|
|
<a name="l00511"></a><a class="code" href="a00595.html#a0ee4e3179129e88a1c4c7791e21d60d7">00511</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#ad72e2ed90f4d1ce5a3ac8ae059419613">vector_swap</a> (V &v, <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E></a> &e, <a class="code" href="a00409.html">sparse_proxy_tag</a>) {
|
|
<a name="l00512"></a>00512 <a class="code" href="a00610.html#aada705f9d1fd36fc1af3b703217ec69e">BOOST_UBLAS_CHECK</a> (v.size () == e ().size (), <a class="code" href="a00016.html">bad_size</a> ());
|
|
<a name="l00513"></a>00513 <span class="keyword">typedef</span> F<typename V::iterator::reference, typename E::iterator::reference> functor_type;
|
|
<a name="l00514"></a>00514 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::size_type size_type;
|
|
<a name="l00515"></a>00515 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::difference_type difference_type;
|
|
<a name="l00516"></a>00516 <span class="keyword">typedef</span> <span class="keyword">typename</span> V::value_type value_type;
|
|
<a name="l00517"></a>00517
|
|
<a name="l00518"></a>00518 <a class="code" href="a00653.html#af86e444b5972e9b0ee8afbbcd533bd7a">detail::make_conformant</a> (v, e);
|
|
<a name="l00519"></a>00519 <span class="comment">// FIXME should be a seperate restriction for E</span>
|
|
<a name="l00520"></a>00520 <a class="code" href="a00653.html#af86e444b5972e9b0ee8afbbcd533bd7a">detail::make_conformant</a> (e (), v);
|
|
<a name="l00521"></a>00521
|
|
<a name="l00522"></a>00522 <span class="keyword">typename</span> V::iterator it (v.begin ());
|
|
<a name="l00523"></a>00523 <span class="keyword">typename</span> V::iterator it_end (v.end ());
|
|
<a name="l00524"></a>00524 <span class="keyword">typename</span> E::iterator ite (e ().<a class="code" href="a00595.html#ae2297dd9051333c2ec1d0f63175f66fe" title="An iterator to the first element of the given vector expression.">begin</a> ());
|
|
<a name="l00525"></a>00525 <span class="keyword">typename</span> E::iterator ite_end (e ().<a class="code" href="a00595.html#a5e8a7fc1352cd3e148064608dad9f38d" title="An iterator to the last element of the given vector expression.">end</a> ());
|
|
<a name="l00526"></a>00526 <span class="keywordflow">if</span> (it != it_end && ite != ite_end) {
|
|
<a name="l00527"></a>00527 size_type it_index = it.index (), ite_index = ite.index ();
|
|
<a name="l00528"></a>00528 <span class="keywordflow">while</span> (<span class="keyword">true</span>) {
|
|
<a name="l00529"></a>00529 difference_type compare = it_index - ite_index;
|
|
<a name="l00530"></a>00530 <span class="keywordflow">if</span> (compare == 0) {
|
|
<a name="l00531"></a>00531 functor_type::apply (*it, *ite);
|
|
<a name="l00532"></a>00532 ++ it, ++ ite;
|
|
<a name="l00533"></a>00533 <span class="keywordflow">if</span> (it != it_end && ite != ite_end) {
|
|
<a name="l00534"></a>00534 it_index = it.index ();
|
|
<a name="l00535"></a>00535 ite_index = ite.index ();
|
|
<a name="l00536"></a>00536 } <span class="keywordflow">else</span>
|
|
<a name="l00537"></a>00537 <span class="keywordflow">break</span>;
|
|
<a name="l00538"></a>00538 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (compare < 0) {
|
|
<a name="l00539"></a>00539 <a class="code" href="a00595.html#a00e524ed262cdf2bef30737b1ad05b3e">increment</a> (it, it_end, - compare);
|
|
<a name="l00540"></a>00540 <span class="keywordflow">if</span> (it != it_end)
|
|
<a name="l00541"></a>00541 it_index = it.index ();
|
|
<a name="l00542"></a>00542 <span class="keywordflow">else</span>
|
|
<a name="l00543"></a>00543 <span class="keywordflow">break</span>;
|
|
<a name="l00544"></a>00544 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (compare > 0) {
|
|
<a name="l00545"></a>00545 <a class="code" href="a00595.html#a00e524ed262cdf2bef30737b1ad05b3e">increment</a> (ite, ite_end, compare);
|
|
<a name="l00546"></a>00546 <span class="keywordflow">if</span> (ite != ite_end)
|
|
<a name="l00547"></a>00547 ite_index = ite.index ();
|
|
<a name="l00548"></a>00548 <span class="keywordflow">else</span>
|
|
<a name="l00549"></a>00549 <span class="keywordflow">break</span>;
|
|
<a name="l00550"></a>00550 }
|
|
<a name="l00551"></a>00551 }
|
|
<a name="l00552"></a>00552 }
|
|
<a name="l00553"></a>00553
|
|
<a name="l00554"></a>00554 <span class="preprocessor">#if BOOST_UBLAS_TYPE_CHECK</span>
|
|
<a name="l00555"></a>00555 <span class="preprocessor"></span> <a class="code" href="a00595.html#a00e524ed262cdf2bef30737b1ad05b3e">increment</a> (ite, ite_end);
|
|
<a name="l00556"></a>00556 <a class="code" href="a00595.html#a00e524ed262cdf2bef30737b1ad05b3e">increment</a> (it, it_end);
|
|
<a name="l00557"></a>00557 <span class="preprocessor">#endif</span>
|
|
<a name="l00558"></a>00558 <span class="preprocessor"></span> }
|
|
<a name="l00559"></a>00559
|
|
<a name="l00560"></a>00560 <span class="comment">// Dispatcher</span>
|
|
<a name="l00561"></a>00561 <span class="keyword">template</span><<span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2> <span class="keyword">class </span>F, <span class="keyword">class </span>V, <span class="keyword">class </span>E>
|
|
<a name="l00562"></a>00562 <a class="code" href="a00603.html#a578c14139742374e9a04e5afcb6cd24c">BOOST_UBLAS_INLINE</a>
|
|
<a name="l00563"></a><a class="code" href="a00595.html#ad51e89cf1bed51eb70755ab244f52b83">00563</a> <span class="keywordtype">void</span> <a class="code" href="a00595.html#ad72e2ed90f4d1ce5a3ac8ae059419613">vector_swap</a> (V &v, <a class="code" href="a00507.html" title="Base class for Vector Expression models.">vector_expression<E></a> &e) {
|
|
<a name="l00564"></a>00564 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00544.html">vector_swap_traits</a><<span class="keyword">typename</span> V::storage_category,
|
|
<a name="l00565"></a>00565 <span class="keyword">typename</span> E::const_iterator::iterator_category>::storage_category storage_category;
|
|
<a name="l00566"></a>00566 vector_swap<F> (v, e, storage_category ());
|
|
<a name="l00567"></a>00567 }
|
|
<a name="l00568"></a>00568
|
|
<a name="l00569"></a>00569 }}}
|
|
<a name="l00570"></a>00570
|
|
<a name="l00571"></a>00571 <span class="preprocessor">#endif</span>
|
|
</pre></div></div>
|
|
</div>
|
|
<div id="nav-path" class="navpath">
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="a00642.html">vector_assign.hpp</a> </li>
|
|
<!--- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Defines</a></div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<small>
|
|
<small>
|
|
<small>
|
|
<table width="100%">
|
|
<tr>
|
|
<td align="right">
|
|
Copyright © 2010-2011 David Bellot - Distributed under the <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">Boost Software License, Version 1.0.</a>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
</small>
|
|
</small>
|
|
</small>
|