- Boost-users - lists.boost.org

Re: [Boost-users] Any function in boost::regex to escape everything of a text
by llwaeva＠21cn.com 14 Mar '07

14 Mar '07

> hi there, > I am working with a pattern-replace job with boost:regex. For > convenience, I use replace_all_regex to do that. Here is my code > > replace_all_regex( TEXT_TO_BE_REPLACED, regex_exp, format_string, > format_all ); > > TEXT_TO_BE_REPLACED is a text containing some patterns like %a, %b > and %c which will be repalced with a specific string(format_string) > that is inputed by user. However, the input string (format_string) > may have some characters related to the regular expression, such > characters must be escaped before the substitution. The following > > code is for that purpose > > > > replace_all( input, "$", "$$" ); > > replace_all( input, "\\", "\\\\" ); > > replace_all( input, ":", "\\:" ); > > replace_all( input, "?", "\\?" ); >> > replace_all( input, "(", "\$" ); > > replace_all( input, ")", "\$" ); > > > > The substitution works fine sometimes and fails when the input string > > (format_string) contains character which is not escaped. I just > > wonder if there is any function defined in boost::regex to escape all > > SPECIAL characters. > Use "format_literal" rather than "format_all" and all the characters in the > format string will be output "as is", and none will be treated as special > characters. > John. I try format_literal, but it reports error while compiling "error C2065: 'format_literal' : undeclared identifier" I am using the latest version of boost. Microsoft Visual Studio 2005, XP

2 1

[program_options] Unsure about linking options
by Ovanes Markarian 13 Mar '07

13 Mar '07

Hi! I am not sure if this is the issue of the program_options library or of all libraries at all. I got the HEAD revision from CVS and successfully compiled required libraries. One of the required libs is program_options. I have variations of the compiled lib with a name as: boost_program_options-vc-mt-1_35.lib When I try to recompile my code I get a linking error stating: LINK : fatal error LNK1104: cannot open file 'libboost_program_options-vc80-mt-gd-1_35.lib' My question is: Why is compiler still looking for libboost_program_options-vc80-mt-gd-1_35.lib? Do I have to change some config files? If yes, which? With Kind Regards, Ovanes Markarian

4 6

iostream and mapped_file
by Aljaz 13 Mar '07

13 Mar '07

Hello Is there any example how to use boost::iostream mapped_file ? I couldnt find any.. Which are the reasons that should make me consider using mapped_file stream? I want to read my text file as fast as possible (not all at once) - it should be seekable.. I know I should open file in binary mode and do read() to fixed size blocks to achieve the best preformance, but then I would have problems separating lines (I was consider using tokenizer but it would require stl data type so I would have to copy data). Is it possible to solve this problem with using boost::iostream filter so that it would be faster than getline()? Any help is highly appreciated! Thank you very much Aljaz

1 0

Any function in boost::regex to escape everything of a text
by llwaeva＠21cn.com 13 Mar '07

13 Mar '07

hi there, I am working with a pattern-replace job with boost:regex. For convenience, I use replace_all_regex to do that. Here is my code replace_all_regex( TEXT_TO_BE_REPLACED, regex_exp, format_string, format_all ); TEXT_TO_BE_REPLACED is a text containing some patterns like %a, %b and %c which will be repalced with a specific string(format_string) that is inputed by user. However, the input string (format_string) may have some characters related to the regular expression, such characters must be escaped before the substitution. The following code is for that purpose replace_all( input, "$", "$$" ); replace_all( input, "\\", "\\\\" ); replace_all( input, ":", "\\:" ); replace_all( input, "?", "\\?" ); replace_all( input, "(", "\$" ); replace_all( input, ")", "\$" ); The substitution works fine sometimes and fails when the input string (format_string) contains character which is not escaped. I just wonder if there is any function defined in boost::regex to escape all SPECIAL characters. Thanks in advance.

2 1

[lambda / multi_index] compilation problem
by Filip Konvička 13 Mar '07

13 Mar '07

Hi, getting lambda work with multi_index seems a bit tough for me.... the following compiles fine with MSVC++ 2003, but not when I #include sequenced_index.hpp or ordered_index.hpp. The error message says: error C2872: '_1' : ambiguous symbol could be 'c:\Boost\include\boost-1_33_1\boost\lambda\core.hpp(69) : const boost::lambda::placeholder1_type &boost::lambda::`anonymous-namespace'::_1' or 'c:\Boost\include\boost-1_33_1\boost\bind\placeholders.hpp(42) : boost::arg `anonymous-namespace'::_1' with [ I=1 ] This can of course be fixed by using boost::lambda::_1, but I doubt that it is the expected behavior. Can anyone please explain what I'm doing wrong? Thanks, Filip #include <boost/config.hpp> #include <boost/lambda/lambda.hpp> #include <boost/multi_index_container.hpp> #include <boost/multi_index/member.hpp> #include <boost/multi_index/hashed_index.hpp> //#include <boost/multi_index/sequenced_index.hpp> //#include <boost/multi_index/ordered_index.hpp> #include <list> using namespace boost; using namespace boost::lambda; int main(int argc, char* argv[]) { std::list<int> v(10); for_each(v.begin(), v.end(), _1 = 1); return 0; }

2 2

boost::ref and boost:::function
by misiu 13 Mar '07

13 Mar '07

Hello, Could you please tell me how to compare two boost::function objects packet with boost::ref. I have container which has boost::function elements and to add elements is not a problem but to remove particular one I don't know how to do that (compare two boost:ref-s). The problem is shown in the code below. Regards, Bartek //code #include <iostream> #include <list> #include <boost/ref.hpp> #include <boost/function.hpp> struct test{ int a; void operator() (int aa) { a += aa; } }; struct function_list { std::list<boost::function<void (int v)> > fun_list; void add(boost::function<void (int v)> fun) { fun_list.push_back(fun); } void remove(boost::function<void (int v)> fun) { std::list<boost::function<void (int v)> >::iterator iter; //HOW TO IMPLEMETN THIS FIND_IF? //std::find_if(fun_list.begin(), fun_list.end(), MISSING_PART); if(iter != fun_list.end()) fun_list.erase(iter); } }; int main(int argc, char **argv) { test a, b; function_list f; f.add(boost::ref(a)); f.add(boost::ref(b)); //DOES NOT WORK f.remove(boost::ref(a)); }

4 4

help extracting TAG with boost::regex
by llwaeva＠21cn.com 13 Mar '07

13 Mar '07

hi there, I am working with a TAG-oriented text with boost:regex. For example, the following pattern might occur in the text <before> <pre>Some Text</pre> <after> <pre> ddd </pre> In this case, I would like to extract everything between <pre> </pre>. Meanwhile, everything outside <pre> </pre> should be unchanged except that < is replaced by < and > is replaced by > For that purpose, I tried the following code boost::regex regexp("<\s*pre[^>]*>(.*?)<\s*/pre\s*>", boost::regex::icase); boost::match_results<std::string::const_iterator> what; if (regex_search(sometext, what, regexp,boost::match_default|boost::format_first_only)) { std::string between_tag = std::string(what[1].first, what[2].second) + "\r\n"; MessageBox(0, between_tag.c_str(), "", 0); std::string left_tag(sometext.begin(), what[1].first); std::string right_tag(what[1].second, sometext.end()); replace_all<string, LPCSTR, LPCSTR>( left_tag, "<", "<" ); replace_all<string, LPCSTR, LPCSTR>( right_tag, ">", ">"); sometext = left_tag + between_tag + right_tag + "\r\n"; } However, the code seems not works propely unless nothing outside <pre> </pre>. In addition, when the text being handled contains the \r\n, the code return error no matter if left_tag and right_rag is null or not. In a far more complicated case, a nested <pre></pre> might occur as follow <before> <pre><pre>Some Text</pre></pre> <after> <pre> ddd </pre> For this case, I only want to handle the outermost <pre></pre> and keep everything inside it unchanged, i.e., the inner <pre></pre> will be extracted as common text. Any idea? Thanks in advance.

2 1

Re: [Boost-users] [asio].[aix].[1_33_1] Update regarding test cases compilation
by Gaurav.Jain＠iflexsolutions.com 13 Mar '07

13 Mar '07

Hi chris, Christopher Kohlhoff <chris <at> kohlhoff.com> writes: > > Hi Gaurav, > > I just finished uploading it: > > http://sourceforge.net/project/showfiles.php?group_id=122478 > > Hopefully it will fix the issues for Solaris and AIX. > > On Wed, 21 Feb 2007 12:02:59 +0530, Gaurav.Jain <at> iflexsolutions.com said: > > No issues at all. Would you want me to try out boost.asio on Windows > > 2003 Server (SP1) - Itanium ? > > Yes please, if it's not too much trouble. The more the merrier :) > > Cheers, > Chris The bzip file of boost asio library available in the above mentioned link (boost_asio_0_3_8rc2.tar.bz2) is giving checksum error while extracting. Thanks & Regards, Gaurav Jain DISCLAIMER: This message contains privileged and confidential information and is intended only for an individual named. If you are not the intended recipient, you should not disseminate, distribute, store, print, copy or deliver this message. Please notify the sender immediately by e-mail if you have received this e-mail by mistake and delete this e-mail from your system. E-mail transmission cannot be guaranteed to be secure or error-free as information could be intercepted, corrupted, lost, destroyed, arrive late or incomplete or contain viruses. The sender, therefore, does not accept liability for any errors or omissions in the contents of this message which arise as a result of e-mail transmission. If verification is required, please request a hard-copy version.

1 0

[BGL] Runaway memory usage
by Scott West 13 Mar '07

13 Mar '07

I have a particular graph that I'm constructing from a different form, namely a list of points, and a list of pairs of points (with distances) to represent the edges of the graph. I carry these around, then I try to make a graph with a vecS vertex set. The problem is, I think somehow I'm leaking memory. I've called g.clear() at the end of the use of the graph, but the memory usage appears not to drop when the function exits. Is there any reason why this could be the case? I know my description is pretty vague, just wondering if there was a standard operating procedure when working with semi-large graphs (~1000 nodes, ~43000 edges). It eats memory pretty fast, and I'm not comfortable enough with c++ to accurately diagnose where the leak is. Any help would be great, thanks! Scott West

1 0

[Boost.Random] Feature Request - Weibull Distribution
by johneddy101＠comcast.net 12 Mar '07

12 Mar '07

Is there any interest in adding a Weibull distribution to the list of random distributions? I have taken an initial cut at it and would be glad to share it if so. John

1 0