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

RE: [Boost-users] Re: a question on boost::is_function
by Foster, Gareth 06 Jan '05

06 Jan '05

Interesting stuff, thanks all that replied. I think was just trying to related the function type to the syntax seen in other types, the fact is that the function type is a bit special I suppose, so I should really just take it by itself. I think I've seen all the possible uses for it thanks to the replies I've had here anyway. It's always interesting to see syntax from the murkier corners of the C++ repertoire :) Thanks again, Gaz -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of John Maddock Sent: 06 January 2005 10:45 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Re: a question on boost::is_function > Could I do ... > > int (int) * p_my_function_pointer; > > Or some other such madness? I'm reading MSDN about the indirection > operator > at the moment, maybe that will help to clear this up in my head. Can you > recommend a page on "function types". You can certainly do it via a typedef: typedef int mysig(int); mysig* p_my_function; // declares function pointer mysig myproc; // declares a function called myproc with signature mysig. John. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

boost::intrusive_ptr and std::list::iterator
by Ernst Murnleitner 06 Jan '05

06 Jan '05

Hello Readers, I have a question regarding boost::intrusive_ptr and std::list::iterator. I have a std::list<boost::intrusive_ptr<CDataset> > which holds my datasets. My question: Is the increment counter of the intrusive_ptr incremented only by doing the following (assigning a iterator to a dataset)? (I could try myself, but I do not know what happens with other compilers/libraries) typedef List std::list<boost::intrusive_ptr<CDataset> >; List list; ... // List holds datasets ... // Get an iterator: List::iterator iter = list.begin(); // Is the Increment counter of the dataset incremented by this action? // Or does the iterator not necessarily keep a pointer to the dataset directly? It would be nice, if somebody could answer this question. In the meantime I try out, what my implementation makes (gcc, linux). Greetings Ernst

2 2

RE: [Boost-users] Re: a question on boost::is_function
by Foster, Gareth 06 Jan '05

06 Jan '05

> boost::is_function<int(int)>::value > I know it's confusing. Most C++ programmers never see a function type > in the wild. You can use remove_pointer to turn a pointer-to-function > into a function. Could I do ... int (int) * p_my_function_pointer; Or some other such madness? I'm reading MSDN about the indirection operator at the moment, maybe that will help to clear this up in my head. Can you recommend a page on "function types". Gaz -- Dave Abrahams Boost Consulting http://www.boost-consulting.com _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

4 3

Boost Logo Contest
by Joel 06 Jan '05

06 Jan '05

Hello, Boost (www.boost.org) is an open, collaborative effort that includes thousands of programmers from the C++ community at large. Boost is hoping to retire the existing logo (http://www.boost.org/boost.png) and adopt a new one. We are now launching a competition for the creation of a new logo. The competition is open to all designers, both professional and non- professional. The final design must be submitted as a scalable vector format, preferably SVG or EPS. A free, open source, scalable vector graphics editor can be found here: http://inkscape.org/. Alternative bitmap versions (small, medium and large icons, web graphics, etc.) of the logo may also be submitted to augment the main vector format. A JPEG or PNG version, to be placed in a web page, must also be submitted for judging. The Boost community will vote on submitted entries. Voting shall be based on Instant Runoff Voting (http://www.fairvote.org/irv/whatis2.htm) meaning that each individual voter shall choose 5 favorites, in order of preference. In addition to proper acknowledgement, the winning designer will receive: + the Boost Logo Designer T-shirt (printed with the winning logo design), plus, + a signed copy of the MPL book by David Abrahams and Aleksey Gurtovoy, C++ Template Metaprogramming: Concepts, Tools, and Techniques from Boost and Beyond (http://www.awprofessional.com/titles/0321227255) Entries will be accepted on or before February 15, 2005. I will act as the logo contest manager. Please email all entries to me (djowel at gmail dot com). I shall post all submitted entries to Boost's web site. The competition will close on March 1, 2005 and the winning entry will be announced soon thereafter. + The logo must be immediately identifiable with the spirit of Boost. + The logo's concept must be simple and clear and should have relevance to the organization. + The logo should not be too detailed and should work in low resolution. + Any logo submission that is blatantly racist, sexist, obscene, or otherwise discriminatory will be rejected. + The logo must be the original work of the submitter. + The logo must be free of any copyright or other intellectual property claims. + The winning logo shall be distributed under the Boost Software License, Version 1.0. (www.boost.org/LICENSE_1_0.txt) Regards, Joel de Guzman http://www.boost-consulting.com http://spirit.sf.net _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

RE: [Boost-users] status of boost::signal multi-threading support
by Frank Maddin 05 Jan '05

05 Jan '05

> If you're using a signal from two threads concurrently, you will most > likely see random crashes and other bad behavior. Signals keep a lot of > state, even when they are being invoked, so just about anything can > trip it up. > > > I am curious because, I am wondering in my ignorance, what are the > > components of the boost::signal library and how they can be > > multi-thread > > capable. This ofcourse is answered by reviewing the code. > > Ideally, a thread-safe Signals would allow you to invoke in several > threads at one, disconnect signals in several threads concurrently, > etc. > > Doug Just to make sure I understand, this is only a problem if you are using the *same* signal from two threads concurrently. This is what I've thought, but the phrase *If you're using a signal* makes me want to check. Not trying to nit-pick, just trying to make sure there isn't some situation I don't understand. Thanks, Frank

2 1

bind (excessive?) argument copying
by Trent Hill 05 Jan '05

05 Jan '05

I was recently surprised to find that boost::bind seems to copy arguments a number of times when called. For example, this program: class C { public: C() {} C(const C &c) : data(c.data) { std::cout << "C(const C &c)\n"; } boost::array<char, 4000> data; }; void foo(const C &) {} int main(int a_argc, char **a_argv) { C c; boost::bind(&foo, c); return EXIT_SUCCESS; } results in this output (Visual C++ .NET with /O2): C(const C &c) C(const C &c) C(const C &c) C(const C &c) Four copies - I had hoped to only see a single copy. Logically, there doesn't seem to be a need for more than one copy. Is there an implementation issue that requires this many copies? I was hoping to use bind with some moderately weighted objects, however the number of copies that seem to occur may be prohibitive for me. (I realise that dynamically allocating objects and passing around pointers is an alternative but I'd rather avoid that if possible.) Any thoughts? Thanks, Trent.

4 3

handling exceptions in Boost threads
by Steve McKay 05 Jan '05

05 Jan '05

Is there a generally accepted way to handle exceptions in Boost threads? I have a main thread which spawns 4 children and waits for them all to finish with boost::thread_group::join_all. I want to know if any of them threw an exception (which I would catch within the child thread before returning from that thread). Steve F. McKay Social Security Administration Room 760 Altmeyer 6401 Security Boulevard Baltimore, Maryland 21235 (410)965-3014

1 0

a question on boost::is_function
by Kevin Lee 05 Jan '05

05 Jan '05

should the following code return: true or false? boost::is_function<int (*)(int)>::value if the result is false, why? I don't understand it. if the result is true, the code of boost_1_32_0/libs/type_traits/test/is_function_test.cpp line 42 expect it to be false. could someone help me with this? ----------------------------------------- This message and its attachments may contain privileged and confidential information. If you are not the intended recipient(s), you are prohibited from printing, forwarding, saving or copying this email. If you have received this e-mail in error, please immediately notify the sender and delete this e-mail and its attachments from your computer.

4 3

question about breadth_first_search
by Matthias Linkenheil 05 Jan '05

05 Jan '05

Dear all, i want to use the breadth_first_search algorithm to store the visited nodes e.g. in a list for access in the main function. Has anyone an idea to handle this? In my code i print out the visited nodes. The examples in the Boost User Guide about the visitor concept are sometimes not so easy to understand. ... using namespace boost; template <typename VertexNameMap> class bfs_name_printer:public default_bfs_visitor { public: bfs_name_printer(VertexNameMap n_map) : m_name_map(n_map){} template <typename Vertex, typename Graph> void discover_vertex(Vertex u, const Graph& ) const { std::cout<<get(m_name_map, u) <<" "; } private: VertexNameMap m_name_map; }; ... main(){ ... typedef property_map<Graph, vertex_index_t>::type VertexNameMap; VertexNameMap id = get(vertex_index, g); bfs_name_printer<VertexNameMap> vis(id); breadth_first_search(fg, s, visitor(vis)); ... Regards, Matthias

3 2

read_write_mutex assertion on multiprocessor Wintel
by jkharris7＠comcast.net 05 Jan '05

05 Jan '05

As I reported earlier, read_write_mutex asserts in debug mode (VC71), apparently seeing false wake-ups on a condition variable. I was able to do this with just a simple group of threads locking a RWM in tight loops, with one writer and a few readers. The new information is that I am runing this on a dual-Xeon with hyper-threading enabled (so four apparent CPU's), and I'm thinking that maybe boost libs don't get exercised on this kind of hardware very much. Is is possible that a condition::notify_all() happens on each processor? Has anyone else seen this? For now, I just removed the asserts and rebuilt. Synchronization seems to be unaffected in my real-world stress test of RWM. jh

2 1

Boost::filesystem : possible addition
by Georgios Diamantopoulos 05 Jan '05

05 Jan '05

Hello, I've always wanted some functionality to determine the relative path between two paths. Maybe something like this can be added to the convinience.hpp or otherwise: fs::path relative_path_of(fs::path const &base, fs::path const &full) { std::string fullStr = full.string(); std::string baseStr = base.string() + "/"; // add a slash so that it returns the relative path boost::erase_first(fullStr, baseStr); return fs::path(fullStr); } Cheers, Georgios

2 1

Problem serializing (restoring) through base pointer
by Bill Lear 05 Jan '05

05 Jan '05

I have spent several hours combing the documentation and archives, but can't seem to find an answer to my problem. I have an abstract base class, Operation with a pure virtual function 'double value() = 0'. I derive a class, BinaryOperation from Operation. It takes as arguments an operation type (+, -, *, /) and two Operation pointers --- one for the left operand, one for the right. It stores these two pointers internally and uses them when the value() method is invoked. I derive two more classes from Operation, trivial, made-up, useless ones. One is called IncrementOperation, one is called DecrementOperation. I can save to an XML archive properly, but when I try to restore, it core dumps. I am running gcc-3.2. I have tried everything I can think of, but am stuck. I have tried using polymorphic_xml_iarchive (and corresponding output version), but it still fails. The first few stack frames from GDB are: #0 0x0808897f in ?? () #1 0x08052f7d in boost::archive::detail::basic_iarchive::load_pointer(void*&, boost::archive::detail::basic_pointer_iserializer const*, boost::archive::detail::basic_pointer_iserializer const* (*)(boost::serialization::extended_type_info const&)) () #2 0x0804c78a in boost::archive::detail::load_pointer_type<boost::archive::xml_iarchive, Operation*>::invoke(boost::archive::xml_iarchive&, Operation*&) ( ar=@0xbffff0e0, t=@0xbffff330) at /usr/local/include/boost-1_32/boost/archive/detail/iserializer.hpp:450 #3 0x0804c51a in load<boost::archive::xml_iarchive, Operation*> ( ar=@0xbffff0e0, t=@0xbffff330) at /usr/local/include/boost-1_32/boost/archive/detail/iserializer.hpp:529 Following my sig, I've posted the xml input file that is generated by the save, and then following that, the C++ code (fairly short). It is failing on the following line: ia & BOOST_SERIALIZATION_NVP(t); Any help would be appreciated. Thanks. Bill <?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="3"> <t class_id="1" class_name="BinaryOperation" tracking_level="1" version="0" object_id="_0"> <Operation class_id="0" tracking_level="1" version="0" object_id="_1"></Operation> <_op>42</_op> <_left_operand class_id_reference="1" object_id="_2"> <Operation object_id="_3"></Operation> <_op>43</_op> <_left_operand class_id="2" class_name="IncrementOperation" tracking_level="1" version="0" object_id="_4"> <Operation object_id="_5"></Operation> <_init>33</_init> </_left_operand> <_right_operand class_id="3" class_name="DecrementOperation" tracking_level="1" version="0" object_id="_6"> <Operation object_id="_7"></Operation> <_init>333</_init> </_right_operand> </_left_operand> <_right_operand class_id_reference="1" object_id="_8"> <Operation object_id="_9"></Operation> <_op>45</_op> <_left_operand class_id_reference="3" object_id="_10"> <Operation object_id="_11"></Operation> <_init>444</_init> </_left_operand> <_right_operand class_id_reference="2" object_id="_12"> <Operation object_id="_13"></Operation> <_init>44</_init> </_right_operand> </_right_operand> </t> </boost_serialization> #include <string> #include <iomanip> #include <iostream> #include <fstream> #include <stdexcept> #include <boost/serialization/nvp.hpp> #include <boost/archive/xml_iarchive.hpp> #include <boost/archive/xml_oarchive.hpp> //#include <boost/archive/polymorphic_xml_iarchive.hpp> //#include <boost/archive/polymorphic_xml_oarchive.hpp> #include <boost/serialization/export.hpp> class Operation { public: Operation() { } virtual ~Operation() { } virtual double value() = 0; private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int /* file_version */){ } }; BOOST_IS_ABSTRACT(Operation); class BinaryOperation: public Operation { public: BinaryOperation() : _op(' '), _left_operand(0), _right_operand(0) { } BinaryOperation(char op, Operation* left_operand, Operation* right_operand) : _op(op), _left_operand(left_operand), _right_operand(right_operand) { } virtual ~BinaryOperation() { } virtual double value() { switch (_op) { case '+': return _left_operand->value() + _right_operand->value(); break; case '-': return _left_operand->value() - _right_operand->value(); break; case '*': return _left_operand->value() * _right_operand->value(); break; case '/': return _left_operand->value() / _right_operand->value(); break; } } protected: char _op; Operation* _left_operand; Operation* _right_operand; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int /* file_version */){ ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP(Operation) & BOOST_SERIALIZATION_NVP(_op) & BOOST_SERIALIZATION_NVP(_left_operand) & BOOST_SERIALIZATION_NVP(_right_operand); } }; BOOST_CLASS_EXPORT_GUID(BinaryOperation, "BinaryOperation"); class IncrementOperation : public Operation { public: IncrementOperation() : _init(0) { } IncrementOperation(double init) : _init(init) { } virtual double value() { return _init++; } protected: double _init; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int /* file_version */){ ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP(Operation) & BOOST_SERIALIZATION_NVP(_init); } }; BOOST_CLASS_EXPORT_GUID(IncrementOperation, "IncrementOperation"); class DecrementOperation : public Operation { public: DecrementOperation() : _init(0) { } DecrementOperation(double init) : _init(init) { } virtual double value() { return _init--; } protected: double _init; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int /* file_version */){ ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP(Operation) & BOOST_SERIALIZATION_NVP(_init); } }; BOOST_CLASS_EXPORT_GUID(DecrementOperation, "DecrementOperation"); void save_Operation(const Operation* t) { std::ofstream ofs("operation.xml"); assert(ofs.good()); boost::archive::xml_oarchive oa(ofs); //boost::archive::polymorphic_xml_oarchive oa(ofs); oa & BOOST_SERIALIZATION_NVP(t); } void restore_Operation(Operation*& t) { std::ifstream ifs("operation.xml"); if (!ifs.good()) { throw std::runtime_error("No input archive file"); } boost::archive::xml_iarchive ia(ifs); //boost::archive::polymorphic_xml_iarchive ia(ifs); std::cout << "Reading ...\n"; ia & BOOST_SERIALIZATION_NVP(t); std::cout << "Done reading ...\n"; } int main(int, char *[]) { try { Operation* a = new BinaryOperation('+', new IncrementOperation(33), new DecrementOperation(333)); Operation* b = new BinaryOperation('-', new DecrementOperation(444), new IncrementOperation(44)); Operation* c = new BinaryOperation('*', a, b); save_Operation(c); Operation* new_c; std::cout << "Restoring\n"; restore_Operation(new_c); } catch (std::exception e) { std::cerr << e.what() << '\n'; return 1; } return 0; }

2 6

why doesn't scoped_ptr have a custom deleter?
by Pablo Aguilar 04 Jan '05

04 Jan '05

Hi, I'm currently playing around with Apache's Xerces XML library, and found myself needing to ->release some pointers. shared_ptr + mem_fn works great: shared_ptr<DOMBuilder> db( impl->createBuilder() , mem_fn(&DOMBuilder::release) ); But for the objects I'm using, I don't need a shared_ptr, but just a scoped_ptr. So I'm wondering about the rationale behind not giving scoped_ptr a custom deleter? Is it that shared_ptr's overhead is negligible (when not being shared I mean)? thanks

3 3

Boost.Serialization problems in VC 7.1
by James Trotter 04 Jan '05

04 Jan '05

Hi, I'm trying to get the boost.serialization library to work, but I'm having some problems. I'm running VC 7.1, and I've tried both boost 1.32, and the latest CVS. I manage to compile and install the library, but when I try to compile and run the demo application that comes with it, I get a runtime error. It's compiling and linking perfectly, but at runtime I get a message box saying: "Unhandled exception at 0x7c59bbf3 in Test.exe: Microsoft C++ exception: __non_rtti_object @ 0x0012f8b0." Anyone had a problem like this before? Anyone know how to fix it?

2 1

thread::thread() in Windows
by Yuval Ronen 04 Jan '05

04 Jan '05

Hi. I believe that there is a bug in thread::thread() under Windows. The code uses GetCurrentThread() WinAPI function, but this is not enough. If you'll try to create such a thread object, and pass its reference to another thread which will join it - something like struct SomeThread { thread *m_thread; SomeThread(thread *a_thread) : m_thread(a_thread) { } void operator()() { do_some_work() m_thread->join(); delete m_thread; } }; { ...somewhere in the code... SomeThread st(new thread()); thread other_thread(st); } then it won't work. The following is a quote from MSDN about GetCurrentThread(): "The return value is a pseudo handle for the current thread... A pseudo handle is a special constant that is interpreted as the current thread handle... The function cannot be used by one thread to create a handle that can be used by other threads to refer to the first thread. The handle is always interpreted as referring to the thread that is using it. A thread can create a "real" handle to itself that can be used by other threads, or inherited by other processes, by specifying the pseudo handle as the source handle in a call to the DuplicateHandle function." The conclusion is that a call to DuplicateHandle() is needed after GetCurrentThread(). Thanks, Yuval

6 25

[MPL] map question
by David Greene 04 Jan '05

04 Jan '05

I'm not understanding something about the interaction of map with the algorithms. I've got a map whose value_type is another map. I'd like to iterate through the map entries and add all the "sub-map" entries to the "primary" map. I wrote a little testcase, attached below. When I compile it with g++ 3.3.3, I get this: boost-1_32/boost/mpl/pair.hpp: In instantiation of `boost::mpl::second<mpl_::_2>': fold2.cc:23: instantiated from `boost::mpl::value_type_impl<boost::mpl::aux::map_tag>::apply<map_types, mpl_::_2>' fold2.cc:23: instantiated from `boost::mpl::value_type<map_types, mpl_::_2>' fold2.cc:23: instantiated from here boost-1_32/boost/mpl/pair.hpp:56: error: no type named `second' in `struct mpl_::_2' fold2.cc:23: error: `types' is not a member of type ` boost::mpl::value_type<map_types, mpl_::_2>' fold2.cc:24: error: template argument 1 is invalid fold2.cc:24: error: ISO C++ forbids declaration of `type name' with no type boost-1_32/boost/mpl/aux_/preprocessed/gcc/fold_impl.hpp: In instantiation of `boost::mpl::apply_wrap2<int, map_types, boost::mpl::pair<key1, entry> >': boost-1_32/boost/mpl/aux_/preprocessed/gcc/fold_impl.hpp:49: instantiated from `boost::mpl::apply2<int, map_types, boost::mpl::pair<key1, entry> >' boost-1_32/boost/mpl/aux_/preprocessed/gcc/fold_impl.hpp:49: instantiated from `boost::mpl::aux::fold_impl<1, boost::mpl::m_iter<map_types, 2, 3>, boost::mpl::m_iter<map_types, 3, 3>, map_types, int>' boost-1_32/boost/mpl/fold.hpp:39: instantiated from `boost::mpl::fold<map_types, map_types, int>' fold2.cc:24: instantiated from here boost-1_32/boost/mpl/aux_/preprocessed/gcc/fold_impl.hpp:49: error: ` int' is not a class, struct, or union type boost-1_32/boost/mpl/aux_/preprocessed/gcc/fold_impl.hpp: In instantiation of `boost::mpl::aux::fold_impl<1, boost::mpl::m_iter<map_types, 2, 3>, boost::mpl::m_iter<map_types, 3, 3>, map_types, int>': boost-1_32/boost/mpl/fold.hpp:39: instantiated from `boost::mpl::fold<map_types, map_types, int>' fold2.cc:24: instantiated from here boost-1_32/boost/mpl/aux_/preprocessed/gcc/fold_impl.hpp:49: error: no type named `type' in `struct boost::mpl::apply2<int, map_types, boost::mpl::pair<key1, entry> >' boost-1_32/boost/mpl/aux_/preprocessed/gcc/fold_impl.hpp: In instantiation of `boost::mpl::aux::fold_impl<1, boost::mpl::m_iter<map_types, 2, 3>, boost::mpl::m_iter<map_types, 3, 3>, map_types, int>': boost-1_32/boost/mpl/fold.hpp:39: instantiated from `boost::mpl::fold<map_types, map_types, int>' fold2.cc:24: instantiated from here boost-1_32/boost/mpl/aux_/preprocessed/gcc/fold_impl.hpp:53: error: no type named `type' in `struct boost::mpl::apply2<int, map_types, boost::mpl::pair<key1, entry> >' boost-1_32/boost/mpl/fold.hpp: In instantiation of `boost::mpl::fold<map_types, map_types, int>': fold2.cc:24: instantiated from here boost-1_32/boost/mpl/fold.hpp:39: error: no type named `state' in `struct boost::mpl::aux::fold_impl<1, boost::mpl::m_iter<map_types, 2, 3>, boost::mpl::m_iter<map_types, 3, 3>, map_types, int>' fold2.cc:24: error: syntax error before `;' token fold2.cc:26: error: syntax error before `::' token An EDG-based compiler gives much the same error. What am I doing wrong? Much thanks for the help! -Dave #include <boost/mpl/fold.hpp> #include <boost/mpl/placeholders.hpp> #include <boost/mpl/copy.hpp> #include <boost/mpl/map.hpp> #include <boost/mpl/value_type.hpp> #include <boost/mpl/inserter.hpp> #include <boost/mpl/insert.hpp> #include <boost/mpl/pair.hpp> using namespace boost; using namespace boost::mpl; struct key1 {}; struct key2 {}; struct entry { typedef map<pair<key2, int> > types; }; typedef map<pair<key1, entry> > map_types; typedef fold<map_types, map_types, copy<value_type<map_types, _2>::types, inserter<_1, insert<_1, _2> > > >::type result; result::blah; // Get a printout

4 14

Serialization demo.
by Ken Perry 03 Jan '05

03 Jan '05

has anyone been able to get demo_xml.cpp to compile using mingw in either cygwin, msys, or just at the regular command line in XP pro? If you ahve what is the command line you used to compile it. I haven't been able to find a Jamfile or a Makefile for them so I have been trying to figure out the correct libraries to link with it and am having no luck. Ken

2 1

[Regex] How to match the "End of buffer"/"End of string"?
by jordi 03 Jan '05

03 Jan '05

Hi, I'm new in regex and this is my first post, so maybe the solution is obvious but I couldn't find it in google... I need to parse the multiline output of a command, every line ends with a \n except the last one, which actually it ends with the end of buffe ("\0" character). The output I need to parse is something like: "text1 this is a multiple-word text\n text2 another text" (the second line does not have a newline) As a result I want only two sub-expression in a line using a regex like: (\w+)\s+([^\n]+)\n The first submatch should be the first word ("text1" and "text2"), while the second submatch would be the rest of the line ("this is a multiple-word text" and "another text") In my program I use regex_search with the boost::match_continuous option, all the other regex objects are created with the default options. The first line matchs the regex expression without any problem but as the second line does not end with a "\n" it does not. I'm unable to find a good regex expression which can match the two possible "ends of line" (the \n or \0 character).. I've tried some expressions without success: 1.- First I tried to match \n || \0 using: (\w+)\s+([^\n\x00]+)([\n\x00]) but it seems the \x00 is not part of the buffer, so the second line does not match. 2.- Then I tried to use the "$" string without success (By the way, I assumed "$" would work as "\n" but it does not match the "end of line" character. When should I use??) 3.- In google I found that I should use "\z" or "\Z". I tried both, but they didn't work: The last line of the text never matches! (I suppose I need to add a new option to a regex object in order the "\z" o "\Z" strings to work) Finally I've found a workaround using the regex: (\w+)\s+([^\n]+)\n* and now it works but I would like to find a way to match the end of buffer/end of string. Any idea?? Thanks in advance, Jordi

2 2

Problems with regex lib and Codewarrior
by Steve Folly 02 Jan '05

02 Jan '05

Hi, I'm having a problem trying to compile the regex library for Codewarrior 9.3 on the Mac, for an x86 target. There wasn't a Codewarrior project so I created my own and included the source code under libs/regex/src, I'm creating a static library. 1.31.0 and 1.32.0 have the same problem: The problem is that for a Codewarrior x86 target (running on a Mac), boost configures it's BOOST_USE_FACET macro to be the standard conforming std::use_facet. Codewarrior's use_facet takes two parameters in this case. I added the two following #defines to the C++ Preprocessor preference panel: #define BOOST_NO_STD_USE_FACET #define BOOST_HAS_TWO_ARG_USE_FACET and it compiled. Is this the right fix? Should all that boost configuration stuff have spotted this set up and configured accordingly? Thanks for any help. -- Steve.

3 2

thread (1.32.0, vc 7.1) memory & resource leak
by Sergey Skorniakov 02 Jan '05

02 Jan '05

Hello, All! I have found that threadmon_mutex, created at line 29 in tss_hooks.cpp never destroyed. Is this the intention? Why it can not be deleted during DLL_PROCESS_DETACH? With best regards, Sergey.

2 1

iterator to std::list keeping boost::shared_ptr
by Ernst Murnleitner 02 Jan '05

02 Jan '05

Hello, I use boost::shared pointers and store them in a std::list. Now, I have some iterators which are stored in other classes. If items are inserted or deleted, the iterators become invalid. Is there a mechanism in the boost::libraries in order to update these iterators (e.g. iterators, containers)? Greetings Ernst -- ############################################### Against software patents: http://petition.eurolinux.org ###############################################

2 2

Boost build error in Cygwin
by Welson Sun 01 Jan '05

01 Jan '05

I downloaded boost_1_32_0.tar.bz2 and tried to build under Cgywin, here is the procedure: 1. Download latest Cygwin setup.exe (Version: 2.427) 2. Run setup.exe and download latest Cygwin distro from http://cygwin.get-software.com 3. Run setup.exe again to install the Cygwin 4. $ bjam -sTOOLS=gcc -sPYTHON_ROOT=/usr -sPYTHON_VERSION=2.4 --builddir=../boost_build install >& build.log Build result: ------------- ...found 11563 targets... ...updating 4329 targets... .. .. ...failed updating 16 targets... ...skipped 20 targets... ...updated 4293 targets... FAILURES: --------- ...failed gcc-Archive-action ../boost_build/bin/boost/libs/serialization/build/libboost_wserialization.a/ gcc/debug/libboost_wserialization-gcc-d-1_32.a... ...failed gcc-Archive-action ../boost_build/bin/boost/libs/serialization/build/libboost_wserialization.a/ gcc/debug/threading-multi/libboost_wserialization-gcc-mt-d-1_32.a... ...failed gcc-Archive-action ../boost_build/bin/boost/libs/serialization/build/libboost_wserialization.a/ gcc/release/libboost_wserialization-gcc-1_32.a... ...failed gcc-Archive-action ../boost_build/bin/boost/libs/serialization/build/libboost_wserialization.a/ gcc/release/threading-multi/libboost_wserialization-gcc-mt-1_32.a... ...failed Chmod1 ../boost_build/bin/boost/libs/test/build/libboost_prg_exec_monitor.dll/gcc/d ebug/libboost_prg_exec_monitor-gcc-d-1_32.dll... ...failed Chmod1 ../boost_build/bin/boost/libs/test/build/libboost_prg_exec_monitor.dll/gcc/d ebug/threading-multi/libboost_prg_exec_monitor-gcc-mt-d-1_32.dll... ...failed Chmod1 ../boost_build/bin/boost/libs/test/build/libboost_prg_exec_monitor.dll/gcc/r elease/libboost_prg_exec_monitor-gcc-1_32.dll... ...failed Chmod1 ../boost_build/bin/boost/libs/test/build/libboost_prg_exec_monitor.dll/gcc/r elease/threading-multi/libboost_prg_exec_monitor-gcc-mt-1_32.dll... ...failed Chmod1 ../boost_build/bin/boost/libs/test/build/libboost_test_exec_monitor.dll/gcc/ debug/libboost_test_exec_monitor-gcc-d-1_32.dll... ...failed Chmod1 ../boost_build/bin/boost/libs/test/build/libboost_test_exec_monitor.dll/gcc/ debug/threading-multi/libboost_test_exec_monitor-gcc-mt-d-1_32.dll... ...failed Chmod1 ../boost_build/bin/boost/libs/test/build/libboost_test_exec_monitor.dll/gcc/ release/libboost_test_exec_monitor-gcc-1_32.dll... ...failed Chmod1 ../boost_build/bin/boost/libs/test/build/libboost_test_exec_monitor.dll/gcc/ release/threading-multi/libboost_test_exec_monitor-gcc-mt-1_32.dll... ...failed Chmod1 ../boost_build/bin/boost/libs/test/build/libboost_unit_test_framework.dll/gc c/debug/libboost_unit_test_framework-gcc-d-1_32.dll... ...failed Chmod1 ../boost_build/bin/boost/libs/test/build/libboost_unit_test_framework.dll/gc c/debug/threading-multi/libboost_unit_test_framework-gcc-mt-d-1_32.dll... ...failed Chmod1 ../boost_build/bin/boost/libs/test/build/libboost_unit_test_framework.dll/gc c/release/libboost_unit_test_framework-gcc-1_32.dll... ...failed Chmod1 ../boost_build/bin/boost/libs/test/build/libboost_unit_test_framework.dll/gc c/release/threading-multi/libboost_unit_test_framework-gcc-mt-1_32.dll... ...failed updating 16 targets... SKIPPED: -------- ...skipped <@boost!lib>libboost_wserialization-gcc-d-1_32.a for lack of <@boost!libs!serialization!build/libboost_wserialization.a/gcc/debug>libboos t_wserialization-gcc-d-1_32.a... ...skipped <@boost!lib>libboost_wserialization-gcc-mt-d-1_32.a for lack of <@boost!libs!serialization!build/libboost_wserialization.a/gcc/debug/threadi ng-multi>libboost_wserialization-gcc-mt-d-1_32.a... ...skipped <@boost!lib>libboost_wserialization-gcc-1_32.a for lack of <@boost!libs!serialization!build/libboost_wserialization.a/gcc/release>libbo ost_wserialization-gcc-1_32.a... ...skipped <@boost!lib>libboost_wserialization-gcc-mt-1_32.a for lack of <@boost!libs!serialization!build/libboost_wserialization.a/gcc/release/threa ding-multi>libboost_wserialization-gcc-mt-1_32.a... ...skipped <@boost!lib>libboost_prg_exec_monitor-gcc-d-1_32.dll for lack of <@boost!libs!test!build/libboost_prg_exec_monitor.dll/gcc/debug>libboost_prg _exec_monitor-gcc-d-1_32.dll... ...skipped <@boost!lib>libboost_prg_exec_monitor-gcc-mt-d-1_32.dll for lack of <@boost!libs!test!build/libboost_prg_exec_monitor.dll/gcc/debug/threading-mu lti>libboost_prg_exec_monitor-gcc-mt-d-1_32.dll... ...skipped <@boost!lib>libboost_prg_exec_monitor-gcc-1_32.dll for lack of <@boost!libs!test!build/libboost_prg_exec_monitor.dll/gcc/release>libboost_p rg_exec_monitor-gcc-1_32.dll... ...skipped <@boost!lib>libboost_prg_exec_monitor-gcc-mt-1_32.dll for lack of <@boost!libs!test!build/libboost_prg_exec_monitor.dll/gcc/release/threading- multi>libboost_prg_exec_monitor-gcc-mt-1_32.dll... ...skipped <@boost!lib>libboost_test_exec_monitor-gcc-d-1_32.dll for lack of <@boost!libs!test!build/libboost_test_exec_monitor.dll/gcc/debug>libboost_te st_exec_monitor-gcc-d-1_32.dll... ...skipped <@boost!lib>libboost_test_exec_monitor-gcc-mt-d-1_32.dll for lack of <@boost!libs!test!build/libboost_test_exec_monitor.dll/gcc/debug/threading-m ulti>libboost_test_exec_monitor-gcc-mt-d-1_32.dll... ...skipped <@boost!lib>libboost_test_exec_monitor-gcc-1_32.dll for lack of <@boost!libs!test!build/libboost_test_exec_monitor.dll/gcc/release>libboost_ test_exec_monitor-gcc-1_32.dll... ...skipped <@boost!lib>libboost_test_exec_monitor-gcc-mt-1_32.dll for lack of <@boost!libs!test!build/libboost_test_exec_monitor.dll/gcc/release/threading -multi>libboost_test_exec_monitor-gcc-mt-1_32.dll... ...skipped <@boost!lib>libboost_unit_test_framework-gcc-d-1_32.dll for lack of <@boost!libs!test!build/libboost_unit_test_framework.dll/gcc/debug>libboost_ unit_test_framework-gcc-d-1_32.dll... ...skipped <@boost!lib>libboost_unit_test_framework-gcc-mt-d-1_32.dll for lack of <@boost!libs!test!build/libboost_unit_test_framework.dll/gcc/debug/threading -multi>libboost_unit_test_framework-gcc-mt-d-1_32.dll... ...skipped <@boost!lib>libboost_unit_test_framework-gcc-1_32.dll for lack of <@boost!libs!test!build/libboost_unit_test_framework.dll/gcc/release>libboos t_unit_test_framework-gcc-1_32.dll... ...skipped <@boost!lib>libboost_unit_test_framework-gcc-mt-1_32.dll for lack of <@boost!libs!test!build/libboost_unit_test_framework.dll/gcc/release/threadi ng-multi>libboost_unit_test_framework-gcc-mt-1_32.dll... ...skipped <@boost!lib>libboost_wserialization-gcc-d.a for lack of <@boost!lib>libboost_wserialization-gcc-d-1_32.a... ...skipped <@boost!lib>libboost_wserialization-gcc-mt-d.a for lack of <@boost!lib>libboost_wserialization-gcc-mt-d-1_32.a... ...skipped <@boost!lib>libboost_wserialization-gcc.a for lack of <@boost!lib>libboost_wserialization-gcc-1_32.a... ...skipped <@boost!lib>libboost_wserialization-gcc-mt.a for lack of <@boost!lib>libboost_wserialization-gcc-mt-1_32.a... ...skipped 20 targets... Looks like the failures is not important, but I am just wondering what is the cause of these problems. Welson Sun

3 2

Memory leak while compiling boost
by Martin Gebert 31 Dec '04

31 Dec '04

Hi! I tried to compile the boost lib from source with $ bjam "-sTOOLS=gcc" but while compiling the process "cc1plus" tends to consume memory quite fast, finally bringing the machine to a halt. Environment: SuSE 8.2, Kernel 2.4.20, all updates gcc (GCC) 3.3 20030226 (prerelease) (SuSE Linux) boost-jam 3.1.10 (also made from source) boost 1.32.0 My fault or a boost/bjam problem? Thanks in advance! Martin

2 5

boost graph gives compile error on VC++ 7.1
by gast 128 31 Dec '04

31 Dec '04

Dear all It's already posted, but there was not a really good answer. If you take from boost graph 'examples/file_dependencies.cpp' and strip down some code, but change the graph type to: typedef adjacency_list<listS, listS, directedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, int> > Graph; Graph g; default_dfs_visitor vis; depth_first_search(g, visitor(vis)); It gives C2678 on VC++ 7.1. Does anyone know what's wrong/possible work around? Wkr me _________________________________________________________________ MSN Search, for accurate results! http://search.msn.nl

3 2

boost::regex partial matches
by L.P. Mergen 31 Dec '04

31 Dec '04

Hello, I apologise in advance if this question is not direct to the right mailinglist, but this was the best I could find. The IRC channel also seems very quite... :) I am currently experimenting with the boost::regex library, and so far it seems to do just the thing I need. However, when I have a regex "[0-9]+[a-zA-Z]+" And want to match this against the string "42foo 42bar" It returns false. This is (as far as I can see) due to the library not taking partial matches too, even when I set the boost::match_partial and boost::match_any flags (which, according to my interpretation, should be doing the trick). Here is my statement: bool success = boost::regex_match(subject->c_str(), returns, expression, boost::match_partial | boost::match_any); I hope anyone has an idea what might be the problem here. Thanks in advance! :) Grt, Leon Mergen

5 5