- Boost-users - lists.preview.boost.org

Using regex with Visual Studio. NET 2003
by Hans Merkl 07 Jan '04

07 Jan '04

Hi, I am porting a project that uses regex from Visual Studio 6 to Visual Studio .NET 2003. It works fine with VS6, but now I am getting linker errors: TestConsole.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall boost::reg_expression<char,class boost::regex_traits<char>,class std::allocator<char> >::~reg_expression<char,class boost::regex_traits<char>,class std::allocator<char> >(void)" (__imp_??1?$reg_expression@DV?$regex_traits@D@boost@@V?$allocator@D@std@@@ boost@@QAE@XZ) referenced in function _main TestConsole.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall boost::reg_expression<char,class boost::regex_traits<char>,class std::allocator<char> >::reg_expression<char,class boost::regex_traits<char>,class std::allocator<char> >(char const *,unsigned int,class std::allocator<char> const &)" (__imp_??0?$reg_expression@DV?$regex_traits@D@boost@@V?$allocator@D@std@@@ boost@@QAE@PBDIABV?$allocator@D@std@@@Z) referenced in function _main I have changed the C-runtime library settings, I have set BOOST_REGEX_STATIC_LINK to make sure I link against the static version, but nothing worked. Looking at the error messages, it seems I am still linking against the DLL version (dllimport). Does anybody have regex working with .NET 2003? Thanks Hans Merkl

3 3

RE: [Boost-users] Spirit Example does not build
by rip snorta 06 Jan '04

06 Jan '04

Hi Ben, >From: "Ben Hutchings" <ben.hutchings(a)businesswebsoftware.com> >Reply-To: Boost Users mailing list <boost-users(a)lists.boost.org> >To: "Boost Users mailing list" <boost-users(a)lists.boost.org> >Subject: RE: [Boost-users] Spirit Example does not build >Date: Tue, 6 Jan 2004 16:27:54 -0000 > > >This is a problem with the standard library implementation. Although >VC++ 6 has some support for template member functions, the library that >comes with it was written for an earlier version that did not and was >not updated to include template member functions. So it does not >define the constructor template for std::deque that takes two iterators >(though it does define a constructor that takes two const T * pointers, >where T is the element type). > >I think the example will work if you install STLPort or Dinkumware's >newer library as a (partial) replacement for VC++ 6's standard library. >_______________________________________________ This was one of the next things I was thinking of doing. I just wanted to see if there was anything simple I was missing before I installed one of the other STLs. Looks like STLPort is the go then! cheers John _________________________________________________________________ Worried about inbox overload? Get MSN Extra Storage now! http://join.msn.com/?PAGE=features/es

1 0

RE: [Boost-users] Spirit Example does not build
by Ben Hutchings 06 Jan '04

06 Jan '04

John <ripsnorta(a)operamail.com> wrote: > I have been trying to get one of the spirit examples, regex_convert > to build using VC6, service pack 5. I am using boost 1-30.2 for this > exercise. I get the following error message. > > error C2664: '__thiscall std::deque<char,class std::allocator<char> > >::std::deque<char,class std::allocator<char> >(unsigned int,const > char&,const class std::allocator<char> &)' That means a constructor for std::deque. > : cannot convert parameter 1 from 'class std::istreambuf_iterator< > char,struct std::char_traits<char> >' to 'unsigned int' > No user-defined-conversion operator available that can > perform this conversion, or the operator cannot be called > > I was wondering if this was a known issue, or if there was something > else that I needed to do. This is a problem with the standard library implementation. Although VC++ 6 has some support for template member functions, the library that comes with it was written for an earlier version that did not and was not updated to include template member functions. So it does not define the constructor template for std::deque that takes two iterators (though it does define a constructor that takes two const T * pointers, where T is the element type). I think the example will work if you install STLPort or Dinkumware's newer library as a (partial) replacement for VC++ 6's standard library.

1 0

Problem Building boost for cygwin g++ with stlport on WinXP
by Markus Ruettimann 06 Jan '04

06 Jan '04

Hi all I'm an enthusiastic user of boost since quite a long time. I used MSVC6.0 so far. How ever, I changed to cygwin g++ 3.3.1 for project reasons. I have succesfuly built the latest STLPort version (4.6) and I also use it successfully. How ever, I am not able to build the toolset gcc-stlport. There are errors in the threadding lib and elsewhere, and such ugly things as "to long path names" errors in the console. Does anybody know how to build this toolset and link them together as one static lib? I use boost-1.30.2 with cygwin g++ 3.3.1 on winXP professional. PS: When I build the bjam stuff, what builds without any errors, it uses the MSVC compiler (the output it creates looks like this). Is this a problem? Thanks for your help Markus. -- Using M2, Opera's revolutionary e-mail client: http://www.opera.com/m2/

2 3

Spirit Example does not build
by John 06 Jan '04

06 Jan '04

Hi, I have been trying to get one of the spirit examples, regex_convert to build using VC6, service pack 5. I am using boost 1-30.2 for this exercise. I get the following error message. error C2664: '__thiscall std::deque<char,class std::allocator<char> >::std::deque<char,class std::allocator<char> >(unsigned int,const char &,const class std::allocator<char> &)' : cannot convert parameter 1 from 'class std::istreambuf_iterator<char,struct std::char_traits<char> >' to 'unsigned int' No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called I was wondering if this was a known issue, or if there was something else that I needed to do. cheers John

1 0

Longest path in a DAG using BGL
by Ramprasad Natrajan 03 Jan '04

03 Jan '04

Hi, I am trying to find the longest path in a DAG using the BGL Dijkstra function. The call I used is: dijkstra_shortest_paths(hcg, s, &p[0], &d[0], weightmap, indexmap, std::greater<int>(), closed_plus<int>(), 0,MAXINT,dijkstra_visitor<null_visitor>()); where MAXINT is set high enough to be greater than the maximum path length. This doesn't seem to do the trick. Any suggestions? Thanks a real lot, Ram _________________________________________________________________ Feeling like a vacation? Then you are in the right place. http://www.msn.co.in/Travel/ Get the best travel deals here!

1 0

how to get started? (not in documentation)
by Tom Weber 01 Jan '04

01 Jan '04

Hello, I downloaded boost today so regard me as a newbie. Boost seems great, but the documentation doesn't mention how I should install boost on my system (redhat 9), and how to link against the built libraries. Sure I can include it in every project (though it's huge!), and make the makefiles link into strange locations such as libs/test/build/bin/libboost_unit_test_framework.a/gcc/debug/runtime-link-static/threading-single/libboost_unit_test_framework.a Is there an easier way? Why aren't packages like boost-[devel-]VERSION.PLATFORM.rpm made? Why aren't all built libraries put in the same directory, with a simple path name? Why isn't the thread library built statically? Is putting a "lib" section with BOOST_THREAD_BUILD_STATIC=1 in the Jamfile a legal fix? (seems to work) Also... I think boost should have a network library. Can anyone recommend a platform-independent network library? I'm thankful for any answer... -- Cheers, Tom Weber http://www.dd.chalmers.se/~np98towe/

6 7

using regex for in-place string modification
by Scott Meyers 29 Dec '03

29 Dec '03

I want to use regex to modify a string in place. In particular, I've read the contents of a file into a string, now I want to do some search/replace functions on the string, then write the modified string back out to the original file. I've looked through the regex documentation, including the October 2001 DDJ article, but I don't see any way to modify a string in place. From what I can tell, regex_merge looks like it does the kind of thing I want, except it doesn't seem to modify in place. I'd prefer to avoid creating two strings of each file's contents, one before regex processsing, one after. Is there functionality in regex that will let me modify a string in place? Thanks, Scott

7 8

problem with regex_fwd.hpp
by Stefan Shishkov 29 Dec '03

29 Dec '03

Hi, I had a small problem using boost::regexp on MS VC 6.0, boost 1.30.2. In one of my headers I included regex_fwd.hpp. The compilation failed with: ..\boost-1.30.2\boost/detail/allocator.hpp(215): error C2065: 'assert': undeclared identifier Allocator.hpp does not include <cassert> probably relying that it will be included before it. I solved this problem by including <cassert> before regex_fwd.hpp but may be it is better to change allocator.hpp? Or probably something is wrong with my configuration? Best regards Stefan

2 1

error C2668 with <boost/regex.hpp>
by Yiftah Frechter 28 Dec '03

28 Dec '03

Hi guys, I'm trying to use boost regex with VC6 Receiving the following error: error C2668: 'sprintf' : ambiguous call to overloaded function there is no "using namespace std" in my code. Appreciate any help. Yiftah

2 1

undirected graph cycle
by magh＠lehigh.edu 27 Dec '03

27 Dec '03

Is there any easy way to use DFS visitors to return a cycle in an undirected graph? The examples show how to detect if a cycle exists. How do you actually extract it? For my instance, I am dealing with an undirected graph that is a 1-tree, i.e., I know there is exactly one cycle. Thanks, Matt ------------------------------------------------- This mail sent through IMP: http://horde.org/imp/

1 0

date_time: number of days between dates
by Lars Schouw 25 Dec '03

25 Dec '03

I found a solution: long no_days(boost::gregorian::date d1, boost::gregorian::date d2) { using namespace boost::gregorian; using namespace boost::posix_time; date_period dp(d1, d2); return dp.length().days(); } --------------------------------- Do you Yahoo!? Yahoo! Photos - Get your photo on the big screen in Times Square

2 1

date_time converting from date to number of days
by Lars Schouw 24 Dec '03

24 Dec '03

I want to find the number of days in-between two days. What is the easiest way to do this? I am using the date_time lib and want to find the number of days from the time_t started. ptime timet_start(date(1970,1,1)); ptime t(d); time_duration diff = t - timet_start; ptime t123(diff); // timeval tv; //drop off the fractional seconds... // tv.tv_sec = diff.ticks()/time_duration::rep_type::res_adjust(); return 0; // return difference.days; Lars Schouw --------------------------------- Do you Yahoo!? Yahoo! Photos - Get your photo on the big screen in Times Square

1 0

lexical_cast and whitespace, part 2
by Miro Jurisic 18 Dec '03

18 Dec '03

I was trying to do the following: class MyString; std::istream oprator>>(std::istream&, MyString&); std::string s1 = "Hello, World"; MyString s2 = lexical_cast <MyString> (s); It doesn't work. The reason for it failing is: a. the semantics of operator>>(std::istream&, MyString&) are identical to the semantics of operator>>(std::istream&, std::string&) b. the semantics of operator>>(std::istream&, std::string&) are to read the stream up to the first whitespace (as per the stream locale) c. lexical_cast uses (via lexical_stream) operator>>(std::istream&, MyString&) to read the data into MyString The upshot of this is that lexical_cast writes "Hello, World" to the stream (via operator<<(std::ostream&, const std::string&)), reads off "Hello," to MyString (via operator>>(std::istream&, MyString&)), and then throws a bad lexical_cast after noticing there's data left on the stream. The natural question is why it is that this works when converting to a std::string; it seems that it should have the same problem. The answer is that boost::detail::lexical_stream has a lexical_stream::operator>>(std::string&) which ignores whitespace, thus working around the problem if (and only if) the target type of the cast is std::string. Attempting to use lexical_cast with any string type other than std::string fails when the source data contains (non-trailing) whitespace. This is suboptimal. I am going to try a workaround shortly, by partially specializing lexical_stream, but that's just a workaround. I don't see any way to do this without a. breaking the lexical_cast abstraction barrier (as I am about to do) or b. making the semantics of operator>>(istream&, MyString&) differ from those of operator>>(istream&, std::string&) I don't think either of those is the rigt answer. Is there one? Shouldn't there be one? Thanks, meeroh

1 0

Problems with Multi Threaded Version
by Zeros and Ones 18 Dec '03

18 Dec '03

So far I was using the Single Threaded Run Time Library and had no trouble with Boost, however I switched to useing the Run Time Versions just now and found that nothing seemed to work and the error that I get is: "Boost_Regex_vc7_mdid.dll was not found. Re-installing the application may fix this problem" However, the instructions on the website state : "Finally when you use regex++ it is only necessary for you to add the <boost> root directory to your list of include directories for that project. It is not necessary for you to manually add a .lib file to the project; the headers will automatically select the correct .lib file for your build mode and tell the linker to include it. " Im using VC7, and I cant understand why I get this error, do I need to change some setting while linking to the multi threaded versions? For now, I copied the two dll's _boost_regex_vc7_mdid.dll and _boost_regex_vc7_mdi.dll to my working directory and I have a working application, but Im foxed and I would like to know what im doing wrong! Thanks. "Zeros Bits and Bytes"

1 0

BGL and reversing / moving edges
by joshrose 17 Dec '03

17 Dec '03

G'day, I was hoping someone might be able to tell me if they've run into any situations using BGL where they needed to move (or reverse (i.e. flip the source and target)) an edge within a graph implemented as an adjacency_list. I'm working on an implementation of an algorithm for max. weight bipartite matching ("the assignment problem"), and one of the assumptions in the algorithm is that non-matched edges are directed from one subgraph, A, to the other subgraph, B, and matched edges are directed the other way. Over the course of growing the matching, a simple way to add and remove edges from the candidate set is just to reverse the edge, thus the need for some way to reverse the edge within BGL. I don't think I can just remove and then re-add the edge in the other direction, primarily because doing so will (I believe) invalidate any edge_descriptors referring to that edge. In particular, there are property maps keeping track of the weight of edges, the predecessors of certain nodes, etc. that use edge descriptors as keys. I've spent a fair bit of time reading the documentation and looking through the implementation of adjacency_lists (incl. edge_list_impl), and I'm not really sure of a way to either move an edge directly within a graph, or even to create a new edge from another s.t. they have the same edge_descriptor (in general a bad thing, probably). Anyone have any thoughts on this? Thanks, -Josh

4 10

Re: [Boost-users] Newbie question: block read inputs to regex
by annirak＠shaw.ca 17 Dec '03

17 Dec '03

----- Original Message ----- From: John Maddock <john(a)johnmaddock.co.uk> Date: Saturday, December 13, 2003 4:06 am Subject: Re: [Boost-users] Newbie question: block read inputs to regex > > I'm using regex_grep() to search through file contents for > matches. I > want to read the file in blocks to keep memory use down for large > files.What I want to know is whether there is some way of adding > the next block of > memory to the grep where the last one left off. > > > > The best solution I can come up with is using some sort of > double-buffering scheme, but that would take an awful lot of > memory copies > and searching some text multiple times. Both things I would > prefer to > avoid. > > > > What can I do? > > Have you looked at the partial match examples - there is one that > searches a > file in chunks. > > John. Ah, thank you, somehow I had missed that. --Brendan

1 0

Boost Software License: redistribute modified works?
by Steve M. Robbins 16 Dec '03

16 Dec '03

Hi, I've a question for the drafters of the Boost Software License - Version 1.0 - August 17th, 2003. Put yourself in the position of someone who wants to redistribute a modified version of Boost. For example, the linux distributors like Debian. The license begins with the permission grant: Permission is hereby granted, free of charge, to any person or organization obtaining a copy of the software and accompanying documentation covered by this license (the "Software") to use, reproduce, display, distribute, execute, and transmit the Software, and to prepare derivative works of the Software, and to permit third-parties to whom the Software is furnished to do so, all subject to the following: [... a restriction and a disclaimer paragraph ...] As I read this, "the Software" means "the unmodified tar or zip file obtained from boost.org". Is that correct? I'm permitted to "prepare derivative works of the Software", but the license doesn't specify what I may do with my derivative works. Clearly, I may distribute "the Software", but may I distribute the derivative work? Some licenses (e.g. the BSD and the GPL) make it clear that the terms apply to both the software and to derivative works. Shouldn't the boost license do likewise? -Steve

2 1

building boost libraries on Solaris
by K. Herman Chen 16 Dec '03

16 Dec '03

Has anyone built Boost Libraries using Sun/Solaris CC? I first built bjam using gcc on Solaris. But in the next step, 'bjam "-sTOOLS=CC"' (ie Solaris CC), it failed miserably. Since CC is not in the Supported Toolsets, does it mean I cannot build Boost libraries using Sun/Solaris CC? Any pointers would be appreciated. Thanks. herman

3 2

msvc-stlport creates name mangled functions with std:: not _STL::
by John Bustard 16 Dec '03

16 Dec '03

I can't seem to link with the filesystem lib when built with the following options: rem Get environment right for compiler -- comment out after first run rem "C:\Program Files\Microsoft Visual Studio\VC98\Bin\VCVARS32.BAT" rem Setup for Boost.Python rem Setup for Boost 'toolset' set STLPORT_PATH=C:\ set STLPORT_4.6_PATH=C:\STLport-4.6 set STLPORT_VERSION=4.6 bin.ntx86\bjam "-sTOOLS=msvc-stlport" "-sBUILD=<stlport-iostream>on" the name mangled function that is exported is ?leaf@path@filesystem@boost@@QBE?AV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@XZ but the function that msvc tries to link with is: ?leaf@path@filesystem@boost@@QBE?AV?$basic_string@DV?$char_traits@D@_STL@@V? $allocator@D@2@@_STL@@XZ Two things I've noticed that are a bit wierd are that the boost libs are put in stlport-4.5.3 directory even when built with the options directing it to 4.6. Also stlport has an option to put itself in the std namespace but merely #defines std as _STL so I would have expected the exported function from the boost library to be _STL not std. Any ideas, thanks John

2 1

generate_random_graph
by Matthew Galati 16 Dec '03

16 Dec '03

Newbie Question Can someone post a simple example of how to generate a random graph? I do not understand what needs to be sent in the 4th argument for RandNumGen. To keep it simple, how would I generate a random graph on 10 vertices and 20 edges? generate_random_graph(g, 10, 20, ?, false, false); Thanks, Matt

2 1

Couldn't find status of Thread Priority...
by Brian Carlson 15 Dec '03

15 Dec '03

I was searching the boost site, and saw that in the Nov '02 timeframe that thread priority was not implemented. Is that still the case? I'm on XP and want to have one of my logging threads have a lower priority. Thanks, Brian

1 0

RE: [Boost-users] find japanese character with boost regex++
by Ben Hutchings 15 Dec '03

15 Dec '03

John Maddock <john(a)johnmaddock.co.uk> wrote: <snip> > It might be best to add a facility to add new character classes as a > list of characters and ranges to include, something like: > > register_character_class("myname", "d-f"); > > Then we add all the Unicode block ranges as standard for wide > character regexes. Aside from the unified Han characters (kanji/hanzi), characters of the same category generally aren't neatly grouped together in Unicode. The 128-character blocks tend to correspond to locales, communities of use or specific legacy encodings and not to categories. You need a look-up table (or more efficiently two levels of table) to check character categories.

2 1

find japanese character with boost regex++
by jschmid 15 Dec '03

15 Dec '03

Hi, I have just discovered the incredible boost and regex++ libraries but I have encountered some difficulties... I read that the japanese special encoding is handled in regex++, specially using wide char wchar characters. In the regex++ faq, it is presented the system of class , ex. [[:space]], in order to define a set of characters with a same property. I have been looking for a kind of [[:Japanese characters]] class. Actually I have a text with a lot of strange characters and japanese one ( Hiragana, katakan, Kanji everything..!) and I want to find these japanese sentence in order to translate them and replace in the text. I need hence a way in order to identify a japanese sentence . A kind of function const bool isJap( const wchar ) const would be fine. So if somebody has any idea or a some links, I would appreciate it! Thanks! Schmid

3 6

Re: Using graph library in VC++ 6.0 -> Change stl library?
by rohou 15 Dec '03

15 Dec '03

Using Boost graph library in VC++ 6.0, do I have to change the stl dlivered with VC6.0? What is the service pack I should use? Thanks, Boris

1 0