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

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