- Boost - lists.boost.org

[build/regression testing] runtime failures
by Gennadiy Rozental 24 Mar '05

24 Mar '05

Is there any way to see a run command in case test fails at runtime? The same as we could see compiler command line if it fails at compile time Gennadiy

3 3

[Boost-bugs] [ boost-Bugs-1170106 ] Investigate other kinds of heaps for dijkstra_shortest_paths
by SourceForge.net 24 Mar '05

24 Mar '05

Bugs item #1170106, was opened at 2005-03-24 14:35 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1170106&group_… Category: graph Group: None Status: Open Resolution: None Priority: 5 Submitted By: Douglas Gregor (dgregor) Assigned to: Douglas Gregor (dgregor) Summary: Investigate other kinds of heaps for dijkstra_shortest_paths Initial Comment: There are many types of heaps that provide good theoretical performance when used as a priority queue, e.g., by Dijkstra's shortest paths algorithm. The BGL contains implementations of two such data structures: a binary heap and a relaxed heap. The latter is used because it has been shown to provide the best overall performance. However, we should investigate other kinds of heaps, e.g., Fibonacci heaps, relaxed Fibonacci heaps, and run-relaxed heaps, to determine which option is best for the BGL. Dietmar Kuhl implemented several kinds of heaps in his Heaps library, which could be found in earlier versions of Boost. It was removed from Boost in the 1.27.0 timeframe because it had never been reviewed and was not maintained, but may still prove valuable for experiments. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1170106&group_… ------------------------------------------------------- SF email is sponsored by - The IT Product Guide Read honest & candid reviews on hundreds of IT Products from real users. Discover which products truly live up to the hype. Start reading now. http://ads.osdn.com/?ad_id=6595&alloc_id=14396&op=click _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[function] is function_equal used?
by Peter Dimov 24 Mar '05

24 Mar '05

The documentation says that comparisons require EqualityComparable, and contains_test never tests with objects that define function_equal instead of operator==. Also, there seems to be no test for boost::bind objects being put in a function<> (although there is one for lambda::bind). The reason I'm posting this is that I just switched boost::bind to implement function_equal instead of operator==, and this functionality isn't covered by our current tests. -- Peter Dimov http://www.pdimov.com

2 3

[xpressive] doc bug?
by Thorsten Ottosen 24 Mar '05

24 Mar '05

The xpressive docs say sregex rex = sregex::compile( "(\\w+) (\\w+)!" ); can be expressed as sregex rex = (s1= +_w) >> ' ' >> (s2= +_w) >> '!'; . Shouldn't this be sregex rex = +_w >> ' ' >> +_w >> '!'; since you don't need to refer to previous matches? Thanks -Thorsten -- Thorsten Ottosen ---------------------------- www.dezide.com http://www.cs.aau.dk/index2.php?content=Research/mi www.boost.org www.open-std.org/JTC1/SC22/WG21/

2 1

Naming Proposed Libraries
by David Abrahams 24 Mar '05

24 Mar '05

When discussing libraries in public that are under development but not yet accepted into Boost, I think it's problematic to refer to "The Boost <whatever> library" or "Boost.<whatever>" without qualification. Our peer-review process is respected, and these libraries are not yet officially blessed by Boost. I don't want to dilute the value of Boost acceptance. Can we please make a habit of prepending "The proposed" or something similar? For example, I suggest "The proposed Boost Interfaces library." Thanks! P.S. I hope it's obvious, but I don't think the documentation for the proposed library ought to resort to such contortions. -- Dave Abrahams Boost Consulting www.boost-consulting.com

11 39

Does this algorithm exist?
by Michael Goldshteyn 24 Mar '05

24 Mar '05

Given: typedef std::deque<char> DequeString; std::string s("Hello sweet world!"); std::string word("sweet"); DequeString dequeString; // Copy "Hello sweet world!" into the deque string std::copy(s.begin(),s.end(),std::back_inserter(dequeString)); // Now, I want to find where "sweet" appears in the dequeString. An iterator to its location would be fine. // This doesn't quite do it, since it looks for _any_ occurrence of a character from word in dequeString std::find_first_of(dequeString.begin(),dequeString.end(),word.begin(),word.end()); // But, I want to find where _the whole_ word occurs in dequeString, similar to how std::string::find() does it: std::string::size_type wordPos=s.find(word); Is there something in boost or the standard C++ lib that can be used? Thanks, Michael Goldshteyn

4 4

[type_traits] is_convertible regression on GCC 3.2 and 3.3
by Jonathan Turkanis 24 Mar '05

24 Mar '05

Hi, The following code causes a static assertion failure on GCC 3.2 (MinGW): #include <boost/static_assert.hpp> #include <boost/type_traits/is_convertible.hpp> struct base { }; struct middle : virtual base { }; struct derived : middle { }; BOOST_STATIC_ASSERT((boost::is_convertible<derived, middle>::value)); This problem is apparently responsible for the current failure of all the iostreams tests on the platforms gcc-3.2.3 and gcc-3.3.5. Jonathan

2 2

Re: Asynchronous I/O
by Hans Malherbe 24 Mar '05

24 Mar '05

Don G skryf: >That makes sense, and I have used that feature before. The hard part >about putting this technique to use in a library is that it makes >requirements on the behavior of main: it must be in an alertable >wait. If I recall correctly, GetMessage/PeekMessage are not >alertable. I like the way the ACE library handles this. You have a choice of two architectural patterns: Reactor and proactor. Reactor makes your service "reactive" by serially demultiplexing events synchronously (Proactor has mutliple threads ready to do work). To start handling events you call "handle_events". You don't really care if the call puts your thread in an alertable wait or not. That would depend on whether the reactor uses the Select_Reactor or WFMO_Reactor implementation. These patterns nicely decouple event demuxing and dispatching from all the other processing. Hugo Duncan's Giallo project uses them also. Groete Hans

2 1

Re: Asynchronous I/O
by Don G 24 Mar '05

24 Mar '05

Hi Scott, > For me there needs to be definition at this level; formalization > of concepts. With that kind of thing in place its possible that > we might one day write (async) code that moves without change > from sockets to files. Its what might keep the tech-talk on track. I agree. All the technical details we tend to focus on should be just implementation detail. Another way to say it: we should look at the interface first. > > Or am I in the wrong thread? No, this is the one. Well, at least if it isn't we're both in the wrong thread! :) That being said, I'm going to start a new thread here because the "I/O" part I think is misleading. Best, Don __________________________________ Do you Yahoo!? Yahoo! Small Business - Try our new resources site! http://smallbusiness.yahoo.com/resources/

1 0

[test] linking problems with boost-1.32.0-5.fc3.i386.rpm
by Maxim Yegorushkin 24 Mar '05

24 Mar '05

Hi, I upgraded today to boost-1.32.0-5.fc3.i386.rpm and my projects stoped linking complaining about libboost_unit_test_framework.so: undefined reference to `init_unit_test_suite(int, char**)'. I'm not a linker expert but it seems like libboost_unit_test_framework library does not have a weak symbol init_unit_test_suite anymore. I had to rollback to boost-1.32.0-3.i386.rpm. I'd like to know is that my problem or ...? Here are the details: [max@my text-rpc]$ rpm -qa | grep boost boost-1.32.0-5.fc3 boost-devel-1.32.0-5.fc3 [max@my text-rpc]$ scons -c scons: Reading SConscript files ... scons: done reading SConscript files. scons: Cleaning targets ... ... scons: done cleaning targets. [max@my text-rpc]$ scons scons: Reading SConscript files ... scons: done reading SConscript files. scons: Building targets ... ... g++ -o bin/maind obj/debug/text_rpc.o obj/debug/bison_parser.o obj/debug/parser_callback.o obj/debug/pdu.yy.o obj/debug/pdu.ll.o obj/debug/main.o -lboost_unit_test_framework /usr/lib/gcc/i386-redhat-linux/3.4.2/../../../libboost_unit_test_framework.so: undefined reference to `init_unit_test_suite(int, char**)' Collect2: ld returned 1 exit status scons: *** [bin/maind] Error 1 scons: building terminated because of errors. [max@my text-rpc]$ sudo rpm -e $(rpm -qa | grep boost) [max@my text-rpc]$ rpm -qa | grep boost [max@my text-rpc]$ ls ~/downloads/boost-* /home/max/downloads/boost-1.32.0-3.i386.rpm /home/max/downloads/boost-devel-1.32.0-3.i386.rpm [max@my text-rpc]$ sudo rpm -Uvh ~/downloads/boost* warning: /home/max/downloads/boost-1.32.0-3.i386.rpm: V3 DSA signature: NOKEY, key ID 30c9ecf8 Preparing... ########################################### [100%] 1:boost ########################################### [ 50%] 2:boost-devel ########################################### [100%] [max@my text-rpc]$ rpm -qa | grep boost boost-1.32.0-3 boost-devel-1.32.0-3 [max@my text-rpc]$ scons scons: Reading SConscript files ... scons: done reading SConscript files. scons: Building targets ... g++ -o bin/maind obj/debug/text_rpc.o obj/debug/bison_parser.o obj/debug/parser_callback.o obj/debug/pdu.yy.o obj/debug/pdu.ll.o obj/debug/main.o -lboost_unit_test_framework g++ -fmessage-length=0 -Wall -Wextra -ggdb -Iinclude -c -o obj/debug/unit_test.o src/unit_test.cpp g++ -o bin/unit_testd obj/debug/text_rpc.o obj/debug/bison_parser.o obj/debug/parser_callback.o obj/debug/pdu.yy.o obj/debug/pdu.ll.o obj/debug/unit_test.o -lboost_unit_test_framework ar r lib/libtext_rpcd.a obj/debug/text_rpc.o obj/debug/bison_parser.o obj/debug/parser_callback.o obj/debug/pdu.yy.o obj/debug/pdu.ll.o ranlib lib/libtext_rpcd.a ar: creating lib/libtext_rpcd.a scons: done building targets. -- Maxim Yegorushkin

2 2