why not using an stl algorithm? If you use ordered_non_unique you can use the for_each algorithms with an inserter functor.<br><br>Ovanes<br><br><br><br><div class="gmail_quote">On Tue, Apr 28, 2009 at 3:46 PM, arm2arm <span dir="ltr">&lt;<a href="mailto:arm2arm@gmail.com">arm2arm@gmail.com</a>&gt;</span> wrote:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;"><br>
Hello,<br>
Are there way to merge two multiindex objects ?<br>
suppouse we have :<br>
<br>
struct strData{<br>
int id;<br>
float a, b;<br>
strData(int id_, float a_, float b_):a(a_),b(b_),id(id_){}<br>
};<br>
<br>
typedef multi_index_container&lt;<br>
    strData,<br>
    indexed_by&lt;<br>
    ordered_unique&lt;<br>
    tag&lt;id&gt;,  BOOST_MULTI_INDEX_MEMBER(strData,int,id)&gt;,<br>
    ordered_non_unique&lt;<br>
    tag&lt;snap&gt;,BOOST_MULTI_INDEX_MEMBER(strData,float,a)&gt;<br>
    &gt;<br>
    &gt; data_setA, data_setB;<br>
Are there way to do:<br>
<br>
data_setA.merge(data_setB) ?<br>
<br>
thank you beforehand.<br>
Arman.<br>
<font color="#888888">--<br>
View this message in context: <a href="http://www.nabble.com/Boost.MultiIndex-question-on-merge-tp23277496p23277496.html" target="_blank">http://www.nabble.com/Boost.MultiIndex-question-on-merge-tp23277496p23277496.html</a><br>

Sent from the Boost - Users mailing list archive at Nabble.com.<br>
<br>
_______________________________________________<br>
Boost-users mailing list<br>
<a href="mailto:Boost-users@lists.boost.org">Boost-users@lists.boost.org</a><br>
<a href="http://lists.boost.org/mailman/listinfo.cgi/boost-users" target="_blank">http://lists.boost.org/mailman/listinfo.cgi/boost-users</a><br>
</font></blockquote></div><br>