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

[Regex] Problem with optionality operator
by Kay-Michael Wuerzner 18 Sep '09

18 Sep '09

Hello, I have got a problem with the interpretation of the optionality operator '?' in boost::regex. Consider the following example (regex_test.cpp): #include <iostream> #include <boost/regex.hpp> int main ( int argc, char** argv ) { boost::regex test ( "(Apple)? Iphone 3g" ); boost::match_results<std::string::const_iterator> what; std::string input ( argv[1] ); if ( 0 == boost::regex_match ( input, what, test, boost::match_default | boost::match_partial ) ) { std::cerr << "No Match\n"; } if ( what[0].matched ) { std::cerr << "Full Match\n"; } else { std::cerr << "Partial Match\n"; } return 0; } Test runs are: ./regex_test "Apple Iphone" Output: Partial Match (as expected) ./regex_test "Apple Iphone 3g" Output: Full Match (as expected) ./regex_test "Iphone" Output: No Match and Partial Match (Why is that? "Apple" is optional should only be "Partial Match") ./regex_test "Iphone 3g" Output: No Match and Partial Match (Why is that? "Apple" is optional should be "Full Match") Probably, I am only missing a flag but tests with "\A" and friends do not help. Any comments are appreciated. Many thanks in advance. Cheers, Kay

3 2

Can I use Boost.Regex with multilne text to be recognized?
by Ramon F Herrera 18 Sep '09

18 Sep '09

More accurately, my question should be: How hard (or easy) is it to deal with multiple lines of parsed text in Regex? Is there anything special to do? (such as defining an end of line character(s)) Perhaps the best advice is to stay away from Regex and use something more powerful (such as Xpressive)? TIA, -Ramon

3 4

How to compile boost regex
by manish4gupta 18 Sep '09

18 Sep '09

I am compiling the program using the following option g++ -ggdb -lboost_regex -o regex regex.cpp but it is giving error. #include <boost/regex.hpp> #include <iostream> void print_captures(const std::string& regx, const std::string& text) { boost::regex e(regx); boost::smatch what; std::cout << "Expression: \"" << regx << "\"\n"; std::cout << "Text: \"" << text << "\"\n"; if(boost::regex_match(text, what, e, boost::match_extra)) { unsigned i, j; std::cout << "** Match found **\n Sub-Expressions:\n"; for(i = 0; i < what.size(); ++i) std::cout << " $" << i << " = \"" << what[i] << "\"\n"; std::cout << " Captures:\n"; for(i = 0; i < what.size(); ++i) { std::cout << " $" << i << " = {"; for(j = 0; j < what.captures(i).size(); ++j) { if(j) std::cout << ", "; else std::cout << " "; std::cout << "\"" << what.captures(i)[j] << "\""; } std::cout << " }\n"; } } else { std::cout << "** No Match found **\n"; } } int main(int , char* []) { print_captures("(([[:lower:]]+)|([[:upper:]]+))+", "aBBcccDDDDDeeeeeeee"); print_captures("(.*)bar|(.*)bah", "abcbar"); print_captures("(.*)bar|(.*)bah", "abcbah"); print_captures("^(?:(\\w+)|(?>\\W+))*$", "now is the time for all good men to come to the aid of the party"); return 0; } Error message: regex.cpp: In function ‘void print_captures(const std::string&, const std::string&)’: regex.cpp:20: error: ‘class boost::smatch’ has no member named ‘captures’ regex.cpp:26: error: ‘class boost::smatch’ has no member named ‘captures’ How can i avoid that. Please help me. -- View this message in context: http://www.nabble.com/How-to-compile-boost-regex-tp25447212p25447212.html Sent from the Boost - Users mailing list archive at Nabble.com.

3 4

Re: [Boost-users] PBGL vs (Parallel) BGL-VTK
by Randy Heiland 18 Sep '09

18 Sep '09

On Sep 17, 2009, at 1:19 PM, Jeff Baumes wrote: >> Just out of curiosity what are the main differences in between PBGL >> and (Parallel) BGL-VTK ? What I am looking for is why not use PBGL >> directly ? What was the actual issue ? > > The goal of PBGL in VTK is to integrate PBGL with VTK's data > structures and pipeline model. It includes a wrapper around PBGL > algorithms to conveniently use them from VTK, along with extending > vtkGraph to be an implementation of PBGL concepts. > > Will/Randy may have more to say about it. > > Jeff Jeff has summarized nicely. I'd only add that we've not wrapped all of the PBGL algs yet. -Randy

2 1

[mpi] enviroment constructor different from MPI_Init
by alfC 18 Sep '09

18 Sep '09

I am using MPI in combination with BLACS and apparently it works with MPI_Init but not with boost.MPI when I use #include "blacs.h" int main(int argc, char* argv[]) { MPI_Init(&argc,&argv); int nprocs=0; int mype=0; Cblacs_pinfo( &mype, &nprocs ); // overwrites the pointee, that is how Cblacs_pinfo works std::cout<<mype<<" "<<nprocs<<std::endl; the program output (correctly): "0 1" But when I use boost::mpi::environment env(argc, argv); //instead of MPI_Init(argc, argv); the programs outputs (incorrectly): "0 -1". The point being that apparently boost::mpi::environment is not equivalent to MPI_Init/MPI_Finalize. Any idea of what is difference between MPI_Init and boost::mpi::environment? Thank you, Alfredo

4 5

Having trouble with a callback function (converted to a class) in Regex
by Ramon F Herrera 18 Sep '09

18 Sep '09

Hello, This is my first non-trivial, multi-file C++ program with classes and I bumped into a problem. See example from the Regex library below. The problem occurred after I converted the simple code below to a class (called "Pairs"). The troublesome statement is this one, where we attempt to take the address of a function. std::for_each(m1, m2, &regex_callback); My first compilation attempt produces an error message from the compiler, which is nice enough to offer a solution: pairs.cpp:247: error: ISO C++ forbids taking the address of an unqualified or parenthesized non-static member func tion to form a pointer to member function. Say `&Pairs::assignment_callback' So, following the compiler's suggestion, I changed the line above to this: std::for_each(m1, m2, &Pairs::assignment_callback); Now, I am getting an inscrutable (for me, anyway) error message: stl_algo.h:158: error: must use .* or ->* to call pointer-to-member function in `__f (...)' Thanks for your kind assistance, -Ramon =================================================== int main(int argc, const char** argv) { std::string text; for(int i = 1; i < argc; ++i) { cout << "Processing file " << argv[i] << endl; std::ifstream fs(argv[i]); load_file(text, fs); // construct our iterators: boost::sregex_iterator m1(text.begin(), text.end(), expression); boost::sregex_iterator m2; std::for_each(m1, m2, &regex_callback); // copy results: cout << class_index.size() << " matches found" << endl; map_type::iterator c, d; c = class_index.begin(); d = class_index.end(); while(c != d) { cout << "class \"" << (*c).first << "\" found at index: " << (*c).second << endl; ++c; } class_index.erase(class_index.begin(), class_index.end()); } return 0; }

2 2

[units] Proposal for generalizing scales
by Manoj Rajagopalan 17 Sep '09

17 Sep '09

Hi boost::units developers I am interested in extending the scale system for units. Here I present a short explanation, my initial hack to get this working, and questions on a small re-engineering issue that will crop up if this proposal is accepted. *** WHY *** Existing boost-units code allows scales which have factors as integral powers of a base, b^e, eg. 10^3, 2^10 etc. I'd like to use scales that have factors of the form a*b^e, Examples: (a) electron-Volt (eV) = 1.602*10^{-19} J (b) bohr = 0.528 Angstroms = 5.28*10^{-11} m In quantum chemistry, for example, such an "atomic units system" is typically used. *** HOW *** To achieve this using templates (which don't (yet) recognize floating point constants), I borrowed the idea from the 'dimnum' package. I, (1) added two more parameters of type long to the scale<> template which are the numerator and denominator of the rational approximation to a, (2) added static const value_type factor() member function which returns the value 'a' evaluated as double, (3) modified the value() static member to return factor() * b^e instead of simply b^e --------------- Code snippet (scale.hpp): template<long Base, class Exponent, long FactorNumerator=1L, long FactorDenominator=1L> struct scale { // ... static const double factor() { return double(FactorNumerator)/double(FactorDenominator); } static value_type value() { return(factor() * detail::static_rational_power<Exponent>(static_cast<double>(base))); } // ... }; ---------------- I modified the defintion of the apply<> template class in the boost::mpl::plus_impl, boost::mpl::negate_impl classes in unscale.hpp so that the scale<> return template-type now includes the correct FactorNumerator and FactorDenominator results based on the operands. This seems to be the place where arithmetic on scales is being performed for inter-conversion of quantities. I couldn't modify boost::mpl::times_impl because I'd have to statically exponentiate the numerator/denominator here and this doesn't fit cleanly into the existing mechanism. *** WHAT *** I do have the following questions/observations - please answer/comment. 1. The current implementation assumes that the scales being multiplied have the same base and differ only in the exponent? I just see T0::base being copied as the new base. This can be fixed with the generalized scale approach where if the bases are different (eg. 2 and 10), the resulting base is a default (10?) with exponent=static_rational<0,1> and a new factor f=(2^e1)*(10^e2). Of course, this will work only if there are no overflows. A conceivable use-case for this feature is when calculating, say, price-per-GB that is incurred in setting up a data-center. $<--->c interconversion will require 10^2 scale along the currency dimension while MB<--->GB<--->TB interconversions will require 2^10 scale along the memory dimension (assume they can be created). Here, currency interconversion will necessitate a generalized scale. 2. For simple scales like the existing one, multiplication of scales leads to addition of the exponents and therefore I can understand the static-overload of the plus_impl template to allow MPL to add the exponents. But with generalized scales we will have to switch to a different mechanism. Could you advise me on what all will need to be changed? I have a fair idea and I could use your input to cross-check. 3. When I complete this, can I submit the patch? I would like to add the atomic units system to the existing list of systems http://en.wikipedia.org/wiki/Atomic_units thanks, Manoj

2 3

hash<pair<...
by John Dlugosz 17 Sep '09

17 Sep '09

I just moved a project that was using VC8, with TR1 supplied via BOOST, to VC9 with its own TR1 implementation. I was surprised that a unordered_map failed to compile with a great deal of verboseness because it didn't like my key type. I used a pair of two primitive types as the key. Boost took that just fine. But looking at the current Boost documentation for the hash object, (<http://www.boost.org/doc/libs/1_40_0/doc/html/boost_tr1/subject_list.html#b…>) I see that the hash specializations include primitive types, strings, but not tuples. Is this something that changed between Boost 1_38 and 1_40, or an undocumented extension, or what? Why would the standard leave out that, when everyone and his neighbor will just supply their own generic definition. That is, is there a good reason for not doing it? --John TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

2 2

boost multi-index container find method.
by Ramesh 17 Sep '09

17 Sep '09

Hello Joaquin, I have a class like below that uses mult-index container's find method. I have a record pattern as below initially: Idx : 100 Flag : 5 Idx : 200 Flag : 5 Idx : 300 Flag : 5 Idx : 400 Flag : 5 I modify the flag for index 100 to 6 & take a dump, the change is OK Idx : 100 Flag : 6 Idx : 200 Flag : 5 Idx : 300 Flag : 5 Idx : 400 Flag : 5 I modify the flag for 100 back to 5 and take a dump, which is also fine. Idx : 100 Flag : 5 Idx : 200 Flag : 5 Idx : 300 Flag : 5 Idx : 400 Flag : 5 Now I do a find based on flag value set to 5 I get the results as below: Idx : 200 flag : 5 While find functionally is correct in picking up the correct data, but I am wondering why it doesnt pick the first record (100) which has the flag value set to 5? am I missing something in the indexing definition in the container itself? Thanks /R ========================= using namespace std; #include <boost/lambda/lambda.hpp> #include <boost/multi_index_container.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/member.hpp> #include <iostream> #include <iterator> #include <iostream> #include <string> struct Token { unsigned long mIdx; unsigned char mflag; public: Token(unsigned long pIdx, unsigned char pflag): mIdx(pIdx), mflag(pflag){} void Update(unsigned char pflag) { mflag = pflag; } ~Token() { mIdx = 0; mflag = 1; } }; struct mIdx{}; struct mflag{}; using namespace boost::multi_index; namespace ll = boost::lambda; typedef multi_index_container< Token, indexed_by< ordered_unique< tag <mIdx>, BOOST_MULTI_INDEX_MEMBER(Token,unsigned long,mIdx)>, ordered_non_unique< tag <mflag>, BOOST_MULTI_INDEX_MEMBER(Token,unsigned char,mflag)> > > tToken; class TokenMaster { tToken TokenContainer; public: unsigned long getByFlag(unsigned long useFlag); bool modify(unsigned long idx, unsigned char flag); bool insert(unsigned long, unsigned char); void dump(); }; unsigned long TokenMaster::getByFlag(unsigned long useFlag) { typedef tToken::index<mflag>::type itflag; itflag& mflag_index = TokenContainer.get<mflag>(); tToken::index_iterator<mflag>::type flagit = mflag_index.find(useFlag); if (flagit == mflag_index.end()) { return 0; } printf("Idx : %d flag : %d\n", flagit->mIdx, flagit->mflag); return flagit->mIdx; } bool TokenMaster::modify(unsigned long idx, unsigned char flag) { tToken::iterator itIp=TokenContainer.find(idx); if (itIp == TokenContainer.end()) return false; return TokenContainer.modify(itIp,(&ll::_1)->*&Token::mflag=flag); } bool TokenMaster::insert(unsigned long idx, unsigned char flag) { tToken::iterator it; bool secres; std::pair<tToken::iterator, bool> result = TokenContainer.insert(Token(idx, flag)); it = result.first; secres = result.second; if (secres) return true; else return false; } void TokenMaster::dump() { unsigned long count = 0; printf("\n\n List of indexes\n"); for (tToken::iterator it = TokenContainer.begin(), it_end=TokenContainer.end(); it != it_end; ++it, count++) { printf("Idx : %d Flag : %d\n", it->mIdx, it->mflag); } printf("\n"); } main() { TokenMaster T1; T1.insert(100, 5); T1.insert(200, 5); T1.insert(300, 5); T1.insert(400, 5); T1.dump(); printf("Modifiying 100 to 6\n"); T1.modify(100, 6); T1.dump(); printf("Modifiying 100 back to 5\n"); T1.modify(100, 5); T1.dump(); printf("\n\nGet by flag \n"); T1.getByFlag(5); } ==========================

3 6

using my sink to write to the file.
by Patel, Anand 17 Sep '09

17 Sep '09

Hello All, I have been trying to implement Sink device that I would like to use with boost::iostreams. I have used Sink class example and now I am trying to use that as my sink device for the stream object. char* file_name = "c:/devel/output/file_one.txt"; typedef container_sink <std::iostream> some_sink; stream<some_sink, std::char_traits<char>> my_file_stream; last line I get many errors as following: 1>c:\documents and settings\user\my documents\visual studio 2008\projects\filereaderwriter\sink.h(11) : error C2039: 'value_type' : is not a member of 'std::basic_iostream<_Elem,_Traits>' 1> with 1> [ 1> _Elem=char, 1> _Traits=std::char_traits<char> 1> ] 1> c:\program files\boost\boost_1_39\boost\iostreams\traits.hpp(176) : see reference to class template instantiation 'foobar::container_sink<Container>' being compiled 1> with 1> [ 1> Container=std::iostream 1> ] 1> c:\program files\boost\boost_1_39\boost\iostreams\traits.hpp(188) : see reference to class template instantiation 'boost::iostreams::detail::member_char_type<T>' being compiled 1> with 1> [ 1> T=foobar::container_sink<std::iostream> 1> ] 1> c:\program files\boost\boost_1_39\boost\iostreams\stream.hpp(108) : see reference to class template instantiation 'boost::iostreams::char_type_of<T>' being compiled 1> with 1> [ 1> T=some_sink 1> ] 1>c:\documents and settings\user\my documents\visual studio 2008\projects\filereaderwriter\sink.h(11) : error C2146: syntax error : missing ';' before identifier 'char_type' 1>c:\documents and settings\user\my documents\visual studio 2008\projects\filereaderwriter\sink.h(11) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\documents and settings\user\my documents\visual studio 2008\projects\filereaderwriter\sink.h(11) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\documents and settings\user\my documents\visual studio 2008\projects\filereaderwriter\sink.h(23) : error C2061: syntax error : identifier 'char_type' 1>c:\program files\boost\boost_1_39\boost\iostreams\traits.hpp(176) : error C2039: 'char_type' : is not a member of 'foobar::container_sink<Container>' 1> with 1> [ 1> Container=std::iostream 1> ] 1>c:\program files\boost\boost_1_39\boost\iostreams\traits.hpp(176) : error C2146: syntax error : missing ';' before identifier 'type' 1>c:\program files\boost\boost_1_39\boost\iostreams\traits.hpp(176) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int 1>c:\program files\boost\boost_1_39\boost\iostreams\traits.hpp(176) : error C2208: 'boost::type' : no members defined using this type 1>c:\program files\boost\boost_1_39\boost\iostreams\traits.hpp(176) : fatal error C1903: unable to recover from previous error(s); stopping compilation Thanks,

2 3

Interprocess condition and process crashes
by Gabriel Burca 17 Sep '09

17 Sep '09

I'm using Boost 1.39 on WindowsXP and I noticed that if a process crashes while waiting on an interprocess condition variable, the signaling process blocks forever in subsequent calls to notify_all(). It looks to me like boost is not using the native facilities, but some emulation, so is this scenario not supported by the emulation? The code is very simple: Process A: while (1) { { scoped_lock<named_mutex> lock(mut); cond.wait(lock); // Process A might be killed or die while in this call // do some work } } Process B: void notifyOthers() { scoped_lock<named_mutex> lock(mut); cond.notify_all(); } I've actually omitted one small detail in the description above. After process A dies, process B can execute notifyOthers() again only once. The second time it never makes it out of the notify_all(). -- Gabriel Burca

2 1

BGL: Very dense adjacency_matrix
by Mathieu Malaterre 17 Sep '09

17 Sep '09

Hi there, Has anyone worked on very dense graph ? Basically the relation is implicitly given by the position in the grid: Eg, consider the following structured grid A B C D E F G H I it would lead to the following (undirected) graph: Graph g(9); add_edge(A, B, g); add_edge(A, D, g); add_edge(B, C, g); add_edge(B, E, g); add_edge(C, F, g); add_edge(D, E, g); add_edge(D, G, g); add_edge(E, F, g); add_edge(E, H, g); add_edge(F, I, g); add_edge(G, H, g); add_edge(H, I, g); When the structured grid is full (no broken link) I would think there are better data structure (ie. no data at all) suited to represent the graph. And as we break link (say, edge(A,B)), we would use an opposite definition of adjacency_list, to list what edge is actually *missing*. As far as I know adjacency_matrix is not implemented in PBGL, so I'll need to work around that issue /real time soon/. Thanks for your help, -- Mathieu

1 0

PBGL vs (Parallel) BGL-VTK
by Mathieu Malaterre 17 Sep '09

17 Sep '09

Just out of curiosity what are the main differences in between PBGL and (Parallel) BGL-VTK ? What I am looking for is why not use PBGL directly ? What was the actual issue ? Thanks, -- Mathieu

1 0

Multiple async operations on a socket
by Kyle Tarplee 17 Sep '09

17 Sep '09

I have a rather simple question that I can't find in the boost::asio documentation. I have a boost::asio::ip::tcp::socket that I want to write to. Can I have multiple outstanding async_write() requests for a single socket? Are the writes performed in the order in which they are submitted? Or is this undefined behavior? How about multiple async_read() requests on the same socket? I know that I need to write to the socket from at most one thread but that doesn't preclude me from not waiting until the first one is done to put on the second async write or read. The reason I ask is because there seems to be two ways to write data to a socket. 1) The "fire and forget" approach (no queue, simply call async_write() when you want to write and ignore the completion handler callback) 2) Push on a queue when you want to write something. Pop from the queue when the preceeding async_write() operation completed. Thus at most one async_write() operation is associated with the socket at any point in time. Thanks in advance, Kyle

4 6

quaternion component access
by gtsml owevwr 17 Sep '09

17 Sep '09

Hi, Is there a way to set a boost::math::quaternion on an component basis? Also, is there to randomly access an component (operator [])? Finally, the current way to access compenents looks a bit too long to me: "R_component_1()". Is there a shorter way? Thanks, Frank

1 0

Re: [Boost-users] building boost 1_33_1 now 1_37_0
by Dan Smithers 17 Sep '09

17 Sep '09

> Message: 1 > Date: Wed, 16 Sep 2009 17:04:46 +0400 > From: Vladimir Prus <vladimir(a)codesourcery.com> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] building boost 1_33_1 now 1_37_0 > Message-ID: <h8qnpe$j3a$1(a)ger.gmane.org> > Content-Type: text/plain; charset=us-ascii > > Dan Smithers wrote: > >>>> How do I change the includes in jam? >>> Sorry, I don't understand the above. Boost.Build does not pass any >>> "intel includes" nor any "gcc 2.95 includes". Can you provide the commands >>> lines and errors in question and explain how exactly the command lines >>> should be altered. >> I've now found that as long as I make sure that gcc 3.4.3 is ahead of >> 2.95 in the search path I can get past the first hurdle. > > So, is there anything that still needs to be solved? > >> The command line that comes out is >> >> "icpc" -c -xc++ -O3 -Ob2 -w1 -fPIC -DBOOST_ALL_NO_LIB=1 >> -DBOOST_MATH_TR1_DYN_LINK -DNDEBUG -I"." -c -o >> "bin.v2/libs/math/build/intel-linux-release/threading-multi/hypot.o" >> "libs/math/build/../src/tr1/hypot.cpp" >> >> /usr/lib/pthread.h(163): error: expected a ")" >> extern int pthread_create(pthread_2 *__restrict __thread, > > Do you actually have file named /usr/lib/pthread.h? That is very strange > location for a header file. > >> I have written a short test program that includes pthread.h and that >> compiles. > > Anyway, it does not seem like anything wrong is passed to icpc. So, > this error suggests that it's not installed correctly, or some other > configuration issue. Do docs for the intel compiler say anything about > gcc version that is required? Update - I have managed to get this file (hypot.cpp) to build using the Intel 8 compiler. I wonder what they changed? thanks for your help dan

1 0

[serialization] some of the serialization docs are infected with a random single quote replacement
by Todd Day 17 Sep '09

17 Sep '09

The following files have a single character replaced by a ' (that's a single quote) at a fairly regular interval. This is in the latest trunk via SVN. serialization.html - Changeset 56240 special.html - Changeset 44743 traits.html - Changeset 55676

1 0

[serialization] 1.40.00 BOOST_CLASS_EXPORT_GUID creates memory leak
by Todd Day 17 Sep '09

17 Sep '09

MSVC 8.0 BOOST_CLASS_EXPORT_GUID is used to create some static objects for using in serialization. These memory errors are not too big a deal since they aren't runaway - ie, these objects are created at startup before main() is even called, and the objects are not created over and over again. They are just not deleted at program exit, which causes my debugger to complain about memory leaks. I tracked the source of these leaks to two spots in the code. Unfortunately, the code is so complicated at these points that I can't suggest a fix or workaround. Hopefully, the maintainers know what this is about. The first leak is created in \boost_1_40_0\boost\smart_ptr\detail\shared_count.hpp line @ line 124 pi_ = new sp_counted_impl_pd<P, D>(p, d); I could be wrong, but it appears to me that the above problem only occurs for serialized objects that are derived from other objects at least twice. For example, if B is derived from A, and C is derived from B, then BOOST_CLASS_EXPORT_GUID(B, "B") BOOST_CLASS_EXPORT_GUID(C, "C") results in a memory leak for C, but not for B. I think, at least it looks that way. The second leak is created in \boost_1_40_0\libs\serialization\src\void_cast.cpp @ line 205 if(* (*it)->m_derived == * m_base) new void_caster_shortcut( m_derived, (*it)->m_base, m_difference + (*it)->m_difference, includes_virtual_base ); Again, it appears the these leaks only happen for classes which are derived at least twice. The above allocations are not deleted at shutdown. In the second case, it almost appears to me as if a registration function is accidentally getting called twice, and a pointer is getting set first to one allocation and then to a second allocation, which means the first allocation is lost track of. Thanks for any help, -todd- PS - Just pulled down the latest trunk from SVN. It appears that many changes in the areas I've mentioned above have occurred, so maybe this issue is fixed. If so, I'm hoping I can just pull over the include and source file changes made to the serialization library by themselves, but I don't know if those changes rely on other changes in other Boost libraries.

1 0

Re: [Boost-users] building boost 1_33_1 now 1_37_0
by Dan Smithers 17 Sep '09

17 Sep '09

> > Message: 1 > Date: Wed, 16 Sep 2009 17:04:46 +0400 > From: Vladimir Prus <vladimir(a)codesourcery.com> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] building boost 1_33_1 now 1_37_0 > Message-ID: <h8qnpe$j3a$1(a)ger.gmane.org> > Content-Type: text/plain; charset=us-ascii > > Dan Smithers wrote: > >>>> How do I change the includes in jam? >>> Sorry, I don't understand the above. Boost.Build does not pass any >>> "intel includes" nor any "gcc 2.95 includes". Can you provide the commands >>> lines and errors in question and explain how exactly the command lines >>> should be altered. >> I've now found that as long as I make sure that gcc 3.4.3 is ahead of >> 2.95 in the search path I can get past the first hurdle. > > So, is there anything that still needs to be solved? > >> The command line that comes out is >> >> "icpc" -c -xc++ -O3 -Ob2 -w1 -fPIC -DBOOST_ALL_NO_LIB=1 >> -DBOOST_MATH_TR1_DYN_LINK -DNDEBUG -I"." -c -o >> "bin.v2/libs/math/build/intel-linux-release/threading-multi/hypot.o" >> "libs/math/build/../src/tr1/hypot.cpp" >> >> /usr/lib/pthread.h(163): error: expected a ")" >> extern int pthread_create(pthread_2 *__restrict __thread, > > Do you actually have file named /usr/lib/pthread.h? That is very strange > location for a header file. no, it's in /usr/include I am working on a computer that is not connected to the internet and had type the email. > >> I have written a short test program that includes pthread.h and that >> compiles. > > Anyway, it does not seem like anything wrong is passed to icpc. So, > this error suggests that it's not installed correctly, or some other > configuration issue. Do docs for the intel compiler say anything about > gcc version that is required? Nothing wrong is passed, but it doesn't compile. I don't have this problem building the non-boost code. thanks dan

1 0

Re: [Boost-users] Finding documentation for individual functions (uintmax_t)? An answer.
by s seelenluft 17 Sep '09

17 Sep '09

> in which library do I find documentation for the 'function': uintmax_t? > Since uintmax_t is such ubiquitous any search finds everything except its > actual description. Some more googling found the answer here: http://www.dinkumware.com/manuals/default.aspx Does such an equivalent, ie, a search function for functions/types only and not which does a full-text search, exist for Boost?

1 0

Finding documentation for individual functions (uintmax_t)?
by s seelenluft 17 Sep '09

17 Sep '09

Hi, in which library do I find documentation for the 'function': uintmax_t? Since uintmax_t is such ubiquitous any search finds everything except its actual description. Thanks, Markus

1 0

How to convert std::string into basic_string
by manish4gupta 17 Sep '09

17 Sep '09

#include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <boost/interprocess/containers/map.hpp> How to convert std::string into boost string. I am doing some benchmarking by inserting the std::string value instead of char_string(ypedef of basic_string) but i am getting error message. #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/containers/string.hpp> #include <iostream> using namespace boost::interprocess; //Typedefs of allocators and containers typedef managed_shared_memory::segment_manager segment_manager_t; typedef allocator<void, segment_manager_t> void_allocator; typedef allocator<int, segment_manager_t> int_allocator; typedef vector<int, int_allocator> int_vector; typedef allocator<int_vector, segment_manager_t> int_vector_allocator; typedef vector<int_vector, int_vector_allocator> int_vector_vector; typedef allocator<char, segment_manager_t> char_allocator; typedef basic_string<char, std::char_traits<char>, char_allocator> char_string; class complex_data { int id_; char_string char_string_; int_vector_vector int_vector_vector_; public: //Since void_allocator is convertible to any other allocator<T>, we can simplify //the initialization taking just one allocator for all inner containers. complex_data(int id, const char *name, const void_allocator &void_alloc) : id_(id), char_string_(name, void_alloc), int_vector_vector_(void_alloc) {} //Other members... }; //Definition of the map holding a string as key and complex_data as mapped type typedef std::pair<const char_string, int> map_value_type; typedef std::pair<char_string, int> movable_to_map_value_type; typedef allocator<map_value_type, segment_manager_t> map_value_type_allocator; typedef map< char_string, int , std::less<char_string>, map_value_type_allocator> complex_map_type; int main () { //Remove shared memory on construction and destruction struct shm_remove { shm_remove() { shared_memory_object::remove("MySharedMemory"); } ~shm_remove(){ shared_memory_object::remove("MySharedMemory"); } } remover; //Create shared memory managed_shared_memory segment(create_only,"MySharedMemory", 65536); //An allocator convertible to any allocator<T, segment_manager_t> type void_allocator alloc_inst (segment.get_segment_manager()); //Construct the shared memory map and fill it complex_map_type *mymap = segment.construct<complex_map_type> //(object name), (first ctor parameter, second ctor parameter) ("MyMap")(std::less<char_string>(), alloc_inst); string s = "hello"; char y = (char_string)s; for(int i = 0; i < 100; ++i) { char_string key_object(alloc_inst); map_value_type value(key_object, i); mymap->insert(value); } return 0; } error: no matching function for call to ‘boost::interprocess_container::basic_string<char, std::char_traits<char>, boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> > >::basic_string(boost::interprocess_container::string&)’ /usr/include/boost/interprocess/containers/container/string.hpp:591: note: candidates are: boost::interprocess_container::basic_string<CharT, Traits, Alloc>::basic_string(typename A::size_type, CharT, const A&) [with CharT = char, Traits = std::char_traits<char>, A = boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> >] /usr/include/boost/interprocess/containers/container/string.hpp:584: note: boost::interprocess_container::basic_string<CharT, Traits, Alloc>::basic_string(const CharT*, const A&) [with CharT = char, Traits = std::char_traits<char>, A = boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> >] /usr/include/boost/interprocess/containers/container/string.hpp:577: note: boost::interprocess_container::basic_string<CharT, Traits, Alloc>::basic_string(const CharT*, typename A::size_type, const A&) [with CharT = char, Traits = std::char_traits<char>, A = boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> >] /usr/include/boost/interprocess/containers/container/string.hpp:564: note: boost::interprocess_container::basic_string<CharT, Traits, Alloc>::basic_string(const boost::interprocess_container::basic_string<CharT, Traits, Alloc>&, typename A::size_type, typename A::size_type, const A&) [with CharT = char, Traits = std::char_traits<char>, A = boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> >] /usr/include/boost/interprocess/containers/container/string.hpp:557: note: boost::interprocess_container::basic_string<CharT, Traits, Alloc>::basic_string(boost::interprocess::rv<boost::interprocess_container::basic_string<CharT, Traits, Alloc> >&) [with CharT = char, Traits = std::char_traits<char>, A = boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> >] /usr/include/boost/interprocess/containers/container/string.hpp:548: note: boost::interprocess_container::basic_string<CharT, Traits, Alloc>::basic_string(const boost::interprocess_container::basic_string<CharT, Traits, Alloc>&) [with CharT = char, Traits = std::char_traits<char>, A = boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> >] /usr/include/boost/interprocess/containers/container/string.hpp:539: note: boost::interprocess_container::basic_string<CharT, Traits, Alloc>::basic_string(const A&) [with CharT = char, Traits = std::char_traits<char>, A = boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> >] /usr/include/boost/interprocess/containers/container/string.hpp:532: note: boost::interprocess_container::basic_string<CharT, Traits, Alloc>::basic_string(boost::interprocess_container::basic_string<CharT, Traits, Alloc>::reserve_t, size_t, const A&) [with CharT = char, Traits = std::char_traits<char>, A = boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> >] Thanks in advance. -- View this message in context: http://www.nabble.com/How-to-convert-std%3A%3Astring-into-basic_string-tp25… Sent from the Boost - Users mailing list archive at Nabble.com.

5 14

boost concept to make int template parameter available at runtime?
by Sebastian Weber 17 Sep '09

17 Sep '09

Hi! I am wondering if some boost library (like fusion) or similar may help me solve an awkward problem. In principle I have a class which has an int template parameter, for example: template <int VAL> class A { void print_val() { std::cout << "my value is " << VAL << std::endl; } }; Now I want to make the parameter VAL of class A available at runtime (of course only a limited range, but still), like this class Aruntime { void set_val(int v) { val = v; } int val; ... and again same stuff from A<val> ... }; I am sure there is an easy solution to it. One solution would be to use an object factory, I guess. There I would register for each integer the respective class A which I had to wrap into some other class in order to get rid of the template parameter and virtualize the print_val function. This may not be a boost-problem directly, but any help would be great. Thanks a lot, Sebastian

2 2

error in getting shared vector
by manish4gupta 17 Sep '09

17 Sep '09

I am woking on IPC shared memory where i am loading one vector in memory by process1 and using the same with another program. but in process2 i am getting one error whie this code is same as given http://www.boost.org/doc/libs/1_38_0/doc/html/interprocess/quick_guide.html…. I am just doing benchmarking. May i know what is the reason behind this? Process1. #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/allocators/allocator.hpp> int main () { using namespace boost::interprocess; try{ //Shared memory front-end that is able to construct objects //associated with a c-string. Erase previous shared memory with the name //to be used and create the memory segment at the specified address and initialize resources shared_memory_object::remove("MySharedMemory"); managed_shared_memory segment (create_only ,"MySharedMemory" //segment name ,65536); //segment size in bytes //Alias an STL compatible allocator of ints that allocates ints from the managed //shared memory segment. This allocator will allow to place containers //in managed shared memory segments typedef allocator<int, managed_shared_memory::segment_manager> ShmemAllocator; //Alias a vector that uses the previous STL-like allocator typedef vector<int, ShmemAllocator> MyVector; //Initialize shared memory STL-compatible allocator const ShmemAllocator alloc_inst (segment.get_segment_manager()); //Construct a shared memory MyVector *myvector = segment.construct<MyVector>("MyVector") //object name (alloc_inst);//first ctor parameter //Insert data in the vector for(int i = 0; i < 100; ++i){ myvector->push_back(i); } } catch(...){ shared_memory_object::remove("MySharedMemory"); throw; } shared_memory_object::remove("MySharedMemory"); return 0; } Process2 #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <algorithm> #include <iostream> int main () { using namespace boost::interprocess; try{ //A special shared memory where we can //construct objects associated with a name. //Connect to the already created shared memory segment //and initialize needed resources managed_shared_memory segment (open_only ,"MySharedMemory"); //segment name //Alias an STL compatible allocator of ints that allocates ints from the managed //shared memory segment. This allocator will allow to place containers //in managed shared memory segments typedef allocator<int, managed_shared_memory::segment_manager> ShmemAllocator; //Alias a vector that uses the previous STL-like allocator typedef vector<int, ShmemAllocator> MyVector; //Find the vector using the c-string name MyVector *myvector = segment.find<MyVector>("MyVector").first; for (MyVector::iterator it = myvector->begin(); it!=myvector->end(); it++) { std::cout << *it << "\n"; } //Use vector in reverse order std::sort(myvector->rbegin(), myvector->rend()); // . . . //When done, destroy the vector from the segment segment.destroy<MyVector>("MyVector"); } catch(...){ shared_memory_object::remove("MySharedMemory"); throw; } shared_memory_object::remove("MySharedMemory"); return 0; } Error Message: terminate called after throwing an instance of 'boost::interprocess::interprocess_exception' what(): No such file or directory Aborted -- View this message in context: http://www.nabble.com/error-in-getting-shared-vector-tp25485820p25485820.ht… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Concerning kolmogorov_max_flow
by townofpig Mei Ting 17 Sep '09

17 Sep '09

Hello, I am the newbie in Boost. I am actually not quite familiar with C++ but I have to employ source code for implementing kolmogorov_max_flow. When I am trying to find the input of the kolmogorov-eg.cpp, I know there is a max_flow.dat as input. However, I want to know if it is possible for me to change the input values of weight of the arcs in the graph. Where can I change it? I've spent a lot of time to find but I can't since I am really not so good at programming. Looking to forward to your replies~~ Yahoo!香港提供網上安全攻略，教你如何防範黑客! 請前往 http://hk.promo.yahoo.com/security/ 了解更多!

1 0