Hi Eric,<div><br></div><div>Thank you for the perfect answer! Could you please guide me with some classes/methods names in libraries you told?</div><div><br></div><div>For memory-map the file with Boost.Interprocess, what is the class you have in mind? I found basic_managed_mapped_file but how can i use it with Boost.Xpressive regex_replace() function?</div>
<div><br></div><div><meta http-equiv="content-type" content="text/html; charset=utf-8"><a href="http://www.boost.org/doc/libs/1_46_1/doc/html/interprocess/managed_memory_segments.html#interprocess.managed_memory_segments.managed_mapped_files">http://www.boost.org/doc/libs/1_46_1/doc/html/interprocess/managed_memory_segments.html#interprocess.managed_memory_segments.managed_mapped_files</a></div>
<div><br></div><div>I&#39;ve looked Boost.Filesystem other day and someone told me about unique_path() function, could i use it even with concurrent tasks (Boost.MPI)? Change the model of unique_path() with the rank of the process will avoid overwrite the generated files?</div>
<div><br></div><div><meta http-equiv="content-type" content="text/html; charset=utf-8"><a href="http://www.boost.org/doc/libs/1_44_0/libs/filesystem/v3/doc/reference.html#unique_path">http://www.boost.org/doc/libs/1_44_0/libs/filesystem/v3/doc/reference.html#unique_path</a></div>
<div><br></div><div>Best regards,</div><div>Júlio.</div><div><br><div class="gmail_quote">2011/4/2 Eric Niebler <span dir="ltr">&lt;<a href="mailto:eric@boostpro.com">eric@boostpro.com</a>&gt;</span><br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
-----BEGIN PGP SIGNED MESSAGE-----<br>
Hash: SHA1<br>
<br>
On 4/2/2011 8:23 AM, Júlio Hoffimann wrote:<br>
&lt;snip&gt;<br>
<div class="im">&gt; As far as i know, Boost.Xpressive treats only std::string and C-like<br>
&gt; strings.<br>
<br>
</div>Not so. Both Boost.Xpressive and Boost.Regex work on bidirectional<br>
iterator.<br>
<div class="im"><br>
&gt; What i need to do for work with text files? Put them inside a<br>
&gt; std::string?<br>
<br>
</div>That&#39;s one way. A more efficient way would be to memory-map the file,<br>
which I think you can do portably using Boost.Interprocess. That should<br>
give you a random-access iterator to the source file.<br>
<div class="im"><br>
&gt; About the performance, the files has approximately 10^3<br>
&gt; lines, the search and replace will be an issue?<br>
<br>
</div>You should use the version of regex_replace that takes an output<br>
iterator, and either write into a string or vector. They both grow their<br>
capacity exponentially (or should if your STL implementation is worth<br>
anything), so this is quite efficient. Or, with an ofstream iterator,<br>
you can write directly to a temporary output file. I think the latest<br>
version of Boost.Filesystem has a portable way to create temporary<br>
files. Then you can do whatever you want with the temp file.<br>
<br>
HTH,<br>
<br>
- --<br>
Eric Niebler<br>
BoostPro Computing<br>
<a href="http://www.boostpro.com" target="_blank">http://www.boostpro.com</a><br>
-----BEGIN PGP SIGNATURE-----<br>
Version: GnuPG v1.4.9 (MingW32)<br>
Comment: Using GnuPG with Mozilla - <a href="http://enigmail.mozdev.org/" target="_blank">http://enigmail.mozdev.org/</a><br>
<br>
iQEcBAEBAgAGBQJNlsyRAAoJEAeJsEDfjLbXQKEH/R/UFdXez0Nxp11nRqDuItUc<br>
OjlI0cbWJhS+vvKDmGhFbRAGLLUdaQ+8rrmEtuPhbyKv3khjlVklgtbQlMoC9bu+<br>
RZrNgzVm2Ro1QcHG23NWsYky1NVuiaNXXHLB9kf05ibInzyVTvq3yewnBoXzMQ5o<br>
ynGFsSmbp+STAuESl/hUM+6yirqQHLXfuidBpXVFyTh/9TsL8FVYnsbrzxNrxwQB<br>
uhUYXCgPCxXC9MquxdH1MKNUcL1k9DQr7YGcZpHn6j+tsKHijEsfzn0Yy1KyMEIH<br>
Ljnx8dCszZrWobXUqjBVxMuK2m9ptbZeJfLfi/I6g9a5seoaPAdjIBl5zXo8qko=<br>
=t0HL<br>
-----END PGP SIGNATURE-----<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>
</blockquote></div><br></div>