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

regular expression help
by llwaeva＠21cn.com 28 Jul '06

28 Jul '06

Hi there, I am going to retrieve the following pattern %K{xxx} where xxx can be anything except line break. I find and modify the following code from document, is that right for my case? boost::regex expK("[^%]*%K{([^\r\n])}"); std::string::const_iterator start, end; start = sourcesrc.begin(); end = sourcesrc.end(); boost::match_results<std::string::const_iterator> what; boost::match_flag_type flags = boost::match_default; while ( regex_search(start, end, what, expK, flags) ) { // handle the match string, i.e. xxx my_fun( std::string( what[1].first, what[1].second ) ); start = what[1].second; flags |= boost::match_prev_avail; flags |= boost::match_not_bob; } Here, expK found all the substring matching %K{xxx} (not including double % case). But the program didn't give me what I want, I guess the problem is from the expression where { and } is not expressed correctly. However, I didn't found how to express { and } in the document. Here is my guess of the correct form, tell me if it is correct or not 1) boost::regex expK("[^%]*%K\{([^\r\n])\}"); // here \{ represents { and \} represents } 2) boost::regex expK("[^%]*%K[{]{1}([^\r\n])[}]{1}"); // use [{]{1} and [}]{1} to limit the { and } occur once exactly 3) boost::regex expK("[^%]*%K\\{([^\r\n])\\}"); // here \\{ represents { and \\} represents } which one is correct? or all is wrong? Please help! Thanks in advance.

2 1

error in regex_replace!?
by llwaeva＠21cn.com 28 Jul '06

28 Jul '06

Hi there, I am using regex_replace to find_replace a pattern. The code is shown below string src = "xxx%R__xy\r\n%\r\nRyyyy% A__%%A\r\n%Rzzz%C%Appp_%C0123\r\n%Rooo"; re = "(%R)|(%A)|(%C)"; format = "(?1#R)(?2#A)(?3#C)"; cout << "SOURCE:" << endl << src << endl << endl; regex_replace( src.begin(), src.begin(), src.end(), re, format, format_all ); cout << "OUTPUT:" << endl << src << endl << endl; 1) For replacing %R with #R, %A with #A and %C with #C, and the output string save back to the source string, the above code do a good job. And the output is xxx#R__xy % Ryyyy% A__%#A #Rzzz#C#Appp_#C0123 #Rooo NOTE that %%A is replaced with %#A 2) If I change the format so that the length of format longer than that of subsitute string, e.g. re = "(%R)|(%A)|(%C)"; format = "(?1#RRR)(?2#AAA)(?3#CCC)"; regex_replace raise an error. I think the error is come from the original string is not long enough to store the output string. The problem can be solved by the following code string src = "xxx%R__xy\r\n%\r\nRyyyy% A__%%A\r\n%Rzzz%C%Appp_%C0123\r\n%Rooo"; string output=src; re = "(%R)|(%A)|(%C)"; format = "(?1#RRR)(?2#AAA)(?3#CCC)"; cout << "SOURCE:" << endl << src << endl << endl; regex_replace( output.begin(), src.begin(), src.end(), re, format, format_all); cout << "OUTPUT:" << endl << output << endl << endl; But I do want the output store in the original string. Reassigning the source string slove the problem, i.e. src = output, but for a large input string (for my case , >5M), this way is not that good. I am looking for a better approach. BTW, if the length of the output string shorter than the original string, the output carry some other extra characerts. e.g. string src = "xxx%Ry%Az%Ce"; string output=src; re = "(%R)|(%A)|(%C)"; format = "(?1R)(?2A)(?3C)"; The output is "xxxRyAzCe%Ce" where the last %Ce are extra characters from source string. How can I kill the extra characters? 3) Finally, I will modify the search condition to make sure that only %X rather than %%X (X can be R, A or C) is replaced. I try the following regular expression re = "([^%]%R)|([^%]%A)|([^%]%C)"; but it doesn't work properly for my problem. e.g. for src = "xxx%R %%R", for the format "(?1#R)(?2#A)(?3#C)"; the regular expression will kill the 'x' before %R, i..e. the output is "xx#R %%R" rather than "xxx#R %%R" Please help! Thanks in advance.

2 1

Labeling patched Boost versions
by Daniel Krügler 28 Jul '06

28 Jul '06

Hello, Recently I had a discussion with a colleague concerning the possibility to influence the resulting file names of the default boost output. This discussion was actually inspired by the outcome of thread "[thread] Keeping leak detectors still..." on 2006-07-11 where we had the situation of an inofficial patch which we would like to use. The problem is: How can/should I signal a patched boost version? According to the naming scheme described in http://boost.org/more/getting_started.html one could change the boost subminor version. Regrettably we found out that most programmers actually expect that such a number belongs to one of the *official* boost versions provided by http://boost.org/, (most probably because the naming scheme smoothly integrates). Now I had the idea of an optional "build id", which is a well-known tool in many projects to signal a given state or "snap shot". The very advantage of a build id - which's format is usually not fixed, but typically is a string of numbers, letters and some file-name compatible characters like '-', normally without any white spaces and of arbitrary length - is, that it accentuates and differs very strongly from the regular pattern of the subdivided version number. Ideally it should be possible to define a kind of bjam constant, e.g -sBUILD_ID=string (I'm not a bjam expert and I hope that the above proposed name does not violate any naming policies of such configuration parameters), which would allow to explicitly set build id for a bjam build. I have no strong opinion concerning the exact position of that build id in a lib name, but probably the most resonable one would be just after the version number, e.g. libboost_date_time-gcc-mt-d-1_31_M20060721.a for -sBUILD_ID=M20060721 Does there already exist such a possibility to do that and if not: I would really appreciate such a general available "callback" for injecting a build id (a sequence of characters) into the final output. Standard behaviour would of course be, *not* to attach such id, but the possibility to do that via a userdefined program parameter of bjam would be fantastic! The problem is: If I would manually hack the boost bjam files to do just this, I could never update to the next boost version without fears, because I always would need to manipulate the new version also. Since I assume that this request is of general interest for the community I would like to humbly ask for support of it. What do you think? Any chances for that idea? Or better ones? Greetings from Bremen, Daniel Krügler

1 1

DateTime: Seconds until next month
by Olaf van der Spek 28 Jul '06

28 Jul '06

Hi, I'm currently using the following code to calculate the number of seconds until the next month. I'm wondering whether there's an easier way. date d(day_clock::universal_day()); d += months(1); cout << duration2a((ptime(date(d.year(), d.month(), 1)) - second_clock::universal_time()).total_seconds()) + " until ladders reset" << endl; return 0;

2 1

regex_replace help
by llwaeva＠21cn.com 28 Jul '06

28 Jul '06

Hi there, I am using regex_replace for string replacing. I am working with a very large string (about 3M) and need to do the following replacment %R% --> #R# %A% --> #R1# %C% --> #R2# and so on. I am new to regular express and regex. After having read the document, I know how regex works, but still not sure if regex_replace meet my demand 1) I invoke regex_replace several times to replace difference patterns. For a large input string, the operation is very slow. Can I call regex_replace once to do the several replacments. i.e. calling regex_replace( output, begin, end, "%R ,%A ,%C", "#R#, #R1#, #R2#", match_default); for replacing %R% with #R# %A% with #R1# %C% with #R2# 2) According to the document, the output fashion depends on the match_flag_type, for my case, I hope the output string, including both matched and nonmatched part, replace the whole input string. e.g. SourceStr = "xxxx%R%yyy%A%zzz%C%" Apply regex_replace( output_string, SourceStr.begin, SourceStr.end, ... ) We have , output_string = "xxxx#R#yyy#R1#zzz#R2#" rather than #R#, #R1# and #R2# Any reply will be highly appreciated.

2 2

default copy constructors
by bringiton bringiton 28 Jul '06

28 Jul '06

I have a specific c++ question, and was wondering whether someone could offer some advice. Is is safe to assume that modern compilers will supply a default copy constructor and default assignment operator that will copy all attributes? Or may I run into undefined behaviour between compilers. class Test: public: int v1; char v2; float v3 std::string v4; std::vector<int> v5; boost::shared_ptr<int> v6; }; ie is it safe to assume that Test's copy constructor will call the copy constructor of all the above attributes. NOTE: i am only talking about attributes that are already copiable. i understand that if a class manages it's own memory, the copy constructor will need to be defined. **Just so we are using the same terminology, does c++ have a pattern to define concrete objects that are copiable? ie your basic types, int, char, float. and classes that have been designed to be copiable: ie std::string, std::vector etc. **Maybe it's called concrete type.

1 0

Re: [Boost-users] [license] Why is the Boost license not anofficial Open Source license?
by Sohail Somani 27 Jul '06

27 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Gennaro Prota > Sent: Thursday, July 27, 2006 10:05 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [license] Why is the Boost license > not anofficial Open Source license? > > With a terminology stress which (to me) twists the meaning of "free > software" it could be classified as "non-copylefted free software" > (which basically means, anyone can redistribute it under a non free > license; in the case of boost they can do that only if they don't > redistribute the source code) So if you use boost in your interfaces, you've gotta redistribute your source code too?

3 2

Re: [Boost-users] [license] Why is the Boost license not anofficial Open Source license?
by Sohail Somani 27 Jul '06

27 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Sebastian Redl > Sohail Somani wrote: > > >So if you use boost in your interfaces, you've gotta > redistribute your > >source code too? > > > > > No. All he said is that you may not distribute the Boost > sources under > any license but the Boost license. It doesn't affect your own > stuff at all. Gotcha.

1 0

converting a string to an enum
by Elisabeth Benoit 27 Jul '06

27 Jul '06

Hi, Does boost offer some kind of functionality allowing to transform a string into an enum? thanks.

2 1

using boost
by Fred J. 27 Jul '06

27 Jul '06

Hi could some one point to a link how how to link/compile with boost? or tell me whats missing from the makefile below? thanks alot #include <converter_policies.hpp> using boost::floor; ... cout << floor(12.45) << endl; ... the make file; OBJS := $(patsubst %.cpp,%.o,$(wildcard *.cpp)) COMP = g++ proj: $(OBJS) $(COMP) -Wall -o proj $(OBJS) #-Wall turns on all warnings clean: rm -rf *.o proj --------------------------------- Do you Yahoo!? Next-gen email? Have it all with the all-new Yahoo! Mail Beta.

2 1

[Boost.Python/Bjam] How to wrap a binary only dll ?
by michael_gruner＠arcor.de 27 Jul '06

27 Jul '06

Hello, I'm new to boost and did sucessfully complete the installation of boost and the boost.python hello world example. However, I'm wondering how to wrap a shared library I get as a binary and a header file to access it. Can anyone point me to any documentation about this? little example: I own a library "mylib.dll" and a header file "mylib.h" without any source code for my platform. Now I'd like to build a python wrapper to access this mylib.dll. I already wrote a "mywrapper.cpp" that includes the mylib.h file. But however bjam tries to build a mylib.pyd instead of using just the dll. can anyone help me with this? thank you Michael

2 2

[regex] boost::match_extra vc 8.0 express access violation
by Ovanes Markarian 27 Jul '06

27 Jul '06

Hi! I am trying to match a function body and find out if the params or return type have specific class name patterns. Therefore I did a really huge regex... sorry if is not so readable, but I used defines to make as little errors as possible... //non marking group #define NMG_S(s) "(?:"+s+")" #define NMG_S_0N(s) NMG_S(s)"*" #define NMG_S_1N(s) NMG_S(s)"+" #define NMG_S_01(s) NMG_S(s)"?" #define NMG(s) "(?:"s")" #define NMG_0N(s) NMG(s)"*" #define NMG_1N(s) NMG(s)"+" #define NMG_01(s) NMG(s)"?" #define RE_OR "|" #define RE_SPACE "[[:space:]]" #define RE_SPACE_01 RE_SPACE "?" #define RE_SPACE_0N RE_SPACE "*" #define RE_SPACE_1N RE_SPACE "+" #define RE_START_WORD "\\<" #define RE_END_WORD "\\>" #define RE_ID "[[:alpha:]]" NMG_0N("[_a-zA-Z0-9]") #define RE_CONST "const" #define RE_VOLATILE "volatile" #define RE_ANY "." #define RE_ANY_0N ".*" #define RE_ANY_1N ".+" #define RE_ANY_01 ".?" #define RE_PTR "\\*" #define RE_PTR_0N RE_PTR "*" #define RE_PTR_1N RE_PTR "+" #define RE_PTR_01 RE_PTR "?" #define RE_REF "&" #define RE_REF_0N RE_REF "*" #define RE_REF_1N RE_REF "+" #define RE_REF_01 RE_REF "?" #define RE_LINE_START "^" #define ONE_OF_PROTOCOLS NMG_S(strings::Name1) RE_OR NMG_S(strings::Name2) RE_OR NMG_S(strings::Name3) RE_OR \ NMG_S(strings::Name4) RE_OR NMG_S(strings::Name5) RE_OR NMG_S(strings::Name6) RE_OR \ NMG_S(strings::Name7) RE_OR NMG_S(strings::Name8) RE_OR NMG_S(strings::Name9) RE_OR \ NMG_S(strings::Name10) #define MATCH_PROTOCOL RE_START_WORD \ NMG_01(RE_ANY_0N "(" ONE_OF_PROTOCOLS ")" RE_ANY_0N) RE_OR \ NMG_01(RE_ANY_1N) \ RE_END_WORD RE_SPACE_0N Name1 to Name10 are static const std::string definitions within a class. A have the following regex defined to match params and function return type const boost::regex strings::regex_fct ( //possibly leading whitespace or const RE_LINE_START RE_SPACE_0N NMG_01(RE_CONST RE_SPACE_1N) //result type MATCH_PROTOCOL //return type can be a pointer or reference with const qualifier NMG_01(RE_CONST RE_SPACE_0N) RE_PTR_0N RE_SPACE_0N RE_REF_01 RE_SPACE_0N NMG_01(RE_CONST) RE_SPACE_1N //function name RE_START_WORD NMG_01(RE_ID) RE_END_WORD RE_SPACE_0N //function params "\$" //open function params brace //param type (can be repeated 0 to N times) NMG_0N( RE_SPACE_0N MATCH_PROTOCOL RE_SPACE_0N //may be a ptr or ref type NMG_01(RE_CONST RE_SPACE_0N) RE_PTR_0N RE_SPACE_0N RE_REF_01 RE_SPACE_0N NMG_01(RE_CONST) RE_SPACE_1N //(?: still open //param name and default initializations are not important RE_ANY_0N //params can be comma separated in case of more then 1 param NMG_01(",") //close NMG_0N ) //terminate in "\$" ); Now I have the following test string: using namespace std; string search_where_fct1("CName1_Setup const* someFct(){}"); set<string> uniques_names; find_protocols(search_where_fct1, strings::regex_fct, uniques_names); void find_protocols(const std::string& str, const boost::regex& expression, std::set<std::string>& log) { boost::smatch what; IdentifyProtocolUsage usage(log); if(boost::regex_match(str, what, expression, boost::match_extra)) //<<<<< crash!!!! { usage(what); } } This is the boost::regex function where it crashes: template <class BidiIterator, class Allocator, class traits> bool perl_matcher<BidiIterator, Allocator, traits>::match_imp() { // initialise our stack if we are non-recursive: #ifdef BOOST_REGEX_NON_RECURSIVE save_state_init init(&m_stack_base, &m_backup_state); used_block_count = BOOST_REGEX_MAX_BLOCKS; #if !defined(BOOST_NO_EXCEPTIONS) try{ #endif #endif // reset our state machine: position = base; search_base = base; state_count = 0; m_match_flags |= regex_constants::match_all; //LINE 162 perl_matcher_common.hpp !!! m_presult->set_size((m_match_flags & match_nosubs) ? 1 : re.mark_count(), search_base, last); m_presult->set_base(base); if(m_match_flags & match_posix) m_result = *m_presult; verify_options(re.flags(), m_match_flags); if(0 == match_prefix()) return false; return m_result[0].second == last; #if defined(BOOST_REGEX_NON_RECURSIVE) && !defined(BOOST_NO_EXCEPTIONS) } catch(...) { // unwind all pushed states, apart from anything else this // ensures that all the states are correctly destructed // not just the memory freed. while(unwind(true)){} throw; } #endif } Call from this line causes access violation: Unhandled exception at 0x104817fd in some_app.exe: 0xC0000005: Access violation writing location 0x56394ab7. I re-built regex with BOOST_REGEX_MATCH_EXTRA uncommented in user.hpp. Would be really nice to receive some comments or suggestions. With Kind Regards, Ovanes Markarian

2 1

[Boost compilation on SGI] Problems compiling boost on SGI
by Sebastien Fortier 27 Jul '06

27 Jul '06

Can anyone help with this, I have been trying to compile boost on an SGI machine. Boost source taken from cvs. IRIX version: IRIX Release 6.5 IP35 MIPSpro compiler version: MIPSpro Compilers: Version 7.4.2m attached is the log of my last compilation effort. Here is a short sorted list of the reoccurring errors ----------------------------------------------------------------------------------------------------------------------------------- cc-1004 CC: ERROR File = /data/cmdwx4/pst/package/boost_cvs/boost/type_traits/is_arithmetic.hpp, Line = 37 Not enough memory is available. BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_arithmetic,T,::boost::detail::is_arithmetic_impl<T>::value) ^ 1 catastrophic error detected in the compilation of [...] ----------------------------------------------------------------------------------------------------------------------------------- cc-1004 CC: ERROR File = /data/cmdwx4/pst/package/boost_cvs/boost/type_traits/is_same.hpp, Line = 37 Not enough memory is available. BOOST_TT_AUX_BOOL_TRAIT_DEF2(is_same,T,U,false) ^ 1 catastrophic error detected in the compilation of [...] ----------------------------------------------------------------------------------------------------------------------------------- cc-1282 CC: ERROR File = /data/cmdwx4/pst/package/boost_cvs/boost/test/utils/named_params.hpp, Line = 307 More than one instance of overloaded function "boost::nfp::optionally_assign" matches the argument list. Function symbol function template "boost::nfp::optionally_assign(T &, boost::nfp::nfp_detail::nil)" is ambiguous by inheritance. Function symbol function template "boost::nfp::optionally_assign(T &, const Source &)" is ambiguous by inheritance. The argument types are: (std::size_t, boost::nfp::nfp_detail::nil ). optionally_assign( target, p[k] ); ^ ----------------------------------------------------------------------------------------------------------------------------------- cc-1384 CC: ERROR File = /data/cmdwx4/pst/package/boost_cvs/boost/test/impl/unit_test_suite.ipp, Line = 124 Protected member "boost::unit_test::class_property<boost::unit_test::test_unit_id>::va lue" is not accessible through a "boost::unit_test::readwrite_property<boost::unit_test::counter_t>" pointer or object. tu->p_expected_failures.value = expected_failures; ^ ----------------------------------------------------------------------------------------------------------------------------------- cc-1384 CC: ERROR File = /data/cmdwx4/pst/package/boost_cvs/boost/test/impl/unit_test_suite.ipp, Line = 126 Protected member "boost::unit_test::class_property<boost::unit_test::test_unit_id>::va lue" is not accessible through a "boost::unit_test::readwrite_property<boost::unit_test::counter_t>" pointer or object. p_expected_failures.value += tu->p_expected_failures; ^ These errors reoccur throughout the compilation process, is there a fix for this ? the skipped libraries are libboost_test_exec_monitor libboost_unit_test_framework libboost_wave I already compiled the library under Linux and everything worked fine. I was hoping to use the unit testing library from boost instead of cppunit but if I cant compile it I will have no choice in the matter. -- Sébastien Fortier

1 0

Re: [Boost-users] [boost] BGL - cycles in an undirected graph
by Aaron Windsor 27 Jul '06

27 Jul '06

On 7/20/06, Michal <simecek(a)gmx.de> wrote: > my task is to find cycles in an undirected graph and to assign a cycle id > to each > vertex in this cycle. It is still a bit more complicated, because I do not > need just the simple cycles, but all simple cycles which are sharing > edges, must > get the same cycle id. > > I think this problem is already solved somewhere, but I cann not find the > right > approach, thus I am asking here if somebody have an idea how to solve it > best > with BGL. Michal, If you want to label the edges of a graph such that (1) any two edges that are on a simple cycle together get the same label, and (2) any two edges not on any cycle together get distinct labels then you simply want to find the biconnected components of the graph - there's a way to do this in linear time using depth-first search, and the algorithm is in the BGL: http://www.boost.org/libs/graph/doc/biconnected_components.html However, the fact that you said that you want to label all vertices in the graph with a distinct label subject to condition (1) above is a little confusing - you can have two cycles that don't meet in any edges but share a common vertex, and in that case, which of the two labels would you want to use for that vertex? Aaron

2 1

[mpl] A partioning unique/non-unique algorithm
by Eric Lemings 27 Jul '06

27 Jul '06

Greetings, How would you combine the boost::mpl::partition and boost::mpl::unique algorithms such that an element that is not placed into the first inserter (for unique elements) is placed into the second inserter (for non-unique elements)? Thanks, Eric.

2 1

error in compiling lambda on solaris
by Mr Abhinav Rai 26 Jul '06

26 Jul '06

I am trying to compile C++ code with lambda included. I am using following version of compiler on Solaris: CC: Sun C++ 5.5 Patch 113817-12 2005/03/08 I get following compile error: /boost/lambda/detail/is_instance_of.hpp", line 90: Error: "{" expected instead of ">" Does this version of solaris compiler not able to compile lambda? are there any defines needed to fix this? __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

Re: [Boost-users] [serialization] basic_xml_iarchive tag checkingbugs
by Todd Greer 26 Jul '06

26 Jul '06

Robert Ramey wrote: Todd Greer wrote: >> 1. The sense of the check of the flags against no_xml_tag_checking is >> reversed. By default, checking of xml tag names is not done, contrary >> to the documentation. If no_xml_tag_checking is passed in as a flag, >> tag checking is enabled. >> My recommended fix for (1) would be to change no_xml_tag_checking to >> check_xml_tags, and to change the documentation to reflect this. While >> the more obvious solution would be to simply fix the comparison, this >> would introduce a silent behavioral change. My recommended fix will >> fail to compile for those that have specified no_xml_tag_checking, >> thus alerting them to the change. > I prefer the more obvious fix as I don't want to change the docs and all > the other switches are no_... I have no objection to that. >> My recommended fix for (2) is to replace the excerpted code with: >> if(0 != (this->get_flags() & check_xml_tags) && rv.object_name != >> name) > > Hmmm - don't we have the same problem here? That is if the object name > read is larger than "name" we could still overflow something. In this case, rv.object_name is a std::string. std::string defines an operator!=(string const& a, char const* b) that has well defined semantics regardless of the lengths of a and b. It just requires that b is a valid c-style string. -- Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC

1 0

boost lambda with proxy reference object
by Nathan Thomas 26 Jul '06

26 Jul '06

Hi all, I'm trying to use boost lambda to aggregate several functor calls together in one pass over my data with a std::for_each(..) (using bind and the lambda comma operator). I'm running into problems because I use an iterator (over type T) where the dereference operator doesn't return a T& but instead an object of type proxy<T>. This proxy class handles marshaling the object from another address space & setting up a temporary copy on its construction and subsequently writes back on destruction. Lambda expects (as it should) a T& from the deference attempt to invoke functors which are set to expect the proxy type. Is there a template I can specialize for this case or some type I could but am not reflecting out of my iterator class to make this work. Or is there better way to write this iterator that would allow me to properly pass a T& while still allowing some pre & post processing on the dereference? Thanks for you time / help, --Nathan Thomas Texas A&M University

1 0

Re: [Boost-users] XML Serialization Traits Question
by William Bardon 26 Jul '06

26 Jul '06

Robert, Thanks for the example; it helped clear up some uncertainty about the template arguments in the derived class. Regarding save_override, I see where specialized versions for the different trait types are defined in basic_xml_oarchive.ipp. I also see that save_override is called from the operator<< redefinition in interface_oarchive.hpp. What I'm missing is the link between serializing a user-defined class object and the traits of that object. template<class Archive> BOOST_ARCHIVE_OR_WARCHIVE_DECL(void) basic_xml_oarchive<Archive>::save_override(const version_type & t, int) { int i = t.t; // extra .t is for borland write_attribute(VERSION(), i); } This function already displays a version attribute in the XML. How do I make sure this is called for every element? I'm sorry, but I can't figure out how to modify chain of control to force output of class traits. Starting in oserializer.hpp, boost::archive::save<Archive,T> calls static save_non_pointer_type<Archive, T>::invoke calls serialize_adl calls boost::serialization::serialize<Archive, T> calls access::serialize calls myClass::serialize<Archive> (Archive& ar, unsigned int version) There is also a function oserializer<Archive,T>::save_object_data that calls serialize_adl, but I can't find anything that calls it. The struct save_non_pointer_type<Archive, T> in oserializer.hpp may be the key, but I'm not sure how it works. In oserializer.hpp, struct save_non_pointer_type<Archive,T>::save_standard::invoke calls Archive::save_object, but I do not see an implementation of the function anywhere: $ find /usr/include/boost -type f -exec grep -H save_object {} \;| grep -v save_object_ | more /usr/include/boost/archive/polymorphic_oarchive.hpp: virtual void save_object( /usr/include/boost/archive/detail/oserializer.hpp: ar.save_object(& t, oserializer<Archive, T>::instantiate()); /usr/include/boost/archive/detail/basic_oarchive.hpp: void save_object( /usr/include/boost/archive/detail/polymorphic_oarchive_impl.hpp: virtual void save_object( /usr/include/boost/archive/detail/polymorphic_oarchive_impl.hpp: ArchiveImplementation::save_object(x, bos); I'd appreciate any suggestions. Am I even looking in the right place? Thanks in advance, Bill -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Robert Ramey Sent: Wednesday, July 26, 2006 12:14 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] XML Serialization Traits Question "William Bardon" <wbardon(a)cabcds.org> wrote in message news:C73E689C9FCF884B9A550ECFADA0721C087D3E@exchange.cab-cds.org... I have read both the Boost Serialization online documentation and the archives of the Boost-Users mailing list looking for guidance, but I haven't found anything relevant. I see how to use BOOST_CLASS_TRACKING and BOOST_CLASS_IMPLEMENTATION to remove version tracking attributes from the XML tags. Usage of these macros does a lot more than remove attributes from the tags. I want to go in the opposite direction. I notice that the class_id and version attributes only appear the first time an object of a particular class is serialized. I want to force the version attribute to appear in every object's attribute list. Do I need to derive a custom archive to do this? yes I have looked at the source code for serialization, but I have trouble plowing through all of the macros, template expansions, and overloaded functions to locate the specific part that controls whether class traits are stored as attributes in a particular XML tag. I sympathize - its hard to follow. And I wrote it. Here are some hints: a) look at demo_fast_archive.cpp to see a model of how one can derive from an existing archive. b) You'll want to derive from xml_oarchive_impl<...> to create my_xml_oarchive c) add a "save_override" function to my_xml_oarchive which replaces the "save_override" function in basic_xml_oarchive.ipp. Implement this using functions defined basic_xml_oarchive.ipp Good luck - Robert Ramey Thanks in advance, Bill _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

[serialization] basic_xml_iarchive tag checking bugs
by Todd Greer 26 Jul '06

26 Jul '06

Hi, While developing skip_xml_iarchive, I noticed to bugs in basic_xml_iarchive::load_end(). 1. The sense of the check of the flags against no_xml_tag_checking is reversed. By default, checking of xml tag names is not done, contrary to the documentation. If no_xml_tag_checking is passed in as a flag, tag checking is enabled. 2. If tag checking is enabled, and a tag name is encountered that is longer than the name passed in, the name string is accessed past the end of the array. In the expression "name[this->This()->gimpl->rv.object_name.size()]", the index is the size of the encountered name, and could be arbitrarily large. The relevant portion of basic_xml_iarchive::load_end() is included here: if(0 != (this->get_flags() & no_xml_tag_checking)){ if(0 != name[this->This()->gimpl->rv.object_name.size()] || ! std::equal( this->This()->gimpl->rv.object_name.begin(), this->This()->gimpl->rv.object_name.end(), name ) My recommended fix for (1) would be to change no_xml_tag_checking to check_xml_tags, and to change the documentation to reflect this. While the more obvious solution would be to simply fix the comparison, this would introduce a silent behavioral change. My recommended fix will fail to compile for those that have specified no_xml_tag_checking, thus alerting them to the change. My recommended fix for (2) is to replace the excerpted code with: if(0 != (this->get_flags() & check_xml_tags) && rv.object_name != name) The Boost FAQ recommends posting bug reports to the mailing list. Let me know if you would like for me to submit this to the bug repository. -- Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC

2 1

Re: [Boost-users] [serialization] Skipping unexpected elements inXMLarchive
by Todd Greer 26 Jul '06

26 Jul '06

Robert Ramey wrote: > Sounds to me that others might find this useful. How about making a > little write up, and maybe a small test/demo, zipping it up and uploading > to the serialization section of the boost vault? I've uploaded skip_xml_iarchive.zip to the vault in serialization. I've fixed several issues from the version I posted here, and have added a bit of testing and explanation. I hope that people find it useful. Please let me know if you have any questions, or find any problems. If you do find it useful, please let me know that as well. -- Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC

1 0

Re: [Boost-users] how to see the actual value of a'boost::optional<__int64>' in VS2005 debugger
by David Klein 26 Jul '06

26 Jul '06

boost-users-bounces(a)lists.boost.org wrote: > Hi Catherine, > > I am sorry that I don't have any idea about a solution to > your problem. Instead, I myself have a problem to ask for > help to solve. If you happen to know anything about it and > would kindly to help me, I would appreciate it very much. > > I am trying to port Bayes++ into a Visual C++ 2005 project. > The version of Boost library is the latest ( v1.33.1). > However, I came cross a C2064 error that tells "term does not > evaluate to a function taking 0 arguments" when I was > compiling the BayesFilter project, which integrates Boost > header libraries. The error referred to the sentence > > BOOST_UBLAS_INLINE > const_iterator (const iterator &it): > container_const_reference<self_type> (it ()), it_ (it.it _) {} > > at line 293 in file "boost_1_33_1\boost\numeric\ublas\vector.hpp". > > I guess that the problem is related to an incompatibility > between Visual C++ 2005 and the Boost C++ package, and might > be cracked by setting appropriate VC 2005 compiling options > or Boost C++ #dehine's. But I don't have any right ideas to > do so. If you could help, it will be very helpful for me. > > Sincerely, > > Jason Zhang > hi jason, see http://thread.gmane.org/gmane.comp.lib.boost.ublas/2472/focus=2472. btw: you better post UBLAS related questions to the ublas mailing list (ublas <at> lists.boost.org) -- HTH dave

2 1

XML Serialization Traits Question
by William Bardon 26 Jul '06

26 Jul '06

I have read both the Boost Serialization online documentation and the archives of the Boost-Users mailing list looking for guidance, but I haven't found anything relevant. I see how to use BOOST_CLASS_TRACKING and BOOST_CLASS_IMPLEMENTATION to remove version tracking attributes from the XML tags. I want to go in the opposite direction. I notice that the class_id and version attributes only appear the first time an object of a particular class is serialized. I want to force the version attribute to appear in every object's attribute list. Do I need to derive a custom archive to do this? I have looked at the source code for serialization, but I have trouble plowing through all of the macros, template expansions, and overloaded functions to locate the specific part that controls whether class traits are stored as attributes in a particular XML tag. Thanks in advance, Bill

2 1

how to see the actual value of a 'boost::optional<__int64>' in VS2005 debugger
by Catherine 26 Jul '06

26 Jul '06

Hi boost experts, Recently, I noticed that I no longer see the actual value of a 'boost::optional<__int64>'variable in VS2005 debugger. My program is in C++. I recalled that I could find the actual value from the data field of the variable... Anyone encounted this problem? Other than cast the value to be _int64, is there any other way I can work around it? Thanks in advance, Catherine

3 2

Re: [Boost-users] how to see the actual value of a 'boost::optional<__int64>' in VS2005 debugger
by David Klein 26 Jul '06

26 Jul '06

boost-users-bounces(a)lists.boost.org wrote: > Hi boost experts, > > Recently, I noticed that I no longer see the actual value of > a 'boost::optional<__int64>'variable in VS2005 debugger. My program > is in C++. > > I recalled that I could find the actual value from the data field of > the variable... > > Anyone encounted this problem? Other than cast the value to > be _int64, is there any other way I can work around it? > > Thanks in advance, > Catherine > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users hi catherine, +my_int64 +boost::optional_detail::optional_base ... +- +- +m_storage +dummy_ +data +aligner_ +t0 +... +t23 in case of an int64 it is in t4. but this only seems to work for ints. you could also add the following line to %YOUR_MSVS8_DIR%/common7/packages/debugger/autoexp.dat: <snip> boost::optional<__int64>= initialized=<m_initialized> value=<m_storage.dummy_.aligner_.t4> </snip> this changes the display of {...} to f.ex. {initialized=true value=42} -- HTH dave

1 0

uBlas matrix * matrix operation
by Dave Steffen 26 Jul '06

26 Jul '06

Hi Folks, This is my first excursion into uBlas. I'm getting an "ambiguous overload for 'operator*' in 'a * b' " sort of error out of this: #include <boost/numeric/ublas/vector.hpp> #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/matrix_expression.hpp> namespace UB { using namespace boost::numeric::ublas; template <int N> struct Type { typedef matrix<double, row_major, bounded_array<double, N*N> > matrix; }; } // elsewhere... typename UB::Type<N>::matrix a(N,N), b(N,N); for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) { a(i,j) = 1.0 / (i + j+1); b(i,j) = 1.0 / (i + j+1); } a * b; The error (from GCC 3.4.6) is this ugly thing: /usr/local/home/dgsteffen/local/GCC34/Boost/1_32/boost/numeric/ublas/matrix_expression.hpp:3632: note: candidates are: typename boost::numeric::ublas::matrix_binary_scalar2_traits<E1, const T2, boost::numeric::ublas::scalar_multiplies<typename E1::value_type, T2>, boost::numeric::ublas::scalar_reference<const T2> >::result_type boost::numeric::ublas::operator*(const boost::numeric::ublas::matrix_expression<E>&, const T2&) [with E1 = boost::numeric::ublas::matrix<double, boost::numeric::ublas::row_major, boost::numeric::ublas::bounded_array<double, 441u, std::allocator<double> > >, T2 = boost::numeric::ublas::matrix<double, boost::numeric::ublas::row_major, boost::numeric::ublas::bounded_array<double, 441u, std::allocator<double> > >] /usr/local/home/dgsteffen/local/GCC34/Boost/1_32/boost/numeric/ublas/matrix_expression.hpp:3162: note: typename boost::numeric::ublas::matrix_binary_scalar1_traits<const T1, E2, boost::numeric::ublas::scalar_multiplies<T1, typename E2::value_type>, boost::numeric::ublas::scalar_reference<const T1> >::result_type boost::numeric::ublas::operator*(const T1&, const boost::numeric::ublas::matrix_expression<E2>&) [with T1 = boost::numeric::ublas::matrix<double, boost::numeric::ublas::row_major, boost::numeric::ublas::bounded_array<double, 441u, std::allocator<double> > >, E2 = boost::numeric::ublas::matrix<double, boost::numeric::ublas::row_major, boost::numeric::ublas::bounded_array<double, 441u, std::allocator<double> > >] Any thoughts on what I'm doing wrong? Thanks! ---------------------------------------------------------------------- Dave Steffen, Ph.D. Software Engineer IV Disobey this command! Numerica Corporation ph (970) 419-8343 x27 fax (970) 223-6797 - Douglas Hofstadter dgsteffen(a)numerica.us ___________________ Numerica Disclaimer: This message and any attachments are intended only for the individual or entity to which the message is addressed. It is proprietary and may contain privileged information. If you are neither the intended recipient nor the agent responsible for delivering the message to the intended recipient, you are hereby notified that any review, retransmission, dissemination, or taking of any action in reliance upon, the information in this communication is strictly prohibited, and may be unlawful. If you feel you have received this communication in error, please notify us immediately by returning this Email to the sender and deleting it from your computer.

1 0

How to cast form string to number safely?
by 袁晓辉 26 Jul '06

26 Jul '06

Dear boost-users: I am really sorry for asking shch a silly question, but I really need your help! boost::lexical_cast is a great function to do casting. If I want is to cast from string to a "long long" type value, I can use the follow: long long llVar = lexical_cast<long long>("123456789"); It is alright in this circs, but what if: lexical_cast<long long>("9999999999999999999999999999999999999999999999999999999999999999999999999999"); This is an obvious overflow, but I have no way to handle this error, it returns a wrong number without throwing an exception! Any suggestion? Thank you very much!!! Kevin

4 5

Re: [Boost-users] shared_ptr and inheritance of the raw pointer
by Nat Goodspeed 26 Jul '06

26 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Yossi.Itzkovich(a)ecitele.com > Sent: Wednesday, July 26, 2006 3:03 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] shared_ptr and inheritance of the raw pointer > > I have this code: > > #include <boost/shared_ptr.hpp> > > class A{ // base class > public: virtual ~A(); // otherwise A isn't polymorphic, can't downcast > }; > > class B : public A{ > public: > int b1; > }; > > typedef boost::shared_ptr<A> tSmartA; > typedef boost::shared_ptr tSmartB; > > void foo (const tSmartB& smartOne); // need ; for syntax ^^^^^ permits passing an expression > > int main () { > tSmartA a(new B); foo(boost::dynamic_pointer_cast(a)); ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ > return 0; > } > > > How can I then send a to foo() ? [Nat] With the three changed lines shown above, this compiles for me under MSVC 7.1.

1 0

Boost MultiIndex container - using multiple composite keys
by Charitha Herath 26 Jul '06

26 Jul '06

Hi All, I'm new to this mailing list. I have been using the boost multi index container for a while. I now have requirement where I need to create multiple composite keys. The example 7 (composite keys example) in the multi index container documentation shows that it is possible to define multiple composite keys. But how do we use a specific composite key when searching the data. Does the container differentiate the composite keys using the key data types? Thanks, Charitha --------------------------------- How low will we go? Check out Yahoo! Messengers low PC-to-Phone call rates.

2 1

shared_ptr and inheritance of the raw pointer
by Yossi.Itzkovich＠ecitele.com 26 Jul '06

26 Jul '06

Hi, I have this code: #include <boost/shared_ptr.hpp> class A{ // base class public: }; class B : public A{ public: int b1; }; typedef boost::shared_ptr<A> tSmartA; typedef boost::shared_ptr tSmartB; void foo (tSmartB& smartOne) // should get a pointer to derived { } int main () { tSmartA a(new B); foo(a); // This line doesn't compile because foo expects to get tSmartB return 0; } How can I then send a to foo() ? Thanks Yossi

2 1

[Lambda] find_if + vector of arrays
by Sohail Somani 25 Jul '06

25 Jul '06

Hi, Why can't lambda figure out the return type of operator[] for array? Does it know about vectors? I know I can fix the compile error by using bl::ret<double>(bl::_1[0])... But for obvious reasons, I'd much rather not! #include <vector> #include <algorithm> #include <boost/array.hpp> #include <boost/lambda/lambda.hpp> int main() { namespace bl=boost::lambda; using std::vector; using boost::array; array<double,3> cpy = {1}; vector<vector<double> > a(10,vector<double>(3,1)); vector<array<double,3> > b(10,cpy); std::find_if(a.begin(),a.end(),bl::_1[0]==5); std::find_if(b.begin(),b.end(),bl::_1[0]==5); } Thanks! Sohail

1 0

Re: [Boost-users] [serialization] Skipping unexpected elements inXMLarchive
by Todd Greer 25 Jul '06

25 Jul '06

Robert Ramey wrote: > Sounds to me that others might find this useful. How about making a > little write up, and maybe a small test/demo, zipping it up and uploading > to the serialization section of the boost vault? I'll do that. Unfortunately, I noticed that I use putback twice in a row, which I understand is not guaranteed to work. I'm working on fixing that now, and will put the code in the vault once that's fixed. I've fixed a couple of other things as well, and will include those fixes in the vault upload. -- Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC

1 0

reading data into vector/matirx
by Fred J. 25 Jul '06

25 Jul '06

dear boost users is there a library where it will take a file name and gives a vector/matrix of the data in the file. data formate is space delimited name age location hairColour thanks --------------------------------- Do you Yahoo!? Get on board. You're invited to try the new Yahoo! Mail Beta.

1 0

Grep() question
by Winson Yung 25 Jul '06

25 Jul '06

Hello all, I have the following regular expression, but it doesn't match to this text "REVENUE ................................................... $10,481.1" const char* pattern[] = "Revenue[\s\.]*\$?\s*([0-9,\.]*)"; my code looks something like this: std::vector <unsigned int> v; boost::RegEx expr(pattern, true); v.clear(); unsigned int result = expr.Grep(v, pBuf); if (result != 0) { std::string s = expr[0]; s = expr[1]; ............ Why expr[0] and expr[1] weren't return the aboved mention text as the first match? I think set 'true' in expr constructor means do case insensitve match. /Winson.

2 7

Newbie String Splitting Question
by Seth Nielson 25 Jul '06

25 Jul '06

Hi Two questions related to string tokenization. 1. Which is preferred? using "split" or the "tokenizer class"? 2. Both of these methods seem geared towards splitting on characters rather than splitting on substrings. Is there yet another method that is preferred for splitting a string on an exact substring? If I want to split "IAmATest" into I, Am, A, Test, what is the best way? It seems that for split I'll have to write my own predicate, and for tokenizer, I'll have to write my own tokenizerFunction. -- Seth N.

7 11

[shmem] compile time error with mingw (uint64_t)
by Sascha Lumma 25 Jul '06

25 Jul '06

Hi, Thats my second posting for this error, but in the first one I've done a error in reasoning. I get this error when I try to compile my application with mingw in Windows. ./boost/shmem/sync/xtime.hpp: In function `int boost::shmem::xtime_get(boost::shmem::xtime*, int)': ./boost/shmem/sync/xtime.hpp:91: error: integer constant is too large for "long" type The line which produce this error message is the following. static const boost::uint64_t timespec_to_filetime_offset = (boost::uint64_t)(116444736000000000); Firstly I thought that I've a configuration problem and uint64_t is defined with "long" or "unsigned long" and cannot hold this 64 bit constant, but it was wrong. uint64_t has just like the constant 64 bit - sizeof(boost::uint64_t) returns 8. If I replace boost::uint64_t with "unsigned long long" the same error occures. But unsigned has no sign bit and should hold exactly 64 bit values. I've absolutely no idea. What's wrong??? Thank you in advance for every reply, Sascha

3 4

How to build only one library ?
by Hrvoje Ban 25 Jul '06

25 Jul '06

I'm using MinGW and I want to build only Pointer Container library but I can't find way to configure Boost build system (I'm using Jam). Also, I noticed that Jam builds eight version of each library, get it be configured to only make one or two version since I don't need the others?

2 2

Re: [Boost-users] [Test] BOOST_*_COLLECTIONS
by Sohail Somani 25 Jul '06

25 Jul '06

Err. Nm. Brain fart... Const ostream! > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Sohail Somani > Sent: Tuesday, July 25, 2006 10:00 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] [Test] BOOST_*_COLLECTIONS > > Sorry, I should have sent this email here: > --- > Hi, > > With the following test case: > > #include <boost/array.hpp> > > template<typename T,size_t N> > std::ostream operator<<(const std::ostream & os, const > boost::array<T,N> & arr) > { > os << "[ "; > for(size_t i = 0 ; i < N-1; ++i) > { > os << arr[i] << ", "; > } > os << arr[N-1] << " ]"; > return os; > } > > BOOST_AUTO_UNIT_TEST ( test_boost_test_array ) > { > boost::array<double,3> arr1[] = { > {{1,0,0}}, > {{1,2,2}} > }; > > boost::array<double,3> arr2[] = { > {{1,0,0}}, > {{1,2,2}} > }; > > BOOST_REQUIRE_EQUAL_COLLECTIONS(arr1,arr1+2, > arr2,arr2+2); > } > > I'm getting odd compile errors at this line: > > res.message() << "\nMismatch in a position " << pos << ": " > << *left_begin << " != " << *right_begin; > > gcc.compile.c++ bjam-build/gcc/release/unit_tests/data_utils.o > external/boost/include/boost/test/utils/wrap_stringstream.hpp: > In function âboost::basic_wrap_stringstream<CharT>& > boost::operator<<(boost::basic_wrap_stringstream<CharT>&, > const T&) [with CharT = char, T = boost::array<double, 3u>]â: > external/boost/include/boost/test/test_tools.hpp:495: > instantiated from âboost::test_tools::predicate_result > boost::test_tools::tt_detail::equal_coll_impl(Left, Left, > Right, Right) [with Left = boost::array<double, 3u>*, Right = > boost::array<double, 3u>*]â > unit_tests/data_utils.cpp:62: instantiated from here > external/boost/include/boost/test/utils/wrap_stringstream.hpp: > 66: error: no match for âoperator<<â in â(+ > targ)->boost::basic_wrap_stringstream<CharT>::stream [with > CharT = char]() << tâ > > What am I missing here? > > Sorry for the long email! > > TIA, > > Sohail > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

1 0

[Test] BOOST_*_COLLECTIONS
by Sohail Somani 25 Jul '06

25 Jul '06

Sorry, I should have sent this email here: --- Hi, With the following test case: #include <boost/array.hpp> template<typename T,size_t N> std::ostream operator<<(const std::ostream & os, const boost::array<T,N> & arr) { os << "[ "; for(size_t i = 0 ; i < N-1; ++i) { os << arr[i] << ", "; } os << arr[N-1] << " ]"; return os; } BOOST_AUTO_UNIT_TEST ( test_boost_test_array ) { boost::array<double,3> arr1[] = { {{1,0,0}}, {{1,2,2}} }; boost::array<double,3> arr2[] = { {{1,0,0}}, {{1,2,2}} }; BOOST_REQUIRE_EQUAL_COLLECTIONS(arr1,arr1+2, arr2,arr2+2); } I'm getting odd compile errors at this line: res.message() << "\nMismatch in a position " << pos << ": " << *left_begin << " != " << *right_begin; gcc.compile.c++ bjam-build/gcc/release/unit_tests/data_utils.o external/boost/include/boost/test/utils/wrap_stringstream.hpp: In function âboost::basic_wrap_stringstream<CharT>& boost::operator<<(boost::basic_wrap_stringstream<CharT>&, const T&) [with CharT = char, T = boost::array<double, 3u>]â: external/boost/include/boost/test/test_tools.hpp:495: instantiated from âboost::test_tools::predicate_result boost::test_tools::tt_detail::equal_coll_impl(Left, Left, Right, Right) [with Left = boost::array<double, 3u>*, Right = boost::array<double, 3u>*]â unit_tests/data_utils.cpp:62: instantiated from here external/boost/include/boost/test/utils/wrap_stringstream.hpp:66: error: no match for âoperator<<â in â(+ targ)->boost::basic_wrap_stringstream<CharT>::stream [with CharT = char]() << tâ What am I missing here? Sorry for the long email! TIA, Sohail

1 0

Re: [Boost-users] Boost-users Digest, Vol 976, Issue 2
by Wu Yinghui, Freddie 25 Jul '06

25 Jul '06

> Wu Yinghui, Freddie wrote: >> Hi all, >> >> I'm just starting to try out Boost.Date_time library. As a newbie, I >> want to know if there is any good tutorial or "get started" guide >> somewhere that I can refer to. >> >> I've checked out the Data_time library documentation, as well as done >> some search on Google. Yet I cannot find useful information for an >> absolute beginner. >> >> Simple operation such as "Get the current time in the current time zone, > > http://www.boost.org/doc/html/date_time/posix_time.html#ptime_from_clock > >> and print it out using ISO format" is not achievable from reading the >> documentation-- > > http://www.boost.org/doc/html/date_time/posix_time.html#ptime_to_string > >> It is helpful to an experienced user, but not at all to a >> newbie. >> >> So any hints on how I should get started with Boost.Date_time library? > > Read the docs and examples a little deeper. > >> Cheers, >> >> Freddie >> >> P.S. I found one very annoying fact that most examples in Boost >> documentation do not indicate the namespace and/or header file to use >> for all those classes and types. This makes it very difficult for a >> beginner to get started in general. Any comments on this? > > All of the following examples clearly show the header and namespace: > > http://www.boost.org/doc/html/date_time/examples/general_usage_examples.html > > http://www.boost.org/doc/html/date_time/examples.html > > Overall I've never had a problem with this in Boost docs. > > Jeff Thanks for the pointers Jeff. You can pinpoint where the docs is for that specific task, because you had experience with the library (BTW, that task is just "for example," and I have a lot more doubts regarding the usage of the library). Thanks for the efforts on the library as well as the documentation. I guess it's time for me to refresh our local document cache with the ones on boost.org. :p I think the docs now look a lot more approachable. Sorry for the noise. Regarding the namespace/header file problem, it is not fair to say that all docs had me confused on it. But I did face problems previously when I was going through the references for certain functions I needed. Sometimes, I simply cannot find out the exact namespace/header to use without grepping the source tree (or go back to read the docs in full). Cheers, Freddie

2 1

(no subject)
by Jason Zhang 25 Jul '06

25 Jul '06

Hi everybody, I came cross the error C2064 "term does not evaluate to a function taking 0 arguments" when I was compiling "boost_1_33_1\boost\numeric\ublas\vector.hpp". The error is referred to the sentence BOOST_UBLAS_INLINE const_iterator (const iterator &it): container_const_reference<self_type> (it ()), it_ (it.it_) {} at line 293. Could anybody help provide hints to solve the problem? Many thanks, Jason

1 0

[shmem] error: constant is too large for long type
by Sascha Lumma 25 Jul '06

25 Jul '06

Hi all, I try to port my application to windows and use mingw 3.4.2 (32 bit machine). I get the following error at compilation time and I'm not sure, is that a misconfiguration or bug? ./boost/shmem/sync/xtime.hpp: In function `int boost::shmem::xtime_get(boost::shmem::xtime*, int)': ./boost/shmem/sync/xtime.hpp:89: error: integer constant is too large for "long" type The variable which should take this big decimal number (116444736000000000 -> exactly 32 bit) in line 89 is from type uint64_t and should have 64 bit unsigned. But that isn't so, it's just only long=int type (31 bit). If I look to the definition from uint64_t (boost/cstdint.hpp), there are much possibilities. With the GNU compiler it should be used the unsigned long long type as uint64_t and that are 64 bits. In worst case it should be used a 32 bit unsigned long type. Why I've only a long type? Thank you very much for reply, Sascha

2 1

[Date_time] How to Get Started?
by Wu Yinghui, Freddie 25 Jul '06

25 Jul '06

Hi all, I'm just starting to try out Boost.Date_time library. As a newbie, I want to know if there is any good tutorial or "get started" guide somewhere that I can refer to. I've checked out the Data_time library documentation, as well as done some search on Google. Yet I cannot find useful information for an absolute beginner. Simple operation such as "Get the current time in the current time zone, and print it out using ISO format" is not achievable from reading the documentation--It is helpful to an experienced user, but not at all to a newbie. So any hints on how I should get started with Boost.Date_time library? Cheers, Freddie P.S. I found one very annoying fact that most examples in Boost documentation do not indicate the namespace and/or header file to use for all those classes and types. This makes it very difficult for a beginner to get started in general. Any comments on this? -- Wu Yinghui, Freddie Research & Development Software Engineer Volume Interactions Pte Ltd 1 Kim Seng Promenade, #12-01 Great World City East Tower Singapore 237994 Tel: +65 62226962 (Ext 216) Fax: +65 62226215 Email: yhwu(a)volumeinteractions.com URL: http://www.volumeinteractions.com Important: This message is intended for the recipient(s) addressed above. It contains privileged and confidential information. If you are not the intended recipient, please notify the sender immediately by replying to this message and then delete it from your system. You must not read, copy, use, or disseminate this communication in any form. Thank you.

2 1

1.34.0 release schedule
by TOL Tsagarakis Manos 25 Jul '06

25 Jul '06

Hello every one, I just want to ask if there is any schedule for the final release 1.34.0 I'm particularly interesting in Robert Ramey's serialization library... Is it safe to use the RC? How mush different will the final release be? Thank you in advanced Emmanuil Tsagarakis

1 0

Re: [Boost-users] match multiline regular expression
by Ovanes Markarian 25 Jul '06

25 Jul '06

Winson, Please take a look at the regex character class names at: http://www.boost.org/libs/regex/doc/syntax_perl.html And especially at: http://www.boost.org/libs/regex/doc/character_class_names.html At the second location is written that [[:space:]] char class name is: "Any whitespace character." For [[:blank:]] is written: "Any whitespace character that is not a line separator." So space includes line separators At the first location URL is stated: "Escape sequence Equivalent to \s [[:space:]]" So using \s or [[:space:]] will consider line breaks. Now to the partial expression: Net income per common share:? This will not work as desired since '?' states only for the colon zero or more times to be matched, all other words must be there once. Please read from the first location URL about Perl Extended Patterns, especially: "Non-marking grouping (?:pattern) lexically groups pattern, without generating an additional sub-expression." So in your case you need to write: (?:Net income per common share:)? Non-marking grouping should be used, because you are not interested in remembering this pattern, but would like to ensure, that this pattern is there 0 or more times. With Kind Regards, Ovanes Markarian >I am trying to match (case insenstive) the following two lines with a >single regular expression, but somehow it doesn't work using boot >regex: > >NET INCOME PER COMMON SHARE: > Basic .................................................. $ >4.38 $ 3.90 $ 3.37 > >where: >1) there might be spaces before "NET INCOME PER COMMON SHARE" >2) there might be spaces after "NET INCOME PER COMMON SHARE" >3) the semicolon might be optional > >^(\\s*)?Net income per common share:?(\\s*)?\\r\\n( *)?basic > >Any one has suggestions? > >/Winson

1 0

[mpl] Placeholders substitution and template partial specialization
by Andriy Tylychko (mail.ru) 25 Jul '06

25 Jul '06

Hi All Consider following example: BOOST_MPL_ASSERT((boost::is_same< mpl::apply<mpl::apply<_1, _2>::type, boost::add_pointer<_1>, int>::type , int*>)); It should apply "add_pointer" to "int" and receive "int*", but it doesn't work. It returns just "int". Consider another example: template <class F, class X> struct apply1: mpl::lambda<F>::type::template apply<X> {}; BOOST_MPL_ASSERT((boost::is_same< mpl::apply<apply1<mpl::_1, mpl::_2>/*nothing here*/, boost::add_pointer<mpl::_1>, int>::type , int*>)); Handmade apply1 is used instead of mpl::apply. And this example works. What difference? Usage of nested "::type" of apply metafunction. As result: BOOST_MPL_ASSERT((boost::is_same< mpl::apply<apply1<mpl::_1, mpl::_2>::type, boost::add_pointer<mpl::_1>, int>::type , int*>)); doesn't work. Seems like this change affects time of placeholders substitution. Can anybody explain this in detail? So, since apply1 is just simplified version of mpl::apply, why we cannot use mpl::apply w/o "::type"? Because it cannot be compiled, at least using VC8. And seems like the main difference is that apply1 is primary template but mpl::apply is partial template specialization. Is such behavior standard? Can anybody explain the logic? Best regards, Andriy Tylychko, telya(a)mail.ru

2 1

[mpl] pop_back<range_c> is forbidden?
by Andriy Tylychko (mail.ru) 25 Jul '06

25 Jul '06

Hi. Reading "C++ Template Metaprogramming" book: "Though not extensible, range_c supports pop_front and pop_back, because contracting a range is easy" But following code doesn't work (at least using MSVC 8.0): #include <boost/mpl/range_c.hpp> #include <boost/mpl/pop_back.hpp> using namespace boost::mpl; typedef range_c<int, 0, 1> r; typedef pop_back<r>::type p; Can anybody explain? Thank you in advance, Andriy Tylychko, telya(a)mail.ru

2 1

bool_testable / safe bool idiom
by Gottlob Frege 25 Jul '06

25 Jul '06

What ever happened to bool_testable or some other answer to the safe bool idiom? I followed archived emails for a while, but thought it best to just bring up anew. Is a general solution not possible? How about a couple of solutions, where you pick the right one for your case? Or a solution with variations that you pick (policy based)? Anything? Thanks, Tony

1 0

match multiline regular expression
by Winson Yung 25 Jul '06

25 Jul '06

I am trying to match (case insenstive) the following two lines with a single regular expression, but somehow it doesn't work using boot regex: NET INCOME PER COMMON SHARE: Basic .................................................. $ 4.38 $ 3.90 $ 3.37 where: 1) there might be spaces before "NET INCOME PER COMMON SHARE" 2) there might be spaces after "NET INCOME PER COMMON SHARE" 3) the semicolon might be optional ^(\\s*)?Net income per common share:?(\\s*)?\\r\\n( *)?basic Any one has suggestions? /Winson

1 0

version specific "boost-<version>" source header subdirectory
by Noel Yap 25 Jul '06

25 Jul '06

Is there any way _not_ to get the version specific subdirectory? I prefer embedding that information within the --prefix argument. Thanks, Noel

2 1

iterate over key_type of map
by gast128 24 Jul '06

24 Jul '06

Dear all, in our company we use the STL map frequently. However one often wants to iterate over the key_type only (or mapped type, or make desicions for the key type, and take action on its corresponded map type). With the transform_iterator this is possible, but the resulting code is not an improvement over writing the loop explicitly. For example I want to search for the maximum string length: typedef std::map<std::string, double> StringDoubleMap; typedef boost::function<StringDoubleMap::key_type (const StringDoubleMap::value_type&)> Function; typedef boost::transform_iterator<Function, StringDoubleMap::const_iterator> TransformIterator; StringDoubleMap mp = boost::assign::map_list_of("George", 0.0) ("Bill", 0.0) ("Ronald", 0.0) ("Jimmy", 0.0); Function fc = boost::bind(&StringDoubleMap::value_type::first, _1); TransformIterator itBegin(mp.begin(), fc); TransformIterator itEnd(mp.end(), fc); TransformIterator it = std::max_element(itBegin, itEnd, boost::bind (&std::string::length, _1) < boost::bind(&std::string::length, _2)); if (it != itEnd) { std::cout << it->c_str() << ' ' << it->length() << std::endl; } A select1st or select2nd would already a great help. Wkr, me

2 1

Re: [Boost-users] shared_ptr compile error ms vc++ 8
by Andrew McDonald 24 Jul '06

24 Jul '06

you misunderstand....I was answering a prior question posted by bringiton asking how to diagnose the specific source code location of such errors when compiled using vc++ 8... not a question regarding whether or not such code is in error... My posting was an example confirming for bringiton that the error output produced by vc++ 8 specifically also referenced the module/line number that attempted to instantiate the shared_ptr template, rather than just the error location inside the shared_ptr header. Although I am now regretting posting.... ;) regards, Andrew > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org]On Behalf Of > Bronek Kozicki > Sent: Monday, 24 July 2006 6:37 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] shared_ptr compile error ms vc++ 8 > > > Andrew McDonald wrote: > > Was an answer to a previous question regarding locating the > source of the error using vc++ 8 > > >>> When compiling the following line in a file example.cpp; > >>> > >>> boost::shared_ptr<int> p(new std::string) > > you would have error from any compiler, because this code is > illformed. There is > no conversion from std::string* to int* . > > > B. > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

3 2

How to detect overflow when use lexical_cast??
by 袁晓辉 24 Jul '06

24 Jul '06

Hi,all I want to cast string to long long type and handle overflow. I tested as follow. long long somevar = lexical_cast<long long>("123456789789789798879977978789787987879879787977897897897899879978798798798");//!!!!!!!!!!!!!! But it does not throw an exception!! It seem that casting to int does not have this kind of problem. int somevar2 = lexical_cast<int>("123456789789789798879977978789787987879");//will throw an exception

1 0

Re: [Boost-users] shared_ptr compile error ms vc++ 8
by Andrew McDonald 24 Jul '06

24 Jul '06

Was an answer to a previous question regarding locating the source of the error using vc++ 8 regards, Andrew > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org]On Behalf Of > Mateusz Loskot > Sent: Monday, 24 July 2006 5:02 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] shared_ptr compile error ms vc++ 8 > > > Andrew McDonald wrote: > > I am using VC++ 2005 Express Edition v 8.0.050727.42. > > > > When compiling the following line in a file example.cpp; > > > > boost::shared_ptr<int> p(new std::string) > --------------------^^^-------------^^^^^^ > > int type is not a string type, and the other way. > > Best regards > -- > Mateusz Loskot > http://mateusz.loskot.net > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

2 1

Re: [Boost-users] shared_ptr compile error ms vc++ 8
by Andrew McDonald 24 Jul '06

24 Jul '06

I am using VC++ 2005 Express Edition v 8.0.050727.42. When compiling the following line in a file example.cpp; boost::shared_ptr<int> p(new std::string) the following error is produced (note the explicit mention of example.cpp(10) ): c:\Projects\boost\shared_ptr.hpp(125) : error C2440: 'initializing' : cannot convert from 'std::string *' to 'int *' Types pointed to are unrelated; conversion requires reinterpret_cast, C-style cast or function-style cast .\example.cpp(10) : see reference to function template instantiation 'boost::shared_ptr<T>::shared_ptr<std::string>(Y *)' being compiled with [ T=int, Y=std::string ] regards, Andrew McDonald System Architect Norwood Systems Australia Pty Ltd Level 1, 71 Troy Terrace PO Box 1281 Subiaco, WA 6904 Tel +61 8 9380 7766 Fax +61 8 9380 7733 The information in this email, and any attachments, may contain confidential information and is intended solely for the attention and use of the named addressee (s). It must not be disclosed to any person(s) without authorization. If you are not the intended recipient, or a person responsible for delivering it to the intended recipient, you are not authorized to, and must not, disclose, copy, distribute, or retain this message or any part of it. If you have received this communication in error, please notify the sender immediately.

2 1

manually calling constructor?
by bringiton bringiton 24 Jul '06

24 Jul '06

Is it possible to manually call the constructor of an object. It is possible to call the destructor (a trick i found from std::vector<T>::pop_back()) I stepped through the std::vector<T>::push_back() to find how they call the constructor for memory that has already been allocated, but I could not follow the code. Test3 t; t.~Test3(); // OK t.Test3(); // compile error

2 1

shared_ptr compile error ms vc++ 8
by bringiton bringiton 24 Jul '06

24 Jul '06

boost::shared_ptr<int> p(new std::string); In MS VC++ 6, the above will throw the following compile error: >>error C2440: 'initializing' : cannot convert from 'class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > *' to 'int *' The above is not very useful because it catches the error in the shared_ptr.hpp file. However, it is OK because because the compiler also has a reference to my line of code above: >>see reference to function template instantiation '__thiscall boost::shared_ptr<int>::boost::shared_ptr<int>(class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > *)' being compiled The above is all good. I however do not get the luxury of the additional reference in MS VC++ 8. Instead I just get the initial reference to shared_ptr.hpp. This makes it extremely difficult to track where the error because I have many pages that use the shared_ptr. - Can anyone suggest how I can get the 2nd reference to my own code in MS VC++ 8. - Am I missing something obvious? - BTW, in vc++ 8 i'm viewing the errors in a list (instead of the text dump). - I may need to look at the text dump to get the 2nd reference but was wondering if there was an easier solution - Sorry, I dont have vc++ 8 in front of me to give you the error

2 2

Re: [Boost-users] serialization on const member and map<const CLASS*, CLASS>
by Cheok Yan Cheng 24 Jul '06

24 Jul '06

Please take note that even the following simplest form won't work. Here is the full source code. Any suggestion? Thank you very much! #include <iostream> #include <sstream> #include <fstream> using namespace std; #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> class dd { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & i; } int i; }; class dummy { public: dummy() : d(0){} ~dummy(){} private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & const_cast<dd *>(d); } const dd *d; }; int main() { const dummy w; dummy r; // make an archive std::ofstream ofs("dummy"); boost::archive::text_oarchive oa(ofs); oa << w; std::ifstream ifs("dummy"); boost::archive::text_iarchive ia(ifs); ia >> r; } c:\Documents and Settings\yccheok\Desktop\xxx\main.cpp(34): error C2679: binary '&' : no operator found which takes a right-hand operand of type 'dd *' (or there is no acceptable conversion) __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

just starting with boost
by Fred J. 24 Jul '06

24 Jul '06

Hi I installed boost on my debian testing and read some examples and docs., however I failed to find some example on how one can read a data file in a matrix in-order to do some coloum arithmatics. any pointers will be appriciated. thanks --------------------------------- See the all-new, redesigned Yahoo.com. Check it out.

1 0

Re: [Boost-users] [multi_index] - duplicates_iterator.hpp issue?
by JOAQUIN LOPEZ MU?Z 23 Jul '06

23 Jul '06

Bogdan M. ha escrito: > > Hi, > > I am trying to serialize a multi-indexed container defined as > below ( I am using boost 1.33.1 ): [...] > > While serializing this container containing ===> several nodes > with the same key <===, I get an access violation exception > somewhere deep in the multi_index library. > Tracing a little bit back the stack I noticed something unusual in > boost_1_33_1\install\include\boost\multi_index\detail\ > duplicates_iterator.hpp > in the duplicates_iterator::sync() member function (around line 80): > > void sync() > { > if(pred(begin_chunk->value,node->value))advance(); > } > > This function seems to advance the iterator within a chunk of equal > keys. However, the if clause does not consider the case where > node == end. These are exactly the circumstances under which my > program crashes in 'pred(begin_chunk...)'. > Changing the if condition into > > void sync() > { > if( (node != end) && pred(begin_chunk->value,node->value)) > advance(); > } > > seems to fix the problem. However, I am not familiar with the > overall implementation and therefore I cannot tell whether this > is indeed the cause or whether there are side-effects > to my patch. > Has anyone else experienced a situation similar to this one? Hello Bogdan, You have certainly spotted a bug in duplicates_iterator.hpp, and the fix you propose is correct. As it happens, this was first reported some months ago: http://lists.boost.org/boost-users/2006/01/16710.php and the bug was fixed since then in the CVS, in what will become Boost 1.34. Until that release comes out, your local fix is perfect. Anyway, in case you can afford it, I recommend you switch now to the CVS version, as it contains a few other bugfixes. > Is there something wrong with my container definition, to > begin with? I don't see anything wrong with your container definition. > I really appreciate any feedback. > Thanks, > Bogdan Thank you for using Boost.MultiIndex, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

serialization on const member and map<const CLASS*, CLASS>
by Cheok Yan Cheng 23 Jul '06

23 Jul '06

Hi, I am trying to perform serialization on a const member const ImageRegion* imageRegion; By refering to http://www.boost.org/libs/serialization/doc/serialization.html#const, I thought the following code would work. friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & const_cast<ImageRegion *>(imageRegion); } However, I still get the following error is VC++ 2003 c:\yccheok\pcbvisionlib\FiducialPair.h(42): error C2679: binary '&' : no operator found which takes a right-hand operand of type 'ImageRegion *' (or there is no acceptable conversion) I had fully tested the ImageRegion class. Before this const member variable, it can be fully serialized with no problem. Any suggestion? Thank you! p/s By refering to the mailing list "(de)serializing vector<const A*>" http://groups.google.com/group/boost-list/browse_frm/thread/79dba906901d039…, does it mean that boost is also not allow to (de)serialize map<const CLASS*, CLASS> directly? Must I iterate through the map elements one by one to serialize them manually? __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

[multi_index] - duplicates_iterator.hpp issue?
by Bogdan M. 23 Jul '06

23 Jul '06

Hi, I am trying to serialize a multi-indexed container defined as below ( I am using boost 1.33.1 ): ____________________________________________________________________________ ___ /** Shorter id of namespaces. */ namespace bmi = boost::multi_index; /** Tags for accessing several indices defined below */ struct name_tag {}; class string_node { public: std::string m_name; friend class boost::serialization::access; void serialize ( boost::archive::polymorphic_iarchive & ar, const unsigned int file_version); void serialize ( boost::archive::polymorphic_oarchive & ar, const unsigned int file_version); }; /** Container of children of a node in the string tree */ typedef boost::multi_index_container< string_node*, bmi::indexed_by< bmi::sequenced<>, // sequenced type bmi::ordered_non_unique< bmi::tag<name_tag>, BOOST_MULTI_INDEX_MEMBER( string_node, const std::string, m_name)> > > node_set; ____________________________________________________________________________ ___ While serializing this container containing ===> several nodes with the same key <===, I get an access violation exception somewhere deep in the multi_index library. Tracing a little bit back the stack I noticed something unusual in boost_1_33_1\install\include\boost\multi_index\detail\duplicates_iterator.hp p in the duplicates_iterator::sync() member function (around line 80): ____________________________________________________________________________ ___ void sync() { if(pred(begin_chunk->value,node->value))advance(); } ____________________________________________________________________________ ___ This function seems to advance the iterator within a chunk of equal keys. However, the if clause does not consider the case where node == end. These are exactly the circumstances under which my program crashes in 'pred(begin_chunk...)'. Changing the if condition into ____________________________________________________________________________ ___ void sync() { if( (node != end) && pred(begin_chunk->value,node->value)) advance(); } ____________________________________________________________________________ ___ seems to fix the problem. However, I am not familiar with the overall implementation and therefore I cannot tell whether this is indeed the cause or whether there are side-effects to my patch. Has anyone else experienced a situation similar to this one? Is there something wrong with my container definition, to begin with? I really appreciate any feedback. Thanks, Bogdan

1 0

Re: [Boost-users] [Serialization] Problem serializing via baseclassptr
by Guy Létourneau 22 Jul '06

22 Jul '06

Robert, I've created a simple test as you suggested. The problem is that the test does not even build (in oserializer.hpp, there are 2 conditions for this to happen but none seems to match my test..). Here's what the compiler gives me: C:/Boost/include/boost-1_33_1/boost/archive/detail/oserializer.hpp: In function `void boost::archive::save(Archive&, T&) [with Archive = boost::archive::text_oarchive, T = A]': C:/Boost/include/boost-1_33_1/boost/archive/basic_text_oarchive.hpp:78: instantiated from `void boost::archive::basic_text_oarchive<Archive>::save_override(T&, int) [with T = A, Archive = boost::archive::text_oarchive]' C:/Boost/include/boost-1_33_1/boost/archive/detail/interface_oarchive.hpp:78: instantiated from `Archive& boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T = A, Archive = boost::archive::text_oarchive]' ../main.cpp:90: instantiated from here C:/Boost/include/boost-1_33_1/boost/archive/detail/oserializer.hpp:567: error: incomplete type `boost::STATIC_ASSERTION_FAILURE<false>' does not have member `value' #include <iostream> #include <fstream> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/export.hpp> class A { public: A() { i = 1; }; virtual ~A() { }; virtual void Dummy() = 0; private: int i; }; BOOST_IS_ABSTRACT(A) class B : public A { public: B() { }; virtual ~B() { }; void Dummy() { }; void SetValue( std::string& value ) { Data = value; } private: friend class boost::serialization::access; template <class Archive> void serialize( Archive& ar, const unsigned int version ) { ar & boost::serialization::base_object<A>( *this ); ar& Data; std::cout << "Serialization of B" << std::endl; std::cout.flush(); } std::string Data; }; BOOST_CLASS_EXPORT(B); int main() { // Create a B object B* Child = new B; // Set some data std::string Data = "test"; Child->SetValue( Data ); // Assign it to a A ptr A* Parent = Child; // create and open a character archive for output std::ofstream ofs( "filename" ); // save data to archive { try { boost::archive::text_oarchive oa( ofs ); // write class instance to archive oa << *Parent; } catch( boost::archive::archive_exception& e ) { std::cout << "Save failed! : " << e.what(); std::cout.flush(); return false; } catch( ... ) { std::cerr << "Unknown Exception " << std::endl; return false; } // archive and stream closed when destructors are called } delete Child; } The example is very simple. Again, I have problems only when serializing via a base class ptr (serializing object "directly" works fine). Thanks again for your help, Guy >Hmm - looks like it should work to me. > >I would try the following: > >a) make a tiny test - a main which which does nothing but tests the >serialization. >This you can ship to us in necessary. >b) For now - remove all the BOOST_CLASS_TRACKING macros. >It shouldn't make a difference but let's start simple. >c) You'll have to add BOOST_CLASS_EXPORT for SomeData >d) double check that everything is in the same namespace. >e) try removing the friend class boost::serialization::access; from >the base class. NonVolatileData::serialize(..) should never be called >by the serialization library in this case - so if this traps during >compile, >it will show a chain of "compile time calls". By looking at this chain >one can see where things went wrong. Unfortunately this requires >looking at the header source code - oh well. >f) double check that the test corresponding to your example builds >and runs in your environment. If that passes, but yours does not, try >modifying the test bit by bit by commenting out the code that is there >and replacing it with your own code. If you finish this and the test >still works - then just remove all the commented code and you'll be >done. > >Robert Ramey Guy Létourneau wrote: > Robert, > I've tried to include your changes but it doesn't solve the problem. > I had to add the following line: BOOST_IS_ABSTRACT(NonVolatileData) > for the program to compile. I agree with you, to have an abstract > class is what is needed in that case as the NonVolatileData class is > not intended to do something useful except for allowing my data > storage layer to be generic. However, abstract or not, I still have > the same problem: when serializing my SomeData object through a > pointer to the NonVolatileData, only the data of the parent class > gets serialized. Anything else you want me to try? > > Thanks, > Guy > >> Try making the base class polymorphic - that it define at least >> one abstract function. See my changes below. This will have >> the beneficial effect of inhibiting anyone from creating an instance >> of your base class directly. >> Robert Ramey > >> Guy Létourneau wrote: >>> Hello, >>> >>> I need to develop a generic data storage layer. Its job is to handle >>> the serialization of all objects that need to be persistent in my >>> system and handle management of archives, backups and restores and >>> so forth. The most important point is that it must stay generic, >>> i.e. have no knowledge of the type of objects being passed by other >>> modules in the system. Because of this, I define a base class >>> NonVolatileData from which all data classes in the system will >>> derive: >>> >>> /////////////////////////////////////////////////////////////////////// >>> // Base class >>> class NonVolatileData >>> { >>> friend >>> class boost::serialization::access; >>> >>> public: >>> >>> NonVolatileData(){ i = 1; }; >>> virtual ~NonVolatileData() = 0; // Note - pure virtual function >>> make class abstract- >>> >>> >>> protected: >>> >>> virtual void Dummy() =0; // Note - pure virtual function make >>> class abstract- >> ; >>> >>> int i; >>> template <class Archive> >>> void serialize( Archive& ar, const unsigned int version ) >>> { >>> ar & i; >>> } >>> }; >>> BOOST_CLASS_TRACKING(NonVolatileData, >>> boost::serialization::track_never) >>> >>> >>> class SomeData: public NonVolatileData >>> { >>> friend >>> class boost::serialization::access; >>> >>> public: >>> >>> SomeData () >>> { >>> }; >>> >>> ~SomeData () >>> { >>> }; >>> >>> void SetValue( std::string& Address ) >>> { >>> this->Address = Address; >>> } >>> >>> void Dummy() >>> { >>> } >>> >>> private: >>> >>> template <class Archive> >>> void serialize( Archive& ar, const unsigned int version ) >>> { >>> ar & >>> >>> boost::serialization::base_object<NonVolatileData>(*this); >>> ar& Address; } >>> >>> std::string Address; >>> }; >>> BOOST_CLASS_TRACKING(SomeData, boost::serialization::track_never) >>> ///////////////////////////////////////////////////////////////// >>> >>> My data storage interface will take a ptr to the base class i.e. >>> Save(NonVolatileData* data) so the serialization will be performed >>> through a ptr to the base class. I've read the documentation >>> multiple times and I'm still unable to make that work correctly. >>> When a do a save, only the base class is serialized even though the >>> base class is polymorphic. I've tried using the >>> BOOST_CLASS_EXPORT_GUID macro the force a registration of my derived >>> class without success. I've also checked the example from demo.cpp. >>> It uses the direct call to register_type() but in my case, I don't >>> want to change the code everytime a new class is defined in the >>> system so I went with option 2 (the macro). There's probably a >>> subtle detail I do not do correctly (polite way of saying I'm >>> missing something :-)). >>> >>> Thanks for your help, >>> >>> Guy Letourneau =

2 1

[serialization] Skipping unexpected elements in XML archive
by Todd Greer 22 Jul '06

22 Jul '06

Hi, I'm using the Serialization library, but need to skip unrecognized data when reading in an archive. This is for forward compatability purposes; I need for older versions of my software to consume files produced by newer ones, which may have added elements. As this functionality is not currently in the library, I have created a new archive type (as I think Robert Ramey suggested at some point). It inherits from xml_iarchive_impl and overrides load_override to identify when it has just read an opening tag with an unexpected name. It then skips whatever XML it finds within the unexpected element, reads the closing tag, and returns to normal processing. I use it with the unaltered xml_oarchive, and the pair satisfy my requirements. I'm including it below in the hopes that someone will find it useful. I've tested it on MSVC 7.1 (Visual Studio .NET 2003) with a reasonably complex XML file with both nested and non-nested unexpected elements. If you'd like, I can post some tests as well (I just need to strip out some project-specific details). Please let me know if you see any places where it could be improved, or where I've completely missed something; this is my first use of the serialization library, and my understanding is far from comprehensive. Many thanks to all who've contributed to the Serialization library, Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC #include <boost/archive/xml_iarchive.hpp> #include <boost/range/end.hpp> #include <algorithm> const char whitespace[] = " \t\n\r"; //Skip whitespace, then return true if we're looking at '</'. //Leave the stream right before the '<'. template<class IStream> bool at_close_tag(IStream& is) { char ch; using boost::end; do { ch = is.get(); } while(std::find(whitespace, end(whitespace), ch) != end(whitespace)); assert(ch == '<'); ch = is.get(); bool const end_tag = ch == '/'; is.putback(ch); is.putback('<'); return end_tag; } template<class Archive> class skip_xml_iarchive_impl: public boost::archive::xml_iarchive_impl<Archive> { #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) //see xml_iarchive_impl public: #elif defined(BOOST_MSVC) friend boost::archive::detail::interface_iarchive<Archive>; protected: #else friend class boost::archive::detail::interface_iarchive<Archive>; protected: #endif skip_xml_iarchive_impl(std::istream & is, unsigned int flags = 0): xml_iarchive_impl<Archive>(is, flags) {} void skip_all_elements() { std::string ignore; if(this->This()->gimpl->parse_string(this->This()->get_is(), ignore) && ignore.npos != ignore.find_first_not_of(whitespace)) return; //We're either looking at a start tag or an end tag. while(!at_close_tag(this->This()->get_is())) {//It's a start tag. if(!this->This()->gimpl->parse_start_tag(this->This()->get_is())) boost::throw_exception(archive_exception(archive_exception::stream_error )); ++depth; std::string const name = this->This()->gimpl->rv.object_name; skip_all_elements(); load_end(name.c_str()); } } template<class T> void load_override( #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING const #endif boost::serialization::nvp<T> & t, int ){ if(!t.name()) return xml_iarchive_impl<Archive>::load_override(t, 0); load_start(t.name()); // don't check start tag at highest level const std::string name_found = this->This()->gimpl->rv.object_name; bool const skip = depth > 1 && 0 != (this->get_flags() & no_xml_tag_checking) && name_found != t.name(); if(skip) skip_all_elements(); else boost::archive::load(* this->This(), t.value()); load_end(skip ? name_found.c_str() : t.name()); if(skip) //We still haven't loaded t... load_override(t, 0); //...so load t. } template<class T> void load_override(T & t, BOOST_PFTO int i) { xml_iarchive_impl<Archive>::load_override(t, i); } }; class skip_xml_iarchive: public skip_xml_iarchive_impl<skip_xml_iarchive> { public: skip_xml_iarchive(std::istream & is, unsigned int flags = 0) : skip_xml_iarchive_impl<skip_xml_iarchive>(is, flags) {} }; -- Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC

3 2

bjam crashes when building Boost on Windows
by Adam Wright 22 Jul '06

22 Jul '06

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi all, When trying to build boost 1.33.1 this afternoon, I encountered a problem with bjam just crashing every time I invoked it when targeting Windows. I've debugged the problem as being files with dates < 1900 in directories being searched by the glob expansions (I had a rogue file from 1757 in C:\Windows\). file_dirscan in filent.c invokes the MSCRT function _tfindnext64i32, which will eventually assert if the date is too far back in time. It's a documented limitation of the function, so my suggestion would be to FAQ this "bug" for the (very few) people it's likely to bite. Thanks, adamw -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.3 (MingW32) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFEwlW/9mihfAI44D0RAtyDAJ46wfH9UBhsz58nNTtKTyftI0l1igCghVD1 s18ec8+vbIevjIskC40W9Rc= =i7Ap -----END PGP SIGNATURE-----

1 0

[mpl] Combining Type Sequences
by Eric Lemings 22 Jul '06

22 Jul '06

Giving the following code: #include <boost/mpl/integral_c.hpp> namespace mpl = boost::mpl; template < unsigned U, int I = 1 > struct T : mpl::integral_c< unsigned, U > { BOOST_STATIC_CONST(int, N = I); }; and two vectors of type T of varying lengths: typedef mpl::vector < T<0>, T<1>, T<2> > t1; typedef mpl::vector < T<2, 2>, T<0, 0> > t2; How would you create a joint view of t1 and t2, sorted by increasing U values, where all elements of t1 and t2 that have the same U value have their N constants added together. In the example above, the resulting type t0 would be equivalent to: typedef mpl::vector < T<0, 1>, T<1, 1>, T<2, 3> > t0; Thanks, Eric.

2 1

[iterator]counting_iterator question
by Sean Huang 22 Jul '06

22 Jul '06

I encountered some problems while using counting_iterator. Suppose we have a range called RangeType, and we define: typedef boost::counting_iterator< boost::range_value< RangeType >::type > MyCountingIterator; if I do: std::vector< int > vec( 100 ); std::vector< int >:: iterator iter = vec.begin() + ( countingIter2 - counitingIter1 ); VC8 would then complain about a conversion from __int64 to int because the difference type of MyCountingIterator (using default) is __int64. Since we treat warnings as errors. I then changed MyCountingIterator to typedef boost::counting_iterator< boost::range_value< RangeType >::type, boost::use_default, boost::range_difference< RangeType >::type > MyCountingIterator; This time I got a different error: iterator_facade.hpp(554) : error C2784: '__w64 int boost::counting_iterator<Incrementable,CategoryOrTraversal,Difference>::distance_to(const boost::counting_iterator<OtherIncrementable> &) const' : could not deduce template argument for 'const boost::counting_iterator<OtherIncrementable> &' from 'const boost::counting_iterator<Incrementable,CategoryOrTraversal,Difference>' My question is why limiting the last three template parameters to default in counting_iterator::distance_to. Thanks, Sean

2 3

cast shared_array<T> to shared_array<const T>
by Jarda Grešula 21 Jul '06

21 Jul '06

Hello, is there any reason, why the conversion below is not supported, whereas the same conversion works for shared_ptr? shared_array<int> i; shared_array<const int> ci(i); // not possible Thanks, Jarda.

1 0

newbie:BoostGraphLibrary - brandes_betweenness -> closenness
by Ioannis Filippis 21 Jul '06

21 Jul '06

Hi all, I wonder whether it is possible to calculate the closenness centrality using the brandes_betweenness_centrality. The closeness centrality of a vertex is defined by the inverse of the average length of the shortest paths to/from all the other vertices in the graph. I know that in theory this is possible and it would actually save a lot of time if someone wants to calculate both properties. Currently I am running brandes_betweenness like this brandes_betweenness_centrality(g, get(&VertexInfo::betweenness, g), get(&EdgeInfo::betweenness, g)); I prefer bundled properties as for me are more clear in concept. I wonder whether: a.I could use Util parameters like DistanceMap to calculate closenness. However, I can not really understand how I can create an iterator_property_map using bundled properties. OR b.I have to modify the brandes_betweenness_centrality to calculate also closenness. I apologise in case the answer to my problem is trivial but I am just newbie in the Boost Graph Library. Thanks for your help. Ioannis

1 0

BGL serialization
by Camilo Melani 21 Jul '06

21 Jul '06

Hello, I'd like to save and restore a adjacency_list graph in a XML file, Does anyone has some example code or can help me? I can serialize std::map and others classes, but when I try to serialize the graph I get compiler errors. Thank for the help!! Camilo Some part of the code: #include <boost/config.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/adj_list_serialize.hpp> #include <boost/dynamic_bitset.hpp> #include <boost/archive/xml_iarchive.hpp> #include <boost/serialization/map.hpp> typedef adjacency_list< vecS, vecS, bidirectionalS, no_property, no_property > Graph; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & BOOST_SERIALIZATION_NVP(graph); } Error!!! C:\Boost\include\boost-1_35\boost/archive/basic_xml_oarchive.hpp(86) : error C2664: 'boost::mpl::assertion_failed' : cannot convert parameter 1 from 'boost::mpl::failed ************boost::serialization::is_wrapper<T>::* ***********' to 'boost::mpl::assert<false>::type' with [ T=boost::no_property ] No constructor could take the source type, or constructor overload resolution was ambiguous __________________________________________________ Preguntá. Respondé. Descubrí. Todo lo que querías saber, y lo que ni imaginabas, está en Yahoo! Respuestas (Beta). ¡Probalo ya! http://www.yahoo.com.ar/respuestas

1 0

Re: [Boost-users] [Serialization] Problem serializing via baseclassptr
by Guy Létourneau 21 Jul '06

21 Jul '06

Any updates on my problem Robert? Thanks, Guy > >Robert, > >I've created a simple test as you suggested. The problem is that the test >does not even build (in oserializer.hpp, there are 2 conditions for this to >happen but none seems to match my test..). Here's what the compiler gives >me: > >C:/Boost/include/boost-1_33_1/boost/archive/detail/oserializer.hpp: In >function `void boost::archive::save(Archive&, T&) [with Archive = >boost::archive::text_oarchive, T = A]': >C:/Boost/include/boost-1_33_1/boost/archive/basic_text_oarchive.hpp:78: >instantiated from `void >boost::archive::basic_text_oarchive<Archive>::save_override(T&, int) [with >T = A, Archive = boost::archive::text_oarchive]' >1_33_1/boost/archive/detail/interface_oarchive.hpp:78: instantiated from >`Archive& >boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T >= A, Archive = boost::archive::text_oarchive]' >../main.cpp:90: instantiated from here >C:/Boost/include/boost-1_33_1/boost/archive/detail/oserializer.hpp:567: >error: incomplete type `boost::STATIC_ASSERTION_FAILURE<false>' does not >have member `value' >#include <iostream> >#include <fstream> >#include <boost/archive/text_oarchive.hpp> >#include <boost/archive/text_iarchive.hpp> >#include <boost/serialization/export.hpp> > >class A >{ > public: > > A() > { > i = 1; > }; > > virtual ~A() > { > }; > > virtual void Dummy() = 0; > > private: > > int i; >}; >BOOST_IS_ABSTRACT(A) > >class B : public A >{ > public: > > B() > { > }; > > virtual ~B() > { > }; > > void Dummy() > { > }; > > void SetValue( std::string& value ) > { > Data = value; > } > > private: > > friend > class boost::serialization::access; > > template <class Archive> > void serialize( Archive& ar, const unsigned int version ) > { > ar & boost::serialization::base_object<A>( *this ); > ar& Data; > std::cout << "Serialization of B" << std::endl; > std::cout.flush(); > } > > std::string Data; >}; >BOOST_CLASS_EXPORT(B); >int main() >{ > // Create a B object > B* Child = new B; > > // Set some data > std::string Data = "test"; > Child->SetValue( Data ); > > // Assign it to a A ptr > A* Parent = Child; > > // create and open a character archive for output > std::ofstream ofs( "filename" ); > > // save data to archive > { > try > { > boost::archive::text_oarchive oa( ofs ); > // write class instance to archive > oa << *Parent; > } > catch( boost::archive::archive_exception& e ) > { > std::cout << "Save failed! : " << e.what(); > std::cout.flush(); > > return false; > } > catch( ... ) > { > std::cerr << "Unknown Exception " << std::endl; > > return false; > } > > // archive and stream closed when destructors are called > } > > delete Child; >} > >The example is very simple. Again, I have problems only when serializing >via a base class ptr (serializing object "directly" works fine). > >Thanks again for your help, > >Guy >Hmm - looks like it should work to me. > >I would try the following: > >a) make a tiny test - a main which which does nothing but tests the >serialization. >This you can ship to us in necessary. >b) For now - remove all the BOOST_CLASS_TRACKING macros. >It shouldn't make a difference but let's start simple. >c) You'll have to add BOOST_CLASS_EXPORT for SomeData >d) double check that everything is in the same namespace. >e) try removing the friend class boost::serialization::access; from >the base class. NonVolatileData::serialize(..) should never be called >by the serialization library in this case - so if this traps during >compile, >it will show a chain of "compile time calls". By looking at this chain >one can see where things went wrong. Unfortunately this requires >looking at the header source code - oh well. >f) double check that the test corresponding to your example builds >and runs in your environment. If that passes, but yours does not, try >modifying the test bit by bit by commenting out the code that is there >and replacing it with your own code. If you finish this and the test >still works - then just remove all the commented code and you'll be >done. > >Robert Ramey Guy Létourneau wrote: > Robert, > I've tried to include your changes but it doesn't solve the problem. > I had to add the following line: BOOST_IS_ABSTRACT(NonVolatileData) > for the program to compile. I agree with you, to have an abstract > class is what is needed in that case as the NonVolatileData class is > not intended to do something useful except for allowing my data > storage layer to be generic. However, abstract or not, I still have > the same problem: when serializing my SomeData object through a > pointer to the NonVolatileData, only the data of the parent class > gets serialized. Anything else you want me to try? > > Thanks, > Guy > >> Try making the base class polymorphic - that it define at least >> one abstract function. See my changes below. This will have >> the beneficial effect of inhibiting anyone from creating an instance >> of your base class directly. >> Robert Ramey > >> Guy Létourneau wrote: >>> Hello, >>> >>> I need to develop a generic data storage layer. Its job is to handle >>> the serialization of all objects that need to be persistent in my >>> system and handle management of archives, backups and restores and >>> so forth. The most important point is that it must stay generic, >>> i.e. have no knowledge of the type of objects being passed by other >>> modules in the system. Because of this, I define a base class >>> NonVolatileData from which all data classes in the system will >>> derive: >>> >>> /////////////////////////////////////////////////////////////////////// >>> // Base class >>> class NonVolatileData >>> { >>> friend >>> class boost::serialization::access; >>> >>> public: >>> >>> NonVolatileData(){ i = 1; }; >>> virtual ~NonVolatileData() = 0; // Note - pure virtual function >>> make class abstract- >>> >>> >>> protected: >>> >>> virtual void Dummy() =0; // Note - pure virtual function make >>> class abstract- >> ; >>> >>> int i; >>> template <class Archive> >>> void serialize( Archive& ar, const unsigned int version ) >>> { >>> ar & i; >>> } >>> }; >>> BOOST_CLASS_TRACKING(NonVolatileData, >>> boost::serialization::track_never) >>> >>> >>> class SomeData: public NonVolatileData >>> { >>> friend >>> class boost::serialization::access; >>> >>> public: >>> >>> SomeData () >>> { >>> }; >>> >>> ~SomeData () >>> { >>> }; >>> >>> void SetValue( std::string& Address ) >>> { >>> this->Address = Address; >>> } >>> >>> void Dummy() >>> { >>> } >>> >>> private: >>> >>> template <class Archive> >>> void serialize( Archive& ar, const unsigned int version ) >>> { >>> ar & >>> >>> boost::serialization::base_object<NonVolatileData>(*this); >>> ar& Address; } >>> >>> std::string Address; >>> }; >>> BOOST_CLASS_TRACKING(SomeData, boost::serialization::track_never) >>> ///////////////////////////////////////////////////////////////// >>> >>> My data storage interface will take a ptr to the base class i.e. >>> Save(NonVolatileData* data) so the serialization will be performed >>> through a ptr to the base class. I've read the documentation >>> multiple times and I'm still unable to make that work correctly. >>> When a do a save, only the base class is serialized even though the >>> base class is polymorphic. I've tried using the >>> BOOST_CLASS_EXPORT_GUID macro the force a registration of my derived >>> class without success. I've also checked the example from demo.cpp. >>> It uses the direct call to register_type() but in my case, I don't >>> want to change the code everytime a new class is defined in the >>> system so I went with option 2 (the macro). There's probably a >>> subtle detail I do not do correctly (polite way of saying I'm >>> missing something :-)). >>> >>> Thanks for your help, >>> >>> Guy Letourneau =

1 0

Re: [Boost-users] [serialization] Skipping unexpected elements in XMLarchive
by Todd Greer 21 Jul '06

21 Jul '06

Peter wrote: > The additional need I'm trying to solve is that the XML elements can be > reordered, i.e. come in a different order than the serialization lib > expects them. You could store whatever XML elements you skip. Then, every time you get a request to read something, first check the stored XML. You would need to have a stack of storage locations to correspond to how deep you are in the XML hierarchy and discard the XML elements on the top of the stack when you parse an end tag. I think that would work, as long as you don't mind having to buffer some XML. Another approach would be to store pointers to the variables that are passed into the serialization library, rather than storing the XML. Then, when reading an XML open tag, look in your set of stored pointers for a match and deserialize into it. I'm not sure whether or not this could be made to work with the current Serialization library. Basically, to support reordering, you need to buffer one side or the other. Buffering the XML would probably work better with the current Serialization library, but would be less efficient. HTH, Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC

1 0

Re: [Boost-users] [python], [regex] Segmentation fault when deallocating match_results in a python extension module
by bernhard.maeder＠zkb.ch 21 Jul '06

21 Jul '06

Arrr, I've now compiled the example on different machines (Windows, MacOS) and it seems I'm only getting into troubles on my target system (Debian)... I've used ldd to get the library dependencies of my extension modules; the difference between building with gcc3.3 and gcc3.4 is with the libstdc++, which is used in version 5 and 6, respectively. But since python doesn't use this library, this should make no difference at all. Is there anything else I could possibly try? Thanks Bernhard "John Maddock" <john(a)johnmaddock.co.uk> Gesendet von: boost-users-bounces(a)lists.boost.org 19.07.2006 13:53 Bitte antworten an boost-users An: <boost-users(a)lists.boost.org> Kopie: Thema: Re: [Boost-users] [python], [regex] Segmentation fault when deallocating match_results in a python extension module bernhard.maeder(a)zkb.ch wrote: >> Hello everybody >> The program aborts when exiting test_func(), during deallocation of >> match_results. The error occurs somewhere in _M_deallocate of >> stl_vector.h. >> >> Can anybody help me with this problem? What could possibly go wrong >> here? In theory not much :-( >> One thing I noted: python is compiled using GCC3.3 on our system, >> while we are using GCC3.4, is this a problem? (But, trying the same >> on a system with GCC 4 for both, python and our app, also fails, so >> it seems like the problem is to be sought elsewhere). It does sound like the std::vector is allocating with one one allocator and deallocating with another. But I know nothing about python extension modules and what can go wrong there. John. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

File Manipulation
by Simon Reye 21 Jul '06

21 Jul '06

I've had a look through the iostream stuff but my head can't think straight this late in the week. I require two things: 1. The ability to truncate and grow a file. I see the seek/write functions which I'm guessing will take care of my growth needs but what about truncation? 2. The ability to memory map a file. I saw mapped_file which I guess is the one. Simon

3 10

Re: [Boost-users] Valid arguments for boost::math::gcd()
by james.jones＠firstinvestors.com 20 Jul '06

20 Jul '06

From: "Matthias Hofmann" <hofmann(a)anvil-soft.com> > Also, I would like to know how the greatest common divisor is defined when > one or both of the arguments are zero. In that case, boost::math::gcd() > seems to return the nonzero argument, if there is any - but is this > mathematically correct? Yes, it's correct. gcd(a,b) is the greatest integer n such that n|a and n|b. Every integer n has the property that n|0, so gcd(a,0) = a. - James Jones Administrative Data Mgmt. Webmaster 375 Raritan Center Pkwy, Suite A Data Architect Edison, NJ 08837

2 1

[endian] Endian types in union
by Dave Dribin 20 Jul '06

20 Jul '06

Hello, This may be more appropriate for the devel list, but someone just pointed out on this list that an endian library has been submitted for approval. I've *just* needed classes like this (actually I wrote my own similar classes), and decided to see how the Boost library stacked up. It looks quite nice, and I'd be excited to see this included. One suggestion I would make is that the endian classes should not have constructors. As of version 0.5, trying to put them into a union causes a compiler error. Take the struct from the example, and add a union: struct header { big4_t file_code; big4_t file_length; little4_t version; little4_t shape_type; union { big4_t foo; little4_t bar; } baz; }; I get the following errors: endian_example.cpp:37: error: member 'boost::integer::big4_t <unnamed>::header::<anonymous union>::foo' with constructor not allowed in union endian_example.cpp:38: error: member 'boost::integer::little4_t <unnamed>::header::<anonymous union>::bar' with constructor not allowed in union By removing all constructors, the errors go away. I cam across this very issue when developing my classes, and found the answer in this comp.lang.c++.moderated post: <http://groups.google.com/group/comp.lang.c++.moderated/msg/ 103835a7b493723e?hl=en&> As an experiment, I modified boost/integer/endian.hpp to remove the constructors, and add an operator=() to see if this worked, and it did: template <typename T, std::size_t n_bytes> class endian< big, T, n_bytes, unaligned > : cover_operators< endian< big, T, n_bytes >, T > { public: typedef T value_type; operator T() const { return detail::load_big_endian<T, n_bytes>(bytes); } void operator=(T i) { detail::store_big_endian<T, n_bytes> (bytes, i); } private: char bytes[n_bytes]; }; I'd suggest making this change to all classes so that they can be used in unions. -Dave

2 7

boost::minmax_element 2D points bounding box
by Tomas Rapkauskas 20 Jul '06

20 Jul '06

Hello, I am newbie using boost library. I have tried to use boost::minmax_element to calculate bounding box of 2D Points, but I failed... Here is some code: struct S2DPoint { int x; int y; }; typedef std::vector<S2DPoint > Poly; Poly vect; ... std::pair<iterator, iterator> result = boost::minmax_element(poly.begin(), poly.end()); this code does not compiles I need to define BinaryPredicate.. My code with out boost looks: bool CalcPolyMinMax(const S2DPoint poly[], int nCount, S2DPoint &ptMin, S2DPoint &ptMax) { if ( nCount < 1 ) { return false; } ptMin = poly[0]; ptMax = poly[0]; S2DPoint pt; for ( int i1 = 0; i1 < nCount; ++i1 ) { pt = poly[i1]; UpdateMinMaxPoints(ptMin, ptMax, pt); } return true; } void UpdateMinMaxPoints(S2DPoint &ptMin, S2DPoint &ptMax, const S2DPoint &pt) { if ( ptMin.x > pt.x ) { ptMin.x = pt.x; } if ( ptMax.x < pt.x ) { ptMax.x = pt.x; } if ( ptMin.y > pt.y ) { ptMin.y = pt.y; } if ( ptMax.y < pt.y ) { ptMax.y = pt.y; } } Question: How to transform UpdateMinMaxPoints function to the BinaryPredicate? Thanks, Tomas

2 1

Valid arguments for boost::math::gcd()
by Matthias Hofmann 20 Jul '06

20 Jul '06

Hello everybody, I just learned that boost offers a function to determine the greatest common divisor of two integers, as described here: http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_math/g reatest_common_divisor_and_least_common_multiple.html However, this documentation is not very clear about which arguments are valid for boost::math::gcd(). In particular, it does not specify that the first argument has to be greater than the second one, although this seems to be a requirement with the current implementation. Also, I would like to know how the greatest common divisor is defined when one or both of the arguments are zero. In that case, boost::math::gcd() seems to return the nonzero argument, if there is any - but is this mathematically correct? -- Matthias Hofmann Anvil-Soft, CEO http://www.anvil-soft.com - The Creators of Toilet Tycoon http://www.anvil-soft.de - Die Macher des Klomanagers

1 0

[bgl] Problem with topological_sort
by Loïc Joly 20 Jul '06

20 Jul '06

Hello, When I run the example code of topo_sort.cpp in the BGL examples folder, it works perfectly. However, if I replace in this example: typedef adjacency_list<vecS, vecS, directedS, property<vertex_color_t, default_color_type> > Graph; By: typedef adjacency_list<listS, listS, directedS, property<vertex_color_t, default_color_type, property<vertex_index_t, int > > > Graph; It compiles, but during execution, some assert occurs. This assert occurs deep within my std::vector implementation (msvc8.0), in the call stack, the latest reference to boost is > TopoSort.exe!boost::iterator_property_map<std::_Vector_iterator<enum boost::default_color_type,std::allocator<enum boost::default_color_type> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<enum boost::vertex_color_t,enum boost::default_color_type,boost::property<enum boost::vertex_index_t,int,boost::no_property> >,boost::no_property,boost::no_property,boost::listS>,int,int const &,enum boost::vertex_index_t>,enum boost::default_color_type,enum boost::default_color_type &>::operator[](void * v=0x00355eb8) Line 349 + 0x67 bytes C++ Or, for people who don't read msvc on a daily basis, it indicated the line 350 of property_map.cpp : /*template<...> class iterator_property_map : ... { */ inline R operator[](key_type v) const { return *(iter + get(index, v)) ; } Does anybody have any idea of what the problem might be ? Best regards, -- Loïc

2 2

[function]unwanted conversion
by Sean Huang 20 Jul '06

20 Jul '06

I was surprised that the following code compiled: #include <boost/function.hpp> int main(int argc, char argv[]) { typedef boost::function< void ( void ) > MyFunction; MyFunction test1 = char(); MyFunction test2 = 0; return 0; } Is there any reason why boost::function allows such conversions? Thanks, Sean

2 2

Re: [Boost-users] [function]unwanted conversion
by Sohail Somani 19 Jul '06

19 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Sean Huang > Sent: Wednesday, July 19, 2006 1:22 PM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] [function]unwanted conversion > > I was surprised that the following code compiled: > > #include <boost/function.hpp> > > int main(int argc, char argv[]) > { > typedef boost::function< void ( void ) > MyFunction; > MyFunction test1 = char(); > MyFunction test2 = 0; > return 0; > } That is a funny one... I wonder if its interpreting it as a function pointer because its 0. If you try it with a non-zero value it doesn't work.

1 0

Re: [Boost-users] Asio & strand & threads
by Zola 19 Jul '06

19 Jul '06

Boosters, Ok -- turns out I really didn't know what I was doing. And I really didn't want strand at all- I'm still fuzzy on strand. But here's the code for what I really did want. And the thread group is handling the Handlers properly. Now my question is... Why is a deadline timer the way it is? What's it good for? Why isn't a delay/timer like a wrapper, that you can give a function object to, and then push that into the io_service queue with a delay? So you could do something like, io_s.post(deadline_timer(boost::posix_time::milliseconds(100), &f)); ? - Zola #include <iostream> #include <boost/asio.hpp> #include <boost/thread/thread.hpp> #include <boost/thread/mutex.hpp> #include <boost/thread/xtime.hpp> #include <boost/bind.hpp> #include <boost/function.hpp> #include <boost/ref.hpp> #include <boost/date_time/posix_time/posix_time.hpp> #include <vector> namespace asio = boost::asio; int const num_threads = 10; std::vector<boost::thread*> tv(num_threads); boost::mutex tv_mutex; boost::mutex io_mutex; class Test { public: Test(asio::io_service& io_s, unsigned int n) : io_s(io_s), n(n), f(boost::bind(&Test::print, this)) { io_s.post(f); } void print() { if (n >= 0) { { boost::mutex::scoped_lock lock(io_mutex); std::cout << "(thread=" << thread_num() << ") "; std::cout << "Timer: " << n << std::endl; } { boost::mutex::scoped_lock lock(m_mutex); io_s.post(f); --n; } boost::xtime xt; boost::xtime_get(&xt, boost::TIME_UTC); xt.sec += 1; boost::thread::sleep(xt); } } int thread_num() { boost::thread t; for (int i=0; i<num_threads; ++i) { boost::mutex::scoped_lock lock(tv_mutex); if (tv[i] && (*tv[i] == t)) { return i; } } return -1; } private: asio::io_service& io_s; unsigned int n; boost::function<void()> f; boost::mutex m_mutex; }; int main() { asio::io_service io_s; Test t(io_s, 1000); boost::thread_group threads; for (int i=0; i<num_threads; ++i) { boost::mutex::scoped_lock lock(tv_mutex); tv[i] = threads.create_thread(boost::bind(&asio::io_service::run, boost::ref(io_s))); } threads.join_all(); }

1 0

Asio & strand & threads
by Zola 19 Jul '06

19 Jul '06

Hi Boosters, I'm trying to figure out how Asio's strand works. My concept of strand is a bit blurry. Asio's Timer.5 tutorial says: "An boost::asio::strand<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00260…>guarantees that, for those handlers that are dispatched through it, an executing handler will be allowed to complete before the next one is started. This is guaranteed irrespective of the number of threads that are calling boost::asio::io_service::run()<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00139…>. Of course, the handlers may still execute concurrently with other handlers that were *not* dispatched through an boost::asio::strand<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00260…>, or were dispatched through a different boost::asio::strand<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00260…>object." Asio's documentation for boost::asio::io_service::run says: "Run the io_service's event processing loop. The run()<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00139…>function blocks until all work has finished and there are no more handlers to be dispatched, or until the io_service<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00139…>has been interrupted. Multiple threads may call the run()<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00139…>function to set up a pool of threads from which the io_service<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00139…>may execute handlers." The key here is "Multiple threads may call the run()<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00139…>function to set up a pool of threads from which the io_service<http://asio.sourceforge.net/boost_asio_0_3_7/libs/asio/doc/reference/a00139…>may execute handlers." -- This implies to me that it's automatic, and the thread pool will take whatever work it can. I've created a little example which has ten threads calling io_service::run, and printing out which thread is calling a handler given to the deadline timer. The issue here is that when I run this Test, the same thread is calling print() every time, no matter what I do. My understanding of this Test is as so: io_service holds a queue of asynchronous events. You fill up the io service with events, and then you call run on it. If multiple threads call run, they'll do whatever work they can. I'm calling run from 10 threads: Each thread will see what events are there, and handle them if possible. The asynchronous waits are calling a strand wrapper. The strand wrapper is like a mutex, and ensures that no two threads will call print() at the same time. What is going on, and why is the same thread calling print() every time? Is my understanding here completely wrong? - Zola // The Test: #include <iostream> #include <boost/asio.hpp> #include <boost/thread/thread.hpp> #include <boost/bind.hpp> #include <boost/function.hpp> #include <boost/date_time/posix_time/posix_time.hpp> #include <vector> namespace asio = boost::asio; int const num_threads = 10; std::vector<boost::thread*> tv(num_threads); class Test { public: Test(asio::io_service& io, int n, int ms) : n(n), ms(ms), s(io), dt(io, boost::posix_time::milliseconds(ms)), f(boost::bind(&Test::print, this)) { dt.async_wait(s.wrap(f)); } void print() { if (n >= 0) { boost::thread t; for (int i=0; i<num_threads; ++i) { if (tv[i] && (*tv[i] == t)) { std::cout << "(thread=" << i << ") "; break; } } std::cout << "Timer: " << n << std::endl; --n; dt.expires_at(dt.expires_at() + boost::posix_time::milliseconds(ms)); dt.async_wait(s.wrap(f)); } } private: int n; unsigned int ms; asio::strand s; asio::deadline_timer dt; boost::function<void (asio::error&)> f; }; int main() { asio::io_service io; Test t(io, 1000, 5); // 1000 iterations, every 5 ms. boost::thread_group threads; for (int i=0; i<num_threads; ++i) { tv[i] = threads.create_thread(boost::bind(&asio::io_service::run, &io)); } threads.join_all(); }

1 0

adding -fPIC flag for AMD64
by Scott Amort 19 Jul '06

19 Jul '06

Hi All, I am trying to statically link a shared library I am developing with the Boost Regex library. I get the following error: /usr/lib/gcc/x86_64-pc-linux-gnu/4.1.1/../../../../x86_64-pc-linux-gnu/bin/ld: /usr/lib64/libboost_regex.a(instances.o): relocation R_X86_64_32 against `boost::object_cache<boost::re_detail::cpp_regex_traits_base<char>, boost::re_detail::cpp_regex_traits_implementation<char> >::do_get(boost::re_detail::cpp_regex_traits_base<char> const&, unsigned long)::s_data' can not be used when making a shared object; recompile with -fPIC I have run across this once before, and although I am not really clear why, it appears that on my AMD64 platform, if I try to link a static library into a shared library, that static library needs to be compiled with -fPIC (this requirement does not exist for normal x86 platforms). My question is: is there an already available option that I can add when compiling the Boost libraries to enable this setting? I am not at all familiar with the BJam build system. Thanks for any assistance! Best, Scott

3 3

binary streams?
by bringiton bringiton 19 Jul '06

19 Jul '06

I'm wondering whether boost has binary streams (or whether the standard library does and i missed it). I had a quick look at boost serialisation. looks like it maybe too involved for my needs. my only needs would be something as follows: outstream s; s << (int)3; s << (float)4.0; s << std::string("hello"); void* data = s.buffer(); int size = s.size(); instream s(data, size); int a << s; float b << s; std::string b << s; I plan on sending the data over TCP. Portability would also be handy (ie endian issues). I may use asio when it is avail in the next boost release. does that support binary streams?

2 1

Re: [Boost-users] [thread] Keeping leak detectors still... - Results
by Daniel Krügler 19 Jul '06

19 Jul '06

Hello, I apologize for the late response to the original thread "Re: [thread] Keeping leak detectors still..." but we had some hard time to bring the boost tests to run and I hope we did that correctly... Furtheron I would like to thank my colleague Rüdiger Dreier for his patience for doing all this testing work. Please note, that the bjam boost tests where performed twice, each one with compiler MSVC 8.00.50727.42 on Windows XP SP2 and the official release of boost 1.33.1. The only difference was that the original file libs/thread/src/tss_hooks.cpp was replaced by the version posted by Peter Dimov on 2006-07-15T18:31 (where the leading and trailing html tags have been removed). All 14 thread-related tests passed the tests for both situations. If anyone is interested in the complete test output (which includes the results of all other libs), please don't resist to ask for them (I didn't want to pollute the news group space without explicit invitation to do that...) Additionally to the boost test, we run a homegrewn, simple threading-mutex-locking test, which also passed successfully for the old and new tss_hooks.cpp version. We could also observe that the standard leak reporter did *not* choke anymore ;-) Greetings from Bremen, Daniel Krügler

1 0

[python], [regex] Segmentation fault when deallocating match_results in a python extension module
by bernhard.maeder＠zkb.ch 19 Jul '06

19 Jul '06

Hello everybody I have a problem in a boost.python module that makes use of the boost.regex library. I'm not sure how much the problem is related to those two libraries or whether I'm just doing something wrong in the build setup. I have the following two python modules: *** test2.cpp *** #include <string> #include<boost/python.hpp> #include<boost/regex.hpp> using namespace boost; using namespace boost::python; void test_func(std::string const & in) { boost::regex expr("^(.*)\\[.*\\]$"); boost::match_results<std::string::const_iterator> match; boost::regex_match(in.begin(), in.end(), match, expr); } BOOST_PYTHON_MODULE(test2) { def("testFunc", &test_func); } *** Build command *** g++-3.4 -Wall -pthread -fPIC -I. -I/usr/include/python2.3 -c -otest2.os test2.cpp g++-3.4 -pthread -shared -o test2.so test2.os -lpython2.3 -lboost_python-gcc-mt-1_33 -lboost_regex-gcc-mt-1_33 *** test.py *** from test2 import * testFunc('justastring') *** output *** >>> from test2 import * >>> testFunc('justastring') Segmentation fault The program aborts when exiting test_func(), during deallocation of match_results. The error occurs somewhere in _M_deallocate of stl_vector.h. Can anybody help me with this problem? What could possibly go wrong here? One thing I noted: python is compiled using GCC3.3 on our system, while we are using GCC3.4, is this a problem? (But, trying the same on a system with GCC 4 for both, python and our app, also fails, so it seems like the problem is to be sought elsewhere). Thanks a lot! Bernhard

2 1

date_time compilation errors on gcc/STLport (time_formatters.hpp)
by Sagnes, Frederic 19 Jul '06

19 Jul '06

<<log.txt>> Hello, I had some troubles compiling my software with the date_time boost library. I attached the build log, I'm using STLport 5.1.0 RC1 (but 5.0.2 has the same troubles), GCC 4.0.1, Boost 1.33.1 and Linux Mandriva 2006.0. It is related to the use of STLport streams by date_time in time_formatters.hpp. It says "ambiguous overload for 'operator<<'". I don't know if it's related to the way I compiled Boost and/or STLport, but this error is generated by the compiler, not the linker. This problem doesn't show up on Visual Studio 2003. Best regards _______________________________________________ Frédéric Sagnes, A&D AS RD DH K3 Siemens AG Karlsruhe

1 0

Re: [Boost-users] how do I access m_property on an edge_descriptor
by Daniel Mitchell 18 Jul '06

18 Jul '06

> How do I access the m_property value of an edge_descriptor. > > I'm using an undirected graph and I need to get a unique identifier for > each edge in the graph. The vertex pair I currently use for edges create > two possible identifiers for each edge, but the m_property value of > each edge appears unique only I cannot access it. Why wouldn't you use the edge descriptor itself as the unique identifier? It should be the case that (u,v) == (v,u). D.

2 1

Re: [Boost-users] A question about shared_ptr(Zhuo Hao)
by Zhuo Hao 18 Jul '06

18 Jul '06

But consider the following code: #include<iostream> using namespace std; class CMutex{};//Hide all the implementations for convience template<class Y> void world(Y * p) { } void hello(int *x){ } int main(){ hello(0); world<CMutex>(0); return 1; } It compiles and runs without problems.So you see I can pass zero as a pointer to Y, and as a pointer to int. That's OK. I wonder how it is implemented that we cannot pass zero as a pointer to Y in the constructor of shared_ptr. Thanks Zhuo Hao On 14/07/06, Tommy Hinks <tommy.hinks(a)gmail.com> replied: You can't pass 0 because the Type passed must be an Investment*, not just a type that could be cast to one. This is why you have to explicitly cast it yourself.

4 3

Re: [Boost-users] [Serialization] Problem serializing via base class ptr
by Guy Létourneau 18 Jul '06

18 Jul '06

Robert, I've tried to include your changes but it doesn't solve the problem. I had to add the following line: BOOST_IS_ABSTRACT(NonVolatileData) for the program to compile. I agree with you, to have an abstract class is what is needed in that case as the NonVolatileData class is not intended to do something useful except for allowing my data storage layer to be generic. However, abstract or not, I still have the same problem: when serializing my SomeData object through a pointer to the NonVolatileData, only the data of the parent class gets serialized. Anything else you want me to try? Thanks, Guy >Try making the base class polymorphic - that it define at least >one abstract function. See my changes below. This will have >the beneficial effect of inhibiting anyone from creating an instance >of your base class directly. >Robert Ramey >Guy Létourneau wrote: >> Hello, >> >> I need to develop a generic data storage layer. Its job is to handle >> the serialization of all objects that need to be persistent in my >> system and handle management of archives, backups and restores and so >> forth. The most important point is that it must stay generic, i.e. >> have no knowledge of the type of objects being passed by other >> modules in the system. Because of this, I define a base class >> NonVolatileData from which all data classes in the system will >> derive: >> >> /////////////////////////////////////////////////////////////////////// >> // Base class >> class NonVolatileData >> { >> friend >> class boost::serialization::access; >> >> public: >> >> NonVolatileData(){ i = 1; }; >> virtual ~NonVolatileData() = 0; // Note - pure virtual function >> make class abstract- >> >> >> protected: >> >> virtual void Dummy() =0; // Note - pure virtual function make >> class abstract- >; >> >> int i; >> template <class Archive> >> void serialize( Archive& ar, const unsigned int version ) >> { >> ar & i; >> } >> }; >> BOOST_CLASS_TRACKING(NonVolatileData, >> boost::serialization::track_never) >> >> >> class SomeData: public NonVolatileData >> { >> friend >> class boost::serialization::access; >> >> public: >> >> SomeData () >> { >> }; >> >> ~SomeData () >> { >> }; >> >> void SetValue( std::string& Address ) >> { >> this->Address = Address; >> } >> >> void Dummy() >> { >> } >> >> private: >> >> template <class Archive> >> void serialize( Archive& ar, const unsigned int version ) >> { >> ar & >> >> boost::serialization::base_object<NonVolatileData>(*this); >> ar& Address; } >> >> std::string Address; >> }; >> BOOST_CLASS_TRACKING(SomeData, boost::serialization::track_never) >> ///////////////////////////////////////////////////////////////// >> >> My data storage interface will take a ptr to the base class i.e. >> Save(NonVolatileData* data) so the serialization will be performed >> through a ptr to the base class. I've read the documentation >> multiple times and I'm still unable to make that work correctly. >> When a do a save, only the base class is serialized even though the >> base class is polymorphic. I've tried using the >> BOOST_CLASS_EXPORT_GUID macro the force a registration of my derived >> class without success. I've also checked the example from demo.cpp. >> It uses the direct call to register_type() but in my case, I don't >> want to change the code everytime a new class is defined in the >> system so I went with option 2 (the macro). There's probably a >> subtle detail I do not do correctly (polite way of saying I'm missing >> something :-)). >> >> Thanks for your help, >> >> Guy Letourneau

2 1

Re: [Boost-users] [test] running tests by name
by Sohail Somani 18 Jul '06

18 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Perepelitsa Roman > Sent: Tuesday, July 18, 2006 5:33 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] [test] running tests by name > > Hi, > > I have implementation of feature which was requested several times. It > allows you to run tests (implemented with the help of boost.tests) by > name. > > I attached 3 files. > > 1. filter.hpp should be copied to boost/test/detail. > 2. framework.ipp should be copied to boost/test/impl. > (after copying files you will probably need to rebuild boost.test) > 3. example.cpp contains example of usage. Me likey. This is what I needed. I'm not going to go the regex way, rather I'll explicitly require test suites, or tests. After all, its reasonable to have one test suite per executable imho, but its quite a lot more common to run a single test from a test suite. Thank you very much! Sohail

1 0

how do I access m_property on an edge_descriptor
by kellygp 18 Jul '06

18 Jul '06

Hi, How do I access the m_property value of an edge_descriptor. I'm using an undirected graph and I need to get a unique identifier for each edge in the graph. The vertex pair I currently use for edges create two possible identifiers for each edge, but the m_property value of each edge appears unique only I cannot access it. Thanks, any help appreciated. George

1 0

[test] running tests by name
by Perepelitsa Roman 18 Jul '06

18 Jul '06

Hi, I have implementation of feature which was requested several times. It allows you to run tests (implemented with the help of boost.tests) by name. I attached 3 files. 1. filter.hpp should be copied to boost/test/detail. 2. framework.ipp should be copied to boost/test/impl. (after copying files you will probably need to rebuild boost.test) 3. example.cpp contains example of usage. Here is how it works. Each test case receives the name in the form Suite1/Suite2/.../SuiteN/CaseName. For example there is test cases is example.cpp with name "Master Test Suite/A/Foo". Test executable accepts new argument --filter=<regex>. It allows you to run that and only that tests which names match given regex. Note: library implicitly adds ".*" to the beginning and to the end of given regex expression. For example if you run example.cpp without arguments, you will see: Foo in A Bar in A Foo in B Bar in B If you run it with argument "--filter=Foo", you will see: Foo in A Foo in B If you want to run all tests in the suite "A", you can try "--filter=/A/" or "--filter=^Master Test Suite/A/". P.S. You can use this feature without modification of boost.test sources. Just call boost::test_suite_detail::filter in your implementation of init_unit_test_suite. HTH, Roman Perepelitsa.

1 0

boost::thread and member function
by King, Steven R 17 Jul '06

17 Jul '06

Hello All, Newbie question, thanks for your patience. I'm trying to pass a member function as the callback in boost::thread. Given this: class my_class { ... void foo(void); ... }; Instincts told me to do this: boost::thread my_thread( std::mem_fun(&my_class::foo) ); That didn't work and I discovered that boost::thread expects a boost::function0<void> instead. Can somebody please help me bridge the gap between std::mem_fun and boost::function0? I'm using gcc 4.1 on Linux and Boost 1.33.1 Cheers, -steve

4 4

[Serialization] Problem serializing via base class ptr
by Guy Létourneau 17 Jul '06

17 Jul '06

Hello, I need to develop a generic data storage layer. Its job is to handle the serialization of all objects that need to be persistent in my system and handle management of archives, backups and restores and so forth. The most important point is that it must stay generic, i.e. have no knowledge of the type of objects being passed by other modules in the system. Because of this, I define a base class NonVolatileData from which all data classes in the system will derive: /////////////////////////////////////////////////////////////////////// // Base class class NonVolatileData { friend class boost::serialization::access; public: NonVolatileData(){ i = 1; }; virtual ~NonVolatileData(){}; protected: virtual void Dummy(){}; int i; template <class Archive> void serialize( Archive& ar, const unsigned int version ) { ar & i; } }; BOOST_CLASS_TRACKING(NonVolatileData, boost::serialization::track_never) class SomeData: public NonVolatileData { friend class boost::serialization::access; public: SomeData () { }; ~SomeData () { }; void SetValue( std::string& Address ) { this->Address = Address; } void Dummy() { } private: template <class Archive> void serialize( Archive& ar, const unsigned int version ) { ar & boost::serialization::base_object<NonVolatileData>(*this); ar& Address; } std::string Address; }; BOOST_CLASS_TRACKING(SomeData, boost::serialization::track_never) ///////////////////////////////////////////////////////////////// My data storage interface will take a ptr to the base class i.e. Save(NonVolatileData* data) so the serialization will be performed through a ptr to the base class. I've read the documentation multiple times and I'm still unable to make that work correctly. When a do a save, only the base class is serialized even though the base class is polymorphic. I've tried using the BOOST_CLASS_EXPORT_GUID macro the force a registration of my derived class without success. I've also checked the example from demo.cpp. It uses the direct call to register_type() but in my case, I don't want to change the code everytime a new class is defined in the system so I went with option 2 (the macro). There's probably a subtle detail I do not do correctly (polite way of saying I'm missing something :-)). Thanks for your help, Guy Letourneau

2 1

[serialization] Difficulty getting serialization to work.
by Dieter Buys 17 Jul '06

17 Jul '06

Hi, I am experiencing difficulties in getting the Boost serialization library to work. There seems to be an error related to object tracking, as I am getting BOOST_STATIC_ASSERTION_FAILURE<x>. I am trying to figure it out using the attached test code. The documentation claims I should be putting a BOOST_SERIALIZATION_TRACKING() macro in my file (presumably directly after my class definition). I did a full text search over the entire source of the library and nowhere did this preprocessor macro exist. There is a BOOST_CLASS_TRACKING() macro, which I tried putting in my source with tracking_never. That seems to have made no appreciable difference. I have absolutely no idea what I am supposed to do. :( Any help would be appreciated. Thanks, ~ Dieter Buys #include <fstream> #include <boost/shared_ptr.hpp> #include <boost/serialization/serialization.hpp> #include <boost/serialization/tracking.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> class gps_position { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & degrees; ar & minutes; ar & seconds; } int degrees; int minutes; float seconds; public: gps_position() {}; gps_position(int d, int m, float s) : degrees(d), minutes(m), seconds(s) {} }; // BOOST_CLASS_TRACKING(gps_position, track_never) int main(void) { std::ofstream ofs("serial.txt"); gps_position *g = new gps_position(35, 59, 24.567f); // const gps_position g(35, 59, 24.567f); { boost::archive::text_oarchive oa(ofs); oa << g; } delete g; gps_position *newg; // gps_position newg; { std::ifstream ifs("serial.txt", std::ios::binary); boost::archive::text_iarchive ia(ifs); ia >> newg; } delete newg; return 0; }

2 5

Re: [Boost-users] [Test] Running individual test cases
by Sohail Somani 17 Jul '06

17 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Gennadiy Rozental > Sent: Monday, July 17, 2006 10:19 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [Test] Running individual test cases > > If you could tell me what to read or change to get the > framework to do > > this, I'd be happy. > > It's not simple chnage. It requires modifications on many > levels. You will > have to wait will 1.35. Sorry. That's alright. If I can help in any way, feel free to ask :)

1 0

Re: [Boost-users] [Test] Running individual test cases
by Sohail Somani 17 Jul '06

17 Jul '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Gennadiy Rozental > Sent: Monday, July 17, 2006 9:31 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [Test] Running individual test cases > > > "Sohail Somani" <s.somani(a)fincad.com> wrote in message > news:1C1EBEF8DBACDC439D038EA051674EC735B941@xbox.financialcad.com... > > Hi, > > > > I recall a thread about running individual test cases by name. Might > > even have been yesterday. Anyway, I'd like to put in a "me > too" vote for > > that and also ask what I can currently do to continue using the auto > > registration capability but perhaps modify it to only > register certain > > functions? Would I need to create my own test suite? > > I could always use compile time switches This *could* work, but imho it really prevents the quick turn around you need when debugging unit tests. I personally would prefer the test runner to by default run all tests and given a bunch of --run_test=test1 --run_test=test2 command line arguments, it runs only those tests. If you could tell me what to read or change to get the framework to do this, I'd be happy. Thanks Sohail

2 1

Boost Test usage
by Matt Schuckmann 17 Jul '06

17 Jul '06

I've been looking into using the boost test library to start testing some of our code and it looks pretty good. I've gone through the documentation and several of the examples and there are a couple of things I don't really get I don't see how the test_suite class lets you create do anything special with regards to building multi-level tests, none of the examples really show multilevel test hierarchy and how it really helps me. It looks like it's really just a way of using a class to group test functions instead of a series of free functions, am I missing something here? I really expected more from a feature like this, I'm thinking of things like Command line control over which test suites to run, I mean you name the test suites but you don't appear to do anything with that name Reporting success and failure grouped by test suite Am I missing something here, is this stuff possible and the examples don't show it or are these feature that are yet to come or haven't been thought of? I don't see a good example for how I should setup a unit test for a real world type project you know an extensive example that covers inputs, outputs, multiple test suites, etc all in one example. In my case I've a got a library with several independent classes and functions that I'd like to test and I'm not sure if I should be creating multiple executables (1 for each test case) or a single executable that tests everything, I don't understand the pros and cons of either case. It seems like I want the single executable that can test everything or that can test just want I tell it to test. Any info would be appreciated. Matt S.

2 4