- Boost - lists.preview.boost.org

Boost Mingw w64 compilation issues and fixes
by Andrew Ho 19 Jul '13

19 Jul '13

Hi, I've been working on getting Boost to compile properly with Mingw w64 on Windows x64 (specifically, Mingw w64 with GCC 4.8.1 rev 2/Windows threads, http://sourceforge.net/projects/mingwbuilds/files/host- windows/releases/4.8.1/64-bit/threads-win32/seh/). Link to trac bug reports/patches: Boost config/Boost thread: https://svn.boost.org/trac/boost/ticket/8817 I believe this fix works with all target platforms, though I can't test with Windows CE to verify that it works. At least works with VS2012 and Mingw w64. Boost Python: https://svn.boost.org/trac/boost/ticket/8818 This fix again works with VS2012 and Mingw w64. It moves an #undef hypot directive (which python.h unfortunately uses) to be used any time python.h decides it needs to define it. I don't know if any platforms/compilers rely on having hypot being defined as a macro. Doesn't link for me because I think the official Windows Python release is built with VS, I'll need to find/build Python with Mingw w64 to see if it works. Boost Log: https://svn.boost.org/trac/boost/ticket/8819 (apparently has already been reported as https://svn.boost.org/trac/boost/ticket/8786) Boost Math: TBD There is some compile error with Boost Math which is causing my compiler to crash. I don't know if this is on the Boost Math side, or is a bug with Mingw w64. I'll submit a bug report and possibly a patch when I have a bit more time to dig into the issue. I think these are the main outstanding issues with getting Boost to compile with Mingw w64 on x64 Windows. I was able to get everything else to compile smoothly with Mingw w64 and VS2012 (targeting x64).

3 9

invalid "this is an old version of boost" links
by Mathieu Champlon 19 Jul '13

19 Jul '13

Hi, All the links at the top of documentation pages for previous versions of boost seem to have suddenly become invalid as they all link to http://www.boost.org/doc/libs/ For instance see http://www.boost.org/doc/libs/1_48_0/libs/config/doc/html/boost_config/boos… I cannot remember when I first noticed it, maybe a couple of weeks ago. Cheers, MAT.

2 1

[serialization][static_assert] Moving BOOST_STATIC_WARNING to Boost.StaticAssert?
by Petr Machata 19 Jul '13

19 Jul '13

Hi there, do you think it would make sense to move static_warning.hpp from boost/serialization up directly under boost/, and perhaps move it conceptually under Boost.StaticAssert umbrella? It seems strange how a serialization library exposes such general-purpose service. We could still provide a forwarding header in Serialization namespace for backward compatibility. Shall I prepare a patch to that effect? Thanks, PM

2 3

[git] creating symlinks in the git layout
by Beman Dawes 19 Jul '13

19 Jul '13

Steven added "Initial supprort for creating symlinks in the git layout" in changeset 84524. How is this support used? Is it working reliably? Thanks, --Beman

2 2

[bitstream] Copy stream buffer or pass pointer?
by Paul Long 18 Jul '13

18 Jul '13

While working on a bitstream library I proposed a while back (http://article.gmane.org/gmane.comp.lib.boost.devel/242574) I came across a design decision for which I'd like to get some feedback. The proposed bitstream library (https://github.com/dplong/bitstream) mimics the std::stringstream class hierarchy and semantics as close as possible. In general, when the consumer of the std::stringstream/stringbuf classes provides a string for the stream buffer, a copy gets made; likewise, when it retrieves the stream buffer, it gets a copy of the string. For example, the following snippet prints "hello, goodbye". char c[BUFSIZ] = "hello"; istringstream iss(c); strcpy(c, "goodbye"); cout << iss.str() << ", " << c; However, the library I'm working on doesn't copy. Instead, pointers are passed in and out. So, for example, this code prints "goodbye, goodbye". char c[BUFSIZ] = "hello"; ibitstream ibs(c); strcpy(c, "goodbye"); cout << ibs.data() << ", " << c; I don't think either way is more correct than the other. The reason I don't copy is for memory and CPU performance, thinking that the streams a bit-stream library typically processes are larger than the streams that a string-stream library processes and are more time critical. I very well may be mistaken, though. Anyway, what do you people think? Copy or don't copy? Maybe I should do copies just to follow the semantics of std::stringstream. Oh, also, am I being presumptuous by including "[bitstream]" in the Subject header of this post since it's just a _proposed_ library? IOW, should I stop doing that? Paul

3 3

[build] bootstrap.sh is triply broken on MinGW
by Stephan T. Lavavej 18 Jul '13

18 Jul '13

Hi, For over a year I've been suffering from bootstrap.sh being broken on MinGW, although I figured out a horrible hackaround. In 1.54.0 two more breaks appeared, and I figured out real fixes for them. I'd like to offer my real fixes here, and request two things: (A) a real fix to replace my horrible hackaround for the original bug, and (B) bootstrap.sh to be tested on MinGW for each release, because it's clearly not receiving sufficient coverage. The first break appears to be tracked by https://svn.boost.org/trac/boost/ticket/5680 and https://svn.boost.org/trac/boost/ticket/6350 . The problem is that bootstrap.sh and b2.exe don't agree on what MinGW should be called: is it mingw or is it gcc? No permutations of toolsets passed on the command lines work. I've used the following horrible hackaround in 1.49.0 through 1.54.0 inclusive: diff -aurN boost_1_54_0/bootstrap.sh boost_1_54_0-fixed/bootstrap.sh --- boost_1_54_0/bootstrap.sh 2013-03-09 14:55:05 -0800 +++ boost_1_54_0-fixed/bootstrap.sh 2013-07-18 00:12:38 -0700 @@ -215,7 +215,7 @@ if test "x$BJAM" = x; then echo -n "Building Boost.Build engine with toolset $TOOLSET... " pwd=`pwd` - (cd "$my_dir/tools/build/v2/engine" && ./build.sh "$TOOLSET") > bootstrap.log 2>&1 + (cd "$my_dir/tools/build/v2/engine" && ./build.sh mingw) > bootstrap.log 2>&1 if [ $? -ne 0 ]; then echo echo "Failed to build Boost.Build build engine" Of course, this is completely unacceptable for other toolsets, but I basically know nothing about Boost's build machinery, so I can't figure out a real fix. Ideally, bootstrap.sh followed by b2.exe would work automatically, without toolsets being specified. However, I would still be extremely happy if it worked with manually specified toolsets, as long as I didn't have to patch or sed files. The second and third breaks are new to 1.54.0 and are tracked by https://svn.boost.org/trac/boost/ticket/8762 . Here are my fixes that should work for all platforms: diff -aurN boost_1_54_0/tools/build/v2/engine/build.jam boost_1_54_0-fixed/tools/build/v2/engine/build.jam --- boost_1_54_0/tools/build/v2/engine/build.jam 2013-05-20 21:14:18 -0700 +++ boost_1_54_0-fixed/tools/build/v2/engine/build.jam 2013-07-18 00:12:43 -0700 @@ -483,8 +483,8 @@ make.c make1.c mem.c object.c option.c output.c parse.c pathsys.c regexp.c rules.c scan.c search.c subst.c w32_getreg.c timestamp.c variable.c modules.c strings.c filesys.c builtins.c class.c cwd.c native.c md5.c - modules/set.c modules/path.c modules/regex.c modules/property-set.c - modules/sequence.c modules/order.c ; + [ .path modules set.c ] [ .path modules path.c ] [ .path modules regex.c ] + [ .path modules property-set.c ] [ .path modules sequence.c ] [ .path modules order.c ] ; if $(OS) = NT { jam.source += execnt.c filent.c pathnt.c ; It appears that build.jam needs to use this .path machinery to generate either forward slashes or backslashes. When forward slashes are literally used, the bootstrap complains that it doesn't know how to make the corresponding object files. Once this is fixed, the final break is revealed: diff -aurN boost_1_54_0/tools/build/v2/engine/build.sh boost_1_54_0-fixed/tools/build/v2/engine/build.sh --- boost_1_54_0/tools/build/v2/engine/build.sh 2013-05-20 21:14:18 -0700 +++ boost_1_54_0-fixed/tools/build/v2/engine/build.sh 2013-07-18 00:12:43 -0700 @@ -247,18 +247,18 @@ BJAM_SOURCES="\ command.c compile.c constants.c debug.c execcmd.c frames.c function.c glob.c\ hash.c hdrmacro.c headers.c jam.c jambase.c jamgram.c lists.c make.c make1.c\ - object.c option.c output.c parse.c pathsys.c pathunix.c regexp.c rules.c\ + object.c option.c output.c parse.c pathsys.c regexp.c rules.c\ scan.c search.c subst.c timestamp.c variable.c modules.c strings.c filesys.c\ builtins.c class.c cwd.c native.c md5.c w32_getreg.c modules/set.c\ modules/path.c modules/regex.c modules/property-set.c modules/sequence.c\ modules/order.c" case $BOOST_JAM_TOOLSET in mingw) - BJAM_SOURCES="${BJAM_SOURCES} execnt.c filent.c" + BJAM_SOURCES="${BJAM_SOURCES} execnt.c filent.c pathnt.c" ;; *) - BJAM_SOURCES="${BJAM_SOURCES} execunix.c fileunix.c" + BJAM_SOURCES="${BJAM_SOURCES} execunix.c fileunix.c pathunix.c" ;; esac (It took me quite some time to figure out this one.) Although pathunix.c compiles on MinGW, it doesn't work, causing the bootstrap to complain about not being able to write its command file. The correct pattern to follow (as correctly done in build.jam; you can see half of it at the bottom of the build.jam diff here) is for pathnt.c to be used for mingw and pathunix.c to be used for all other build.sh platforms (i.e. real Unixes). Thanks, Stephan T. Lavavej

1 0

[container][set, map, flat_set, flat_map, +multi_xxx] operator< and operator== seems to ignore custom KeyCompare
by Thorsten Ottosen 18 Jul '13

18 Jul '13

Hi Ion & others, I think that there might be a problem in the implementation of operator< for these containers. There might be a problem with operator== too. The problem is that they all use some variant of the following definition: template <class Key, class Value, class KeyOfValue, class KeyCompare, class A> inline bool operator<(const rbtree<Key,Value,KeyOfValue,KeyCompare,A>& x, const rbtree<Key,Value,KeyOfValue,KeyCompare,A>& y) { return std::lexicographical_compare(x.begin(), x.end(), y.begin(), y.end()); } There is no KeyCompare (or other compare object) passsed to lexicographical compare. Reading up on the standard, it seems that all standard containers are implemented this way. Consequence: when having e.g. set<T*>, the comparison is not portable, since only std::less<T*> is guaranteed to be. So isn't this a defect? The other issue is perhaps more sensitive. What should users expect from typedef set<std::string,CaseInsensitiveLess> Set; Set s1{ "foo", "BAR" }; Set s2{ "FOO", "bar" }; assert( s1 < s2 ); // true? assert( s1 == s2 ); // true? I was at least surprised by this behavior. regards Thorsten

3 4

Git Modularization example Boost .gitattributes
by Niall Douglas 16 Jul '13

16 Jul '13

> > Shouldn't the repositories contain a .gitattributes file indicating the > > eol flavor to be used for text files where it has significance? > > Perhaps! I don't know anything about .gitattributes. Where can I find > out more? Dave, I can probably save you some work here with my "perfect" mirror of Boost's EOL and MIME type config into a .gitattributes with which I configured my subgit to mirror my git repo into Boost sandbox. Taken from https://github.com/ned14/TripleGit/blob/master/.gitattributes: * text=auto !eol svneol=native#text/plain *.gitattributes text svneol=native#text/plain # Scriptish formats *.bat text svneol=native#text/plain *.bsh text svneol=native#text/x-beanshell *.cgi text svneol=native#text/plain *.cmd text svneol=native#text/plain *.js text svneol=native#text/javascript *.php text svneol=native#text/x-php *.pl text svneol=native#text/x-perl *.pm text svneol=native#text/x-perl *.py text svneol=native#text/x-python *.sh eol=lf svneol=LF#text/x-sh configure eol=lf svneol=LF#text/x-sh # Image formats *.bmp binary svneol=unset#image/bmp *.gif binary svneol=unset#image/gif *.ico binary svneol=unset#image/ico *.jpeg binary svneol=unset#image/jpeg *.jpg binary svneol=unset#image/jpeg *.png binary svneol=unset#image/png *.tif binary svneol=unset#image/tiff *.tiff binary svneol=unset#image/tiff *.svg text svneol=native#image/svg%2Bxml # Data formats *.pdf binary svneol=unset#application/pdf *.avi binary svneol=unset#video/avi *.doc binary svneol=unset#application/msword *.dsp text svneol=crlf#text/plain *.dsw text svneol=crlf#text/plain *.eps binary svneol=unset#application/postscript *.gz binary svneol=unset#application/gzip *.mov binary svneol=unset#video/quicktime *.mp3 binary svneol=unset#audio/mpeg *.ppt binary svneol=unset#application/vnd.ms-powerpoint *.ps binary svneol=unset#application/postscript *.psd binary svneol=unset#application/photoshop *.rdf binary svneol=unset#text/rdf *.rss text svneol=unset#text/xml *.rtf binary svneol=unset#text/rtf *.sln text svneol=native#text/plain *.swf binary svneol=unset#application/x-shockwave-flash *.tgz binary svneol=unset#application/gzip *.vcproj text svneol=native#text/xml *.vcxproj text svneol=native#text/xml *.vsprops text svneol=native#text/xml *.wav binary svneol=unset#audio/wav *.xls binary svneol=unset#application/vnd.ms-excel *.zip binary svneol=unset#application/zip # Text formats .htaccess text svneol=native#text/plain *.bbk text svneol=native#text/xml *.cmake text svneol=native#text/plain *.css text svneol=native#text/css *.dtd text svneol=native#text/xml *.htm text svneol=native#text/html *.html text svneol=native#text/html *.ini text svneol=native#text/plain *.log text svneol=native#text/plain *.mak text svneol=native#text/plain *.qbk text svneol=native#text/plain *.rst text svneol=native#text/plain *.sql text svneol=native#text/x-sql *.txt text svneol=native#text/plain *.xhtml text svneol=native#text/xhtml%2Bxml *.xml text svneol=native#text/xml *.xsd text svneol=native#text/xml *.xsl text svneol=native#text/xml *.xslt text svneol=native#text/xml *.xul text svneol=native#text/xul *.yml text svneol=native#text/plain boost-no-inspect text svneol=native#text/plain CHANGES text svneol=native#text/plain COPYING text svneol=native#text/plain INSTALL text svneol=native#text/plain Jamfile text svneol=native#text/plain Jamroot text svneol=native#text/plain Jamfile.v2 text svneol=native#text/plain Jamrules text svneol=native#text/plain Makefile* text svneol=native#text/plain README text svneol=native#text/plain TODO text svneol=native#text/plain # Code formats *.c text svneol=native#text/plain *.cpp text svneol=native#text/plain *.h text svneol=native#text/plain *.hpp text svneol=native#text/plain *.ipp text svneol=native#text/plain *.tpp text svneol=native#text/plain *.jam text svneol=native#text/plain *.java text svneol=native#text/plain Hope that's useful. Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

2 4

detail/endian.hpp replacement?
by Philip Bennefall 15 Jul '13

15 Jul '13

Hi all, I just wanted to ask about the possibility of getting the Boost licensed fix for detail/endian.hpp into the next release of Boost? It would be great to have that license ambiguity resolved for version 1.55.0. Kind regards, Philip Bennefall

2 2

[thread] Is future.then( scheduler , task ) abandoned?
by Klaim - Joël Lamotte 15 Jul '13

15 Jul '13

On this page: http://www.boost.org/doc/libs/1_54_0/doc/html/thread/future.html And in the task list: https://svn.boost.org/trac/boost/query?status=!closed&component=thread We can see that there are plans to add async( scheduler, task ). However there are no tasks for future.then( scheduler, task ). The documentation suggests that it will be implemented in a future release. So I just wanted a confirmation: is it still planned or is it abandoned? Or is it just a missing task? Joel Lamotte

2 2

Git Modularization hiccups
by Beman Dawes 15 Jul '13

15 Jul '13

* "git clone --recursive http://github.com/boostorg/boost modular-boost" is mostly working fine here (on Win7) but is producing one set of error messages: Cloning into 'libs/assign'... fatal: reference is not a tree: 57ec5d1534810090649b18c88e66a46f48cdcf1c ... Unable to checkout '57ec5d1534810090649b18c88e66a46f48cdcf1c' in submodule path 'libs/assign' The remaining hiccups are in the root directory, comparing trunk to master: * boost.css is missing content from revisions 36243 and 53553. * boost-build.jam has different comments and history. Something is totally whacky. * boostcpp.py contents are the same, but the trunk file has Unix line endings, the master file has Windows line endings. * Same problem with bootstrap.sh. IIRC, it is important that the .sh files have the Unix line endings. * c++boost.gif not present in trunk, present in master. * index.html missing in master. * Jamfile.v2 and Jamroot.jam not present in trunk, present in master. * INSTALL missing in master. * LICENSE_1_0.txt has Unix line endings in trunk, Windows line endings in master. * project-config.jam missing in master. * rst.cc missing in master. * README.txt not present in trunk, present in master. HTH, --Beman

9 17

Release branch now open for merging
by Marshall Clow 15 Jul '13

15 Jul '13

The release branch (https://svn.boost.org/svn/boost/branches/release) is open for merging all stable changes from trunk, including bug fixes and major upgrades to existing libraries. Breaking changes should be coordinated via the mailing list with the developers of the other libraries affected. New libraries may be added, but require permission of a release manager. In other words, merging *does not* require permission from a release manager, except for new libraries. Boost Calendar with the release schedule: http://www.boost.org/development/index.html Release schedule explanation: http://svn.boost.org/trac/boost/wiki/ReleaseSchedule Release practices for developers: http://svn.boost.org/trac/boost/wiki/ImprovingPractices -- The Release Managers, Beman Dawes Daniel James Eric Niebler Marshall Clow Rene Rivera Vladimir Prus

1 0

[function] type conversion ambiguity?
by Andrew Ho 15 Jul '13

15 Jul '13

Consider the overloaded functions foo and bar: typedef boost::function<void(void)> function_type1; typedef boost::function<void(int)> function_type2; typedef std::function<void(void)> function_type3; typedef std::function<void(int)> function_type4; void foo(const function_type1 &a) { // blah } void foo(const function_type2 &a) { // blah } void bar(const function_type3 &a) { // blah } void bar(const function_type4 &a) { // blah } calling foo with a function pointer is ambiguous, but calling bar is not: void doit1(void) {} void doit2(int) {} foo(&doit1); // ambiguous bar(&doit2); // compiles and runs fine This occurs despite the fact that boost::function<void(void)>(&doit2) can be caught at compile time. Is there some way to fix the definition of boost::function such that this is no longer ambiguous?

2 1

Nullable types
by Bjorn Reese 15 Jul '13

15 Jul '13

It seems like different Boost libraries use different nullable types. * Optional uses boost::none * Tribool uses boost::logic::indeterminate_keyword_t * Tuple uses boost::tuples::null_type * Variant uses boost::blank And there are possibly more. What are your opinions about unifying these?

4 3

Extremely large Visual Studio libboost_log_setup* binaries
by Tom Kent 14 Jul '13

14 Jul '13

In the 1.54.0 release, I noticed that the size of the binaries built with visual studio was more than twice that of the previous releases. For example the msvc-8.0-64 build went from 2GB to 5GB. Upon further investigation, almost all of that increase was in the libboost_log_setup* binaries, which were each in the 100s of MBs. Does anyone know if there is a reason for this? Is it a configuration error? Tom Kent

8 22

Boost.Operators and make_shared
by Pieter 13 Jul '13

13 Jul '13

LS, I have noticed that using Boost.Operators has a side-effect which I can't explain. I am using std::make_shared as a default, however, some of the boost libraries I use pull in boost::make_shared as well. When using some class T2 derived from one of the boost.operators classes, this causes MSVC2010 to not compile when invoking make_shared<T2> as the compiler can no longer resolve between the two overloaded versions of make_shared for some reason. I am hoping that someone out can explain what is happening here. A minimal example is included here: #include <memory> #include <boost\operators.hpp> #include <boost\make_shared.hpp> struct T1 {}; struct T2 : boost::equality_comparable<T2> {}; int main( int argc, const char* argv[] ) { T1 Object1; T2 Object2; using std::make_shared; std::shared_ptr<T1> Ptr1 = make_shared<T1>(Object1); // OK std::shared_ptr<T2> Ptr2 = make_shared<T2>(Object2); // error C2668: 'boost::make_shared' : ambiguous call to overloaded function return 1; } Thanks in advance! Pieter

4 6

[regression] patch for running tests in parallel and out-of-sync files
by Robert Kawulak 13 Jul '13

13 Jul '13

When I was running tests in parallel (using b2 -j option) I was getting random warnings in the results table because "msvc.manifest" lines were interleaved with compile/link actions. I've fixed this with the attached patch - is it OK to apply it to trunk/release? BTW, I've noticed that the following files in tools/regression/src haven't been updated in release branch even though they've been changed in trunk a long time ago: compiler_status.cpp (trunk date 2012-01-21, release date 2011-10-06) library_status.cpp (trunk date 2013-03-25, release date 2013-03-09) Is it OK to update these in release branch? Best regards, Robert

1 0

[log] Set default log source name
by Renato Forti 12 Jul '13

12 Jul '13

Hi All, Have any way to define a custon log source name on simple_event_log_backend! I foud a method to get (get_default_source_name), but where is "set" method! HKEY_LOCAL_MACHINE\SYSTEM\CurrentControlSet\Services\EventLog\Application\do kagent simple event source I want set/change default name (in my case) : "dokagent simple event source" Thanks

2 1

[config] Feature request: BOOST_OVERRIDE
by Borislav Stanimirov 12 Jul '13

12 Jul '13

Hi, I think it will be a nice feature to add BOOST_OVERRIDE to Boost.Config in a manner similar to BOOST_CONSTEXPR. It's a nice keyword and it would be nice if people could make use of it when it's available. -- Borislav

5 4

multi_index broken on gcc4.7
by Hartmut Kaiser 12 Jul '13

12 Jul '13

In code which compiled just fine until yesterday I'm now seeing: /opt/boost/trunk-release/boost/multi_index/detail/index_base.hpp: In member function 'std::pair<typename boost::multi_index::detail::multi_index_node_type<Value, IndexSpecifierList, Allocator>::type*, bool> boost::multi_index::detail::index_base<Value, IndexSpecifierList, Allocator>::final_emplace_(Args&& ...)': /opt/boost/trunk-release/boost/multi_index/detail/index_base.hpp:214:29: error: expected primary-expression before ')' token /opt/boost/trunk-release/boost/multi_index/detail/index_base.hpp: In member function 'std::pair<typename boost::multi_index::detail::multi_index_node_type<Value, IndexSpecifierList, Allocator>::type*, bool> boost::multi_index::detail::index_base<Value, IndexSpecifierList, Allocator>::final_emplace_hint_(boost::multi_index::detail::index_base<Value , IndexSpecifierList, Allocator>::final_node_type*, Args&& ...)': /opt/boost/trunk-release/boost/multi_index/detail/index_base.hpp:233:16: error: expected primary-expression before ')' token OS: Debian Unstable Kernel: Linux 3.2 GCC: 4.7 (C++11, x86-64) Boost: SVN Trunk Build Type: Release Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu

2 2

[variant] Applying a portion of fixes
by Antony Polukhin 12 Jul '13

12 Jul '13

Hi, I'd like to fix this issue: https://svn.boost.org/trac/boost/ticket/8772 Apply patch for this issue: https://svn.boost.org/trac/boost/ticket/7911 And take care of this: https://svn.boost.org/trac/boost/ticket/8717 Patches and ideas for fixes are described in tickets. If there'll be no objections till next weekend I'll commit the fixes. -- Best regards, Antony Polukhin

1 0

Boost 1.54.0 released!
by Marshall Clow 11 Jul '13

11 Jul '13

Release 1.54.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains five new libraries and numerous enhancements and bug fixes for existing libraries. New Libraries: Log: Logging library, from Andrey Semashev. TTI: Type Traits Introspection library, from Edward Diener. Type Erasure: Runtime polymorphism based on concepts. For details, including download links, see http://www.boost.org/users/news/version_1.54.0 You can also download directly from SourceForge: http://sourceforge.net/projects/boost/files/boost/1.54.0/ To install this release on your system, see http://www.boost.org/doc/libs/release/more/getting_started/index.html Thanks, --The Boost release team Beman Dawes Daniel James Eric Niebler Marshall Clow Rene Rivera Vladimir Prus

5 9

Regression tests report page stuck
by Joaquin M Lopez Munoz 11 Jul '13

11 Jul '13

Hi, the trunk testing bot http://www.boost.org/development/tests/trunk/developer/summary.html seems to be stuck since ~1.5 days ago. Thank you, Joaquín M López Muñoz Telefónica Digital

1 1

[gil] Portability of new code issue.
by Harg Tholan 11 Jul '13

11 Jul '13

Hi all, Christian has been working on some new features for GIL, such code works fine in Windows 7 with VS11, but it will fail to compile with GCC in Debian Wheezy. I've been trying to figure out why is this failing and possible workarounds with no success. For those with time wanting to help: 1. You will need boost-trunk. 2. I have attached the "bleeding edge" code (a pair of .hpp) as well as a test case. 3. Compile: g++ subsampled_test.cpp -o ss -lboost_unittesting_framework My Compiler Version: g++ (Debian 4.7.2-5) 4.7.2 Errors: yuv_image.hpp:234:38: error: expected primary-expression before ‘,’ token subsampled_test.cpp:28:41: required from here ../yuv_image.hpp:234:5: error: ISO C++ forbids comparison between pointer and integer Note: I have attached the code here because I had to fix some template code, adding/removing 'tyepename', as well as prevention of template parameter shadowing. As you already know, Microsoft's compiler is very 'flexible', allowing non-standard code to compile. Regards, Juan.

1 0

[filesystem] Please take care of #8706
by Antony Polukhin 10 Jul '13

10 Jul '13

Hi, There is a ticket https://svn.boost.org/trac/boost/ticket/8706 and patch in it that fixes compilation of Boost.Filesystem under Android NDK. Tested patch under latest NDK and it works well. Fix is required to start regression tests for droid platform. -- Best regards, Antony Polukhin

4 8

[function] Bind to std::function if supported?
by Andrew Ho 09 Jul '13

09 Jul '13

The boost::move library binds to std::move/T&&/etc. when the compiler supports such features, and only uses work-around mechanisms when the compiler lacks such support. Should we add similar support for boost::function? something like: #ifdef BOOST_FUNCTION_USE_STANDARD_LIBRARY_FUNCTION // alternative: #ifndef BOOST_NO_CXX11_HDR_FUNCTIONAL #include <functional> namespace boost { using ::std::function; } #else // whatever boost::function currently does #endif // ... something similar for boost::bind and std::bind I haven't looked at boost::atomic yet, but we could also consider similar bindings to std::atomic if the library doesn't already do so.

3 3

[shared_array] Why not in C++11 ?
by Sid Sacek 09 Jul '13

09 Jul '13

Does anyone know why 'boost::shared_array<>' was not made part of C++11, since pretty much all the other smart pointers were? -Sid

10 41

[context] SSE/AVX registers preservation
by Andrey Semashev 09 Jul '13

09 Jul '13

Hi, I've been looking at Boost.Context and wondering whether it preserves SSE/AVX state on context switches. From the code it doesn't look like the case - only jump_x86_64_ms_pe_masm.asm contains the code that saves some (not all) xmm registers and ymm registers are never saved. Is this intentional or the library simply doesn't support SSE/AVX? And why not use xsave/xrstor to consistently support all future extensions?

2 2

Re: [boost] Interest in a 'Boost.property' library?
by Joe Mucchiello 08 Jul '13

08 Jul '13

Personally, I always consider properties with getters/setters an anti-pattern for OOP languages like C++. Class interfaces should include only those methods that describe logically valid actions one might take on instances of the class. The idea of properties might sometimes be appropriate. But often times, programs will see a hammer and treat everything they see after it as nails. It becomes easy to add a few more getters and setters for "the rest" of the implementation details and you lose proper encapsulation. Usually when I find a class with lots of get/set methods I find a class with very little thought used when that class was designed.

4 7

[log] Setup Windows event log backends
by Renato Forti 08 Jul '13

08 Jul '13

Work well, on win 7/vc 11! Win 8/vc 11, don't work! mc is not detected! On Thu, Jul 4, 2013 at 11:38 PM, Renato Forti <re.tf(a)acm.org> wrote: > Hi, > I did, but don't work! I have mc, and I remove bin.v2. But boost build > don't find my mc :( > > - message-compiler : no > - compiler-supports-ssse3 : yes > - compiler-supports-avx2 : yes > - gcc visibility : no > - long double support : yes > > C:\boost_1_54_0>mc > Microsoft (R) Message Compiler Version 1.12.9200 Copyright (c) > Microsoft Corporation. All rights reserved. > > No cached! I am on Windows 8, and vc11! Thanks again! Hm, that's strange. Perhaps, a Win 8 thing? What does bin.v2/config.log say? _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

[unordered] a strange limitation for move emulation in Boost.Unordered
by Joaquin M Lopez Munoz 08 Jul '13

08 Jul '13

Here: http://www.boost.org/doc/html/unordered/compliance.html#unordered.complianc… it reads: "Non-copyable objects can be stored in the containers, but without support for rvalue references the container will not be movable." Why not? Container movement does not ever touch its elements, so I don't see the connection. Joaquín M López Muñoz Telefónica Digital

2 5

boost-1.54 needs a bugfix!
by Oliver Kowalke 08 Jul '13

08 Jul '13

unfortunately boost-1.54 needs a bugfix - because my request to merge boost.coroutine into release a required bugfix was not applied :( I'm wondering because the regression-tests are passed?! what to do? should I modify the fix in boost-release and archives of boost-1.54 are rebuild?

11 24

[fusion] Adapter for std::array
by Mateusz Loskot 07 Jul '13

07 Jul '13

Hi, I have prototyped Fusion adapter for std::array, as an attempt to clear the related feature request: https://svn.boost.org/trac/boost/ticket/8241 Here is the functional and testable code of the adaptor : https://github.com/mloskot/boost_fusion_std_array I will appreciate any critique and comments. Unfortunately, I have hit the apparently well-known problem. It is the Fusion begin/end ADL issues with C++0x range-based for and such, as discussed and reported here: http://lists.boost.org/Archives/boost/2010/12/174199.php https://svn.boost.org/trac/boost/ticket/4028 There has been no feedback to the ticket #8241, so I'm not sure what is the Fusion authors' view on std::array adoption. So, a couple of questions: Do the Fusion authors consider any cure for the ADL issues? If not, despite the inconvenience of use of qualified names, would it be still possible to accept std::array into Fusion? Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

4 7

Interest in a 'Boost.property' library?
by Metodi Todorov 07 Jul '13

07 Jul '13

Is there any interest of "C# property" like library? struct vec2 { float get_x() const{...} float set_x() const{...} ... property_rw<float, vec2, &vec2::get_x, &vec2::set_x> x; vec2() : y(this) {} }; vec2 v; v.x = 15.0f; cout << v.x << endl; Example: http://sourceforge.net/projects/cproperty/?source=dlp Regards, Metodi Todorov

5 5

Benchmarking for performance?
by Arpan Sen 07 Jul '13

07 Jul '13

Hi Boost Dev, What sort of benchmarking does the community do for performance when moving from one revision to another? Kind of regression numbers for benchmark tests I would say for memory and time required. Does not have to be at an application level - even at a data structure level is a good start. Thanks a lot. Arpan

1 0

Historic of regression tests?
by Joaquin M Lopez Munoz 07 Jul '13

07 Jul '13

The regression tests at http://www.boost.org/development/tests/release/developer/summary.html are constantly updated (of course), but I seem to remember that the version manager used to backup a snapshot of this at each release. Am I right (I found nothing searching through boost.org)? Is there some sort of historic info on regression tests? Thank you, Joaquín M López Muñoz Telefónica Digital

2 1

[log] Setup Windows event log backends
by Renato Forti 06 Jul '13

06 Jul '13

Hi, I am trying setup a basic: <http://www.boost.org/doc/libs/1_54_0/libs/log/doc/html/log/detailed/sink_ba ckends.html#log.detailed.sink_backends.event_log> Windows event log, and I copy and past code from log documentation. My app link with: 1> main.cpp 1> Linking to lib file: boost_filesystem-vc110-mt-gd-1_54.lib 1> Linking to lib file: boost_system-vc110-mt-gd-1_54.lib 1> Linking to lib file: boost_log-vc110-mt-gd-1_54.lib 1> Linking to lib file: boost_thread-vc110-mt-gd-1_54.lib 1> Linking to lib file: boost_log_setup-vc110-mt-gd-1_54.lib 1> Linking to lib file: boost_date_time-vc110-mt-gd-1_54.lib 1> Linking to lib file: boost_chrono-vc110-mt-gd-1_54.lib But I have some link problems: 1>qt.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall boost::log::v2_mt_nt5::sinks::basic_simple_event_log_backend<char>::basic_si mple_event_log_backend<char>(void)" (__imp_??0?$basic_simple_event_log_backend@D@sinks@v2_mt_nt5@log@boost@@QAE@ XZ) referenced in function "class boost::shared_ptr<class boost::log::v2_mt_nt5::sinks::basic_simple_event_log_backend<char> > __cdecl boost::make_shared<class boost::log::v2_mt_nt5::sinks::basic_simple_event_log_backend<char> >(void)" (??$make_shared@V?$basic_simple_event_log_backend@D@sinks@v2_mt_nt5@log@boos t@@@boost@@YA?AV?$shared_ptr@V?$basic_simple_event_log_backend@D@sinks@v2_mt _nt5@log@boost@@@0@XZ) 1>qt.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall boost::log::v2_mt_nt5::sinks::basic_simple_event_log_backend<char>::~basic_s imple_event_log_backend<char>(void)" (__imp_??1?$basic_simple_event_log_backend@D@sinks@v2_mt_nt5@log@boost@@QAE@ XZ) referenced in function "public: void * __thiscall boost::log::v2_mt_nt5::sinks::basic_simple_event_log_backend<char>::`scalar deleting destructor'(unsigned int)" (??_G?$basic_simple_event_log_backend@D@sinks@v2_mt_nt5@log@boost@@QAEPAXI@Z ) 1>qt.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: void __thiscall boost::log::v2_mt_nt5::sinks::basic_simple_event_log_backend<char>::set_even t_type_mapper(class boost::log::v2_mt_nt5::aux::light_function<enum boost::log::v2_mt_nt5::sinks::event_log::event_type __cdecl(class boost::log::v2_mt_nt5::record_view const &)> const &)" (__imp_?set_event_type_mapper@?$basic_simple_event_log_backend@D@sinks@v2_mt _nt5@log@boost@@QAEXABV?$light_function@$$A6A?AW4event_type@event_log@sinks@ v2_mt_nt5@log@boost@@ABVrecord_view@456@@Z@aux@345@@Z) referenced in function "void __cdecl init_logging(void)" (?init_logging@@YAXXZ) 1>qt.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: void __thiscall boost::log::v2_mt_nt5::sinks::basic_simple_event_log_backend<char>::consume( class boost::log::v2_mt_nt5::record_view const &,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const &)" (__imp_?consume@?$basic_simple_event_log_backend@D@sinks@v2_mt_nt5@log@boost @@QAEXABVrecord_view@345@ABV?$basic_string@DU?$char_traits@D@std@@V?$allocat or@D@2@@std@@@Z) referenced in function "protected: void __thiscall boost::log::v2_mt_nt5::sinks::basic_formatting_sink_frontend<char>::feed_rec ord<class boost::log::v2_mt_nt5::aux::fake_mutex,class boost::log::v2_mt_nt5::sinks::basic_simple_event_log_backend<char> >(class boost::log::v2_mt_nt5::record_view const &,class boost::log::v2_mt_nt5::aux::fake_mutex &,class boost::log::v2_mt_nt5::sinks::basic_simple_event_log_backend<char> &)" (??$feed_record@Vfake_mutex@aux@v2_mt_nt5@log@boost@@V?$basic_simple_event_l og_backend@D@sinks@345@@?$basic_formatting_sink_frontend@D@sinks@v2_mt_nt5@l og@boost@@IAEXABVrecord_view@234@AAVfake_mutex@aux@234@AAV?$basic_simple_eve nt_log_backend@D@1234@@Z) What is wrong? Thanks

3 10

[log] Build fail : log (1.44.0) on vc 11 using cxxflags=-Zc:wchar_t-
by Renato Forti 05 Jul '13

05 Jul '13

Hi All, I need use cxxflags=-Zc:wchar_t-, because I will use boost with my QT project! I build boost like this (debug in this case): bjam toolset=msvc-11.0 variant=debug threading=multi link=shared cxxflags=-Zc:wchar_t- But log lib fail with this: call "C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"..\..\..\bin.v2\libs\log\build\msvc-11.0\debug\threading-mul ti\formatter_parser.obj.rsp" ...failed compile-c-c++ ..\..\..\bin.v2\libs\log\build\msvc-11.0\debug\threading -multi\formatter_parser.obj... ...skipped <p..\..\..\bin.v2\libs\log\build\msvc-11.0\debug\threading-multi>boos t_log_setup-vc110-mt-gd-1_54.dll for lack of <p..\..\..\bin.v2\libs\log\build\ms vc-11.0\debug\threading-multi>boost_log-vc110-mt-gd-1_54.lib... ...skipped <p..\..\..\bin.v2\libs\log\build\msvc-11.0\debug\threading-multi>boos t_log_setup-vc110-mt-gd-1_54.lib for lack of <p..\..\..\bin.v2\libs\log\build\ms vc-11.0\debug\threading-multi>boost_log-vc110-mt-gd-1_54.lib... ...skipped <p..\..\..\bin.v2\libs\log\build\msvc-11.0\debug\threading-multi>boos t_log_setup-vc110-mt-gd-1_54.pdb for lack of <p..\..\..\bin.v2\libs\log\build\ms vc-11.0\debug\threading-multi>boost_log-vc110-mt-gd-1_54.lib... ...failed updating 4 targets... ...skipped 6 targets... Anyone can helpeme? Thanks

3 6

gmp-5.1.2 / boost-1.54 / multiprecision lib
by Fred Schneider 05 Jul '13

05 Jul '13

Hello, I'm a bit of a newbie and I ran into some issues using gmp with boost. After building gmp-5.1.2, I tried to build a simple file: boostMathExample.cpp, based on the documentation (using the multiprecision library + referencing gmp): ////////////////////////////////////////// #include <boost/multiprecision/gmp.hpp> using namespace boost::multiprecision; int main(int argc, const char *argv[]) { mpz_int v = 1; // Do some arithmetic: for (unsigned int i = 1; i <= 1000; ++i) v *= i; std::cout << v << std::endl; } /////////////////////////////////////////////// I received the following missing symbol errors when trying to build: g++ -I ~/Dev/C++/gmp-5.1.2 -I ~/Dev/C++/boost boostMathExample.cpp -O2 -o boostMathExample Undefined symbols: "_main", referenced from: start in crt1.10.6.o "___gmpz_init", referenced from: __static_initialization_and_destruction_0(int, int)in cccOFSnR.o __static_initialization_and_destruction_0(int, int)in cccOFSnR.o "___gmpz_clear", referenced from: ___tcf_1 in cccOFSnR.o __static_initialization_and_destruction_0(int, int)in cccOFSnR.o "___gmpz_set_si", referenced from: __static_initialization_and_destruction_0(int, int)in cccOFSnR.o ld: symbol(s) not found collect2: ld returned 1 exit status ======================================== I'm running the following version of g++: i686-apple-darwin10-g++-4.2.1 (GCC) 4.2.1 (Apple Inc. build 5666) (dot 3) I configured gmp, version 5.1.2 with the following flags: ./configure --enable-cxx CXX=g++ CXXFLAGS=-O2 CC=g++ CFLAGS="-g -O2" and then ran "make" and "make check". Any insight would be appreciated. Thanks, Fred

3 3

[algorithm][minmax_element] implementation question
by Michael Marcin 04 Jul '13

04 Jul '13

I was looking at minmax_elemement to try and understand the algorithm. I noticed that the boost implementation looks significantly more complicated than the clang libc++ implementation. Mainly due to the potential_min_result variable that exists in the boost version. Is there a reason for this discrepancy? Is there a bug in the clang implementation? http://llvm.org/svn/llvm-project/libcxx/trunk/include/algorithm http://www.boost.org/doc/libs/1_54_0/boost/algorithm/minmax_element.hpp

3 2

Re: [boost] [utility][thread] result_of - erroneous result type from a C++11 lambda
by Klaim - Joël Lamotte 04 Jul '13

04 Jul '13

On Tue, Apr 2, 2013 at 7:16 PM, Vicente J. Botet Escriba < vicente.botet(a)wanadoo.fr> wrote: > I've started to use C++11 lambda functions with Boost.Thread. > > The following works with clang-3.2 > > boost::future<int> f1 = boost::async( []() -> int {return 123;} ); > > > But it fails with gcc-4.6.2, 4.7.2 and 4.8.0 > > ../example/lambda_future.cpp:**25:91: erreur: conversion from > ‘boost::future<void>’ to non-scalar type ‘boost::future<int>’ requested > boost::future<int> f1 = boost::async( []() -> int {return 123;} ); > > The current implementation of boost::async uses boost::result_of to get > the result type of the callable parameter. > > Is this a know bug on boost::result_of or gcc compiler? > I'm seeing exactly the same behaviour in *VS2012 Update 2*. I'm using Boost 1.54.0 beta *r84748* To be more precise: 1) I first was just using boost::future and tried to use the new .then(), here is a full repro: #include <boost/thread/future.hpp> auto ft = boost::async( []{ return 42; } ).then( []( boost::future<int> r ){ return 666; } ); This fails because boost::async() returned a future<void> instead of a future<int>. I suspect the then() call to have the same problem. I can provide the full error log but I think it's not that useful. 2) Just to be sure I tried this full test: #include <boost/thread/future.hpp> int main() { auto ft = boost::async( []{ return 42; } ); // SUCCEED: static_assert( std::is_same< decltype(ft), boost::future<void> >::value, "WTF???" ); // FAILS: static_assert( std::is_same< decltype(ft), boost::future<int> >::value, "Not the expected type!" ); } Both asserts confirm that I don't get what I want. 3) I remembered that there were some issues from usage of boost::result_of in Boost.Log, so to clarify the situation I setup the following full test: #include <boost/utility/result_of.hpp> #include <type_traits> int top() { return 42; } struct K { int operator()(){ return 42; } typedef int value_type; }; auto F = []{ return 42; }; int main() { // A: ALL SUCCEED static_assert( std::is_same< decltype(K()()), int >::value, "Not the expected type!" ); static_assert( std::is_same< decltype(top()), int >::value, "Not the expected type!" ); static_assert( std::is_same< decltype(F()), int >::value, "Not the expected type!" ); // B: ALL SUCCEED static_assert( std::is_same< std::result_of<K()>::type, int >::value, "Not the expected type!" ); static_assert( std::is_same< std::result_of<decltype(top)>::type, int >::value, "Not the expected type!" ); static_assert( std::is_same< std::result_of<decltype(F)()>::type, int >::value, "Not the expected type!" ); // C: ALL SUCCEED std::result_of<K()>::type a = K()(); std::result_of<decltype(top)>::type b = top(); std::result_of<decltype(F)()>::type c = F(); // D: ALL FAILS static_assert( std::is_same< boost::result_of<K()>::type, int >::value, "Not the expected type!" ); static_assert( std::is_same< boost::result_of<decltype(top)>::type, int >::value, "Not the expected type!" ); static_assert( std::is_same< boost::result_of<decltype(F)()>::type, int >::value, "Not the expected type!" ); // E: ALL FAILS boost::result_of<K()>::type d = K()(); // error C2182: 'd' : illegal use of type 'void' boost::result_of<decltype(top)>::type e = top(); // error C2182: 'e' : illegal use of type 'void' boost::result_of<decltype(F)()>::type f = F(); // error C2182: 'f' : illegal use of type 'void' } This shows clearly that: 1. boost::result_of don't behave like std::result_of on this platform (and from previous discussions, on other platforms too). 2. both std::result_of and decltype() provide the result I expect from reading documentations about these. So far I'm assuming that the problem really is from boost::result_of, but I might be wrong because the differences with std::result_of are not clear to me. ---- Unfortunately this makes future.then() unusable if we expect return types. I don't know if it impacts other libraries (I suspect Boost.Log). Should I report a bug or is it known, already fixed or a misuse? Joel Lamotte

5 12

[result_of] Documentation update for ticket 7753
by Nathan Crookston 03 Jul '13

03 Jul '13

Hi Daniel & all, I'm updating the patch for ticket 7753 ( https://svn.boost.org/trac/boost/ticket/7753) I've made the requested changes to the patch, but I had a question on how to best explain which macro to define if, for example, you want result_of to work with C++11 lambdas. In the past, users with a pre-N3276 decltype have been advised to just #define BOOST_RESULT_OF_USE_DECLTYPE, with the explanation that "it's probably just going to work." While that advice is true, there are cases where this doesn't work; hence the addition of BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK. To explain why you'd define the FALLBACK macro over the USE_DECLTYPE macro, I'm thinking of including a paragraph like the following. "The question naturally arises on why have both BOOST_RESULT_OF_USE_DECLTYPE and BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK. In many situations, BOOST_RESULT_OF_USE_DECLTYPE will work well, even with pre-N3276 decltype. However, there are cases where a post-N3276 decltype is required to correctly deduce the return type of a functor. If a translation unit includes a functor whose return type is only deducible with TR1 or a post-N3276 decltype, using result_of with, e.g. a C++11 lambda function, will fail without BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK. If the macro BOOST_NO_CXX11_DECLTYPE_N3276 is defined and BOOST_NO_CXX11_DECLTYPE is not defined when including result_of.hpp, defining BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK is the safest option that will allow you to deduce C++11 lambda return types." My question is, am I over explaining it? Of course, I'd rather have BOOST_RESULT_OF_USE_TR1_WITH_DECLTYPE_FALLBACK defined automatically for compilers like VC10, g++4.5, etc., and include text like the following: "If you rely on the result of calling a nullary functor to be void, regardless of the actual return type, or if your code is not written to handle cases other than BOOST_RESULT_OF_USE_TR1 and BOOST_RESULT_OF_USE_DECLTYPE, you may wish to explicitly define one of those symbols prior to including result_of." Either way, comments welcome. Thanks, Nate

3 4

Want to contribute, need advice.
by Manmohit Rekhi 03 Jul '13

03 Jul '13

Hello, Am Manmohit Rekhi, a 2nd year computer engineering student at Nirma university, India. I have some programming experience in c and c++. Am interested in contributing to Boost, and would like to ask a few questions, to help me get started. I would be really grateful is, i could get the following questions answered. 1) Do i need to be familiar with the code of the standard c++ libraries, and if so, where do i start? 2) What other per-requisites are there? 3) Where do i start reading the boost libraries(i mean which file to read first)? Thanking You, Manmohit Rekhi

2 1

[Serialization] Constructor for polymorphic archives
by Bjorn Reese 03 Jul '13

03 Jul '13

I have a set of my own Boost.Serialization archives (e.g. [1]) that I wish to write polymorphic variants of. I have tried to follow the blueprint from polymorphic_text_iarchive, which inherits from polymorphic_iarchive_route. The problem is that the constructor of my archives takes iterators (begin and end) as arguments, but the polymorphic_iarchive_route constructor expects a std::stream argument. Is there any workaround for this? [1] http://sourceforge.net/p/protoc/code/ci/master/tree/include/protoc/transenc…

3 4

[Operators] Update, const-correctness and operator chaining
by Andrew Ho 02 Jul '13

02 Jul '13

Hi, I was doing some testing with Daniel Frey/Marc Glisse's proposed 4- overload set for binary operators. For reference, here's the overload set applied to commutative addition: friend T operator +( const T& lhs, const T& rhs) { T nrv(lhs); nrv += rhs; return nrv; } friend T operator +(T&& lhs, const T& rhs) { return std::move(lhs += rhs); } friend T operator +(const T& lhs, T&& rhs) { T nrv(lhs); nrv += boost::move(rhs); return nrv; } friend T operator +(T&& lhs, T&& rhs) { return boost::move(lhs += boost::move(rhs)); } This allows this to be done: val1 + val2 = val3; changing the return type to const T would allow the compiler to catch this, but now doing val1 + val2 + val3 must always use copy semantics instead of move semantics. I can't think of a way which would fix this issue without breaking the use of move semantics. How should we proceed with this? It's obviously bad usage, but the compiler should be able to catch this since it's easy to mistype + as =. Interestingly enough, doing testing with std::string shows the same "problem": std::string str1("hello"), str2(" "), str3("world"); str1 + str2 = str3; I tested this issue with std::string and found it in vs2012, gcc 4.3.2, and mingw/gcc 4.8.0. I don't have access to a compiler which pre-dates C++0x/C++11 so I don't know if this issue has always been present. Compiling with gcc 4.8.0 with - std=c++03 still has the issue.

3 3

Any interest in bitstream class?
by Paul Long 02 Jul '13

02 Jul '13

Same semantics as, e.g., stringstream, but it operates on binary data. I already have the analogues to istringstream/stringbuf (you can take a look at ibitstream/bitbuf at https://github.com/dplong/bstream) There are some interesting features, but I won't go into them here. If there is interest, I would implement obitstream and bitstream and possibly support Boost::dynamic_bitset. The rationale is _succinct_ expression of predictive parsing of binary data. I've used ibitstream in production code for decoding RTP headers and frames of various video encodings. Below is a simple function that decodes an RTP header using ibitstream; I also have a GitHub repo that contains more complex code for high-level parsing of H.264 frames at https://github.com/dplong/rtspudph264 struct RtpHeader { bool padding, marker; bitset<7> payloadType; WORD sequenceNumber; DWORD timestamp, ssrcIdentifier; vector<DWORD> csrcIdentifier; struct { bool present; WORD identifier; vector<BYTE> contents; } extension; }; bool ParseRtpHeader(const BYTE *buffer, RtpHeader &rtp) { ibitstream bin(buffer); static const bitset<2> version(0x2); bitset<4> csrcCount; WORD extensionLength; bin >> version >> rtp.padding >> rtp.extension.present >> csrcCount >> rtp.marker >> rtp.payloadType >> rtp.sequenceNumber >> rtp.timestamp >> rtp.ssrcIdentifier >> setrepeat(csrcCount.to_ulong()) >> rtp.csrcIdentifier; if (rtp.extension.present) { bin >> rtp.extension.identifier >> extensionLength >> setrepeat(extensionLength * sizeof(DWORD)) >> rtp.extension.contents; } return bin.good(); }

10 47

Static initialization of boost shared objects question
by Juan Carlos Franzoy 02 Jul '13

02 Jul '13

Hello. Thanks for reading my question. I fell into a deadlock in static initialization of boost shared objects. The deadlock occurs in a reentrant call to a function which contains a definition of a static variable. Apparenlty gcc protects the initialization of such variables with a condition variable. Looking at the c++ code nothing at all make anybody suspect about reentrancy. My "interpretation of the fact" may be titled 'something in gcc, ld, ld.so, c++language made the call to be reentrant' - There is a function boost::system::generic_category() that has a static variable V - V type is boost::system::annonymous-namespace::generic_error_category - boost::system::annonymous-namespace::generic_error_category is subclass of boost::system::error_category. - boost::system::annonymous-namespace::generic_error_category has no declared/defined constructor as well as all its superclasses - The compilation process generate the constructor boost::system::error_category::error_category() as a weak symbol inside every shared object that uses it. - There is a static variable boost::system::posix_category in one of the shared objects that is initialized calling boost::system::generic_category(). - when the static initialization of a shared object boost::system::posix_category get initialized - which calls boost::system::generic_category() - Inside boost::system::generic_category() starts the initialization of V which calls boost::system::error_category::error_category() - It may happend that the runtime calls an instance of boost::system::error_category::error_category() that resides in a shared object that is still not loaded - So that .so get loaded and it is called its own static initialization - which can call boost::system::generic_category() - BOOM I would love if you can confirm of refute my humble "interpretation". Details follows ------------------- boost version: 1-52-0 Operating system: uname -a SunOS bcpp-solaris10 5.10 Generic_147441-25 i86pc i386 i86pc $ gcc -v Using built-in specs. COLLECT_GCC=gcc COLLECT_LTO_WRAPPER=/export/home/local/gcc-4.6.2/libexec/gcc/i386-pc-solaris2.10/4.6.2/lto-wrapper Target: i386-pc-solaris2.10 Configured with: ../src/gcc-4.6.2/configure --prefix=/export/home/local/gcc-4.6.2 --with-gmp=/export/home/local/gcc-4.6.2/gmp-4.3.2 --with-mpfr=/export/home/local/gcc-4.6.2/mpfr-3.0.0 --with-mpc=/export/home/local/gcc-4.6.2/mpc-0.8.2 --with-libelf=/export/home/local/gcc-4.6.2/libelf-0.8.12 --enable-shared --enable-threads=posix --enable-checking=release --with-system-zlib --enable-__cxa_atexit --enable-languages=c,c++ --with-as=/usr/local/bin/as --with-gnu-as --with-ld=/usr/ccs/bin/ld --without-gnu-ld --enable-plugin --enable-multilib --enable-version-specific-runtime-libs --enable-bootstrap --enable-ssp --enable-libssp --with-included-gettext --enable-lto --host=i386-pc-solaris2.10 --build=i386-pc-solaris2.10 Thread model: posix gcc version 4.6.2 (GCC) Callstack backtrace (lines begining with = are my comments): = = deadlock here: the threads is waiting itself = #0 0xfd459019 in __lwp_park () from /lib/libc.so.1 #1 0xfd45365e in cond_sleep_queue () from /lib/libc.so.1 #2 0xfd453817 in cond_wait_queue () from /lib/libc.so.1 #3 0xfd453b94 in cond_wait_common () from /lib/libc.so.1 #4 0xfd453d02 in _cond_wait () from /lib/libc.so.1 #5 0xfd453d2d in cond_wait () from /lib/libc.so.1 #6 0xfd453d66 in pthread_cond_wait () from /lib/libc.so.1 #7 0xfd632898 in __gthread_cond_wait (g=0xfd822ea8) at ...build-gcc/out/i386-pc-solaris2.10/libstdc++-v3/include/i386-pc-solaris2.10/bits/gthr-default.h:846 #8 __gthread_cond_wait_recursive (g=0xfd822ea8) at ...work/build-gcc/out/i386-pc-solaris2.10/libstdc++-v3/include/i386-pc-solaris2.10/bits/gthr-default.h:860 #9 __gnu_cxx::__cond::wait_recursive (g=0xfd822ea8) at ...build-gcc/out/i386-pc-solaris2.10/libstdc++-v3/include/ext/concurrence.h:377 #10 __cxa_guard_acquire (g=0xfd822ea8) at .../src/gcc-4.6.2/libstdc++-v3/libsupc++/guard.cc:289 = = Reentrant call to boost::system::generic_category() = #11 0xfd812313 in boost::system::generic_category () at libs/system/src/error_code.cpp:425 #12 0xfe85cd38 in __static_initialization_and_destruction_0(__initialize_p=1, __priority=65535) at ./boost/system/error_code.hpp:214 #13 0xfe85d05f in _GLOBAL__sub_I_instantiate_re2c_lexer_str.cpp () at libs/wave/src/instantiate_re2c_lexer_str.cpp:56 = = static initization of boost.wave library = #14 0xfe8868fd in __do_global_ctors_aux () from ...boost/lib/libboost_wave-gcc46-mt-d-32-SOLARIS-X86-1_52.so.1.52.0 #15 0xfe88692a in _init () from ...boost/lib/libboost_wave-gcc46-mt-d-32-SOLARIS-X86-1_52.so.1.52.0 #16 0xfefce37e in call_init () from /usr/lib/ld.so.1 #17 0xfefce1cf in is_dep_init () from /usr/lib/ld.so.1 #18 0xfefdaa4b in elf_bndr () from /usr/lib/ld.so.1 #19 0xfefc2ab4 in elf_rtbndr () from /usr/lib/ld.so.1 #20 0xfee60688 in ?? () #21 0xfee0c8f6 in boost::exception_detail::get_static_exception_object<boost::exception_detail::bad_alloc_>() at ./boost/exception/detail/exception_ptr.hpp:119 #22 0xfee0c0d2 in __static_initialization_and_destruction_0(__initialize_p=1, __priority=65535) at ./boost/exception/detail/exception_ptr.hpp:138 #23 0xfee0c271 in _GLOBAL__sub_I_future.cpp () at libs/thread/src/future.cpp:60 = = static initization of boost.thread library = #24 0xfee0d98d in __do_global_ctors_aux () from ...boost/lib/libboost_thread-gcc46-mt-d-32-SOLARIS-X86-1_52.so.1.52.0 #25 0xfee0d9ba in _init () from ...boost/lib/libboost_thread-gcc46-mt-d-32-SOLARIS-X86-1_52.so.1.52.0 #26 0xfefce37e in call_init () from /usr/lib/ld.so.1 #27 0xfefce1cf in is_dep_init () from /usr/lib/ld.so.1 #28 0xfefdaa4b in elf_bndr () from /usr/lib/ld.so.1 #29 0xfefc2ab4 in elf_rtbndr () from /usr/lib/ld.so.1 #30 0xfdce0688 in ?? () = = First calll to boost::system::generic_category() = #31 0xfd81232a in boost::system::generic_category () at libs/system/src/error_code.cpp:425 #32 0xfd812386 in __static_initialization_and_destruction_0(__initialize_p=1, __priority=65535) at ./boost/system/error_code.hpp:214 #33 0xfd8123ed in _GLOBAL__sub_I_error_code.cpp () at libs/system/src/error_code.cpp:430 = = static initialization of boost.system = #34 0xfd8126ed in __do_global_ctors_aux () from ...boost/lib/libboost_system-gcc46-mt-d-32-SOLARIS-X86-1_52.so.1.52.0 #35 0xfd81271a in _init () from ...boost/lib/libboost_system-gcc46-mt-d-32-SOLARIS-X86-1_52.so.1.52.0 #36 0xfefce37e in call_init () from /usr/lib/ld.so.1 #37 0xfefcd7d5 in setup () from /usr/lib/ld.so.1 #38 0xfefdba3e in _setup () from /usr/lib/ld.so.1 #39 0xfefc299c in _rt_boot () from /usr/lib/ld.so.1 #40 0x08047540 in ?? () #41 0x08047670 in ?? () More thanks for reading all.

3 4

zlib not building (fedora x86_64)
by Neal Becker 02 Jul '13

02 Jul '13

I noticed zlib are not being built. I don't know why. rpm -qa zlib* zlib-1.2.7-9.fc18.i686 zlib-1.2.7-9.fc18.x86_64 zlib-devel-1.2.7-9.fc18.x86_64 bjam cxxflags=-march=native -sHAVE_ICU=1 -sEXPAT_INCLUDE=/usr - sEXPAT_LIBPATH=/usr/lib64 --layout=tagged threading=single,multi link=shared stage warning: No toolsets are configured. warning: Configuring default toolset "gcc". warning: If the default is wrong, your build may not work correctly. warning: Use the "toolset=xxxxx" option to override our guess. warning: For more configuration options, please consult warning: http://boost.org/boost-build2/doc/html/bbv2/advanced/configuration.html Performing configuration checks - 32-bit : no - 64-bit : yes - arm : no - mips1 : no - power : no - sparc : no - x86 : yes error: No best alternative for libs/coroutine/build/allocator_sources next alternative: required properties: <link>static <target-os>windows <threading>multi not matched next alternative: required properties: <link>static <segmented-stacks>on <threading>multi not matched next alternative: required properties: <link>static <threading>multi not matched - has_icu builds : yes warning: Graph library does not contain MPI-based parallel components. note: to enable them, add "using mpi ;" to your user-config.jam - zlib : no - iconv (libc) : yes - icu : yes - compiler-supports-ssse3 : yes - compiler-supports-avx2 : yes - gcc visibility : yes - long double support : yes warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. error: No best alternative for libs/coroutine/build/allocator_sources next alternative: required properties: <link>static <target-os>windows <threading>multi not matched next alternative: required properties: <link>static <segmented-stacks>on <threading>multi not matched next alternative: required properties: <link>static <threading>multi not matched - zlib : no (cached) Component configuration: - atomic : building - chrono : building - context : building - coroutine : building - date_time : building - exception : building - filesystem : building - graph : building - graph_parallel : building - iostreams : building - locale : building - log : building - math : building - mpi : building - program_options : building - python : building - random : building - regex : building - serialization : building - signals : building - system : building - test : building - thread : building - timer : building - wave : building

1 0

boost 1.54.0 support for VS2013
by Charles_J_Wilson＠Dell.com 01 Jul '13

01 Jul '13

Has visualc.hpp been updated to support VC++12? (this was released in Visual Studio 2013 preview). I get the following issue with 1.54.0 beta built with VC++11 when compiling using VC++12: Error 1 error C2039: 'assert_not_arg' : is not a member of 'boost::mpl' (..\..\..\Logging\source\Core.cpp) C:\Users\Charles_J_Wilson\Documents\Projects\external\open_source\boost\1.54.0\boost_1_54_0\boost\iterator\detail\facade_iterator_category.hpp 166 Which is: # if !BOOST_WORKAROUND(BOOST_MSVC, <= 1300) BOOST_MPL_ASSERT_NOT((is_iterator_category<Traversal>)); # endif The beta doesn't recognize the compiler version and suggests running the config tests. Where are the instructions for that? Charles Wilson Principal Software Development Engineer Dell | Enterprise Solutions Group

2 1

[range] Time to merge Oven-to-Boost Extensions?
by Michel Morin 30 Jun '13

30 Jun '13

Hi, IIRC, the formal review is not necessary for the merge of Akira's Oven-to-Boost Extensions; only the range authors' review/permission are necessary. Neil, Nate, could we merge the extensions in the near future? I think everyone wants * `dropped` adaptor * `elements` adaptor * `taken` adaptor * `regular` utility so merging these first (and eventually merging the rest) would make the users happy. Regards, Michel

4 4

Re: [boost] Any interest in bitstream class?
by Brian Wood 30 Jun '13

30 Jun '13

From: Rob Stewart > On Jun 28, 2013, at 6:50 PM, Paul Long <plong(a)packetizer.com> wrote: > >> Correct, but it is important to note that integrals are always encoded big endian in the bitstream. I >>suppose it's possible that someone would want some other endian, but that's got to be an obscure use >>case. > > There are plenty of little endian only contexts that would want to avoid the host->network->host > conversions for all transfers. The C++ Middleware Writer uses a "receiver makes right" approach to support that. There's a SameFormat class here: http://webEbenezer.net/misc/Formatting.hh that's used when both sides have the same endian-ness. -- Brian Ebenezer Enterprises - Was Eisenhower the last decent US President? http://webEbenezer.net

2 1

Re: [boost] [Boost-users] Herb Sutter on C++ Standardization and Visual Studio
by Nathan Ridge 30 Jun '13

30 Jun '13

> Herb Sutter on C++ Standardization at Microsoft. > > http://channel9.msdn.com/Events/Build/2013/2-306 > > SGL Pretty good news, IMO. In addition to the C++11 and C++14 plans, Herb announced that Microsoft would complete the holes in their C++98 standard support by finally fixing their preprocessor and implementing correct two-phase name lookup (39:18 in the video). Perhaps the last discussion about these things [1] helped to tip the scale. In any case, I'm glad to hear it. Regards, Nate [1] http://boost.2283326.n4.nabble.com/C-announcements-coming-tomorrow-td463790…

1 0

boost::thread dependency on boost::chrono (windows implementation)
by Christian Hägele 28 Jun '13

28 Jun '13

Hello, as boost::thread now depends on boost::chrono I have the following questions: In boost::chrono on windows the the steady_clock is implemented via QueryPerformanceCounter. This may lead to wrong results because on some systems QueryPerformanceCounter gives different results on different processors. In our software we encountered theses problems regularly on some customers machines and thus stopped using QueryPerformanceCounter without additional checking. The problem I'm talking about is described as a TODO in boost/chrono/system_clocks.hpp My questions is if functions like boost::thread::timed_join or boost::mutex::timed_wait may have similar problems on hardware where QueryPerformanceCounter gives wrong result. Is there a way (like a preprocessor macro) to have boost::thread use the old implementation independent from boost::chrono? Regards, Christian

8 10

[1.54.0] Release candidates available
by Marshall Clow 28 Jun '13

28 Jun '13

Release candidate files for 1.54.0 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: efbfbff5a85a9330951f243d0a46e4b9 *boost_1_54_0_rc1.tar.gz 15cb8c0803064faef0c4ddf5bc5ca279 *boost_1_54_0_rc1.tar.bz2 78a35834c45220a6164310e280abe675 *boost_1_54_0_rc1.zip 89e734ffd2afe0982b2d9fc21d033dba *boost_1_54_0_rc1.7z Thanks! -- The release managers

6 9

Re: [boost] Could the custom allocator for flyweight hashed_factory be the boost::interprocess::allocator?
by JOAQUIN M. LOPEZ MUÑOZ 28 Jun '13

28 Jun '13

H Jin, ________________________________________ De: Boost [boost-bounces(a)lists.boost.org] en nombre de Jin Chen [chenjin92(a)gmail.com] Enviado el: lunes, 24 de junio de 2013 19:56 Para: Boost(a)lists.boost.org Asunto: [boost] Could the custom allocator for flyweight hashed_factory be the boost::interprocess::allocator? > I want to use boost::flyweight to do the dedupilcation of > boost::interprocess::basic_string object. I wrote a small test program for > that. In my program: > The flyweight works fine with the interprocess::basic_string which uses the > interprocess::allocator only with the default hashed_factory. The default > hashed_factory is ideal except that it uses std::allocator instead of > interprocess::allocator. I followed the > http://www.boost.org/doc/libs/1_53_0/libs/flyweight/doc/tutorial/configurat… > specifier > of a custom hash_factory which can change its allocator to the interprocess > one, but then got insanely long compiler error that is super hard to > decode... This is a very interesting exercise! There are several problems with your solution: * First of all, hashed_factory, as Jonathan points out, assumes the allocator is default constructible. As boost::interprocess::allocator needs a segment manager at construction time, you can overcome this by writing a custom interprocess allocator that takes that info statically, i.e., from a type that returns the segment manager: struct memory_dat_segment_manager { typedef ipc::managed_mapped_file::segment_manager type; static type* get() { static ipc::managed_mapped_file* segment= new ipc::managed_mapped_file(ipc::open_or_create,"memory.dat",409600); return segment->get_segment_manager(); } }; template<typename T,typename SegmentManager> struct segment_allocator: boost::interprocess::allocator<T,typename SegmentManager::type> { typedef boost::interprocess::allocator<T,typename SegmentManager::type> super; segment_allocator():super(SegmentManager::get()){} template<typename T2> segment_allocator(const segment_allocator<T2,SegmentManager>& x):super(x){} super& base(){return *this;} template<typename T2> struct rebind{ typedef segment_allocator<T2,SegmentManager> other; }; friend void swap(segment_allocator& x,segment_allocator& y) { swap(x.base(),y.base()); } }; Note that segment_allocator is default constructible: the segment is created on the first call to memory_dat_segment_manager. * Now, the holder class (www.boost.org/libs/flyweight/doc/tutorial/configuration.html#holders ) needs also to place its content in shared memory. As none of the holders provided by Boost.Flyweight does this, we must define our own: template<typename SegmentManager,typename C> struct segment_holder_class:boost::flyweights::holder_marker { static C& get() { static C* pc=SegmentManager::get()-> find_or_construct<C>(typeid(segment_holder_class).name())(); return *pc; } }; template<typename SegmentManager> struct segment_holder:boost::flyweights::holder_marker { template<typename C> struct apply { typedef segment_holder_class<SegmentManager,C> type; }; }; Again, the holder uses a SegmentManager class to get access to the segment manager * Finally, you need an interprocess locking policy (www.boost.org/libs/flyweight/doc/tutorial/configuration.html#locking ), and again this needs to be custom-defined (note that, in order for labeled_recursive_mutex to be default constructible, we get the info needed at construction time (the name of the mutex) from a Name class much in the same way we did with SegmentManager before for the allocator and holder): template<typename Name> struct labeled_recursive_mutex { typedef boost::interprocess::named_recursive_mutex mutex_type; operator mutex_type&() { static mutex_type mutex( boost::interprocess::open_or_create,Name::get()); return mutex; } }; template<typename Name> struct labeled_locking:boost::flyweights::locking_marker { typedef labeled_recursive_mutex<Name> mutex_type; typedef boost::interprocess::scoped_lock< typename labeled_recursive_mutex<Name>::mutex_type> lock_type; }; There's a technical issue here (if you don't get the following explanation you might as well skip it): As the mutex used by Boost.Flyweight is created by the holder class and we are using a shared-memory custom holder, it turns out labeled_recursive_mutex is thus created in shared memory. But boost::interprocess::named_recursive_mutex cannot be created in shared memory: we solve the problem with operator mutex_type&(), which actually creates the real mutex as a static variable in regular memory. And we're done. Find attached a small complete program showing how to put all the pieces together. Best, Joaquín M López Muñoz Telefónica Digital ________________________________ Este mensaje se dirige exclusivamente a su destinatario. Puede consultar nuestra política de envío y recepción de correo electrónico en el enlace situado más abajo. This message is intended exclusively for its addressee. We only send and receive email on the basis of the terms set out at: http://www.tid.es/ES/PAGINAS/disclaimer.aspx

2 1

[Spirit] Retrieve informations out of tokens
by ... ... 27 Jun '13

27 Jun '13

Hi, I want to create a c++ syntax analysor (for creating auto-completion tools), and to help me, I want to use the boost.spirit library. In order to learn the basics of spirit, I executed this exercise. It is now working but I want to display the tokens' characters instead of counting tokens. The problem is I don't know the properties of the argument passed to my functor (the variable "t" in the code below). What is the type of this variable and what are the public method/attributes we can use on ? This is the code of my functor : struct counter{ counter() : j(0) {j = new int();} counter(const counter &model) : j(model.j) {} ~counter() {delete int;} template <typename Token> bool operator()(Token const& t){//I want to know the type of this variable t ++i; ++(*j); std::ostringstream oss; oss << "global : " << i << " membre : " << *j;//typeid(t).name(); printf("%s\n", oss.str().c_str()); return true; } int* j;}; The variable t will be relay to my functor by the following tokenize function : counter* foncteur = new counter();lex::tokenize(first, last, word_count_functor, *foncteur); I still have other questions : I read a consistent part of the documentation but I have not been able to define the type of regex used by boost.spirit. Which type is it ? What is the more appropriate function to use to analyse c++ synthax : tokenize or tokenize _and_parse ? You seems to describe tokenize_and_parse as a more powerful tool, but is it possible to define all the syntax of c++ using a parser ? Could I find an example of c++ syntax analysor using boost.spirit ? Any help would be appreciate,Cordialy,Guillaume Bersac237bis rue de Pessac33000 Bordeaux06.65.30.89.43

6 11

Interest in an 'either' library?
by David Sankel 26 Jun '13

26 Jun '13

**semantics**: template< typename left_type, typename right_type> struct either { // postcondition, is_left() either( left_type ); // postcondition, is_right() either( right_type ); bool is_left() const; bool is_right() const; // postcondition, is_left() either & operator=( left_type ); // postcondition, is_right() either & operator=( right_type ); // precondition, is_left() left_type left(); // precondition, is_right() right_type right(); private: }; **uses**: **Use 1**: Can be used as an alternative to exceptions or the (error codes+set reference idiom): either<error_code, file_id> load_file(...); vs. error_code load_file( file_id &, ... ); or // throws std::exception file_id load_file(...); **Use 2**: A lightweight alternative to boost::variant when only 2 components are required (either relates to variant in a similar way that pair relates to tuple ). variant<A,B> eitherAOrB; if( A * aPtr = boost::get<A>( &eitherAOrB ) ) std::cout << "A: " << *aPtr; else std::cout << "B: " << boost::get( eitherAOrB ); vs. either<A,B> eitherAOrB; if( eitherAOrB.is_left() ) std::cout << "A: " << eitherAOrB.left(); else std::cout << "B: " << eitherAOrB.right(); --David Sankel

12 41

[1.54.0] Release notes
by Daniel James 26 Jun '13

26 Jun '13

Hello everyone, It's time to send me your release notes, or if you're feeling enthusiastic, you can add them yourself at: http://svn.boost.org/svn/boost/website/public_html/live/feed/history/ You see the notes so far at: http://www.boost.org/users/history/version_1_54_0.html And while I'm at it, I've also added the new libraries to: http://www.boost.org/doc/libs/1_54_0/ thank you, Daniel

11 16

[1.54.0][range] add release note
by Akira Takahashi 26 Jun '13

26 Jun '13

Hi, I think missing Boost.Range release note for 1.54.0. https://svn.boost.org/svn/boost/website/public_html/live/feed/history/boost… Please see changeset: https://svn.boost.org/trac/boost/changeset/84823 Changeset 84823 Timestamp:06/17/13 22:22:07 Author:nathanridge Message:[range] Merge Boost.Range bug fixes to release branch (fixes #6944; fixes #7407; fixes #7408; fixes #7731; fixes #7827; fixes #8338; fixes #8453). Thanks, Akira

2 1

[Boost][asio]How add a timeout to asio connection?
by Renato Forti 25 Jun '13

25 Jun '13

Hi All, I have one problem, I have this class to connect to my server app: class session { public: static void init( const std::string& host, const std::string& port, hades::archive::archive& iarch, hades::archive::archive& oarch) { boost::asio::io_service io_service; client client(io_service, host, port, iarch, oarch); io_service.run(); } }; The problem is : if my server is down, my client (session) will block on io_service.run(); the client nerves end. Then I try to add a time out: class client { public: /// Constructor starts the asynchronous connect operation. client(boost::asio::io_service& io_service, const std::string& host, const std::string& port, // service hades::archive::archive& iarch, hades::archive::archive& oarch) : connection_(io_service) , deadline_(io_service) , iarch_(&iarch) , oarch_(&oarch) { deadline_.async_wait(boost::bind(&client::check_deadline, this)); deadline_.expires_from_now(boost::posix_time::seconds(30)); // Resolve the host name into an IP address. boost::asio::ip::tcp::resolver resolver(io_service); boost::asio::ip::tcp::resolver::query query(host, port); boost::asio::ip::tcp::resolver::iterator endpoint_iterator = resolver.resolve(query); // Start an asynchronous connect operation. boost::asio::async_connect(connection_.socket(), endpoint_iterator, boost::bind(&client::handle_connect, this, boost::asio::placeholders::error)); } /// Handle completion of a connect operation. void handle_connect(const boost::system::error_code& e) { if (!e) { // Successfully established connection. Start operation to read the list // of stocks. The connection::async_read() function will automatically // decode the data that is read from the underlying socket. connection_.async_read(*oarch_, boost::bind(&client::handle_read, this, boost::asio::placeholders::error)); connection_.async_write(*iarch_, boost::bind(&client::handle_write, this, boost::asio::placeholders::error)) ; } else { // An error occurred. throw sync_client_exception(e.message()); } } // Handle completion of a write operation. void handle_write(const boost::system::error_code& e) { } // Handle completion of a read operation. void handle_read(const boost::system::error_code& e) { } void check_deadline() { // Check whether the deadline has passed. We compare the deadline against // the current time since a new asynchronous operation may have moved the // deadline before this actor had a chance to run. if (deadline_.expires_at() <= deadline_timer::traits_type::now()) { // The deadline has passed. The socket is closed so that any outstanding // asynchronous operations are cancelled. connection_.socket().close(); // There is no longer an active deadline. The expiry is set to positive // infinity so that the actor takes no action until a new deadline is set. deadline_.expires_at(boost::posix_time::pos_infin); throw sync_client_exception("Time out : deadline on client!"); } // Put the actor back to sleep. deadline_.async_wait(boost::bind(&client::check_deadline, this)); } private: // The connection to the server. dsafe::sync::connection connection_; // The data received from the server. hades::archive::archive *iarch_; hades::archive::archive *oarch_; deadline_timer deadline_; }; The problem is that now the timeout expires even if the connection to the server occurs. What is wrong? My timeout should be disabled when the connection is successful! How do I get it? Only when the connection fails it should be called! Thanks for clarification

3 2

Could the custom allocator for flyweight hashed_factory be the boost::interprocess::allocator?
by Jin Chen 25 Jun '13

25 Jun '13

I want to use boost::flyweight to do the dedupilcation of boost::interprocess::basic_string object. I wrote a small test program for that. In my program: The flyweight works fine with the interprocess::basic_string which uses the interprocess::allocator only with the default hashed_factory. The default hashed_factory is ideal except that it uses std::allocator instead of interprocess::allocator. I followed the http://www.boost.org/doc/libs/1_53_0/libs/flyweight/doc/tutorial/configurat… specifier of a custom hash_factory which can change its allocator to the interprocess one, but then got insanely long compiler error that is super hard to decode... Right now, I don't know if only use interprocess::allocator in interprocess::basic_string alone will make the flyweight object be shared by multiple process, guess probably not... Then wonder whether that I didn't use the right syntax for custom hashed_factory or flyweight is compatible with boost::interprocess at all... If it is compatible, what's the right syntax for that? How shall I change my code? Below is a test program attached. The code could compile now with flyweight's default hashed_factory. The goal is to make it compile with ShmStringHashedFactory which use the interprocess allocator.

2 1

Proposal for a thread "collision" detector
by Gaetano Mendola 24 Jun '13

24 Jun '13

I would like to know if Boost community could be interested in adopting a check mechanism that is able to detect if a not supposed thread safe class is used by multiple threads in unsafe way. This tecnique has saved us a lot of headache especially when code refactoring on old code is performed. Better to explain it, without enter in the detail of the implementation, with some examples: Example: Queue implementation non thread-safe but still usable if clients are synchronized somehow. class NonThreadSafeQueue { public: ... void push(int) { DFAKE_SCOPED_LOCK(push_pop_); ... } int pop() { DFAKE_SCOPED_LOCK(push_pop_); ... } ... private: DFAKE_MUTEX(push_pop_); }; Example: Queue implementation not usable even if clients are synchronized, so only one thread in the class life cycle can use the two members push/pop. In this case the macro DFAKE_SCOPED_LOCK_THREAD_LOCKED pins the specified critical section the first time a thread enters push or pop, from that time on only that thread is allowed to execute push or pop. class NonThreadSafeQueue { public: ... void push(int) { DFAKE_SCOPED_LOCK_THREAD_LOCKED(push_pop_); ... } int pop() { DFAKE_SCOPED_LOCK_THREAD_LOCKED(push_pop_); ... } ... private: DFAKE_MUTEX(push_pop_); }; Example: Class that has to be contructed/destroyed on same thread, it has a "shareable" method (with external syncronization) and a not shareable method (even with external synchronization). In this case 3 Critical sections have to be defined class ExoticClass { public: ExoticClass() { DFAKE_SCOPED_LOCK_THREAD_LOCKED(ctor_dtor_); ... } ~ExoticClass() { DFAKE_SCOPED_LOCK_THREAD_LOCKED(ctor_dtor_); ... } void Shareable() { DFAKE_SCOPED_LOCK(shareable_section_); ... } void NotShareable() { DFAKE_SCOPED_LOCK_THREAD_LOCKED(ctor_dtor_); ... } ... private: DFAKE_MUTEX(ctor_dtor_) DFAKE_MUTEX(shareable_section_) }; DFAKE_SCOPED_LOCK will "throw an exception" or will call an "abort" in case of check failed. This tecnique doesn't involve real lock/unlock but uses atomic operations, also the various macros DFAKE_XXXXXXXXX are defined void when NDEBUG is defined. Any comment is appreciated. Regards Gaetano Mendola

3 3

The release branch is CLOSED - except by specific permission
by Marshall Clow 24 Jun '13

24 Jun '13

We're counting down to release next Monday. -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

1 0

Heads up - Release branch closed as of tomorrow
by Marshall Clow 24 Jun '13

24 Jun '13

Starting tomorrow (Monday, June 27), the release branch will be closed, except by permission from the release managers. -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

3 5

[smart_ptr] enable_shared_from_this and shared_ptr to a base class
by Adam Romanek 24 Jun '13

24 Jun '13

Hi, I have a question related to using shared_from_this() and a shared_ptr to a base class. Here's a modified version of the enable_shared_from_this usage example from its documentation web page: #include <boost/enable_shared_from_this.hpp> #include <boost/shared_ptr.hpp> #include <cassert> class X { public: virtual void foo() = 0; }; class Y: public X, public boost::enable_shared_from_this<Y> { virtual void foo() { shared_from_this(); } }; int main() { X* x_ptr = new Y; boost::shared_ptr<X> sp(x_ptr); sp->foo(); } First, class Y is now derived from class X. Secondly, shared_ptr's template argument is now X and the parameter to the shared_ptr's constructor is now a pointer to X. Now, calling shared_from_this() in X and/or Y throws boost::bad_weak_ptr. Is this correct behavior? Is it documented somewhere? I know that the example is a bit unrealistic since most of the time shared_ptr is constructed directly from the pointer returned by 'new Y' or created by make_shared() but still, this is something that bothers me. WBR, Adam Romanek

3 9

Boost.Spirit how to use token in functor
by ... ... 24 Jun '13

24 Jun '13

Hi, I have a functor which is working, but its argument, which I don't know its type, I don't know what to do with it. I want to extract data out of it, I want to know is beginning and its end, I want to display the the content of the string character in my consol... but I can't retrieve this information. How could I archieve it ? What is the type of the argument relay to my function ? Is there a dOxygen like documentation (the one on the Boost site is great but a formal documentaton is also interesting). Where is the description and code source of this type ? Here is the code of my functor : struct counter{ counter() : j(0) {j = new int();} counter(const counter &model) : j(model.j) {} template <typename Token> bool operator()(Token const& t){// t is the argument I want to use ++i; ++(*j); std::ostringstream oss; oss << "global : " << i << " membre : " << *j;//typeid(t).name(); printf("%s\n", oss.str().c_str()); return true; } int* j;}; Thanks every one, cordialy,Guillaume Bersac237bis rue de Pessac33000 Bordeaux06.65.30.89.43

2 1

De Bruijn Bind (alternate bind syntax) Interest?
by David Sankel 24 Jun '13

24 Jun '13

Hello all, I've been working on an alternate bind syntax based on De Bruijn indices[1]. The syntax is very simple, yet the terms are very powerful. Here is an example of a function const that takes in an argument c and returns another function that, for all input, returns c: //λx.λy.x = λλ1 with De Bruijn indices. auto const_ = abs<1>( abs<1>( var<1,0>() ) ); More examples, further explanation, and an implementation are available here[2]. I'm thinking that this library could also be useful as a core for more syntax heavy bind variations. David [1] http://en.wikipedia.org/wiki/De_Bruijn_index [2] http://bitbucket.org/camior/de-bruijn-bind/ -- David Sankel Sankel Software www.sankelsoftware.com 585 617 4748 (Office)

11 73

Error while linking boost. spirit
by ... ... 23 Jun '13

23 Jun '13

Hi, I just downloaded, compiled and install boost.It seems like the installation process worked fine and I successfully compiled a program using boost (boost.log for instance). But when I try to compile an example writed by the developpers of boost.spirit, it fail ! It doesn't seem like it's an inclusion resolution problems, I don't know what to do. Please help me. Here is my code (I paste it from this page) : #include <stdio.h>#include <stdlib.h> #include <boost/spirit/include/lex_lexertl.hpp>#include <boost/spirit/include/phoenix_operator.hpp>#include <boost/spirit/include/phoenix_statement.hpp>#include <boost/spirit/include/phoenix_algorithm.hpp>#include <boost/spirit/include/phoenix_core.hpp>#define BOOST_ALL_DYN_LINK//without it boost.log glitch#include <boost/log/trivial.hpp> int main(){ BOOST_LOG_TRIVIAL(trace) << "boost.log is working !"; typedef lex::lexertl::token<char const*, lex::omit, boost::mpl::false_> token_type; typedef lex::lexertl::actor_lexer<token_type> lexer_type; word_count_tokens<lexer_type> word_count_lexer; std::string str (read_from_file("mainwindow.cpp.txt")); char const* first = str.c_str(); char const* last = &first[str.size()]; lexer_type::iterator_type iter = word_count_lexer.begin(first, last); lexer_type::iterator_type end = word_count_lexer.end(); while (iter != end && token_is_valid(*iter)) ++iter; if (iter == end) { std::cout << "lines: " << word_count_lexer.l << ", words: " << word_count_lexer.w << ", characters: " << word_count_lexer.c << "\n"; } else { std::string rest(first, last); std::cout << "Lexical analysis failed\n" << "stopped at: \"" << rest << "\"\n"; } return 0; }} And here is my error log : 11:32:39 **** Incremental Build of configuration Default for project synthax_analyser ****make all g++ -O2 -g -Wall -fmessage-length=0 -c -o synthax_analyser.o synthax_analyser.cppsynthax_analyser.cpp: In function ‘int main()’:synthax_analyser.cpp:24:4: error: ‘lex’ does not name a typesynthax_analyser.cpp:27:10: error: ‘lex’ does not name a typesynthax_analyser.cpp:29:2: error: ‘word_count_tokens’ was not declared in this scopesynthax_analyser.cpp:29:20: error: ‘lexer_type’ was not declared in this scopesynthax_analyser.cpp:29:20: note: suggested alternative:In file included from /usr/local/include/boost/spirit/home/lex/meta_compiler.hpp:16:0, from /usr/local/include/boost/spirit/home/lex/reference.hpp:14, from /usr/local/include/boost/spirit/home/lex/lexer/token_def.hpp:21, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:14, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/spirit/home/lex/lexer_type.hpp:20:12: note: ‘boost::spirit::lex::lexer_type’synthax_analyser.cpp:29:32: error: ‘word_count_lexer’ was not declared in this scopesynthax_analyser.cpp:31:54: error: ‘read_from_file’ was not declared in this scopesynthax_analyser.cpp:35:2: error: ‘lexer_type’ is not a class or namespacesynthax_analyser.cpp:35:28: error: expected ‘;’ before ‘iter’synthax_analyser.cpp:36:3: error: ‘lexer_type’ is not a class or namespacesynthax_analyser.cpp:36:29: error: expected ‘;’ before ‘end’synthax_analyser.cpp:38:9: error: ‘iter’ was not declared in this scopesynthax_analyser.cpp:38:17: error: ‘end’ was not declared in this scopesynthax_analyser.cpp:38:17: note: suggested alternatives:In file included from /usr/local/include/boost/range/empty.hpp:20:0, from /usr/local/include/boost/proto/functional/range/empty.hpp:12, from /usr/local/include/boost/proto/functional/range.hpp:13, from /usr/local/include/boost/proto/functional.hpp:14, from /usr/local/include/boost/proto/proto.hpp:16, from /usr/local/include/boost/spirit/home/support/terminal.hpp:18, from /usr/local/include/boost/spirit/home/support/common_terminals.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer/terminals.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:13, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/range/end.hpp:106:61: note: ‘boost::range_adl_barrier::end’In file included from /usr/local/include/boost/fusion/container/list/cons.hpp:14:0, from /usr/local/include/boost/fusion/iterator/segmented_iterator.hpp:13, from /usr/local/include/boost/fusion/sequence/intrinsic/detail/segmented_begin.hpp:11, from /usr/local/include/boost/fusion/sequence/intrinsic/begin.hpp:17, from /usr/local/include/boost/fusion/container/vector/vector10.hpp:15, from /usr/local/include/boost/fusion/container/vector.hpp:12, from /usr/local/include/boost/fusion/include/vector.hpp:10, from /usr/local/include/boost/spirit/home/phoenix/core/limits.hpp:73, from /usr/local/include/boost/spirit/home/phoenix/core.hpp:11, from /usr/local/include/boost/spirit/include/phoenix_core.hpp:14, from /usr/local/include/boost/spirit/home/support/terminal.hpp:16, from /usr/local/include/boost/spirit/home/support/common_terminals.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer/terminals.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:13, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/fusion/sequence/intrinsic/end.hpp:89:5: note: ‘boost::fusion::end’In file included from /usr/local/include/boost/fusion/sequence/intrinsic/begin.hpp:13:0, from /usr/local/include/boost/fusion/container/vector/vector10.hpp:15, from /usr/local/include/boost/fusion/container/vector.hpp:12, from /usr/local/include/boost/fusion/include/vector.hpp:10, from /usr/local/include/boost/spirit/home/phoenix/core/limits.hpp:73, from /usr/local/include/boost/spirit/home/phoenix/core.hpp:11, from /usr/local/include/boost/spirit/include/phoenix_core.hpp:14, from /usr/local/include/boost/spirit/home/support/terminal.hpp:16, from /usr/local/include/boost/spirit/home/support/common_terminals.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer/terminals.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:13, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/fusion/sequence/intrinsic_fwd.hpp:67:16: note: ‘boost::fusion::result_of::end’In file included from /usr/local/include/boost/fusion/support/sequence_base.hpp:11:0, from /usr/local/include/boost/fusion/container/vector/vector10.hpp:11, from /usr/local/include/boost/fusion/container/vector.hpp:12, from /usr/local/include/boost/fusion/include/vector.hpp:10, from /usr/local/include/boost/spirit/home/phoenix/core/limits.hpp:73, from /usr/local/include/boost/spirit/home/phoenix/core.hpp:11, from /usr/local/include/boost/spirit/include/phoenix_core.hpp:14, from /usr/local/include/boost/spirit/home/support/terminal.hpp:16, from /usr/local/include/boost/spirit/home/support/common_terminals.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer/terminals.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:13, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/mpl/begin_end_fwd.hpp:23:38: note: ‘boost::mpl::end’In file included from /usr/local/include/boost/proto/functional/range.hpp:14:0, from /usr/local/include/boost/proto/functional.hpp:14, from /usr/local/include/boost/proto/proto.hpp:16, from /usr/local/include/boost/spirit/home/support/terminal.hpp:18, from /usr/local/include/boost/spirit/home/support/common_terminals.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer/terminals.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:13, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/proto/functional/range/end.hpp:19:12: note: ‘boost::proto::functional::end’In file included from /usr/local/include/boost/range/empty.hpp:20:0, from /usr/local/include/boost/proto/functional/range/empty.hpp:12, from /usr/local/include/boost/proto/functional/range.hpp:13, from /usr/local/include/boost/proto/functional.hpp:14, from /usr/local/include/boost/proto/proto.hpp:16, from /usr/local/include/boost/spirit/home/support/terminal.hpp:18, from /usr/local/include/boost/spirit/home/support/common_terminals.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer/terminals.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:13, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/range/end.hpp:106:61: note: ‘boost::range_adl_barrier::end’In file included from /usr/local/include/boost/spirit/home/support/string_traits.hpp:16:0, from /usr/local/include/boost/spirit/home/support/nonterminal/expand_arg.hpp:20, from /usr/local/include/boost/spirit/home/support/context.hpp:18, from /usr/local/include/boost/spirit/home/qi/domain.hpp:18, from /usr/local/include/boost/spirit/home/qi/parser.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer/token_def.hpp:17, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:14, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/spirit/home/support/container.hpp:445:5: note: ‘boost::spirit::traits::end’In file included from /usr/local/include/boost/spirit/home/support/handles_container.hpp:14:0, from /usr/local/include/boost/spirit/home/lex/lexer/token_def.hpp:16, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:14, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/spirit/home/support/attributes_fwd.hpp:43:12: note: ‘boost::spirit::result_of::end’In file included from /usr/local/include/boost/spirit/home/support/info.hpp:17:0, from /usr/local/include/boost/spirit/home/lex/lexer/token_def.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:14, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/foreach.hpp:730:1: note: ‘boost::foreach_detail_::end’synthax_analyser.cpp:38:44: error: ‘token_is_valid’ was not declared in this scopesynthax_analyser.cpp:38:44: note: suggested alternatives:In file included from /usr/local/include/boost/spirit/home/lex/lexer/lexertl/lexer.hpp:20:0, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:16, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/spirit/home/lex/lexer/lexertl/token.hpp:415:5: note: ‘boost::spirit::lex::lexertl::token_is_valid’In file included from /usr/local/include/boost/spirit/home/lex/lexer/lexertl/iterator.hpp:18:0, from /usr/local/include/boost/spirit/home/lex/lexer/lexertl/lexer.hpp:23, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:16, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/spirit/home/support/iterators/detail/split_functor_input_policy.hpp:19:21: note: ‘boost::spirit::iterator_policies::split_functor_input_is_valid_test_::token_is_valid’synthax_analyser.cpp:41:7: error: ‘iter’ was not declared in this scopesynthax_analyser.cpp:41:15: error: ‘end’ was not declared in this scopesynthax_analyser.cpp:41:15: note: suggested alternatives:In file included from /usr/local/include/boost/range/empty.hpp:20:0, from /usr/local/include/boost/proto/functional/range/empty.hpp:12, from /usr/local/include/boost/proto/functional/range.hpp:13, from /usr/local/include/boost/proto/functional.hpp:14, from /usr/local/include/boost/proto/proto.hpp:16, from /usr/local/include/boost/spirit/home/support/terminal.hpp:18, from /usr/local/include/boost/spirit/home/support/common_terminals.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer/terminals.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:13, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/range/end.hpp:106:61: note: ‘boost::range_adl_barrier::end’In file included from /usr/local/include/boost/fusion/container/list/cons.hpp:14:0, from /usr/local/include/boost/fusion/iterator/segmented_iterator.hpp:13, from /usr/local/include/boost/fusion/sequence/intrinsic/detail/segmented_begin.hpp:11, from /usr/local/include/boost/fusion/sequence/intrinsic/begin.hpp:17, from /usr/local/include/boost/fusion/container/vector/vector10.hpp:15, from /usr/local/include/boost/fusion/container/vector.hpp:12, from /usr/local/include/boost/fusion/include/vector.hpp:10, from /usr/local/include/boost/spirit/home/phoenix/core/limits.hpp:73, from /usr/local/include/boost/spirit/home/phoenix/core.hpp:11, from /usr/local/include/boost/spirit/include/phoenix_core.hpp:14, from /usr/local/include/boost/spirit/home/support/terminal.hpp:16, from /usr/local/include/boost/spirit/home/support/common_terminals.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer/terminals.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:13, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/fusion/sequence/intrinsic/end.hpp:89:5: note: ‘boost::fusion::end’In file included from /usr/local/include/boost/fusion/sequence/intrinsic/begin.hpp:13:0, from /usr/local/include/boost/fusion/container/vector/vector10.hpp:15, from /usr/local/include/boost/fusion/container/vector.hpp:12, from /usr/local/include/boost/fusion/include/vector.hpp:10, from /usr/local/include/boost/spirit/home/phoenix/core/limits.hpp:73, from /usr/local/include/boost/spirit/home/phoenix/core.hpp:11, from /usr/local/include/boost/spirit/include/phoenix_core.hpp:14, from /usr/local/include/boost/spirit/home/support/terminal.hpp:16, from /usr/local/include/boost/spirit/home/support/common_terminals.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer/terminals.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:13, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/fusion/sequence/intrinsic_fwd.hpp:67:16: note: ‘boost::fusion::result_of::end’In file included from /usr/local/include/boost/fusion/support/sequence_base.hpp:11:0, from /usr/local/include/boost/fusion/container/vector/vector10.hpp:11, from /usr/local/include/boost/fusion/container/vector.hpp:12, from /usr/local/include/boost/fusion/include/vector.hpp:10, from /usr/local/include/boost/spirit/home/phoenix/core/limits.hpp:73, from /usr/local/include/boost/spirit/home/phoenix/core.hpp:11, from /usr/local/include/boost/spirit/include/phoenix_core.hpp:14, from /usr/local/include/boost/spirit/home/support/terminal.hpp:16, from /usr/local/include/boost/spirit/home/support/common_terminals.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer/terminals.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:13, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/mpl/begin_end_fwd.hpp:23:38: note: ‘boost::mpl::end’In file included from /usr/local/include/boost/proto/functional/range.hpp:14:0, from /usr/local/include/boost/proto/functional.hpp:14, from /usr/local/include/boost/proto/proto.hpp:16, from /usr/local/include/boost/spirit/home/support/terminal.hpp:18, from /usr/local/include/boost/spirit/home/support/common_terminals.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer/terminals.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:13, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/proto/functional/range/end.hpp:19:12: note: ‘boost::proto::functional::end’In file included from /usr/local/include/boost/range/empty.hpp:20:0, from /usr/local/include/boost/proto/functional/range/empty.hpp:12, from /usr/local/include/boost/proto/functional/range.hpp:13, from /usr/local/include/boost/proto/functional.hpp:14, from /usr/local/include/boost/proto/proto.hpp:16, from /usr/local/include/boost/spirit/home/support/terminal.hpp:18, from /usr/local/include/boost/spirit/home/support/common_terminals.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer/terminals.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:13, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/range/end.hpp:106:61: note: ‘boost::range_adl_barrier::end’In file included from /usr/local/include/boost/spirit/home/support/string_traits.hpp:16:0, from /usr/local/include/boost/spirit/home/support/nonterminal/expand_arg.hpp:20, from /usr/local/include/boost/spirit/home/support/context.hpp:18, from /usr/local/include/boost/spirit/home/qi/domain.hpp:18, from /usr/local/include/boost/spirit/home/qi/parser.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer/token_def.hpp:17, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:14, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/spirit/home/support/container.hpp:445:5: note: ‘boost::spirit::traits::end’In file included from /usr/local/include/boost/spirit/home/support/handles_container.hpp:14:0, from /usr/local/include/boost/spirit/home/lex/lexer/token_def.hpp:16, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:14, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/spirit/home/support/attributes_fwd.hpp:43:12: note: ‘boost::spirit::result_of::end’In file included from /usr/local/include/boost/spirit/home/support/info.hpp:17:0, from /usr/local/include/boost/spirit/home/lex/lexer/token_def.hpp:15, from /usr/local/include/boost/spirit/home/lex/lexer.hpp:14, from /usr/local/include/boost/spirit/home/lex.hpp:13, from /usr/local/include/boost/spirit/home/lex/lexer_lexertl.hpp:15, from /usr/local/include/boost/spirit/include/lex_lexertl.hpp:16, from synthax_analyser.cpp:12:/usr/local/include/boost/foreach.hpp:730:1: note: ‘boost::foreach_detail_::end’synthax_analyser.cpp: At global scope:synthax_analyser.cpp:54:1: error: expected declaration before ‘}’ tokenmake: *** [synthax_analyser.o] Error 1 Cordialy,Guillaume Bersac237bis rue de Pessac33000 Bordeaux06.65.30.89.43

5 5

concurrent garbage collector
by Taylor Holliday 23 Jun '13

23 Jun '13

Hey Boost, After struggling with breaking shared_ptr cycles in my app, I wrote a little concurrent garbage collector which uses boost::lockfree::queue. Its actually fairly general purpose, and I've released the code here: https://gist.github.com/wtholliday/5793270 Inspired by my question on stack overflow: http://stackoverflow.com/questions/17116189/concurrent-garbage-collection-f… I'm also working on releasing my unit test... its just quite dependent on other code. For the interface: the basic idea is you have a RootPtr<T> used to manage the collector's root set (please forgive my propensity for CamelCase). You have to explicitly manage references between collectable objects (via AddEdge and RemoveEdge functions), but I think that could be made safe using another smart pointer type which knows the collectable object which owns it. At this point I'm not too concerned about performance, as my object graphs aren't that big. I bet a GC guru could implement this without using a queue of events. Anyway, this is the kind of thing I'd love to see in boost someday, so it would be great to read your opinions of it :-) cheers - Taylor W. Taylor Holliday, Owner/Founder Subatomic Software, San Francisco

3 4

Re: [boost] [Multiprecision] Does MP use references internally?
by Daryle Walker 21 Jun '13

21 Jun '13

Nearly all operators, besides assigning and dereferencing ones, are supposed to return by value. Changing that, even with the “innocuous” (unary)+, is surprising. Daryle W. Sent from Windows Mail From: John Maddock Sent: ‎Thursday‎, ‎June‎ ‎20‎, ‎2013 ‎4‎:‎13‎ ‎AM To: boost(a)lists.boost.org > Is Boost.MP giving users references-to-types instead of class types when > requesting a numeric type? Pointers may be objects in and of themselves, > but references aren't; they're just aliases; trying to intentionally use > them as first-class objects is arguably broken. I don't see why this is a problem, but the first error is coming from: auto const aa = +a, bb = +b; Now, in Boost.Multiprecision the unary operator+ is a noop that returns a reference to self, could that be a cause of the issue?

4 3

ptr_map_adapter::insert non const key argument
by Gaetano Mendola 21 Jun '13

21 Jun '13

Hi, it seems that the method: std::pair<iterator,bool> ptr_map_adapter::insert( key_type& key, mapped_type x ) has the key argument non const? Is there a valid reason for it or it's just a mistake? Regards Gaetano Mendola

3 4

How do I specify no padding bytes within a struct/class?
by Daryle Walker 20 Jun '13

20 Jun '13

I've never done this before, so I'm asking first: how do I specify that a struct/class should have no padding at all, at the start, end, or middle? My classes have internal arrays, and specifying no padding lets users use an array of classX<T> as an array of T (just like C++11 std::complex). Complier-specific answers are OK, as long as I can use preprocessor flags to isolate them. I have a preprocessor flag that's currently set to 0 to indicate that there's no packing. I'll change it to 1 whenever I get a compiler's packing support. Daryle W.

5 7

[Multiprecision] Does MP use references internally?
by Daryle Walker 20 Jun '13

20 Jun '13

This may be an artifact of the compiler's error reporting mechanism, but the errors' expansion of the MultiPrecision type I'm using has reference types in it. Types from Boost.MP seem to be a shell class template that wraps an engine and several options. Some of the errors that pop up when using Boost.MP when using Boost.Test with my custom complex-number class: - Boost.MPL calls within Boost.Test complain that it's trying to get a pointer to a reference. - My own code uses arrays everywhere, and I get errors about making arrays to references. I'm not doing anything (too) advanced. Is Boost.MP giving users references-to-types instead of class types when requesting a numeric type? Pointers may be objects in and of themselves, but references aren't; they're just aliases; trying to intentionally use them as first-class objects is arguably broken. Daryle W.

2 2

Re: [boost] [c++11]
by Niall Douglas 19 Jun '13

19 Jun '13

> I wasn't suggesting making the library strictly C++03-compatible. My main > point was that the library has to be compatible with _todays_ and even better > - _yesterdays_ compilers to be actually useful. My choice of "reasonable" time > frame is 3-5 years, as I mentioned. That includes VS 2008 and VS 2010, which > already had some C++11 features, including rvalue references. Making VS 2013 > absolute minimum is a no-go, IMHO. I don't think anyone is making VS2013 an absolute minimum - rather they're making variadic templates an absolute minimum. Something which any other compiler than VS has had for years, and something which unlike many, if not most other C++11 language features is something which lets you write a ton of stuff you simply can't write without them. Now, nothing in proposed Boost.AFIO uses variadic templates in a way not replaceable with preprocessor programming. However it very /nearly/ did: I had this neato bit of evil variadic instantiation which let you convert an unknown set of trailing args into a std::tuple<> for storage, then /unpack/ said std::tuple<> back into an unknown set of trailing args, all with perfect forwarding. Effectively it was a compile-time std::function<> implementation. As proposed Boost.AFIO is also a closure execution engine where that closure can take arbitrary args and return arbitrary returns, that evil variadic template machinery was really useful because it lets you skip using std::function<> with its implied virtual function call. As proposed Boost.AFIO currently nests, in the worst case scenario, a fully bound std::function<> calling a partially bound std::function<> calling a partially bound std::function<>, that's three nested virtual indirect function calls. Recent Intel CPUs can prefetch and branch predict two nesting levels, but they can't cope with three, so performance takes a real nose dive and hence one of the reasons we currently see a peak 80k IOPS. That evil variadic template machinery gets rid of that problem. And its only replacement is std::function<> - you *cannot* implement that functionality (pure compile time std::function<>) without variadic templates because you can't properly unpack them without. None of this matters for proposed Boost.AFIO. But it certainly matters for the forthcoming C++11 only libraries coming soon to Boost, because they make /very/ heavy usage of functionality only possible with variadic templates. That means that they will require, as an absolute minimum for VS, VS2013 or Nov 2012 CTP. Other C++11 features one can make do without without too much cost, but losing variadic templates means a ton of extra source code complexity, much longer compile times and chopping out a lot of what C++11 enables which simply can't be done in C++03. I suspect that those libraries are probably going to force a new "variadic template support is mandatory" category of Boost libraries, probably sooner rather than later. I agree it's going to be frustrating for those stuck with older compilers: I pity those whose employers force MSVC6 on them to this very day. Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

6 15

Can't compile code with BOOST_LOG_TRIVIAL
by ... ... 19 Jun '13

19 Jun '13

Hi, I am trying to compile this code : #include <boost/log/trivial.hpp> int main(void){ BOOST_LOG_TRIVIAL(trace) << "boost log is working"; return EXIT_SUCCESS;} And I get the following error message : g++ -o test Capture.o ffmpegTools.o FluxVideoModifie.o test.o vizILogger.o -lavformat -lavcodec -lavutil -lswscale -lopencv_core -lopencv_highgui -lboost_filesystem -lboost_log_setup -lboost_log -lz -lpthread -ldl -lm test.o: In function `main':/home/exploit/git/VIZIRD-CAPTURE/proj/capture//test.cpp:39: undefined reference to `boost::log::v2s_mt_posix::trivial::logger::get()'/home/exploit/git/VIZIRD-CAPTURE/proj/capture//test.cpp:39: undefined reference to `boost::log::v2s_mt_posix::trivial::logger::get()'test.o: In function `boost::log::v2s_mt_posix::record::reset()':/usr/local/include/boost/log/core/record.hpp:153: undefined reference to `boost::log::v2s_mt_posix::record_view::public_data::destroy(boost::log::v2s_mt_posix::record_view::public_data const*)'test.o: In function `boost::log::v2s_mt_posix::record boost::log::v2s_mt_posix::sources::basic_composite_logger<char, boost::log::v2s_mt_posix::sources::severity_logger_mt<boost::log::v2s_mt_posix::trivial::severity_level>, boost::log::v2s_mt_posix::sources::multi_thread_model<boost::log::v2s_mt_posix::aux::light_rw_mutex>, boost::log::v2s_mt_posix::sources::features<boost::log::v2s_mt_posix::sources::severity<boost::log::v2s_mt_posix::trivial::severity_level>, void, void, void, void, void, void, void, void, void> >::open_record<boost::parameter::aux::tagged_argument<boost::log::v2s_mt_posix::keywords::tag::severity, boost::log::v2s_mt_posix::trivial::severity_level const> >(boost::parameter::aux::tagged_argument<boost::log::v2s_mt_posix::keywords::tag::severity, boost::log::v2s_mt_posix::trivial::severity_level const> const&)':/usr/local/include/boost/log/sources/basic_logger.hpp:457: undefined reference to `boost::log::v2s_mt_posix::core::get_logging_enabled() const'test.o: In function `~record_pump':/usr/local/include/boost/log/sources/record_ostream.hpp:278: undefined reference to `boost::log::v2s_mt_posix::aux::unhandled_exception_count()'test.o: In function `record_pump':/usr/local/include/boost/log/sources/record_ostream.hpp:259: undefined reference to `boost::log::v2s_mt_posix::aux::stream_provider<char>::allocate_compound(boost::log::v2s_mt_posix::record&)'/usr/local/include/boost/log/sources/record_ostream.hpp:259: undefined reference to `boost::log::v2s_mt_posix::aux::unhandled_exception_count()'test.o: In function `~auto_release':/usr/local/include/boost/log/sources/record_ostream.hpp:243: undefined reference to `boost::log::v2s_mt_posix::aux::stream_provider<char>::release_compound(boost::log::v2s_mt_posix::aux::stream_provider<char>::stream_compound*)'test.o: In function `boost::log::v2s_mt_posix::sources::aux::severity_level<boost::log::v2s_mt_posix::trivial::severity_level>::set_value(boost::log::v2s_mt_posix::trivial::severity_level)':/usr/local/include/boost/log/sources/severity_feature.hpp:135: undefined reference to `boost::log::v2s_mt_posix::sources::aux::get_severity_level()'test.o: In function `boost::log::v2s_mt_posix::record boost::log::v2s_mt_posix::sources::basic_logger<char, boost::log::v2s_mt_posix::sources::severity_logger_mt<boost::log::v2s_mt_posix::trivial::severity_level>, boost::log::v2s_mt_posix::sources::multi_thread_model<boost::log::v2s_mt_posix::aux::light_rw_mutex> >::open_record_unlocked<boost::parameter::aux::tagged_argument<boost::log::v2s_mt_posix::keywords::tag::severity, boost::log::v2s_mt_posix::trivial::severity_level const> >(boost::parameter::aux::tagged_argument<boost::log::v2s_mt_posix::keywords::tag::severity, boost::log::v2s_mt_posix::trivial::severity_level const> const&)':/usr/local/include/boost/log/sources/basic_logger.hpp:260: undefined reference to `boost::log::v2s_mt_posix::core::open_record(boost::log::v2s_mt_posix::attribute_set const&)'test.o: In function `boost::log::v2s_mt_posix::core::push_record(boost::rv<boost::log::v2s_mt_posix::record>&)':/usr/local/include/boost/log/core/core.hpp:308: undefined reference to `boost::log::v2s_mt_posix::core::push_record_move(boost::log::v2s_mt_posix::record&)'collect2: ld returned 1 exit statusmake: *** [test] Error 1 In my makefile I added the links :LIBS_boost = -lboost_filesystem -lboost_log_setup -lboost_log And i have my libraries correctly installed because the command : $ sudo ldconfig -p | grep boost_l display :libboost_log_setup.so.1.53.0 (libc6,x86-64) => /usr/local/lib/libboost_log_setup.so.1.53.0libboost_log_setup.so (libc6,x86-64) => /usr/local/lib/libboost_log_setup.solibboost_log.so.1.53.0 (libc6,x86-64) => /usr/local/lib/libboost_log.so.1.53.0libboost_log.so (libc6,x86-64) => /usr/local/lib/libboost_log.solibboost_locale.so.1.53.0 (libc6,x86-64) => /usr/local/lib/libboost_locale.so.1.53.0libboost_locale.so (libc6,x86-64) => /usr/local/lib/libboost_loc Can you help me please ? Thanks,Guillaume Bersac237bis rue de Pessac33000 Bordeaux06.65.30.89.43

2 1

Weirdness in SVN
by Marshall Clow 19 Jun '13

19 Jun '13

Ok, this is quite worrisome to me. This morning, bug #6136 was reopened: https://svn.boost.org/trac/boost/ticket/6136 This is an "unused variable warning" in Boost.DateTime. I fixed this bug in the trunk: https://svn.boost.org/trac/boost/changeset/80699 I merged this bug fix (and several others) to the release branch: https://svn.boost.org/trac/boost/changeset/80797 But the files (both trunk and release) appear not to contain the change. If I do a "svn diff", the changes appear in the diff, but the file doesn't contain the change. I checked the other files referenced in change set 80797, and they appear to be fine - just this one. Any idea what could be happening here? My only explanation at the moment is that "Subversion is lying to me", and that's both (a) a huge potential problem, and (b) doesn't suggest a course of action. $ svn diff trunk/boost/date_time/format_date_parser.hpp -r 80698 Index: trunk/boost/date_time/format_date_parser.hpp =================================================================== --- trunk/boost/date_time/format_date_parser.hpp (revision 80698) +++ trunk/boost/date_time/format_date_parser.hpp (working copy) @@ -256,7 +256,6 @@ // skip leading whitespace while(std::isspace(*sitr) && sitr != stream_end) { ++sitr; } - charT current_char = *sitr; short year(0), month(0), day(0), day_of_year(0);// wkday(0); /* Initialized the following to their minimum values. These intermediate @@ -290,7 +289,6 @@ } wkday = mr.current_match; if (mr.has_remaining()) { - current_char = mr.last_char(); use_current_char = true; } break; @@ -310,7 +308,6 @@ } wkday = mr.current_match; if (mr.has_remaining()) { - current_char = mr.last_char(); use_current_char = true; } break; @@ -326,7 +323,6 @@ } t_month = month_type(mr.current_match); if (mr.has_remaining()) { - current_char = mr.last_char(); use_current_char = true; } break; @@ -342,7 +338,6 @@ } t_month = month_type(mr.current_match); if (mr.has_remaining()) { - current_char = mr.last_char(); use_current_char = true; } break; @@ -438,7 +433,6 @@ itr++; if (use_current_char) { use_current_char = false; - current_char = *sitr; } else { sitr++; $ svn diff trunk/boost/date_time/format_date_parser.hpp -r 80699 $ -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

2 3

[range] Best way to count the elements in a filtered range?
by Gonzalo Brito Gadeschi 19 Jun '13

19 Jun '13

I wonder what is the recommended way to count the elements in a filtered range. Let range be a random access range, and filter the result of filtered(predicate), auto filtered_range = range | filter; count_if( filtered_range, [](const&){ return true; }); // (& omitted in lambda) counts the elements in a filtered range. _If_ this is the best way to count the elements in a filtered range, what about defining Range boost::count(Range&& r); to count all element in the range? It could call size() if available and count_if otherwise. Bests, Gonzalo BG

4 7

[mailing list] Duplicated thread - Best way to proceed
by Gonzalo Brito Gadeschi 19 Jun '13

19 Jun '13

The thread: [boost] [range] Best way to count the elements in a filtered range? I sent an email with an unregistered email adress to the list. As expected, I did not receive a confirmation about the mail being accepted. I resent the mail with my registered email adress. As expected, the new mail was accepted. However, the unaccepted mail started getting replies. - What is the best way to proceed? - Why did the email sent with the unregistered email address get replies? - Shouldn't it have been rejected right away? Bests, Gonzalo BG

1 0

[range] Best way to count the elements in a filtered range?
by Gonzalo BG 19 Jun '13

19 Jun '13

I wonder what is the recommended way to count the elements in a filtered range. Let range be a random access range, and filter the result of filtered(predicate), auto filtered_range = range | filter; count_if( filtered_range, [](const&){ return true; }); // (& omitted in lambda) counts the elements in a filtered range. _If_ this is the best way to count the elements in a filtered range, what about defining Range boost::count(Range&& r); to count all element in the range? It could call size() if available and count_if otherwise. Bests, Gonzalo BG

3 2

Is anybody working on the Boost Windows installer?
by Antony Maria Sakkariaz 18 Jun '13

18 Jun '13

Hi, Good morning. I am new to Boost and this mailing list. When I visited BoostPro computing in order to download the Windows installer, I did not see any installer beyond version 1.51. Since BoostPro donated the installer source code to the community, I am checking to see if anybody is updating the installer for the newer Boost versions. In case nobody is working on this, then I thought I would try to do it. :-) Thanks, Antony

2 1

Re: [boost] [c++11]
by Niall Douglas 18 Jun '13

18 Jun '13

> > I should quickly explain why rvalue ref support is so important to proposed > > Boost.AFIO: it's a 100% batch API and therefore takes in batches of things > > to do and returns out batches of results. That implies lots of passing > > sequences of things around in STL containers, which without rvalue refs are > > not cheap to copy. Therefore while we could get the library working on > > Maybe BOOST_ASIO_MOVE_ARG (in boost/asio/detail/config.hpp) will work > for you. I don't understand how that makes std::vector<> or any other STL container suddenly magically start not copy constructing its contents on C++03 compilers. struct async_io_op has both rvalue and const lvalue copy and assignment constructors. It's left up to the compiler and STL container implementation to decide when and where to use them. I agree we should be using more std::move() to help the compiler where it needs it, but all performance tuning is being left till after the Boost import. Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

2 1

Re: [boost] [c++11]
by Niall Douglas 18 Jun '13

18 Jun '13

> 2013/6/14 Sid Sacek <ssacek(a)securewatch24.com>: > <...> > > Sounds like it's not really worth the effort and simply just stick to the old style. > > Stick to the old style. Add #ifndef'ed C++11 specific features if they add > functionality or improve performance much. Boost libraries are tested using > C++11 and C++03 on different compilers and works good in all situations. Speaking of which, I was going to ask this list about the minimum compiler requirements for proposed GSoC Boost.AFIO, so now is as good a time as any. The existing code base being prepared for entry into Boost is pure C++11, or at least as much C++11 as is provided by the Nov 2012 CTP experimental MSVC compiler and therefore easily supported by GCC 4.6 and clang 3.x. The variadic templates used probably can be swapped out easily enough with Boost Preprocessor generators. The very extensive use of C++11 only library features could probably be replaced with Boost equivalents in most cases, though we really do need a fully C++11 functional std::exception_ptr rather than Boost's limited boost::exception_ptr. The thing we probably can't replace without major surgery is rvalue reference usage. It's used very extensively. Moreover, performance without rvalues would truly suck. So here's the question: is C++03 compiler and C++03 TR1 standard library support still an absolute, unnegotiable requirement for a library to become an official part of Boost? Or can we at least require rvalue reference support as a minimum? Or do we add a new category to Boost: some bits of C++11 requiring libraries? We're going to have to do this eventually anyway. Niall

12 20

[multiprecision] Are these types suitable as numeric types for unit tests?
by Daryle Walker 18 Jun '13

18 Jun '13

I'm writing new numeric types, and my unit tests use MPL lists of numeric types. I usually use stuff like int, unsigned, and double, but now I'm adding cpp_int and cpp_dec_float_50. Those types were OK when I was just doing type equalities and sizeof checks. Now I'm doing tests that use objects of those types and I'm getting problems. //==== typedef boost::mpl::list<int, unsigned, cpp_int> test_integer_types; typedef boost::mpl::list<double, cpp_dec_float_50> test_floating_types; //... BOOST_AUTO_TEST_CASE_TEMPLATE( test_complex_component_access1, T, test_integer_types ) { typedef complex_it<T, 0> real_type; typedef complex_it<T, 1> complex_type; real_type a; real_type const & aa = a; complex_type b; complex_type const & bb = b; a[ 0 ] = 6; BOOST_CHECK_EQUAL( a[0], T(6) ); BOOST_CHECK_EQUAL( T(6), aa[0] ); b[ 0 ] = 5; b[ 1 ] = 7; BOOST_CHECK_EQUAL( b[0], T(5) ); BOOST_CHECK_EQUAL( T(5), bb[0] ); BOOST_CHECK_EQUAL( b[1], T(7) ); BOOST_CHECK_EQUAL( T(7), bb[1] ); } //==== I'm getting warnings about integer overflow. The problem is at Line 59 of boost/test/tools/detail/print_helper.hpp. It sets an output stream's precision based on the digits given by std::numeric_limits. //==== BOOST_AUTO_TEST_CASE_TEMPLATE( test_complex_component_access2, T, test_floating_types ) { typedef complex_it<T, 0> real_type; typedef complex_it<T, 1> complex_type; real_type a; real_type const & aa = a; complex_type b; complex_type const & bb = b; a[ 0 ] = 6.0; BOOST_CHECK_CLOSE( a[0], T(6.0), 0.1 ); BOOST_CHECK_CLOSE( T(6.0), aa[0], 0.1 ); b[ 0 ] = 5.5; b[ 1 ] = -7.0; BOOST_CHECK_CLOSE( b[0], T(5.5), 0.1 ); BOOST_CHECK_CLOSE( T(5.5), bb[0], 0.1 ); BOOST_CHECK_CLOSE( b[1], T(-7.0), 0.1 ); BOOST_CHECK_CLOSE( T(-7.0), bb[1], 0.1 ); } //==== This time it's an error, at Line 59 of boost/test/tools/floating_point_comparison.hpp. There no (close enough) matching function for "fpt_abs" from some "boost::multiprecision::detail::expression<..." type. (It was truncated by the display. I don't know how to get a clean print-out of errors from Code::Blocks.) I'm guessing the expression template setup is screwing things up. Daryle W.

6 25

Re: [boost] [c++11]
by Niall Douglas 17 Jun '13

17 Jun '13

> > We can work around the lack of variadic templates, and therefore > > support vanilla VS2012 if peer review demands it. Of course VS2012 > > won't make binaries which can run on Windows XP :( so maybe VS2010 > > support will also be demanded by peer review. If it is, we'll do what is required > to meet VS2010. > JFYI: the VS2012 Update 1 can build binaries which can run on WinXP. You just > need to specify the v110_xp toolset in the project options. Apologies, I had skim read the VS2012 update announcement when it happened where it used the phrase "This new platform toolset points to a repackaged version of the Windows 7 SDK shipped in Visual Studio 2010 instead of the Windows 8 SDK" but I had missed the phrase "but uses the same Visual Studio 2012 compiler". As a result, I thought they had basically packed up the VS2010 build environment for VS2012 and that they therefore were equivalent. Mea culpa. BTW, and purely for information, I found that if you build your VS2012 Nov 2012 CTP app as a DLL, and then write a tiny shim program in VS2010 which loads in that DLL, all appeared to work okay on Windows XP. I didn't test that hugely at the time, but it did work for me to get variadic template capable MSVC binaries running on XP. Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

1 0

[New][Multiprecision] Getting errors while writing hypercomplex classes.
by Daryle Walker 17 Jun '13

17 Jun '13

I've banged out (yet another) complex number class at <https://github.com/CTMacUser/Complex>. The current commit has an SHA of "b866cda91ccdb4aa87c199c6d9e7c776fee61bcc." Right now, I'm writing this code on a 32-bit Windows 8 system using Code::Blocks with a packaged MinGW GCC 4.7 by TDM. In many of the incremental changes, I ran into internal compiler errors. I don't know if my code is too unusual or it's the compiler. I'm asking if you guys can check out the code with other compilers (GCC 4.7 besides MinGW/TDM, GCC 4.8, Clang 3.x, non-Windows, etc.) so we can figure out what bug goes where. There are two class templates: - boost::math::complex_it<Number, Rank> - boost::math::complex_rt<Number, Rank> "Number" is a Regular type that supports math operations plus Boolean conversions. "Rank" is the Cayley-Dickson hypercomplex level. Use 0 as a shell for real numbers, 1 for regular complex numbers, 2 for quaternions, 3 for octonions, etc. The "complex_it" class template stores all the components directly in an array with length 1ULL << Rank ("i" is for "iterative"). The "complex_rt" class template stores an array of 2 objects of the previous level ("r" is for "recursive"), except for the partial-specialized base case which stores one component. The two templates support nearly the same interface. - Static interface * using value_type = Number * rank = Rank * static_size = 1ULL << Rank * using barrage_type = complex_?t<Number, Rank - 1> (or self when Rank == 0) - Construction * Complex_type a; // random garbage bits * Complex_type b{}; // zero-fill * Complex_type c{ r }; // real conversion * Complex_type d{ r, i, ... }; // real list * Complex_type e{ Complex_type<ConvertibleNumber, SameOrLowerRank>, ... }; * Complex_type f{ Complex_type<ConvertibleNumber, GreaterRank> }; // explicit * Complex_type g{ Other_complex_type<AnyNumber, AnyRank> }; // explicit * Complex_type h{ Complex_type<AnyNumber, AnyRank> }; // explicit * For [d], the total number components can't exceed static_size. * For [e], the combined number of components from the objects can't exceed static_size. * "ConvertibleNumber" uses implicit conversion, "AnyNumber" static_cast. * Conversions in [g] are both in complex_rt, a constructor and conversion-operator. * For [h], it excludes types in "AnyNumber" that would be covered by [e] and [f]. - Member functions * Boolean conversion operator (explicit) * "real" and "imag," inspector and mutator versions, just like std::complex (Don't use "imag" mutator when Rank == 0!) * "unreal" inspector, like boost::quaternion and octonion; plus a mutator version * Lower- and upper-halves of component list (called barrages) - complex_it uses inspector and mutator, like real/imag/unreal - complex_rt uses by-reference returns, const and mutable * operator [] for direct (by-reference) access to components - External operators * == * != * + (unary) * - (unary) * ~ (new, conjugation) * << (output) - Tuple interface (get, tuple_element, tuple_size) - Object support * begin (non-member, complex_it only) * end (non-member, complex_it only) * swap - Math * conj These spots cause internal-compiler errors: * https://github.com/CTMacUser/Complex/blob/master/include/boost/math/complex_ it.hpp#L753 * https://github.com/CTMacUser/Complex/blob/master/include/boost/math/complex_ rt.hpp#L593 * https://github.com/CTMacUser/Complex/blob/master/include/boost/math/complex_ rt.hpp#L599 use the comments to switch the code back and see if it works on your system. There were also problems using Boost.Multiprecision in the unit tests. I don't know if the problems are in Multiprecison, Test, MPL, or some interaction between them. The spots in "complex_it_test.cpp" and "complex_rt_test.cpp" that use the "test_builtin_types" alias were supposed to use "test_types," but the sample types from Multiprecision had MPL errors. Switch the types and see if they work on your system. Daryle W.

3 3

Re: [boost] [c++11]
by Niall Douglas 17 Jun '13

17 Jun '13

> > Actually it targets three compilers (+clang). I might add that > > Boost.ASIO only officially supports Windows, Linux, Solaris and OS X, > > and only the compilers MSVC7.1 or later and g++ 3.3 or later. Some > > would say that is a fairly narrow set in itself. > > That's not quite what I read here: > > http://www.boost.org/doc/libs/1_53_0/doc/html/boost_asio/overview/implem > entation.html See for yourself at http://www.boost.org/doc/libs/1_53_0/doc/html/boost_asio/using.html. I agree that perhaps that list, given the list you linked to, is now out of date. > And the compilers you mentioned as officially supported by ASIO actually cover > pretty much every compiler out there nowdays. > > Comparing that with your requirement of the compiler that has not even been > released, it doesn't look like AFIO portability level will be even remotely close to > that of ASIO. We can work around the lack of variadic templates, and therefore support vanilla VS2012 if peer review demands it. Of course VS2012 won't make binaries which can run on Windows XP :( so maybe VS2010 support will also be demanded by peer review. If it is, we'll do what is required to meet VS2010. > > Given that we knew that VS2012 would get variadic templates later this > > year (which it will in the form of VS2013), we decided to just go > > ahead with what > > C++11 features will be available to > 90% of C++ users by the end of 2013. > > That surely should satisfy the portability requirement, if not, then > > we'll work backwards until we reach > 95% of C++ users or > 99% if > > Boost peer review really, really wants it. > > I think your estimate of "> 90% of C++ users by the end of 2013" is much too > optimistic. People in corporate sector are very reluctant to update their > toolsets, so expect people trying to use your new library with 3-5 year old > compilers. I used the qualifier "available to" with purpose: I agree that a compiler may be available to > 90% of C++ users but for whatever reason those users do not avail of that compiler. FYI for my other open source I still get regular bug submissions for MSVC6 breakage due to my use of C++98 features, so I'm well aware what corporate is like. That said, this is a new greenfield library, and therefore no legacy compiler technology is inconvenienced by its compiler requirements. I might add that as C++ Now 2013 showed, there are quite a few new Boost libraries on their way which are C++11 only and will only ever be C++11 only: I saw presentations on new C++11 only versions of Boost.Proto and Boost.Spirit for example. > I know, C++11 has many fancy features and all, and I'm all for its adoption too. > But Boost also serves practical purpose, and if people can't use your library then > that just limits its usefulness. So unless you trying to make some academic work > here, the library should be more portable. If a corporate end user really, really wants the library working on their compiler toolset, they are always free to sponsor a port to that toolset. It's all open source. Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

4 5

Re: [boost] [c++11]
by Niall Douglas 17 Jun '13

17 Jun '13

> > The existing code base being prepared for entry into Boost is pure > > C++11, or at least as much C++11 as is provided by the Nov 2012 CTP > > experimental MSVC compiler and therefore easily supported by GCC 4.6 and > clang 3.x. > > I hope that you do realize that the Nov12 CTP does not come with a go-live > license, nor is recommended for any human consumption. Meh. First preview of VS2013 is only a month away. Nov 2012 CTP is usefully broken in ways easy to work around (parser bugs) rather than broken in unhelpful ways (unreliable code generation). It fills a useful slot until VS2013 arrives later this year. > It seems quite odd to me to spend significant GSoC resources on making a library > that targets only two compilers, and assumedly a rather narrow set of OSes. Actually it targets three compilers (+clang). I might add that Boost.ASIO only officially supports Windows, Linux, Solaris and OS X, and only the compilers MSVC7.1 or later and g++ 3.3 or later. Some would say that is a fairly narrow set in itself. We'll be matching Boost.ASIO's official platform support, but adding official support for FreeBSD 10 with clang and libcxx. In truth though it ought to work on any OS providing a POSIX file i/o API with preadv() and pwritev() which is the majority (including Windows via its MSVCRT incidentally). You may find https://github.com/BoostGSoC/boost.afio/wiki/Status-of-proposed-Boost.AFIO of interest. There it tells you how to get started with the proposed library right now. > Was this C++11-only requirement part of the original project plan, and why > didn't anyone object to it then? Yes, it was an original plan requirement. Having full fat C++11 (esp. the C++11 standard library) to hand made the code and design *very* considerably simpler and *much* easier to read (and therefore maintain) - in fact, there is only 670 lines of active code. Judging from the presentations at C++ Now 2013, this simplification experience of pure C++11 is hardly unique: many presenters commented on just how much their pure C++11 new versions of Boost libraries were cleaner, simpler, faster to compile and faster performance, and hugely more maintainable. Given that we knew that VS2012 would get variadic templates later this year (which it will in the form of VS2013), we decided to just go ahead with what C++11 features will be available to > 90% of C++ users by the end of 2013. That surely should satisfy the portability requirement, if not, then we'll work backwards until we reach > 95% of C++ users or > 99% if Boost peer review really, really wants it. Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

8 11

Re: [boost] [c++11]
by Niall Douglas 17 Jun '13

17 Jun '13

> > On 14 June 2013 17:21, Niall Douglas <ndouglas(a)blackberry.com> wrote: > >> So here's the question: is C++03 compiler and C++03 TR1 standard > >> library support still an absolute, unnegotiable requirement for a > >> library to become an official part of Boost? > > > > No. > > > > http://www.boost.org/development/requirements.html#Portability > > I suspect this may come down to the review ultimately: I can imagine that any > library that was C++11 only would have a hard time getting through review "as > is", *unless* there's a really compelling reason for it to be that way (and for > some libraries that may well be the case). However, I can also imagine a library > being developed as a C++11 only lib and only ported back to C++03 and/or less > capable compilers once it's stable (or vice versa). Thanks John: you're the only one who actually answered my question. I should quickly explain why rvalue ref support is so important to proposed Boost.AFIO: it's a 100% batch API and therefore takes in batches of things to do and returns out batches of results. That implies lots of passing sequences of things around in STL containers, which without rvalue refs are not cheap to copy. Therefore while we could get the library working on C++03, I'd imagine max IOPS would be awful as all those container copy constructors fire several times per API invocation. Right now max IOPS is about 80,000 which is awful, and that's *with* C++11. I'd expect that to be an order of magnitude slower without move construction. Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

2 1

Re: [boost] [c++11]
by Niall Douglas 17 Jun '13

17 Jun '13

> I'll be blunt here: taking off my corporate job hat and putting back on my old > consulting hat, I'd say it simply: you'll get ~ 90% of the C++ user base support > from my open source code for free. If you want more for your niche technology > Y, my rates start at $200/hour. I misphrased myself here: nothing in this statement should be taken as meaning that I am available for consulting work at any hourly rate since I began employment at BlackBerry, and my consulting firm is indeed closed for new business with no prospect of reopening in the immediate future. I meant my original statement in the sense that wanting compatibility with some technology Y is something which can't be expected for free in open source. That includes legacy compilers. Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

1 0

Re: [boost] [c++11]
by Niall Douglas 17 Jun '13

17 Jun '13

> That depends on what you consider supported by Boost. A lot of the > courtesy support for the native compilers for many OSes out there seems > to be dying out. If I may be blunt though, if big libraries like Boost don't show up vendor provided compilers as falling short on standards compliance, then there is very little incentive for those vendors to fix their compilers. In other words, it goes both ways. > I used to see Boost as an empowering library, enhancing and evening out > the playing field among the compilers out there. > > Some seem to see it as a playground to gain recognition and fast-track > things into the coming standard libraries, instead of producing > something usable in the real world. > > I guess it's losing the goal and aim I perceived, if it ever had it to > begin with. To me, it feels like a betrayal from the library I have > spent many manhours supporting. > > I've been on this rant before on the lists, in the big sprawling > discussions about the feasibility of a Boost 2.0, but it seems nothing > was learned then, and I don't expect anything to be learned going > forward either. > > As for limiting Boost authors, for leaf libraries that end users can > avoid, sure, there might not be too much harm. It's creeping into the > very core libraries as well, which _does_ bother me, as it can render > whole swaths of the library utterly unusable. > > In the end, we need a definitive statement from whatever cabal is > controlling Boost, so we don't get these kinds of discussion > resurrections every few months. All this causes is a lack of faith in > the project. Equally, it's not like Boost is hugely commercially developed like other open source projects: it's mostly volunteer driven. And it's real tough to come along to people's free time and tell them they have to target compilers written more than a decade ago, and if they don't their commits won't be allowed or will get rolled back. I'll be blunt here: taking off my corporate job hat and putting back on my old consulting hat, I'd say it simply: you'll get ~ 90% of the C++ user base support from my open source code for free. If you want more for your niche technology Y, my rates start at $200/hour. Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

1 0

Migrating www.boost.org to another server
by DongInn Kim 17 Jun '13

17 Jun '13

Hi, The CREST is planning to move all the boost services that OSL/CREST has provided to another server. All the services in the current OSL/CREST server are: - Web services: www.boost.org boostcon.boost.org svn.boost.org/svnmanager svn.boost.org/trac/boost beta.boost.org - Subversion, trac, and SVNManager - Mailinglist mailman hypermail First, we would like to migrate www.boost.org and beta.boost.org which are not dependent on any other services and domains at all. The data of www.boost.org and beta.boost.org can be simply moved but I need someone's help who can switch the domain record to make these two hostnames point to the new server. Who can I talk to about this domain migration? I will setup another schedule for the next migrations and I do not have any particular lists yet but probably the rest of web services and Subversion would be the candidate. We will see. Regards, -- - DongInn

4 7

[phoenix] Using Phoenix lambdas on top of custom Proto expressions
by Denis Demidov 17 Jun '13

17 Jun '13

Hello, I am working on VexCL (https://github.com/ddemidov/vexcl) - a vector expression template library for OpenCL. I have recently added support for automatic generation of OpenCL kernels from generic functors (description of the feature: https://github.com/ddemidov/vexcl#function-generator) In order to implement this, I pass the instances of vex::symbolic<T> class to the given functor. vex::symbolic<T> dumps to output stream any arithmetic operations it is being subjected to, and that's how I am able to construct the OpenCL kernel source. The symbolic<T> class is of course a Boost.Proto terminal. Now, it seems natural to use Boost.Phoenix to provide the generic functors for the function generator. And indeed it is possible with simple expressions (see https://github.com/ddemidov/vexcl/blob/a95dfdd68/tests/generator.cpp#L124) However, if I try to bring cmath functions overloads from <boost/phoenix/stl/cmath.hpp> and use those ( https://github.com/ddemidov/vexcl/commit/b95da14e51) I get compilation errors. The reason apparently is that boost::phoenix_impl::<function>_impl assumes that result of <function>(expr) has the same type as expr itself. This of course is not true if expr is a Boost.Proto expression. Everything works as intended with the following patch: --- a/cmath.hpp +++ b/cmath.hpp @@ -25,11 +25,11 @@ namespace boost { struct result<This(BOOST_PHOENIX_A(n))> \ { \ typedef \ - typename proto::detail::uncvref<A0>::type \ + decltype( name(typename proto::detail::uncvref<A0>::type()) ) \ type; \ }; \ template<BOOST_PHOENIX_typename_A(n)> \ - A0 operator()(BOOST_PHOENIX_A_const_ref_a(n)) const { \ + auto operator()(BOOST_PHOENIX_A_const_ref_a(n)) const -> decltype( name(BOOST_PHOENIX_a(n)) ) { \ using namespace std; \ return name(BOOST_PHOENIX_a(n)); \ } \ I understand this is unacceptable in its current form (because it uses c++11 features), but I could not do this in terms of e.g. boost::result_of. May be someone has a better idea of how to implement this? -- Best regards, Denis

1 0

[thread] Use of synchronized_value<> member in a constructor
by Klaim - Joël Lamotte 17 Jun '13

17 Jun '13

I am using now Boost 1.54.0 Beta (r84749). I am writting code similar to the following (but a bit more complex) : struct SequenceInfo { SequenceId id; ProjectId project_id; std::string name; //.... }; class Sequence { boost::synchronized_value<SequenceInfo> m_info; public: explicit Sequence( SequenceId new_id, SequenceInfo info ) : m_info( std::move(info) ) { m_info->id( new_id ); // mutex lock } // ... }; My current understanding of concurrent access practice is that it is not necessary to use synchronization mechanisms associated to member objects manipulated into a constructor, because it can happen on only one thread. If I am correct, then the lock of the synchronized_value is unnecessary. I suspect that there might be other cases like this one where the object responsable for the synchronized object should be able, rarely, to access the object unsafely. Suggestion: add an unsafe access to the object, in a very visible way. m_info.unsafe_access().id( new_id ); OR m_info.unsafe_access()->id( new_id ); // using a smart pointer which checks if safe accesses have been done inbetween and throw if it is the case? or any other checks detecting potential error It looks like it would allow avoiding cost where it could be avoided using a mutex manipulated manually. Any thoughts on this? Joel Lamotte

2 7

[1.54] [thread] MSVC build broken
by Andrey Semashev 16 Jun '13

16 Jun '13

Hi, I've noticed that my Boost.Log tests on MSVC are failing massively. The build log hints that Boost.Thread might be the culprit, and its tests are also failing on MSVC with the following error: ..\boost/thread/future.hpp(1127) : error C2248: 'boost::unique_lock<Mutex>::operator =' : cannot access private member declared in class 'boost::unique_lock<Mutex>' with [ Mutex=boost::mutex ] ..\boost/thread/lock_types.hpp(110) : see declaration of 'boost::unique_lock<Mutex>::operator =' with [ Mutex=boost::mutex ] This is happening on release branch. Could this be fixed?

4 10

[test] resolution of test time information
by Alexander Kjäll 16 Jun '13

16 Jun '13

Hi I'm new to the boost test library and it seems to fill my needs of a testing framework quite well. One thing that i haven't managed to figure out is if it's possible to increase the resolution of the timekeeping information, it currently seems to be reported with a resolution of 10 milliseconds. Is it possible to reduce that somehow? best regards Alexander Kjäll

1 0

[c++11]
by Sid Sacek 15 Jun '13

15 Jun '13

This was probably discussed many times already, but I seem to not have been paying close enough attention. Maybe someone can point me to the discussions in the archives... With all of the cool new language features of C++11, am I correct in assuming that boost library developers have no real opportunity to use any of it in order to be backwards compliant with all the older standard? I realize there are many boost equivalents already in place, but when would it become permissible to use native C++11 syntax? Thanks, -Sid

7 8

[optional][thread] Returning a future in an optional fails
by Klaim - Joël Lamotte 14 Jun '13

14 Jun '13

I just hit this using VS2012/boost 1.54 beta. #include <boost/optional.hpp> #include <future> boost::optional< std::future<void> > top() { return std::async( []{ int i=0; ++i; } ); } int main() { auto opt = top(); } Error: 1>E:\Projects\SDK\boost\boost\include\boost-1_54\boost/optional/optional.hpp(347): error C2248: 'std::future<void>::future' : cannot access private member declared in class 'std::future<void>' 1> C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\include\future(1238) : see declaration of 'std::future<void>::future' 1> C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\include\future(1200) : see declaration of 'std::future<void>' 1> E:\Projects\SDK\boost\boost\include\boost-1_54\boost/optional/optional.hpp(346) : while compiling class template member function 'void boost::optional_detail::optional_base<T>::construct(const std::future<void> &)' 1> with 1> [ 1> T=std::future<void> 1> ] 1> E:\Projects\SDK\boost\boost\include\boost-1_54\boost/optional/optional.hpp(231) : see reference to function template instantiation 'void boost::optional_detail::optional_base<T>::construct(const std::future<void> &)' being compiled 1> with 1> [ 1> T=std::future<void> 1> ] 1> E:\Projects\SDK\boost\boost\include\boost-1_54\boost/optional/optional.hpp(501) : see reference to class template instantiation 'boost::optional_detail::optional_base<T>' being compiled 1> with 1> [ 1> T=std::future<void> 1> ] 1> E:\Projects\Art_Of_Sequence\repos\aos-all\tool\aosdesigner\backend\test\workspace.cpp(30) : see reference to class template instantiation 'boost::optional<T>' being compiled 1> with 1> [ 1> T=std::future<void> 1> ] I also tried with http://coliru.stacked-crooked.com/ gcc4.8 (but I don't know the boost version) and got a similar error. I first hit this with boost::future but it don't seem to be the problem as it generate the same error. My question is: does std/boost::future don't match the requirements to be an optional value? Or is this an error I should log? Joel Lamotte

2 1

link to old TR1 draft on boost.org
by Jonathan Wakely 14 Jun '13

14 Jun '13

The Boost home page links to http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1745.pdf but that draft was replaced by N1836.

2 1

Future of Boost.Signals
by Marshall Clow 13 Jun '13

13 Jun '13

Doug Gregor has indicated to me that he is not able to continue with the development/maintenance of Boost.Signals. [ This is not a surprise, the last significant change to the library was back in 2004. ] Fortunately, Frank Hess' Signals2 library is going strong, and he has a porting guide for people currently using Boost.Signals at: http://www.boost.org/doc/html/signals2/api_changes.html#signals2.porting For the upcoming 1.54 release, I have added notes to this effect to the Boost.Signals documentation, and added a warning to <boost/signals.hpp>. The warning states: Boost.Signals is no longer being maintained and is now deprecated. Please switch to Boost.Signals2. To disable this warning message, define BOOST_SIGNALS_NO_DEPRECATION_WARNING Note: There have been no code changes to Boost.Signals. All code that uses it will continue to work. -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

1 0

Tips to fix boost::asio::windows::random_access_handle which is seriously broken
by Niall Douglas 13 Jun '13

13 Jun '13

Dear Boost, The forthcoming GSoC Boost.AFIO library has found a problem with boost::asio::windows::random_access_handle in that it appears to clamp buffer sizes to 64Kb and not increment overlapped offsets during multi-buffer reads and writes, and which is reported at https://svn.boost.org/trac/boost/ticket/8669. These are desirable features for network i/o, not so for file i/o. As my work on the existing code base which Paul is porting to Boost is now complete and purring beautifully on POSIX, I'm thinking I might as well go fix the Boost.ASIO Windows IOCP problem. Before I begin, can I ask here if anyone else has done some work on this topic from which I might be able to borrow? The thread at http://comments.gmane.org/gmane.comp.lib.boost.asio.user/3676 suggests that if I use async_write_some() then I can bypass the 64Kb clamp using "my own completion condition". I'm thinking that boost::asio::windows::random_access_handle really ought to actually implement random access, so rather than hacking around the problem, fixing boost::asio::windows::random_access_handle is better. My thanks in advance, Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

1 0

[Multiprecision] High-performance radix-2 floating-point back-end
by Aditya Jain 13 Jun '13

13 Jun '13

Hi This is my first post on the mailing list , so apologies if it doesn't follow any of the protocols. I was looking at GSoC projects this year for Boost and I am wondering if someone is working on a high-performance radix-2 floating-point back-end for Boost.Multiprecision. If not , I would be interested in doing this project .I am currently a Masters student interning at a tech company in Seattle but I would be able to devote 15-20 hours a week for this project. I have a fairly good background in C++ and numerical programming.So in case no else is working on it (for GSoC or otherwise ) , I would be really interested . If someone is already working on it, I would be interested in some other projects I could potentially work on . Looking forward to a reply. Regards -- Aditya Jain MS Computer Science (Machine Learning Track) Columbia University B.Tech, IIT Roorkee

4 4

ATTN: Boost GSoC mentors and students: Continuous Integration for GSoC thoughts
by Niall Douglas 11 Jun '13

11 Jun '13

Dear Boost, I spent the weekend experimenting with getting CI set up for the async file i/o library which will hopefully become Boost.AFIO through Paul's GSoC. I tried a number of free-for-open-source CI providers which integrate tightly with GitHub, and eventually settled with Travis CI. You can see the last commit CI results at https://travis-ci.org/ned14/TripleGit. As much as Travis CI has a primitive and clunky UI, unlike the other CIs it's based on snapshotting VMs with root privs which gives you unparalleled flexibility for testing config, so I was able to configure this to happen with each and every git push to github: 1. Test that code builds with GCC 4.6 and clang 3.2. 2. Test that unit and functional tests execute without error when built with GCC 4.6 and clang 3.2. 3. Run unit and functional tests with valgrind --tool=memcheck and test that no memory errors nor memory leaks occur with binaries built with GCC 4.6 and clang 3.2. 4. Install GCC 4.8 and compile everything using -fsanitize=thread (i.e. instrument using the port of clang's ThreadSanitizer v2 to GCC), then execute a full set of unit and functional tests looking for race conditions and if any, fail. You'll note I've marked that test as allowed to fail, because Boost v1.53 has a number of known race conditions when used as C++11 which are hopefully fixed in v1.54 :) Personally speaking, I think this depth and degree of CI is *invaluable* to modern software development practice. So the question becomes: are the Boost GSoC mentors and students interested in setting up CI for this year's GSoC projects, or at least the ones hosted on github at https://github.com/BoostGSOC? In case you're wondering how hard it is to set up Travis CI for your github project, you just need one file called .travis.yml. You can see the one I wrote at https://github.com/ned14/TripleGit/blob/master/.travis.yml. Thoughts? Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

4 7

[utility] [assert] Proposal for a new assert macro which stores the failed values ("informative assert")
by Viktor Sehr 11 Jun '13

11 Jun '13

I'd like some opinions about this assert implementation which I'd like to propose as an update of the old BOOST_ASSERT. Basically it stores the failed values next to the expression string, instead of just the expression string: "INFORMATIVE_ASSERT(5*5 < 2*2);" "5*5 < 2*2 | 25 | 4" "INFORMATIVE_ASSERT(std::vector<int>(10).size() == std::vector<int>(12).size());" "std::vector<int>(10).size() > std::vector<int>(12).size() | 10 | 12" Notes - If the class can't be serialized, the byte-data is logged instead. - It writes the values to the expression string in order to be compliant with any assert implementations Easy to read implementation available here: https://docs.google.com/file/d/0B69BCPzak52DcnF5dmhRRno3V2M/edit?usp=sharing Modified version of BOOST_ASSERT available here: https://docs.google.com/file/d/0B69BCPzak52DZW1oX1AtREM4eVU/edit?usp=sharing /Viktor (Reposting this as I posted it without labels one week ago)

4 13

Re: [boost] [1.54.0] Beta 1 Available
by Cromwell Enage 11 Jun '13

11 Jun '13

Hi, all. When calling the merge() member function of a boost::heap::d_ary_heap, is the heap passed in not supposed to be emptied? Here's my test program: ['' #include <boost/heap/d_ary_heap.hpp> #include <boost/heap/binomial_heap.hpp> #include <boost/heap/fibonacci_heap.hpp> #include <boost/heap/pairing_heap.hpp> #include <boost/heap/skew_heap.hpp> #include <boost/test/minimal.hpp> template <typename Heap> void test_heap_merge_memfun() { Heap heap_1, heap_2; heap_1.push(3); heap_1.push(5); heap_1.push(1); heap_2.push(2); heap_2.push(4); heap_2.push(0); heap_1.merge(heap_2); std::cout << " heap_2"; if (!heap_2.empty()) { BOOST_CHECK(4 == heap_2.top()); heap_2.pop(); BOOST_CHECK(2 == heap_2.top()); heap_2.pop(); BOOST_CHECK(0 == heap_2.top()); heap_2.pop(); std::cout << " not"; } std::cout << " emptied." << std::endl; BOOST_CHECK(heap_2.empty()); BOOST_CHECK(5 == heap_1.top()); heap_1.pop(); BOOST_CHECK(4 == heap_1.top()); heap_1.pop(); BOOST_CHECK(3 == heap_1.top()); heap_1.pop(); BOOST_CHECK(2 == heap_1.top()); heap_1.pop(); BOOST_CHECK(1 == heap_1.top()); heap_1.pop(); BOOST_CHECK(0 == heap_1.top()); heap_1.pop(); BOOST_CHECK(heap_1.empty()); } int test_main(int argc, char** argv) { test_heap_merge_memfun< boost::heap::d_ary_heap< int , boost::heap::arity<4> , boost::heap::mutable_<true> > >(); test_heap_merge_memfun<boost::heap::binomial_heap<int> >(); test_heap_merge_memfun<boost::heap::fibonacci_heap<int> >(); test_heap_merge_memfun<boost::heap::pairing_heap<int> >(); test_heap_merge_memfun< boost::heap::skew_heap<int,boost::heap::mutable_<true> > >(); return 0; } ''] When I run this program, I see that all the other heap types empty the heap passed in. I use gcc 4.2.1 with Apple clang version 4.0 on MacOSX 10.8 Cromwell D. Enage

2 1

[parameter] BOOST_PARAMETER_CONSTRUCTOR bug
by James Hirschorn 10 Jun '13

10 Jun '13

I've already submitted a bug report, but I'm also posting it here in case anyone has more info. ------------- The following variation on the example from the boost::parameter tutorial, where the required parameter is changed to optional, fails to compile. myclass_impl is being passed an empty argument list. #include <iostream> #include <boost/parameter.hpp> BOOST_PARAMETER_NAME(name) BOOST_PARAMETER_NAME(index) struct myclass_impl { template <class ArgumentPack> myclass_impl(ArgumentPack const& args) { std::cout << "name = " << args[_name] << "; index = " << args[_index] << std::endl; } }; struct myclass : myclass_impl { BOOST_PARAMETER_CONSTRUCTOR( myclass, (myclass_impl), tag , (optional (name, *) (index, *) ) ) // no semicolon }; int main(int argc, char * argv[]) { myclass C(_name="hello", _index=0); }

3 6

[type_erasure] Compilation time
by Felipe Magno de Almeida 10 Jun '13

10 Jun '13

Hello Steven, Is there anyway to not include some definitions in header to delay instantiation for use with explicit template instantiations in specific translation units with type_erasure? I have a CORBA library which uses type_erasure for each interface defined in IDL. The problem is that if I include too many #include's for the precompiled headers which use type_erasure, then the compiler ends up consuming too much memory (>10GB), which makes it unfit for 32bit compilers which can use at most 3GB. Regards, -- Felipe Magno de Almeida

2 2

Re: [boost] [multiprecision] Are these types suitable as numeric types for unit tests?
by Daryle Walker 09 Jun '13

09 Jun '13

-----Original Message----- From: John Maddock Sent: Saturday, June 08, 2013 4:40 AM >> I'm getting warnings about integer overflow. The problem is at Line >> 59 of boost/test/tools/detail/print_helper.hpp. It sets an output >> stream's precision based on the digits given by std::numeric_limits. > >That's harmless but annoying: it's because std::numeric_limits<cpp_int>::digits is >INT_MAX. The stream precision isn't ever used by integer types anyway... I switched to one of the fixed-sized types (512 bits). >> This time it's an error, at Line 59 of >> boost/test/tools/floating_point_comparison.hpp. There no (close >> enough) matching function for "fpt_abs" from some >> "boost::multiprecision::detail::expression<..." type. (It was >> truncated by the display. I don't know how to get a clean print-out >> of errors from >> Code::Blocks.) I'm guessing the expression template setup is screwing >> things up. > >Yes, it's because Boost.Test can't be used with expression template enabled types. >It's a known issue, and I've added a patch for this: >https://svn.boost.org/trac/boost/ticket/8272, but Genediiy seems to be MIA at present :-( > >Do you particularly want to test with expression-template enabled types (I reaslise >there are cases when you do)? If not then you could use multiprecision types that >have expression templates turned off and that should fix things. I switched to the same type with expression-templates turned off. Daryle W.

1 0

[range] [extensions] Default values for range access adaptors?
by Viktor Sehr 09 Jun '13

09 Jun '13

I'd like to suggest the addition of a default value to the range access adaptors. Either by adding it as an extra, non-necessary parameter for the functions, or by duplicating the functions as "front_or_default(T default value)". For example it would be useful for finding objects which I am not sure exists in a range. std::vector<int> vec = boost::assign::list_of(2)(4)(6); auto first_odd = vec | filtered(is_odd) | front(); // undefined? auto first_odd = vec | filtered(is_odd) | front_or_default(-1); // everything is fine! Another option would be a function which returns the adress, or nullptr if the value does not exist? /Viktor

5 14

boost.range bug in transformed or sliced
by John Reid 09 Jun '13

09 Jun '13

Suppose you wish to transform and slice a random access range. Surprisingly the order in which you apply the operations makes a big difference to performance. I'm guessing this is not desired behaviour, correct me if I'm wrong. AFAICT when transforming happens before slicing the iterators involved in the internals of boost.range are being treated as forward iterators not random access iterators. An advance() operation is made on one of the iterators with a negative number and this advance is O(n) for forward iterators but O(1) for random access. The code below demonstrates (adapted from sliced example code). On an unrelated note the documentation for transformed does not mention that the function is part of the range return type. It is given as: boost::transformed_range<typeof(rng)> Code to demonstrate the transform then slice problem: #include <boost/range/adaptor/transformed.hpp> #include <boost/range/adaptor/sliced.hpp> #include <boost/range/algorithm/copy.hpp> #include <boost/assign.hpp> #include <iterator> #include <iostream> #include <vector> #include <functional> struct identity { typedef int result_type; result_type operator()( int i ) const { return i; } }; int main(int argc, const char* argv[]) { using namespace boost::adaptors; using namespace boost::assign; std::vector< int > input; input += 1,2,3,4,5,6,7,8,9; // slicing then transforming my iterator range std::cout << "Sliced then transformed: "; boost::copy( input | sliced( 2, 8 ) | transformed( identity() ), std::ostream_iterator< int >( std::cout, ",") ); std::cout << "\n"; // transforming then slicing my iterator range - takes a very long time.... std::cout << "Transformed then sliced: "; boost::copy( input | transformed( identity() ) | sliced( 2, 8 ), std::ostream_iterator< int >(std::cout, ",")); std::cout << "\n"; return 0; }

4 5

merge of interface modification?
by Oliver Kowalke 09 Jun '13

09 Jun '13

Do I get permission to merge a change in the interface of boost.coroutine into release?

2 3

[Boost.Test] Error with "putenv" when using (1.53) release branch
by Daryle Walker 07 Jun '13

07 Jun '13

This happened to me a few months ago when trying out a Windows 8 compiling setup with Code::Blocks. I pointed to the release branch of Boost, which should be set to 1.53. I included Boost.Test, I think by #including boost/test/include/unit_test.hpp so everything comes in without linking in the library directly. There was some sort of error involving "putenv," not sure what anymore. I "fixed" it by switching to the trunk branch. Now I'm trying a new setup, with Eclipse. This time I'm adding Boost.Test by adding the files directly to the project list. (I'm experimenting with splitting my tests into 3 files.) I'm referencing the release branch again, which should still be on 1.53. I got "'putenv' was not declared in scope" error. It's at Line 95 of boost/test/utils/runtime/config.hpp. Did a hard error sneak by everyone, or is my setup incomplete? Both IDE setups use G++ on MinGW for the compiler. Is there some #define I'm missing? Should I switch to using the trunk again? Daryle W.

1 0

All talks for Meeting C++ 2013 are online!
by Jens Weller 06 Jun '13

06 Jun '13

Hi boost & C++ Community, to keep this short, all talks are online now, the schedule comes next week: http://meetingcpp.com/index.php/talks.html kind regards, Jens Weller

1 0

merge of bugfixes still possible
by Oliver Kowalke 06 Jun '13

06 Jun '13

Hi, I got a bug-report two days before - I'd like to merge the bugfix into the release. Do I get the permission? Oliver

2 1

[GIL] Can image::recreate reuse the memory?
by TONGARI 06 Jun '13

06 Jun '13

Hi, I'd expect image::recreate to reuse the memory much like std::vector::resize, but looked into the code shows that it creates a new one and swaps... So, is there a way to 'resize' the image without reallocating if the internal memory is sufficient? Thanks

2 17

server and client chat via boost::asio
by Nguyễn Trường Lâm 06 Jun '13

06 Jun '13

Hello everyone. I want to write a program using socket, a client and a server to communicate between each other. But i dont know how write a message to server and display in a IDE terminal. Thank you for your help

2 1

Migrating svn.boost.org
by DongInn Kim 06 Jun '13

06 Jun '13

Hi, This time I would like to setup a schedule to migrate svn.boost.org to the new server (wowbagger.crest.iu.edu) This migration may need some downtime on the subversion, trac, and svnmanager services because we do not want to have any inconsistencies in SVN and or trac database. I have already rsynched the 1) boost SVN repository including its hook script, 2) trac db, and 3) SVNManager and its database. Do you have any hidden processes to manage the subversion repository, trac, or SVNManager? I implemented some simple testings with some SVN activities on the new server and it seems to work fine. Can anyone volunteer to play with the migrated SVN repository, trac, and SVNManager on the new server? I can test the very basic stuff and I may miss some functionalities of the current services. If anyone who actually work on the boost project can check this out, it would be much appreciated. I would feel much safer. 1. The downtime that we may have while migrating svn.boost.org I expect that TTL value be changed to 1hour or so. While the new DNS entries are populated, the current server will NOT service svn.boost.org and the new server will instead. - Date: Wednesday June 5th, 2013 - Time: 11:00am-12:00pm Pacific US time 12:00pm-1:00pm Mountain US time 1:00pm-2:00pm Central US time 2:00pm-3:00pm Eastern US time 6:00pm-7:00pm GMT 2. The unavailable services hosted on svn.boost.org : - Subversion - trac - SVNManager 3. The DNS entries to update: - Make svn.boost.org and wiki.boost.org point to 129.79.13.33 Please let me know if you have any questions or concerns about this migration. Regards, -- - DongInn

7 15

Re: [boost] [circular_buffer] New version of documentation
by Paul A. Bristow 06 Jun '13

06 Jun '13

> -----Original Message----- > From: Boost [mailto:boost-bounces@lists.boost.org] On Behalf Of Marshall Clow > Sent: Thursday, May 23, 2013 8:01 PM > To: boost(a)lists.boost.org > Subject: Re: [boost] [circular_buffer] Volunteer(s) needed After more work than I bargained for (see below for excuses) I have produced a Quickbook, Doxygen, Autoindex version from the existing documentation for Boost.Circular_Buffer at https://svn.boost.org/svn/boost/trunk/libs/circular_buffer/doc/circular_buf… I have made few substantive changes to the text, mainly adding more hyperlinks, (and correcting some that were wrong of missing - using the inspect tool is a really, really good idea!) So that users can comment on this new version, I have put html and pdf versions in my Dropbox. The pdf version is at https://dl.dropboxusercontent.com/u/43940943/circular_buffer.pdf which can of course be viewed by any PDF reader (I have recently moved to using Foxit instead of Adobe Reader). The html Quickbook version is from folder (libs/circular_buffer/doc/html) the at https://dl.dropboxusercontent.com/u/43940943/html/index.html (Sadly some of the icon .png files are inaccessible from the Dropbox version, which mars its beauty but you'll get the idea). This library uses the full automatic indexing of C++ names and hyperlinking to and from the text. The header files have the classes and functions fully documented in Doxygen format, and this is used to create the C++ reference sections: https://dl.dropboxusercontent.com/u/43940943/html/boost_circular_buffer_c__… to that you can see what the classes do and the parameters, template parameters, returns etc for the functions. I believe that these details are essential for Really Useful documentation. The original Doxygen standalone (whose format some users prefer) is at https://dl.dropboxusercontent.com/u/43940943/doxygen/html/index.html So you can see the pros and cons of the same information displayed side by side. The PDF and HTML versions also has an index at the end (this could be improved as it only gives C++ functions etc at present). Enjoy! (?) Comments welcome - praise preferred ;-) Paul PS Implementation notes: To get all the links correct proved *very* tiresome. Much of the trouble was inconsistent layout of existing documentation and files. IMO we need to use the GITMOD project to impose much more order on the file structure. I fear that the modularization changes will invalidate many links in documentation, so much revision will be needed :-( We must be able to predict where index.html etc will be to be able to write links without the current hassle. The Boost inspect tool proved invaluable, and all links are now reported correct. (Lots were wrong - in Doxygen comments in the header files, and in the Quickbook stuff :-( ) Despite this, there are still some sections in red where the html layout is wrong :-( I hope to find all of these in a later revision. --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

2 3

Ticket spam
by Hartmut Kaiser 06 Jun '13

06 Jun '13

This ticket got some (harmless) spam added: https://svn.boost.org/trac/boost/ticket/6126#comment:21. What can I do to remove that comment? Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu

2 1

[community] request for revision: generic programming
by Steve Lorimer 06 Jun '13

06 Jun '13

In the light of C++11, the page on generic programming techniques http://www.boost.org/community/generic_programming.html is somewhat outdated. Any chance of a revision?

2 1

BOOST_STRONG_TYPEDEF
by Eric Niebler 05 Jun '13

05 Jun '13

Someone on stackoverflow is having a problem with BOOST_STRONG_TYPEDEF getting defined twice. There's a good recommendation there about boost/strong_typedef.hpp merely including boost/serialization/strong_typedef.hpp. Regardless, it's strange that trunk and release have been out of sync in this regard for so long. Robert? http://stackoverflow.com/questions/16901250/why-does-boost-include-two-diff… -- Eric Niebler Boost.org http://www.boost.org

1 0

[DNS] Heads up: svn.boost.org moving to a new server; IP address changing
by Beman Dawes 05 Jun '13

05 Jun '13

At 2:00 pm Eastern US time (i.e 30 minutes from now) we will switch svn.boost.org to a new server with a new IP address. It would be best to hold off on any SVN commits until after the change over, and after your DNS server has the new IP address. If command line "ping svn.boost.org" is going to [129.79.245.252], you are still getting the old IP address. Once svn.boost.org is resolving to [129.79.13.13] it should be OK to resume normal Subversion activity. Thanks, --Beman

1 2

[1.54.0] Beta 1 Available
by Marshall Clow 05 Jun '13

05 Jun '13

Boost release 1.54.0 beta 1 is now available from SourceForge See http://sourceforge.net/projects/boost/files/boost/1.54.0.beta.1/ This release contains 3 new libraries: • Log: Logging library, from Andrey Semashev. • TTI: Type Traits Introspection library, from Edward Diener. • Type Erasure: Runtime polymorphism based on concepts. and numerous enhancements and bug fixes for existing libraries. For details of what's in the release, see http://www.boost.org/users/history/version_1_54_0.html. Note that the links to files on this web page are for the final release - use the SourceForge link above to get the beta files. Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team

3 2

[git] Library metadata
by Daniel James 04 Jun '13

04 Jun '13

Hello, Is anyone thinking about storing library metadata in modules? I'm thinking about this in context of the data required for the website, it'd be nice to automatically pull that from the library modules rather than having to maintain it myself, but I guess this might be something that others are thinking about (e.g. for the expected test failures, the library maintainer). So I was wondering if anyone has any plans? For anyone who isn't aware of it, the website data is stored in an xml file at: http://svn.boost.org/svn/boost/website/public_html/live/doc/libraries.xml Of course, it could be desirable to store modularized metadata in a different format. Daniel

3 4

[python] non-standard iteration / wrapping member function return value
by Matus Chochlik 04 Jun '13

04 Jun '13

Hi, I'm stuck at trying to make python bindings for a set of classes that use a non-c++-standard iteration protocol. I've made a minimal example of what I'm trying to do: the python-ized classes look in essence like this: //------------------------------------------------------------- class int_range { private: int i, max; public: int_range(int m) : i(0), max(m) { } bool empty(void) const { return i > max; } int front(void) const { return i; } void next(void) { ++i; } }; class range_maker { public: int_range make(void) const { return int_range(10); } }; //------------------------------------------------------------- the boost.python module that I've come up with so far: //------------------------------------------------------------- using namespace boost::python; class _py_int_range_iter { private: int_range _range; public: _py_int_range_iter(int_range range) : _range(range) { } _py_int_range_iter self(void) { return *this; } int next(void) { if(_range.empty()) objects::stop_iteration_error(); int result = _range.front(); _range.next(); return result; } }; class_<_py_int_range_iter>("_py_int_range_iter", init<const int_range&>()) .def("self", &_py_int_range_iter::self) .def("next", &_py_int_range_iter::next) ; class _py_int_range { private: int_range _range; public: _py_int_range(int_range range) : _range(range) { } _py_int_range_iter iter(void) { return _py_int_range_iter(_range); } }; class_<_py_int_range>("_py_int_range", init<const int_range&>()) .def("__iter__", &_py_int_range::iter) ; //------------------------------------------------------------- the problem is that when I register range_maker as follows... //------------------------------------------------------------- class_<range_maker>("range_maker") .def("make", &range_maker::make) ; //------------------------------------------------------------- ... it compiles but (obviously) fails in python at run-time because range_maker::make returns int_range and not _py_int_range. what do I need to do to make this work? I know that I could write _py_range_maker wrapping range_maker and let it return _py_int_range, but this approach does not scale very well. Is there some way to tell the def(...) function that I want to wrap the return value into an object of another type? Is there a return value policy for that or do I need to write my own? If so how? Thanks in advance Matus

2 2

Re: [boost] ATTN: Boost GSoC mentors and students: Continuous Integration for GSoC thoughts
by Niall Douglas 04 Jun '13

04 Jun '13

> > Personally speaking, I think this depth and degree of CI is > > *invaluable* to modern software development practice. > > I could not agree more. > > One thing you may want to add is coverage analysis with > https://coveralls.io/: > > If you build with gcc, pass "-fprofile-arcs -ftest-coverage" both to the compiler > and the linker. After running the tests, you can analyze the coverage with gcov > and send it to coveralls. > To collect and upload, I use the following script: > https://github.com/purpleKarrot/Karrot/blob/develop/test/coveralls.in > (Note that gcov 4.6 does not support all flags that I use in the script, I use it wiht > 4.8 only). That's really super useful of you Daniel. I wasn't aware that such a service existed for code coverage. Thank you. I don't suppose you'd know the answer to this question though: Travis CI's reporting is not great, it either reports success or failure and not *what* failed nor *why*. Specifically, if for example a build fails, I'd like to know which source files and what the compiler errors were. Similarly, if a unit test fails, I want to know which one and what the error was. Do you know if this can be done? Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

1 0

Re: [boost] ATTN: Boost GSoC mentors and students: Continuous Integration for GSoC thoughts
by Niall Douglas 04 Jun '13

04 Jun '13

> Just curious: is Visual Studio support not included because not deemed > important? Or not supported by this particular lib? Or not supported by Travis CI > for some reason? (licensing?) As others have mentioned, Travis CI provides only Ubuntu 12.04 x64 instances and none other. Interestingly, you /could/ actually package up MSVC and run it under wine, but Travis CI's free service limits test runs to 20 mins and getting wine et al installed in that time is probably more trouble than it's worth. Besides, I have another very good reason not to: my primary development platform is Visual Studio. Why? It has the least C++11 support, but also the best debugger. Any C++11 feature supported by the Nov 2012 CTP experimental MSVC is easily supported in GCC or clang, whereas the converse is most certainly not true. A further factor is that the library is an async file i/o abstraction layer intended for Boost, and the only true async backend currently is Windows IOCP. Therefore, naturally development, and especially performance tuning, currently focuses there. Travis CI is really useful though for checking Visual Studio work: MSVC I am told does not use an AST internally, and therefore permits C++ no other compiler will allow. Very often I write template metaprogramming which MSVC is absolutely fine with but chokes either GCC or clang or both. Travis CI emails me to tell me when I've done that. This is very, very useful. Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

1 0

[thread] call_once regression or it is planed so?
by Antony Polukhin 04 Jun '13

04 Jun '13

Hi, With 1.54.0_beta1 following code fails to compile: #include <boost/thread/once.hpp> void init_host(int); void init_host(); boost::once_flag instance_flag = BOOST_ONCE_INIT; int main() { boost::call_once(&init_host, instance_flag); } In 1.53 it worked fine. Is that meant to be so and no workaround is possible, or is it a bug? -- Best regards, Antony Polukhin

3 2

Asking for permission to merge small bugfix (Spirit)
by Hartmut Kaiser 04 Jun '13

04 Jun '13

I would like to merge a small bugfix to the release branch (commit set 84631, patch below). Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu Index: C:/CVS/boost/boost/spirit/home/lex/lexer/support_functions.hpp =================================================================== --- C:/CVS/boost/boost/spirit/home/lex/lexer/support_functions.hpp (revision 84630) +++ C:/CVS/boost/boost/spirit/home/lex/lexer/support_functions.hpp (revision 84631) @@ -49,7 +49,7 @@ { typedef typename typename remove_reference< - remove_const< + typename remove_const< typename mpl::at_c<typename Env::args_type, 4>::type >::type >::type

2 1

[1.54.0] Accidentally committed to release docs fix
by Antony Polukhin 04 Jun '13

04 Jun '13

Hi, Without permission, accidentally committed r84603 that fixes docs of Boost.Any. Is it OK to leave that commit or reverting it is preferable? Commit is small and fixes only a single line in docs. -- Best regards, Antony Polukhin

2 1

[1.54.0] Beta Release Candidates available
by Marshall Clow 04 Jun '13

04 Jun '13

Release candidate files for 1.54.0 beta 1 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: 31266b7dcc6f557ad839e4e87317cd6e *boost_1_54_0_beta1_rc1.tar.gz fbf7be9cbaf9ea6fb21ae73d0c17100d *boost_1_54_0_beta1_rc1.tar.bz2 7de4299ab69c941e83fe3fc46dddc15f *boost_1_54_0_beta1_rc1.zip c73e5118ff585d9f1d68542f96a0758a *boost_1_54_0_beta1_rc1.7z Thanks, --The release managers

11 17

[1.54.0] [log] Permission to merge bugfix to release
by Andrey Semashev 04 Jun '13

04 Jun '13

Hi, May I merge the following changesets to the release branch? In short, it fixes the ticket [1] for Boost.Log and the similar issue for string_ref - incorrect handling of width specification with stream IO. Boost.Log: https://svn.boost.org/trac/boost/changeset/84512 https://svn.boost.org/trac/boost/changeset/84514 string_ref: https://svn.boost.org/trac/boost/changeset/84511 https://svn.boost.org/trac/boost/changeset/84513 https://svn.boost.org/trac/boost/changeset/84518 The tests are green. Also, there's a small fix for MinGW 4.4 tests of Boost.Log: https://svn.boost.org/trac/boost/changeset/84515 MinGW 4.4 tests have not been run for quite some time, but I believe it's safe to merge it as well. [1] https://svn.boost.org/trac/boost/ticket/8614

2 1

Request to contribute boost::FFT
by Nathan Bliss 03 Jun '13

03 Jun '13

Dear Boost Community Members, I am writing to ask if I could contribute a C++ FFT implementation to the boost library. I noticed that there is a boost::CRC so I thought it would be a good addition to have boost::FFT as well. MIT have an existing open-source FFTW library, but it is GPL-licensed which is much more restrictive than the Boost license. I should imagine a commercial FFTW license would be very expensive. I have working FFT code which I have tested on Ubuntu Linux GNU gcc and also Visual Studio Express 2012 (MS VC++) for Windows. My code, when run as a 2048-point FFT, agrees with the MIT FFTW one to a max error margin of 6 parts per million. It is implemented using templates in a .hpp file and is very easy to use: ------------------------------------------------------------------------------------------------------------[fft.hpp] template<class FLOAT_TYPE, int FFT_SIZE, int NUM_THREADS>class FFT;///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////[Invocation example] typedef double My_type;FFT<My_type, 2048, 4> user_fft;user_fft.initialise_FFT();get_input_samples(*user_fft.input_value_array, user_fft.m_fft_size);user_fft.execute_FFT();print_output_csv(user_fft.output_value_array, 2048);------------------------------------------------------------------------------------------------------------ It's uniqueness compared to other FFT implementations is that it fully utilises the boost::thread library, to the extent that the user can give the number of threads they want to use as a parameter to the class template (above case is for 4 parallel threads). It is structured and organised so that users could customise/optimise it to specific processor architectures. I've also tried to develop it in the spirit of Boost in that all class members which users should not access are private, only making public what is necessary to the API. My code is a decimation-in-time radix-2 FFT, and users could in theory use the existing API as a basis to extend it to more complex implementations such as the Reverse/Inverse FFT, bit-reversal of inputs/outputs and multi-dimensional FFTs. I look forward to your reply. Kind regards,Nathan Bliss

14 21

web page copyrights
by Charles_J_Wilson＠Dell.com 03 Jun '13

03 Jun '13

I was reading the 1.54.0 beta 1 release notes and managed to scroll down to the bottom of the page. I noticed that the copyright information was not current, so I looked at the main page. It's not current either. As this probably falls on any number of people, I'm posting instead of opening an issue. Charles Wilson Principal Software Development Engineer Dell | Enterprise Solutions Group

2 1

Request for permission to apply a multi library patch (misspell on comment only)
by Vicente J. Botet Escriba 03 Jun '13

03 Jun '13

HI, https://svn.boost.org/trac/boost/ticket/8558 "some misspell fixes" contains a patch that concerns some misspell on comments only code or on documentation. The patch is quite big and concerns almost all the Boost libraries. Could I apply it all at once, e.g. just after the release 1.54 is delivered? Best, Vicente

1 0

[1.54.0] release branch reopened for bug fixes ONLY
by Marshall Clow 03 Jun '13

03 Jun '13

Now that we have released the first beta, the release branch is open for bug fixes. Only bug fixes, please.[*] No new features. No new libraries. You do not need a release manager's approval to merge a bug fix. The earlier you can merge your bug fixes, the better. The branch will close again for final release preparations on June 24. As usual, you can see the release calendar here: http://www.boost.org/development/index.html [*] Changes to documentation are always allowed. -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

1 0

weirdness in documentation of boost::chrono?
by Anthony Foiani 01 Jun '13

01 Jun '13

Greetings -- The online reference for boost::chrono seems to have an odd error in it. If one looks at: http://www.boost.org/doc/libs/1_53_0/doc/html/chrono/reference.html#chrono.… (or: http://preview.tinyurl.com/lcl8j3c ) There is an "operator*==" (note double '='). The actual live link is to "operator*=", and the link works. I took a quick look, and this glitch does not seem to be present in the HTML documentation included in the 1_53_0 tarball. Am I just imagining things? Is my browser being stunningly clever in a way I don't understand? Thanks, Tony

2 1

Re: [boost] [Boost-users] [Thread] Can't compile package_task code with 1.54
by Vicente J. Botet Escriba 01 Jun '13

01 Jun '13

Le 01/06/13 07:30, Vicente J. Botet Escriba a écrit : > Le 01/06/13 00:56, Szymon Gatner a écrit : >> Hi, >> >> I just tried to compile my 1.52- based code with 1.54 beta and run >> into package_task compilation issue. >> >> In 1.52 I was using BOOST_THREAD_VERSION=3 define but with 1.54 I >> complied with =4. >> >> Test program: >> >> #define BOOST_THREAD_VERSION 4 >> >> #include <boost/thread/future.hpp> >> #include <boost/function.hpp> >> >> struct MyFunc >> { >> void operator()()const {} >> }; >> >> int main() >> { >> boost::function<void()> f; >> MyFunc mf; >> >> boost::packaged_task<void()> t1(f); // error 1 >> boost::packaged_task<void()> t2(mf); // error 2 >> } >> >> >> error 1 being: >> >> d:\devel\boost_1_54_0_beta1\boost\thread\future.hpp(2848): error >> C2664: >> 'boost::detail::task_object<F,R>::task_object(boost::detail::task_object<F,R> >> &)' : cannot convert parameter 1 from 'boost::function<Signature>' to >> 'boost::detail::task_object<F,R> &' >> >> and error 2 similarly: >> >> d:\devel\boost_1_54_0_beta1\boost\thread\future.hpp(2848): error >> C2664: >> 'boost::detail::task_object<F,R>::task_object(boost::detail::task_object<F,R> >> &)' : cannot convert parameter 1 from 'MyFunc' to >> 'boost::detail::task_object<F,R> &' >> >> (I tried with custom functor because I thought maybe error was >> related to boost function) >> >> Compiling with Visual Studio 2012 Update 3 >> >> > Hi, > > this is related to https://svn.boost.org/trac/boost/ticket/8596 which > is fixed now, but maybe it doesn't works for you. > Note that the trunk regression test since revision 84414 run with this > compiler pass ( > libs/thread/test/sync/futures/packaged_task/func_ctor_pass.cpp) > <https://svn.boost.org/trac/boost/browser/branches/release/libs/thread/test/…> > http://www.boost.org/development/tests/trunk/developer/thread.html. > > Unfortunately not a single msvc tester has run after revision 84468 on > release branch. > > I have no the possibility to reproduce it now. Please could you send > the whole log? (privately if you prefer? Or via a ticket? > I have found the error. My tests don't test for packaged_task<void()>. The following patch should fix the issue (see attached file) Please could you apply it a tell me if it fix with your compiler? Best, Vicente svn diff future.hpp Index: future.hpp =================================================================== --- future.hpp (revision 84547) +++ future.hpp (working copy) @@ -2362,18 +2362,12 @@ task_object(task_object&); public: F f; -#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES - task_object(BOOST_THREAD_RV_REF(F) f_): - f(boost::forward<F>(f_)) - {} -#else task_object(F const& f_): f(f_) {} task_object(BOOST_THREAD_RV_REF(F) f_): - f(boost::move(f_)) // TODO forward + f(boost::move(f_)) {} -#endif #if defined BOOST_THREAD_PROVIDES_SIGNATURE_PACKAGED_TASK && defined(BOOST_THREAD_PROVIDES_VARIADIC_THREAD) void do_apply(BOOST_THREAD_RV_REF(ArgTypes) ... args) @@ -2616,18 +2610,12 @@ task_object(task_object&); public: F f; -#ifndef BOOST_NO_CXX11_RVALUE_REFERENCES - task_object(BOOST_THREAD_RV_REF(F) f_): - f(boost::forward<F>(f_)) - {} -#else task_object(F const& f_): f(f_) {} task_object(BOOST_THREAD_RV_REF(F) f_): - f(boost::move(f_)) // TODO forward + f(boost::move(f_)) {} -#endif #if defined BOOST_THREAD_PROVIDES_SIGNATURE_PACKAGED_TASK && defined(BOOST_THREAD_PROVIDES_VARIADIC_THREAD) void do_apply(BOOST_THREAD_RV_REF(ArgTypes) ... args)

1 0

Re: [boost] Migrating www.boost.org to another server
by DongInn Kim 31 May '13

31 May '13

Any news from Beman? Regards, -- - DongInn On May 21, 2013, at 12:14 AM, Daniel James <daniel(a)calamity.org.uk> wrote: > On 21 May 2013 05:00, Marshall Clow <mclow.lists(a)gmail.com> wrote: >> On May 20, 2013, at 8:54 PM, Daniel James <daniel(a)calamity.org.uk> wrote: >> >>> On 21 May 2013 02:34, Marshall Clow <mclow.lists(a)gmail.com> wrote: >>>> [ Off-list ] >>>> Just as an update - Beman was _not_ at C++Now this year (the first time he has missed it). >>> >>> Do you know if he's available? >> >> Well, not at the moment - he's on the east coast (GMT-4), but in general, yes. > > I'll send him an email later then. Cc'd emails can get lost in the > noise of the list.

5 35

May I ask community to make a small review of the high-level network library we released?
by Dmitry Timoshenko 31 May '13

31 May '13

We released the beta version accessible here http://libunicomm.org. We would be really appreciated if this could happen. Thanx, Dmitry.

1 0

Git Modularization Review no vote heads-up
by Beman Dawes 31 May '13

31 May '13

If the steering committee's Git Modularization Review vote were held today, I've vote no since I think that we aren't yet ready. Since my concerns are apparently easy to fix technically, I'm mentioning them here to give Dave and Daniel a chance to address them before the actual Git Modularization Review starts. Concerns: 1) The mapping of svn branch names to modular git branch names needs to be revised: Svn "trunk" needs to become modular git "develop", not "master". Modular git needs to have a branch "master" that represents the latest stable release. Whether the content is identical to the last boost release or to branches/release at point of conversion needs to be decided, as does what the history, if any, of this branch looks like. 2) The procedures described in https://svn.boost.org/trac/boost/wiki/TryModBoost need to be updated, the dependency on CMake needs to be removed, and the procedures need to work. These are blocking issues because they prevent development and testing of modular boost testing procedures, developers procedures, release procedures, installation procedures, and documentation. Until they are resolved, the entire modular boost conversion rests on the shoulders of Dave and Daniel. Once they are resolved, others can pitch in and help since from that point forward we will be in a pure git environment and detailed knowledge of the conversion process from svn is not required. --Beman

9 25

[Atomic] Rationale for preventing copy construction/assignment?
by Collin Dauphinee 31 May '13

31 May '13

I've recently noticed that boost::atomic<T> prevents assignment from boost::atomic<T>, as well as copy construction. I'm having trouble understanding why this decision was made, as it makes boost::atomic<T> (and classes with a boost::atomic<T> member) very hard to store in containers, and I can't immediately see any safety issues that would be caused by allowing copy operations. What is the rationale for not allowing assignment or copy construction from another boost::atomic<T>?

6 10

Re: [boost] Git Modularization Review no vote heads-up
by "Jürgen Hunold" 30 May '13

30 May '13

Hi Dave, > Gesendet: Donnerstag, 23. Mai 2013 um 07:28 Uhr > Von: "Dave Abrahams" <dave(a)boostpro.com> > An: boost(a)lists.boost.org > Betreff: Re: [boost] Git Modularization Review no vote heads-up > > > on Wed May 22 2013, Jürgen Hunold <jhunold-AT-gmx.eu> wrote: > > > But this can easily be done after the conversion. > > > > I think we already lost too much time with failed rewrite attempts, so let us > > get a working repository first. Then Volodya can test git mv v2/* . and report > > results. Afterwards, we can always try rewriting in a separate clone. Done this myself yesterday. Works like a charm, git blame shows undisrupted history after git commit shows "rename" with 100% on each file moved. > Rewriting _published_ history is most strongly discouraged by the Git > people, for several good reasons. *If* there is to be any > rearrangement, it should happen before the switchover, so it doesn't > bork people who are doing work based on the history originally > published. Yes, the basic rule of git. > However, I am loath to do any rearrangement that doesn't (reasonably) > faithfully reflect how things were set up in the past. Otherwise, > someone will check out an old state of the super-module and find that > things have the wrong path relationships. Of course, path relationships > will not match SVN anyway (because we don't have a modular layout in > SVN), but people on this list made it quite clear that modularizing > history was important to them, so I presume they want the Git history to > reflect reality with maximal fidelity. Correct. > That said, if the consensus is that things should be rearranged in the > build repository, we can do that. We just need clear and explicit > instructions that cover what to do with *all* the paths that have been > used in Boost.Build (including branches and tags) throughout time. As > you can see from > https://github.com/ryppl/Boost2Git/blob/master/repositories.txt#L2261 > and following lines, just preserving the existing structure was > nontrivial. That one starts with repository build : common_branches { submodule of "boost" : "tools/build"; content { "tools/build/" : "build"; "tools/jam/" : "jam"; } right? So, this now creates "tools/build/build" with the contents of "tools/build" and "tools/build/jam" with the contents of "tools/jam" which is long gone. The former is wrong, as it does not preserve the current structure despite the thing you wrote above. I think that a one-to-one mapping like: repository build : common_branches { submodule of "boost" : "tools/build"; content { "tools/build/" ; } is the way to go now. If something goes wrong, please put "tools/jam/" somewhere else. Btw. would repository build : common_branches { submodule of "boost" : "tools/build"; content { "tools/build/v2" ; } be the right way to move v2 one directory up? Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! juergen.hunold(a)gmx.eu * voice: 0049 4257 300 ! Fährstraße 1 * fax : 0049 4257 300 ! 31609 Balge/Sebbenhausen * mobil: 0049 178 186 1566 ! Germany

10 36

Re: [boost] [gsoc] Getting started with a repository (Was: Re: Live read-only GIT mirrors of Boost trunk SVN)
by Niall Douglas 30 May '13

30 May '13

> > I think the GIT team should make a decision NOW about whether GSOC > > students should use GIT or not. > > > I think I'm against this, on the grounds that there is a lot to go > > wrong, and much critical students Google-time, especially with those > > who may be even ranker amateurs than me ;-) > > +1 > > > Unless there is a firm commitment from the GIT team to support > > students using GIT, then I think they should stick to boost-sandbox > > and do things "the old way". > > > Views from the GIT team? > > Paul > > ...Or their mentors! > > I'm mentoring a project and I'm a total, absolute git-beginner (used it, like, only > sporadically for one small repo). > > Is there any way to send git newbies like me and my student to the sandbox, at > least one more year? GSoC Boost.AFIO lives at https://github.com/ned14/boost.afio but will auto mirror itself into Boost Sandbox once Paul registers for Boost SVN commit privs. If there's interest on how I configured this, do let me know. Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

3 3

Re: [boost] [ASIO] Issue with epoll reactor? Callback handler not executed.
by Marat Abrarov 30 May '13

30 May '13

Hi, Arpan. > Everything works fine till async_write. You forgot that free functions like asio::async_write(_until)/asio::async_read(_until)/etc. are composed operations (http://www.boost.org/doc/libs/1_53_0/doc/html/boost_asio/reference/async_re ad/overload1.html): ... This operation is implemented in terms of zero or more calls to the stream's async_read_some function, and is known as a composed operation. ... Any composed operation (failed to find documentation for this) is implemented by means of multiple simple asynchronous operations. For example asio::async_read is implemented in terms of multiple calls of AsyncStream::async_read_some. So during any composed operation there are multiple (>=1) completions of simple asynchronous operations each of those has its own (intermediate) completion handler. Each of such intermediate completion handlers is dispatched like bound completion handler (http://www.boost.org/doc/libs/1_53_0/doc/html/boost_asio/reference/asynchro nous_operations.html) by the means of the same instance of asio::io_service as AsyncStream provides. So this code: > async_write(socket, buffer(command.c_str()), &write_handler); > io_service.reset(); > io_service.run_one(); will implement only one completions handler. That completion handler may be the intermediate completion handler if async_write needs to make more than one call to async_write_some (may be this needs to be explicitly described in Boost.Asio documentation?). That is the reason why your write_handler is not called sometimes. May be this can solve the problem: async_write(socket, buffer(command.c_str()), &write_handler); io_service.reset(); io_service.run(); async_read_until(socket, response, '\n', &read_handler); io_service.reset(); io_service.run(); Regards, Marat Abrarov.

3 6

Patch for Identification of NVCC with Changing Backends
by ryo-nishimura＠hpc.co.jp 30 May '13

30 May '13

Dear Members, I often program CUDA applications and use Boost with comforts. And I found Boost did not work fine when NVCC used a user-defined backend C++ compiler with the -ccbin option. The current implementation of Boost only identifies GCC and Visual C++ that are the default backend compilers of NVCC. So I wrote a patch for other backend compilers. It ports the generic identification routine of select_compiler_config.hpp to nvcc.hpp. Best regards, Ryohei

1 0

[gsoc] Getting started with a repository (Was: Re: Live read-only GIT mirrors of Boost trunk SVN)
by Darren Garvey 29 May '13

29 May '13

Following on from an earlier discussion... On 4 May 2013 20:00, Stefan Seefeld <stefan(a)seefeld.name> wrote: > On 05/04/2013 01:25 PM, Dave Abrahams wrote: > > on Sat May 04 2013, Stefan Seefeld <stefan-AT-seefeld.name> wrote: > > > >> it would be great if the sandbox could be converted quickly, so GSoC > >> students can use it ? > > We don't expect anyone to commit to https://github.com/boostorg/sandbox > > once the transition is complete. In fact, it would be good to stop now. > > Instead, people should use individual Git repositories. > > OK, that makes sense. So sanbox projects become entirely independent > with the only dependency being some upstream boost version (which may > correspond to either a release or a development version). > So, students can assume that users have boost installed on their machine in a standard location, and can set up a separate git repository for their project. Great. I remember there used to be a template in the sandbox for getting started; all I see right now is this: http://svn.boost.org/svn/boost/sandbox/template_under_construction/ It looks like it's the right kind of thing, but is this still under_construction (cc'ing Stjepan)? It seems to produce a basic set of directories, Jamfiles, etc. when following these steps: svn co http://svn.boost.org/svn/boost/sandbox/template_under_construction/ cd template_under_construction python file_template.py sandbox # Answer some question prompts >> It would be great if they didn't need to learn a thousand tools before > >> being able to focus on the project itself, and so having a > >> well-defined and -documented process to set things up and get started > >> would be very helpful. > > I don't know what you mean here, sorry. > > Never mind. I was thinking of a mix of versioning tools used for sandbox > projects, boost trunk, etc., causing an unnecessarily steep learning > curve. But if individual projects are to be hosted separately anyhow, > that's much less of a concern (though it would still be useful to have > clear and up-to-date guidelines for directory layout, build system, > etc., to make it easier to merge to trunk should we ever get this far). > Is setting up Jamroot / Jamfiles still the recommended way of getting started? Cheers, Darren

6 12

SIMD implementation of uBLAS
by Aditya Avinash 29 May '13

29 May '13

Hi, i have developed vector addition algorithm which exploits the hardware parallelism (SSE implementation). -- ---------------- Atluri Aditya Avinash, India.

9 28

Migrating boostcon.boost.org
by DongInn Kim 29 May '13

29 May '13

Hi, Can we move "boostcon.boost.org" to the new server sometime this week? If there is no particular activities on boostcon.boost.org, can we update the DNS entry for boostcon.boost.org to point to 129.79.13.33 at 2pm (E.T.) tomorrow (May 29th, 2013)? Beman, do you think that we can update the DNS entry tomorrow? Regards, -- - DongInn

2 2

Apologies for accidental repeat-mailings
by Nathan Bliss 29 May '13

29 May '13

Apologies for accidental repeat-mailings; been having problems with hotmail/outlook.com hanging over last 2 days...

1 0

Apologies for accidental repeat-mailings
by Nathan Bliss 29 May '13

29 May '13

Apologies for accidental repeat-mailings; been having problems with hotmail/outlook.com hanging over last 2 days...

1 0

Re: [boost] Reply to questions about FFT template class
by Nathan Bliss 29 May '13

29 May '13

Hi, Just to answer the previous questions about my FFT code... I'm afraid it's only a basic FFT implementation. It may not be up to the standard of Boost and I was always prepared for this, so I may then have to submit it to a less prestigious open source forum on the web somewhere. I made a mistake before about the precision. Mine agrees with the FFTW 2048-point results to a max error of 3 parts per million (max diff with FFTW value is 2.53E-06). Most of the outputs show zero or infinitesimal diffs. I've checked by math many times and I can only think it's because of performance-related approximations in FFTW, as the diffs seem too small to be algorithmic errors. Unfortunately, the FFTW implementation is ~20 times faster than mine. FFTW can run a 2048-point in 6ms on my Ubuntu installation whereas mine takes approx. 140ms. On Windows, both implementations are an order of magnitude slower (5secs for mine versus 250ms for FFTW). The boost multi-threading appears to make no difference to the speed, even though I've run it through GDB and with printfs to check that my code automatically spawns the optimal number of threads up to the max value given as the template parameter. Some compilers may be able to optimise the C++ code and multi-threading to increase performance, though I do not know if it could ever approach FFTW's. I have not implemented more advanced FFT features such as multi-dimensional FFTs or real-value-only optimisations, but I think the current API could facilitate users extending it to include forward/reverse FFT, bit-reversal, multi-dimensional FFTS (by manipulating the input and output vectors), etc. I've tried to make the code well organised, structured and commented so that hopefully users could customise it with their own optimisations for specific processor architectures. I'll understand if the consensus is that it is not really good enough for Boost. Alternatively, I would be happy to share my code and share the credit if anyone else wants to help. Kind regards,Nathan > From: boost-request(a)lists.boost.org > Subject: Boost Digest, Vol 4012, Issue 1 > To: boost(a)lists.boost.org > Date: Wed, 29 May 2013 05:38:51 -0400 > > Send Boost mailing list submissions to > boost(a)lists.boost.org > > To subscribe or unsubscribe via the World Wide Web, visit > http://lists.boost.org/mailman/listinfo.cgi/boost > or, via email, send a message with subject or body 'help' to > boost-request(a)lists.boost.org > > You can reach the person managing the list at > boost-owner(a)lists.boost.org > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of Boost digest..." > > > The boost archives may be found at: http://lists.boost.org/Archives/boost/ > > Today's Topics: > > 1. Re: SIMD implementation of uBLAS (Aditya Avinash) > 2. Re: SIMD implementation of uBLAS (Karsten Ahnert) > 3. Re: Request to contribute boost::FFT (Karsten Ahnert) > 4. Re: SIMD implementation of uBLAS (Aditya Avinash) > 5. Boost on ARM using NEON (Aditya Avinash) > 6. Re: Boost on ARM using NEON (Antony Polukhin) > 7. Re: Boost on ARM using NEON (Aditya Avinash) > 8. Re: Boost on ARM using NEON (Tim Blechmann) > 9. Re: Request to contribute boost::FFT (Paul A. Bristow) > 10. Re: Boost on ARM using NEON (Victor Hiairrassary) > 11. Re: Boost on ARM using NEON (Andrey Semashev) > 12. Re: Boost on ARM using NEON (Tim Blechmann) > 13. Re: Boost on ARM using NEON (Andrey Semashev) > 14. Re: Boost on ARM using NEON (David Bellot) > 15. Re: SIMD implementation of uBLAS (Rob Stewart) > 16. Re: SIMD implementation of uBLAS (Mathias Gaunard) > 17. Re: SIMD implementation of uBLAS (Aditya Avinash) > 18. Re: Request to contribute boost::FFT (Mathias Gaunard) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Wed, 29 May 2013 11:03:50 +0530 > From: Aditya Avinash <adityaavinash143(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: > <CABocMVpiKTED=tPZ4QtXBZAVdbwHMv+26LE+YXx9u2+HyWAFag(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > @Gaetano: Thank you for the comments. I'll change accordingly and post it > back. I am using T because, the code need to run double precision float > also. > @Joel: The Boost.SIMD is generalized. Designing algorithms specific to > uBLAS increases the performance. Odeint have their own simd backend. > > On Wed, May 29, 2013 at 10:36 AM, Joel Falcou <joel.falcou(a)gmail.com> wrote: > > > On 29/05/2013 06:45, Gaetano Mendola wrote: > > > >> On 29/05/2013 06.13, Aditya Avinash wrote: > >> > >>> Hi, i have developed vector addition algorithm which exploits the > >>> hardware > >>> parallelism (SSE implementation). > >>> > >> > >> A few comments: > >> > >> - That is not C++ but just C in disguise of C++ code > >> . SSE1 CTOR doesn't use initialization list > >> . SSE1 doesn't have a DTOR and the user has to > >> explicit call the Free method > >> > >> - const-correctness is not in place > >> - The SSE namespace should have been put in a "detail" > >> namespace > >> - Use memcpy instead of explicit for > >> - Why is SSE1 template when it works only when T is a > >> single-precision, floating-point value ? > >> > >> > >> Also I believe a nice interface whould have been: > >> > >> SSE1::vector A(1024); > >> SSE1::vector B(1024); > >> SSE1::vector C(1024); > >> > >> C = A + B; > >> > >> > >> Regards > >> Gaetano Mendola > >> > >> > > See our work on Boost.SIMD ... > > > > > > > > ______________________________**_________________ > > Unsubscribe & other changes: http://lists.boost.org/** > > mailman/listinfo.cgi/boost<http://lists.boost.org/mailman/listinfo.cgi/boost> > > > > > > -- > ---------------- > Atluri Aditya Avinash, > India. > > > ------------------------------ > > Message: 2 > Date: Wed, 29 May 2013 08:27:40 +0200 > From: Karsten Ahnert <karsten.ahnert(a)googlemail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: <51A59FDC.5050409(a)googlemail.com> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > On 05/29/2013 07:33 AM, Aditya Avinash wrote: > > @Gaetano: Thank you for the comments. I'll change accordingly and post it > > back. I am using T because, the code need to run double precision float > > also. > > @Joel: The Boost.SIMD is generalized. Designing algorithms specific to > > uBLAS increases the performance. Odeint have their own simd backend. > > odeint has no simd backend, At least i am not aware of an simd backend. > Having one would be really great. > > > > > > On Wed, May 29, 2013 at 10:36 AM, Joel Falcou <joel.falcou(a)gmail.com> wrote: > > > >> On 29/05/2013 06:45, Gaetano Mendola wrote: > >> > >>> On 29/05/2013 06.13, Aditya Avinash wrote: > >>> > >>>> Hi, i have developed vector addition algorithm which exploits the > >>>> hardware > >>>> parallelism (SSE implementation). > >>>> > >>> > >>> A few comments: > >>> > >>> - That is not C++ but just C in disguise of C++ code > >>> . SSE1 CTOR doesn't use initialization list > >>> . SSE1 doesn't have a DTOR and the user has to > >>> explicit call the Free method > >>> > >>> - const-correctness is not in place > >>> - The SSE namespace should have been put in a "detail" > >>> namespace > >>> - Use memcpy instead of explicit for > >>> - Why is SSE1 template when it works only when T is a > >>> single-precision, floating-point value ? > >>> > >>> > >>> Also I believe a nice interface whould have been: > >>> > >>> SSE1::vector A(1024); > >>> SSE1::vector B(1024); > >>> SSE1::vector C(1024); > >>> > >>> C = A + B; > >>> > >>> > >>> Regards > >>> Gaetano Mendola > >>> > >>> > >> See our work on Boost.SIMD ... > >> > >> > >> > >> ______________________________**_________________ > >> Unsubscribe & other changes: http://lists.boost.org/** > >> mailman/listinfo.cgi/boost<http://lists.boost.org/mailman/listinfo.cgi/boost> > >> > > > > > > > > > > ------------------------------ > > Message: 3 > Date: Wed, 29 May 2013 08:32:15 +0200 > From: Karsten Ahnert <karsten.ahnert(a)googlemail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Request to contribute boost::FFT > Message-ID: <51A5A0EF.9000806(a)googlemail.com> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > On 05/29/2013 12:12 AM, Nathan Bliss wrote: > > Dear Boost Community Members, > > I am writing to ask if I could contribute a C++ FFT implementation to the boost library. I noticed that there is a boost::CRC so I thought it would be a good addition to have boost::FFT as well. MIT have an existing open-source FFTW library, but it is GPL-licensed which is much more restrictive than the Boost license. I should imagine a commercial FFTW license would be very expensive. > > I have working FFT code which I have tested on Ubuntu Linux GNU gcc and also Visual Studio Express 2012 (MS VC++) for Windows. My code, when run as a 2048-point FFT, agrees with the MIT FFTW one to a max error margin of 6 parts per million. > > I would really like to see an FFT implementation in boost. It should of > course focus on performance. I also think that interoperability with > different vector and storage types would be really great. It prevents > that the user has to convert its data types in different formats (which > can be really painful if you use different libraries, for example > odeint, ublas, fftw, ...). > > > > > > ------------------------------ > > Message: 4 > Date: Wed, 29 May 2013 12:05:24 +0530 > From: Aditya Avinash <adityaavinash143(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: > <CABocMVpBesKaSTznHmKACxNpPUwYtTs50vUaWeZo5qUUaK9K+Q(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > Am sorry. My bad. It's boost.simd. Why isn't it included in boost? I have > heard about it recently. Is there a chance that it is added to boost in the > near future? > > On Wed, May 29, 2013 at 11:57 AM, Karsten Ahnert < > karsten.ahnert(a)googlemail.com> wrote: > > > On 05/29/2013 07:33 AM, Aditya Avinash wrote: > > > >> @Gaetano: Thank you for the comments. I'll change accordingly and post it > >> back. I am using T because, the code need to run double precision float > >> also. > >> @Joel: The Boost.SIMD is generalized. Designing algorithms specific to > >> uBLAS increases the performance. Odeint have their own simd backend. > >> > > > > odeint has no simd backend, At least i am not aware of an simd backend. > > Having one would be really great. > > > > > > > >> On Wed, May 29, 2013 at 10:36 AM, Joel Falcou <joel.falcou(a)gmail.com> > >> wrote: > >> > >> On 29/05/2013 06:45, Gaetano Mendola wrote: > >>> > >>> On 29/05/2013 06.13, Aditya Avinash wrote: > >>>> > >>>> Hi, i have developed vector addition algorithm which exploits the > >>>>> hardware > >>>>> parallelism (SSE implementation). > >>>>> > >>>>> > >>>> A few comments: > >>>> > >>>> - That is not C++ but just C in disguise of C++ code > >>>> . SSE1 CTOR doesn't use initialization list > >>>> . SSE1 doesn't have a DTOR and the user has to > >>>> explicit call the Free method > >>>> > >>>> - const-correctness is not in place > >>>> - The SSE namespace should have been put in a "detail" > >>>> namespace > >>>> - Use memcpy instead of explicit for > >>>> - Why is SSE1 template when it works only when T is a > >>>> single-precision, floating-point value ? > >>>> > >>>> > >>>> Also I believe a nice interface whould have been: > >>>> > >>>> SSE1::vector A(1024); > >>>> SSE1::vector B(1024); > >>>> SSE1::vector C(1024); > >>>> > >>>> C = A + B; > >>>> > >>>> > >>>> Regards > >>>> Gaetano Mendola > >>>> > >>>> > >>>> See our work on Boost.SIMD ... > >>> > >>> > >>> > >>> ______________________________****_________________ > >>> Unsubscribe & other changes: http://lists.boost.org/** > >>> mailman/listinfo.cgi/boost<htt**p://lists.boost.org/mailman/** > >>> listinfo.cgi/boost <http://lists.boost.org/mailman/listinfo.cgi/boost>> > >>> > >>> > >> > >> > >> > > > > ______________________________**_________________ > > Unsubscribe & other changes: http://lists.boost.org/** > > mailman/listinfo.cgi/boost<http://lists.boost.org/mailman/listinfo.cgi/boost> > > > > > > -- > ---------------- > Atluri Aditya Avinash, > India. > > > ------------------------------ > > Message: 5 > Date: Wed, 29 May 2013 12:19:39 +0530 > From: Aditya Avinash <adityaavinash143(a)gmail.com> > To: boost(a)lists.boost.org > Subject: [boost] Boost on ARM using NEON > Message-ID: > <CABocMVpQqBGqduE6jj-KG=O5faV08GcoV=TOS_bXFLYWTkzKjA(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > Hi, i want to develop boost.arm or boost.neon library so that boost is > implemented on ARM. > > -- > ---------------- > Atluri Aditya Avinash, > India. > > > ------------------------------ > > Message: 6 > Date: Wed, 29 May 2013 11:45:12 +0400 > From: Antony Polukhin <antoshkka(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: > <CAKqmYPbt+wq92BvLLn-5GUhFfmvWiWsAoqfpXK6XOmnRK7EtwQ(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > 2013/5/29 Aditya Avinash <adityaavinash143(a)gmail.com>: > > Hi, i want to develop boost.arm or boost.neon library so that boost is > > implemented on ARM. > > Hi, > > Boost works well on arm, so nothing should be really developed. > But if you ate talking about SIMD for ARM, that you shall take a look > at Boost.SIMD and maybe propose library developer your help. > > > -- > Best regards, > Antony Polukhin > > > ------------------------------ > > Message: 7 > Date: Wed, 29 May 2013 13:20:15 +0530 > From: Aditya Avinash <adityaavinash143(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: > <CABocMVo_DbCaxRPDOK4_1KMw8m7O54gXKgOqX+cmYRcBndNYDA(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > Thank you! > Can i develop a new kernel for uBLAS using NEON? > > On Wed, May 29, 2013 at 1:15 PM, Antony Polukhin <antoshkka(a)gmail.com>wrote: > > > 2013/5/29 Aditya Avinash <adityaavinash143(a)gmail.com>: > > > Hi, i want to develop boost.arm or boost.neon library so that boost is > > > implemented on ARM. > > > > Hi, > > > > Boost works well on arm, so nothing should be really developed. > > But if you ate talking about SIMD for ARM, that you shall take a look > > at Boost.SIMD and maybe propose library developer your help. > > > > > > -- > > Best regards, > > Antony Polukhin > > > > _______________________________________________ > > Unsubscribe & other changes: > > http://lists.boost.org/mailman/listinfo.cgi/boost > > > > > > -- > ---------------- > Atluri Aditya Avinash, > India. > > > ------------------------------ > > Message: 8 > Date: Wed, 29 May 2013 09:52:57 +0200 > From: Tim Blechmann <tim(a)klingt.org> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: <51A5B3D9.2010807(a)klingt.org> > Content-Type: text/plain; charset=ISO-8859-1 > > >> Hi, i want to develop boost.arm or boost.neon library so that boost is > >> implemented on ARM. > > > > Hi, > > > > Boost works well on arm, so nothing should be really developed. > > But if you ate talking about SIMD for ARM, that you shall take a look > > at Boost.SIMD and maybe propose library developer your help. > > from https://github.com/MetaScale/nt2/issues/180: "It is quite unsure at > this stage whether NEON will be provided as an open-source module" > > tim > > > > ------------------------------ > > Message: 9 > Date: Wed, 29 May 2013 08:55:41 +0100 > From: "Paul A. Bristow" <pbristow(a)hetp.u-net.com> > To: <boost(a)lists.boost.org> > Subject: Re: [boost] Request to contribute boost::FFT > Message-ID: <001f01ce5c41$ea88da30$bf9a8e90$(a)hetp.u-net.com> > Content-Type: text/plain; charset="us-ascii" > > > -----Original Message----- > > From: Boost [mailto:boost-bounces@lists.boost.org] On Behalf Of Nathan Bliss > > Sent: Tuesday, May 28, 2013 11:12 PM > > To: boost(a)lists.boost.org > > Subject: [boost] Request to contribute boost::FFT > > > > I am writing to ask if I could contribute a C++ FFT implementation to the boost library. > > Definitely, a good templated C++ FFT would be very welcome. > > Would/does it work with Boost.Multiprecision to give much higher precision ? (at a snail's pace of > course). > > Paul > > --- > Paul A. Bristow, > Prizet Farmhouse, Kendal LA8 8AB UK > +44 1539 561830 07714330204 > pbristow(a)hetp.u-net.com > > > > > > > > > > > > > ------------------------------ > > Message: 10 > Date: Wed, 29 May 2013 09:15:36 +0200 > From: Victor Hiairrassary <victor.hiairrassary.ml(a)gmail.com> > To: "boost(a)lists.boost.org" <boost(a)lists.boost.org> > Cc: "boost(a)lists.boost.org" <boost(a)lists.boost.org> > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: <22F316D0-E311-4BE3-94FB-11DE688C9CAB(a)gmail.com> > Content-Type: text/plain; charset=us-ascii > > boost already works very well on ARM ! > > If you want to use Neon extension, look at boost simd (I do not know if Neon is implemented yet, feel free to do it) ! > > https://github.com/MetaScale/nt2 > > On 29 mai 2013, at 08:49, Aditya Avinash <adityaavinash143(a)gmail.com> wrote: > > > Hi, i want to develop boost.arm or boost.neon library so that boost is > > implemented on ARM. > > > > -- > > ---------------- > > Atluri Aditya Avinash, > > India. > > > > _______________________________________________ > > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > > > ------------------------------ > > Message: 11 > Date: Wed, 29 May 2013 12:11:31 +0400 > From: Andrey Semashev <andrey.semashev(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: > <CAEhD+6BfavRaGgok9eMbDebCP1Hdg2T3Z3be7BWZTAZ1EDpfzg(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > On Wed, May 29, 2013 at 11:52 AM, Tim Blechmann <tim(a)klingt.org> wrote: > > > >> Hi, i want to develop boost.arm or boost.neon library so that boost is > > >> implemented on ARM. > > > > > > Hi, > > > > > > Boost works well on arm, so nothing should be really developed. > > > But if you ate talking about SIMD for ARM, that you shall take a look > > > at Boost.SIMD and maybe propose library developer your help. > > > > from https://github.com/MetaScale/nt2/issues/180: "It is quite unsure at > > this stage whether NEON will be provided as an open-source module" > > > > Even if it's not openly provided by developers of NT2, nothing prevents you > from implementing it yourself. > > > ------------------------------ > > Message: 12 > Date: Wed, 29 May 2013 10:37:48 +0200 > From: Tim Blechmann <tim(a)klingt.org> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: <51A5BE5C.6000705(a)klingt.org> > Content-Type: text/plain; charset=ISO-8859-1 > > >>>> Hi, i want to develop boost.arm or boost.neon library so that boost is > >>>> implemented on ARM. > >>> > >>> Hi, > >>> > >>> Boost works well on arm, so nothing should be really developed. > >>> But if you ate talking about SIMD for ARM, that you shall take a look > >>> at Boost.SIMD and maybe propose library developer your help. > >> > >> from https://github.com/MetaScale/nt2/issues/180: "It is quite unsure at > >> this stage whether NEON will be provided as an open-source module" > > > > Even if it's not openly provided by developers of NT2, nothing prevents you > > from implementing it yourself. > > yes and no ... if the nt2 devs submit boost.simd to become an official > part of boost, it is the question if they'd merge an independently > developed arm/neon support, if it conflicts with their business > interests ... the situation is a bit unfortunate ... > > tim > > > ------------------------------ > > Message: 13 > Date: Wed, 29 May 2013 12:52:29 +0400 > From: Andrey Semashev <andrey.semashev(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: > <CAEhD+6D8h43AyTvg65ntZZm804R9p0fiOtARPp2G8cOJC64zog(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > On Wed, May 29, 2013 at 12:37 PM, Tim Blechmann <tim(a)klingt.org> wrote: > > > >>>> Hi, i want to develop boost.arm or boost.neon library so that boost is > > >>>> implemented on ARM. > > >>> > > >>> Hi, > > >>> > > >>> Boost works well on arm, so nothing should be really developed. > > >>> But if you ate talking about SIMD for ARM, that you shall take a look > > >>> at Boost.SIMD and maybe propose library developer your help. > > >> > > >> from https://github.com/MetaScale/nt2/issues/180: "It is quite unsure > > at > > >> this stage whether NEON will be provided as an open-source module" > > > > > > Even if it's not openly provided by developers of NT2, nothing prevents > > you > > > from implementing it yourself. > > > > yes and no ... if the nt2 devs submit boost.simd to become an official > > part of boost, it is the question if they'd merge an independently > > developed arm/neon support, if it conflicts with their business > > interests ... the situation is a bit unfortunate ... > > > > I realize that it may be inconvenient for them to expose their > implementation of NEON module (if there is one) for various reasons. But as > long as Boost.SIMD is licensed under BSL, anyone can use and improve this > code if he likes to, even if it means implementing functionality similar to > the proprietary solution. > > It doesn't necessarily mean that the open solution will take the market > share of the proprietary one. > > > ------------------------------ > > Message: 14 > Date: Wed, 29 May 2013 09:59:04 +0100 > From: David Bellot <david.bellot(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: > <CAOE6ZJEVebMZF90SHC_yHNxmBWy=uC3K1OFokcPrF2RM7=uYrQ(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > again, as I said, you develop and propose a patch to the ublas > mailing-list. We're happy to see contributions from anybody. > > Now I must say that we are interested in Neon instructions for ublas. > It has been on the todo list for quite a long time too: > http://ublas.sf.net > > What I want to say is, apart from the 2 GSOC students and myself > (general maintenance, official releases), nobody has a specific task > assigned to. > > So if you want to contribute, you just work on it and talk about it on > the mailing list so that people can be involved and help you. > > If little by little you contribute with amazing ARM Neon code, then > people will naturally take for granted that you are the ARM Neon > specialist for ublas. As simple as that. > > If someone comes with a better code than you then we will choose the > other code. If you come with a better code than someone else, then we > will choose your code. > > So please, contribute. > > > Are you testing your code on a specific machine or a virtual one ? > What's about things like Raspberry Pi ? I'd like to see benchmark on > this little things. Maybe you can start benchmarking ublas on a tiny > machine like that and/or an Android device and see how gcc is able to > generate auto-vectorized code for this machine. Check the assembly > code to see if Neon instructions have been correctly generated. > > Best, > David > > > > On Wed, May 29, 2013 at 8:50 AM, Aditya Avinash > <adityaavinash143(a)gmail.com> wrote: > > Thank you! > > Can i develop a new kernel for uBLAS using NEON? > > > > On Wed, May 29, 2013 at 1:15 PM, Antony Polukhin <antoshkka(a)gmail.com>wrote: > > > >> 2013/5/29 Aditya Avinash <adityaavinash143(a)gmail.com>: > >> > Hi, i want to develop boost.arm or boost.neon library so that boost is > >> > implemented on ARM. > >> > >> Hi, > >> > >> Boost works well on arm, so nothing should be really developed. > >> But if you ate talking about SIMD for ARM, that you shall take a look > >> at Boost.SIMD and maybe propose library developer your help. > >> > >> > >> -- > >> Best regards, > >> Antony Polukhin > >> > >> _______________________________________________ > >> Unsubscribe & other changes: > >> http://lists.boost.org/mailman/listinfo.cgi/boost > >> > > > > > > > > -- > > ---------------- > > Atluri Aditya Avinash, > > India. > > > > _______________________________________________ > > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > > > ------------------------------ > > Message: 15 > Date: Wed, 29 May 2013 05:27:02 -0400 > From: Rob Stewart <robertstewart(a)comcast.net> > To: "boost(a)lists.boost.org" <boost(a)lists.boost.org> > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: <8ED4CF8D-139A-4232-9C18-968AD38161E7(a)comcast.net> > Content-Type: text/plain; charset=us-ascii > > On May 29, 2013, at 2:35 AM, Aditya Avinash <adityaavinash143(a)gmail.com> wrote: > > > Am sorry. My bad. It's boost.simd. Why isn't it included in boost? I have heard about it recently. Is there a chance that it is added to boost in the near future? > > > > On Wed, May 29, 2013 at 11:57 AM, Karsten Ahnert < > > karsten.ahnert(a)googlemail.com> wrote: > > > >> On 05/29/2013 07:33 AM, Aditya Avinash wrote: > > [snip lots of quoted text] > > >>> On Wed, May 29, 2013 at 10:36 AM, Joel Falcou <joel.falcou(a)gmail.com> > >>> wrote: > >>> > >>> On 29/05/2013 06:45, Gaetano Mendola wrote: > >>>> > >>>> On 29/05/2013 06.13, Aditya Avinash wrote: > > [snip even more quoted text] > > >>>>> Regards > >>>>> Gaetano Mendola > >>>>> > >>>>> > >>>>> See our work on Boost.SIMD ... > > [snip multiple sigs and ML footers] > > > Please read http://www.boost.org/community/policy.html#quoting before posting. > > ___ > Rob > > (Sent from my portable computation engine) > > ------------------------------ > > Message: 16 > Date: Wed, 29 May 2013 11:34:14 +0200 > From: Mathias Gaunard <mathias.gaunard(a)ens-lyon.org> > To: boost(a)lists.boost.org > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: <51A5CB96.3040404(a)ens-lyon.org> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > On 29/05/13 06:13, Aditya Avinash wrote: > > Hi, i have developed vector addition algorithm which exploits the hardware > > parallelism (SSE implementation). > > That's something trivial to do, and unfortunately even that trivial code > is broken (it's written for a generic T but clearly does not work for > any T beside float). > It still has nothing to do with uBLAS. > > Bringing SIMD to uBLAS could be fairly difficult. Is this part of the > GSoC projects? Who's in charge of this? > I'd like to know what the plan is: optimize very specific operations > with SIMD or try to provide a framework to use SIMD in expression templates? > > The former is better adressed by simply binding BLAS, the latter is > certainly not as easy as it sounds. > > > ------------------------------ > > Message: 17 > Date: Wed, 29 May 2013 15:04:51 +0530 > From: Aditya Avinash <adityaavinash143(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: > <CABocMVr1k13N6iBK7VOR4-G8ZPavf6eZL5qd=8cEFLGxDJ_waw(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > Am sorry. My bad. It's boost.simd. Why isn't it included in boost? I have > heard about it recently. Is there a chance that it is added to boost in the > near future? > > > ------------------------------ > > Message: 18 > Date: Wed, 29 May 2013 11:38:45 +0200 > From: Mathias Gaunard <mathias.gaunard(a)ens-lyon.org> > To: boost(a)lists.boost.org > Subject: Re: [boost] Request to contribute boost::FFT > Message-ID: <51A5CCA5.80605(a)ens-lyon.org> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > On 29/05/13 00:12, Nathan Bliss wrote: > > Dear Boost Community Members, > > I am writing to ask if I could contribute a C++ FFT implementation to the boost library. I noticed that there is a boost::CRC so I thought it would be a good addition to have boost::FFT as well. MIT have an existing open-source FFTW library, but it is GPL-licensed which is much more restrictive than the Boost license. I should imagine a commercial FFTW license would be very expensive. > > I have working FFT code which I have tested on Ubuntu Linux GNU gcc and also Visual Studio Express 2012 (MS VC++) for Windows. My code, when run as a 2048-point FFT, agrees with the MIT FFTW one to a max error margin of 6 parts per million. > > It is implemented using templates in a .hpp file and is very easy to use: > > ------------------------------------------------------------------------------------------------------------[fft.hpp] > > template<class FLOAT_TYPE, int FFT_SIZE, int NUM_THREADS>class FFT;///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////[Invocation example] > > typedef double My_type;FFT<My_type, 2048, 4> user_fft;user_fft.initialise_FFT();get_input_samples(*user_fft.input_value_array, user_fft.m_fft_size);user_fft.execute_FFT();print_output_csv(user_fft.output_value_array, 2048);------------------------------------------------------------------------------------------------------------ > > It's uniqueness compared to other FFT implementations is that it fully utilises the boost::thread library, to the extent that the user can give the number of threads they want to use as a parameter to the class template (above case is for 4 parallel threads). > > It is structured and organised so that users could customise/optimise it to specific processor architectures. > > I've also tried to develop it in the spirit of Boost in that all class members which users should not access are private, only making public what is necessary to the API. My code is a decimation-in-time radix-2 FFT, and users could in theory use the existing API as a basis to extend it to more complex implementations such as the Reverse/Inverse FFT, bit-reversal of inputs/outputs and multi-dimensional FFTs. > > I look forward to your reply. > > Kind regards,Nathan Bliss > > You may want to give a look to the FFT functions bundled with NT2 > courtesy of Domagoj Saric. > > They also generate a FFT for a given compile-time size and use > Boost.SIMD for vectorization (but no threads). Unfortunately the code is > not so generic that it can work with arbitrary vector sizes, so it > limits portability somewhat. > > <https://github.com/MetaScale/nt2/blob/master/modules/core/signal/include/nt…> > > > ------------------------------ > > Subject: Digest Footer > > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > > ------------------------------ > > End of Boost Digest, Vol 4012, Issue 1 > **************************************

1 0

Re: [boost] Reply to questions about FFT template class
by Nathan Bliss 29 May '13

29 May '13

Hi, Just to answer the previous questions about my FFT code... I'm afraid it's only a basic FFT implementation. It may not be up to the standard of Boost and I was always prepared for this, so I may then have to submit it to a less prestigious open source forum on the web somewhere. I made a mistake before about the precision. Mine agrees with the FFTW 2048-point results to a max error of 3 parts per million (max diff with FFTW value is 2.53E-06). Most of the outputs show zero or infinitesimal diffs. I've checked by math many times and I can only think it's because of performance-related approximations in FFTW, as the diffs seem too small to be algorithmic errors. Unfortunately, the FFTW implementation is ~20 times faster than mine. FFTW can run a 2048-point in 6ms on my Ubuntu installation whereas mine takes approx. 140ms. On Windows, both implementations are an order of magnitude slower (5secs for mine versus 250ms for FFTW). The boost multi-threading appears to make no difference to the speed, even though I've run it through GDB and with printfs to check that my code automatically spawns the optimal number of threads up to the max value given as the template parameter. Some compilers may be able to optimise the C++ code and multi-threading to increase performance, though I do not know if it could ever approach FFTW's. I have not implemented more advanced FFT features such as multi-dimensional FFTs or real-value-only optimisations, but I think the current API could facilitate users extending it to include forward/reverse FFT, bit-reversal, multi-dimensional FFTS (by manipulating the input and output vectors), etc. I've tried to make the code well organised, structured and commented so that hopefully users could customise it with their own optimisations for specific processor architectures. I'll understand if the consensus is that it is not really good enough for Boost. Alternatively, I would be happy to share my code and share the credit if anyone else wants to help. Kind regards,Nathan > From: boost-request(a)lists.boost.org > Subject: Boost Digest, Vol 4012, Issue 1 > To: boost(a)lists.boost.org > Date: Wed, 29 May 2013 05:38:51 -0400 > > Send Boost mailing list submissions to > boost(a)lists.boost.org > > To subscribe or unsubscribe via the World Wide Web, visit > http://lists.boost.org/mailman/listinfo.cgi/boost > or, via email, send a message with subject or body 'help' to > boost-request(a)lists.boost.org > > You can reach the person managing the list at > boost-owner(a)lists.boost.org > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of Boost digest..." > > > The boost archives may be found at: http://lists.boost.org/Archives/boost/ > > Today's Topics: > > 1. Re: SIMD implementation of uBLAS (Aditya Avinash) > 2. Re: SIMD implementation of uBLAS (Karsten Ahnert) > 3. Re: Request to contribute boost::FFT (Karsten Ahnert) > 4. Re: SIMD implementation of uBLAS (Aditya Avinash) > 5. Boost on ARM using NEON (Aditya Avinash) > 6. Re: Boost on ARM using NEON (Antony Polukhin) > 7. Re: Boost on ARM using NEON (Aditya Avinash) > 8. Re: Boost on ARM using NEON (Tim Blechmann) > 9. Re: Request to contribute boost::FFT (Paul A. Bristow) > 10. Re: Boost on ARM using NEON (Victor Hiairrassary) > 11. Re: Boost on ARM using NEON (Andrey Semashev) > 12. Re: Boost on ARM using NEON (Tim Blechmann) > 13. Re: Boost on ARM using NEON (Andrey Semashev) > 14. Re: Boost on ARM using NEON (David Bellot) > 15. Re: SIMD implementation of uBLAS (Rob Stewart) > 16. Re: SIMD implementation of uBLAS (Mathias Gaunard) > 17. Re: SIMD implementation of uBLAS (Aditya Avinash) > 18. Re: Request to contribute boost::FFT (Mathias Gaunard) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Wed, 29 May 2013 11:03:50 +0530 > From: Aditya Avinash <adityaavinash143(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: > <CABocMVpiKTED=tPZ4QtXBZAVdbwHMv+26LE+YXx9u2+HyWAFag(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > @Gaetano: Thank you for the comments. I'll change accordingly and post it > back. I am using T because, the code need to run double precision float > also. > @Joel: The Boost.SIMD is generalized. Designing algorithms specific to > uBLAS increases the performance. Odeint have their own simd backend. > > On Wed, May 29, 2013 at 10:36 AM, Joel Falcou <joel.falcou(a)gmail.com> wrote: > > > On 29/05/2013 06:45, Gaetano Mendola wrote: > > > >> On 29/05/2013 06.13, Aditya Avinash wrote: > >> > >>> Hi, i have developed vector addition algorithm which exploits the > >>> hardware > >>> parallelism (SSE implementation). > >>> > >> > >> A few comments: > >> > >> - That is not C++ but just C in disguise of C++ code > >> . SSE1 CTOR doesn't use initialization list > >> . SSE1 doesn't have a DTOR and the user has to > >> explicit call the Free method > >> > >> - const-correctness is not in place > >> - The SSE namespace should have been put in a "detail" > >> namespace > >> - Use memcpy instead of explicit for > >> - Why is SSE1 template when it works only when T is a > >> single-precision, floating-point value ? > >> > >> > >> Also I believe a nice interface whould have been: > >> > >> SSE1::vector A(1024); > >> SSE1::vector B(1024); > >> SSE1::vector C(1024); > >> > >> C = A + B; > >> > >> > >> Regards > >> Gaetano Mendola > >> > >> > > See our work on Boost.SIMD ... > > > > > > > > ______________________________**_________________ > > Unsubscribe & other changes: http://lists.boost.org/** > > mailman/listinfo.cgi/boost<http://lists.boost.org/mailman/listinfo.cgi/boost> > > > > > > -- > ---------------- > Atluri Aditya Avinash, > India. > > > ------------------------------ > > Message: 2 > Date: Wed, 29 May 2013 08:27:40 +0200 > From: Karsten Ahnert <karsten.ahnert(a)googlemail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: <51A59FDC.5050409(a)googlemail.com> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > On 05/29/2013 07:33 AM, Aditya Avinash wrote: > > @Gaetano: Thank you for the comments. I'll change accordingly and post it > > back. I am using T because, the code need to run double precision float > > also. > > @Joel: The Boost.SIMD is generalized. Designing algorithms specific to > > uBLAS increases the performance. Odeint have their own simd backend. > > odeint has no simd backend, At least i am not aware of an simd backend. > Having one would be really great. > > > > > > On Wed, May 29, 2013 at 10:36 AM, Joel Falcou <joel.falcou(a)gmail.com> wrote: > > > >> On 29/05/2013 06:45, Gaetano Mendola wrote: > >> > >>> On 29/05/2013 06.13, Aditya Avinash wrote: > >>> > >>>> Hi, i have developed vector addition algorithm which exploits the > >>>> hardware > >>>> parallelism (SSE implementation). > >>>> > >>> > >>> A few comments: > >>> > >>> - That is not C++ but just C in disguise of C++ code > >>> . SSE1 CTOR doesn't use initialization list > >>> . SSE1 doesn't have a DTOR and the user has to > >>> explicit call the Free method > >>> > >>> - const-correctness is not in place > >>> - The SSE namespace should have been put in a "detail" > >>> namespace > >>> - Use memcpy instead of explicit for > >>> - Why is SSE1 template when it works only when T is a > >>> single-precision, floating-point value ? > >>> > >>> > >>> Also I believe a nice interface whould have been: > >>> > >>> SSE1::vector A(1024); > >>> SSE1::vector B(1024); > >>> SSE1::vector C(1024); > >>> > >>> C = A + B; > >>> > >>> > >>> Regards > >>> Gaetano Mendola > >>> > >>> > >> See our work on Boost.SIMD ... > >> > >> > >> > >> ______________________________**_________________ > >> Unsubscribe & other changes: http://lists.boost.org/** > >> mailman/listinfo.cgi/boost<http://lists.boost.org/mailman/listinfo.cgi/boost> > >> > > > > > > > > > > ------------------------------ > > Message: 3 > Date: Wed, 29 May 2013 08:32:15 +0200 > From: Karsten Ahnert <karsten.ahnert(a)googlemail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Request to contribute boost::FFT > Message-ID: <51A5A0EF.9000806(a)googlemail.com> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > On 05/29/2013 12:12 AM, Nathan Bliss wrote: > > Dear Boost Community Members, > > I am writing to ask if I could contribute a C++ FFT implementation to the boost library. I noticed that there is a boost::CRC so I thought it would be a good addition to have boost::FFT as well. MIT have an existing open-source FFTW library, but it is GPL-licensed which is much more restrictive than the Boost license. I should imagine a commercial FFTW license would be very expensive. > > I have working FFT code which I have tested on Ubuntu Linux GNU gcc and also Visual Studio Express 2012 (MS VC++) for Windows. My code, when run as a 2048-point FFT, agrees with the MIT FFTW one to a max error margin of 6 parts per million. > > I would really like to see an FFT implementation in boost. It should of > course focus on performance. I also think that interoperability with > different vector and storage types would be really great. It prevents > that the user has to convert its data types in different formats (which > can be really painful if you use different libraries, for example > odeint, ublas, fftw, ...). > > > > > > ------------------------------ > > Message: 4 > Date: Wed, 29 May 2013 12:05:24 +0530 > From: Aditya Avinash <adityaavinash143(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: > <CABocMVpBesKaSTznHmKACxNpPUwYtTs50vUaWeZo5qUUaK9K+Q(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > Am sorry. My bad. It's boost.simd. Why isn't it included in boost? I have > heard about it recently. Is there a chance that it is added to boost in the > near future? > > On Wed, May 29, 2013 at 11:57 AM, Karsten Ahnert < > karsten.ahnert(a)googlemail.com> wrote: > > > On 05/29/2013 07:33 AM, Aditya Avinash wrote: > > > >> @Gaetano: Thank you for the comments. I'll change accordingly and post it > >> back. I am using T because, the code need to run double precision float > >> also. > >> @Joel: The Boost.SIMD is generalized. Designing algorithms specific to > >> uBLAS increases the performance. Odeint have their own simd backend. > >> > > > > odeint has no simd backend, At least i am not aware of an simd backend. > > Having one would be really great. > > > > > > > >> On Wed, May 29, 2013 at 10:36 AM, Joel Falcou <joel.falcou(a)gmail.com> > >> wrote: > >> > >> On 29/05/2013 06:45, Gaetano Mendola wrote: > >>> > >>> On 29/05/2013 06.13, Aditya Avinash wrote: > >>>> > >>>> Hi, i have developed vector addition algorithm which exploits the > >>>>> hardware > >>>>> parallelism (SSE implementation). > >>>>> > >>>>> > >>>> A few comments: > >>>> > >>>> - That is not C++ but just C in disguise of C++ code > >>>> . SSE1 CTOR doesn't use initialization list > >>>> . SSE1 doesn't have a DTOR and the user has to > >>>> explicit call the Free method > >>>> > >>>> - const-correctness is not in place > >>>> - The SSE namespace should have been put in a "detail" > >>>> namespace > >>>> - Use memcpy instead of explicit for > >>>> - Why is SSE1 template when it works only when T is a > >>>> single-precision, floating-point value ? > >>>> > >>>> > >>>> Also I believe a nice interface whould have been: > >>>> > >>>> SSE1::vector A(1024); > >>>> SSE1::vector B(1024); > >>>> SSE1::vector C(1024); > >>>> > >>>> C = A + B; > >>>> > >>>> > >>>> Regards > >>>> Gaetano Mendola > >>>> > >>>> > >>>> See our work on Boost.SIMD ... > >>> > >>> > >>> > >>> ______________________________****_________________ > >>> Unsubscribe & other changes: http://lists.boost.org/** > >>> mailman/listinfo.cgi/boost<htt**p://lists.boost.org/mailman/** > >>> listinfo.cgi/boost <http://lists.boost.org/mailman/listinfo.cgi/boost>> > >>> > >>> > >> > >> > >> > > > > ______________________________**_________________ > > Unsubscribe & other changes: http://lists.boost.org/** > > mailman/listinfo.cgi/boost<http://lists.boost.org/mailman/listinfo.cgi/boost> > > > > > > -- > ---------------- > Atluri Aditya Avinash, > India. > > > ------------------------------ > > Message: 5 > Date: Wed, 29 May 2013 12:19:39 +0530 > From: Aditya Avinash <adityaavinash143(a)gmail.com> > To: boost(a)lists.boost.org > Subject: [boost] Boost on ARM using NEON > Message-ID: > <CABocMVpQqBGqduE6jj-KG=O5faV08GcoV=TOS_bXFLYWTkzKjA(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > Hi, i want to develop boost.arm or boost.neon library so that boost is > implemented on ARM. > > -- > ---------------- > Atluri Aditya Avinash, > India. > > > ------------------------------ > > Message: 6 > Date: Wed, 29 May 2013 11:45:12 +0400 > From: Antony Polukhin <antoshkka(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: > <CAKqmYPbt+wq92BvLLn-5GUhFfmvWiWsAoqfpXK6XOmnRK7EtwQ(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > 2013/5/29 Aditya Avinash <adityaavinash143(a)gmail.com>: > > Hi, i want to develop boost.arm or boost.neon library so that boost is > > implemented on ARM. > > Hi, > > Boost works well on arm, so nothing should be really developed. > But if you ate talking about SIMD for ARM, that you shall take a look > at Boost.SIMD and maybe propose library developer your help. > > > -- > Best regards, > Antony Polukhin > > > ------------------------------ > > Message: 7 > Date: Wed, 29 May 2013 13:20:15 +0530 > From: Aditya Avinash <adityaavinash143(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: > <CABocMVo_DbCaxRPDOK4_1KMw8m7O54gXKgOqX+cmYRcBndNYDA(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > Thank you! > Can i develop a new kernel for uBLAS using NEON? > > On Wed, May 29, 2013 at 1:15 PM, Antony Polukhin <antoshkka(a)gmail.com>wrote: > > > 2013/5/29 Aditya Avinash <adityaavinash143(a)gmail.com>: > > > Hi, i want to develop boost.arm or boost.neon library so that boost is > > > implemented on ARM. > > > > Hi, > > > > Boost works well on arm, so nothing should be really developed. > > But if you ate talking about SIMD for ARM, that you shall take a look > > at Boost.SIMD and maybe propose library developer your help. > > > > > > -- > > Best regards, > > Antony Polukhin > > > > _______________________________________________ > > Unsubscribe & other changes: > > http://lists.boost.org/mailman/listinfo.cgi/boost > > > > > > -- > ---------------- > Atluri Aditya Avinash, > India. > > > ------------------------------ > > Message: 8 > Date: Wed, 29 May 2013 09:52:57 +0200 > From: Tim Blechmann <tim(a)klingt.org> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: <51A5B3D9.2010807(a)klingt.org> > Content-Type: text/plain; charset=ISO-8859-1 > > >> Hi, i want to develop boost.arm or boost.neon library so that boost is > >> implemented on ARM. > > > > Hi, > > > > Boost works well on arm, so nothing should be really developed. > > But if you ate talking about SIMD for ARM, that you shall take a look > > at Boost.SIMD and maybe propose library developer your help. > > from https://github.com/MetaScale/nt2/issues/180: "It is quite unsure at > this stage whether NEON will be provided as an open-source module" > > tim > > > > ------------------------------ > > Message: 9 > Date: Wed, 29 May 2013 08:55:41 +0100 > From: "Paul A. Bristow" <pbristow(a)hetp.u-net.com> > To: <boost(a)lists.boost.org> > Subject: Re: [boost] Request to contribute boost::FFT > Message-ID: <001f01ce5c41$ea88da30$bf9a8e90$(a)hetp.u-net.com> > Content-Type: text/plain; charset="us-ascii" > > > -----Original Message----- > > From: Boost [mailto:boost-bounces@lists.boost.org] On Behalf Of Nathan Bliss > > Sent: Tuesday, May 28, 2013 11:12 PM > > To: boost(a)lists.boost.org > > Subject: [boost] Request to contribute boost::FFT > > > > I am writing to ask if I could contribute a C++ FFT implementation to the boost library. > > Definitely, a good templated C++ FFT would be very welcome. > > Would/does it work with Boost.Multiprecision to give much higher precision ? (at a snail's pace of > course). > > Paul > > --- > Paul A. Bristow, > Prizet Farmhouse, Kendal LA8 8AB UK > +44 1539 561830 07714330204 > pbristow(a)hetp.u-net.com > > > > > > > > > > > > > ------------------------------ > > Message: 10 > Date: Wed, 29 May 2013 09:15:36 +0200 > From: Victor Hiairrassary <victor.hiairrassary.ml(a)gmail.com> > To: "boost(a)lists.boost.org" <boost(a)lists.boost.org> > Cc: "boost(a)lists.boost.org" <boost(a)lists.boost.org> > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: <22F316D0-E311-4BE3-94FB-11DE688C9CAB(a)gmail.com> > Content-Type: text/plain; charset=us-ascii > > boost already works very well on ARM ! > > If you want to use Neon extension, look at boost simd (I do not know if Neon is implemented yet, feel free to do it) ! > > https://github.com/MetaScale/nt2 > > On 29 mai 2013, at 08:49, Aditya Avinash <adityaavinash143(a)gmail.com> wrote: > > > Hi, i want to develop boost.arm or boost.neon library so that boost is > > implemented on ARM. > > > > -- > > ---------------- > > Atluri Aditya Avinash, > > India. > > > > _______________________________________________ > > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > > > ------------------------------ > > Message: 11 > Date: Wed, 29 May 2013 12:11:31 +0400 > From: Andrey Semashev <andrey.semashev(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: > <CAEhD+6BfavRaGgok9eMbDebCP1Hdg2T3Z3be7BWZTAZ1EDpfzg(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > On Wed, May 29, 2013 at 11:52 AM, Tim Blechmann <tim(a)klingt.org> wrote: > > > >> Hi, i want to develop boost.arm or boost.neon library so that boost is > > >> implemented on ARM. > > > > > > Hi, > > > > > > Boost works well on arm, so nothing should be really developed. > > > But if you ate talking about SIMD for ARM, that you shall take a look > > > at Boost.SIMD and maybe propose library developer your help. > > > > from https://github.com/MetaScale/nt2/issues/180: "It is quite unsure at > > this stage whether NEON will be provided as an open-source module" > > > > Even if it's not openly provided by developers of NT2, nothing prevents you > from implementing it yourself. > > > ------------------------------ > > Message: 12 > Date: Wed, 29 May 2013 10:37:48 +0200 > From: Tim Blechmann <tim(a)klingt.org> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: <51A5BE5C.6000705(a)klingt.org> > Content-Type: text/plain; charset=ISO-8859-1 > > >>>> Hi, i want to develop boost.arm or boost.neon library so that boost is > >>>> implemented on ARM. > >>> > >>> Hi, > >>> > >>> Boost works well on arm, so nothing should be really developed. > >>> But if you ate talking about SIMD for ARM, that you shall take a look > >>> at Boost.SIMD and maybe propose library developer your help. > >> > >> from https://github.com/MetaScale/nt2/issues/180: "It is quite unsure at > >> this stage whether NEON will be provided as an open-source module" > > > > Even if it's not openly provided by developers of NT2, nothing prevents you > > from implementing it yourself. > > yes and no ... if the nt2 devs submit boost.simd to become an official > part of boost, it is the question if they'd merge an independently > developed arm/neon support, if it conflicts with their business > interests ... the situation is a bit unfortunate ... > > tim > > > ------------------------------ > > Message: 13 > Date: Wed, 29 May 2013 12:52:29 +0400 > From: Andrey Semashev <andrey.semashev(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: > <CAEhD+6D8h43AyTvg65ntZZm804R9p0fiOtARPp2G8cOJC64zog(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > On Wed, May 29, 2013 at 12:37 PM, Tim Blechmann <tim(a)klingt.org> wrote: > > > >>>> Hi, i want to develop boost.arm or boost.neon library so that boost is > > >>>> implemented on ARM. > > >>> > > >>> Hi, > > >>> > > >>> Boost works well on arm, so nothing should be really developed. > > >>> But if you ate talking about SIMD for ARM, that you shall take a look > > >>> at Boost.SIMD and maybe propose library developer your help. > > >> > > >> from https://github.com/MetaScale/nt2/issues/180: "It is quite unsure > > at > > >> this stage whether NEON will be provided as an open-source module" > > > > > > Even if it's not openly provided by developers of NT2, nothing prevents > > you > > > from implementing it yourself. > > > > yes and no ... if the nt2 devs submit boost.simd to become an official > > part of boost, it is the question if they'd merge an independently > > developed arm/neon support, if it conflicts with their business > > interests ... the situation is a bit unfortunate ... > > > > I realize that it may be inconvenient for them to expose their > implementation of NEON module (if there is one) for various reasons. But as > long as Boost.SIMD is licensed under BSL, anyone can use and improve this > code if he likes to, even if it means implementing functionality similar to > the proprietary solution. > > It doesn't necessarily mean that the open solution will take the market > share of the proprietary one. > > > ------------------------------ > > Message: 14 > Date: Wed, 29 May 2013 09:59:04 +0100 > From: David Bellot <david.bellot(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: > <CAOE6ZJEVebMZF90SHC_yHNxmBWy=uC3K1OFokcPrF2RM7=uYrQ(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > again, as I said, you develop and propose a patch to the ublas > mailing-list. We're happy to see contributions from anybody. > > Now I must say that we are interested in Neon instructions for ublas. > It has been on the todo list for quite a long time too: > http://ublas.sf.net > > What I want to say is, apart from the 2 GSOC students and myself > (general maintenance, official releases), nobody has a specific task > assigned to. > > So if you want to contribute, you just work on it and talk about it on > the mailing list so that people can be involved and help you. > > If little by little you contribute with amazing ARM Neon code, then > people will naturally take for granted that you are the ARM Neon > specialist for ublas. As simple as that. > > If someone comes with a better code than you then we will choose the > other code. If you come with a better code than someone else, then we > will choose your code. > > So please, contribute. > > > Are you testing your code on a specific machine or a virtual one ? > What's about things like Raspberry Pi ? I'd like to see benchmark on > this little things. Maybe you can start benchmarking ublas on a tiny > machine like that and/or an Android device and see how gcc is able to > generate auto-vectorized code for this machine. Check the assembly > code to see if Neon instructions have been correctly generated. > > Best, > David > > > > On Wed, May 29, 2013 at 8:50 AM, Aditya Avinash > <adityaavinash143(a)gmail.com> wrote: > > Thank you! > > Can i develop a new kernel for uBLAS using NEON? > > > > On Wed, May 29, 2013 at 1:15 PM, Antony Polukhin <antoshkka(a)gmail.com>wrote: > > > >> 2013/5/29 Aditya Avinash <adityaavinash143(a)gmail.com>: > >> > Hi, i want to develop boost.arm or boost.neon library so that boost is > >> > implemented on ARM. > >> > >> Hi, > >> > >> Boost works well on arm, so nothing should be really developed. > >> But if you ate talking about SIMD for ARM, that you shall take a look > >> at Boost.SIMD and maybe propose library developer your help. > >> > >> > >> -- > >> Best regards, > >> Antony Polukhin > >> > >> _______________________________________________ > >> Unsubscribe & other changes: > >> http://lists.boost.org/mailman/listinfo.cgi/boost > >> > > > > > > > > -- > > ---------------- > > Atluri Aditya Avinash, > > India. > > > > _______________________________________________ > > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > > > ------------------------------ > > Message: 15 > Date: Wed, 29 May 2013 05:27:02 -0400 > From: Rob Stewart <robertstewart(a)comcast.net> > To: "boost(a)lists.boost.org" <boost(a)lists.boost.org> > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: <8ED4CF8D-139A-4232-9C18-968AD38161E7(a)comcast.net> > Content-Type: text/plain; charset=us-ascii > > On May 29, 2013, at 2:35 AM, Aditya Avinash <adityaavinash143(a)gmail.com> wrote: > > > Am sorry. My bad. It's boost.simd. Why isn't it included in boost? I have heard about it recently. Is there a chance that it is added to boost in the near future? > > > > On Wed, May 29, 2013 at 11:57 AM, Karsten Ahnert < > > karsten.ahnert(a)googlemail.com> wrote: > > > >> On 05/29/2013 07:33 AM, Aditya Avinash wrote: > > [snip lots of quoted text] > > >>> On Wed, May 29, 2013 at 10:36 AM, Joel Falcou <joel.falcou(a)gmail.com> > >>> wrote: > >>> > >>> On 29/05/2013 06:45, Gaetano Mendola wrote: > >>>> > >>>> On 29/05/2013 06.13, Aditya Avinash wrote: > > [snip even more quoted text] > > >>>>> Regards > >>>>> Gaetano Mendola > >>>>> > >>>>> > >>>>> See our work on Boost.SIMD ... > > [snip multiple sigs and ML footers] > > > Please read http://www.boost.org/community/policy.html#quoting before posting. > > ___ > Rob > > (Sent from my portable computation engine) > > ------------------------------ > > Message: 16 > Date: Wed, 29 May 2013 11:34:14 +0200 > From: Mathias Gaunard <mathias.gaunard(a)ens-lyon.org> > To: boost(a)lists.boost.org > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: <51A5CB96.3040404(a)ens-lyon.org> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > On 29/05/13 06:13, Aditya Avinash wrote: > > Hi, i have developed vector addition algorithm which exploits the hardware > > parallelism (SSE implementation). > > That's something trivial to do, and unfortunately even that trivial code > is broken (it's written for a generic T but clearly does not work for > any T beside float). > It still has nothing to do with uBLAS. > > Bringing SIMD to uBLAS could be fairly difficult. Is this part of the > GSoC projects? Who's in charge of this? > I'd like to know what the plan is: optimize very specific operations > with SIMD or try to provide a framework to use SIMD in expression templates? > > The former is better adressed by simply binding BLAS, the latter is > certainly not as easy as it sounds. > > > ------------------------------ > > Message: 17 > Date: Wed, 29 May 2013 15:04:51 +0530 > From: Aditya Avinash <adityaavinash143(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: > <CABocMVr1k13N6iBK7VOR4-G8ZPavf6eZL5qd=8cEFLGxDJ_waw(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > Am sorry. My bad. It's boost.simd. Why isn't it included in boost? I have > heard about it recently. Is there a chance that it is added to boost in the > near future? > > > ------------------------------ > > Message: 18 > Date: Wed, 29 May 2013 11:38:45 +0200 > From: Mathias Gaunard <mathias.gaunard(a)ens-lyon.org> > To: boost(a)lists.boost.org > Subject: Re: [boost] Request to contribute boost::FFT > Message-ID: <51A5CCA5.80605(a)ens-lyon.org> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > On 29/05/13 00:12, Nathan Bliss wrote: > > Dear Boost Community Members, > > I am writing to ask if I could contribute a C++ FFT implementation to the boost library. I noticed that there is a boost::CRC so I thought it would be a good addition to have boost::FFT as well. MIT have an existing open-source FFTW library, but it is GPL-licensed which is much more restrictive than the Boost license. I should imagine a commercial FFTW license would be very expensive. > > I have working FFT code which I have tested on Ubuntu Linux GNU gcc and also Visual Studio Express 2012 (MS VC++) for Windows. My code, when run as a 2048-point FFT, agrees with the MIT FFTW one to a max error margin of 6 parts per million. > > It is implemented using templates in a .hpp file and is very easy to use: > > ------------------------------------------------------------------------------------------------------------[fft.hpp] > > template<class FLOAT_TYPE, int FFT_SIZE, int NUM_THREADS>class FFT;///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////[Invocation example] > > typedef double My_type;FFT<My_type, 2048, 4> user_fft;user_fft.initialise_FFT();get_input_samples(*user_fft.input_value_array, user_fft.m_fft_size);user_fft.execute_FFT();print_output_csv(user_fft.output_value_array, 2048);------------------------------------------------------------------------------------------------------------ > > It's uniqueness compared to other FFT implementations is that it fully utilises the boost::thread library, to the extent that the user can give the number of threads they want to use as a parameter to the class template (above case is for 4 parallel threads). > > It is structured and organised so that users could customise/optimise it to specific processor architectures. > > I've also tried to develop it in the spirit of Boost in that all class members which users should not access are private, only making public what is necessary to the API. My code is a decimation-in-time radix-2 FFT, and users could in theory use the existing API as a basis to extend it to more complex implementations such as the Reverse/Inverse FFT, bit-reversal of inputs/outputs and multi-dimensional FFTs. > > I look forward to your reply. > > Kind regards,Nathan Bliss > > You may want to give a look to the FFT functions bundled with NT2 > courtesy of Domagoj Saric. > > They also generate a FFT for a given compile-time size and use > Boost.SIMD for vectorization (but no threads). Unfortunately the code is > not so generic that it can work with arbitrary vector sizes, so it > limits portability somewhat. > > <https://github.com/MetaScale/nt2/blob/master/modules/core/signal/include/nt…> > > > ------------------------------ > > Subject: Digest Footer > > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > > ------------------------------ > > End of Boost Digest, Vol 4012, Issue 1 > **************************************

1 0

Re: [boost] Reply to questions about FFT template class
by Nathan Bliss 29 May '13

29 May '13

Hi, Just to answer the previous questions about my FFT code... I'm afraid it's only a basic FFT implementation. It may not be up to the standard of Boost and I was always prepared for this, so I may then have to submit it to a less prestigious open source forum on the web somewhere. I made a mistake before about the precision. Mine agrees with the FFTW 2048-point results to a max error of 3 parts per million (max diff with FFTW value is 2.53E-06). Most of the outputs show zero or infinitesimal diffs. I've checked by math many times and I can only think it's because of performance-related approximations in FFTW, as the diffs seem too small to be algorithmic errors. Unfortunately, the FFTW implementation is ~20 times faster than mine. FFTW can run a 2048-point in 6ms on my Ubuntu installation whereas mine takes approx. 140ms. On Windows, both implementations are an order of magnitude slower (5secs for mine versus 250ms for FFTW). The boost multi-threading appears to make no difference to the speed, even though I've run it through GDB and with printfs to check that my code automatically spawns the optimal number of threads up to the max value given as the template parameter. Some compilers may be able to optimise the C++ code and multi-threading to increase performance, though I do not know if it could ever approach FFTW's. I have not implemented more advanced FFT features such as multi-dimensional FFTs or real-value-only optimisations, but I think the current API could facilitate users extending it to include forward/reverse FFT, bit-reversal, multi-dimensional FFTS (by manipulating the input and output vectors), etc. I've tried to make the code well organised, structured and commented so that hopefully users could customise it with their own optimisations for specific processor architectures. I'll understand if the consensus is that it is not really good enough for Boost. Alternatively, I would be happy to share my code and share the credit if anyone else wants to help. Kind regards,Nathan > From: boost-request(a)lists.boost.org > Subject: Boost Digest, Vol 4012, Issue 1 > To: boost(a)lists.boost.org > Date: Wed, 29 May 2013 05:38:51 -0400 > > Send Boost mailing list submissions to > boost(a)lists.boost.org > > To subscribe or unsubscribe via the World Wide Web, visit > http://lists.boost.org/mailman/listinfo.cgi/boost > or, via email, send a message with subject or body 'help' to > boost-request(a)lists.boost.org > > You can reach the person managing the list at > boost-owner(a)lists.boost.org > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of Boost digest..." > > > The boost archives may be found at: http://lists.boost.org/Archives/boost/ > > Today's Topics: > > 1. Re: SIMD implementation of uBLAS (Aditya Avinash) > 2. Re: SIMD implementation of uBLAS (Karsten Ahnert) > 3. Re: Request to contribute boost::FFT (Karsten Ahnert) > 4. Re: SIMD implementation of uBLAS (Aditya Avinash) > 5. Boost on ARM using NEON (Aditya Avinash) > 6. Re: Boost on ARM using NEON (Antony Polukhin) > 7. Re: Boost on ARM using NEON (Aditya Avinash) > 8. Re: Boost on ARM using NEON (Tim Blechmann) > 9. Re: Request to contribute boost::FFT (Paul A. Bristow) > 10. Re: Boost on ARM using NEON (Victor Hiairrassary) > 11. Re: Boost on ARM using NEON (Andrey Semashev) > 12. Re: Boost on ARM using NEON (Tim Blechmann) > 13. Re: Boost on ARM using NEON (Andrey Semashev) > 14. Re: Boost on ARM using NEON (David Bellot) > 15. Re: SIMD implementation of uBLAS (Rob Stewart) > 16. Re: SIMD implementation of uBLAS (Mathias Gaunard) > 17. Re: SIMD implementation of uBLAS (Aditya Avinash) > 18. Re: Request to contribute boost::FFT (Mathias Gaunard) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Wed, 29 May 2013 11:03:50 +0530 > From: Aditya Avinash <adityaavinash143(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: > <CABocMVpiKTED=tPZ4QtXBZAVdbwHMv+26LE+YXx9u2+HyWAFag(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > @Gaetano: Thank you for the comments. I'll change accordingly and post it > back. I am using T because, the code need to run double precision float > also. > @Joel: The Boost.SIMD is generalized. Designing algorithms specific to > uBLAS increases the performance. Odeint have their own simd backend. > > On Wed, May 29, 2013 at 10:36 AM, Joel Falcou <joel.falcou(a)gmail.com> wrote: > > > On 29/05/2013 06:45, Gaetano Mendola wrote: > > > >> On 29/05/2013 06.13, Aditya Avinash wrote: > >> > >>> Hi, i have developed vector addition algorithm which exploits the > >>> hardware > >>> parallelism (SSE implementation). > >>> > >> > >> A few comments: > >> > >> - That is not C++ but just C in disguise of C++ code > >> . SSE1 CTOR doesn't use initialization list > >> . SSE1 doesn't have a DTOR and the user has to > >> explicit call the Free method > >> > >> - const-correctness is not in place > >> - The SSE namespace should have been put in a "detail" > >> namespace > >> - Use memcpy instead of explicit for > >> - Why is SSE1 template when it works only when T is a > >> single-precision, floating-point value ? > >> > >> > >> Also I believe a nice interface whould have been: > >> > >> SSE1::vector A(1024); > >> SSE1::vector B(1024); > >> SSE1::vector C(1024); > >> > >> C = A + B; > >> > >> > >> Regards > >> Gaetano Mendola > >> > >> > > See our work on Boost.SIMD ... > > > > > > > > ______________________________**_________________ > > Unsubscribe & other changes: http://lists.boost.org/** > > mailman/listinfo.cgi/boost<http://lists.boost.org/mailman/listinfo.cgi/boost> > > > > > > -- > ---------------- > Atluri Aditya Avinash, > India. > > > ------------------------------ > > Message: 2 > Date: Wed, 29 May 2013 08:27:40 +0200 > From: Karsten Ahnert <karsten.ahnert(a)googlemail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: <51A59FDC.5050409(a)googlemail.com> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > On 05/29/2013 07:33 AM, Aditya Avinash wrote: > > @Gaetano: Thank you for the comments. I'll change accordingly and post it > > back. I am using T because, the code need to run double precision float > > also. > > @Joel: The Boost.SIMD is generalized. Designing algorithms specific to > > uBLAS increases the performance. Odeint have their own simd backend. > > odeint has no simd backend, At least i am not aware of an simd backend. > Having one would be really great. > > > > > > On Wed, May 29, 2013 at 10:36 AM, Joel Falcou <joel.falcou(a)gmail.com> wrote: > > > >> On 29/05/2013 06:45, Gaetano Mendola wrote: > >> > >>> On 29/05/2013 06.13, Aditya Avinash wrote: > >>> > >>>> Hi, i have developed vector addition algorithm which exploits the > >>>> hardware > >>>> parallelism (SSE implementation). > >>>> > >>> > >>> A few comments: > >>> > >>> - That is not C++ but just C in disguise of C++ code > >>> . SSE1 CTOR doesn't use initialization list > >>> . SSE1 doesn't have a DTOR and the user has to > >>> explicit call the Free method > >>> > >>> - const-correctness is not in place > >>> - The SSE namespace should have been put in a "detail" > >>> namespace > >>> - Use memcpy instead of explicit for > >>> - Why is SSE1 template when it works only when T is a > >>> single-precision, floating-point value ? > >>> > >>> > >>> Also I believe a nice interface whould have been: > >>> > >>> SSE1::vector A(1024); > >>> SSE1::vector B(1024); > >>> SSE1::vector C(1024); > >>> > >>> C = A + B; > >>> > >>> > >>> Regards > >>> Gaetano Mendola > >>> > >>> > >> See our work on Boost.SIMD ... > >> > >> > >> > >> ______________________________**_________________ > >> Unsubscribe & other changes: http://lists.boost.org/** > >> mailman/listinfo.cgi/boost<http://lists.boost.org/mailman/listinfo.cgi/boost> > >> > > > > > > > > > > ------------------------------ > > Message: 3 > Date: Wed, 29 May 2013 08:32:15 +0200 > From: Karsten Ahnert <karsten.ahnert(a)googlemail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Request to contribute boost::FFT > Message-ID: <51A5A0EF.9000806(a)googlemail.com> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > On 05/29/2013 12:12 AM, Nathan Bliss wrote: > > Dear Boost Community Members, > > I am writing to ask if I could contribute a C++ FFT implementation to the boost library. I noticed that there is a boost::CRC so I thought it would be a good addition to have boost::FFT as well. MIT have an existing open-source FFTW library, but it is GPL-licensed which is much more restrictive than the Boost license. I should imagine a commercial FFTW license would be very expensive. > > I have working FFT code which I have tested on Ubuntu Linux GNU gcc and also Visual Studio Express 2012 (MS VC++) for Windows. My code, when run as a 2048-point FFT, agrees with the MIT FFTW one to a max error margin of 6 parts per million. > > I would really like to see an FFT implementation in boost. It should of > course focus on performance. I also think that interoperability with > different vector and storage types would be really great. It prevents > that the user has to convert its data types in different formats (which > can be really painful if you use different libraries, for example > odeint, ublas, fftw, ...). > > > > > > ------------------------------ > > Message: 4 > Date: Wed, 29 May 2013 12:05:24 +0530 > From: Aditya Avinash <adityaavinash143(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: > <CABocMVpBesKaSTznHmKACxNpPUwYtTs50vUaWeZo5qUUaK9K+Q(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > Am sorry. My bad. It's boost.simd. Why isn't it included in boost? I have > heard about it recently. Is there a chance that it is added to boost in the > near future? > > On Wed, May 29, 2013 at 11:57 AM, Karsten Ahnert < > karsten.ahnert(a)googlemail.com> wrote: > > > On 05/29/2013 07:33 AM, Aditya Avinash wrote: > > > >> @Gaetano: Thank you for the comments. I'll change accordingly and post it > >> back. I am using T because, the code need to run double precision float > >> also. > >> @Joel: The Boost.SIMD is generalized. Designing algorithms specific to > >> uBLAS increases the performance. Odeint have their own simd backend. > >> > > > > odeint has no simd backend, At least i am not aware of an simd backend. > > Having one would be really great. > > > > > > > >> On Wed, May 29, 2013 at 10:36 AM, Joel Falcou <joel.falcou(a)gmail.com> > >> wrote: > >> > >> On 29/05/2013 06:45, Gaetano Mendola wrote: > >>> > >>> On 29/05/2013 06.13, Aditya Avinash wrote: > >>>> > >>>> Hi, i have developed vector addition algorithm which exploits the > >>>>> hardware > >>>>> parallelism (SSE implementation). > >>>>> > >>>>> > >>>> A few comments: > >>>> > >>>> - That is not C++ but just C in disguise of C++ code > >>>> . SSE1 CTOR doesn't use initialization list > >>>> . SSE1 doesn't have a DTOR and the user has to > >>>> explicit call the Free method > >>>> > >>>> - const-correctness is not in place > >>>> - The SSE namespace should have been put in a "detail" > >>>> namespace > >>>> - Use memcpy instead of explicit for > >>>> - Why is SSE1 template when it works only when T is a > >>>> single-precision, floating-point value ? > >>>> > >>>> > >>>> Also I believe a nice interface whould have been: > >>>> > >>>> SSE1::vector A(1024); > >>>> SSE1::vector B(1024); > >>>> SSE1::vector C(1024); > >>>> > >>>> C = A + B; > >>>> > >>>> > >>>> Regards > >>>> Gaetano Mendola > >>>> > >>>> > >>>> See our work on Boost.SIMD ... > >>> > >>> > >>> > >>> ______________________________****_________________ > >>> Unsubscribe & other changes: http://lists.boost.org/** > >>> mailman/listinfo.cgi/boost<htt**p://lists.boost.org/mailman/** > >>> listinfo.cgi/boost <http://lists.boost.org/mailman/listinfo.cgi/boost>> > >>> > >>> > >> > >> > >> > > > > ______________________________**_________________ > > Unsubscribe & other changes: http://lists.boost.org/** > > mailman/listinfo.cgi/boost<http://lists.boost.org/mailman/listinfo.cgi/boost> > > > > > > -- > ---------------- > Atluri Aditya Avinash, > India. > > > ------------------------------ > > Message: 5 > Date: Wed, 29 May 2013 12:19:39 +0530 > From: Aditya Avinash <adityaavinash143(a)gmail.com> > To: boost(a)lists.boost.org > Subject: [boost] Boost on ARM using NEON > Message-ID: > <CABocMVpQqBGqduE6jj-KG=O5faV08GcoV=TOS_bXFLYWTkzKjA(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > Hi, i want to develop boost.arm or boost.neon library so that boost is > implemented on ARM. > > -- > ---------------- > Atluri Aditya Avinash, > India. > > > ------------------------------ > > Message: 6 > Date: Wed, 29 May 2013 11:45:12 +0400 > From: Antony Polukhin <antoshkka(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: > <CAKqmYPbt+wq92BvLLn-5GUhFfmvWiWsAoqfpXK6XOmnRK7EtwQ(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > 2013/5/29 Aditya Avinash <adityaavinash143(a)gmail.com>: > > Hi, i want to develop boost.arm or boost.neon library so that boost is > > implemented on ARM. > > Hi, > > Boost works well on arm, so nothing should be really developed. > But if you ate talking about SIMD for ARM, that you shall take a look > at Boost.SIMD and maybe propose library developer your help. > > > -- > Best regards, > Antony Polukhin > > > ------------------------------ > > Message: 7 > Date: Wed, 29 May 2013 13:20:15 +0530 > From: Aditya Avinash <adityaavinash143(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: > <CABocMVo_DbCaxRPDOK4_1KMw8m7O54gXKgOqX+cmYRcBndNYDA(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > Thank you! > Can i develop a new kernel for uBLAS using NEON? > > On Wed, May 29, 2013 at 1:15 PM, Antony Polukhin <antoshkka(a)gmail.com>wrote: > > > 2013/5/29 Aditya Avinash <adityaavinash143(a)gmail.com>: > > > Hi, i want to develop boost.arm or boost.neon library so that boost is > > > implemented on ARM. > > > > Hi, > > > > Boost works well on arm, so nothing should be really developed. > > But if you ate talking about SIMD for ARM, that you shall take a look > > at Boost.SIMD and maybe propose library developer your help. > > > > > > -- > > Best regards, > > Antony Polukhin > > > > _______________________________________________ > > Unsubscribe & other changes: > > http://lists.boost.org/mailman/listinfo.cgi/boost > > > > > > -- > ---------------- > Atluri Aditya Avinash, > India. > > > ------------------------------ > > Message: 8 > Date: Wed, 29 May 2013 09:52:57 +0200 > From: Tim Blechmann <tim(a)klingt.org> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: <51A5B3D9.2010807(a)klingt.org> > Content-Type: text/plain; charset=ISO-8859-1 > > >> Hi, i want to develop boost.arm or boost.neon library so that boost is > >> implemented on ARM. > > > > Hi, > > > > Boost works well on arm, so nothing should be really developed. > > But if you ate talking about SIMD for ARM, that you shall take a look > > at Boost.SIMD and maybe propose library developer your help. > > from https://github.com/MetaScale/nt2/issues/180: "It is quite unsure at > this stage whether NEON will be provided as an open-source module" > > tim > > > > ------------------------------ > > Message: 9 > Date: Wed, 29 May 2013 08:55:41 +0100 > From: "Paul A. Bristow" <pbristow(a)hetp.u-net.com> > To: <boost(a)lists.boost.org> > Subject: Re: [boost] Request to contribute boost::FFT > Message-ID: <001f01ce5c41$ea88da30$bf9a8e90$(a)hetp.u-net.com> > Content-Type: text/plain; charset="us-ascii" > > > -----Original Message----- > > From: Boost [mailto:boost-bounces@lists.boost.org] On Behalf Of Nathan Bliss > > Sent: Tuesday, May 28, 2013 11:12 PM > > To: boost(a)lists.boost.org > > Subject: [boost] Request to contribute boost::FFT > > > > I am writing to ask if I could contribute a C++ FFT implementation to the boost library. > > Definitely, a good templated C++ FFT would be very welcome. > > Would/does it work with Boost.Multiprecision to give much higher precision ? (at a snail's pace of > course). > > Paul > > --- > Paul A. Bristow, > Prizet Farmhouse, Kendal LA8 8AB UK > +44 1539 561830 07714330204 > pbristow(a)hetp.u-net.com > > > > > > > > > > > > > ------------------------------ > > Message: 10 > Date: Wed, 29 May 2013 09:15:36 +0200 > From: Victor Hiairrassary <victor.hiairrassary.ml(a)gmail.com> > To: "boost(a)lists.boost.org" <boost(a)lists.boost.org> > Cc: "boost(a)lists.boost.org" <boost(a)lists.boost.org> > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: <22F316D0-E311-4BE3-94FB-11DE688C9CAB(a)gmail.com> > Content-Type: text/plain; charset=us-ascii > > boost already works very well on ARM ! > > If you want to use Neon extension, look at boost simd (I do not know if Neon is implemented yet, feel free to do it) ! > > https://github.com/MetaScale/nt2 > > On 29 mai 2013, at 08:49, Aditya Avinash <adityaavinash143(a)gmail.com> wrote: > > > Hi, i want to develop boost.arm or boost.neon library so that boost is > > implemented on ARM. > > > > -- > > ---------------- > > Atluri Aditya Avinash, > > India. > > > > _______________________________________________ > > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > > > ------------------------------ > > Message: 11 > Date: Wed, 29 May 2013 12:11:31 +0400 > From: Andrey Semashev <andrey.semashev(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: > <CAEhD+6BfavRaGgok9eMbDebCP1Hdg2T3Z3be7BWZTAZ1EDpfzg(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > On Wed, May 29, 2013 at 11:52 AM, Tim Blechmann <tim(a)klingt.org> wrote: > > > >> Hi, i want to develop boost.arm or boost.neon library so that boost is > > >> implemented on ARM. > > > > > > Hi, > > > > > > Boost works well on arm, so nothing should be really developed. > > > But if you ate talking about SIMD for ARM, that you shall take a look > > > at Boost.SIMD and maybe propose library developer your help. > > > > from https://github.com/MetaScale/nt2/issues/180: "It is quite unsure at > > this stage whether NEON will be provided as an open-source module" > > > > Even if it's not openly provided by developers of NT2, nothing prevents you > from implementing it yourself. > > > ------------------------------ > > Message: 12 > Date: Wed, 29 May 2013 10:37:48 +0200 > From: Tim Blechmann <tim(a)klingt.org> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: <51A5BE5C.6000705(a)klingt.org> > Content-Type: text/plain; charset=ISO-8859-1 > > >>>> Hi, i want to develop boost.arm or boost.neon library so that boost is > >>>> implemented on ARM. > >>> > >>> Hi, > >>> > >>> Boost works well on arm, so nothing should be really developed. > >>> But if you ate talking about SIMD for ARM, that you shall take a look > >>> at Boost.SIMD and maybe propose library developer your help. > >> > >> from https://github.com/MetaScale/nt2/issues/180: "It is quite unsure at > >> this stage whether NEON will be provided as an open-source module" > > > > Even if it's not openly provided by developers of NT2, nothing prevents you > > from implementing it yourself. > > yes and no ... if the nt2 devs submit boost.simd to become an official > part of boost, it is the question if they'd merge an independently > developed arm/neon support, if it conflicts with their business > interests ... the situation is a bit unfortunate ... > > tim > > > ------------------------------ > > Message: 13 > Date: Wed, 29 May 2013 12:52:29 +0400 > From: Andrey Semashev <andrey.semashev(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: > <CAEhD+6D8h43AyTvg65ntZZm804R9p0fiOtARPp2G8cOJC64zog(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > On Wed, May 29, 2013 at 12:37 PM, Tim Blechmann <tim(a)klingt.org> wrote: > > > >>>> Hi, i want to develop boost.arm or boost.neon library so that boost is > > >>>> implemented on ARM. > > >>> > > >>> Hi, > > >>> > > >>> Boost works well on arm, so nothing should be really developed. > > >>> But if you ate talking about SIMD for ARM, that you shall take a look > > >>> at Boost.SIMD and maybe propose library developer your help. > > >> > > >> from https://github.com/MetaScale/nt2/issues/180: "It is quite unsure > > at > > >> this stage whether NEON will be provided as an open-source module" > > > > > > Even if it's not openly provided by developers of NT2, nothing prevents > > you > > > from implementing it yourself. > > > > yes and no ... if the nt2 devs submit boost.simd to become an official > > part of boost, it is the question if they'd merge an independently > > developed arm/neon support, if it conflicts with their business > > interests ... the situation is a bit unfortunate ... > > > > I realize that it may be inconvenient for them to expose their > implementation of NEON module (if there is one) for various reasons. But as > long as Boost.SIMD is licensed under BSL, anyone can use and improve this > code if he likes to, even if it means implementing functionality similar to > the proprietary solution. > > It doesn't necessarily mean that the open solution will take the market > share of the proprietary one. > > > ------------------------------ > > Message: 14 > Date: Wed, 29 May 2013 09:59:04 +0100 > From: David Bellot <david.bellot(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost on ARM using NEON > Message-ID: > <CAOE6ZJEVebMZF90SHC_yHNxmBWy=uC3K1OFokcPrF2RM7=uYrQ(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > again, as I said, you develop and propose a patch to the ublas > mailing-list. We're happy to see contributions from anybody. > > Now I must say that we are interested in Neon instructions for ublas. > It has been on the todo list for quite a long time too: > http://ublas.sf.net > > What I want to say is, apart from the 2 GSOC students and myself > (general maintenance, official releases), nobody has a specific task > assigned to. > > So if you want to contribute, you just work on it and talk about it on > the mailing list so that people can be involved and help you. > > If little by little you contribute with amazing ARM Neon code, then > people will naturally take for granted that you are the ARM Neon > specialist for ublas. As simple as that. > > If someone comes with a better code than you then we will choose the > other code. If you come with a better code than someone else, then we > will choose your code. > > So please, contribute. > > > Are you testing your code on a specific machine or a virtual one ? > What's about things like Raspberry Pi ? I'd like to see benchmark on > this little things. Maybe you can start benchmarking ublas on a tiny > machine like that and/or an Android device and see how gcc is able to > generate auto-vectorized code for this machine. Check the assembly > code to see if Neon instructions have been correctly generated. > > Best, > David > > > > On Wed, May 29, 2013 at 8:50 AM, Aditya Avinash > <adityaavinash143(a)gmail.com> wrote: > > Thank you! > > Can i develop a new kernel for uBLAS using NEON? > > > > On Wed, May 29, 2013 at 1:15 PM, Antony Polukhin <antoshkka(a)gmail.com>wrote: > > > >> 2013/5/29 Aditya Avinash <adityaavinash143(a)gmail.com>: > >> > Hi, i want to develop boost.arm or boost.neon library so that boost is > >> > implemented on ARM. > >> > >> Hi, > >> > >> Boost works well on arm, so nothing should be really developed. > >> But if you ate talking about SIMD for ARM, that you shall take a look > >> at Boost.SIMD and maybe propose library developer your help. > >> > >> > >> -- > >> Best regards, > >> Antony Polukhin > >> > >> _______________________________________________ > >> Unsubscribe & other changes: > >> http://lists.boost.org/mailman/listinfo.cgi/boost > >> > > > > > > > > -- > > ---------------- > > Atluri Aditya Avinash, > > India. > > > > _______________________________________________ > > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > > > ------------------------------ > > Message: 15 > Date: Wed, 29 May 2013 05:27:02 -0400 > From: Rob Stewart <robertstewart(a)comcast.net> > To: "boost(a)lists.boost.org" <boost(a)lists.boost.org> > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: <8ED4CF8D-139A-4232-9C18-968AD38161E7(a)comcast.net> > Content-Type: text/plain; charset=us-ascii > > On May 29, 2013, at 2:35 AM, Aditya Avinash <adityaavinash143(a)gmail.com> wrote: > > > Am sorry. My bad. It's boost.simd. Why isn't it included in boost? I have heard about it recently. Is there a chance that it is added to boost in the near future? > > > > On Wed, May 29, 2013 at 11:57 AM, Karsten Ahnert < > > karsten.ahnert(a)googlemail.com> wrote: > > > >> On 05/29/2013 07:33 AM, Aditya Avinash wrote: > > [snip lots of quoted text] > > >>> On Wed, May 29, 2013 at 10:36 AM, Joel Falcou <joel.falcou(a)gmail.com> > >>> wrote: > >>> > >>> On 29/05/2013 06:45, Gaetano Mendola wrote: > >>>> > >>>> On 29/05/2013 06.13, Aditya Avinash wrote: > > [snip even more quoted text] > > >>>>> Regards > >>>>> Gaetano Mendola > >>>>> > >>>>> > >>>>> See our work on Boost.SIMD ... > > [snip multiple sigs and ML footers] > > > Please read http://www.boost.org/community/policy.html#quoting before posting. > > ___ > Rob > > (Sent from my portable computation engine) > > ------------------------------ > > Message: 16 > Date: Wed, 29 May 2013 11:34:14 +0200 > From: Mathias Gaunard <mathias.gaunard(a)ens-lyon.org> > To: boost(a)lists.boost.org > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: <51A5CB96.3040404(a)ens-lyon.org> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > On 29/05/13 06:13, Aditya Avinash wrote: > > Hi, i have developed vector addition algorithm which exploits the hardware > > parallelism (SSE implementation). > > That's something trivial to do, and unfortunately even that trivial code > is broken (it's written for a generic T but clearly does not work for > any T beside float). > It still has nothing to do with uBLAS. > > Bringing SIMD to uBLAS could be fairly difficult. Is this part of the > GSoC projects? Who's in charge of this? > I'd like to know what the plan is: optimize very specific operations > with SIMD or try to provide a framework to use SIMD in expression templates? > > The former is better adressed by simply binding BLAS, the latter is > certainly not as easy as it sounds. > > > ------------------------------ > > Message: 17 > Date: Wed, 29 May 2013 15:04:51 +0530 > From: Aditya Avinash <adityaavinash143(a)gmail.com> > To: boost(a)lists.boost.org > Subject: Re: [boost] SIMD implementation of uBLAS > Message-ID: > <CABocMVr1k13N6iBK7VOR4-G8ZPavf6eZL5qd=8cEFLGxDJ_waw(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > Am sorry. My bad. It's boost.simd. Why isn't it included in boost? I have > heard about it recently. Is there a chance that it is added to boost in the > near future? > > > ------------------------------ > > Message: 18 > Date: Wed, 29 May 2013 11:38:45 +0200 > From: Mathias Gaunard <mathias.gaunard(a)ens-lyon.org> > To: boost(a)lists.boost.org > Subject: Re: [boost] Request to contribute boost::FFT > Message-ID: <51A5CCA5.80605(a)ens-lyon.org> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > On 29/05/13 00:12, Nathan Bliss wrote: > > Dear Boost Community Members, > > I am writing to ask if I could contribute a C++ FFT implementation to the boost library. I noticed that there is a boost::CRC so I thought it would be a good addition to have boost::FFT as well. MIT have an existing open-source FFTW library, but it is GPL-licensed which is much more restrictive than the Boost license. I should imagine a commercial FFTW license would be very expensive. > > I have working FFT code which I have tested on Ubuntu Linux GNU gcc and also Visual Studio Express 2012 (MS VC++) for Windows. My code, when run as a 2048-point FFT, agrees with the MIT FFTW one to a max error margin of 6 parts per million. > > It is implemented using templates in a .hpp file and is very easy to use: > > ------------------------------------------------------------------------------------------------------------[fft.hpp] > > template<class FLOAT_TYPE, int FFT_SIZE, int NUM_THREADS>class FFT;///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////[Invocation example] > > typedef double My_type;FFT<My_type, 2048, 4> user_fft;user_fft.initialise_FFT();get_input_samples(*user_fft.input_value_array, user_fft.m_fft_size);user_fft.execute_FFT();print_output_csv(user_fft.output_value_array, 2048);------------------------------------------------------------------------------------------------------------ > > It's uniqueness compared to other FFT implementations is that it fully utilises the boost::thread library, to the extent that the user can give the number of threads they want to use as a parameter to the class template (above case is for 4 parallel threads). > > It is structured and organised so that users could customise/optimise it to specific processor architectures. > > I've also tried to develop it in the spirit of Boost in that all class members which users should not access are private, only making public what is necessary to the API. My code is a decimation-in-time radix-2 FFT, and users could in theory use the existing API as a basis to extend it to more complex implementations such as the Reverse/Inverse FFT, bit-reversal of inputs/outputs and multi-dimensional FFTs. > > I look forward to your reply. > > Kind regards,Nathan Bliss > > You may want to give a look to the FFT functions bundled with NT2 > courtesy of Domagoj Saric. > > They also generate a FFT for a given compile-time size and use > Boost.SIMD for vectorization (but no threads). Unfortunately the code is > not so generic that it can work with arbitrary vector sizes, so it > limits portability somewhat. > > <https://github.com/MetaScale/nt2/blob/master/modules/core/signal/include/nt…> > > > ------------------------------ > > Subject: Digest Footer > > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > > ------------------------------ > > End of Boost Digest, Vol 4012, Issue 1 > **************************************

1 0

Boost on ARM using NEON
by Aditya Avinash 29 May '13

29 May '13

Hi, i want to develop boost.arm or boost.neon library so that boost is implemented on ARM. -- ---------------- Atluri Aditya Avinash, India.

7 11

[thread] ~mutex and BOOST_VERIFY
by Gaetano Mendola 28 May '13

28 May '13

Hi, I saw that the destructor of ~mutex doesn't have a BOOST_VERIFY anymore on the return value of pthread_mutex_destroy. From SVN logs I can see it was removed in the commit 75882 to manage the EINTR due to some bugged POSIX implementation. I will reintroduce the BOOST_VERIFY like this: ~mutex() { int ret; do { ret = pthread_mutex_destroy(&m); } while (ret == EINTR); BOOST_VERIFY(!ret); } while we are at it consider the fact that for the same reason ~mutex needs to check for that EINTR return value the same should do timed_mutex. Regards Gaetano Mendola

4 11

JSON Parser + Boost Fusion + adapted structs
by Stephan Bourgeois 28 May '13

28 May '13

Hi everybody, I am writing a prototype for the JSON parser for the GSoC with the support of Bjorn Reese. When discussing the proposal, Michael Marcin suggested an interface that allows the user to define a struct reflecting the JSON data structure. I have been looking at Boost.Fusion to enable the parser to "fill in" the values in the struct. It looks like I'm after a solution described in the following post: http://stackoverflow.com/questions/13830792/simulate-compile-time-reflectio… Could anyone tell me if this is a good starting point, and/or if there are other ways of achieving this. Thank you, Stephan.

5 4

[context] make_fcontext stack pointer unclear from documentation
by Michael Marcin 28 May '13

28 May '13

The function make_fcontext takes a stack pointer. However it is not clear at all from the documentation that the stack pointer should actually point to the end of the stack buffer. AFAICT it takes close examination of the simple_stack_allocator helper in the examples folder to figure this out. This led to several hours of debugging when I naively passed in the pointer to the start of the stack buffer and random application memory got stomped. I guess you're supposed to glean it from the note at the bottom of the stack allocation page [1]. This should at least be mentioned in the make_fcontext reference [2]. [1] http://www.boost.org/doc/libs/1_53_0/libs/context/doc/html/context/stack.ht… [2] http://www.boost.org/doc/libs/1_53_0/libs/context/doc/html/context/context/…

3 6

Re: [boost] JSON Parser + Boost Fusion + adapted structs
by Niall Douglas 28 May '13

28 May '13

> Then, there's boost.mirror that hasn't given much news recently, but that > had one thing right: you need something to generate the metadata to avoid > the pitfalls of writing the macro by hand. I had in mind a tool based on > clang to do that but never had time to care about it since my very naive > perl code was enough for my small needs. Easiest of all is to expose the compiler's internal state via a magic namespace in the form of pseudo-template definitions. Then one has, at metaprogramming stage, access to everything the compiler knows at that point. I posited that idea to Chandler Carruth for clang at C++ Now. He didn't seem adamantly opposed. Third party libraries (e.g. a Boost one) could wrap up each compiler's internal magic namespace into something portable and therefore useful. Niall

1 0

[MSM] Compile-time error using SubMachines and events that carries some data
by Fernando Pelliccioni 28 May '13

28 May '13

Hi, I have a Main State Machine (state_machine_) and two SubMachines. I want to start the first SubMachine and when it finished I want to start the second SubMachine. Here is the code. http://pastebin.com/sBdS1wvJ I have a compile-time error on some States of the second SubMachine. error: no member named 'element' in 'exit_introduction' std::cout << "event.element(): " << event.element() << std::endl; ~~~~~ ^ This is on state "StaringGame" and according the Transition Table of GameSM, only the event "character_selected" is used. I don't know why is trying to use the event "exit_introduction". Is this a bug of MSM? Am I doing something wrong? Thanks and regards, Fernando Pelliccioni.

3 4

GSoC: Seven proposals accepted
by Boris Schaeling 28 May '13

28 May '13

Google just announced the seven proposals which were accepted for Boost. The (entire) list can be found here: <http://www.google-melange.com/gsoc/projects/list/google/gsoc2013> Congratulations to the successful students! Good luck and much fun in this summer's Boost C++ projects! :) For those students who were not selected: Feel free to contact me for the details! We actually asked Google for more than seven slots because we got more than seven amazing proposals. Unfortunately the number of slots is just limited. And so we had to make some tough decisions. :/ I also thank everyone who had volunteered to mentor a project! I know that not everyone could get the project they wanted. But maybe there is still enough motivation to move forward with some projects outside of the Google Summer of Code program. :) Boris

12 15

Algorithmic Skeletons, Parallelism Patterns & Actors
by Suminda Dharmasena 28 May '13

28 May '13

Hi, Is it possible to introduce Algorithmic Skeletons, Parallelism Patterns & Actors in Boost? Any plans for this? Suminda -- Suminda Sirinath Salpitikorala Dharmasena, B.Sc. Comp. & I.S. (Hon.) Lond., P.G.Dip. Ind. Maths. J'Pura, MIEEE, MACM, CEO Sakrīō! ▣ *Address*: 6G • 1st Lane • Pagoda Road • Nugegoda 10250 • Sri Lanka. ▣ *Mobile* : +94-(0)711007945 ▣ *Tele*: +94-(0)11-5 864614 / 5 875614 / 2 825908 ▣ *Web *: http://www.sakrio.com ▣ This email is subjected to the email Terms of Use and Disclaimer: http://www.sakrio.com/email-legal. Please read this first. --

6 5

[type_erasure] compile error with gcc 4.8
by Christophe Henry 27 May '13

27 May '13

Hi Steven, the following code used to compile with older gcc versions (I just tried with 4.5 and I used the same construct with 4.7) but no more with gcc 4.8, but I don't know whether it's a gcc or type_erasure problem (or mine). The problem seems to be with rvalue refs. If I use the commented out version, it compiles fine on both compilers. Any idea? If you have no gcc 4.8, I can attach the error. Thanks, Christophe #include <iostream> #include <boost/type_erasure/any.hpp> #include <boost/type_erasure/builtin.hpp> #include <boost/type_erasure/operators.hpp> #include <boost/type_erasure/constructible.hpp> #include <boost/type_erasure/relaxed.hpp> #include <boost/type_erasure/member.hpp> #include <boost/mpl/vector.hpp> #include <boost/function.hpp> BOOST_TYPE_ERASURE_MEMBER((has_post), post); struct any_post_concept: ::boost::mpl::vector< //has_post<void(boost::function<void()>), const boost::type_erasure::_self>, has_post<void(boost::function<void()>&&), const boost::type_erasure::_self>, boost::type_erasure::relaxed, boost::type_erasure::copy_constructible<> >{} ; typedef boost::type_erasure::any<any_post_concept> any_post; struct any_impl { //void post(boost::function<void()> f)const {f();} void post(boost::function<void()> && f)const {f();} }; int main() { any_impl s; any_post p (s); boost::function<void()> f = [](){std::cout << "ok" << std::endl;}; //p.post(f); p.post(std::move(f)); return 0; }

2 3

[thread] countdown_latch
by Michael Marcin 27 May '13

27 May '13

I recently ran across the need to spawn a thread and wait for it to finish its setup before continuing. The accepted answer seems to be using a mutex and condition variable to achieve this. However that work clutters up the code quite a bit with the implementation details. I came across Java's CountDownLatch which does basically the same work but bundles it up into a tidy package. It seems to be a fairly trivial but useful abstraction. implementation: http://codepad.org/E8kd2Eb8 usage: class widget { public: widget() : latch( 1 ) , thread_( [&]{ thread_func(); } ) { latch.wait(); } private: void setup(); void run(); void thread_func() { setup(); latch.count_down(); run(); } countdown_latch latch; std::thread thread_; };

4 58

Proposal for a new assert macro which stores the failed values ("informative assert")
by Viktor Sehr 27 May '13

27 May '13

I'd like some opinions about this assert implementation which I'd like to propose as an update of the old BOOST_ASSERT. Basically it stores the failed values next to the expression string, instead of just the expression string: "INFORMATIVE_ASSERT(5*5 < 2*2);" "5*5 < 2*2 | 25 | 4" "INFORMATIVE_ASSERT(std::vector<int>(10).size() == std::vector<int>(12).size());" "std::vector<int>(10).size() > std::vector<int>(12).size() | 10 | 12" Notes - If the class can't be serialized, the byte-data is logged instead. - It writes the values to the expression string in order to be compliant with any assert implementations Easy to read implementation available here: https://docs.google.com/file/d/0B69BCPzak52DcnF5dmhRRno3V2M/edit?usp=sharing Modified version of BOOST_ASSERT available here: https://docs.google.com/file/d/0B69BCPzak52DZW1oX1AtREM4eVU/edit?usp=sharing /Viktor Sehr

1 0

Documenting and checking template parameters
by Paul A. Bristow 26 May '13

26 May '13

I am just refactoring the venerable circular_buffer documentation. The docs describe the Template parameter T and specify it thus: The type of the elements stored in the circular_buffer. The T has to be SGIAssignable (SGI STL defined combination of Assignable and CopyConstructible). Moreover T has to be DefaultConstructible if supplied as a default parameter when invoking some of the circular_buffer's methods e.g. insert(iterator pos, const value_type& item = value_type()). And EqualityComparable and/or LessThanComparable if the circular_buffer will be compared with another container. This looks a bit out of date? Questions: How should a parameter like this *best* be described in documentation and enforced in software? http://www.boost.org/doc/libs/1_53_0/doc/html/Assignable.html ? http://www.boost.org/doc/libs/1_53_0/libs/concept_check/concept_check.htm ? Should these concepts be checked using BOOST_STATIC_ASSERT? Should *All* these be checked, even though not required for all uses? Suggestions welcome. Thanks Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

3 2

[githelp] Can't clone superproject..
by Rene Rivera 26 May '13

26 May '13

Not sure if it's just because I'm using Eclipse JGit for this but I get: === Git repository clone failed. Missing unknown 57ec5d1534810090649b18c88e66a46f48cdcf1c === When I attempt to import/clone the superproject plus submodules. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

2 1

[githelp] forwarding headers?
by legalize+jeeves＠mail.xmission.com 26 May '13

26 May '13

[Please do not mail me a copy of your followup] OK, I can recursively cloen the git repo and with a little editing of bootstrap.sh to remove the presence of '/v2', I am able to finish the bootstrap script. However, actually building libraries fails because there is no 'boost' subdirectory and presumably no forwarding headers in that directory. So how are those built? -- "The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline> The Computer Graphics Museum <http://computergraphicsmuseum.org> The Terminals Wiki <http://terminals.classiccmp.org> Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>

2 2

[regex][config] BOOST_FALLTHROUGH not on the release branch
by Daniel James 26 May '13

26 May '13

The implementation of the new BOOST_FALLTHROUGH macro hasn't been merged to release yet, but the regex merge from yesterday included some code which uses it, so that isn't compiling now. The test results are a bit behind, so it hasn't shown up there yet.

2 2

Boost.Thread Co-authoring
by Vicente J. Botet Escriba 26 May '13

26 May '13

Hi, I'm the main maintainer of Boost.Thread since Nov 2011. I've fixed a lot of bugs and added a lot of new features (mainly conformance with C++11, but also others). Could my name appear as co-author of Boost.Thread in http://www.boost.org/doc/libs/1_53_0/? Best, Vicente

4 3

[trac] New component for type_erasure.
by Daniel James 25 May '13

25 May '13

Please can someone create a component for 'type_erasure', user 'steven_watanabe'? Thanks.

2 1

[bind][function][lamda][signals][variant][boostbook] PDF doc builds broken?
by John Maddock 25 May '13

25 May '13

The libs bind, lambda, signals, variant and boostbook all have: project boost/doc ; In their Jamfiles, and Boost.Build is now treating that duplication as an error. Is there any reason these project ID's can't be just commented out / removed? Thanks, John.

3 3

[multi-array] warning on mingw caused by assert macro
by Ronan Trépos 24 May '13

24 May '13

Hello boost comunity, I found a warning using boost/multi-array (boost 1.53) on mingw. The warning message : boost/multi_array/base.hpp:503:13: attention : unused variable 'bound_adjustment' When compiling a simple example including muti-array with the command line : c:\MinGW\bin\g++.exe -Wall -Wextra -O2 -DNDEBUG -g -Ic:/natifvle/install/boost/include/boost-1_53 -o MyExample.o -c MyExample.cpp The reason is that a locale variable bound_adjustement, before line 503 of multi_array/base.hpp, is defined and computed only if BOOST_DISABLE_ASSERT is not set. The line after, a BOOST_ASSERT is called using bound_adjustement. Since BOOST_DISABLE_ASSERT is not set, BOOST_ASSERT is defined as the mingw macro "assert" in boost/assert.hpp. Finally, mingw assert macro (see Mingw/include/assert.h) is defined as ((void) 0) if NDEBUG is defined (this is the case in my example). It took me a long time to see the problem. So my questions are : - Do I miss use the combination of NDEBUG and BOOST_DISABLE_ASSERTS ? Eg. if NDEBUG and BOOST_DISABLE_ASSERTS are set (or unset) together, then I have no warning. Should they be set to the same value ? - Or should boost/assert.hpp take into account NDEBUG for defining the macro BOOST_ASSERT (only for mingw ?) Best regards Ronan Trépos -- Trépos Ronan INRA unité MIAT, équipe RECORD, Toulouse http://carlit.toulouse.inra.fr/wikiz/index.php/Ronan_TREPOS tel : 05 61 28 51 89

1 0

[ASIO] Issue with epoll reactor? Callback handler not executed.
by Arpan Sen 24 May '13

24 May '13

Hi folks, I am using the latest version of Boost ASIO on a Suse11 box. I recently upgraded from an older version of Boost, and life since then has been unusually harsh. **** I have a piece of ASIO code that worked just fine earlier but doesn't do so now. Here's the offending snippet, rather simple looking: **** boost::asio::streambuf response; ... // code for deadline timer tcp::socket socket(io_service); socket.async_connect(*iterator, &conn_handler); io_service.reset(); io_service.run_one(); async_write(socket, buffer(command.c_str()), &write_handler); io_service.reset(); io_service.run_one(); async_read_until(socket, response, '\n', &read_handler); io_service.reset(); io_service.run_one(); Everything works fine till async_write. During async_read_until I can see that the response buffer does have some data by the time it returns. However, when io_service.run_one() happens the read_handler is NOT ALWAYS called which is very surprising. The function calling the read_handler (internal to ASIO) also does a commit to the streambuf so streambuf.size() becomes non-zero, i.e. ready for consumption by something like istream. All of that is missing now. Debugging this in some detail, I see that run_one is in fact responsible for calling read_handler. That is NOT happening and in epoll_reactor I am not seeing any real activity. Something there is activity and the behavior is as expected but 9/10 times completion handler won’t be called. The io_service object runs in a specific thread (I have a bunch of threads in my app) and no other thread accesses it. The Linux kernel running previous version has not been changed when I upgraded the Boost libraries. Instead of epoll, if I use select everything looks good. Any thoughts? Arpan

2 1

[git][property_tree] Conversion Looks Good, Lots of Redundant Branches
by Sebastian Redl 24 May '13

24 May '13

Reviewed the PropertyTree git history. Apart from the existence of all these redundant branches it looks good. Is there a way to modify the conversion script so that the branch commit itself doesn't show up if there are no follow-ups? Not a big thing, I can easily kill those branches afterwards, but they look so useless. Sebastian

2 1

[githelp] modular boost instructions?
by legalize+jeeves＠mail.xmission.com 24 May '13

24 May '13

[Please do not mail me a copy of your followup] OK, we've already established that the 'Experimenting with Modular Boost' instructions are woefully stale. Can someone please briefly describe what submodules I need to manually add just to get something bootstrapped? In the svn boost there is <root>/build and <root>/tools/build; neither of these is present in boostorg/boost and while there is a build repo, it seems to define a structure that creates <root>/build/build, so I'm confused. -- "The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline> The Computer Graphics Museum <http://computergraphicsmuseum.org> The Terminals Wiki <http://terminals.classiccmp.org> Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>

9 32

[thread] SEVERE bug on packaged_task constructor in C++11 mode.
by Vicente J. Botet Escriba 23 May '13

23 May '13

Hi, There is a severe bug in packaged_task constructor when compiling in C++11 mode and giving a copyable functor as parameter, as reported in https://svn.boost.org/trac/boost/ticket/8596. I believe that this is not a regression, this have never worked. Until I find a fix, the packaged_task could be used only with free functions and with movable functors when compiling in C++11 mode. Fortunately there is no regression on C++98 compilers (at least not identified yet). Sorry for the disagreement, Vicente

3 5

[circular_buffer] Volunteer(s) needed
by Jan Gaspar 23 May '13

23 May '13

Hi all, Is there any volunteer that could take over the circular_buffer library? I do not maintain it any more. There are several bugs which need to be fixed and one challenging feature request (to implement move semantics). Here is the full list: Type: Bugs #4100 some boost classes have sizeof that depends on NDEBUG #5362 circular_buffer does not compile with BOOST_NO_EXCEPTIONS #6277 Checked iterators are not threadsafe #6747 Circular_Buffer / Bounded_Buffer inside Template class problem #7025 circular buffer reports warning: " type qualifiers ignored on function return type" while compile. #7950 Eliminate W4-warnings under VS2005 #8012 Inconsistency in linearize() #8438 vector & circular_buffer storage misbehave when using compiler optimizations Type: Feature Requests #5511 Documentation needs some improvement #7888 circular_buffer should support move semantics Type: Patches #8032 Warning fixes in circular_buffer (Prior doing any changes please read how the circular_buffers' documentation is generated: http://svn.boost.org/svn/boost/trunk/libs/circular_buffer/doc/HOWTO-srcdoc) Thanks and regards, Jan

6 13

[mpl] some msvc-11.0 tests failing on release branch
by Edward Diener 23 May '13

23 May '13

I have noticed 3 tests of mpl for msvc-11.0 failing on the release branch but succeeding on the trunk. So some change must have been made between the trunk and the release branch to cause this failure. These are affecting 'tti' and I imagine other libraries that depends on mpl. The failures are the 'contains', 'equal', and 'lambda' tests. I am not seeing any failures for msvc-8.0, 9.0, or 10.0 and mpl on the release branch. Here are the details ( pretty long ): ---------------------------------------------------------------- file ..\..\..\bin.v2\libs\mpl\test\contains.test\msvc-11.0\debug\contains.obj.rsp "contains.cpp" -Fo"..\..\..\bin.v2\libs\mpl\test\contains.test\msvc-11.0\debug\contains.obj" -TP /Z7 /Od /Ob0 /W3 /GR /MDd /Zc:forScope /Zc:wchar_t /wd4675 /EHs -c -DBOOST_ALL_NO_LIB=1 "-I..\..\.." compile-c-c++ ..\..\..\bin.v2\libs\mpl\test\contains.test\msvc-11.0\debug\contains.obj call "C:\Program Files (x86)\Microsoft Visual Studio 11.0\vc\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"..\..\..\bin.v2\libs\mpl\test\contains.test\msvc-11.0\debug\contains.obj.rsp" contains.cpp C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2664: 'boost::mpl::failed ************boost::mpl::not_<boost::mpl::is_na<T>>::* ***********boost::mpl::assert_not_arg<boost::mpl::is_na<T>>(void (__cdecl *)(Pred),void *)' : cannot convert parameter 2 from 'int' to 'void *' with [ T=void, Pred=boost::mpl::is_na<void> ] Conversion from integral type to pointer type requires reinterpret_cast, C-style cast or function-style cast C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(49) : see reference to class template instantiation 'boost::mpl::arg<1>::apply<U1,U2>' being compiled with [ U1=void, U2=boost::mpl::v_iter<boost::mpl::vector8<int,char,long,short,char,long,double,long>,3> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply.hpp(63) : see reference to class template instantiation 'boost::mpl::apply_wrap2<F,T1,T2>' being compiled with [ F=boost::mpl::protect<boost::mpl::arg<1>>, T1=void, T2=boost::mpl::v_iter<boost::mpl::vector8<int,char,long,short,char,long,double,long>,3> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/iter_fold_if_impl.hpp(33) : see reference to class template instantiation 'boost::mpl::apply2<F,T1,T2>' being compiled with [ F=boost::mpl::arg<1>, T1=void, T2=boost::mpl::v_iter<boost::mpl::vector8<int,char,long,short,char,long,double,long>,3> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/iter_fold_if_impl.hpp(67) : see reference to class template instantiation 'boost::mpl::aux::iter_fold_if_step_impl<__formal>::result_<Iterator,State,StateOp,IteratorOp>' being compiled with [ __formal=true, Iterator=boost::mpl::v_iter<boost::mpl::vector8<int,char,long,short,char,long,double,long>,3>, State=void, StateOp=boost::mpl::arg<1>, IteratorOp=boost::mpl::next<boost::mpl::v_iter<boost::mpl::vector8<int,char,long,short,char,long,double,long>,3>> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/iter_fold_if_impl.hpp(107) : see reference to class template instantiation 'boost::mpl::aux::iter_fold_if_forward_step<Iterator,State,ForwardOp,Predicate>' being compiled with [ Iterator=boost::mpl::v_iter<boost::mpl::vector8<int,char,long,short,char,long,double,long>,3>, State=void, ForwardOp=boost::mpl::arg<1>, Predicate=boost::mpl::protect<boost::mpl::aux::iter_fold_if_pred<boost::mpl::protect<boost::mpl::aux::find_if_pred<boost::mpl::same_as<unsigned int>>>,boost::mpl::v_iter<boost::mpl::vector8<int,char,long,short,char,long,double,long>,8>>> ] C:\Programming\VersionControl\boostrel\boost/mpl/iter_fold_if.hpp(94) : see reference to class template instantiation 'boost::mpl::aux::iter_fold_if_impl<Iterator,State,ForwardOp,ForwardPredicate,BackwardOp,BackwardPredicate>' being compiled with [ Iterator=boost::mpl::v_iter<boost::mpl::vector8<int,char,long,short,char,long,double,long>,0>, State=void, ForwardOp=boost::mpl::arg<1>, ForwardPredicate=boost::mpl::protect<boost::mpl::aux::iter_fold_if_pred<boost::mpl::protect<boost::mpl::aux::find_if_pred<boost::mpl::same_as<unsigned int>>>,boost::mpl::v_iter<boost::mpl::vector8<int,char,long,short,char,long,double,long>,8>>>, BackwardOp=boost::mpl::na, BackwardPredicate=boost::mpl::always<boost::mpl::false_> ] C:\Programming\VersionControl\boostrel\boost/mpl/iter_fold_if.hpp(102) : see reference to class template instantiation 'boost::mpl::iter_fold_if<Sequence,State,ForwardOp,ForwardPredicate>::result_' being compiled with [ Sequence=types, State=void, ForwardOp=boost::mpl::arg<1>, ForwardPredicate=boost::mpl::protect<boost::mpl::aux::find_if_pred<boost::mpl::same_as<unsigned int>>> ] C:\Programming\VersionControl\boostrel\boost/mpl/find_if.hpp(39) : see reference to class template instantiation 'boost::mpl::iter_fold_if<Sequence,State,ForwardOp,ForwardPredicate>' being compiled with [ Sequence=types, State=void, ForwardOp=boost::mpl::arg<1>, ForwardPredicate=boost::mpl::protect<boost::mpl::aux::find_if_pred<boost::mpl::same_as<unsigned int>>> ] C:\Programming\VersionControl\boostrel\boost/mpl/find.hpp(30) : see reference to class template instantiation 'boost::mpl::find_if<Sequence,Predicate>' being compiled with [ Sequence=types, Predicate=boost::mpl::same_as<unsigned int> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/contains_impl.hpp(36) : see reference to class template instantiation 'boost::mpl::find<Sequence,T>' being compiled with [ Sequence=types, T=unsigned int ] C:\Programming\VersionControl\boostrel\boost/mpl/contains.hpp(33) : see reference to class template instantiation 'boost::mpl::contains_impl<Tag>::apply<Sequence,T>' being compiled with [ Tag=boost::mpl::aux::vector_tag<8>, Sequence=types, T=unsigned int ] C:\Programming\VersionControl\boostrel\boost/mpl/assert.hpp(142) : see reference to class template instantiation 'boost::mpl::contains<Sequence,T>' being compiled with [ Sequence=types, T=unsigned int ] contains.cpp(23) : see reference to class template instantiation 'boost::mpl::assert_arg_pred' being compiled with [ P=boost::mpl::contains<types,unsigned int> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2866: 'boost::mpl::arg<1>::apply<U1,U2>::mpl_assertion_in_line_1' : a const static data member of a managed type must be initialized at the point of declaration with [ U1=void, U2=boost::mpl::v_iter<boost::mpl::vector8<int,char,long,short,char,long,double,long>,3> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2866: 'boost::mpl::arg<1>::apply<U1,U2>::mpl_assertion_in_line_1' : a const static data member of a managed type must be initialized at the point of declaration with [ U1=void, U2=boost::mpl::v_iter<boost::mpl::vector8<int,char,long,short,char,long,double,long>,4> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2866: 'boost::mpl::arg<1>::apply<U1,U2>::mpl_assertion_in_line_1' : a const static data member of a managed type must be initialized at the point of declaration with [ U1=void, U2=boost::mpl::v_iter<boost::mpl::vector8<int,char,long,short,char,long,double,long>,5> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2866: 'boost::mpl::arg<1>::apply<U1,U2>::mpl_assertion_in_line_1' : a const static data member of a managed type must be initialized at the point of declaration with [ U1=void, U2=boost::mpl::v_iter<boost::mpl::vector8<int,char,long,short,char,long,double,long>,6> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2866: 'boost::mpl::arg<1>::apply<U1,U2>::mpl_assertion_in_line_1' : a const static data member of a managed type must be initialized at the point of declaration with [ U1=void, U2=boost::mpl::v_iter<boost::mpl::vector8<int,char,long,short,char,long,double,long>,7> ] ...failed compile-c-c++ ..\..\..\bin.v2\libs\mpl\test\contains.test\msvc-11.0\debug\contains.obj... -------------------------------------------------------------------------- file ..\..\..\bin.v2\libs\mpl\test\equal.test\msvc-11.0\debug\equal.obj.rsp "equal.cpp" -Fo"..\..\..\bin.v2\libs\mpl\test\equal.test\msvc-11.0\debug\equal.obj" -TP /Z7 /Od /Ob0 /W3 /GR /MDd /Zc:forScope /Zc:wchar_t /wd4675 /EHs -c -DBOOST_ALL_NO_LIB=1 "-I..\..\.." compile-c-c++ ..\..\..\bin.v2\libs\mpl\test\equal.test\msvc-11.0\debug\equal.obj call "C:\Program Files (x86)\Microsoft Visual Studio 11.0\vc\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"..\..\..\bin.v2\libs\mpl\test\equal.test\msvc-11.0\debug\equal.obj.rsp" equal.cpp C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2664: 'boost::mpl::failed ************boost::mpl::not_<boost::mpl::is_na<T>>::* ***********boost::mpl::assert_not_arg<boost::mpl::is_na<T>>(void (__cdecl *)(Pred),void *)' : cannot convert parameter 2 from 'int' to 'void *' with [ T=float, Pred=boost::mpl::is_na<float> ] Conversion from integral type to pointer type requires reinterpret_cast, C-style cast or function-style cast C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(80) : see reference to class template instantiation 'boost::mpl::arg<1>::apply<U1,U2,U3,U4,U5>' being compiled with [ U1=float, U2=short, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(50) : see reference to class template instantiation 'boost::mpl::apply_wrap5<F,T1,T2,T3,T4,T5>' being compiled with [ F=boost::mpl::arg<1>, T1=float, T2=short, T3=boost::mpl::na, T4=boost::mpl::na, T5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(206) : see reference to class template instantiation 'boost::mpl::aux::resolve_bind_arg<T,U1,U2,U3,U4,U5>' being compiled with [ T=boost::mpl::arg<1>, U1=float, U2=short, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(49) : see reference to class template instantiation 'boost::mpl::bind2<F,T1,T2>::apply<U1,U2>' being compiled with [ F=boost::mpl::quote2<boost::is_same,boost::mpl::void_>, T1=boost::mpl::arg<-1>, T2=boost::mpl::arg<-1>, U1=float, U2=short ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply.hpp(63) : see reference to class template instantiation 'boost::mpl::apply_wrap2<F,T1,T2>' being compiled with [ F=boost::mpl::protect<boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<-1>,boost::mpl::arg<-1>>>, T1=float, T2=short ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/iter_apply.hpp(42) : see reference to class template instantiation 'boost::mpl::apply2<F,T1,T2>' being compiled with [ F=boost::is_same<boost::mpl::_,boost::mpl::_>, T1=float, T2=short ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/and.hpp(25) : see reference to class template instantiation 'boost::mpl::aux::iter_apply2<F,Iterator1,Iterator2>' being compiled with [ F=boost::is_same<boost::mpl::_,boost::mpl::_>, Iterator1=boost::mpl::l_iter<boost::mpl::list1<float>>, Iterator2=boost::mpl::l_iter<boost::mpl::list1<short>> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/and.hpp(29) : see reference to class template instantiation 'boost::mpl::aux::and_impl<C_,T1,T2,T3,T4>' being compiled with [ C_=true, T1=boost::mpl::aux::iter_apply2<boost::is_same<boost::mpl::_,boost::mpl::_>,boost::mpl::l_iter<boost::mpl::list1<float>>,boost::mpl::l_iter<boost::mpl::list1<short>>>, T2=boost::mpl::true_, T3=boost::mpl::true_, T4=boost::mpl::true_ ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/and.hpp(55) : see reference to class template instantiation 'boost::mpl::aux::and_impl<C_,T1,T2,T3,T4>' being compiled with [ C_=true, T1=boost::mpl::not_<boost::is_same<boost::mpl::l_iter<boost::mpl::list1<short>>,boost::mpl::l_iter<boost::mpl::l_end>>>, T2=boost::mpl::aux::iter_apply2<boost::is_same<boost::mpl::_,boost::mpl::_>,boost::mpl::l_iter<boost::mpl::list1<float>>,boost::mpl::l_iter<boost::mpl::list1<short>>>, T3=boost::mpl::true_, T4=boost::mpl::true_ ] C:\Programming\VersionControl\boostrel\boost/mpl/equal.hpp(56) : see reference to class template instantiation 'boost::mpl::and_<T1,T2,T3>' being compiled with [ T1=boost::mpl::not_<boost::is_same<boost::mpl::l_iter<boost::mpl::list1<float>>,boost::mpl::l_iter<boost::mpl::l_end>>>, T2=boost::mpl::not_<boost::is_same<boost::mpl::l_iter<boost::mpl::list1<short>>,boost::mpl::l_iter<boost::mpl::l_end>>>, T3=boost::mpl::aux::iter_apply2<boost::is_same<boost::mpl::_,boost::mpl::_>,boost::mpl::l_iter<boost::mpl::list1<float>>,boost::mpl::l_iter<boost::mpl::list1<short>>> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(49) : see reference to class template instantiation 'boost::mpl::aux::equal_pred<Predicate,LastIterator1,LastIterator2>::apply<Iterator2,Iterator1>' being compiled with [ Predicate=boost::is_same<boost::mpl::_,boost::mpl::_>, LastIterator1=boost::mpl::l_iter<boost::mpl::l_end>, LastIterator2=boost::mpl::l_iter<boost::mpl::l_end>, Iterator2=boost::mpl::l_iter<boost::mpl::list1<short>>, Iterator1=boost::mpl::l_iter<boost::mpl::list1<float>> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply.hpp(63) : see reference to class template instantiation 'boost::mpl::apply_wrap2<F,T1,T2>' being compiled with [ F=boost::mpl::protect<boost::mpl::aux::equal_pred<boost::is_same<boost::mpl::_,boost::mpl::_>,boost::mpl::l_iter<boost::mpl::l_end>,boost::mpl::l_iter<boost::mpl::l_end>>>, T1=boost::mpl::l_iter<boost::mpl::list1<short>>, T2=boost::mpl::l_iter<boost::mpl::list1<float>> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/iter_fold_if_impl.hpp(62) : see reference to class template instantiation 'boost::mpl::apply2<F,T1,T2>' being compiled with [ F=boost::mpl::protect<boost::mpl::aux::equal_pred<boost::is_same<boost::mpl::_,boost::mpl::_>,boost::mpl::l_iter<boost::mpl::l_end>,boost::mpl::l_iter<boost::mpl::l_end>>>, T1=boost::mpl::l_iter<boost::mpl::list1<short>>, T2=boost::mpl::l_iter<boost::mpl::list1<float>> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/iter_fold_if_impl.hpp(107) : see reference to class template instantiation 'boost::mpl::aux::iter_fold_if_forward_step<Iterator,State,ForwardOp,Predicate>' being compiled with [ Iterator=boost::mpl::l_iter<boost::mpl::list1<float>>, State=boost::mpl::l_iter<boost::mpl::list1<short>>, ForwardOp=boost::mpl::next<boost::mpl::na>, Predicate=boost::mpl::protect<boost::mpl::aux::equal_pred<boost::is_same<boost::mpl::_,boost::mpl::_>,boost::mpl::l_iter<boost::mpl::l_end>,boost::mpl::l_iter<boost::mpl::l_end>>> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/iter_fold_if_impl.hpp(122) : see reference to class template instantiation 'boost::mpl::aux::iter_fold_if_impl<Iterator,State,ForwardOp,ForwardPredicate,BackwardOp,BackwardPredicate>' being compiled with [ Iterator=boost::mpl::l_iter<boost::mpl::list4<char,long,double,float>>, State=boost::mpl::l_iter<boost::mpl::list4<char,long,double,short>>, ForwardOp=boost::mpl::next<boost::mpl::na>, ForwardPredicate=boost::mpl::protect<boost::mpl::aux::equal_pred<boost::is_same<boost::mpl::_,boost::mpl::_>,boost::mpl::l_iter<boost::mpl::l_end>,boost::mpl::l_iter<boost::mpl::l_end>>>, BackwardOp=boost::mpl::void_, BackwardPredicate=boost::mpl::always<boost::mpl::false_> ] C:\Programming\VersionControl\boostrel\boost/mpl/equal.hpp(81) : see reference to class template instantiation 'boost::mpl::aux::iter_fold_if_impl<Iterator,State,ForwardOp,ForwardPredicate,BackwardOp,BackwardPredicate>' being compiled with [ Iterator=boost::mpl::l_iter<boost::mpl::list8<int,float,long,double,char,long,double,float>>, State=boost::mpl::l_iter<boost::mpl::list8<int,float,long,double,char,long,double,short>>, ForwardOp=boost::mpl::next<boost::mpl::na>, ForwardPredicate=boost::mpl::protect<boost::mpl::aux::equal_pred<boost::is_same<boost::mpl::_,boost::mpl::_>,boost::mpl::l_iter<boost::mpl::l_end>,boost::mpl::l_iter<boost::mpl::l_end>>>, BackwardOp=boost::mpl::void_, BackwardPredicate=boost::mpl::always<boost::mpl::false_> ] C:\Programming\VersionControl\boostrel\boost/mpl/equal.hpp(102) : see reference to class template instantiation 'boost::mpl::aux::equal_impl<Sequence1,Sequence2,Predicate>' being compiled with [ Sequence1=list2, Sequence2=list3, Predicate=boost::is_same<boost::mpl::_,boost::mpl::_> ] C:\Programming\VersionControl\boostrel\boost/mpl/assert.hpp(142) : see reference to class template instantiation 'boost::mpl::equal<Sequence1,Sequence2>' being compiled with [ Sequence1=list2, Sequence2=list3 ] equal.cpp(28) : see reference to class template instantiation 'boost::mpl::assert_arg_pred' being compiled with [ P=boost::mpl::equal<list2,list3> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2866: 'boost::mpl::arg<1>::apply<U1,U2,U3,U4,U5>::mpl_assertion_in_line_1' : a const static data member of a managed type must be initialized at the point of declaration with [ U1=float, U2=short, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(63) : error C2664: 'boost::mpl::failed ************boost::mpl::not_<boost::mpl::is_na<T>>::* ***********boost::mpl::assert_not_arg<boost::mpl::is_na<T>>(void (__cdecl *)(Pred),void *)' : cannot convert parameter 2 from 'int' to 'void *' with [ T=short, Pred=boost::mpl::is_na<short> ] Conversion from integral type to pointer type requires reinterpret_cast, C-style cast or function-style cast C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(80) : see reference to class template instantiation 'boost::mpl::arg<2>::apply<U1,U2,U3,U4,U5>' being compiled with [ U1=float, U2=short, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(50) : see reference to class template instantiation 'boost::mpl::apply_wrap5<F,T1,T2,T3,T4,T5>' being compiled with [ F=boost::mpl::arg<2>, T1=float, T2=short, T3=boost::mpl::na, T4=boost::mpl::na, T5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(206) : see reference to class template instantiation 'boost::mpl::aux::resolve_bind_arg<T,U1,U2,U3,U4,U5>' being compiled with [ T=boost::mpl::arg<2>, U1=float, U2=short, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(63) : error C2866: 'boost::mpl::arg<2>::apply<U1,U2,U3,U4,U5>::mpl_assertion_in_line_2' : a const static data member of a managed type must be initialized at the point of declaration with [ U1=float, U2=short, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] ...failed compile-c-c++ ..\..\..\bin.v2\libs\mpl\test\equal.test\msvc-11.0\debug\equal.obj... ---------------------------------------------------------------------- file ..\..\..\bin.v2\libs\mpl\test\lambda.test\msvc-11.0\debug\lambda.obj.rsp "lambda.cpp" -Fo"..\..\..\bin.v2\libs\mpl\test\lambda.test\msvc-11.0\debug\lambda.obj" -TP /Z7 /Od /Ob0 /W3 /GR /MDd /Zc:forScope /Zc:wchar_t /wd4675 /EHs -c -DBOOST_ALL_NO_LIB=1 "-I..\..\.." compile-c-c++ ..\..\..\bin.v2\libs\mpl\test\lambda.test\msvc-11.0\debug\lambda.obj call "C:\Program Files (x86)\Microsoft Visual Studio 11.0\vc\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"..\..\..\bin.v2\libs\mpl\test\lambda.test\msvc-11.0\debug\lambda.obj.rsp" lambda.cpp C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2664: 'boost::mpl::failed ************boost::mpl::not_<boost::mpl::is_na<T>>::* ***********boost::mpl::assert_not_arg<boost::mpl::is_na<T>>(void (__cdecl *)(Pred),void *)' : cannot convert parameter 2 from 'int' to 'void *' with [ T=char, Pred=boost::mpl::is_na<char> ] Conversion from integral type to pointer type requires reinterpret_cast, C-style cast or function-style cast C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(80) : see reference to class template instantiation 'boost::mpl::arg<1>::apply<U1,U2,U3,U4,U5>' being compiled with [ U1=char, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(50) : see reference to class template instantiation 'boost::mpl::apply_wrap5<F,T1,T2,T3,T4,T5>' being compiled with [ F=boost::mpl::arg<1>, T1=char, T2=boost::mpl::na, T3=boost::mpl::na, T4=boost::mpl::na, T5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(206) : see reference to class template instantiation 'boost::mpl::aux::resolve_bind_arg<T,U1,U2,U3,U4,U5>' being compiled with [ T=boost::mpl::arg<1>, U1=char, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(80) : see reference to class template instantiation 'boost::mpl::bind2<F,T1,T2>::apply<U1,U2,U3,U4,U5>' being compiled with [ F=boost::mpl::quote2<boost::is_same,boost::mpl::void_>, T1=boost::mpl::arg<1>, T2=char, U1=char, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(223) : see reference to class template instantiation 'boost::mpl::apply_wrap5<F,T1,T2,T3,T4,T5>' being compiled with [ F=boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>, T1=char, T2=boost::mpl::na, T3=boost::mpl::na, T4=boost::mpl::na, T5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(143) : see reference to class template instantiation 'boost::mpl::aux::resolve_bind_arg<T,U1,U2,U3,U4,U5>' being compiled with [ T=boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>, U1=char, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(80) : see reference to class template instantiation 'boost::mpl::bind1<F,T1>::apply<U1,U2,U3,U4,U5>' being compiled with [ F=boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>, T1=boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>, U1=char, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(160) : see reference to class template instantiation 'boost::mpl::apply_wrap5<F,T1,T2,T3,T4,T5>' being compiled with [ F=boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>>, T1=char, T2=boost::mpl::na, T3=boost::mpl::na, T4=boost::mpl::na, T5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(427) : see reference to class template instantiation 'boost::mpl::aux::resolve_bind_arg<T,U1,U2,U3,U4,U5>' being compiled with [ T=boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>>, U1=char, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(80) : see reference to class template instantiation 'boost::mpl::bind5<F,T1,T2,T3,T4,T5>::apply<U1,U2,U3,U4,U5>' being compiled with [ F=boost::mpl::quote5<boost::mpl::and_,boost::mpl::void_>, T1=boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>>, T2=boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::is_float,boost::mpl::void_>,boost::mpl::arg<1>>>, T3=boost::mpl::bool_<true>, T4=boost::mpl::bool_<true>, T5=boost::mpl::bool_<true>, U1=char, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(446) : see reference to class template instantiation 'boost::mpl::apply_wrap5<F,T1,T2,T3,T4,T5>' being compiled with [ F=boost::mpl::bind5<boost::mpl::quote5<boost::mpl::and_,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::is_float,boost::mpl::void_>,boost::mpl::arg<1>>>,boost::mpl::bool_<true>,boost::mpl::bool_<true>,boost::mpl::bool_<true>>, T1=char, T2=boost::mpl::na, T3=boost::mpl::na, T4=boost::mpl::na, T5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(427) : see reference to class template instantiation 'boost::mpl::aux::resolve_bind_arg<T,U1,U2,U3,U4,U5>' being compiled with [ T=boost::mpl::bind5<boost::mpl::quote5<boost::mpl::and_,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::is_float,boost::mpl::void_>,boost::mpl::arg<1>>>,boost::mpl::bool_<true>,boost::mpl::bool_<true>,boost::mpl::bool_<true>>, U1=char, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(39) : see reference to class template instantiation 'boost::mpl::bind5<F,T1,T2,T3,T4,T5>::apply<U1>' being compiled with [ F=boost::mpl::quote5<boost::mpl::or_,boost::mpl::void_>, T1=boost::mpl::bind5<boost::mpl::quote5<boost::mpl::and_,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::is_float,boost::mpl::void_>,boost::mpl::arg<1>>>,boost::mpl::bool_<true>,boost::mpl::bool_<true>,boost::mpl::bool_<true>>, T2=boost::mpl::bind2<boost::mpl::quote2<boost::mpl::greater,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::sizeof_,boost::mpl::void_>,boost::mpl::arg<1>>,boost::mpl::size_t<8>>, T3=boost::mpl::bool_<false>, T4=boost::mpl::bool_<false>, T5=boost::mpl::bool_<false>, U1=char ] C:\Programming\VersionControl\boostrel\boost/mpl/assert.hpp(142) : see reference to class template instantiation 'boost::mpl::apply_wrap1<F,T1>' being compiled with [ F=f, T1=char ] lambda.cpp(46) : see reference to class template instantiation 'boost::mpl::assert_arg_pred' being compiled with [ P=boost::mpl::apply_wrap1<f,char> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2866: 'boost::mpl::arg<1>::apply<U1,U2,U3,U4,U5>::mpl_assertion_in_line_1' : a const static data member of a managed type must be initialized at the point of declaration with [ U1=char, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2664: 'boost::mpl::failed ************boost::mpl::not_<boost::mpl::is_na<T>>::* ***********boost::mpl::assert_not_arg<boost::mpl::is_na<T>>(void (__cdecl *)(Pred),void *)' : cannot convert parameter 2 from 'int' to 'void *' with [ T=double, Pred=boost::mpl::is_na<double> ] Conversion from integral type to pointer type requires reinterpret_cast, C-style cast or function-style cast C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(80) : see reference to class template instantiation 'boost::mpl::arg<1>::apply<U1,U2,U3,U4,U5>' being compiled with [ U1=double, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(50) : see reference to class template instantiation 'boost::mpl::apply_wrap5<F,T1,T2,T3,T4,T5>' being compiled with [ F=boost::mpl::arg<1>, T1=double, T2=boost::mpl::na, T3=boost::mpl::na, T4=boost::mpl::na, T5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(206) : see reference to class template instantiation 'boost::mpl::aux::resolve_bind_arg<T,U1,U2,U3,U4,U5>' being compiled with [ T=boost::mpl::arg<1>, U1=double, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(80) : see reference to class template instantiation 'boost::mpl::bind2<F,T1,T2>::apply<U1,U2,U3,U4,U5>' being compiled with [ F=boost::mpl::quote2<boost::is_same,boost::mpl::void_>, T1=boost::mpl::arg<1>, T2=char, U1=double, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(223) : see reference to class template instantiation 'boost::mpl::apply_wrap5<F,T1,T2,T3,T4,T5>' being compiled with [ F=boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>, T1=double, T2=boost::mpl::na, T3=boost::mpl::na, T4=boost::mpl::na, T5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(143) : see reference to class template instantiation 'boost::mpl::aux::resolve_bind_arg<T,U1,U2,U3,U4,U5>' being compiled with [ T=boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>, U1=double, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(80) : see reference to class template instantiation 'boost::mpl::bind1<F,T1>::apply<U1,U2,U3,U4,U5>' being compiled with [ F=boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>, T1=boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>, U1=double, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(160) : see reference to class template instantiation 'boost::mpl::apply_wrap5<F,T1,T2,T3,T4,T5>' being compiled with [ F=boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>>, T1=double, T2=boost::mpl::na, T3=boost::mpl::na, T4=boost::mpl::na, T5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(427) : see reference to class template instantiation 'boost::mpl::aux::resolve_bind_arg<T,U1,U2,U3,U4,U5>' being compiled with [ T=boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>>, U1=double, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(80) : see reference to class template instantiation 'boost::mpl::bind5<F,T1,T2,T3,T4,T5>::apply<U1,U2,U3,U4,U5>' being compiled with [ F=boost::mpl::quote5<boost::mpl::and_,boost::mpl::void_>, T1=boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>>, T2=boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::is_float,boost::mpl::void_>,boost::mpl::arg<1>>>, T3=boost::mpl::bool_<true>, T4=boost::mpl::bool_<true>, T5=boost::mpl::bool_<true>, U1=double, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(446) : see reference to class template instantiation 'boost::mpl::apply_wrap5<F,T1,T2,T3,T4,T5>' being compiled with [ F=boost::mpl::bind5<boost::mpl::quote5<boost::mpl::and_,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::is_float,boost::mpl::void_>,boost::mpl::arg<1>>>,boost::mpl::bool_<true>,boost::mpl::bool_<true>,boost::mpl::bool_<true>>, T1=double, T2=boost::mpl::na, T3=boost::mpl::na, T4=boost::mpl::na, T5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(427) : see reference to class template instantiation 'boost::mpl::aux::resolve_bind_arg<T,U1,U2,U3,U4,U5>' being compiled with [ T=boost::mpl::bind5<boost::mpl::quote5<boost::mpl::and_,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::is_float,boost::mpl::void_>,boost::mpl::arg<1>>>,boost::mpl::bool_<true>,boost::mpl::bool_<true>,boost::mpl::bool_<true>>, U1=double, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(39) : see reference to class template instantiation 'boost::mpl::bind5<F,T1,T2,T3,T4,T5>::apply<U1>' being compiled with [ F=boost::mpl::quote5<boost::mpl::or_,boost::mpl::void_>, T1=boost::mpl::bind5<boost::mpl::quote5<boost::mpl::and_,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,char>>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::not_,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::is_float,boost::mpl::void_>,boost::mpl::arg<1>>>,boost::mpl::bool_<true>,boost::mpl::bool_<true>,boost::mpl::bool_<true>>, T2=boost::mpl::bind2<boost::mpl::quote2<boost::mpl::greater,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::sizeof_,boost::mpl::void_>,boost::mpl::arg<1>>,boost::mpl::size_t<8>>, T3=boost::mpl::bool_<false>, T4=boost::mpl::bool_<false>, T5=boost::mpl::bool_<false>, U1=double ] C:\Programming\VersionControl\boostrel\boost/mpl/assert.hpp(142) : see reference to class template instantiation 'boost::mpl::apply_wrap1<F,T1>' being compiled with [ F=f, T1=double ] lambda.cpp(47) : see reference to class template instantiation 'boost::mpl::assert_arg_pred' being compiled with [ P=boost::mpl::apply_wrap1<f,double> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2866: 'boost::mpl::arg<1>::apply<U1,U2,U3,U4,U5>::mpl_assertion_in_line_1' : a const static data member of a managed type must be initialized at the point of declaration with [ U1=double, U2=boost::mpl::na, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2866: 'boost::mpl::arg<1>::apply<U1,U2,U3,U4,U5>::mpl_assertion_in_line_1' : a const static data member of a managed type must be initialized at the point of declaration with [ U1=double, U2=char, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(63) : error C2664: 'boost::mpl::failed ************boost::mpl::not_<boost::mpl::is_na<T>>::* ***********boost::mpl::assert_not_arg<boost::mpl::is_na<T>>(void (__cdecl *)(Pred),void *)' : cannot convert parameter 2 from 'int' to 'void *' with [ T=char, Pred=boost::mpl::is_na<char> ] Conversion from integral type to pointer type requires reinterpret_cast, C-style cast or function-style cast C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(80) : see reference to class template instantiation 'boost::mpl::arg<2>::apply<U1,U2,U3,U4,U5>' being compiled with [ U1=double, U2=char, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(50) : see reference to class template instantiation 'boost::mpl::apply_wrap5<F,T1,T2,T3,T4,T5>' being compiled with [ F=boost::mpl::arg<2>, T1=double, T2=char, T3=boost::mpl::na, T4=boost::mpl::na, T5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(206) : see reference to class template instantiation 'boost::mpl::aux::resolve_bind_arg<T,U1,U2,U3,U4,U5>' being compiled with [ T=boost::mpl::arg<2>, U1=double, U2=char, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(63) : error C2866: 'boost::mpl::arg<2>::apply<U1,U2,U3,U4,U5>::mpl_assertion_in_line_2' : a const static data member of a managed type must be initialized at the point of declaration with [ U1=double, U2=char, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2664: 'boost::mpl::failed ************boost::mpl::not_<boost::mpl::is_na<T>>::* ***********boost::mpl::assert_not_arg<boost::mpl::is_na<T>>(void (__cdecl *)(Pred),void *)' : cannot convert parameter 2 from 'int' to 'void *' with [ T=my, Pred=boost::mpl::is_na<my> ] Conversion from integral type to pointer type requires reinterpret_cast, C-style cast or function-style cast C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(80) : see reference to class template instantiation 'boost::mpl::arg<1>::apply<U1,U2,U3,U4,U5>' being compiled with [ U1=my, U2=int, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(50) : see reference to class template instantiation 'boost::mpl::apply_wrap5<F,T1,T2,T3,T4,T5>' being compiled with [ F=boost::mpl::arg<1>, T1=my, T2=int, T3=boost::mpl::na, T4=boost::mpl::na, T5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(206) : see reference to class template instantiation 'boost::mpl::aux::resolve_bind_arg<T,U1,U2,U3,U4,U5>' being compiled with [ T=boost::mpl::arg<1>, U1=my, U2=int, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(80) : see reference to class template instantiation 'boost::mpl::bind2<F,T1,T2>::apply<U1,U2,U3,U4,U5>' being compiled with [ F=boost::mpl::quote2<boost::is_same,boost::mpl::void_>, T1=boost::mpl::arg<1>, T2=boost::mpl::arg<2>, U1=my, U2=int, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(223) : see reference to class template instantiation 'boost::mpl::apply_wrap5<F,T1,T2,T3,T4,T5>' being compiled with [ F=boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,boost::mpl::arg<2>>, T1=my, T2=int, T3=boost::mpl::na, T4=boost::mpl::na, T5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(427) : see reference to class template instantiation 'boost::mpl::aux::resolve_bind_arg<T,U1,U2,U3,U4,U5>' being compiled with [ T=boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,boost::mpl::arg<2>>, U1=my, U2=int, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(49) : see reference to class template instantiation 'boost::mpl::bind5<F,T1,T2,T3,T4,T5>::apply<U1,U2>' being compiled with [ F=boost::mpl::quote5<boost::mpl::or_,boost::mpl::void_>, T1=boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<1>,boost::mpl::arg<2>>, T2=boost::mpl::bind2<boost::mpl::quote2<boost::is_same,boost::mpl::void_>,boost::mpl::arg<2>,my>, T3=boost::mpl::bind2<boost::mpl::quote2<boost::mpl::equal_to,boost::mpl::void_>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::sizeof_,boost::mpl::void_>,boost::mpl::arg<1>>,boost::mpl::bind1<boost::mpl::quote1<boost::mpl::sizeof_,boost::mpl::void_>,boost::mpl::arg<2>>>, T4=boost::mpl::bool_<false>, T5=boost::mpl::bool_<false>, U1=my, U2=int ] C:\Programming\VersionControl\boostrel\boost/mpl/assert.hpp(142) : see reference to class template instantiation 'boost::mpl::apply_wrap2<F,T1,T2>' being compiled with [ F=f, T1=my, T2=int ] lambda.cpp(64) : see reference to class template instantiation 'boost::mpl::assert_arg_pred' being compiled with [ P=boost::mpl::apply_wrap2<f,my,int> ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2866: 'boost::mpl::arg<1>::apply<U1,U2,U3,U4,U5>::mpl_assertion_in_line_1' : a const static data member of a managed type must be initialized at the point of declaration with [ U1=my, U2=int, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(63) : error C2664: 'boost::mpl::failed ************boost::mpl::not_<boost::mpl::is_na<T>>::* ***********boost::mpl::assert_not_arg<boost::mpl::is_na<T>>(void (__cdecl *)(Pred),void *)' : cannot convert parameter 2 from 'int' to 'void *' with [ T=int, Pred=boost::mpl::is_na<int> ] Conversion from integral type to pointer type requires reinterpret_cast, C-style cast or function-style cast C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(80) : see reference to class template instantiation 'boost::mpl::arg<2>::apply<U1,U2,U3,U4,U5>' being compiled with [ U1=my, U2=int, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(50) : see reference to class template instantiation 'boost::mpl::apply_wrap5<F,T1,T2,T3,T4,T5>' being compiled with [ F=boost::mpl::arg<2>, T1=my, T2=int, T3=boost::mpl::na, T4=boost::mpl::na, T5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(206) : see reference to class template instantiation 'boost::mpl::aux::resolve_bind_arg<T,U1,U2,U3,U4,U5>' being compiled with [ T=boost::mpl::arg<2>, U1=my, U2=int, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(63) : error C2866: 'boost::mpl::arg<2>::apply<U1,U2,U3,U4,U5>::mpl_assertion_in_line_2' : a const static data member of a managed type must be initialized at the point of declaration with [ U1=my, U2=int, U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2866: 'boost::mpl::arg<1>::apply<U1,U2,U3,U4,U5>::mpl_assertion_in_line_1' : a const static data member of a managed type must be initialized at the point of declaration with [ U1=my, U2=char [99], U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(63) : error C2664: 'boost::mpl::failed ************boost::mpl::not_<boost::mpl::is_na<T>>::* ***********boost::mpl::assert_not_arg<boost::mpl::is_na<T>>(void (__cdecl *)(Pred),void *)' : cannot convert parameter 2 from 'int' to 'void *' with [ T=char [99], Pred=boost::mpl::is_na<char [99]> ] Conversion from integral type to pointer type requires reinterpret_cast, C-style cast or function-style cast C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(80) : see reference to class template instantiation 'boost::mpl::arg<2>::apply<U1,U2,U3,U4,U5>' being compiled with [ U1=my, U2=char [99], U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(50) : see reference to class template instantiation 'boost::mpl::apply_wrap5<F,T1,T2,T3,T4,T5>' being compiled with [ F=boost::mpl::arg<2>, T1=my, T2=char [99], T3=boost::mpl::na, T4=boost::mpl::na, T5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/bind.hpp(206) : see reference to class template instantiation 'boost::mpl::aux::resolve_bind_arg<T,U1,U2,U3,U4,U5>' being compiled with [ T=boost::mpl::arg<2>, U1=my, U2=char [99], U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] C:\Programming\VersionControl\boostrel\boost/mpl/aux_/preprocessed/plain/arg.hpp(63) : error C2866: 'boost::mpl::arg<2>::apply<U1,U2,U3,U4,U5>::mpl_assertion_in_line_2' : a const static data member of a managed type must be initialized at the point of declaration with [ U1=my, U2=char [99], U3=boost::mpl::na, U4=boost::mpl::na, U5=boost::mpl::na ] ...failed compile-c-c++ ..\..\..\bin.v2\libs\mpl\test\lambda.test\msvc-11.0\debug\lambda.obj...

3 2

Re: [boost] Is there any interest in a library for actor programming?
by Vicente J. Botet Escriba 23 May '13

23 May '13

Hi, I've found this Scala Actor Akka 1[1] framework quite interesting. BTW, it defines both untyped and typed actors. Best, Vicente [1] http://doc.akka.io/docs/akka/2.1.4/Akka.pdf

4 3

[Fusion] another nil issue
by Rich E 23 May '13

23 May '13

I see there was work about 5 months ago to avoid the Obj-C++ nameclash with nil in Boost.Fusion: https://github.com/boostorg/fusion/commit/12d2898287a124ff4b398fd3fff512b6f… Thanks for that as there are alot of use using boost in this scenario. However, I have found another couple nameclashes that prevented me from linking against Boost.Log in the latest trunk on OS X with clang, when trying this sample code: http://boost-sandbox.sourceforge.net/libs/log/example/doc/tutorial_trivial_… Attached is the changeset I needed to make to build. Does this seem acceptable to the maintainers? Best, Rich

2 4

[MPL] Bug with default lambda expressions?
by Louis Dionne 23 May '13

23 May '13

Hi, Some higher order algorithms in the MPL have a default for the lambda expression they accept. A good example is `boost::mpl::equal`: template <typename S1, typename S2, typename Pred = is_same<_, _> > struct equal; This works fine most of the time, but I was recently bitten by the following: template <typename VectorOfVectors, typename Vector> struct find_vector : find_if< VectorOfVectors, equal<Vector, _1> > { }; typedef find_vector< vector< vector<int, int>, vector<char, char> >, vector<char, char> >::type ThisWillBreak; What happens here is that the `equal<Vector, _1>` expression inside `find_vector` really is `equal<Vector, _1, is_same<_1, _2> >` because of the default value for the predicate to `equal`. When the lambda is evaluated, the placholders inside the inner `is_same<_1, _2>` expression are replaced too, which yields unexpected results. Using template <typename S1, typename S2, typename Pred = typename lambda<is_same<_, _> >::type> struct equal; or equivalently template <typename S1, typename S2, typename Pred = quote2<is_same> > struct equal; fixes the issue. Also note that all of the unit tests of the MPL still pass with these changes. Is the current behavior intended, or should I submit a patch? Regards, Louis Dionne

5 7

[test]: heap tests broken in release
by Tim Blechmann 23 May '13

23 May '13

hi all, for some reasons, the tests of boost heap are broken in release. it crashes somewhere in boost.test code. trunk works well ... > 0 __gnu_cxx::new_allocator<unsigned long>::construct PC=0x0057084e, FP=0x7fffdee7d5e0 [/usr/include/c++/4.7/ext/new_allocator.h#120] 1 __gnu_cxx::__alloc_traits<std::allocator<unsigned long> >::construct<unsigned long> PC=0x0056fa2e, FP=0x7fffdee7d610 [/usr/include/c++/4.7/ext/alloc_traits.h#203] 2 std::vector<unsigned long,std::allocator<unsigned long> >::_M_insert_aux PC=0x0056fb77, FP=0x7fffdee7d680 [/usr/include/c++/4.7/bits/vector.tcc#354] 3 std::vector<unsigned long,std::allocator<unsigned long> >::push_back PC=0x0056ee4f, FP=0x7fffdee7d6a0 [/usr/include/c++/4.7/bits/stl_vector.h#893] 4 boost::unit_test::test_suite::add PC=0x0056d823, FP=0x7fffdee7d6d0 [/media/hd3btr/sources/boost-release/boost/test/impl/unit_test_suite.ipp#139] 5 boost::unit_test::ut_detail::test_init_caller::operator () PC=0x00577721, FP=0x7fffdee7d710 [/media/hd3btr/sources/boost-release/boost/test/impl/framework.ipp#96] 6 boost::unit_test::ut_detail::invoker<int>::invoke<boost::unit_test::ut_detail::test_init_caller> PC=0x0057c657, FP=0x7fffdee7d730 [/media/hd3btr/sources/boost-release/boost/test/utils/callback.hpp#42] 7 boost::unit_test::ut_detail::callback0_impl_t<int,boost::unit_test::ut_detail::test_init_caller>::invoke PC=0x0057c526, FP=0x7fffdee7d760 [/media/hd3btr/sources/boost-release/boost/test/utils/callback.hpp#89] 8 boost::unit_test::callback0<int>::operator () PC=0x00586d31, FP=0x7fffdee7d780 [/media/hd3btr/sources/boost-release/boost/test/utils/callback.hpp#118] 9 boost::detail::do_invoke<boost::scoped_ptr<boost::detail::translate_exception_base>,boost::unit_test::callback0<int> > PC=0x00586bb5, FP=0x7fffdee7d7a0 [/media/hd3btr/sources/boost-release/boost/test/impl/execution_monitor.ipp#281] 10 boost::execution_monitor::catch_signals PC=0x00585ecf, FP=0x7fffdee7e290 [/media/hd3btr/sources/boost-release/boost/test/impl/execution_monitor.ipp#885] 11 boost::execution_monitor::execute PC=0x00585f8b, FP=0x7fffdee7e370 [/media/hd3btr/sources/boost-release/boost/test/impl/execution_monitor.ipp#1211] 12 boost::unit_test::framework::init PC=0x7f7a20adb04a, FP=0x7fffdee7e400 [/media/hd3btr/sources/boost-release/boost/test/impl/framework.ipp#268] 13 boost::unit_test::unit_test_main PC=0x7f7a20af0c17, FP=0x7fffdee7e4b0 [/media/hd3btr/sources/boost-release/boost/test/impl/unit_test_main.ipp#177] 14 main PC=0x004d6439, FP=0x7fffdee7e4d0 [/media/hd3btr/sources/boost-release/boost/test/unit_test.hpp#59] 15 __libc_start_main PC=0x7f7a1fecfea3, FP=0x7fffdee7e590 [/usr/lib/debug/lib/x86_64-linux-gnu/libc-2.17.so] 16 _start PC=0x004d6344, FP=0x7fffdee7e598 [/media/hd3btr/sources/boost-release/bin.v2/libs/heap/test/fibonacci_heap_test.test/gcc-4.7/debug/threading-multi/fibonacci_heap_test] -- any idea? thanks, tim

3 3

[type_erasure][release] okay to add to release?
by Steven Watanabe 22 May '13

22 May '13

AMDG The trunk tests are clean except for xlc. In Christ, Steven Watanabe

4 5

[1.54.0] Deadline for major changes approaching
by Daniel James 22 May '13

22 May '13

Hello everyone, This is just a quick reminder that the release branch is closed for major changes on Monday. thanks, Daniel

3 6

[heap] van Emde Boas tree proposal
by Jeremy Murphy 22 May '13

22 May '13

Hi everyone, I propose to add the van Emde Boas tree (vEBt) to Boost, primarily as a container adaptor to satisfy the Boost.Heap concept and interface. Rationale The vEBt is an extremely efficient data structure for satisfying the operations of a priority queue. Where u = |U| and U is the universe of numbers that can be stored in the container, the vEBt performs top() in O(1) and push(), pop(), erase() in O(lg lg u). U is, however, limited by type and range: positive integer values from 0 to 2^w (where w is the word size)*. The naive implementation uses an abysmal Θ(u) space but this can be improved to Θ(n) with hashing. Design If people support the idea of the vEBt in principle then I would be really interested in their thoughts on ... should u be a run-time or compile-time constant? Should the vEBt be available as a data structure for purposes other than a priority queue? Implementation I recently finished the basic implementation of the algorithm, so anyone interested in seeing a teething new-born is welcome to take a look.** Gritty questions and constructive criticism about class structure, etc are always welcome. The code won't meet all the programming guidelines yet, but don't worry, I have them in mind. Cheers. Jeremy * There is a good lecture on it from MIT here: https://www.youtube.com/watch?v=AjFtTQevtq0 ** https://code.google.com/p/veb-heap/

1 0

Returned mail: Data format error
by sean.farrow＠seanfarrow.co.uk 22 May '13

22 May '13

The original message was received at Wed, 22 May 2013 15:02:28 +0800 from seanfarrow.co.uk [86.198.252.36] ----- The following addresses had permanent fatal errors ----- <boost(a)lists.boost.org> ----- Transcript of session follows ----- while talking to lists.boost.org.: >>> MAIL From:sean.farrow@seanfarrow.co.uk <<< 501 sean.farrow(a)seanfarrow.co.uk... Refused

1 0

Git Modularization Ready for Review
by Dave Abrahams 22 May '13

22 May '13

Hi All, After substantial work, including massive changes by me and Daniel Pfeifer to KDE's svn->Git conversion tool, we have captured every Boost SVN commit in a Git repository. You can view the results at http://github.com/boostorg http://bitbucket.org/boostorg or you can pull from these repositories and view them in your local browser. The conversion process is automated by http://jenkins.boost.org/job/Boost2Git/ using the tool at http://github.com/ryppl/Boost2Git The rules that describe how commits are distributed are in https://github.com/ryppl/Boost2Git/blob/master/repositories.txt To understand how to edit that file, please read https://github.com/ryppl/Boost2Git/wiki/Editing-repositories.txt Daniel and I are ready to accept your feedback on the results of modularization, and especially your pull requests containing edits to the ruleset. I will the steering committee to establish a formal review period, though. -- Dave Abrahams

16 41

[graph] A few additions to propose to BGL
by Mikael Persson 21 May '13

21 May '13

Hi all, I have developed a number of small additions to the BGL, nothing major, just things that were useful to me and more practical as an extension to BGL instead of as a separate library, and if you're interested, I'm willing to contribute them back. These are non-intrusive additions, no modifications of existing BGL code is required (although some can be discussed, see below). The proposed additions are: 1) Additional property-maps to fill the void between bundled properties and boost::property_map<> mechanisms. Incl. descriptor-to-bundle maps, bundle-to-property maps, composite maps (i.e., chaining property maps), etc. https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 2) A few more property-tags that are common for graph algorithms. https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 3) A few more graph-concepts: a) Tree concept: Facilities for tree inspection. b) MutableTree concept: Facilities for tree construction / destruction. c) MutablePropertyTree concept: Same as MutableTree concept but with properties (like MutablePropertyGraph concept). d) NonCompactGraph concept: For graphs / trees that may contain invalid vertices or edges (i.e., "holes"). https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 4) Boost Graph Library Tree adaptors. This is for using the boost::adjacency_list to store a tree (and comply to tree concepts). https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 5) Pooled Adjacency-list. This is a wrapper around the boost::adjacency_list class which uses a method similar to Boost.Pool to store vertices in a contiguous storage (boost::vecS) while keeping vertex descriptors and iterators valid after removals. https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… Here are the some subjective issues to discuss: w.r.t.-3c) In my MutablePropertyTree concept, I have included removal functions that extract the properties of the elements to be removed. This can usually be implemented easily and provides symmetry w.r.t. to element-adding functions (if you can provide properties when creating elements, you should be able to retrieve them when removing elements). Without this, you can either copy the properties before removing the elements (needless copy and destruct), or you can std::move them out before removing the elements (leaving zombie elements in the graph in the meanwhile). The preferred option is to have the removal function move the properties into a destination (e.g. back-inserter). I would argue that the existing MutablePropertyGraph concept should include overloads for recording properties during removals, this shouldn't break any existing user-side code and be easily added to existing graph data structures. w.r.t.-3d) I have two issues with the NonCompactGraph concept: 1) Invalid elements mostly (or only) show up from iterators. So, one practical option is to have the iterators skip invalid elements. This effectively makes a "non-compact" graph look "compact". This would make this concept useless. However, iterators that must skip over invalid elements cannot provide random-access. There are ways to get the best of both worlds, such as introducing some "always-valid" iterators, which might or might not be identical to the base iterators (zero-overhead) depending on whether the graph is compact or not (a tag or meta-function might be needed to identify this). 2) A common operation with non-compact containers is to "re-pack" it. Generally, the advantage of leaving holes in a container is to avoid invalidating iterators. But, at certain points, one can decide to compact the container again. In the non-compact implementations that I have, I have included such functions, but never really needed them in practice (when removals <= insertions). I wonder if such functions should be included in the NonCompactGraph concept. This is mainly what I propose to contribute back to the BGL (or any part of it). I have, however, lots of other code that is peripheral or closely tied to the BGL. Some is a bit more experimental at this stage, while other things are too peripheral or too specific. You are welcome to browse my library to see if anything else grabs your attention. See below for a short list of a few specific items that might be of interest. Cheers, (and pardon the lengthy email) Mikael. P.S.: Other interesting items that I have developed that might be worth proposing: 6) Linked-tree. A classic linked-tree data structure. It has similar signature as boost::adjacency_list and models the relevant BGL graph concepts and the proposed tree concepts: https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 7) Contiguous layout trees. These are fixed-arity (D-ary) trees that use a breadth-first layout (similar to heaps) in contiguous memory. They model the relevant BGL concepts and the proposed tree concepts. a) D-ary BF-tree uses one contiguous storage with vertices laid out in breadth-first order. It works great, it's my work-horse tree-implementation and the memory-locality it provides has been a major performance factor in my code. https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… b) D-ary COB-tree (Cache-Oblivious B-tree) uses a tree of moderately-sized contiguous blocks with breadth-first layout within them. This thing is nice in theory, but in practice it has been difficult to guarantee correctness and to deliver good performance (it only out-performs the BF-tree when the size of the tree is in the gigabytes range). https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 8) I wrote an AD* algorithm, which I modeled after the BGL's existing A* search implementation. It's rather old code that I haven't done much with for a while, but I'm willing to resurrect it if there is interest for it. The fact that it is a dynamic / anytime / on-line graph algorithm makes it a bit odd compared to the other existing algorithms in BGL (all static / batch / off-line algorithms, AFAIK). https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 9) I wrote a multi-graph template to overlay an adjacency-list (i.e., general "graph") and a tree (i.e., complying to the proposed tree concepts). The point here is to have one set of vertices and two sets of edges, one forming a general graph and one forming a tree. The motivation is to: keep the graph and tree strongly synchronized by sharing the same storage; and, benefit from cache-friendly tree layouts (e.g., BF-tree) when using the general graph. My reservations with this are that the code is (1) not be quite polished yet, (2) a bit too advanced / specific for the general nature of the BGL, and (3) a bit convoluted to use (user-side code is messy). https://github.com/mikael-s-persson/ReaK/blob/master/src/ReaK/ctrl/graph_al… 10) If you find anything else you like, we can discuss it. I mostly write path-planning code and lots of numerical stuff. I have a nice sampling-based motion-planning framework in place that builds upon the BGL, and extended (and more mathematically sound) "Topology" concepts, as well as space-partitioning trees and stuff like that: https://github.com/mikael-s-persson/ReaK/tree/master/src/ReaK/ctrl/graph_alg https://github.com/mikael-s-persson/ReaK/tree/master/src/ReaK/ctrl/path_pla… https://github.com/mikael-s-persson/ReaK/tree/master/src/ReaK/ctrl/topologi… -- Sven Mikael Persson

2 2

Re: [boost] [ASIO] Having a hard time after upgrading my boost
by Marat Abrarov 20 May '13

20 May '13

> My code is heavily multi-threaded. This problem doesn't show up in > single threaded environment at all. My OS is SUSE 11 and g++-4.3.3 as the > compiler. I may have to post some code eventually but on the top off your > head - do you have any pointers for me? Note that free functions like asio::async_read/aync_read_untill (async_write/async_write_until, etc) are composed operations so "... The program must ensure that the stream performs no other read operations (such as async_read, async_read_until, the stream's async_read_some function, or any other composed operations that perform reads) until this operation completes" (http://www.boost.org/doc/libs/1_53_0/doc/html/boost_asio/reference/async_re ad_until.html). Also note that most of Asio classes (sockets, timers, etc.) are not thread safe. So in multi-threaded program you have to use some kind of synchronization if there is no implicit strand (http://www.boost.org/doc/libs/1_53_0/doc/html/boost_asio/overview/core/stra nds.html). The simplest kind of synchronization is asio::io_service::strand. If you use something else (for example, mutex) then notice intermediate handlers created by composed operations (http://www.boost.org/doc/libs/1_53_0/doc/html/boost_asio/overview/core/stra nds.html, asio_handler_invoke) and use your synchronization in a right way (for mutex see https://github.com/boostcon/2011_presentations/raw/master/mon/thinking_async hronously.pdf, struct mutex_wrapper at page 95-97). There is a feature named "Handler Tracking" (http://www.boost.org/doc/libs/1_53_0/doc/html/boost_asio/overview/core/hand ler_tracking.html) that can help you to investigated the order of handler invocation. Regards, Marat Abrarov.

2 1

[ASIO] Having a hard time after upgrading my boost libraries
by Arpan Sen 20 May '13

20 May '13

Folks, I recently moved to boost 1.52, been using a pretty old version of boost earlier. Quite a number of pieces of my code have stopped working since then, but the one that's really a pain is the ASIO piece. I have a lot of code that makes use of ASIO's async read/write and other calls and there seems to be a problem reading data from socket with async_read_until - sometimes I get empty string, there's valid data at other times. My code is heavily multi-threaded. This problem doesn't show up in single threaded environment at all. My OS is SUSE 11 and g++-4.3.3 as the compiler. I may have to post some code eventually but on the top off your head - do you have any pointers for me? Thanks for your time. Arpan

3 2

atomic lockpool and alignment
by Jesper Storm Bache 20 May '13

20 May '13

I am new to this list, so I apologize if this has already been discussed. boost_1_53_0/libs/atomic/src/lockpool.cpp contains: static lockpool::lock_type lock_pool_[41]; On most systems, I would expect that lock_type becomes atomic<bool> v_; I therefore seems to me that we are packing a large number of commonly used locks into sequential memory and therefore increasing the risk of false sharing due to cache line sharing. At the same time, I expect that the 41 lock instances will be used frequently and as such it seems to make sense to align the array to a VM page boundary (to get only a single hot VM page). Has alignment/padding been considered for the lock_pool implementation? If so what are the reasons for its dismissal? Thanks, Jesper Storm Bache

2 1

Can't find documentation for contributing to Boost.
by Jeffrey Yasskin 20 May '13

20 May '13

I'm thinking of sending in a fix for https://svn.boost.org/trac/boost/ticket/7630, and to do that I need to check out Boost at head and run the tests for the Range project. So I went to http://www.boost.org/development/index.html hoping to find instructions. That page has some useless graphs and a calendar, but no mention of source control or command lines. I don't want to contribute testing resources, so I look on the right side for something that looks useful. "Submissions" leads to http://www.boost.org/development/submissions.html, which talks about contributing a whole new library rather than fixing bugs in an existing one. Nothing else in the right-side navigation box looks like it's going to help. A couple times in the past, I've just given up at this point, but this time I decided to let you know about the problem. Could someone write down how to fix a bug in Boost and put it somewhere I can find it on the website? Thanks, Jeffrey

3 3

[string_ref] Don't rely on implicit conversation for operators
by Nicola Bizzoca 20 May '13

20 May '13

Hi, This is a follow up of "[string_ref] Add an equality operator between string_ref and char*" I'm sorry for the previous message, I'm started learning C++ and I'm making some errors Here the new topic: boost::string_ref rely on implicit conversation for using operators For example this operator: template<typename charT, typename traits> bool operator==(basic_string_ref<charT, traits> x, basic_string_ref<charT, traits> y) Is bad because if I write this: boost::string_ref("http") == "http" The compiler complains: error: no match for ‘operator==’ (operand types are ‘boost::basic_string_ref<char, std::char_traits<char> >’ and ‘const char [5]’) It can't find the correct overload because implicit conversion is considered after candidate templates have been considered boost::string_ref should offer overloads for string and const char* so it can be possible write code like boost::string_ref("boost") == "boost" && boost::string_ref("c++") == std::string("c++")

3 2

[lockfree] arm / iOS builds against Boost.Atomic
by Rich E 19 May '13

19 May '13

Hello, I noticed today when moving my work from OS X / clang / libc++ to iOS / clang / libc++ that Boost.Lockfree must link against libboost_atomic.a to compile. This shouldn't be necessary, since there is std::atomic on iOS as well. If this is correct I can file a bug report, provide a test application, or both if requested. cheers, Rich

5 11

[tti] Moving TTI to release
by Edward Diener 19 May '13

19 May '13

Do I have to do anything further to move TTI from the trunk to the release branch for Boost 1.54 ? If so, please inform me of it as I am happy that TTI can be part of the 1.54 release, and I believe that the cutoff date for new libraries is tomorrow. Edward Diener

2 4

[gil] Ok to merge new gil's extension to release branch?
by Christian Henning 19 May '13

19 May '13

Hi, is it ok? The merge would include io, toolbox, numerics and some other changes to gil's code itself. Regards, Christian

6 92

[trac] Request to add TTI library to trac system
by Edward Diener 18 May '13

18 May '13

Would the TTI library pleased be added to the Boost trac system ? I am the owner of the component and my trac ID is 'eldiener'. Edward Diener

2 2

Getting regression test command lines
by Edward Diener 18 May '13

18 May '13

It is not possible in the regression tests I see on the Boost website to get the full command lines for a regression test. The reason for this is that the regression test uses a command response file and the contents of the command response are not being shown. Atypical example might be: cl /Zm800 -nologo @"D:\BoostRT\results\boost\bin.v2\libs\tti\test\test_has_data_compile.test\msvc-9.0~w\dbg\stdlb-stlpr-5.2~9\test_has_data_compile.obj.rsp Without knowing what the command response file contains it is impossible to know what the command options are for the test. This makes it very difficult to duplicate the reason for a failure in the online regression tests.

2 2

[trac] No `tti` component
by Michel Morin 18 May '13

18 May '13

Hi, There is no `tti` component in trac yet. Thanks, Michel

4 4

[1.54.0] [log] Permission to merge to release
by Andrey Semashev 17 May '13

17 May '13

Hi, I'd like to ask for permission to merge Boost.Log to the release branch. All test issues are resolved, although some MinGW testers haven't run the tests for 2 weeks and haven't updated the report. RDC-VC10 tester also didn't clean the previous test results so the report is not showing the actual results (other MSVC testers are green). The util_dynamic_type_dispatcher and util_static_type_dispatcher rows should be ignored, these tests were renamed to util_dynamic_type_disp and util_static_type_disp, respectively.

2 3