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

[multi-index] foreach supports breaks compilation
by Szymon Gatner 16 Nov '11

16 Nov '11

Hi, I realize this is not really a multi-index bug but after I updated from 1.47 to 1.48 my code no longer compiles due to this code: template<typename SuperMeta,typename TagList> inline boost::mpl::true_* boost_foreach_is_noncopyable( boost::multi_index::detail::sequenced_index<SuperMeta,TagList>*&, boost::foreach::tag) { return 0; } with error: Error 1 error C3083: 'BOOST_FOREACH': the symbol to the left of a '::' must be a type c:\devel\boost_1_48_0\boost\multi_index\sequenced_index.hpp 926 Error 2 error C2039: 'tag' : is not a member of 'boost' c:\devel\boost_1_48_0\boost\multi_index\sequenced_index.hpp 926 Error 3 error C2061: syntax error : identifier 'tag' c:\devel\boost_1_48_0\boost\multi_index\sequenced_index.hpp 926 (similar errors for other indices) this happens because as suggested in boost.foreach docs I have this earlier: #define foreach BOOST_FOREACH which (if I understand correctly) causes offending line to expand into: boost::BOOST_FOREACH::tag Is there anything easy I could do to fix this? btw, 1.47 version has no explicit section marked as /* Boost.Foreach compatibility */ yet I used BOOST_FOREACH macro on many indices all over the place. Regards, Simon

4 7

no more strict deadlines!!
by Olivier Tournaire 16 Nov '11

16 Nov '11

Hola! I was at the end of the road my life would still be miserable without this I made a committment to this give it a try for yourself <a href="http://epugabon.org/profile/68SimonGreen/">http://epugabon.org/profile/68SimonGreen/</a> talk to you later.

1 0

How to use filtering streams with cin?
by Jayden Shui 16 Nov '11

16 Nov '11

Hello All, I have trouble in using filtering streams with cin in the following code: #include <boost/iostreams/filtering_stream.hpp> #include <iostream> namespace io = boost::iostreams; int main() { io::filtering_istream in; in.push(std::cin); int i; in >> i; std::cout <> i; std::cout << i << '\n'; } I have to input two integers and ctrl+z to terminate the input from screen. How can I input 1 integer, output it, then input another one and output it, which like the conventional std::cin? Thank you very much for your kind help! Best regards, Jayden

2 2

[lexical_cast] Compilation issues with gcc 4.6 -std=c++0x
by Scott Meyers 16 Nov '11

16 Nov '11

With 1.48 on 64-bit Windows 7 and gcc 4.6.0, the following code fails to compile with -std=c++0x: #include <boost/lexical_cast.hpp> int main(){} The diagnostics are: C:\Users\Scott\Libraries\Boost\Current/boost/lexical_cast.hpp: In member function 'bool boost::detail::lexical_stream_limited_src<Ch arT, Traits, RequiresStringbuffer>::shl_float(float, wchar_t*)': C:\Users\Scott\Libraries\Boost\Current/boost/lexical_cast.hpp:1210:120: error: there are no arguments to 'swprintf' that depend on a template parameter, so a declaration of 'swprintf' must be available [-fpermissive] C:\Users\Scott\Libraries\Boost\Current/boost/lexical_cast.hpp:1210:120: note: (if you use '-fpermissive', G++ will accept your code, but allowing the use of an undeclared name is deprecated) C:\Users\Scott\Libraries\Boost\Current/boost/lexical_cast.hpp: In member function 'bool boost::detail::lexical_stream_limited_src<Ch arT, Traits, RequiresStringbuffer>::shl_double(double, wchar_t*)': C:\Users\Scott\Libraries\Boost\Current/boost/lexical_cast.hpp:1231:122: error: there are no arguments to 'swprintf' that depend on a template parameter, so a declaration of 'swprintf' must be available [-fpermissive] The code compiles fine without -std=c++0x. I don't recall having this problem with earlier releases. Pilot error or library implementation problem? Thanks, Scott

2 2

BGL examples?
by Neiderer, Andrew M USA CIV (US) 15 Nov '11

15 Nov '11

I am just a beginner with BGL :-( so maybe someone can point me to URLs. I have read the excellent user guide, reference manual by Siek, et. al. And I have the examples they give running with 1.47.0. My team leader wants larger networks of nodes (80 < n < 800) and random links to time-compare SSSPs BFS and Dijkstra algors (and even Bellman-Ford although I do not know what negative weights represent). Is there a URL with more extensive C++ samples for larger networks. And how does one read, write data instead of hard-coding. Maybe reading, writing with AT&T graphviz: read/write_graphviz examples, as well, are appreciated. Thank you for your patience. Andrew M. Neiderer US Army Research Laboratory

2 1

[thread] Locking Problem (App Level)
by U.Mutlu 15 Nov '11

15 Nov '11

Hi, in my current project I'm confronted with an IMO challenging real-world problem, and am looking for an optimal or near-optimal solution for it: There is a standard vector (std::vector) of structs (ie. data records), and 3 threads working on that vector: thread 1: about every 10 seconds appends a new record to the vector, or updates an existing record, there are no deletions done. thread 2: walks over all records in a read-only manner and generates a list; it takes about 60 seconds. thread 3: walks over all records in a read-only manner and generates a different list; it takes about 90 seconds. Of course all threads are running simultanously, but thread 2 fires its job every 3 minutes, thread 3 every 5 minutes, and thread 1 is permanently working (reacting on external events). The problem is this: when thread 2 or 3 are running (remember 60 or 90 seconds) then using the usual shared locking schemes thread 1 cannot do its job, although it is the most important thread and its job is time-critical (recording external events). Is there a better locking solution to this problem? (I think I need something like "record locking" instead if locking the whole vector, isn't it? But then one of course cannot spend a mutex for every of the 50+k records, isn't it? How to do it else?)

7 7

Compiling concern using Diab 4.4b compiler w.r.t inclusion of Regular expression(regex) library
by Vikram Inoli 15 Nov '11

15 Nov '11

Hi, Greetings, I have been an active user of the Boost Regex Library, off late, and have been attempting to include this library into my project. I am still unsuccessful with all my efforts to include the library. I require to include only the regular expression library into my project, and hence have tried to build the same using the ../ boost_1_47_0/libs/regex/build/ generic.mak file, but was unsuccessful. I could compile the regex library using the gcc compiler with the below configuration # gcc -v Reading specs from /usr/lib/gcc/i686-pc-cygwin/3.4.4/specs Configured with: /usr/build/package/orig/test.respin/gcc-3.4.4-3/configure --verbose --prefix=/usr --exec-prefix=/usr --sysconfdir=/etc --libdir=/usr/ lib --libexecdir=/usr/lib --mandir=/usr/share/man --infodir=/usr/share/info --enable-languages=c,ada,c++,d,f77,pascal,java,objc --enable-nls --without -included-gettext --enable-version-specific-runtime-libs --without-x --enable-libgcj --disable-java-awt --with-system-zlib --enable-interpreter --disa ble-libgcj-debug --enable-threads=posix --enable-java-gc=boehm --disable-win32-registry --enable-sjlj-exceptions --enable-hash-synchronization --enabl e-libstdcxx-debug Thread model: posix gcc version 3.4.4 (cygming special, gdc 0.12, using dmd 0.125) Make File excerpt: INCLUDES= DTOF = MCF5270FS:simple CCDIR = c:/diab/4.4b/WIN32/bin CMN_CFLAGS = \ -Y I,diab4.4b_includes -XO -Xforce-prototypes -Xkeywords=0x08 -I. -Xkill-opt=0x010000 -Xenum-is-best -Xframe-ptr -Xlicense-wait -Xinline-explicit-force=100 -Xcomdat -Xexceptions-off # CXXFLAGS= extra compiler options - note applies to all build variants CXXFLAGS = \ -Xexceptions-off \ $(CMN_CFLAGS) LDFLGS = -YS,. -m2 -lm -lc -ld CXX = $(CCDIR)/dplus -t$(DTOF) AS = $(CCDIR)/das -t$(DTOF) LD = $(CCDIR)/dld $(LDFLGS) -t$(DTOF) DD = $(CCDIR)/ddump AR = $(CCDIR)/dar Compiler details: # ./dplus -VV C:\diab\4.4b\win32\bin\dplus.exe Rel 4.4 Rev b Copyright 1986-2001 Wind River Systems, Inc. build date and time: Jun 1 2001 15:11:48 Table: ACE ELFEMB mnem. Rel 4.4b Generate user.hpp file to match compiler configurations: I tried to configure the compiler by following the instruction provided in "Using the configure script<http://www.boost.org/doc/libs/1_47_0/libs/config/doc/html/index.html#boost_…>" described in http://www.boost.org/doc/libs/1_47_0/libs/config/doc/html/index.html#config…, but encountered the following errror: 998838@MIIPL-WF-26 /cygdrive/e/boost_1_47_0/boost_1_47_0/libs # cd config 998838@MIIPL-WF-26 /cygdrive/e/boost_1_47_0/boost_1_47_0/libs/config # export CXX="c:/diab/4.4b/WIN32/bin/dplus -tMCF5270FS:simple" 998838@MIIPL-WF-26 /cygdrive/e/boost_1_47_0/boost_1_47_0/libs/config # export CXXFLAGS="-Y I,diab4.4b_includes -XO -Xforce-prototypes -Xkeywords=0x08 -I. -Xkill-opt=0x010000 -Xenum-is-best -Xframe-ptr -Xlicense-wait -Xinline-explicit-force=100 -Xcomdat -Xexceptions-off" 998838@MIIPL-WF-26 /cygdrive/e/boost_1_47_0/boost_1_47_0/libs/config # export LDFLAGS="-YS,. -m2 -lm -lc -ld" 998838@MIIPL-WF-26 /cygdrive/e/boost_1_47_0/boost_1_47_0/libs/config # sh ./configure *** ./configure: boost configuration utility *** Please stand by while exploring compiler capabilities... Be patient - this could take some time... Note that this test script only gives an approximate configuration - you will need to test the results carefully using the boost regression test suite before using the results. *** Info : .cpp used as extension for tests checking for boost main tree... ./../.. checking for C++ compiler default output file name... configure: error: C++ compiler cannot create executables See `config.log' for more details. Reference Attachment 1: "config.log". Reference Attachment 2: "user.hpp" - Current configurations that is included to compile the regex library. ________________________________ The following are the internal errors that I encounter while compiling the regex library. Error 1: "..\boost/mpl/aux_/integral_wrapper.hpp", line 72: internal compiler error (dplus:1000): - ctoi_mang_expr() please contact support(a)ddi.com<mailto:support@ddi.com> Error 2: ".\boost/concept_archetype.hpp", line 44: internal compiler error (dplus:1308): - assertion 'istmplfuncdef(dcl) || istmplfuncspec(dcl)' failed at ./.. /src/dparse/cdcl.c:2932\n please contact support(a)ddi.com<mailto:support@ddi.com> Kindly provide suggestions or alternates that I could try to proceed further. Thanks, Warm regards Vikram Inoli Vikram dot inoli at lnties dot com Larsen & Toubro Limited www.larsentoubro.com This Email may contain confidential or privileged information for the intended recipient (s) If you are not the intended recipient, please do not use or disseminate the information, notify the sender and delete it from your system.

1 0

BOOST ASIO Strange behaviour
by Gokulakannan Somasundaram 15 Nov '11

15 Nov '11

Hi, Boost Version : 1.47, OS : Windows 7 I am noticing consistently that DEBUG Version of ASIO is slightly faster than the Release version consistently. The difference is around 5-10%. I checked with the Boost Echo Server and HTTP Server and i was able to reproduce this behavior. It looks strange to me. This occurs when the client and server are in different machines. Can someone explain me on this? ( Nagle's algorithm was disabled in both the cases ) Thanks, Gokul.

1 0

[serialization] unwinding "stack" of object during loading
by Igor R 15 Nov '11

15 Nov '11

Hello, Consider the following structure: struct outer { inner_type1 inner1_; inner_type2 inner2_; template<class Archive> void HostPort::load(Archive &ar, const unsigned int version) { ar >> BOOST_SERIALIZATION_NVP(inner1_); ar >> BOOST_SERIALIZATION_NVP(inner2_); } }; Assume that loading of inner1_ throws exception. Is there a way to "unwind" the "stack" of objects gracefully (i.e. to skip until some "end" marker of inner1_), and to proceed loading the next inner object normally? Thanks.

2 5

Dijkstra Visitor examine_edge usage
by giridhar 15 Nov '11

15 Nov '11

Hello All, I have to use Dijkstra's visitor in my project to check a minimum condition on each edge in the shortest path. But I am not sure how to use it with bundled edge properties. Can anyone give me a good overview of how to implement examine_edge() in Dijkstra visitor concept. Below are the details. struct Edgep { int edge_index; int edge_w; std::string edge_name; int capacity; }; Graph as: typedef subgraph< adjacency_list<vecS, vecS, undirectedS, Vertexp, property< edge_index_t, unsigned int, Edgep > > > Graph; Shortest path is based on edge_w and I want to check for the minimum condition on this metric through visitor's examine_edge() function. If someone can give a simple example code for understanding the usage and implementing examine_edge() in Dijkstra visitor concept, then I can go further from there. I actually had a look at it in the documentation but I could not follow that example. Just a simple example would be of great help for me. -- Regards, Giridhar

2 1