- Boost - lists.preview.boost.org

[container][stable_vector] What does reserve() do for stable_vector
by Arindam Mukherjee 19 Apr '15

19 Apr '15

Consider the following code. #include <string> #include <boost/container/stable_vector.hpp> #include <iostream> int main() { boost::container::stable_vector<std::string> vec; vec.reserve(10); std::cout << "capacity = " << vec.capacity() << '\n'; } On running this (on g++ and Linux), the output is: capacity = 4294967286 (that's 2^32 - 10) If replace boost::container::stable_vector with std::vector above, the output is: capacity = 10 I know it could as well have been capacity = 20, or capacity = 64 or whatever but that's still sane behavior. What capacity() returns for stable_vector seems to be (2^32 - N), N being the requested capacity. I didn't see such a definition of capacity in the docs: http://www.boost.org/doc/libs/1_56_0/doc/html/boost/container/stable_vector… Thanks, Arindam

2 1

[type_traits] Testing for copy constructor
by Edward Diener 19 Apr '15

19 Apr '15

Does one use has_trivial_copy or has_nothrow_copy to determine if a class has a copy constructor or not ? I am writing some code that can do different things depending on whether a particular class has a copy constructor or does not have a copy constructor. I do not really care whether the copy constructor is a compiler generated copy constructor or not.

2 1

Feedback on Boost.Http
by Vinícius dos Santos Oliveira 18 Apr '15

18 Apr '15

I recently submitted an HTTP server library to Boost Incubator and I'd appreciate feedback: http://rrsd.com/blincubator.com/bi_library/http/?gform_post_id=1460 I intend to submit to Boost later. This is the library that I developed during GSoC 2014 and I made several improvements (new features, bug fixes, better and extended documentation...) after the end of GSoC. There are a few improvements that I still want to do, but none of them would be a barrier for Boost integration, in my opinion. This library doesn't have a builtin request router, opposed to several libraries out there, then you can use whatever routing style you wish (tree-based, middleware-based, no router...). Also, it follows Boost active style, then you can build your own scheduler around it (prioritize requests from certain IPs, defer acceptance of new connections during server high load, reuse prior constructed objects...). The library follows Asio threading model, then you also choose whether you will handle all requests from the same thread (useful for embedded devices) or multiples ones. The library is fully async, then one thread is not a problem. It has a powerful and flexible file server API, supporting range-based requests, conditional requests, support for ETags and so on. After the GSoC, I had the chance to add tests for asynchronous abstractions and now the implementation is much more trustable and stable. The choice to reuse an existing HTTP parser (the Node.js's C parser) also helps a lot. The simple message-based API helps to support HTTP pipelining, allocation fine tuning and much more. Besides HTTP pipelining, HTTP chunking (and other modern features like 100-continue and HTTP Upgrade) are also supported. There are zero reviews/comments on Boost Incubator right now and I'd love to see more eyes on this lib that does better on many fronts than previous choices. Benchmark is one item that I still need to tackle, btw. But I hope to see good results here too. -- Vinícius dos Santos Oliveira https://about.me/vinipsmaker

1 0

[tools] How to use 1.58.0/bjam --toolset=sun for specified stdlib feature?
by Sergey Sprogis 18 Apr '15

18 Apr '15

Running boost regression unit tests I found it convenient to direct output from every single tested library into a separate logfile. To do that, my testing script (bash) at first extracts the list of all <library>/test lines from status/Jamfile.v2, and puts them into another test_suites.txt file. Then it runs all extracted test suites like this: my_res_dir= `pwd` for dir in `cat test_suites.txt`; do dir1=`echo $dir | sed "s/\//\./g"` cd $BOOST_ROOT/libs/$dir bjam --toolset=sun variant=release > $my_res_dir/$dir1.log 2>&1 done All that worked fine until boost-1.58 in which tools/build/src/tools/sun.jam file was modified so that instead of single standard library it now allows the possibility of using any of 5 available libraries. The question is, how exactly should I define bjam's options in my bash script shown above, if for example, I want to use gnu library in c++03 mode? The proper code inside sun.jam file looks like this: feature.extend stdlib : gnu ; feature.compose <stdlib>gnu : <cxxflags>-std=c++03 <linkflags>-std=c++03 ; but how should I tell to bjam to use this specific library? Thanks, Sergey

3 2

[build] [boost 1.58] Error when compiling with MSVC-7.1
by Ion Gaztañaga 18 Apr '15

18 Apr '15

Hi, I just tried the newly released version with this toolset (I don't think many will use and support it, but still useful). Output when building move from boost/libs/move/test: ..\..\..\b2.exe toolset=msvc-7.1 variant=debug C:/Data/Libs/boost/tools/build/src/tools\msvc.jam:1075: in configure-really *** argument error * rule generate-setup-cmd ( version : command : parent : options * : cpu : global-setup : default-global-setup-options : default-setup ) * called with: ( 7.1 : C:\Program Files (x86)\Microsoft Visual Studio .NET 2003\Vc7\bin : C:\Program Files (x86)\Microsoft Visual Studio .NET 2003\Vc7 : <command>C:\Program Files (x86)\Microsoft Visual Studio .NET 2003\Vc7\bin\cl.exe : i386 : : x86 : vcvars32.bat ) * missing argument global-setup C:/Data/Libs/boost/tools/build/src/tools\msvc.jam:809:see definition of rule 'generate-setup-cmd' being called C:/Data/Libs/boost/tools/build/src/tools\msvc.jam:201: in configure C:/Data/Libs/boost/tools/build/src/tools\msvc.jam:153: in msvc.init C:/Data/Libs/boost/tools/build/src/build\toolset.jam:43: in toolset.using C:/Data/Libs/boost/tools/build/src\build-system.jam:461: in process-explicit-toolset-requests C:/Data/Libs/boost/tools/build/src\build-system.jam:527: in load C:\Data\Libs\boost\tools\build\src/kernel\modules.jam:289: in import C:\Data\Libs\boost\tools\build\src/kernel/bootstrap.jam:139: in boost-build C:\Data\Libs\boost\boost-build.jam:17: in module scope I've found a workaround adding this to user-config.jam, in case anyone needs a workaround: using msvc : 7.1 : : <setup>"C:/Program Files (x86)/Microsoft Visual Studio .NET 2003/Vc7/bin/vcvars32.bat" ; Of course that path is in a 64-bit Windows OS, adjust it to your installed path. Best, Ion

1 0

[Hana] Formal review dates
by Louis Dionne 17 Apr '15

17 Apr '15

Dear Boost, As I already announced in a previous message, a formal review is about to be asked for Hana. The current preferred dates would be April 25 - May 8. However, we are concerned that people might be unavailable to do reviews such a short time before C++Now. The goal of this message is to ask potential reviewers whether they would be available during the proposed period. If people seem unfavorable or if there is too little feedback to this message, we will consider pushing back the review to after C++Now. Note that one reason why I'm trying to squeeze the review before C++Now is because it could hugely help with marketing the library if it was accepted. Regards, Louis

3 4

Release Status?
by Olaf van der Spek 17 Apr '15

17 Apr '15

Hi, What's the status of the release? -- Olaf

2 1

Re: [boost] [Boost-users] [IPC Named Mutex]
by Tom Kent 16 Apr '15

16 Apr '15

On Thu, Apr 16, 2015 at 3:01 AM, Lorenzo Trivelli < trivelli.lorenzo(a)konvergence.it> wrote: > Hi to everyone, > I'm experiencing a strange behaviour of named mutex on > a windows 2008 machine. > symptoms: when the system event log is empty, creation > of named mutex fails with a boost::interprocess::interprocess:exception > with msg boost::interprocess_exception::library_error. > Now some data: > 1) Boost 1.57.0 + stlport 5.2 > 2) VS 2005 > 3) Target Environment: Win 2008/32 > 3) after a night of code digging I managed to crete a small sample > which raises the exception: > > #include <boost/shared_ptr.hpp> > #include <boost/interprocess/sync/named_mutex.hpp> > #include <boost/interprocess/sync/scoped_lock.hpp> > #include <iostream> > > typedef boost::shared_ptr<boost::interprocess::named_mutex> > safe_ipc_mx; > > static safe_ipc_mx __mx; > int main(void) { > system("pause"); > try { > __mx = safe_ipc_mx(new > boost::interprocess::named_mutex(boost::interprocess::open_or_create_t(),"JAEGER")); > std::cout << std::endl << "Mutex created !" << std::endl; > } catch(boost::interprocess::interprocess_exception const& e) { > std::cout << std::endl << "Mutex creation error " << > e.what() << " /" << e.get_error_code() << " /" << e.get_native_error(); > } > system("pause"); > return 0; > > } > > I tried it also, and got the same result. I also tried with msvc-12.0, same result. > as far as I digged, it seems that the trouble is in the > winapi::get_last_bootup_time(stamp) call > in shared_dir_helpers.hpp, but up to now I had not been able to reproduce > it on a machine with > all the debugging tools installed > get_last_bootup_time() looks through the system event log for event ID == 6005 (event log started)...since the event log was cleared out, this is not found. I guess that is a bug in boost. One thing you could try...in interprocess's win32_api.hpp, there is another implementation of get_last_bootup_time() which uses WMI instead of the event log (there were warnings in the source about WMI not supporting hibernation/clock changes correctly, so beware). If you define BOOST_INTERPROCESS_BOOTSTAMP_IS_LASTBOOTUPTIME it should use that other version...give that a try. (in visual studio Project Properties -> C/C++ -> Preprocessor -> Preprocessor Definitions: add a semi colon ';' then the above item) That worked for me on windows 7. I submitted a pull request to automatically fallback to WMI if the event log started event isn't in the log. https://github.com/boostorg/interprocess/pull/18 Tom

1 0

[serialization] failing MPI build
by Alain Miniussi 16 Apr '15

16 Apr '15

Hi, Am I the only one with a (global) failing build on MPI ? ../../../boost/archive/detail/interface_oarchive.hpp(63): error: no instance of overloaded function "boost::mpi::detail::content_oarchive::save_override" matches the argument list argument types are: (const boost::archive::tracking_type) object type is: boost::mpi::detail::content_oarchive this->This()->save_override(t); I am going to investigate, but maybe I missed something obvious. Thanks Alain

2 17

std::map<> - like structure for other than std::pair<>?
by David Hagood 16 Apr '15

16 Apr '15

Several times I have run into a use case where I have some object that I would like to access via something like a std::map<>, but which already contains a member that I would like to use as a key. Is there any data structure that "acts like a map", but instead of storing std::pair<key,value> allows me to store an object directly, and specify what member of that object is the key value? I can give a specific use case for this: For those of you not familiar with the SCA, there is an object called CF::Properties. This is a CORBA sequence (think std::vector) of objects of {string name, CORBA::Any value}, used to store metadata. Ideally, I'd like to have an object that I could initialize from that sequence that would allow me to do things like this: inline string &getKey(CF::Property &x) { return x.name; } void foo(CF::Properties &meta) { mapLikeThing<CF::Property,getKey> myMap(meta); double sampleRate; myMap["SampleRate"] >> sampleRate; setHardwareSampleRate(sampleRate); }

7 8

Fwd: Windows Intel Compiler problem
by Mari Pecha 15 Apr '15

15 Apr '15

Good morning, I try compile boost with Intel Compiler under Windows OS, but I got an error message screen is in attachments. I don't know what I'm doing wrong, can you help me? Thank you Mari --- This email has been checked for viruses by Avast antivirus software. http://www.avast.com

2 1

GSOC 2015 Sample Code
by Aditya Avinash Atluri 14 Apr '15

14 Apr '15

Hi, I was unable to put sample code during submission because I was busy with Mesa. Here is the sample code: https://gist.github.com/adityaatluri/22c97a726c304d9e5c50 -- Regards, Aditya Avinash Atluri, Graduate Student, Electrical and Computer Engineering, The George Washington University, Washington, DC.

1 0

htmlspecialchars and urlencode?
by Olaf van der Spek 14 Apr '15

14 Apr '15

Hi, Does Boost have functions like htmlspecialchars and urlencode (from PHP)? If not, I think they'd make a nice addition to the string algorithm lib. -- Olaf

4 6

boost::posix_time::duration_from_string throws std::out_of_range
by George Georgiev 13 Apr '15

13 Apr '15

Hi, I just noticed that boost::posix_time::duration_from_string throws std::out_of_range when I pass empty string to it. This seems like a bug, IMHO it should throw boost::bad_lexical_cast as it does for any other problem with the input. Thanks, George

2 2

Git tags and Boost release
by Robert Ramey 12 Apr '15

12 Apr '15

I look in my history of the master branch and It seems to me I would like to be able to know which commit corresponds to which Boost release. I think the correct functionality to do this is described here. http://git-scm.com/book/en/v2/Git-Basics-Tagging I'm wondering if we want to do this upon release so we can remember where we were when something blows up. Ideally, I'd like the release managers to be able to just global to the "mark" when the release is "official" I like git - but anything I haven't done before is out of my comfort zone. So any insight would be appreciated. Robert Ramey -- View this message in context: http://boost.2283326.n4.nabble.com/Git-tags-and-Boost-release-tp4674328.html Sent from the Boost - Dev mailing list archive at Nabble.com.

3 3

[modular boost][install] Signals2 include links not being generated during build
by Greg Rubino 12 Apr '15

12 Apr '15

Hi, I'm building modular boost on 32-bit debian linux, and the build runs without error, but the links for some of the header files are not created. Here's what I'm running: $ bash bootstrap.sh $ ./b2 --runtime-link=static --without-python --without-mpi --without-iostreams At the end of the build (which shows warnings but no failures), I get this message: """ ...updated 836 targets... The Boost C++ Libraries were successfully built! The following directory should be added to compiler include paths: .../boost The following directory should be added to linker library paths: .../boost/stage/lib """ But for some reason signals2 is not being built. From the boost build directory: $ ls stage/lib/libboost_signals2* ls: cannot access stage/lib/libboost_signals2*: No such file or directory $ ls boost/signals2.hpp ls: cannot access boost/signals2.hpp: No such file or directory I'm not sure what happened or even how to diagnose whatever the issue might be. Has anyone seen this before or have any troubleshooting tips for me? Thanks, Greg

2 1

1.58.0 rc3 is now available
by Marshall Clow 12 Apr '15

12 Apr '15

Release candidate files for 1.58.0 are available at: http://boost.cowic.de/rc/ * Since rc1, the changes that were causing the serialization libraries to fail to build on MSVC have been reverted. * Since rc2, the documentation for bind, and mem_fun. No code changes. 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: MD5 (boost_1_58_0_rc3.7z) = f7255aeb692c1c38fe761c32fb0d3ecd MD5 (boost_1_58_0_rc3.tar.bz2) = b8839650e61e9c1c0a89f371dd475546 MD5 (boost_1_58_0_rc3.tar.gz) = 5a5d5614d9a07672e1ab2a250b5defc5 MD5 (boost_1_58_0_rc3.zip) = b0605a9323f1e960f7434dbbd95a7a5c Thanks! -- The release managers P.S. Release notes are here: http://www.boost.org/users/history/version_1_58_0.html

3 3

[serialization][develop] Unable to find file or target named 'test_polymorphic_helper.cpp'
by Dmitry Moskalchuk 11 Apr '15

11 Apr '15

It seems that latest commit to develop branch of Boost.Serialization (https://github.com/boostorg/serialization/commit/a32549c25fa983fea2b5dfeaf9…) break build of Boost: error: at /home/cislave/.crystax/ci-boost/regression/android-19-armeabi-v7a-develop/test/develop/regression/armeabi-v7a/test/boost_bb/src/kernel/modules.jam:107 error: Unable to find file or target named error: 'test_polymorphic_helper.cpp' error: referred to from project at error: '../libs/serialization/test' And really, there is no file libs/serialization/test/test_polymorphic_helper.cpp. I guess it was forgotten to be added to git. -- Dmitry Moskalchuk

2 1

[Boost Document Library] Which SDK / OS to use for development?
by Abhinav Tripathi 11 Apr '15

11 Apr '15

I am trying to start the development of a Document Library for Boost which was listed under the GSoC projects list. I successfully built Boost 1.57 on windows 8 with MinGW using some help from this mailing list. Now, i wish to develop the library on windows only (Although i can shift to linux if need be).... When i went through the links provided on the ideas list, i came across following things : --The OpenOffice SDK asks to either use linux or Visual Studio on Windows and there is practically nothing (documentation) for compiling with MinGW. --The LibreOffice SDK also asks to install many *nix tools first and also doesn't mention anything about compatibility with MinGW. --The last 2 links use .NET and some other MS libraries which i am pretty sure won't be much portable... . I wish to develop the library so as to get it accepted to Boost at some point. I assume that Boost would accept only cross platform code, so i discarded the last two links. I am now in a dilemma..... Which of the 2 SDK should i try to use on Windows with MinGW.. Or should i NOT develop on windows and shift to linux... . Also, The MS Office formats are not open but other office formats might be open and hence i can also try and develop something without using any of the available SDKs. So, instead of developing of a wrapper, i can aim to develop a complete library to load and manipulate document files... . Please suggest some option and show me a way as to which SDK/Platform should i use. And how to continue the development for the Document Library. . Regards, Abhinav

2 3

[fiber, afio, dl, bindlib, expected, hana, tick, fit, simd, dispatch] Checking my shortlist of upcoming Boost C++ 11/14 librari
by Niall Douglas 10 Apr '15

10 Apr '15

Dear Boost, I've spent the last few days reviewing the shortlist of C++ 11/14 libraries as suggested in this thread http://article.gmane.org/gmane.comp.lib.boost.devel/255548 which appear closest to entering Boost as per the rules in my C++ Now abstract: 1. The library must be C++ 11/14 only. As in, no C++ 03 compilation possible. 2. The order chosen shall be the closest to entering Boost in March/April (i.e. now), so already in Boost, approved to enter Boost, in the formal review queue, approaching the formal review queue. At https://drive.google.com/open?id=1Bizs9xz2dyt1d5GJv-pOCmu1cS67gRd0KNYn sjYK Ji w&authuser=0 you will hopefully find a traffic light dashboard spreadsheet (I tried posting a PNG here, it was refused). In it is shown the current state, as estimated by fallible me from a cursory glance at the library, for various measures of the library. Errors are entirely possible, hence me asking here before I make a fool of myself. List members may be as surprised as I was to learn that most of the upcoming libraries require C++ 14. They are also universally standalone from Boost, being about as weakly dependant as is possible and still be called a Boost library. That was a big surprise to me as well. Another surprise was the dislike of Boost.Test - a lot of libraries don't use it, indeed can't use it. And finally, almost everyone uses Travis CI, though not valgrind memcheck for leak detection nor coveralls for unit test coverage. The first category is libraries already in the formal review queue or better. These are: Fiber, AFIO, Dl. The second category is libraries where the authors have been visible enough for me to review the library and score it onto the dashboard. These are: BindLib, Expected, Hana, Tick, Fit. ... of which BindLib, Expected and Hana are the most "Boost ready" by my estimation. I still haven't reviewed Sqlpp11, SIMD, Dispatch, Range v3, Spirit X3 nor Proto 0x. The main reason why not is that I would never use any of those libraries in any work I expect to do anytime in the next five years. That's quite unfair to those libraries, but I have another big reason: I'm also hesitant to review libraries covered by their authors also present at C++ Now, or have presented on them in the past, as it won't add value plus I probably wouldn't know what I'm talking about compared to them so that removes Expected?, Hana, SIMD, Dispatch, Range v3, Spirit X3 and Proto 0x. Which leaves a shortlist of: Fiber, AFIO, Dl, BindLib, maybe Expected, maybe Tick and Fit. I think SIMD and Dispatch have been presented on before at C++ Now right? Could anyone also very quickly summarise the main differences in their C++ 11 only rewrite? I think I remember it was mainly compilation speed rather than doing anything unusually C++ 11 only? Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

4 4

[peer review queue tardiness] Cleaning out the Boost review queue
by Niall Douglas 10 Apr '15

10 Apr '15

I've been reviewing the Boost Formal Review queue as part of preparing my C++ Now presentation and I observe the following things: Observation 1. The following review submissions have not been updated by their authors in over two years and therefore count as unmaintained. Abandoned libraries before peer review are even more undesirable than abandoned official Boost libraries, I therefore suggest they be removed from the review queue until their authors bring them up to date: * Join (last update 2009) * Block pointer (last update: well, it's still in the SVN sandbox) * Singularity (last update 2011) * Extended Complex Numbers (last update 2012) * Array (last update 2012) * Countertree (last update 2012, I see a github import in 2013 but no new commits) * Process (last update 2012). This is a particularly useful library I have used myself in production code, and I see a number of mirrors of it on github each with varying patches and bug fixes. As a minimum, somebody needs to create a canonical github project for Process and merge the fixes from the many github copies. Otherwise, I'm sorry but this library needs to be considered abandoned otherwise, and removed from the review queue. It may be the case that the links on the review queue wiki page are simply out of date. If so, they need to be updated. Otherwise a purge of the queue is very desirable such that the queue accurately reflects ready to use new Boost libraries. Observation 2: Edit Distance (Algorithm) by Erik Erlandson shouldn't be in the queue. What he's done is to add a new algorithm to Boost.Algorithm, so the maintainer for Algorithm (Marshall?) should either merge his contribution or reject it as inappropriate or badly implemented. Failing that, Edit Distance should be spun into a standalone library instead of forking Algorithm. Right now it is supplied quite literally as a fork of the algorithm github. It should be a pull request, yet I don't see it in the pull requests for boostorg/algorithm, neither open nor closed. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

15 43

[AIX6.1] [64bit] [build boost 1.57] Help required to build boost
by 임영운 10 Apr '15

10 Apr '15

hi, I'm newbie. the only one thing that I wanted to ask is building boost 64bit on aix6.1. I try it a number of times. and I failed building 64bit boost objects. It built only 32bit objects. would you tell me how to build boost 64bit on aix6.1 thanks read this msg. 주식회사 테미 임영운(Yeong-woon Im) 305-764 대전광역시 유성구 대학로99 충남대학교 산학연교육연구관 807호 #807, TBI Center, Chungnam University 99 Daehak-ro, Yuseong-gu, Deajeon, 305-764 Korea Home URL : http://www.temee.co.kr Tel : 042-824-7014 Fax : 042-824-7015 Mobile : 010-6266-9960

2 1

Re: [boost] [Boost-users] 1.58.0 rc3 is now available
by Marshall Clow 09 Apr '15

09 Apr '15

On Thu, Apr 9, 2015 at 4:11 AM, Deniz Bahadir <dbahadir(a)benocs.com> wrote: > Building Boost 1.58.0-rc3 succeeded only partially. > > > Success: > > Debian 7 with GCC 4.8.2 (in C++03 mode) with build-command: > b2 -j4 --build-dir=/opt/build/test --build-type=complete > --layout=versioned address-model=64 architecture=x86 install > --prefix="/opt/install/test" toolset=gcc-4.8 cflags="-fPIC" > cxxflags="-fPIC" dll-path="/opt/test/lib/x86_64-linux-gnu" > > > Failure: > > Debian 7 with GCC 4.8.2 (in C++11 mode) with build-command: > b2 -j4 --build-dir=/opt/build/test --build-type=complete > --layout=versioned address-model=64 architecture=x86 install > --prefix="/opt/install/test" toolset=gcc-4.8 cflags="-fPIC" cxxflags="-fPIC > -std=c++11" dll-path="/opt/test/lib/x86_64-linux-gnu" > > > The main-error seems to come from "Boost.Context" and the use of unknown > "std::index_sequence": > > std::index_sequence is a C++14 feature. -- Marshall

1 0

[language] determine sence of language proposal concerning the 'default'-keyword
by Jakob Riedle 09 Apr '15

09 Apr '15

Hello boost community, since this seems to me kind of a proving ground for new C++ library/language features I'd ask this question here. Would you recon' writing a language proposal about: using the 'default'-keyword as some standard way of calling the default ctor of variables. I could imagine the following use-case: void foo( some::very_long_name<some_very_long_template_param> arg = default ){ return; } This would make things shorter, in the way 'auto' does it for types. You could also do it for passing parameters: foo( default ); This could interact very well with boost::optional, make it more intuitive and easier to use: optional<int> bar( optional<some_long_type_name> arg = default ){ return default; } bar( default ); This way, you don't have to write 'optional<some_long_type_name>()', both at the parameter and at the function call. What do you think of such a language proposal? Regards, Jakob Riedle

5 5

[MinGW] [Windows] [build boost 1.57] Help required to build boost
by Abhinav Tripathi 08 Apr '15

08 Apr '15

I had submitted a GSoC application regarding developing a document library for boost and i wanted to do something regardless of the results of selection. . SO, i downloaded boost 1.57 source and tried to build it using MinGW compiler that i downloaded with CodeBlocks IDE which i use. When i ran : bootstrap.bat gcc I got error "Failed to build Boost.Build Engine". . The bootstrap.log file was : ### ### Using 'gcc' toolset. ### E:\Prog Stuff\boost_1_57_0\tools\build\src\engine>if exist bootstrap rd /S /Q bootstrap E:\Prog Stuff\boost_1_57_0\tools\build\src\engine>md bootstrap E:\Prog Stuff\boost_1_57_0\tools\build\src\engine>gcc -DNT -o bootstrap\jam0.exe command.c compile.c constants.c debug.c execcmd.c execnt.c filent.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 pathnt.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 md5.c class.c cwd.c w32_getreg.c native.c modules/set.c modules/path.c modules/regex.c modules/property-set.c modules/sequence.c modules/order.c E:\Prog Stuff\boost_1_57_0\tools\build\src\engine>.\bootstrap\jam0 -f build.jam --toolset=gcc "--toolset-root= " clean ...found 1 target... ...updating 1 target... ...updated 1 target... E:\Prog Stuff\boost_1_57_0\tools\build\src\engine>.\bootstrap\jam0 -f build.jam --toolset=gcc "--toolset-root= " ...found 159 targets... ...updating 3 targets... [MKDIR] bin.ntx86 'C:\Users\Abhinav' is not recognized as an internal or external command, operable program or batch file. md "bin.ntx86" ...failed [MKDIR] bin.ntx86... ...skipped b2.exe for lack of bin.ntx86... ...skipped bjam.exe for lack of b2.exe... ...failed updating 1 target... ...skipped 2 targets... . . I am NOT any expert but as far as i can guess, it tried to execute "C:\Users\Abhinav" which ofcourse is NOT any valid command... . How can i build boost? Is there a way to use it without actually building the source? Please help! . Regards, Abhinav

2 2

Is boost.python dead?
by Mikhail Matrosov 08 Apr '15

08 Apr '15

Hello, I made a pull request for boost.python: https://github.com/boostorg/python/pull/15 Two weeks passed since then and I had no reaction still. Did I do something wrong? I see no pulse for the project. Is it alive? Is there a way to find out its status? The last meaningful commit is dated back to 7 Dec 2012. ----- Best regards, Mikhail Matrosov

5 7

[flat_map] Any interest in a flat_map variant that is much faster on insertion/erase at the price of a slower lookup?
by Giacomo Drago 08 Apr '15

08 Apr '15

Hi My library is not ready for a formal review process, and I'd like to ask whether there is some potential interest first, thus saving everybody a lot of time. I have been working on a flat_map (http://www.boost.org/doc/libs/1_57_0/doc/html/boost/container/flat_map.html) variant that keeps some of the distinctive features of the original one (contiguous storage/cache friendliness, zero memory overhead/shrink_to_fit support, vector-based representation, etc...) but makes insertion and erasure of the elements much faster, at the price of a slower lookup and in-order traversal. Explaining how it works requires time and it's not really necessary if there is no interest in the first place (e.g. "thanks, but we have no use for this"). Let's get straight to the benchmarks and to some conclusions. #elems: 50000 std::map: Random insertion: 18.605 ms Random find: 24.382 ms Iteration: 5.658 ms Random erase: 37.166 ms experimental::flat_map: Random insertion: 400.141 ms Random find: 12.352 ms Iteration: 7.099 ms Random erase: 467.051 ms boost::container::flat_map: Random insertion: 611.678 ms Random find: 6.293 ms Iteration: 0.038 ms Random erase: 615.311 ms #elems: 200000 std::map: Random insertion: 146.394 ms Random find: 163.506 ms Iteration: 21.973 ms Random erase: 225.314 ms experimental::flat_map: Random insertion: 5068.93 ms Random find: 65.618 ms Iteration: 34.244 ms Random erase: 6851.09 ms boost::container::flat_map: Random insertion: 10696.9 ms Random find: 43.896 ms Iteration: 0.254 ms Random erase: 10604 ms Of course one doesn't expect the random insertion to have a performance that is comparable to the one of a tree-based map, like std::map. However, my experimental::flat_map provides a better trade-off than boost's flat_map for me, as random insertion is massively faster and in the big picture of the application I am developing this is making a hell of a difference. Am I making any sense? Shall I polish the implementation, publish it, and submit a proposal? I'd really appreciate your feedback. Kind Regards Giacomo

8 37

1.58.0 rc2 is now available
by Marshall Clow 07 Apr '15

07 Apr '15

Release candidate files for 1.58.0 are available at: http://boost.cowic.de/rc/ Since rc1, the changes that were causing the serialization libraries to fail to build on MSVC have been reverted. 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: MD5 (boost_1_58_0_rc2.7z) = 43e0d47cc9f5f2a07761808b9da57c0a MD5 (boost_1_58_0_rc2.tar.bz2) = 52147381c97685eb045b5b022ad51a35 MD5 (boost_1_58_0_rc2.tar.gz) = cb33afaa557dea2f700bffec8a91d87e MD5 (boost_1_58_0_rc2.zip) = 412676a9a7d9903eb5a260209ad78f0a Thanks! -- The release managers P.S. Release notes are here: http://www.boost.org/users/history/version_1_58_0.html

6 5

Re: [boost] [SORT] Parallel Algorithms
by Francisco José Tapia 07 Apr '15

07 Apr '15

Hi , In the file of this link, in my dropbox space, you have the code, the test programs and the benchmarks with GCC. https://dl.dropboxusercontent.com/u/8437476/works/sort/Sort_V0.1.7z *FILE DESCRIPTION* In the root folder of the file you have a INSTRUCTIONS.txt file detailing the content of all the folders of the file, information for to compile the programs, where is each file, and which options and libraries you must link. *Test* Contains the test programs of each class and algorithms. *Src* Contains the source code of all. In the folder *src/boost/sort* there is a file *algorithm.hpp*, which is the only include file needed for invoke the algorithms. The parallel algorithms have a parameter of the NThread type which indicate the number of threads to use. By default use the same number than the HW threads of the machine. it's a very simple structure defined in boost/sort/util/atomic.hpp. *Benchmarks* In this folder are the benchmark code with GCC compiler under Linux x64. In the future I will add benchmarks with other compiler and Operating Systems. The folders *cpp-TimSort-master*, and *parallel_stable_sort* have the C++ code of the TimSort algorithm, found in https://travis-ci.org/gfx/cpp-TimSort, and the code of the sample sort with TBB. The code had been modified, due to the four versions use the same name space and many common names, and was not possible invoke the four versions in the same program. The modification put each version in a different name space. In the folder *GCC*, you can find 3 folders - *algorithm* : Have the code of the benchmark programs - *bin *: have the compiled and static linked version of the benchmark programs. In this folder you have a shell run.sh which run sequentially the programs and collect the results obtained in .txt files with the same name than the program - *Results *: in this folder you can find the result generated by the benchmark programs on different machines. Each machine have a folder where you can find the text files with the same name than the programs with the results, and a description.txt file with the description of the HW where run the benchmarks. The format used in this folder is the suggested for to present the results of all the machines used in the test. Here you have the result of my two computers, and can have a first idea about the results expected in other machines. The benchmarks, like in the old version, have a version with 64 bits numbers, and a version with objects of several sizes. About the memory used for of the algorithms. If you consider M the memory used by the data, the total memory used by the algorithms are : - GCC sort → M - boost sort → M - GCC parallel_sort → M - boost parallel_sort → M - TBB parallel_sort → M - GCC stable_sort → 2 M - boost stable_sort → 1.5 M - TimSort -> 2M - GCC parallel_stable_sort → 2.5 M - TBB parallel_sort → 2 M - boost sample_sort → 2 M - boost parallel_stable_sort → 1.5 M The algorithms use the indirect version when the size of the objects is greater than 128 bytes. I am speaking with several friends, for to run the benchmarks in more powerful machines. I think, the first is to check the speed. If the speed is good, we have something useful , if not, we must decide what must do with this. If something is useful , or we must leave all. If we decide continue, the next steps to do are : Reorganize the benchmark, and include benchmarks with string objects. Your idea about the use of files, I thing is the correct way to follow Finish all the documentation of the code for to generate a Doxygen documentation Generate the web pages of documentation for the Boost project Modify the test programs for to do according the bjam files If you found any problem , error or doubt, please , contact me for to resolve Francisco

7 16

[align] Conflicts during git pull
by Andrey Semashev 06 Apr '15

06 Apr '15

Hi, When updating my local copy 'git pull' failed on Boost.Align with the following error: git pull Auto-merging test/is_aligned_test.cpp CONFLICT (add/add): Merge conflict in test/is_aligned_test.cpp Auto-merging test/aligned_delete_test.cpp CONFLICT (add/add): Merge conflict in test/aligned_delete_test.cpp Auto-merging test/aligned_allocator_test.cpp CONFLICT (add/add): Merge conflict in test/aligned_allocator_test.cpp Auto-merging test/aligned_allocator_adaptor_test.cpp CONFLICT (add/add): Merge conflict in test/aligned_allocator_adaptor_test.cpp Auto-merging test/aligned_alloc_test.cpp CONFLICT (add/add): Merge conflict in test/aligned_alloc_test.cpp Auto-merging test/align_test.cpp CONFLICT (add/add): Merge conflict in test/align_test.cpp Auto-merging test/Jamfile.v2 CONFLICT (add/add): Merge conflict in test/Jamfile.v2 Auto-merging meta/libraries.json CONFLICT (add/add): Merge conflict in meta/libraries.json Auto-merging index.html CONFLICT (add/add): Merge conflict in index.html Auto-merging include/boost/align/is_aligned.hpp CONFLICT (add/add): Merge conflict in include/boost/align/is_aligned.hpp Auto-merging include/boost/align/detail/max_count_of.hpp CONFLICT (add/add): Merge conflict in include/boost/align/detail/max_count_of.hpp Auto-merging include/boost/align/detail/max_align.hpp CONFLICT (add/add): Merge conflict in include/boost/align/detail/max_align.hpp Auto-merging include/boost/align/detail/is_alignment.hpp CONFLICT (add/add): Merge conflict in include/boost/align/detail/is_alignment.hpp Auto-merging include/boost/align/detail/is_aligned.hpp CONFLICT (add/add): Merge conflict in include/boost/align/detail/is_aligned.hpp Auto-merging include/boost/align/detail/alignment_of.hpp CONFLICT (add/add): Merge conflict in include/boost/align/detail/alignment_of.hpp Auto-merging include/boost/align/detail/aligned_alloc_sunos.hpp CONFLICT (add/add): Merge conflict in include/boost/align/detail/aligned_alloc_sunos.hpp Auto-merging include/boost/align/detail/aligned_alloc_posix.hpp CONFLICT (add/add): Merge conflict in include/boost/align/detail/aligned_alloc_posix.hpp Auto-merging include/boost/align/detail/aligned_alloc_msvc.hpp CONFLICT (add/add): Merge conflict in include/boost/align/detail/aligned_alloc_msvc.hpp Auto-merging include/boost/align/detail/aligned_alloc_macos.hpp CONFLICT (add/add): Merge conflict in include/boost/align/detail/aligned_alloc_macos.hpp Auto-merging include/boost/align/detail/aligned_alloc_android.hpp CONFLICT (add/add): Merge conflict in include/boost/align/detail/aligned_alloc_android.hpp Auto-merging include/boost/align/detail/aligned_alloc.hpp CONFLICT (add/add): Merge conflict in include/boost/align/detail/aligned_alloc.hpp Auto-merging include/boost/align/detail/align_cxx11.hpp CONFLICT (add/add): Merge conflict in include/boost/align/detail/align_cxx11.hpp Auto-merging include/boost/align/detail/align.hpp CONFLICT (add/add): Merge conflict in include/boost/align/detail/align.hpp Auto-merging include/boost/align/detail/addressof.hpp CONFLICT (add/add): Merge conflict in include/boost/align/detail/addressof.hpp Auto-merging include/boost/align/detail/address.hpp CONFLICT (add/add): Merge conflict in include/boost/align/detail/address.hpp Auto-merging include/boost/align/aligned_delete_forward.hpp CONFLICT (add/add): Merge conflict in include/boost/align/aligned_delete_forward.hpp Auto-merging include/boost/align/aligned_delete.hpp CONFLICT (add/add): Merge conflict in include/boost/align/aligned_delete.hpp Auto-merging include/boost/align/aligned_allocator_forward.hpp CONFLICT (add/add): Merge conflict in include/boost/align/aligned_allocator_forward.hpp Auto-merging include/boost/align/aligned_allocator_adaptor_forward.hpp CONFLICT (add/add): Merge conflict in include/boost/align/aligned_allocator_adaptor_forward.hpp Auto-merging include/boost/align/aligned_allocator_adaptor.hpp CONFLICT (add/add): Merge conflict in include/boost/align/aligned_allocator_adaptor.hpp Auto-merging include/boost/align/aligned_allocator.hpp CONFLICT (add/add): Merge conflict in include/boost/align/aligned_allocator.hpp Auto-merging include/boost/align/aligned_alloc.hpp CONFLICT (add/add): Merge conflict in include/boost/align/aligned_alloc.hpp Auto-merging include/boost/align/align.hpp CONFLICT (add/add): Merge conflict in include/boost/align/align.hpp Auto-merging include/boost/align.hpp CONFLICT (add/add): Merge conflict in include/boost/align.hpp Auto-merging example/make_aligned.hpp CONFLICT (add/add): Merge conflict in example/make_aligned.hpp Auto-merging example/aligned_vector.hpp CONFLICT (add/add): Merge conflict in example/aligned_vector.hpp Auto-merging example/aligned_ptr.hpp CONFLICT (add/add): Merge conflict in example/aligned_ptr.hpp Auto-merging doc/align.qbk CONFLICT (add/add): Merge conflict in doc/align.qbk Auto-merging doc/Jamfile.v2 CONFLICT (add/add): Merge conflict in doc/Jamfile.v2 Auto-merging README.md CONFLICT (add/add): Merge conflict in README.md Automatic merge failed; fix conflicts and then commit the result. This is on the master branch. I didn't modify my local copy of Boost.Align, so there must have been some weird change upstream that cannot be merged automatically. Does anyone know why this happens? For now I just reset my local branch to be equal to the remote master, but this kind of problem happened before and it breaks my update scripts.

2 1

Call for Papers for Meeting C++ 2015 ends on Wednesday
by Jens Weller 05 Apr '15

05 Apr '15

Hello Boost & Qt Community, the call for papers for this years Meeting C++ Conference got extended and ends on Wednesday(April 8th) next week! Especially talks about libraries have still a good chance to get voted into the conference, and also the embedded theme track! CfP announcement: http://meetingcpp.com/index.php/newsreader/items/call-for-papers-for-meetin… The voting will begin shortly after the end of the CfP and run ~10 days, this will give me guidance to select the right talks for this years conference! thanks, Jens Weller

1 0

Equivalent of boost-commits?
by Steven Watanabe 05 Apr '15

05 Apr '15

AMDG I used to subscribe to boost-commits under svn. I couldn't find any way to set this up under github. Also, does anyone know how to subscribe to all repositories, without having to handle each repository individually? In Christ, Steven Watanabe

1 0

Messages from list marked as spam
by Olaf van der Spek 03 Apr '15

03 Apr '15

Hi, Email from certain people on the list is marked as spam by gmail: "Why is this message in Spam? It has a from address in teamviewer.com but has failed teamviewer.com's required tests for authentication. " Is there a problem with the setup of this mailing list? -- Olaf

9 15

[sync] Needs a 'master' branch
by Edward Diener 03 Apr '15

03 Apr '15

I created a Github issue that the sync library needs a 'master' branch, even if its just the current 'develop' branch. Please let's get this done. It is more than just irritating that: git submodule foreach --recursive git checkoout master stops and fails because a Boost library does not have a 'master' branch.

2 1

[where to start][got work for me?][newbee][can I help with something?]
by vivek dhiman 03 Apr '15

03 Apr '15

Hello all So I am not sure what's gonna happen to my GSoC application. But as this is my last sem(probably last chance to learn), I guess I can start doing some work anyways. May be 1 to 2 hours per weekday and 3-4 during the weekends. Is there some work that someone wants me to do? I am new to this. So I actually have no idea how to ask/start. But I am happy to be involved. Sorry if it is considered as spam. I am ready to learn and make mistakes. Thanks Vivek

2 1

[VS++ 2015 CTP 6] [build] Workaround for Visual Studio 2015 CTP 6 Preview breaking Boost.Build
by Beman Dawes 02 Apr '15

02 Apr '15

If you have previously been running Boost.Build on toolset=msvc-14.0 (Visual Studio 2015 Preview), installing CTP 6 causes some bjam/b2 builds to fail because of missing include files. What's happening is that Boost.Build caches several files in C:\Users\<name>\AppData\Local\Temp. For my installation these files are: b2_msvc_14.0_vcvarsall_x86.cmd b2_msvc_14.0_vcvarsall_x86_amd64.cmd b2_msvc_14.0_vcvarsall_x86_arm.cmd but the introduction of the new universal runtime stuff in CTP 6 added some additional paths to vcvarsall, so the cached files are no longer correct. The workaround is to simply delete the b2_msvc_14.0_vcvarsall* temporary files. The next time bjam/b2 is run correct versions of the files will be regenerated. --Beman

1 0

[rational] Can the community maintenance team and/or rational users please review some pull requests?
by John Maddock 02 Apr '15

02 Apr '15

I have a bunch of PR's against Rational, which of course is basically unmaintained. I'd be grateful if a second pair of eyes (at least) could take a look before I start agitating for someone to merge them ;) Each of the four, builds on the previous one(s). Three are basically trivial: https://github.com/boostorg/rational/pull/1/files https://github.com/boostorg/rational/pull/2/files https://github.com/boostorg/rational/pull/3/files The final one is much more complex, and disables "accidental" conversion from float to rational (which otherwise proceeds via truncation to integer first). As you can see from the commit history, I've had quite a few attempts at getting the final one correct. I believe it is now, doesn't break anything in Boost except, as noted in the discussion, Boost.Geometry, which relies on an unsafe float to rational conversion - Geometry's authors are aware of the issue here: https://github.com/boostorg/geometry/commit/c992eb61e8ef9e90fdae403ac6ff1ee…. So.... I'm interested in both eyeball-look-throughs from seasoned Boosters, but also feedback from Rational's users, and verification that it doesn't break end user code - other than unsafe conversions of course. If you just want the updated header to test, you can grab it from here: https://raw.githubusercontent.com/jzmaddock/rational/no-float-convert/inclu… Many thanks! John.

5 8

MPL and MPL core
by Edward Diener 02 Apr '15

02 Apr '15

Were the changes to MPL splitting it between a core and the rest of MPL supposed to be part of the upcoming release ? Because looking at MPL the 'master' branch is at the previous 1.57 release and there have been quite a number of changes to the 'develop' branch since then, much of it relating to the mpl/core split. The 'develop' regression tests for MPL look pretty green. I would like to get bruno Dutra's fix for MPL arity into the coming release as it has been thoroughly tested on 'develop', but I do not know whether or not all the other MPL 'develop' changes should go in 'master' although I suspect not.

11 20

questions regarding GCC visibility
by Robert Ramey 02 Apr '15

02 Apr '15

I made a few changes to simplify code in the serialization library. This entailed eliminating support for borland compilers, workarounds for compilers which fail to support partial specialization of template function and some general clean up. In the course of this effort, I had occasion to simplify the code which supports Auto linking - and by extension visibility. Things seemed to go pretty well. Feeling frisky, I added the switch -fvisibility=hidden to the gcc compile of library. Now applications won't link for lack of certain symbols. Well, they link and run fin on my machine here at home- but fail in the test matrix. http://www.boost.org/development/tests/develop/developer/output/Debian-Sid-… Funny thing is: doesn't seem to be a problem on my machine doesn't seem to occur with all exported symbols - only select ones - often but not always desctructors I can switch Jamfile back so it doesn't specify -fvisibility=hidden, but it seems that I'm really close to being able to generate a smaller, cleaner DLL which I would prefer to do. Any constructive suggestions would be appreciated. On a related note, it seems to me that http://www.boost.org/development/separate_compilation.html should be updated to explain BOOST_SYMBOL_EXPORT and BOOST_SYMBOL_IMPORT which are convenient for simplifying the auto-linking and visibility functionality. Robert Ramey -- View this message in context: http://boost.2283326.n4.nabble.com/questions-regarding-GCC-visibility-tp467… Sent from the Boost - Dev mailing list archive at Nabble.com.

5 10

Boost 1.58.0rc1 release delayed
by Marshall Clow 01 Apr '15

01 Apr '15

Due to some problems in Boost.Test, and some unexpected doctor's visits (which delayed said problems getting fixed), the boost 1.58.0rc1 scheduled for today has been delayed until Friday. As a result, the "master" branch in git is still open for bug fixes (if they have been successfully tested on develop) and documentation fixes until 11:59 PM PDT Thursday night (4/2). Sorry for the delay. -- Marshall

2 1

what happened to the "tools/regression" directory - and the stuff in it?
by Robert Ramey 01 Apr '15

01 Apr '15

The tools in the tools/regression directory are critical to the testing of the serialization library on one's local machine. What happened to these. Robert Ramey -- View this message in context: http://boost.2283326.n4.nabble.com/what-happened-to-the-tools-regression-di… Sent from the Boost - Dev mailing list archive at Nabble.com.

9 26

[boostorg/regression] Build instructions updated for developers local test reporting
by Beman Dawes 01 Apr '15

01 Apr '15

A README file has been added and index.html updated to aid developers wishing to use these tools for local testing. While these tools are not worthwhile for a small number of tests run against a single variant of a single compiler, they are invaluable for large test matrices. See develop branch at https://github.com/boostorg/regression HTH, --Beman

2 1

Test message testing gsoc-admin@boost.org, please ignore
by Niall Douglas 01 Apr '15

01 Apr '15

Second attempt at getting this to work ... --- Boost C++ Libraries Google Summer of Code 2015 admin https://svn.boost.org/trac/boost/wiki/SoC2015

1 0

[log] [asio] Conflicting default configs
by Andrey Semashev 01 Apr '15

01 Apr '15

Hi, In Boost.Log I'm using Boost.ASIO to implement network-based syslog backend. Boost.ASIO is used in the compiled part of Boost.Log and, obviously, can be used in the user's code as well. By default Boost.ASIO is header-only, so we basically have a copy of Boost.ASIO in Boost.Log and another copy in the user's app. In Boost.Log I have the option to enable compiler-based TLS at the library build stage (BOOST_LOG_USE_COMPILER_TLS macro), which is by default not enabled. In Boost.ASIO there is a similar option (BOOST_ASIO_DISABLE_THREAD_KEYWORD_EXTENSION macro) but the feature is enabled by default. I want Boost.Log built libraries to actually respect the BOOST_LOG_USE_COMPILER_TLS option, so I define BOOST_ASIO_DISABLE_THREAD_KEYWORD_EXTENSION internally when BOOST_LOG_USE_COMPILER_TLS is not defined. The problem is that Boost.ASIO changes implementation in an incompatible way when BOOST_ASIO_DISABLE_THREAD_KEYWORD_EXTENSION is defined. It is further worsened by a recent change that makes all of Boost.ASIO symbols externally visible. Basically, this means hard to debug trouble on user's end, when different versions of Boost.ASIO (one from Boost.Log binaries and the other used by the user's code directly) are used at the same time. I'd like to ask community what is the preferred resolution of this situation (and possibly similar ones in the future). I can see several ways of tackling this: 1. Introduce an inline ABI namespace in Boost.ASIO, much like the one I have in Boost.Log. The namespace name would depend on BOOST_ASIO_DISABLE_THREAD_KEYWORD_EXTENSION and other macros that affect binary compatibility. This would be my preferred solution, although I'm not sure how fast and easy it can be implemented. 2. Remove symbol visibility enforcement from Boost.ASIO, or at least make it optional. That way I could encapsulate my private copy of Boost.ASIO in Boost.Log binaries. 3. Change the defaults, either in Boost.Log or in Boost.ASIO, so that they are aligned by default. When the user changes Boost.Log config he would be expected to know that Boost.ASIO config also needs to be changed accordingly. If he doesn't, Boost.Log is still built consistently with its own config. Note, however, that since Boost.Log is a built library and in most distributions it is built with default options, the choice for Boost.Log is more significant and because of that should probably be more conservative. 4. Same as 3 but also remove the enforcement of Boost.ASIO config by Boost.Log. Whenever the user wants to change the default, he would have to define macros for the both libraries, otherwise Boost.Log can be built inconsistently. 5. Do not change the defaults but remove the config enforcement. BOOST_LOG_USE_COMPILER_TLS becomes Boost.Log-local and as such does not guarantee that the resulting binaries do not in fact use compiler-based TLS. Users can get surprised. 6. Do not change anything, let the users suffer because of ODR issues. Maybe document this somewhere... Opinions?

5 11

[serialization][release][teeks99] All MSVC tests for Boost.Serialization failing?
by Joaquín M Lopez Munoz 31 Mar '15

31 Mar '15

Hi All teeks99-* regression tests for Boost.Serialization in MSVC compilers appear as failing, yet when one clicks on any the information seems to indicate nothing went wrong: http://tinyurl.com/nf5bd9a Any clue? Thank you Joaquín M López Muñoz Telefónica

3 4

Transferring a library on Github
by Edward Diener 31 Mar '15

31 Mar '15

In order to get VMD under boostorg in order to begin the process of integrating the library into Boost for the release after the current pending one I tried to transfer the library as explained on the page https://svn.boost.org/trac/boost/wiki/NewLibFromGit. But I do not have the necessary admin rights for boostorg. How do I proceed ? I want to get VMD under boostorg and then do whatever is necessary to add it to the superproject and have it part of for regression testing.

2 4

[detail] Bug in is_postfix_incrementable
by Edward Diener 31 Mar '15

31 Mar '15

There is a rather bad bug in is_postfix_incrementable in the detail/is_incrementable.hpp header file. I noticed this when I was looking at how I can remove the dependncies in is_incrementable.hpp on the deprecated Type_traits header files in Version2 of type_traits. The bug looks totally obvious to me. It's that the is_postfix_incrementable metafunction is derived from the is_incrementable_::impl<T> implementation rather than the is_incrementable_::postfix_impl<T> implementation. I am sure this was just a copy-paste problem but evidently has been in the header file from the beginning. Can we fast forward the simple fix to the new release ? I posted this just to be sure I haven't missed anything in the file. I believe that only the iterator library currently uses the is_incrementable and is_postfix_incrementable metafunctions in its tests. Since it is Boost detail no end-user should be using it. Still we should have it correct, shouldn't we, in our release ?

1 0

Conflicts when building libraries at root
by Peter Dimov 31 Mar '15

31 Mar '15

On Windows, at least, when I do ./b2 toolset=msvc-8.0 at Boost root, I get error: Name clash for '<pstage\lib>libboost_system-vc80-mt-gd-1_58.lib' error: error: Tried to build the target twice, with property sets having error: these incompatible properties: error: error: - <warnings>all error: - <address-model>32 <architecture>x86 <warnings>on When I add --without-context --without-coroutine, I now get error: Name clash for '<pstage\lib>libboost_system-vc80-mt-1_58.lib' error: error: Tried to build the target twice, with property sets having error: these incompatible properties: error: error: - <asynch-exceptions>off error: - <asynch-exceptions>on So I add --without-test. error: Name clash for '<pstage\lib>libboost_timer-vc80-mt-1_58.lib' error: error: Tried to build the target twice, with property sets having error: these incompatible properties: error: error: - <asynch-exceptions>on <library>object(file-target)@10959 error: - <asynch-exceptions>off <library>object(file-target)@9953 Now where did _that_ come from. :-) Ah. --without-endian. Builds now. This is perhaps old news for some, but it looks like it doesn't play well with our simple build instructions. Or maybe it doesn't occur on the master branch, so we don't care? I haven't checked yet. It's also perhaps an indication of a deeper problem. I can use b2 --with-test and have 'test' built; it builds its dependencies (system, chrono and timer) with <asynch-exceptions>on in bin.v2, and if I use it from within Boost.Build, it will link to them. But if I stage (or install) Boost.Test, and then stage or install Boost.System separately, Boost.System will be built with <asynch-exceptions>off. So the library user who just has headers and binaries will link those, potentially creating a conflict, which may in this case be benign. Or not.

12 55

[Container] const boost::container::vector is mutable??
by Eric Niebler 31 Mar '15

31 Mar '15

Why are the elements of a const boost::vector mutable through its const_iterator? #include <boost/container/vector.hpp> int main() { using C = boost::container::vector<int>; C c{1,2,3,4}; C const & r = c; r[0] = 42; // Error, good. *r.begin() = 42; // Compiles! huh?? } -- Eric Niebler Boost.org http://www.boost.org

2 3

how to contact iterator developers
by Claas H. Koehler 31 Mar '15

31 Mar '15

Hi! About a week ago I sent a question about a specific bug to the iterator developers via this list and haven't received any feedback yet. Is this list not the right place to ask such questions or are there currently no active iterator developers managing the project ? Regards Claas

3 3

Release deadlines
by Marshall Clow 30 Mar '15

30 Mar '15

Just a reminder that we’re coming up on a release; and if you have changes that you want to see in the release (I know *I* do), you should get them in ASAP. Check them into develop, and then, once the tests have cycled successfully, merge them to master. Please do not merge anything to master w/o permission from the release managers after the start of April (11:59 PM next Tuesday PDT). Also, if you know of problems with the current state of the master branch that would preclude releasing it, please let us know (preferably *before* next Wednesday). Thanks for your help with the releases. — Marshall & the rest of the release managers.

7 9

[serialization] Passing literals to oarchive
by Bjorn Reese 30 Mar '15

30 Mar '15

Currently we cannot pass literals directly to an oarchive like this: oarchive << 42; since compilation fails in interface_oarchive.hpp, as the operator<< only takes parameters by reference. We can remedy this by changing operator<< to take the parameter by const-ref instead, as show below. Is there any reason not to do this? --- a/include/boost/archive/detail/interface_oarchive.hpp +++ b/include/boost/archive/detail/interface_oarchive.hpp @@ -59,7 +59,7 @@ public: } template<class T> - Archive & operator<<(T & t){ + Archive & operator<<(const T & t){ this->This()->save_override(t, 0); return * this->This(); }

3 9

[mpl] Is BOOST_MPL_PP_TOKEN_EQUAL publicly usable ?
by Damien Buhl 30 Mar '15

30 Mar '15

Dear Boost.MPL developers, I was coming up to something really similar to BOOST_MPL_PP_TOKEN_EQUAL ( http://www.boost.org/doc/libs/1_57_0/boost/mpl/aux_/preprocessor/token_equa… ) in Boost.Fusion to fix warnings that my changes generate in MSVC 8 ( As discussed on this list as *[boost] MSVC warnings for BOOST_PP_IS_EMPTY in Boost.Phoenix* ) Instead of having a second implementation of the same macro within Boost.Fusion, is it ok if I use BOOST_MPL_PP_TOKEN_EQUAL from MPL ? I'm asking this because it isn't documented anywhere and is in mpl/include/boost/mpl/aux_/preprocessor/token_equal.hpp which sounds like a private header. Possibly there are reasons for not being documented ? Cheers, -- Damien Buhl

2 2

Re: [boost] [Locale] Boost.Locale cannot Run in Visual Studio 2010
by Artyom Beilis 30 Mar '15

30 Mar '15

> >I have been trying to learn Boost.Locale Module. Consider this >http://www.boost.org/doc/libs/1_55_0/libs/locale/doc/html/conversions_8cpp-… >example. The code gets successfully compiled but when I try to run it, it >gives the error > >Unhandled exception at 0x74d34b32 in LearningCPP.exe: Microsoft C++ >exception: std::bad_cast at memory location 0x00a6fa48.. > >I have attached the stack-trace of the program also. Here it is: > > [snip] > > Did anyone faced this issue when using Boost.Locale in Visual Studio 2010? > If so, how do I resolve this issue? 1. Do you use latest version of MSVC or public beta (there was facet related bug there)2. Make sure you don't mix debug and release code (which can be very likely stuff there) on both boost and its dependencies (icu if you use one) Artyom Beilis -------------- CppCMS - C++ Web Framework: http://cppcms.com/ CppDB - C++ SQL Connectivity: http://cppcms.com/sql/cppdb/

2 1

[GSOC] Request for proposal review and feedback
by Divyansh Gupta 30 Mar '15

30 Mar '15

Hi BOOST, I had submitted my proposal for the enhanced vector and deque project on 17th March, but I haven't received any comments yet. It would be great if I could get some feedback on the proposal, so that I can make any necessary changes while that's allowed. Thanks a lot. Regards, Divyansh Gupta PS- Here's the link to the proposal: https://www.google-melange.com/gsoc/proposal/review/student/google/gsoc2015…

1 0

[thread] Alternate future implementation and future islands.
by Giovanni Piero Deretta 29 Mar '15

29 Mar '15

[cc'ing a few of the participants of the old thread] Hi All, Back in January, there was an interesting long thread about the problem of interoperation between futures of different libraries and the ability wait for heterogeneous futures. Different solutions were discussed like standardizing the future shared state or having an unified kernel wait object. I just wanted to share my attempt on a solution on the problem. The code can be found at https://github.com/gpderetta/libtask/blob/master/future.hpp (other interesting files are shared_future.hpp event.hpp and tests/future_test.cpp). It is an implementation a subset of the current boost and std future interface. In particular it has promise, future, shared_future, future::then, wait_any, wait_all. Most important missing piece are timed waits (for lack of, ahem, time, but should be easy to implement). The implementation requires c++14 and is only lightly tested, it should be treated as a proof of concept, not production-ready code. A few key design points: * The wait strategy is not part of the future implementation (although a default is provided). future::get, future::wait, wait_all and wait_any are parametrized by the wait strategy. * The design aims to streamline and make as fast as possible future and promise at the cost of a slower shared_future (although there is room for improvement). * The wait strategy only deals with 'event' objects, which act as a bridge between the future and the promise. The event object is really my the core of my contribution; it can be thought of as the essence of future<void>::then; alternatively it can be seen as a pure user space synchronization primitive. Other features of this implementation: * Other than in the blocking strategy itself, the future and promise implementation have no sources of blocking (no mutexes, not even spin locks). * The shared state is not reference counted. To demonstrate the generality of the waiting concept, I have implemented a few waiter objects. * cv_waiter: this is simply a waiter on top of an std::mutex + cond var. * futex_waiter (linux): an atomic counter + a futex, possibly more efficient than the cv_waiter * sem_waiter (posix): a waiter implemented on top of a posix semaphore. More portable than the futex waiter and possibly more efficient than the cv_waiter * fd_waiter(linux, possibly posix): a waiter implemented on top of linux eventfd (for portability it can also be implemented on top of a pipe); you can use select with futures! * task_waiter: a completely userspace based coroutine waiter which switches to another coroutine on wait and resumes the original coroutine on signal. * scheduler_waiter: another coroutine based waiter, but on top of an userspace task scheduler. On wait switch to the next ready task, on signal enqueue the waiting task to the back of the ready queue. I know that there is a plan to reimplement a new version of boost::threads, hopefully this implementation can contribute a few ideas. HTH, -- gpd

4 18

[vmd] Updated VMD library
by Edward Diener 28 Mar '15

28 Mar '15

I have updated the VMD library which has been accepted into Boost based on the reviews and comments of others. The macro interfaces have been simplified and redesigned for easier use and the documentation has been updated to provide more examples and samples of using VMD in code. The library is currently at https://github.com/eldiener/variadic_macro_data. The latest library code is now on the 'master' branch and the code that was reviewed is on the 'Version17' branch. The VMD library is a library of variadic macros which enhance the functionality in the Boost preprocessor library ( Boost PP ). The main focus of the library is the parsing/identifying of a subset of C++ preprocessor data types and of all Boost PP data types. This allows enhanced preprocessor metaprogramming based on the type of macro input. The library has been successfully tested on gcc 4.3.0 on up, VC++ 8 on up, clang 3.3 on up, and Intel 12.1 on up. The library has been tested on Windows and Linux. Comments, questions, bug reports are welcome.

1 0

sun toolset buggy and outdated?
by John Maddock 28 Mar '15

28 Mar '15

I'm trying to test the new Oracle-solaris compiler but I'm running into Boost.Build issues. First off what looks like a bug, if I build with with b2 stdlib=native Then I *still* get stlport You can easily reproduce this on another platform with: cd libs/config/test ../../../b2 config_info toolset=sun stdlib=native -n -d2 which yields: sun.compile.c++ ..\..\..\bin.v2\libs\config\test\config_info.test\sun\debug\stdlib-sun-stlport\config_info.obj "CC" +d -library=stlport4 -g -erroff=%none -KPIC -DBOOST_ALL_NO_LIB=1 -I"..\..\.." -c -o "..\..\..\bin.v2\libs\config\test\config_info.test\sun\debug\stdlib-sun-stlport\config_info.obj" "config_info.cpp" Now for the outdated part: the oracle compiler (12.4) now supports three std lib options: 1) The default - I can't make this work in C++03 mode, but it's the only option that does work in C++11 mode (where it appears to be a recent GNU libstdc++ version). 2) STLPort - only works in C++03 mode. 3) Apache - only works in C++03 mode. So ideally we would probably have: stdlib=stlport, sets -library=stlport4 for both compile and link. stdlib=apache, sets -library=stdcxx4 for both compile and link stdlib=native, sets -std=c++11 for both compile and link. And yes I realise we're mixing up two different features here, but as they can't be mixed and matched anyway it at least gets things working. I guess the toolset should be renamed either "oracle" or "solaris" as well? If anyone has any ideas how to patch the toolset, I have a working virtual machine to test on (or you can do as I did and download a pre-build VirtualBox machine). Thanks in advance, John.

5 13

[gsoc15] Please help rank GSoC 2015 student projects
by Niall Douglas 27 Mar '15

27 Mar '15

Dear Boost Community, The Google Summer of Code 2015 proposals for Boost are in, and we would deeply appreciate the community's help in ranking the proposals according to merit before the 6th of April. To vote, the process is easy: 1. Go to this page https://www.google-melange.com/gsoc/homepage/google/gsoc2015 and click the "Log in" button under Mentors and Administrators. 2. Now click "Create Profile" on the same page. Note that even if you registered last year, you must register again in 2015. Fill in the form. Note that after submitting it drops you at "Edit Profile", which is confusing. 3. Click "My Dashboard", then "Connect with organisations". 4. Choose "Boost C++ Libraries". 5. In the message box, write this: "I am a member of the Boost community and the email(s) I normally post to boost mailing lists with is <email>" filling in the email address(es) you normally use to post to boost mailing lists. This lets us verify that you are indeed a long standing member of the Boost community. 6. Once we approve your request, you will get an email with the subject "Welcome as organisation member". You can now return to the Dashboard on the GSoC website where there will be a new item "Proposals". 7. Work your way through as many of the 33 proposals as you can. You can score them using the stars at the bottom of each proposal page, taking care to read any comments by the mentors and students if present. PLEASE try to rank some of the lowest scored proposals, every year we get a lot of people who only rank the top five and don't bother with the rest. Try to score on the priority basis of: (i) ability to write quality C++, using the programming competency test or samples of programming the student supplied. (ii) proposal quality and your best estimate of the student's understanding of how best to solve the problem at hand. Bear in mind a gifted programmer with a strong work ethic but poor English may appear to not understand the problem as well as native English speakers, this is why we have asked for examples of their programming competency. (iii) if the student came early to the mailing lists to ask for help writing the proposal (the mentors who helped them with their proposals have usually indicated this in the private comments). (iv) usefulness/appropriateness of the feature or work being proposed. Remember a good GSoC is more about getting promising new engineers into Boost and C++ than necessarily getting code to pass Boost peer review in a single summer. 8. Optional: If a proposal looks especially great to you and you feel able to mentor a student this year, please slide the "wish to mentor" button. Just because a proposal already has willing mentors does NOT mean you should not add yourself - if you can substitute for an existing mentor, that may mean we use that mentor for another proposal. As you know, Google Summer of Code is usually worth $42,000 - $48,000 to Boost each year, and a successful GSoC raises our visibility and reputation in the wider open source community. Our thanks to you in advance for taking the time to vote. Niall Douglas Boris Schäling --- Boost C++ Libraries Google Summer of Code 2015 admin https://svn.boost.org/trac/boost/wiki/SoC2015

2 1

[SmartPointers] Determine interest in a new pointer wrapper class "flex_ptr"
by Jakob Riedle 27 Mar '15

27 Mar '15

Hello Boost Community, In the last few weeks, I heavily felt the lack of boost not having a more lightweight solution to a "not-necessarily-owning" pointer-wrapper than shared_ptr. shared_ptr is quite slow in the context that I need it to work. Furthermore it always is owning, even though ownership is shared in between instances. This is unhelpful, if you have an std::list of both non-owning and owning pointers. Hence, if you do not want to use shared_ptr all over your project, or especially want to interact with C, you need a not-necessarily-owning pointer-wrapper. This is why I collected some ideas on how to improve the situation. I came up with a little class named 'flex_ptr', that can hold both strong and weak references (therefore the name 'flexible', but it can also be 'the name of whatever proves itself to be good ...'). It keeps track of whether the held pointer is strong or weak. The Class doesn't need reference counting, since an Instance either is owning, or non-owning. Ownership is transferred between Instances using the default Move/Copy behavior. By Default the Constructor takes a pointer and treats it as a weak one. This is required, since this class aims on being used only at places, that are ought to be able to but not necessarily own objects. (Excuse me for the long sentence) A flex_ptr instance holding a strong pointer is created using a static non-member method named 'make_owning_flex', which accepts an rvalue pointer. As a result, it is not required to use the class at every single pointer occurrences in the project, but only at places, where the programmer wants to allow but not force strong references. The flex_ptr class is easily integrated into existing code using unique_ and shared_ptr's: One could think of - a constructor accepting a const lvalue reference unique_ptr, creating a (flex_ptr-instance holding a) weak reference, - a constructor accepting an rvalue unique_ptr, creating a strong pointer, that is owning an object it received from unique_ptr, - as well as a constructor taking a const lvalue reference shared_ptr, creating a weak pointer. Résumé: This pattern allows outright memory management, it uses less memory than shared_ptr (because no reference counting object required), therefore is faster, allows well-defined interactions similar to unique_ptr (especially at interaction with C) and thus fills a yet unclosed gap in the boost library as well as the Standard. Since this is (only) my personal opinion, I'd like to see how people feel about this 'gap' and think about this addition in the library (however the pattern may be implemented in the end). Regards, Jakob Riedle

6 10

GSoC 2015 Boost Compute Proposal
by Aditya Avinash Atluri 27 Mar '15

27 Mar '15

Hi, This is my proposal. Please suggest edits. Thank you!! :) *Personal Details:* Name: Aditya Atluri University: The George Washington University Major: Computer Engineering Degree: MS Email: adityaavinash1(a)gmail.com Homepage: adityaatluri.github.io Availability: 1. 7 days a week 2. 27 April to 28 August 3. Nothing. *Background Information:* *Educational Background:* I did my undergrad from Indian Institute of Technology, Dhanbad, India. Currently, I am pursuing my Masters at The George Washington University. The courses I have taken are, High Performance Computing, Advanced Computer Micro Architecture, Computer Graphics, Advanced Topics in Computer Graphics, VLSI Design, Low Power VLSI Design, Compiler, Machine Learning. I have did lots of projects in these courses which can be seen on my website and in my bio[1]. *Programming Background and Interests:* I am researcher, I program GPUs with IRs, writing work arounds and using a specific hardware for other applications (example, implementing ray tracing on rasterizer on GPUs, using tessellators for generating procedural textures). I wrote high productive parallel programming abstractions for GPUs[2]. I presented my work at GTC 2014. For this work, NVIDIA supported me with a couple of Tesla K40s. As CUDA, OpenGL, OpenCL, Metal, Thrust are C/C++ APIs I use C++ extensively. I also create databases on GPUs which is now in deep interest from NVIDIA, Google and MapD. I worked with Mesa, Open Source graphics drivers for Linux to build ARB_shader_atomic_counters for R600 backend. I also worked at IBM software labs, where I worked majorly on Java. *Why I opted Boost?* I use boost on daily basis as a part of PyCUDA. I write work arounds which involve some of boost libraries. The next thing I am interested in Boost is its Compute library. I have used other GPU STL style libraries but, none are as good as Compute (simple and elegant). I couldn't contribute to Compute via GSOC last year due to my CPT. I don't want to lose that chance again. This time, I want to take Boost.Compute to a whole new level. I like to program anything related to GPUs, compilers, drivers, APIs. *Interest in Boost.Compute:* As I have mentioned earlier, I am all-in for anything related to GPUs. Either graphics or compute libraries. I believe in Boost.Compute that it can be a widely used API, hence I want to make it more powerful and more useful. *Previous Work:* I work on graphics drivers on regular basis. I write loads of OpenGL compute and shader code (part of my TA job and Mesa testing on local systems). I am good at using APIs, making optimizations, less memory footage. For example, increasing the number of draw calls per second without stalling CPU, writing shaders with more ALU operations than Load/Store operations. Aligning data properly to memory width size, minimizing padding done by compilers by struct unrolling (to get exact multiple of word size). These are a few of the optimizations I do every day. I am currently working on running Metal Shading Language on Intel processors (using AVX).[3] *Plans beyond SoC*: I want to extend Compute to ARM and Qualcomm devices that support both OpenCL and ARM Neon. This brings all "compute-intense" APIs under one roof. C++ 98/03 - 03 C++ 98/14 - 03 C++ STL - 4 Boost C++ Libraries - (Knowledge: 2, Usage: 2) Git: 3 I program using Visual Studio and Xcode. Using Terminal on Linux. I am good with Doxygen. *Project Proposal:* Introduction: Boost Compute library is so far the best portable STL-like C++ library for accelerated computing leveraging the underlying parallel hardware. Boost Compute works well on OpenCL compatible desktop/notebook devices. In this project, we implement Boost Compute on mobile devices. Current mobile devices doesn’t provide good STL style abstractions that are accelerated by SIMD and OpenCL. With the introduction of Metal graphics API for iOS devices, development of compute application for non-iOS and iOS devices requires knowledge multiple skill sets. With this project, we bring all compute abstractions of different mobile devices under one roof that is, Boost.Compute. Project Goals: Make C++ extensions from Objective-C. Integrate device containers to Boost.Compute front end. Make Metal API data types visible to user through Boost.Compute. Implementing BOOST_COMPUTE_FUNCTION() to run custom kernels. Most important, implementing algorithms for Boost.Compute on iOS devices using Metal Shader Language. *Implementation:* Building Boost.Compute APIs for iOS devices. - Metal graphics APIs are used as backend to create Boost.Compute APIs in conjunction with Metal Shading Language Make C++ extensions from Objective-C. - Metal is Objective-C graphics API whereas Boost.Compute is C++ compute API. Hence a bridge between these two APIs should be made to use Compute on iOS devices. Hence, we build C++ extensions from Objective-C APIs. As C++ is also used in building iOS apps, writing Boost.Compute for iOS devices makes it easier to leverage compute performance from an iOS app. Build resource management Metal API backend for Boost.Compute - Here we develop infrastructure which make "algorithms" run on the hardware. Like, creating automated CommandQueues, CommandBuffers, Resources (buffers or textures) - As Metal APIs does not have ‘context’ related API, mapping can be done to Metal command buffer API. Some OpenCL APIs which are natively available (using in Boost.Compute) are not present in Metal API, appropriate mapping from Boost.Compute to Metal API commands will be found. Integrate device containers from Metal API to Boost.Compute front end. - Boost.Compute provide vector and array containers. These should be declared in Metal and integrated to Boost. Device containers include, device vectors, initializing vectors, moving vectors, similarly for arrays, etc., and their STL type functionality (.size(), .length()) - Implementing iterators for the containers should also be done. Make Metal API data types visible to user through Boost.Compute. - Mapping Metal data types to current Boost.Compute data types, while making them consistent with current Boost.Compute APIs. Certain new data types to Metal are being added which improve the performance and decrease memory footprint. Making these visible to the programmer and building building algorithms with them is done in this section. Implement algorithms for Boost.Compute in Metal Shading Language. - This makes the biggest challenge as Metal compute shaders support two modes of execution (fast and precise modes). Algorithms written in each mode should be iterated over to judge the best performance without losing precision for speed. Testing the existing Boost.Compute code on iOS devices and debugging for errors. - With Metal emulators not being available for Xcode, hardware testing will be done[4]. *Timeline:* The timeline is straight forward, for details check Implementation section. 27 April – 25 May: Community bonding, testing the Xcode and iOS infrastructure to find any possible build problems. Build a test run environment (iOS app) to check any other hardware/software issues in deploying Metal API code to iOS device. 25 May – 10 June: Wrap C++ Metal extensions with C++, submit patches. 10 June – 25 June: Implement data types and containers for Boost from C++ Metal APIs. Make appropriate changes to the code after getting feedback from community. Submit patches. 25 June – 3 July: Review community feedback and change patches accordingly. 3 July – 3 August: Write BUILD_COMPUTE_FUNCTION() and Boost.Compute algorithms on Metal Shading Language and integrate it to Boost.Compute Metal APIs. Submit patches. 3 August – 17 August: Write tests and debug by running them on iOS test app 17 August – 28 August: Cleaning up code and review with community. Available Hardware: iPhone 4s, 6Plus, Mac Mini. Mentor: Kyle Lutz (kyle.r.lutz(a)gmail.com) *Competency:* The project I started which creates the actual Metal API, is iaMetal (Metal for Intel processors)[3]. It does not uses Metal SL, it converts Metal SL to AVX extensions. [1]. https://github.com/adityaatluri/adityaatluri.github.co/blob/master/CV.md [2]. https://github.com/urutu/Urutu [3]. https://github.com/iaMetal/iaMetal [4]. https://devforums.apple.com/message/971605#971605 -- Regards, Aditya Avinash Atluri, Graduate Student, Electrical and Computer Engineering, The George Washington University, Washington, DC.

1 0

[asio][android][clang-x86] cannot locate symbol "___tls_get_addr"
by Dmitry Moskalchuk 27 Mar '15

27 Mar '15

As you can see at http://www.boost.org/development/tests/master/developer/asio.html, there are many fails on Android/x86, when tests are built by clang. There was ticket filed to CrystaX NDK tracker about that: https://tracker.crystax.net/issues/912. After some research, I've found reason of fails and created pull request for Boost.Asio: https://github.com/boostorg/asio/pull/17. Shortly speaking, there is intersection of several bugs - one is inability of clang to emulate thread-local variables without support from underlying runtime (gcc can do that), and second is misconfiguration in Boost.Asio headers. I've tested locally with change from https://github.com/boostorg/asio/pull/17 and all '___tls_get_addr' errors disappeared. Now I'm waiting for that pull request to be merged into upstream, but I don't see any activity in Boost.Asio repository. Is there something wrong with my pull request? It's very simple so I wonder why it not yet merged? I'd like to see it merged to the upstream (including 'master') before 1.58 release - just because this bug cause not only Boost.Asio fails, but several others libraries too. -- Dmitry Moskalchuk

2 3

[GSoC] Proposal for uBLAS
by Ganesh Prasad 27 Mar '15

27 Mar '15

Hello everybody, Here is the final draft of my proposal for GSoC'15 and I have made it public. https://www.google-melange.com/gsoc/proposal/review/student/google/gsoc2015… The same text can be found on Gist at https://gist.github.com/GnsP/72dce0ac96394f54797c Reviews are requested and welcome. Best wishes Ganesh Prasad

1 0

No automatic super project commits at the moment.
by Daniel James 27 Mar '15

27 Mar '15

Hi, Github is currently going through a DDOS attack, which is why the super project isn't getting updated for new commits. I imagine testers will also have problems running. Daniel

1 0

GSOC 2015 Proposal
by Aditya Avinash Atluri 27 Mar '15

27 Mar '15

Hi, This is my proposal for GSoC 2015. Please suggest me some edits. Thank you!! :) https://www.google-melange.com/gsoc/proposal/review/student/google/gsoc2015… -- Regards, Aditya Avinash Atluri, Graduate Student, Electrical and Computer Engineering, The George Washington University, Washington, DC.

5 4

Proposal "Enhanced vector and deque containers" project (GSoC 2015)
by Nico Hartmann 27 Mar '15

27 Mar '15

Hello everyone, as a student with quite some experience developing C++ I finally decided to participate in an open source project instead of just writing all the code for myself. To do so I chose to join the boost community in the course of this year's Google Sommer of Code. Therefore I wrote a proposal for the "enhanced vector and deque containers" project that really drew my interest. I like to invite you to take a look at my proposal as well as the requested implementation of a small vector class (including unit tests) to prove my capability to write C++ code. Thank you very much Nico project announcement: https://svn.boost.org/trac/boost/wiki/SoC2015#a5.Enhancedvectoranddequecont… project proposal (GSoC 2015): https://www.google-melange.com/gsoc/proposal/review/student/google/gsoc2015… small vector class implementation on github: https://github.com/nh-/gsoc_vector

1 1

GSOC 2015 Proposal
by vivek dhiman 26 Mar '15

26 Mar '15

Hello all This is my proposal for GSoC 2015. http://www.google-melange.com/gsoc/proposal/public/google/gsoc2015/vdhiman/… It would be awesome if you guys could suggest some changes/edits. Thanks Vivek Dhiman

2 1

Boost.uBLAS a library for matrix computations Project: Data Frame
by Sahba E 26 Mar '15

26 Mar '15

Hello all, My name is Sahba Etezad. I'm studying masters of Computing Science in Simon Fraser University, Canada.I'm really interested in working on ublas library and matrix computations. Particularly, I'm really passionate about the data frame project. My thesis concerns graph embedding so I've been working with Boost graph library for over a year now. I've been also coding in Matlab for over 4 years, and I think my familiarity with matrix operations and all that can be an asset for this project. I've finished implementing the competency code. https://github.com/setezad/ublasAnd I know it's really last minute, but I'd really appreciate it if you would give me some advice on what I should include to provide a precise project proposal. It has been mentioned that a data frame similar to R should be implemented with extension to implementing the summary and aggregate functions. I studied the two links provided in the project description ( http://pandas.pydata.org/pandas-docs/dev/generated/pandas.DataFrame.html, and http://cran.r-project.org/web/packages/data.table/index.html ). Now my question is knowing that a data frame can have countless attributes and methods, should I specify what attributes and methods I'd like to implement? Or will it be decided later and need not to be proposed by me? Thank you very much. Regards,Sahba Etezad

1 0

[SORT] Parallel Algorithms
by Francisco José Tapia 26 Mar '15

26 Mar '15

Sorry by the delay, As promised, the sorting parallel algorithms On my computer (Quad Core) the GCC std::sort and stable_sort are slight faster than my version of intro_sort and merge_sort (stable sort is a synonym of merge_sort). In other computer with an Intel I3, my algorithms are slight faster than in the GCC version. Trying to optimize the parallel implementation. I modified the parallel version for to use the std::sort and std::stable_sort. The parallel_sort version response good, but the parallel_stable_sort increase the time around a 60% compared with the version with countertree::parallel_merge_sort . After many test, I discover the cause of the problem. The demonstration is in the test_stress_sort_01.cpp. In this program we have a big vector of 100 000 000 elements uint64_t. The program make parts of the same size for each HW core. On my computer 4 parts and 4 cores. The program execute the part sequentially checking the time, and after do the same but in parallel, each thread sort a part, and check the time. This is done with the std::stable sort and countertree::merge_sort. The data input is the same for all. The next lines are the result show max. OpenMP threads: 4 (4 processors) Sort of 100000000 elements in a vector --------------------- Random elements, few repeated ( rand() )----------------------- Stable Sort Part 0 secs :2.77955 Part 1 secs :2.75015 Part 2 secs :2.76068 Part 3 secs :2.76284 Parallel Sort secs :8.49796 Countertree stable sort Part 0 secs :2.72802 Part 1 secs :2.71614 Part 2 secs :2.72074 Part 3 secs :2.722 Parallel Sort secs :4.80692 Surprisingly the parallel sort with countertree::stable_sort is much more faster than the sort with std::stable_sort in the GCC 4.8 and 4.9 compiler. This is the secret of the speed of the countertree::parallel_merge_sort. This is very important, because when the size of the elements is small, the GCC and the countertree algorithms have similar performance. But when the size of the elements grow, the std::stable sort is slower than the countertree::merge_sort. This difference is increased in the parallel version. The next lines are part of benchmark_sort_05.cpp *************************************************************** Sort of N = 6250000 elements of size 128 ***************************************************************** Random elements, few repeated ( rand() )----------------------- STL std::sort :2.9188 secs countertree::intro_sort :2.87864 secs parallel::sort :2.46113 secs tbb::parallel_sort :1.86458 secs countertree::parallel_sort:1.89263 secs std::stable_sort :8.77963 secs countertree::merge_sort :5.70694 secs parallel::stable_sort :8.03946 secs countertree::parallel_merge_sort :4.90815 secs I have in mind a new version of the stable sort in order to improve the speed, reducing the number of internal copy of elements. I hope to have time in Christmas, but I can't guarantee. If the results are the expected I will send you You have too, a version of indirect_sort, which sort pointers to the elements, and at end sort the elements according the pointers. You can replace any sort algorithm by their indirect version, obtaining the same results, with the only difference of the time needed. You have a benchmark_indirect_sort.cpp where see the comparison of the time needed of several sort methods and their indirect version with elements of different size. This code is a preliminary version, done for my countertree library. If you consider useful, I will change the name space and document the code, the algorithms and the ideas obtained from the benchmarks. Please feel free for ask me any question or for to modify or change anything. The goal is to provide good sort methods to the users. In the zip file you have the code and a file with a description of each code. Yours

5 20

[Locale] Boost.Locale cannot Run in Visual Studio 2010
by Sarvagya Pant 26 Mar '15

26 Mar '15

I have been trying to learn Boost.Locale Module. Consider this http://www.boost.org/doc/libs/1_55_0/libs/locale/doc/html/conversions_8cpp-… example. The code gets successfully compiled but when I try to run it, it gives the error Unhandled exception at 0x74d34b32 in LearningCPP.exe: Microsoft C++ exception: std::bad_cast at memory location 0x00a6fa48.. I have attached the stack-trace of the program also. Here it is: KernelBase.dll!74d34b32() [Frames below may be incorrect and/or missing, no symbols loaded for KernelBase.dll] KernelBase.dll!74d34b32() > msvcr100d.dll!_nh_malloc_dbg(unsigned int nSize, int nhFlag, int nBlockUse, const char * szFileName, int nLine) Line 302 + 0x1d bytes C++ msvcr100d.dll!malloc(unsigned int nSize) Line 56 + 0x15 bytes C++ LearningCPP.exe!std::use_facet<boost::locale::converter<char> >(const std::locale & _Loc) Line 526 C++ LearningCPP.exe!boost::locale::to_upper<char>(const char * str, const std::locale & loc) Line 225 + 0x9 bytes C++ LearningCPP.exe!main() Line 170 + 0xc4 bytes C++ LearningCPP.exe!__tmainCRTStartup() Line 555 + 0x19 bytes C LearningCPP.exe!mainCRTStartup() Line 371 C kernel32.dll!75268543() ntdll.dll!776bac69() ntdll.dll!776bac3c() Did anyone faced this issue when using Boost.Locale in Visual Studio 2010? If so, how do I resolve this issue? *PS:* I have used option Use Unicode Character Set under the Character Set option of Visual Studio. I believe the libraries are correctly linked too. -- *sarvagya*

1 0

[threads / signals2] Win events replace by boost signals (threadsafe)
by Fu ji 26 Mar '15

26 Mar '15

Hello, I have to change win32 events with something portable so I decided to use boost.signals2. Right now I have something like: ret = WaitForMultipleObjets{ switch(ret) { case Timeout: something; break; case Event1: something; break; case Event2: something; break; }} and I think that the good idea is to replace this with something like that: for(;;){ Execute code from timeout, if event occurs interrupt and execute code which is responsible for event handling} but for test I write this: boost::signals2::signal<void()> signal; void SendSignal() { std::cout << "Send signal"; boost::this_thread::sleep_for(boost::chrono::milliseconds(200)); signal(); boost::this_thread::sleep_for(boost::chrono::milliseconds(2000)); } int main() { boost::thread t1(SendSignal); for (;;) { std::cout << "."; boost::this_thread::sleep_for(boost::chrono::milliseconds(100)); } auto c = signal.connect([]() { std::cout << "Signal receive" << std::endl; boost::this_thread::sleep_for(boost::chrono::milliseconds(1000)); }); return 0; } unfortunately this example is not working, what I've done wrong ? Best regards

6 10

Server certificate expired on svn.boost.org
by William Gallafent 26 Mar '15

26 Mar '15

“The certificate expired on 2015-03-22 02:33” … ! -- Bill Gallafent.

2 1

Removing auto_ptr/etc. from Boost
by Stephan T. Lavavej 25 Mar '15

25 Mar '15

Hi Boost devs, I need your help to get rid of auto_ptr forever. I want to implement C++17's N4190 "Removing auto_ptr, random_shuffle(), And Old <functional> Stuff", although it's going to take a while. In VC 2015, the removal will be opt-in (requested via a macro; I've already checked this in). My plan is for the removal to be opt-out in the version after that, and unconditional in the version after that. To achieve the opt-in removal, I've already eliminated the STL's internal dependencies on this stuff (nothing derives from unary_function/binary_function anymore, and shuffle() isn't directly implemented with random_shuffle() anymore). To prepare for the future of opt-out removal, I've also been removing usage from the compiler and other stuff. However, Boost is used in our tests in a number of places. What I'd like to ask is for Boost to begin removing its usage of this stuff (unconditionally or for VC 2015+, your pick). According to my understanding, only unary_function/binary_function and auto_ptr are used extensively by Boost, with the other stuff being used rarely or not at all. Thanks, Stephan T. Lavavej Senior Developer - Visual C++ Libraries

10 23

[iterator] Bug #7526
by Claas 25 Mar '15

25 Mar '15

Hi! I was wondering, how the iterator developers intend to proceed with ticket #7526 (https://svn.boost.org/trac/boost/ticket/7526) Two fixes are available and seemingly just wait to be applied. One fix has been available for two years, and a more sophisticated (probably preferable) fix has been submitted 9 month ago. Has this simply been forgotten or are there any reasons, not to apply one of the available patches ?. Since I require the requested functionality, I would like to press the issue. If more support is required to fix this, please let me know. Since two years I have had to patch each version of boost manually to deploy this fix, which is a little frustrating. So I would gladly contribute, if this is required. Any update on the issue would be appreciated. Regards Claas

1 0

[TypeSort] Automatic type sorting
by costis glynos 25 Mar '15

25 Mar '15

Hello,Is there any interest in a library which automatically sorts types from smallest to largest at compile time?The benefit would be the automatic Data Structure Alignment and potential improvement in performance.Foo<int,bool,Custom16ByteType,char,double,short> foo_1; //normal Foo<int,bool,Custom16ByteType,char,double,short> foo_2; //using the TypeSort output: size of foo_1 = 48 size of foo_2 = 32 Kind Regards, Constantinos

6 17

Messages from list marked as spam
by Matus Chochlik 25 Mar '15

25 Mar '15

On Wed, Mar 25, 2015 at 1:33 PM, Christian Hägele <haegele(a)teamviewer.com> wrote: > Am 24.03.2015, 19:27 Uhr, schrieb Marcel Raad <raad(a)teamviewer.com>: > > Email from certain people on the list is >>> marked as spam by gmail: "Why >>> is this message in Spam? It has a from >>> address in teamviewer.com but >>> has failed teamviewer.com's required >>> tests for authentication. " >>> >> >> I guess that's me. Probably because I use >> Gmane's web interface to post messages >> instead of my e-mail account. >> > > I'm using my e-mail account to write this mail from the same domain as > Marcel does. > I hope this mail is not marked as spam. > > I would appreciate if somebody would give feedback if this mail is marked > as Spam by Gmail or similar providers. > It gets into spam in my gmail account (together with some messages sent from yahoo.com)

1 0

Boost 1_58_0_rc1 is available for testing
by Marshall Clow 25 Mar '15

25 Mar '15

Release candidate files for 1.58.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. IMPORTANT NOTE: There is a bug with the build scripts; you have to specify the address-mode and architecture to b2. I used: ./b2 address-model=64 architecture=x86 to test this. The files (and associated md5s) are: MD5 (boost_1_58_0_b1_rc1.7z) = 302c7dfc917227843d24beed33ccc99c MD5 (boost_1_58_0_b1_rc1.tar.bz2) = d7d030e85bf5534a328c108c62a7fb0e MD5 (boost_1_58_0_b1_rc1.tar.gz) = ec90cd23bdc99c5eaf88245ea94a28e0 MD5 (boost_1_58_0_b1_rc1.zip) = dc8379fb95c84fe2fca53a4b2c96da23 Thanks! -- The release managers

13 18

Re: [boost] [test] boost.test owner unresponsive to persistent problems for multiple years
by Raffi Enficiaud 24 Mar '15

24 Mar '15

Le 18/03/15 14:43, Edward Diener a écrit : > On 3/18/2015 5:49 AM, Paul A. Bristow wrote: > > Do I have to rebuild the Boost.Test library to get the new docs ? > Because the first thing I did was to try to view the new docs by opening > index.html only to find that there was no html documentation. Then I > tried 'b2 toolset=gcc-4.9.2' for building Boost.Test and received: > > Performing configuration checks > > - symlinks supported : yes > error: Unable to find file or target named > error: 'dyn_ut_example.cpp' > error: referred to from project at > error: '../../libs/test/example' > > It does not appear that the 'develop' branch is ready for me at all. This is the location of the new documentation: http://www.boost.org/doc/libs/develop/libs/test/doc/html/index.html I do not know about the update frequency In order to build the doc: cd $boost/libs/test/doc ../../../bjam -sDOCBOOK_XSL_DIR=/some/path/docbook-xsl-1.78.1/ -sDOCBOOK_DTD_DIR=/some/path/docbook-xml-4.2/ Doxygen should be in the $PATH. The previous command will build whatever is necessary. Best, Raffi

6 8

[build] broken documentation links
by dominic meiser 24 Mar '15

24 Mar '15

Hi, The links to the documentation (html and pdf) at http://www.boost.org/doc/libs/1_57_0/tools/build/index.html are broken. Cheers, Dominic

1 0

[Hana] Informal review request
by Louis Dionne 24 Mar '15

24 Mar '15

Dear Boost, As some may be aware of, I am currently working on a metaprogramming library called Hana, with the intention of proposing it for inclusion in Boost. The purpose of that library is to act as a toolbox for expressing computations on both types (like the MPL) and heterogeneous values (like Fusion). The library is built around C++14 idioms and implementation techniques to maximize expressiveness and performance. I am now requesting feedback from the community, with the intention of asking for a formal review in the next months. A similar review was asked for in last August. The library has undergone several modifications since then, both to address issues raised during the review and for general improvement. Here are some issues that were raised during the review and addressed: - Usage of names and terms unknown to C++ programmers: Efforts were made to make this better, and several functions were renamed (`fmap` is now `transform`). When possible, the documentation also uses terms more familiar to C++ programmers, like concept instead of "type class". - The order of the arguments to some algorithms was unfortunate for C++. It was consistent with Haskell, but it turned out to be cumbersome in C++. This is changed in most places. - Inability to easily implement individual algorithms: This is fixed, and algorithms are now standalone structures using tag-dispatching, almost exactly as in Fusion. - Lack of a good introductory tutorial: A lot of work has gone into improving both the tutorial and the reference documentation. - Lack of support for mainstream compilers: The library is now almost fully functional with Clang 3.5. A GCC 4.9 port with reduced functionality is also underway on the `redux` branch. The library is available at [1] and the documentation at [2]. Comments should be directed to this mailing list, while bugs and other similar problems should be directed to the GitHub issue tracker. Please participate, especially if you have interest and/or experience in metaprogramming; after all, you represent the target audience for Hana. Thank you, Louis Dionne [1]: https://github.com/ldionne/hana [2]: http://ldionne.github.io/hana/

13 48

boost regex recursive quesion
by 温西波 24 Mar '15

24 Mar '15

This is my first time to using maillist I'm learning to use boost::regex for a month , a few days ago I found a problem( maybe is my mistake ?) I construct a simple recursive regular expression: a(?0)? This regex contains a recursive call (?0). It should match a string with any arbitrary length filled with 'a' characters. regex_match only returns true for "a" and "aa", but failed to match "aaa" and any string longer than three characters. Why? I try it on boost 1.45 and 1.57 , both get same result . I had sent this question on stackoverflow , but had not get a answer now . Is there any flag should be used with regex_match to use recursive call ? Thank you .

2 3

[rational] has no maintainers
by Peter Dimov 23 Mar '15

23 Mar '15

Currently, nobody has write access to Boost.Rational, and I see a number of open pull requests (mostly by John Maddock) lingering. John, would you like write access to it so that you can apply your suggested changes?

5 6

BOOST_SYMBOL_VISIBLE
by Robert Ramey 23 Mar '15

23 Mar '15

I'm trying to get my MAC OS (Yosemite) to build the boost serialization library and I've having a problem. In a couple of tests, the program throws some exceptions. When this occurs I get a message something like "terminate called after throwing an instance of 'boost::archive::archive_exception'". I'm quite sure that I used to be able to do this without problem - as of a couple of months ago. I recently "upgraded" to Yosemite. My gcc-4.8.1 version I'm getting from HPC website. In the course of trying to figure this out, I've come upon boost documentation which explains BOOST_SYMBOL_VISIBLE which was new to me. It suggests that my code which looks like class archive_exception : public virtual std::exception { ... could be creating a problem. due to deriving from some other class which might be defined a runtime shared library. So I replaced it with: class BOOST_SYMBOL_VISIBLE archive_exception : public virtual std::exception { ... and I also tried class BOOST_SYMBOL_VISIBLE archive_exception : public virtual std::exception { ... This doesn't change anything so it looks like I'm barking up the wrong tree. Is there anyone here who might want to shed some light on this? Robert Ramey -- View this message in context: http://boost.2283326.n4.nabble.com/BOOST-SYMBOL-VISIBLE-tp4673673.html Sent from the Boost - Dev mailing list archive at Nabble.com.

3 3

Bug in boost asio on mac
by Philippe Daouadi 23 Mar '15

23 Mar '15

Hi, I have had this bug on mac os Yosemite where I would call async_connect and my code would never be called back. I didn't have any answer to my bug report and I would like to be sure that it it is not lost. https://svn.boost.org/trac/boost/ticket/11070 Any suggestion or workaround is welcome. Cheers, Philippe -- *This email and any attachment thereto are confidential and intended solely for the use of the individual or entity to whom they are addressed.If you are not the intended recipient, please be advised that disclosing, copying, distributing or taking any action in reliance on the contents of this email is strictly prohibited. In such case, please immediately advise the sender, and delete all copies and attachment from your system.This email shall not be construed and is not tantamount to an offer, an acceptance of offer, or an agreement by Aldebaran Robotics on any discussion or contractual document whatsoever. No employee or agent is authorized to represent or bind Aldebaran Robotics to third parties by email, or act on behalf of Aldebaran Robotics by email, without express written confirmation by Aldebaran Robotics’ duly authorized representatives.* ------------------------------ *Ce message électronique et éventuelles pièces jointes sont confidentiels, et exclusivement destinés à la personne ou l'entité à qui ils sont adressés.* *Si vous n'êtes pas le destinataire visé, vous êtes prié de ne pas divulguer, copier, distribuer ou prendre toute décision sur la foi de ce message électronique. Merci d'en aviser immédiatement l'expéditeur et de supprimer toutes les copies et éventuelles pièces jointes de votre système.* *Ce message électronique n'équivaut pas à une offre, à une acceptation d’offre, ou à un accord d'Aldebaran Robotics sur toute discussion ou document contractuel quel qu’il soit, et ne peut être interprété comme tel. Aucun employé ou agent d’Aldebaran Robotics n'est autorisé à représenter ou à engager la société par email, ou à agir au nom et pour le compte de la société par email, sans qu’une confirmation écrite soit donnée par le représentant légal d’Aldebaran Robotics ou par toute autre personne ayant reçu délégation de pouvoir appropriée.*

3 4

Multiple-pattern string search algorithms
by meghana madhyastha 23 Mar '15

23 Mar '15

Hi all ! I noticed that Boost's algorithm module does not include multiple pattern string searching algorithms such as the Rabin Karp algorithm and Aho-Corasick algorithm. I think these algorithms are very useful and should be implemented in the library. If no one is currently working on them, I am willing to implement them. Please let me know your opinion. Regards, Meghana

2 1

Enhanced Vector and Deque Competency Test
by Islam Taha 23 Mar '15

23 Mar '15

Hi all I’m sorry with inconvenience with my last mail, it’s just my first to write in a mail list. I’ve fixed some issues with my code but now it may run completely, I would be thankful if anyone has some free time to give a feedback to my fixed code and tell me if any issues. code https://github.com/islam-taha/stdVector/blob/master/vector.cpp <https://github.com/islam-taha/stdVector/blob/master/vector.cpp> . thanks in advance Islam

1 0

transforming ex. boost lib into C++11-only lib?
by Oliver Kowalke 23 Mar '15

23 Mar '15

Hello, is it permitted to transform an existing boost library into a C++11-only library? best, Oliver

15 19

[endian] Testing floating point interoperability
by Beman Dawes 23 Mar '15

23 Mar '15

On Fri, Jan 30, 2015 at 5:25 AM, Paul A. Bristow <pbristow(a)hetp.u-net.com> wrote: > > >> * Anything else that you can think of to improve FP support. > > The proof of the pudding is in the eating. > > I'd suggest that *testing interoperability* is the key precaution that you should advise. I'm starting to write a caution to go in the release, and will make that point. A new test, "floating_point_test", has been added to the endian test suite. It will focus on interoperability. (I know that you are talking about users testing their application needs, but I want to test Boost.Endian to be able to warn users of areas where there are known issues.) > It should obviously be between all possible combinations of processor hardware types. It isn't just processor types. std::numeric_limits<float>::signaling_NaN() representation is 0x7fc00001 for Microsoft/Dinkumware, but is 0x7fa00000 for gcc and clang:-( > The test should include a range of floating-point values from min to max, > and include NaN and infinity unless it is certain that they will never occur. To get started, floating_point_test.cpp is testing float and double: numeric_limits<>::min() numeric_limits<>::max() numeric_limits<>::lowest() numeric_limits<>::epsilon() numeric_limits<>::round_error() numeric_limits<>::infinity() -numeric_limits<>::infinity() numeric_limits<>::quiet_NaN() numeric_limits<>::denorm_min() 0.0 -0.0 1.0 -1.0 native uint32_t 0x12345678U as a float native uint64_t 0x0123456789abcdefULL as a double pi<>() Are there other specific values worth testing?> (Unless very special precautions are taken, then infinity and NaN are like to rear their ugly heads > at some time - probably when you least want to see them!) > > It must be possible to 'round-trip' all floating-point values. That's one of the tests performed on each value. > You can't test all possible values (except for 32-bit float - 64-bit double takes about 50 years at > current processor speeds ;-) > but you can chose values (floating-point bit patterns) at random for a test lasting some minutes or > even hours. Could you provide the random number generation and otherwise help with this? I've only ever used integer RNGs. Thanks, --Beman

7 11

GSoC project
by Lulu C. Li 23 Mar '15

23 Mar '15

Hi! I wish to participate in GSoC this summer and I am very interested in Boost, in particular concurrent hash tables project. I am familiar with STL and worked on synchronization problems and concurrent processes in C. I can work on all the functionalities mentioned. What are other features that I should know for this project and proposal? Lulu

2 1

Test Runner: teeks99-08f - msvc-14.0 - Extra Define
by Tom Kent 23 Mar '15

23 Mar '15

The Test runner teeks99-08f has been running the msvc-14.0 - CTP 6 release for a bit now. It runs with the extra bjam option "define=BOOST_MSVC_ENABLE_2014_JUN_CTP". Is this still necessary? I was going through and updating some settings and I notices this was still there and was trying to decide if I should clean it up or not. Thanks, Tom

2 1

How to install a algorithm to Boost
by jianwei li 23 Mar '15

23 Mar '15

Hi Now,I have implemented a linear algorithm.How can i install it to Boost project. Jianwei Li

2 1

Application for GSOC 2015
by Alexandru Hulea 23 Mar '15

23 Mar '15

Hello, My name is Alexandru Hulea and I am an undergraduate student at University POLITEHNICA of Bucharest. I am in the third year at The Faculty of Automatic Control and Computers. My email can be found at [1]. About availability, I think 40 hours / week will be enough, but I will work more if the complexity of the project will require that. The only factors which will affect my availability will be the exams which are scheduled in the first 2 weeks of June. About my educational background, I took some courses related to the projects I apply including C Programming, Data Structures, OOP, Algorithms, Parallel and Distributed Algorithms. I participated in 2 summer schools working on a project in Android and on another project in OpenGL with C++. My favourite programming language is C++. I have 3 years experience in C/C++ and I am interested in scientific work like developing libraries of C++. I like to solve algorithms exercises, to find tricky optimisations for ACM exercises or other programming contests and recently I discover the wonderful world of parallel computing. I am interested in contributing to the Boost C++ Libraries because the project contains the parts of programming I like the most: optimisation and parallel programming. I have experience in C++ 98/03, 11/14, Standard Library and I worked with Git. Unfortunately I have no experience with Boost C++ Libraries. I like to work in Visual Studio on Windows and with Sublime Text and gcc, valgrind in Ubuntu. I am familiar only with JavaDoc speaking of software documentation. About the projects, I find interesting: "Concurrent Hash Tables", "Enhanced vector and deque containers" and "Boost uBLAS a library for matrix computations". I see these projects as optimisation and syncronization problems. My biggest projects are an OpenGL game written in C++ and a client-server application written in C++ too as a homework for the Protocols course. You can find them at [2]. About the application on the projects, could you tell me how I can show my skills in this field ? I searched for a section with a projects or some tests with bugs but I didn't find it. I look forward to hearing from you soon. Thank you, Alexandru Hulea [1]: alexandru.hulea(a)gmail.com [2]: https://github.com/HuleaAlexandru/c-Projects

1 0

[GSoC] [Hana] Project proposal
by Louis Dionne 22 Mar '15

22 Mar '15

Dear Boost, I plan to participate to GSoC this summer with Hana as a project. Joel Falcou, my mentor of last year, kindly agreed to mentor me again this year if I make the cut. This year's project will be much more specific than last year's. Loosely speaking, the goal is to research compile-time associative data structures and to come up with a solution that's both compile-time efficient and which has a flexible interface. You can find the current version of my GSoC proposal at [1]. Please do not hesitate to make comments if you think some things can be improved, which is probably the case. I think my colllaboration with Boost was fruitful last year, and I really hope I can reiterate this year. Regards, Louis Dionne [1]: https://gist.github.com/ldionne/171e6301ecde63712d8a

1 0

Have we lost a bunch of testers recently?
by Peter Dimov 22 Mar '15

22 Mar '15

I'm looking at http://www.boost.org/development/tests/develop/developer/bind.html and I have the feeling that a bunch of columns that used to be there no longer are. I see no tests on OS X, for instance, no tests from Sandia at all, and very slim C++11 coverage. Is this related in some way to the cleanup of old test results perhaps?

5 4

[CrystaX.NET] [log] Test failures
by Andrey Semashev 22 Mar '15

22 Mar '15

Hi, There are quite a few test failures on CrystaX.NET x86 clang testsrs. Basically, there are two kinds of errors: 1. Compilation and linking succeeds but running the test fails due to missing ___tls_get_addr symbol. http://www.boost.org/development/tests/develop/developer/CrystaX-NET-apilev… 2. Linking fails due to missing symbols from iostreams for long double. http://www.boost.org/development/tests/develop/developer/CrystaX-NET-apilev… Are these known problems?

2 3

[gsoc15] Removing my proposal due to plagiarism concerns
by Sandilya Jandhyala 22 Mar '15

22 Mar '15

About 12 days ago I'd posted my proposal here asking for feedback; however, it seems that some people have forked it (it's a GitHub repository) and then deleted their forked repositories. I am taking down the repository due to concerns of plagiarism. I've submitted it to Melange, and community members who want to view it/offer feedback can see it there. I hope the admins are mindful of this when evaluating proposals. It seems that there's already been a case of plagiarism here.

4 5

Test failures on sanitize memory - are they caused by lightweight_test?
by Fletcher, John P 22 Mar '15

22 Mar '15

There is a test set on develop called BenPope x86_64 Ubuntu - phoenix - adapt_function / clang-linux-3.6~msan~c14_libc++ This runs this command line for example on the Phoenix test "adapt_function": "clang++-3.6" -c -x c++ -std=c++1y -stdlib=libc++ -fsanitize=memory -O0 -fno-inline -Wall -fPIC -m64 -DBOOST_ALL_NO_LIB=1 -I".." -o "/home/ben/development/boost/test/build/develop/results/boost/bin.v2/libs/phoenix/test/adapt_function.test/clang-linux-3.6~msan~c14_libc++/debug/address-model-64/architecture-x86/debug-symbols-off/function/adapt_function.o" "../libs/phoenix/test/function/adapt_function.cpp" There are numerous failures with this test set on Phoenix and I set out to find out why. Most of the failures are like this: SUMMARY: MemorySanitizer: use-of-uninitialized-value ??:0 std::__1::basic_ostream<char, std::__1::char_traits<char> >& std::__1::__put_character_sequence<char, std::__1::char_traits<char> >(std::__1::basic_ostream<char, std::__1::char_traits<char> >&, char const*, unsigned long) Exiting I think this is coming from the boost::report_errors function defined in boost/core/lightweight_test.hpp I have put some temporary tests on to develop for Phoenix which contain only various calls to test the lightweight test. These are called aa_test0 to 3 so they will come at the top of the table. Unfortunately tests are not reporting at the moment so I don't have any results. There are also failures on the testing of Boost Core with the same test set. I thought I would report this without waiting for the results in the hope that it can be sorted out for the 1.58.0 release. John

4 8

[optional] Problem with new boost::none
by Marcel Raad 21 Mar '15

21 Mar '15

Hi, as mentioned in another thread, there are compilation problems with the reworked none_t on MSVC when using precompiled headers. To reproduce: precompiled header stdafx.h: #pragma once #include <boost/optional.hpp> s.cpp: #include "stdafx.h" struct s { void f(boost::optional<int> const& = boost::none) {} }; On MSVC12, this results in the error message: s.cpp(3): error C3083: ' ?? A0x06d21c56': the symbol to the left of a '::' must be a type

1 0

Re: [boost] [Boost-testing] Have we lost a bunch of testers recently?
by Jim Bell 21 Mar '15

21 Mar '15

On 2015-03-21 9:03 AM, Niklas Angare wrote: > (I'm cross-posting this here for better visibility - please send any > responses to the main developers list) > > "Peter Dimov" <lists(a)pdimov.com> wrote: >> and I have the feeling that a bunch of columns that used to be there no >> longer are. I see no tests on OS X, for instance, no tests from >> Sandia at >> all, and very slim C++11 coverage. > > Looking at the ftp directory for develop, these runners haven't > uploaded in > the past ten days: > > Sandia - 10-12 runners, last upload 2015-02-09 > jc-bell MinGW-* / VC8 / VC10 / FBSD / SUSE - 11 runners, I run the jc-bell tests, but can only run one a day at best. The tests are now falling off faster than they did before, and I've been protesting (for master branch). See: http://lists.boost.org/Archives/boost/2015/03/220662.php HTH

1 0

[GSOC] Proposal template question.
by Damian Vicino 21 Mar '15

21 Mar '15

Hi, Are we suppose to keep the template text in a Q/A fashion or the idea is to write it all over? I started writing the proposal doing replacement of the original text, but now I’m wondering if maybe having all the original text inlined facilitates referencing and discussing between the reviewers. What is the preferred way? Best regards, Damian

2 1

[GSoC '15] Requesting review!
by Abhinav Tripathi 21 Mar '15

21 Mar '15

I have submitted a proposal on GSoC regarding 'Boost Document Library' two days ago. I haven't recieved a single review yet. Mentors Please do review. . Abhinav

2 1

Boost 1_58_0_b1_rc2 is available for testing
by Marshall Clow 21 Mar '15

21 Mar '15

Release candidate files for 1.58.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. Changes since rc1: * Added the new libraries endian, sort, and winapi. IMPORTANT NOTE: There is a bug with the build scripts; you have to specify the address-mode and architecture to b2. I used: ./b2 address-model=64 architecture=x86 to test this. The files (and associated md5s) are: MD5 (boost_1_58_0_b1_rc2.7z) = c58623e8c3d48154bdb1fa2ee5cdbfab MD5 (boost_1_58_0_b1_rc2.tar.bz2) = 94480c2d9de3804a1a4b626a7828bec0 MD5 (boost_1_58_0_b1_rc2.tar.gz) = f7d4b398388c13ca30960c92b8d6342f MD5 (boost_1_58_0_b1_rc2.zip) = 2e9bdfd8dab269a69e4ea4e5ae5b6d47 Thanks! -- The release managers

13 27

[exception] c++11 updates
by Ryan Burn 21 Mar '15

21 Mar '15

I've been working with boost exception and looking at the develop branch on github it looks like much of it hasn't been updated for c++11. Is anyone already working on this already? If not, I'd like to make the following changes: - add rvalue-reference overloads to the error_info class ( https://github.com/boostorg/exception/blob/develop/include/boost/exception/…) and elsewhere so that you can do things like throw my_error() << my_info(std::move(a)) - replace occurrences of "throw()" with a macro (something like BOOST_NO_THROW_SPECIFICATION) that expands to "throw()" if compiling with c++98 and "noexcept" if compiling >= c++11 would these changes be ok? Thanks, Ryan

2 2

Re: [boost] enhanced vector and deque competency test
by Islam Taha 20 Mar '15

20 Mar '15

Thank you again I think it’s solved right now, you can check it Thanks in advance Islam Taha

3 3

[1.58] Request to add fix for ticket #6766 to 1.58 release
by Aparna Kumta 20 Mar '15

20 Mar '15

Boost ticket #6766 ( https://svn.boost.org/trac/boost/ticket/6766 ) affects several of our tests running with Oracle Solaris Studio compiler. It prevents building of libboost_unit_test_framework.a which in turn causes tests from many of the libraries (accumulators, algorithm, assign, lexical_cast, msm, odeint, polygon, range and sync) to fail due to a dependency on libboost_unit_test_framework.a. A PR for this has been submitted.https://github.com/boostorg/test/pull/36 This fix alone causes the pass rate for Boost 1.58 with the Oracle Solaris Studio compiler to increase by about 15%. This fix is not in the 'develop' branch yet. We would very much appreciate if this could be considered for putback into the Boost 1.58 release. Thanks, Aparna

1 0

Re: [boost] enhanced vector and deque competency test
by Islam Taha 20 Mar '15

20 Mar '15

Thank you very much I have now removed all warnings and it removed the segmentation fault as well. It would be appreciated to give me another feedback on the updated code. thanks in advance

2 1

[1.58] Developchanges not yet merged to master?
by Beman Dawes 20 Mar '15

20 Mar '15

FWIW, I got a private email worrying about unmerged fixes: > This is the list of PR's that have been merged into the develop branch but > have not made it into the 1.58 release candidate: > > https://github.com/boostorg/serialization/pull/9 > https://github.com/boostorg/odeint/pull/7 > https://github.com/boostorg/odeint/pull/6 > https://github.com/boostorg/pool/pull/7 > https://github.com/uBLAS/ublas/pull/26 > https://github.com/boostorg/odeint/pull/9 > https://github.com/boostorg/odeint/pull/8 > https://github.com/boostorg/lexical_cast/pull/10 > https://github.com/boostorg/type_traits/pull/11 > https://github.com/boostorg/type_index/pull/6 I asked the sender to post this sort of message directly to the list, but with 1.58.0 so close it seemed worthwhile to send the list along. --Beman

3 2

Re: [boost] [gsoc15] Removing my proposal due to plagiarism concerns
by Islam Taha 20 Mar '15

20 Mar '15

I’m sorry to fork your README file on your rep. i was just concerned to know how to make bold and somethings you do in your file, there is nothing to do with plagiarism with this, don’t worry about your proposal. Apologizes Islam Taha

1 0

Windows Develop Tests Failing
by Tom Kent 20 Mar '15

20 Mar '15

All my windows test runners for develop (teeks99-08*) have been failing for the last few days (I just noticed). They run for a long while, then end with the following at the end of their results/bjam.log file: common.mkdir D:\local\teeks99-08\d\results\boost\bin.v2\libs\multiprecision\test\number_concept_check_cpp_dec_float_no_et.test\msvc-11.0\debug\address-model-64\architecture-x86\debug-symbols-off\link-static\runtime-link-static if not exist "D:\local\teeks99-08\d\results\boost\bin.v2\libs\multiprecision\test\number_concept_check_cpp_dec_float_no_et.test\msvc-11.0\debug\address-model-64\architecture-x86\debug-symbols-off\link-static\runtime-link-static\\" mkdir "D:\local\teeks99-08\d\results\boost\bin.v2\libs\multiprecision\test\number_concept_check_cpp_dec_float_no_et.test\msvc-11.0\debug\address-model-64\architecture-x86\debug-symbols-off\link-static\runtime-link-static" failed to write output file 'D:\local\teeks99-08\d\results\boost\bin.v2\libs\multiprecision\test\number_concept_check_cpp_dec_float_no_et.test\msvc-11.0\debug\address-model-64\architecture-x86\debug-symbols-off\link-static\runtime-link-static\number_concept_check_cpp_dec_float_no_et.obj.rsp'! At first I thought I might be running out of disk space or something, but that all seems fine. Has anyone seen this before? Tom

12 26

Testing develop fails with b2 errors
by Peter Dimov 20 Mar '15

20 Mar '15

LIke this: C:\Projects\boost-git\boost\libs\core\test>b2 toolset=clang,clang-cxx11,gcc,gcc-cxx11,msvc-8.0,msvc-10.0,msvc-11.0,msvc-12.0 [...] C:/Projects/boost-git/boost/tools/build/src/build\project.jam:262: in find-jamfile from module project error: Unable to load Jamfile. error: Could not find a Jamfile in directory '/C:/Projects/boost-git/boost/libs/context/config'. error: Attempted to find it with pattern '[Bb]uild.jam [Jj]amfile.v2 [Jj]amfile[Jj]amfile.jam'. error: Please consult the documentation at 'http://www.boost.org'. and then this: C:/Projects/boost-git/boost/tools/build/src/build\project.jam:280: in load-jamfile from module project C:/Projects/boost-git/boost/tools/build/src/build\project.jam:64: in project.load from module project C:/Projects/boost-git/boost/libs/log/build\log-architecture.jam:23: in load from module log-architecture C:/Projects/boost-git/boost/tools/build/src/kernel\modules.jam:289: in modules.import from module modules C:/Projects/boost-git/boost/tools/build/src/build\project.jam:1043: in import from module Jamfile<C:\Projects\boost-git\boost\libs\log\build> ..\..\..\libs\log\build\Jamfile.v2:15: in modules.load from module Jamfile<C:\Projects\boost-git\boost\libs\log\build> C:/Projects/boost-git/boost/tools/build/src/build\project.jam:325: in load-jamfile from module project C:/Projects/boost-git/boost/tools/build/src/build\project.jam:64: in load from module project C:/Projects/boost-git/boost/tools/build/src/build\project.jam:89: in load-used-projects from module project C:/Projects/boost-git/boost/tools/build/src/build\project.jam:75: in load from module project C:/Projects/boost-git/boost/tools/build/src/build\project.jam:113: in load-parent from module project C:/Projects/boost-git/boost/tools/build/src/build\project.jam:464: in initialize from module project C:/Projects/boost-git/boost/tools/build/src/build\project.jam:306: in load-jamfile from module project C:/Projects/boost-git/boost/tools/build/src/build\project.jam:64: in load from module project C:/Projects/boost-git/boost/tools/build/src/build\project.jam:113: in load-parent from module project C:/Projects/boost-git/boost/tools/build/src/build\project.jam:464: in initialize from module project C:/Projects/boost-git/boost/tools/build/src/build\project.jam:306: in load-jamfile from module project C:/Projects/boost-git/boost/tools/build/src/build\project.jam:64: in load from module project C:/Projects/boost-git/boost/tools/build/src/build\project.jam:145: in project.find from module project C:/Projects/boost-git/boost/tools/build/src\build-system.jam:535: in load from module build-system C:\Projects\boost-git\boost\tools\build\src/kernel\modules.jam:289: in import from module modules C:\Projects\boost-git\boost\tools\build\src/kernel/bootstrap.jam:139: in boost-build from module C:\Projects\boost-git\boost\boost-build.jam:17: in module scope from module

5 7

To split, or not to split, or something else? RE: type_traits rewrite, modularization, dependencies, etc.
by Rene Rivera 20 Mar '15

20 Mar '15

I keep reading emails about the effort to reduce dependencies, and to split libraries into core/simple + whole/big.. And I keep thinking it's making things more complex than they need to be. I can see the need to compartmentalize the parts of a library that have minimal to little dependencies. So here's a suggestions for structure of managing this. I see options: 1. In each library allow for a "core" set of headers that are still in a core subdir. But that we can tell is a subset of the library that has the minimal dependencies. For example we would have: * libs/<lib>/include/boost/<lib>/core/.. * libs/<lib>/include/boost/<lib>/<the-rest>.. This of course assumes that it's headers only that would be core. Second option is to have each library have to explicit sublibs/parts. "core" and "full". Structure would be: * libs/<lib>/core/(build, doc, include, meta, test) * libs/<lib>/full/(build, doc, include, meta, test) Note, both core and full would be in the same git repo to make life easier for library authors and users that visit a library git repo on github. As it's only one place for everything for that one library. As a user, release manager, testing manager, and library author this would be easy to understand and manage than the current "some random set of libraries have core or not and in different places". -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

6 11

[1.58.0] Request permission to merge smart_ptr:94824c8 into master
by Peter Dimov 20 Mar '15

20 Mar '15

This https://github.com/boostorg/smart_ptr/commit/94824c807f76dc4f3d41109a75808e… fixes a problem on QNX/Blackberry by adding std:: to ptrdiff_t, in a place where size_t is already similarly qualified, so it should be very low risk. Tested locally on g++ 4.8.3, clang-3.4.2, msvc-8.0, msvc-10.0, msvc-11.0, msvc-12.0.

2 1

[metaparse] Review Manager
by Christophe Henry 20 Mar '15

20 Mar '15

Dear Review Wizards, I would like to volunteer to be Review Manager for the metaparse library, in agreement with Abel. We would like to suggest May 25 to June 07 for the review. If there are no objections, please sign me up. Regards, Christophe

8 13

[afio][v1.30 "C++ Now edition" released]
by Niall Douglas 20 Mar '15

20 Mar '15

Dear Boost, I am very pleased to announce the v1.30 release of proposed Boost AFIO, a Boost library implementing asynchronous file input/output which has been in the review queue since 2013. This is the version of AFIO which will be overviewed in my talk at C++ Now 2015. It also demonstrates the validity of the clang AST driven BindLib standalone Boost library conversion technique which will also be overviewed at C++ Now. Source distro: https://github.com/BoostGSoC13/boost.afio/archive/v1.30_Boost_v1.57.zi p Docs and CI dashboard: https://boostgsoc13.github.io/boost.afio/ Major new features in the v1.30 release: * Performance was improved by removing the transactional memory support in the v1.2 engine which is now compile time enabled only. Throughput now reaches up to 85% of raw ASIO and average latencies were reduced by 48%, yielding a 15 microsecond average latency with +/- 0.15 microsecond at a 95% confidence interval. This should enable AFIO to handle the latest generation PCIe SSDs with their 80 microsecond latencies reasonably well. * AFIO is now capable of complete standalone usage no Boost dependencies whatsoever, including for its unit testing via a Boost.Test emulation. * Due to its use of libclang AST generated template aliasing to allow user swapping of STL 11 implementation, minimum compilers required are now VS2013, GCC 4.7 and clang 3.2. All the VS2010 workarounds baggage has been eradicated. * All things related to async_data_op_req are now fully metaprogrammed with automatic generation by the compiler of suitable ASIO scatter-gather buffers from input types and STL containers with correct scatter-gather buffer coalescing where safe to do so. This automatic generation is user customisable via free function specialisation. * Support for relative paths from an open file descriptor was added. This lets you specify a file descriptor as a base from which a path fragment operates with the path resolution atomically performed in the kernel, and therefore the path of the base file descriptor may rapidly change safely. * AFIO is now optimally filing system race condition safe on all supported platforms, with per-API documentation of how much race safety is guaranteed per platform. A soak unit test verifies per commit that perfect race safety under severe and rapid filing system change is maintained. * A new afio::path type which very thinly wraps filesystem::path was added. The new afio specific path type makes the management of NT kernel path to Win32 path transition and conversion explicit, and therefore much harder to accidentally get wrong. A new normalise_path() function can convert a NT kernel path to a traditional Win32 path, complete with drive letter. * New platforms supported: Apple OS X and Android 5.0. * New filing system features support: All platforms: sparse file support, storage extent enumeration, extent deallocation ("hole punching"), volume metadata fetching (statfs), open file handle path discovery, hard link support, atomic relink (rename) support. Windows only: file symlinking, NT lock file performance flags (lock file performance is now not far from POSIX), workaround semantics for all the ways Windows will surprise you on the filing system such as files and directories which won't delete. AFIO now does a fair job of replicating POSIX filing system semantics on Windows (and better than Mingw/Cygwin presently). Linux: symlinks are now opened as file descriptors on kernels supporting that feature. * Doubled the size of the tutorial, with all the new material being non-toy examples. There is a particularly nifty "File locking via only atomic appending and hole punching" algorithm implementation in there, and it holds up surprisingly well compared to traditional file locks except on ZFS. Plus, it's completely portable. * Some utility routines in preparation for AFIO v1.4: a cryptographically strong random filename generator, a hugepage TLB STL allocator useful for efficient file copy buffers, a very highly optimised C++ 14 constexpr constructing arbitrary Hamming code SECDED template class (an amazing 22 cycles per byte for the 32784,32768 code), and secure to-hex and from-hex validating converters. * No shortage of bug fixes, helped hugely by additional unit testing for correct error handling. Detailed changelog can be found at https://boostgsoc13.github.io/boost.afio/doc/html/afio/release_notes.h tml. I'll tag a Boost 1.58 release on github once Boost 1.58 is out. This release took far longer than I originally intended mainly due to the extensive debugging of weird filing system races, and for six weeks now I've been working till 5am every night after my day job. I cannot tell you how glad I am to see this release out! My enormous thanks to my family who have put up with a lot for this release, and to my employer for a fairly dopey employee recently. Bed, here I come! Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

3 6

enhanced vector and deque competency test
by Islam Taha 19 Mar '15

19 Mar '15

Hi, I am Islam Taha i’m interested in the idea of enhanced vector and deck and i’ve implemented the simple vector-like container, it would be pleasurable to review and give me your feedback on my implementation. that’s the link ( https://github.com/islam-taha/stdVector/blob/master/vector.cpp <https://github.com/islam-taha/stdVector/blob/master/vector.cpp> ). Thanks in advance.

2 1

GSoC 2015 prospective student
by Tanuj kr Aasawat 19 Mar '15

19 Mar '15

Hi Everyone, I'm Tanuj Kr Aasawat, a final year student of Information Technology (B.E.). I would like to work on implementing a graph container with at least the following features: size, insert, delete, bfs and dfs. In the later part, would like to work on optimising bfs, using parallel computing techniques. In recent years, we have seen that major research is going on optimising the search operations for real world graphs (including RMAT graph and LiveJournal graph). Anticipating positive reply from your side. Thanks and Regards, Tanuj Kr Aasawat Deptt. of I.T, Jadavpur University, India Mitacs Globalink Research Intern, University of British Columbia, Vancouver, Canada

3 4

Gsoc 15 application (boost.uBLAS)
by siddharth kumar 19 Mar '15

19 Mar '15

Hello, I am Siddharth, a Computer science student from IIT Guwahati. After doing a bit of research over the project ideas, I have found the idea of further developing boost.ublas library interesting and so I have written the competency code. Here is the link to the code: https://github.com/sid6641/boost.uBLAS-Gsoc.git I have done a basic course on Linear algebra and Discrete Mathematics, so such a project suits my needs. I need a little help for proceeding further. 1. how is the error handling done in boost library. I am using assert for error handeling (but it does not sem the right way to me), the gaussian elimination doesn't work on singular matrices. So, I would like to set the errno and display apt message to the user when a singular matrix is the input. 2. Is there any predefined format for testing codes in boost library. I have done manual testing. Sorry, I am not familiar with most of the code in boost library. Any further helpful resources are welcome. p.s. I have started writing the proposal for the project and I'll soon draft it for review. Thanks, Siddharth

6 10

Boost on Android
by Dmitry Moskalchuk 19 Mar '15

19 Mar '15

Hi all, As someone of you already know, we've started regular regression testing of Boost on Android. After some (bit longer than I expected) time of debugging, we finally made it working in automatic mode so you can see our results of Boost testing on http://www.boost.org/development/tests/develop/developer/summary.html. We also automatically publish Android-only testing results on https://boost.crystax.net/master/developer/summary.html and https://boost.crystax.net/develop/developer/summary.html. Currently, we have numerous of fails. Some of them are bugs of Boost libraries, some - bugs of CrystaX NDK. We're strongly aim to continue support Boost on Android and fix our NDK to make Android as POSIX-conforming as possible; however, it's not easy to review all fails and distinguish NDK bugs from Boost bugs. So we're asking Boost libraries authors to start looking on Android regression testing results and file tickets to our tracker (https://tracker.crystax.net/projects/ndk) if it become clear that root of fail is bug of CrystaX NDK. CrystaX NDK is open-source project started as my personal project in 2009 to add C++ support to the Google's Android NDK (Google published first Android NDK release in 2009, and there was no support of C++ at all). My patches were published immediately but Google have added the same level of C++ support two years after first CrystaX NDK release, being constantly requested within two years to do that by Android developers community. To that time CrystaX NDK was much more than just "Android NDK with C++ support". Nowadays CrystaX NDK differs very much from Google's one - mostly because Google isn't interested in evolving of native development for Android; but we're _very_ interested. Our main goal is to create powerful comprehensive toolkit for native development for Android, and in fact we're making it much better than Google do. We're strongly aim to continue working on CrystaX NDK and support Boost on Android - just because it's helpful to our NDK too, not only to the Boost community. However, since CrystaX NDK is fully open sourced and we're working on it without being paid by any organization, we need help from peoples interested in evolving of native development for Android. Since 2009 I was working on the project in partial time fashion, making money other way (being paid contractor and working on many commercial projects); but last eight months we have switched to the full time scheme, and have achieved significant results in last release. Now we want to continue working on it full time, improving it more and more, and making native development for Android easier. We've started fundraiser on https://www.bountysource.com/teams/crystaxndk/fundraiser to collect funds needed for us to continue working on CrystaX NDK full time. We're calling everyone interested in Boost-on-Android to help us - either by sponsoring us or providing contributions to our project. I hope I did not violated rules of this mailing list because my message is directly related to the Boost development. We just want to make both CrystaX NDK and Boost better. Some links: https://www.crystax.net/android/ndk - CrystaX NDK project page https://tracker.crystax.net/projects/ndk - our bug tracker https://www.crystax.net/contact - here you could contact us directly -- Dmitry Moskalchuk

3 13

A question about appling GSoC2015
by jianwei li 19 Mar '15

19 Mar '15

Hi I'm a graduate student of Northwestern Polytenical University in China. Just as listed in the web,based on the proposal requirement of 'Boost Documant Library development' ,we should copy and past a programming test at the end of the proposal.But i'm not sure,do you just need the result picture or the all code. Thank you Best Regard Jianwei Li

2 1

GSoC2015
by raul lopez turcios 19 Mar '15

19 Mar '15

Hello, I wish to apply to the GSoC program, i have already read the wiki, and i'm currently working in a proposal. I just wanted to make a few questions as this is my first time applying for Boost Libraries and GSoC in general. First of all, i would like to know how much of a chance one gets as being "starter" working on boost. Second i would like to know if there is a way for someone to check out my proposal to see if i could improve anything, or should i just ask a teached in regards to that. And also i would like to know if any code i had already made in C++ is valid to be added to the proposal, or if there is anything else to improve your chances to be selected. Thanks for yor time.

2 1

[GSoC] template txt format corrupted
by Jyothish Soman 19 Mar '15

19 Mar '15

Hi, The txt shows up as corrupted. https://svn.boost.org/trac/boost/wiki/SoCSubmissionTemplate?format=txt Mozilla threw up the following: Corrupted Content Error The page you are trying to view cannot be shown because an error in the data transmission was detected. The page you are trying to view cannot be shown because an error in the data transmission was detected. Please contact the website owners to inform them of this problem. Best, Jyothish

2 1

[TR1] Time to remove TR1?
by Beman Dawes 19 Mar '15

19 Mar '15

We had a discussion months ago that came to the conclusion we should remove TR1. Do we have a volunteer to do the actual removal? --Beman

5 7

[gsoc] Suggestions on Proposal for Boost Document Library Project
by Anurag Ghosh 18 Mar '15

18 Mar '15

Hello Everyone I'm Anurag Ghosh, a 2nd year undergraduate student studying in IIIT-Hyderabad, India and I'm interested in making the Boost Document Library as a part of the Google Summer of Code 2015 Program. My proposal document can be viewed at https://github.com/anuragxel/boost-generic-document-library/wiki/Google-Sum… Kindly provide me with comments on the project proposal, as it may seem I have missed out on something or the other. I'm hopeful that a discussion would be very helpful in enriching my proposal. Also, I have developed a working prototype (only for OpenOffice/LibreOffice API currently) for this project (given as a competency test) whose code is hosted at https://github.com/anuragxel/boost-generic-document-library/ Also, Kindly suggest any changes as may deem fit to the code, I will make the changes appropriately. Thanks Anurag Ghosh (anuragxel)

3 5

[endian] Floating point reversal return by value concerns
by Beman Dawes 18 Mar '15

18 Mar '15

On Mon, Jan 26, 2015 at 11:25 PM, Cliff Green <cliffg(a)codewrangler.net> wrote: > > ..., I do have concern about one aspect of the new functionality (or > maybe I didn't read deep enough in the docs) - floating point endian > reversal functions which return by value. > > Unless something has significantly changed in the last few years, swapping > and returning floating point values is likely to silently change bits for > certain bit patterns / values. In particular, returning by value will > normalize some values (I assume as part of loading or accessing the value > into floating point CPU registers). There may be other floating point > characteristics that silently change the bits dealing with NaN and infinity > values (but I'm far from an expert on floating point computations). Could you please provide code for one or more return-by-value test cases that fail because the value gets normalized? I'm really hesitant to change anything without having test cases to work with. That would also help with documenting the specifics of the problem. Thanks, --Beman

2 3

[boost.ublas] [gsoc'15]
by Dhruv Kohli 18 Mar '15

18 Mar '15

Hello, I am Dhruv, majoring in Mathematics & Computing from Indian Institute of Technology, Guwahati. After doing a bit of research over the project ideas, I found the idea of further developing boost.ublas library interesting and have started writing the programming competency code. Here is the link to the code I've written yet: https://github.com/chiggum/boost.ublas/blob/master/gaussian_elimination.hpp. Though the code is not yet complete, but a naive version of algorithm is implemented and is integrated into ublas. To me, the code seems to be running properly. I need a little help for proceeding further. 1. Can someone please direct me to some code snippet that shows how the error handling code is written in boost library. To be specific, the gaussian elimination doesn't work on singular matrices. So, I would like to set the errno and display appropriate message to the user whenever a singular matrix is given as an input. 2. What sort of test code is required? Do we need to have a test case with hard-coded output to be checked against the results obtained when the test case is passed to the algo. Or there's some other predefined format for testing codes in boost library. Sorry, I haven't yet gone through most of the code in boost library. Any further helpful links/resources are welcomed. Thanks & Best regards, Dhruv https://github.com/chiggum P.S. Sorry for reposting the mail. I am still waiting for a reply.

7 10

[test] boost.test owner unresponsive to persistent problems for multiple years
by legalize+jeeves＠mail.xmission.com 18 Mar '15

18 Mar '15

[Please do not mail me a copy of your followup] See <https://svn.boost.org/trac/boost/ticket/10888> and <http://stackoverflow.com/questions/5209625/boost-test-error-messages-are-no…> Both contain a fix for this. On stack overflow the proposed fix is literally a single line change. This has been a problem for about 5 years and these simple fixes don't make it into the library. I'm sorry, but IMO this just isn't acceptable behavior for an owner of a library. Four years ago the maintainer made a comment on stack overflow thread to file a ticket on trac and then simply dropped the issue there as far as I can tell. That isn't proactive behavior, particularly when the stack overflow thread contains the fix. I know what you're going to say "the trac ticket was just filed a few days ago", but that's simply me pushing hard on something that should have been fixed around 2010. The problem has been known FOR FIVE YEARS and is EASY TO FIX. -- "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>

24 77

Re: [boost] Better late than never - command line interface to on line code generator
by Brian Wood 18 Mar '15

18 Mar '15

Rob Stewart writes: > On March 17, 2015 4:04:39 PM EDT, Brian Wood <woodbrian77(a)gmail.com> wrote: >> In 2007 there was some discussion here about on line >> code generation: > > Online generation of what kinds of code from what kinds of inputs? > The output is C++ serialization/middleware code. One thing it does is automate (and maintain) the creation of serialization functions. There are three kinds of input: 1. C++ header files. It doesn't support template definitions, but it can handle a lot of container classes. Here's an example of a header it can handle: http://webEbenezer.net/misc/account_info.hh . 2. Something called "middle" files. These describe the messages that you want to send and receive. Here's some middle code from a file called remote.mdl: middle_messages_back @out (messageid_t, std::vector<cmw_account_info>) @out (messageid_t, cmw::marshalling_integer, cui_generator) @out (messageid_t) } ----------------------- end of middle code ----------------------------------- The name, "middle_messages_back," is used as the name of a namespace in the generated output. @out means you want code generated to send a message. 3. Something called a request file that ties the first two types of input together. Here's an example: Header account_info.hh Header cui_generator.hh Middle-File remote.mdl Type-Used-for-Constants int16_t ------------------------ end of request file ------------------------------------- Header files are optional. One middle file is required in a request file. And here's the output that's generated from those inputs: http://webEbenezer.net/misc/zz.middle_messages_back.hh >> >> http://webEbenezer.net/build_integration.html > > That jumps right into the middle of the topic and assumes prior knowledge of the > context. > >> So now I would like to ask for further thoughts and >> feedback. How can it be improved? It has support for some >> Boost types and I'm open to adding support for more. Tia. > > You might start by clarifying the purpose of the tool. Ok, thanks for your comments. -- Brian Ebenezer Enterprises http://webEbenezer.net

1 0

Better late than never - command line interface to on line code generator
by Brian Wood 17 Mar '15

17 Mar '15

In 2007 there was some discussion here about on line code generation: http://lists.boost.org/Archives/boost/2007/02/116997.php One thing I said back then was: "There isn't a library to download." That's changed and now there's an archive that can be downloaded: http://webEbenezer.net/build_integration.html Martin Slater, commenting on the fact that the only way to use the code generator was through a web interface, said: "the fact that it cannot be integrated into the build process easily ... would deter many from using it" I agreed with him on that point at the time and have spent a lot of time since then developing a command line interface to make it easy to integrate on line code generation into build processes. The archive mentioned above is the result of that work. So now I would like to ask for further thoughts and feedback. How can it be improved? It has support for some Boost types and I'm open to adding support for more. Tia. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

2 1

Running b2 on develop needs asynch-exceptions=on
by Paul A. Bristow 17 Mar '15

17 Mar '15

After a recent pull of develop branch, I found that I also need to add asynch-exceptions=on to avoid a failure to build error: Tried to build the target twice, with property sets having error: these incompatible properties: > error: - <asynch-exceptions>off > error: - <asynch-exceptions>on (This is in addition to needing address-model=32 architecture=x86) b2 address-model=32 architecture=x86 asynch-exceptions=on I wasn't clear if this thread had come to a conclusion? [boost] [test] Re: Conflicts when building libraries at root http://lists.boost.org/Archives/boost/2015/03/220552.php looks as though a fix is still needed? Paul --- Paul A. Bristow Prizet Farmhouse Kendal UK LA8 8AB +44 (0) 1539 561830

11 24

Boost release 1.58.0 beta 1 is now available from SourceForge
by Marshall Clow 17 Mar '15

17 Mar '15

Boost release 1.58.0 beta 1 is now available from SourceForge See http://sourceforge.net/projects/boost/files/boost/1.58.0.beta.1/ <http://sourceforge.net/projects/boost/files/boost/1.58.0.beta.1/> This release contains three new libraries: • Endian: Types and conversion functions for correct byte ordering and more regardless of processor endianness. • Sort: includes spreadsort, a general-case hybrid radix sort that is faster than O(n*log(n)) • WinAPI: For details of what's in the release, see http://www.boost.org/users/history/version_1_58_0.html <http://www.boost.org/users/history/version_1_58_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. IMPORTANT NOTE: There is a bug with the build scripts; you have to specify the address-mode and architecture to b2. I used: ./b2 address-model=64 architecture=x86 (this will be fixed before the final release) Thanks, -- The Boost Release Team

3 4

Re: [boost] Boost 1_58_0_b1_rc2 is available for testing
by Aparna Kumta 17 Mar '15

17 Mar '15

I have few GitHub PR's that have been merged into the develop branch but not made it into the rc2 candidate. What would be the procedure to get them in? Thanks, Aparna ----- Original Message ----- From: mclow.lists(a)gmail.com To: boost(a)lists.boost.org Sent: Friday, March 13, 2015 9:51:58 AM GMT -08:00 US/Canada Pacific Subject: [boost] Boost 1_58_0_b1_rc2 is available for testing Release candidate files for 1.58.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. Changes since rc1: * Added the new libraries endian, sort, and winapi. IMPORTANT NOTE: There is a bug with the build scripts; you have to specify the address-mode and architecture to b2. I used: ./b2 address-model=64 architecture=x86 to test this. The files (and associated md5s) are: MD5 (boost_1_58_0_b1_rc2.7z) = c58623e8c3d48154bdb1fa2ee5cdbfab MD5 (boost_1_58_0_b1_rc2.tar.bz2) = 94480c2d9de3804a1a4b626a7828bec0 MD5 (boost_1_58_0_b1_rc2.tar.gz) = f7d4b398388c13ca30960c92b8d6342f MD5 (boost_1_58_0_b1_rc2.zip) = 2e9bdfd8dab269a69e4ea4e5ae5b6d47 Thanks! -- The release managers _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

[mpl] multiset
by Bruno Dutra 16 Mar '15

16 Mar '15

Hi Folks, Anyone knows what's up with this so called "multiset" I just found fiddling with the source code? The poor thing seems to have been left unfinished :( Any reasons anyone would not just go ahead and try bringing it to life? I would definitely be up to take the first step, I just don't know whether not I should carry on with it, I mean, isn't the whole purpose of all this is encouraging people like myself to take the step ahead and just do it? Anyways, MPL seems to have seen better days of activity back in the day, there's lots of opportunities for improvement still and I for one would be glad to help developing some fancier features. I'd be glad to hear what you guys have to say. Best regards, *Bruno C. O. Dutra*

23 93

Concurrent Unordered Map
by Petrisor Cosmin-ioan 16 Mar '15

16 Mar '15

Hello, My name is Cosmin Petrisor and I'm currently enrolled in the 3rd year of study (junior year) of the Computer Science program, at University Politehnica of Bucharest.I posted on boost g+ community, but no one replied. I am currently implementing the copy and move constructors. I managed to figure out how rehash is working and the copy constructor is almost done. On the other hand, is ok to use the copy constructor in the implementation of the move constructor? Something like: concurrent_unordered_map(concurrent_unordered_map &&old) BOOST_NOEXCEPT :concurrent_unordered_map((const concurrent_unordered_map &)old){ old.clear(); } or would be better to implement the copy and move assignment operators and define the copy and move constructors like: concurrent_unordered_map(const concurrent_unordered_map &old){ *this = old; } concurrent_unordered_map(concurrent_unordered_map &&old) BOOST_NOEXCEPT : { *this = std::move(old); } Best regards,Cosmin - Ioan Petrisor

2 1

Re: [boost] [Boost-testing] Release branch purge policy request
by Jim Bell 14 Mar '15

14 Mar '15

On 2015-03-13 12:17 PM, Rene Rivera wrote: > On Wed, Mar 11, 2015 at 11:29 AM, Jim Bell <Jim(a)jc-bell.com > <mailto:Jim@jc-bell.com>> wrote: > > Just wanted to put this out there again since it seems to have > flown under the radar... > > http://lists.boost.org/boost-testing/2015/02/7926.php > > I suggest that, for the release branch, we lengthen the 15-day > purge to > 90 days or more. > > > My immediate answer is no. At minimum because.. > > Those looking to that matrix are determining where the last boost > release works or breaks for their platform. A different audience than > maintainers. > > > I don't see how extending the purge would address that. The master > branch testing is for the *next* release. Hence it doesn't say > anything about previous release (not even the last release). > While I agree that the master branch is for the next release, I'd dispute strongly that it doesn't say "anything" about previous releases. It says just about everything for those libraries which haven't undergone revision, and still says a lot--or at least something--for the rest. My personal experience has been finding the bug I suspected in a library by looking at the matrix, sometimes with the library a couple revs out of date. Just guessing, but I'd say it's a pretty good bet statistically that a yellow mark on the master regression will still be yellow after 90 days (at least). When a boost user looks at an out-of-date matrix, what does (s)he see for his/her platform? Mostly green (hopefully!), some yellow that's been fixed (maybe!), some that hasn't. That's more valuable than seeing nothing at all. Please reconsider. (Ok, ok, 90 days is pretty long, but still...) Cross-posting with the main list since (I say) the audience is wider.

1 0

[GSoC] Enhanced vector and deque proposal
by Benedek Thaler 14 Mar '15

14 Mar '15

Hi, The initial version of my proposal to the `Enhanced vector and deque` project is ready, please check it out; feedback is welcome: https://gist.github.com/erenon/70e36f6a7d7725cf8767 Thanks, Benedek

1 0

Re: [boost] GSOC 2015 : Project on Concurrent Hash Tables
by Amarnath V A 14 Mar '15

14 Mar '15

Thanks for the prompt reply Niall. I have got a few more questions. 1. I could not make out the use of _oldbuckets in the code. What purpose does it serve? 2. I see a swap() function which is not used anywhere in the codebase. Is it dead code? 3. And I have a generic question regarding std::atomic. I was trying to code the move constructor and finally ended up failing miserably to move the reference of _bucket. I could not figure out how to do it. Could you point me to some documentation which would help me to achieve the same. To give a fair idea about my last question, let me elaborate what I was trying to do. I have got the reference of _buckets and have assigned it to new variable using store and load methods of atomic. But, I am not confident if that is the right way to go about. And secondly, I see that I am not able to reset the reference of original. Thanks, Amarnath

3 26

GSoC '15 Enhanced Vector and Deque
by Pranav Vaish 14 Mar '15

14 Mar '15

Hello, My name is Pranav. I had sent an email on this mailing list earlier regarding some doubt in the implementation of the programming competency test for this project. I have gone ahead and written some code. The code is incomplete. Iterator code has not yet been written and container methods and some error handling is left. I would appreciate it if someone could review my code and tell me what else I will need to implement. #ifndef BOOST_VECTOR #define BOOST_VECTOR #include<exception> #include<iostream> struct exception_push_back_capacity_exceed : public std::exception { const char * what () const throw () { return "Vector Capacity Exceeded"; } }; namespace boost { template<typename T> class vector { public: vector(int); ~vector(); void push_back(T); T operator[](const int& pos) { return *(mem_start+pos); } private: T* mem_start; int size; int capacity; }; template<typename T> vector<T>::vector(int capacity_constr) { size=0; capacity=capacity_constr; mem_start = new T[capacity]; } template<typename T> vector<T>::~vector() { delete [] mem_start; } template<typename T> void vector<T>::push_back(T val) { try { if(size==(this->capacity)) { throw exception_push_back_capacity_exceed(); } mem_start[size++]=val; } catch(exception_push_back_capacity_exceed& e) { std::cout<<e.what()<<std::endl; } } } #endif As I am new to contributing for Open Source, I'm not sure if sending links on this mailing list is disrespectful or not. If it is I apologize for this. Code can be found on https://github.com/vaishious/boost.vector Thanks -Pranav

2 2

[thread] Testing with Sanitisers (ASAN, TSAN, MSAN)
by Ben Pope 13 Mar '15

13 Mar '15

I'm going to be bringing up some more testers, and I wondered if the results are meaningful, or can be made meaningful. The tester is "BenPope x86_64 Ubuntu", first available results are for TSAN, and it shows some failures. I'm under the impression that some of the sanitisers may need to be taught about certain constructs in order to be effective (e.g. boost::detail::atomic_increment: http://www.boost.org/development/tests/develop/developer/output/BenPope%20x…) Other failures look legitimate at first glance (e.g. Cycle in lock order graph: http://www.boost.org/development/tests/develop/developer/output/BenPope%20x…) I shall endeavour to get nicer stack traces, I think I need to tell it about llvm-symbolizer, althouh I haven't always had success in the past, any advice or suggestions are welcome. Ben

3 8

[ GSoC 2015 ][ Vector ]
by Afonso Tinoco 12 Mar '15

12 Mar '15

Hello, I'm a student who would love to participate on GSoC 2015, in the '5. Enhanced vector and deque containers' category. First of all I'm trying to engage the community, so... hum... hello world! I'm rigth now begining to take the competency test [1], but I could not understood whether I should write a boost biased implementation or not. This is, may I write a container based on no other boost .hpp just as a PoC that will have better readability and will take (far) less time to code, or should I write something similar to the boost vector implementation [2]? [1] https://svn.boost.org/trac/boost/wiki/SoC2015#Programmingcompetencytest3 [2] https://github.com/boostorg/container/blob/master/include/boost/container/v… Best Regards, Afonso Tinoco --------------------------- Aerospace Engineering Student Instituto Superior Técnico dedos(a)tecnico.ulisboa.pt

1 0

Documentation typos. RE: Boost 1_58_0_rc1 is available for testing
by Fletcher, John P 12 Mar '15

12 Mar '15

I have found a few documentation typos and have them on develop. Is it O.K. to put them onto master as well? Thanks John

2 1

release1.58 -- Permission to merge Boost.Optional
by Andrzej Krzemienski 12 Mar '15

12 Mar '15

Hi, I have three bug fixes in Boost.Optional on branch develop waiting to be merged to master. Apparently I missed the deadline for the Beta release. Is there any chance I can still put them into 1.58 release? Can I merge the bug fixes to master? Regards, &rzej

2 1

[GSoC '15] Boost Documant Library development
by Abhinav Tripathi 12 Mar '15

12 Mar '15

Hi, I am 2nd year B.Tech Student in IIT Indore,India. I have pretty much experience (approx 7 years) with C++ and many of its libraries... I am interested in development of the Document Library for Boost. I have a rough idea on what exactly is required in the project and am quite interested in doing this one. I was looking for any suggestions/comments to help me get going in this direction. . Regards, Abhinav

1 0

Re: [boost] [Boost-maint] [context, config] Always setting address-model and architecture (Was: Conflicts when building libraries at root)
by Vladimir Prus 11 Mar '15

11 Mar '15

On 02/18/2015 05:55 PM, Jürgen Hunold wrote: > Hi Volodya, > > Am Mittwoch, 18. Februar 2015, 14:28:48 schrieb Vladimir Prus: >> On 01/05/2015 10:37 PM, Jürgen Hunold wrote: >>> >>> Unfortunately, we still have Boost.Context open. >> >> Okay, so the problem we're facing is that building master results in: >> >> error: Tried to build the target twice, with property sets having >> error: these incompatible properties: >> error: >> error: - none >> error: - <address-model>32 <architecture>x86 >> >> What happens is this: >> >> - Context library is built >> - It detects default address model and architecture of the current >> toolchain, and adds those to requirements >> - Since there's a global dependency on 'headers' target, this pretty much >> immediately rebuilds everything with new address-model and architecture >> properties. > > Not correct: Boost.Context needs Boost.System so it requires a build with > those properties. As they have currently have no defaults, the explicit values > differ from the implizit default (none) for both. Well, it my brief check, it was the headers->system path that first requested system with address-model=32. Anyway, it does not matter for the rest of this discussion. >> - We get property set clash > > Correct. > >> One way to solve this is to restructure Boost.Context setup so that added >> properties do not escape. It's doable, but probably will be fragile. > > No doubt. > >> Another way is to take libs/context/config, move it to libs/config, and make >> sure these properties are applied globally. That seems preferable. John, >> any objections? > > I thought the correct way would be to move the architecture detection upwards? That's roughly what I propose, too - but there are few further tweaks and options. > We would need something along those lines (from context/bulld/Jamfile.v2) > > alias select_asm_context_sources > : asm_context_sources > : [ architecture.architecture ] > [ architecture.address-model ] > ; > > in boostcpp.jam in order to detect the architecture everywhere. It would then > be helpfull to have sensible default values in order to shorten the generated > paths for those defaults. Right, so steps would be: 1. Move actual tests into config (we do need to have a few cpp files) 2. Move architecture.jam into either Boost.Build or boostcpp.jam 3. Make sure we don't generate extra path elements for default address model 4. Introduce a way to do these tests without requiring a bunch of .cpp files - sure Boost.Build can generate them on the fly. 5. Make these checks be automatic for all projects. It seems that 1-2 should solve the immediate problem, and 1-3 should be pretty good, although going all the way to 5 would be cool. > Another solution would be to generate a "header-only" variant of Boost.System > and use this nearly everywhere. This would solve *lots* of dependency > problems... Not sure I have an opinion on that. -- Vladimir Prus CodeSourcery / Mentor Embedded http://www.mentor.com/embedded-software/

7 13

[svg] is there any interest in a Scalable Vector Graphics library?
by Oleg Maximenko 11 Mar '15

11 Mar '15

Hi, I developed library that carries out large amount of tasks related to SVG reading - parses various SVG syntaxes (with Spirit), makes some conversions and implements few non-trivial algorithms common to SVG reading applications. Using this library developer may focus on importing/drawing tasks, leaving SVG details to library. I believe that it is (almost) generic enough for Boost standards, but not sure if there is a place for it in Boost collection. Should I move toward library proposal? Any feedback is welcome. http://svgpp.org/ https://github.com/svgpp/svgpp Thanks, Oleg

6 9

Mailing List For GSoC 2015
by Abhinav Tripathi 11 Mar '15

11 Mar '15

On the site, it was just written to discuss the projects in mailing lists. Wanted to confirm if it the correct list to discuss about GSoC 2015 Projects. . If it is not please let me know the correct one. . Thanks and regards, Abhinav

2 1

[type_erasure] Downcasting is now possible
by Steven Watanabe 10 Mar '15

10 Mar '15

AMDG I've been asked about a function for downcasting an any several times, and I finally implemented it. Short story: you can now use dynamic_any_cast to convert between two arbitrary any types. Here's a quick example which tries to cast a boost::any equivalent to a boost::function equivalent. using plain_any = any<mpl::vector< copy_constructible<>, relaxed> >; template<class Sig> using any_function = any<mpl::vector< callable<Sig>, copy_constructible<>, relaxed> >; bool try_call(const plain_any& arg) { try { auto fun = dynamic_any_cast<any_function<void()> >(arg); fun(); } catch(bad_any_cast&) { return false; } return true; } void global_register() { register_binding<copy_constructible<>, void(*)()>(); register_binding<typeid_<>, void(*)()>(); register_binding<callable<void()>, void(*)()>(); } void do_something() { std::cout << 42 << std::endl; } int main() { global_register(); plain_any x = &do_something; if(try_call(x)) { std::cout << "x is a function" << std::endl; } plain_any y = 10; if(!try_call(y)) { std::cout << "y is NOT a function" << std::endl; } } The calls to register_binding are necessary for this to work, unfortunately. I don't think it's possible to implement dynamic_any_cast without some kind of registration, but at least it only needs to be called once for each concept/type combination. If anyone has any better ideas about how to handle this, I'd love to hear it. Comments, questions, and criticism are welcome. In Christ, Steven Watanabe

3 8

Boost GSoC '15. Enchanced Vector and Deque Containers
by Pranav Vaish 10 Mar '15

10 Mar '15

Hello developers, My name is Pranav Vaish. I'm a second year Undergraduate in Computer Science at Indian Institute of Technology, Kanpur. I am extremely interested in doing a GSoC project on Enhanced Vector and Deque Containers. I have used std::vector and std::deque containers (Default C++ containers. Not C++11 ones) several times and am quite familiar with their usages, though not so much with their code . I am strong at programming in C++ but have never written any library code prior to this. I am competent at understanding and working with all algorithms necessary for this project. I have spent some time thinking about the problem for the competency test and I would like know if I am supposed to understand the code of the standard containers and modify the code to suit our purposes or to rewrite it all from scratch in my own way. Also must I have any knowledge about BOOST code? If yes, which part of it? Thank You, ------ Pranav Vaish

1 0

[random][rational] Is there any standard way to generate a random rationals?
by Damian Vicino 10 Mar '15

10 Mar '15

Hi, I’m using Boost.Rational in a simulation program. for some experiment, I want to generate some random values between 2 rational numbers. I’m wondering if someone already worked on this.

5 7

gSoC 2015 - Boost Document Library development Project
by Anurag Ghosh 10 Mar '15

10 Mar '15

Hello I'm Anurag Ghosh, a Computer Science student in 2nd year. I'm interested in working for Boost in GSoC 2015 and found the Boost Document Library development project really interesting. I'm reading the links provided on the page. Any pointers on how should I go about ahead after that ? Thanks Anurag Ghosh

2 1

GSoC 2015 - Boost.uBLAS a library for matrix computations Project
by Yan Ni 10 Mar '15

10 Mar '15

Hello I'm Yan Ni, a CS undergraduate student in 4th year. I am interested in working for Boost in GSoC 2015 and found the uBLAS project very interesting. I've read some the codes on github and has written a little code (including a simple test) of Gaussian Elimination Algorithm as the competency test: https://github.com/leckie-chn/ublas. I've also read about Raj's post about the algorithms need to be implemented. And I think that the focus on this project are both accuracy (using some numerical algorithm instead of classical math methods)and speed (regarding cache & memory utilization). Please let me know your preference. Thank you. -- with kind regards ------------------------------------------------------------------ Yan Ni, undergraduate of Department of Computer Science, School of Electronic Engineering & Computer Science, Peking University

2 1

Library for await and stackless coroutine emulation
by TONGARI J 10 Mar '15

10 Mar '15

Hi there, I just want to announce my recent work on a small library called `CO2`, which intend to emulate await/yield and stackless coroutine. https://github.com/jamboree/co2 This library depends on Boost.Preprocessor, while I'm not proposing this library to Boost at this moment, if there's much interest in this library, I'd think about it. The idea is based on N4286: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4286.pdf The library is still work in progress, but the core features are complete, so if you're interested in the resumable function proposal and don't have a tool to experiment with, this library may serve the purpose. You can find a more detailed description on the github page, if you want to know some number about performance, from a rough test borrowed from Boost.Coroutine (symmetric/performance_switch.cpp), the avg cpu cycles for context-switch are: Boost.Coroutine: 40 cycles CO2: 16 cycles built-in await: 9 cycles (compiled with MSVC14, x64) Feedbacks will be appreciated. Thanks

2 2

Release 1.58. - Permission to merge Boost.Integer
by Vicente J. Botet Escriba 09 Mar '15

09 Mar '15

Hi, I forget to do the merge to master of the last 5 commits in https://github.com/boostorg/integer/commits/develop Please, let me know if I can do the merge? Best, Vicente

5 5

[interprocess] BOOST_NO_SWPRINTF not honored...
by Joseph Van Riper 09 Mar '15

09 Mar '15

This might seem pedantic, but with Microsoft's compilers magnify this issue a bit. boost/interprocess/detail/win32_api.hpp, line 2255 (as of boost 1.57) uses std::sprintf even when BOOST_NO_SWPRINTF is defined. This causes a problem for some folks (like me), as VC++ 2013 (and possibly other Microsoft compilers) have set a pragma deprecating this function, which leads to outright compiler errors when compiled with #pragma strict_gs_check(on), as is required in some environments who are picky about security. I confess, I have not checked to see if interprocess still does this in the latest code, but if it doesn't, I wonder if it could use an alternative (Microsoft recommends sprintf_s, but you might know of something better). - Trey

1 0

[1.58.0] Release Notes
by Daniel James 09 Mar '15

09 Mar '15

Hi, The beta release is coming up soon, so please can you add your release notes as necessary. Easiest way is probably to create a pull request at: https://github.com/boostorg/website/blob/master/feed/history/boost_1_58_0.q… thanks, Daniel

3 3

[gsoc15]Request for feedback: Enhanced vector and deque containers proposal
by Sandilya Jandhyala 08 Mar '15

08 Mar '15

Hello Boost, My name is Sandilya Jandhyala, and I'm interested in the 'Enhanced vector and deque containers' project idea. I've prepared a first draft of my proposal. It can be viewed here: https://github.com/jysandy/boost-gsoc-proposal/blob/master/README.md I haven't included my solution to the programming competency test, since I don't want it to be copied. I'd appreciate feedback/suggestions/criticisms, since I feel that the proposal still has some room for improvement. I'd also appreciate suggestions for additional features. Thanks, Sandilya

1 0

GSoC project " Enhanced vector and deque containers "
by ahmad samir 08 Mar '15

08 Mar '15

Good morning guys I'm Ahmad, I want to contribute in " Enhanced vector and deque containers ", I'm working on the programming competency test, but I have a question about the main idea * The idea is " Write full-fledged and enhanced C++11 versions of std::deque and std::vector with extra functionality that gives the programmer more control over buffers, segments and iteration " . * Is there specific features or new functionality you want to add or I should search for some new features in other languages like " java & python " which isn't in C++ vector and deque containers, or search for what can give the programmer more control on these containers ?.

1 0

GSoC 2015 Paritipation
by vladiksonic＠mail.ru 07 Mar '15

07 Mar '15

Dear Boost, I am eager to participate in GSoC 2015 in one of the two projects (from this page: https://svn.boost.org/trac/boost/wiki/SoC2015 , 1 or 5). As far as I understood - the first one is tougher, and (as for me) conditions are clearer, and the second one is (seemingly) simpler. I am totally new to Boost (never used it, actually, but that is because I mostly used C++ in programming contests). I am familiar with algorithms (from contests), and testing (manual, both for stability and performance), but I am not very familiar with C++11 (but I can compensate for that, because I have knowledge of other languages (C#, Javascript (nodejs)) and older C++ versions), and automated tests. At first, I'd like to ask - what should I choose? My main goals are: 1) To enter the community 2) Learn C++11 new features (I will start early on that, obviously) 3) And to learn how to code open-source programs (up till now I only have closed-source ones, apart from one project, which has not-so-good code quality - see here: https://github.com/hotab/OpticalBuilder ) 4) Plus understand better how to maintain library code (I already have some understanding of that, but I want to sharpen it). Both can give me that. I'm looking forward to hearing from you, Vladislav Babkin

1 0

[dynamic_bitset] Maintainer available?
by Riccardo Marcangelo 07 Mar '15

07 Mar '15

Hi Boost developers, Does anybody know if the maintainer of dynamic_bitset is available? I made some contributions to dynamic_bitset on GitHub last year but there doesn't appear to have been any activity in the repository for many months. My pop_back() commit was accepted into the 'develop' branch over 5 months ago and, despite passing tests, has yet to be merged to 'master'. I also implemented capacity(), reserve(), and shrink_to_fit() which have been sitting in a pull request waiting to go into 'develop' since November. It would be nice to get these into 1.58.0 if possible. Kind regards, Riccardo -- View this message in context: http://boost.2283326.n4.nabble.com/dynamic-bitset-Maintainer-available-tp46… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

GSoC project " Enhanced vector and deque containers "
by ahmad samir 07 Mar '15

07 Mar '15

Good morning guys I'm Ahmad, I want to contribute in " Enhanced vector and deque containers ", I'm working on the programming competency test, but I have a question about the main idea * The idea is " Write full-fledged and enhanced C++11 versions of std::deque and std::vector with extra functionality that gives the programmer more control over buffers, segments and iteration " . * Is there specific features or new functionality you want to add or I should search for some new features in other languages like " java & python " which isn't in C++ vector and deque containers, or search for what can give the programmer more control on these containers ?.

1 0

[GSOC2015] uBLAS Matrix Solver Project
by Rajaditya Mukherjee 07 Mar '15

07 Mar '15

Hi, My name is Raj and I am Phd student in Computer Graphics. I am interested in tackling the problem of uBLAS Matrix Solver and in order to write my proposal, I am looking for inputs for which of the following algorithms will be most useful for prospective users in boost-numeric library. Here is a categorical list of all the prospective ones which will bring uBLAS updated to other commercial libraries like Eigen/Armadillo. Please let me know your preferences.... *David Bellot* : As a potential mentor, do you have any specific additions or deletions for this list? This could also be useful for other candidates pursuing this project. *DENSE SOLVERS AND DECOMPOSITION* : 1) *QR Decomposition* - *(Must have)* For orthogonalization of column spaces and solutions to linear systems. (Bonus : Also rank revealing..) 2) *Cholesky Decomposition* - *(Must have)* For symmetric Positive Definite systems often encountered in PDE for FEM Systems... 3) *Householder Method* - Conversion to tridiagonal form for eigen solvers. *SPARSE SOLVERS AND PRECONDITIONERS* : 1) *Conjugate Gradient* - *(Must have)* For symmetric Positive Definite systems, this is the kryvlov space method of choice. Both general and preconditioned variants need to be implemented for convergence issues. 2) *BiCGSTAB* *(Needs introspection)* - For non symmetric systems.. 3) *Incomplete Cholesky Decomposition* *(Good to have)* - For symmetric Positive definite sparse matrices, to be used as preconditioner as extension to (1) for preconditioned CG Methods ... 4) *Jacobi Preconditioner* *(Must have)* - As prerequisite for step(1). *EIGEN DECOMPOSITION MODULES (ONLY FOR DENSE MODULES)**:* 1) *Symmetric Eigen Values* - *(Must have)* Like SSYEV Module in Lapack - That is first reduction to a tridiagonal form using Householder then using QR Algorithm for Eigen Value computation. 2) *NonSymmetric Eigen Values* - *(Good to have)* Like SGEEV module in Lapack - using Schur decompositions as an intermediate step in the above algorithm. 3) *Generalized Eigen Values* - *(needs introspection)* I use this in my research a lot and its a good thing to have.. ** Computing Eigen Decomposition of sparse modules needs special robust numerical treatment using implicitly restarted arnoldi iterations and may be treated as optional extensions.

3 3

[MPL lite or MPL 2] A modest proposal
by Robert Ramey 07 Mar '15

07 Mar '15

I've been looking at another thread which address the problems of maintaining and/or finding a maintainer for MPL. I've come up with an idea for a proposal which I've laid out here: Library Idea MPL lite or MPL2 <http://rrsd.com/blincubator.com/bi_suggestion/mpl-lite-or-mpl2/> -- View this message in context: http://boost.2283326.n4.nabble.com/MPL-lite-or-MPL-2-A-modest-proposal-tp46… Sent from the Boost - Dev mailing list archive at Nabble.com.

8 18

[asio] Massive regression failures
by Aparna Kumta 06 Mar '15

06 Mar '15

I am running the regression tests on the develop branch with Oracle Solaris Studio12.4 on Solaris 11.2 OS. Tests for asio fail as follows: ../boost/system/config.hpp", line 34: Error: #error Must not define both BOOST_SYSTEM_DYN_LINK and BOOST_SYSTEM_STATIC_LINK. I looked at the developer issues on http://www.boost.org/development/tests/develop/developer/issues.html and see that asio tests fail similarly. I'm not sure what causes both BOOST_SYSTEM_DYN_LINK and BOOST_SYSTEM_STATIC_LINK. to be defined on the command line. Any idea on how this can be fixed? Thanks, Aparna

2 2

[move] unique_ptr: problems with move-assign constructor when used with base/derived classes in C++03
by Adam Romanek 06 Mar '15

06 Mar '15

Hi, There is a problem with move-assignment constructor in boost::movelib::unique_ptr when used with a pair of base/derived classes in C++98/03 mode [1] (uncomment the code to see the compiler error). Is it a known issue? Or a limitation of the emulation? I discovered the issue when I wanted to use boost::movelib::make_shared in an answer to a question on StackOverflow [2], i.e. return boost::movelib::make_shared<Derived>(); Where the return value is boost::movelib::unique_ptr<Base>, but unfortunately because of this issue, in C++03 we need to use: return unique_ptr<Base> x(new Derived()); I can create a ticket if that is desired. Nevertheles, thanks for boost::movelib::unique_ptr anyway! BTW, note how the appearance of boost::movelib::unique_ptr makes the most voted answer on the question [3] invalid. This is where my answer comes in. Best regards, Adam Romanek [1] http://melpon.org/wandbox/permlink/8Rvk2g7LJ0Ey0BQL [2] http://stackoverflow.com/a/28193068/1776942 [3] http://stackoverflow.com/q/2953530/1776942

2 2

GSoC 2015 project " Enhanced vector and deque containers "
by ahmad samir 06 Mar '15

06 Mar '15

Good morning I wish to contribute in this project, now I am working on programming competency test. I want to ask about Is there specific or preferable method to show you my work or just upload my code in any online compiler or Github?.

1 0

[random] Quantization effects in generating floating point values
by John Maddock 05 Mar '15

05 Mar '15

First off, I notice there are no examples for generating floating point values in Boost.Random, so maybe what follows is based on a misunderstanding, or maybe not... Lets say I generate values in [0,1] like so: boost::random::mt19937 engine; boost::random::uniform_01<boost::random::mt19937, FPT> d(engine); FPT d = d(); //etc Where FPT is some floating point type. Now my concern is that we're taking a 32-bit random integer and "stretching" it to a floating point type with rather more bits (53 for a double, maybe 113 for a long double, even more in the multi-precision world). So quantization effects will mean that there are many values which can never be generated. It's true that I could use independent_bits_engine to gang together multiple random values and then pass that to uniform_01, however that supposes we have an unsigned integer type available with enough bits. cpp_int from boost.multiprecision would do it, and this does work, but the conversions involved aren't particularly cheap. It occurs to me that an equivalent to independent_bit_engine but for floating point types could be much more efficient - especially in the binary floating point case. So I guess my questions are: Am I worrying unnecessarily? and What is best practice in this area anyway? Thanks, John.

4 12

[build] adding a rquirement for Cygwin only?
by Peter Dimov 05 Mar '15

05 Mar '15

Is it possible to add, for example, <threadapi>pthread to a project's requirements, but only for Cygwin? This works: <toolset>gcc,<target-os>windows:<threadapi>pthread but it also applies to MinGW. This only applies to MinGW: <toolset-gcc:flavor>mingw:<threadapi>pthread but Cygwin has no <flavor>. This: <toolset>gcc,<target-os>windows:<threadapi>pthread <toolset-gcc:flavor>mingw:-<threadapi>pthread doesn't work. There are references to <target-os>cygwin in gcc.jam, but <target-os> is actually 'windows'.

3 6

Call for Papers Meeting C++ 2015
by Jens Weller 05 Mar '15

05 Mar '15

Hello boost community! I'd like to inform you that the call for papers for this years Meeting C++ conference is running! It will end at April 5th, boost related talks are very welcome! This years conference will be again at the Andels Hotel in Berlin, on the 4th and 5th december. It will feature 2 keynotes and 4 Tracks a 7 Talks, this years theme track is "embedded and IoT". There is again also a student program, which will be announced later. Call for Papers: http://meetingcpp.com/index.php/newsreader/items/call-for-papers-for-meetin… Announcement: http://meetingcpp.com/index.php/newsreader/items/announcing-meeting-c-2015.… kind regards, Jens Weller

1 0

GSOC 2015 : Introduction
by roopal nahar 05 Mar '15

05 Mar '15

Hi, I am Roopal, an undergraduate student from IIIT, Hyderabad, India. I would like to express my candidature as an applicant for GSOC, 2015. This is my first time contributing to an open source organization. I have been studying the list of ideas proposed so far and "Boost.uBLAS a library for matrix computations" has caught my attention. Before contacting you, the following is the spade work I have done so far : 1.) The Panda Libraries <http://pandas.pydata.org/pandas-docs/dev/generated/pandas.DataFrame.html> 2.) R package <http://cran.r-project.org/web/packages/data.table/index.html> Apart from the competency test(which I believe, will be submitted at the proposal time), what are your expectations from me and what can I do to prove my seriousness for the candidature before the proposal deadline? I will be joining the IRC channel as soon as my college proxy starts to work(A good time to invest in VPN! :P ) Cheers, Roopal

1 0

GSoc 2015 libraries
by Ágota Horváth 05 Mar '15

05 Mar '15

Hello, I'm Ágota Horváth and I'd like to choose one of the Boost C++ Libraries project this year, because of the language and the interesting projects. However, I haven't really worked with libraries yet, so I'd appreciate if you could tell me how to get started. Thanks, Ágota

1 0

[release 1.58] additional example
by Oliver Kowalke 05 Mar '15

05 Mar '15

Hello, I'd like to add an additional example to boost.context - do I get the permission? best regards, Oliver

1 0

New to open source
by Brian Wood 04 Mar '15

04 Mar '15

Pranjal Rai writes: > Hi, > I am new to open source and would like to contribute to it. > Can someone please guide me what to do next? Hi, Pranjal, I have an archive of serialization and messaging code available here: http://webEbenezer.net/build_integration.html . My software has serialization support for some Boost types and I'm open to adding support for more Boost types. That is one way I contribute to Boost. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

2 1

New to the List?
by Rob Stewart 04 Mar '15

04 Mar '15

It seems that each newcomer to this mailing list manages to sign up without reading about our policies[1]. If you're one of them, please read them, paying particular attention to [2] and [3], before your next post. [1] http://www.boost.org/community/policy.html [2] http://www.boost.org/community/policy.html#subject-line [3] http://www.boost.org/community/policy.html#quoting ___ Rob (Sent from my portable computation engine)

2 2

boost.ublas gsoc 2015
by Dhruv Kohli 04 Mar '15

04 Mar '15

Hello, I am Dhruv, majoring in Mathematics & Computing from Indian Institute of Technology, Guwahati. After doing a bit of research over the project ideas, I found the idea of further developing boost.ublas library interesting and have started writing the programming competency code. Here is the link to the code I've written yet: https://github.com/chiggum/boost.ublas/blob/master/gaussian_elimination.hpp. Though the code is not yet complete, but a naive version of algorithm is implemented and is integrated into ublas. To me, the code seems to be running properly. I need a little help to proceed further. 1. Can someone please direct me to some code snippet that shows how the error handling code is written in boost library. To be specific, the gaussian elimination doesn't work on singular matrices. So, I would like to set the errno and display appropriate message to the user whenever a singular matrix is given as an input. 2. What sort of test code is required? Do we need to have a test case with hard-coded output to be checked against the results obtained when the test case is passed to the algo. Or there's some other predefined format for testing codes in boost library. Sorry, I haven't yet gone through most of the code in boost library. Any further helpful links/resources are welcomed. Thanks & Best regards, Dhruv https://github.com/chiggum

1 0

An invalid XML character (Unicode: 0x8) problem because of property_tree::xml_parser::write_xml
by Rohan Shetty 04 Mar '15

04 Mar '15

Hi, I have used the following C++ code to generate the xml boost::property_tree::ptree ptResponse; // Populate the tree from the Microsoft Outlook contactsstd::stringstream buf; const std::string enc("utf-8"); boost::property_tree::xml_writer_settings<char> settings(' ', 0, enc); boost::property_tree::xml_parser::write_xml(buf, ptResponse, settings); This works fine. But in one of the customer's machine, when reading the this(xml content) in a JAVA program. I get the following error An invalid XML character (Unicode: 0x8) was found in the element content of the document. Any help in solving this is appreciated. Regards,Rohan

3 6

[foreach] Errors using foreach
by Edward Diener 04 Mar '15

04 Mar '15

When trying to use the foreach library, whether running it tests or trying to build quickbook which uses the foreach macro, I am seeing from different compilers: gcc-4.9.2 > In file included from stl_byval.cpp:15:0: > ./utility.hpp: In function 'bool sequence_equal_byval_n(foreach_container_type&, const char*)': > ..\..\../boost/foreach.hpp:906:96: error: no matching function for call to 'encode_type(foreach_container_type&, boost::is_const<std::list<int> >*)' > (true ? 0 : boost::foreach_detail_::encode_type(COL, boost::foreach_detail_::is_const_(COL))) > ^ > ..\..\../boost/foreach.hpp:1013:9: note: in expansion of macro 'BOOST_FOREACH_TYPEOF' > , BOOST_FOREACH_TYPEOF(COL) \ > ^ > ..\..\../boost/foreach.hpp:1095:77: note: in expansion of macro 'BOOST_FOREACH_BEGIN' > if (boost::foreach_detail_::auto_any_t BOOST_FOREACH_ID(_foreach_cur) = BOOST_FOREACH_BEGIN(COL)) {} else \ > ^ > ./utility.hpp:20:5: note: in expansion of macro 'BOOST_FOREACH' > BOOST_FOREACH( foreach_value_type i, rng ) > ^ clang > In file included from stl_byval.cpp:25: > ././utility.hpp:20:5: error: no matching function for call to 'encode_type' > BOOST_FOREACH( foreach_value_type i, rng ) > ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ > ..\..\..\boost/foreach.hpp:1095:77: note: expanded from macro 'BOOST_FOREACH' > if (boost::foreach_detail_::auto_any_t BOOST_FOREACH_ID(_foreach_cur) = BOOST_FOREACH_BEGIN(COL)) {} else \ > ^~~~~~~~~~~~~~~~~~~~~~~~ > ..\..\..\boost/foreach.hpp:1013:9: note: expanded from macro 'BOOST_FOREACH_BEGIN' > , BOOST_FOREACH_TYPEOF(COL) \ > ^~~~~~~~~~~~~~~~~~~~~~~~~ > ..\..\..\boost/foreach.hpp:906:17: note: expanded from macro 'BOOST_FOREACH_TYPEOF' > (true ? 0 : boost::foreach_detail_::encode_type(COL, boost::foreach_detail_::is_const_(COL))) > ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ > ..\..\..\boost/foreach.hpp:401:22: note: candidate function [with T = std::list<int, std::allocator<int> >] not viable: no known conversion from 'boost::is_const<list<int, allocator<int> > > *' to 'boost::mpl::false_ *' (aka 'bool_<false> *') for 2nd argument > inline type2type<T> *encode_type(T &, boost::mpl::false_ *) { return 0; } > ^ > ..\..\..\boost/foreach.hpp:404:30: note: candidate function [with T = std::list<int, std::allocator<int> >] not viable: no known conversion from 'boost::is_const<list<int, allocator<int> > > *' to 'boost::mpl::true_ *' (aka 'bool_<true> *') for 2nd argument > inline type2type<T, const_> *encode_type(T const &, boost::mpl::true_ *) { return 0; } > ^ > In file included from stl_byval.cpp:25: > ././utility.hpp:20:5: error: no matching function for call to 'encode_type' > BOOST_FOREACH( foreach_value_type i, rng ) > ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Does anybody know what is causing this error ? I can't seem to proceed in building documentation with quickbook until I can get foreach working. I pulled the latest foreach from the master branch and ran b2 headers but still the problem occurs.

3 3

New to open source
by Pranjal Rai 03 Mar '15

03 Mar '15

Hi, I am new to open source and would like to contribute to it. Can someone please guide me what to do next? Pranjal Rai

3 2

[gsoc15] Queries about enhancement of vector and deque containers
by Sandilya Jandhyala 03 Mar '15

03 Mar '15

Hello Boost, My name is Sandilya Jandhyala. I'm a third year undergraduate student pursuing Computer Science and Engineering at Amrita School of Engineering, Bangalore, India. I'm interested in submitting a proposal based on this idea. I have a few queries: 1. The programming test is to 'write a small vector-like container'. But this is somewhat vague, since it's not clear what is meant by 'small'. Does this mean that I only have to implement a subset of the functionality/member functions of std::vector? If so, which subset? How do I pick and choose? Or do I need to implement all the member functions? It would be helpful if some expected functionality were specified. 2. The entry on the ideas page hasn't specified how to submit the programming test. I'm assuming that I should copy and paste my code into the end of my proposal, as is specified for the other ideas. Is that correct? 3. The test requires that push_back throws when the buffer is full. But does this mean that the capacity is fixed? Can the capacity be increased when elements are added using other methods like insert()? 4. Though I'm comfortable with C++, I'm not at all familiar with unit testing or documentation tools. I'm willing to learn though. I've found that there are a large number of unit testing frameworks available for C++, and it's difficult to choose. Would you recommend any framework over another for this project/programming test? 5. I would like to begin researching possible improvements/additions to the vector and deque classes. What would be a good place to start? Should I look at the standard libraries of other languages? Could you point me to some resources I could study? Thank you for reading my queries. Any other tips/suggestions would be greatly appreciated.

1 0

[gsoc15] Boost will be a mentoring org for 2015
by Niall Douglas 03 Mar '15

03 Mar '15

Dear Boost. I am very pleased to report that Boost has been accepted as a GSoC org for 2015. Student applications begin on Monday March 16th, in just under two weeks, and last ten days until Friday March 27th. If you haven't added your proposal ideas to https://svn.boost.org/trac/boost/wiki/SoC2015, now is the time to do so. If you would like to add your name to the ten other mentors who have made themselves available this summer, please do get in contact. Niall and Boris --- Boost C++ Libraries Google Summer of Code 2015 admin https://svn.boost.org/trac/boost/wiki/SoC2015

1 0

GSOC 2015 guideline
by Vaneet yadav 03 Mar '15

03 Mar '15

hi all, I am Vaneet singh yadav student of IIT Guwahati (INDIA) , i am interested in working Boost.uBLAS a library for matrix computations in GSOC 2015 .can any help me how to start thanks a lot

1 0

GSoC 2015
by Ágota Horváth 03 Mar '15

03 Mar '15

Hello, I'm Ágota Horváth from Hungary, a second year BSc student. I'm learning computer engineering and I'm really interested in choosing one of Boost C++ Libraries projects this year. Especially, I'd like to participate in the Enhanced vector and deque containers project because I have learned C++ at the university and I'd like to extend my knoledge about libraries and it would be a great experience to me if I could do that while working on a real project. However, this is the first year when I'd like to take part is GSoC, so I don't really know who I should turn to in order to get more information about this project, the proposal and how to get in touch with my would-be mentor. I'd also like to know what skills are needed for this project so that I can prepare before the coding starts. I would really appreciate if you could help me with that. Thank you, Ágota Horváth

2 1

[context] b2 fails to build libraries if --with-context is set
by Antony Polukhin 02 Mar '15

02 Mar '15

Hi, Issue with failing boost build are reported here: http://stackoverflow.com/questions/27342524/buidling-boost-error-name-clash… and http://stackoverflow.com/questions/28398390/boost-build-breaks-name-clash-f… This seems like a critical bug! -- Best regards, Antony Polukhin

2 1

[build] b2 headers broken?
by Eric Niebler 02 Mar '15

02 Mar '15

I just updated to the latest develop. I ran bootstrap, then nuked my boost directory and reran b2 headers. Worked fine. Then I changed directory to libs/proto/test and ran ../../../b2 mem_ptr to run a test. Here's what I get: f:\modular-boost\libs\proto\test>..\..\..\b2 mem_ptr Performing configuration checks - symlinks supported : no - junctions supported : yes - hardlinks supported : yes ...patience... ...patience... ...found 4951 targets... ...updating 441 targets... common.mkdir ..\..\..\bin.v2\libs common.mkdir ..\..\..\bin.v2\libs\proto common.mkdir ..\..\..\bin.v2\libs\proto\test common.mkdir ..\..\..\bin.v2\libs\proto\test\mem_ptr.test common.mkdir ..\..\..\bin.v2\libs\proto\test\mem_ptr.test\msvc-12.0 common.mkdir ..\..\..\bin.v2\libs\proto\test\mem_ptr.test\msvc-12.0\debug common.mkdir ..\..\..\bin.v2\libs\proto\test\mem_ptr.test\msvc-12.0\debug\link-static common.mkdir ..\..\..\bin.v2\libs\proto\test\mem_ptr.test\msvc-12.0\debug\link-static\threading-multi link.rm ..\..\..\boost\mpl common.mkdir ..\..\..\boost\mpl link.hardlink ..\..\..\boost\mpl\print.hpp Hardlink created for ..\..\..\boost\mpl\print.hpp <<===>> ..\..\mpl\include\boost\mpl\print.hpp <snip> link.rm ..\..\..\boost\numeric\conversion link.hardlink ..\..\..\boost\numeric\conversion\conversion_traits.hpp The system cannot find the path specified. if exist "..\..\..\boost\numeric\conversion\conversion_traits.hpp" del "..\..\..\boost\numeric\conversion\conversion _traits.hpp" mklink /H "..\..\..\boost\numeric\conversion\conversion_traits.hpp" "..\..\numeric\conversion\include\boost\numeric\ conversion\conversion_traits.hpp" ...failed link.hardlink ..\..\..\boost\numeric\conversion\conversion_traits.hpp... link.hardlink ..\..\..\boost\numeric\conversion\int_float_mixture_enum.hpp The system cannot find the path specified. For some reason, b2 thinks it needs to rerun b2 headers, but it does a crap job of it and dies. What's going on? Eric

4 6

[date_time] Merge to release?
by Daniel James 01 Mar '15

01 Mar '15

There are some outstanding changes on date_time's develop branch which seem safe to me. If there are no objections I'll merge them soon. Daniel

1 0

Re: [boost] [Boost-interest] Biicode dependendy manager with Boost support
by Vicente J. Botet Escriba 27 Feb '15

27 Feb '15

Le 20/02/15 20:54, JOAQUIN M. LOPEZ MUÑOZ a écrit : > Hi, > > The folks at biicode (biicode.com) a C/C++ dependency manager, have just > announced support for Boost: > > http://blog.biicode.com/dependency-management-boost-libraries/#more-2086 > > Biicode allows for easy multiplatform component tracking and builiding > thanks to their file-based dependency detection and CMake autogeneration > magic. Now, these capabilities can be used to make it easier to work with > Boost libraries. > Thanks Joaquin for the announce. I was wondering if we couldn't use it as a starting point of our modularization activity. Some questions: * Is the file-based dependency manager what Boost is looking for its own module dependencies detection? * Could an author state explicitly its dependencies on other libraries (versions)? * It Biicode open source? * How its CMake autogeneration and bjam interact? Best, Vicente

4 4

VMD library accepted
by Steven Watanabe 27 Feb '15

27 Feb '15

AMDG The VMD library submitted by Edward Diener is ACCEPTED into Boost. I apologize for the long delay for this announcement. Thanks to everyone who participated in the formal review * Nial Douglass * Bjorn Reese * Rodrigo Madera * Zhou Zhenghui * Matt Calabrese * Paul Mensonides Reviews for the library were generally positive. The library was considered to be a useful set of tools for macro programmers. Paul expressed concern about the way the the library handles v-sequences and v-identifiers. After some discussion, Edward has agreed that the interface could be significantly improved. Work Items: * Add examples and improved motivation in the documentation * Update the v-identifier/v-sequence interface based on Paul's comments * Fix inaccurate statements about Boost.Preprocessor per Paul In Christ, Steven Watanabe

1 0

[1.58] Any plans to merge the super-project to master?
by John Maddock 26 Feb '15

26 Feb '15

Is the Boost super-project going to be merged to master, Jamroot in particular has several important unmerged changed. Thanks, John.

1 0

Re: [boost] [mpl] multiset
by Ganesh Prasad 25 Feb '15

25 Feb '15

> Aside from that, I?ve been also in contact with Louis discussing the > idea of porting metalog to Hana as a use case. Perhaps logic > predicates could prove a useful add on to Hana as well. Porting metalog to hana as an add on might be a good idea, but I quite disagree from the user's point of view. Hana is a beautifully designed library and it does precisely what it's designed for. In short it has good modularity. And , indeed, libraries are supposed to be highly modular. So, it might be better to keep metalog as a separate entity and provide good interoperability between Hana and metalog. Best wishes Ganesh Prasad

1 0

Cannot add any file to GIT "libgit2 returned: Invalid data in index - invalid entry"
by Paul A. Bristow 25 Feb '15

25 Feb '15

Cannot add any new file to GIT repo :-( "libgit2 returned: Invalid data in index - invalid entry" Have recently locally committed changes to an existing Boost.Math sub-module (commit OK). (But realized that I had forgotten to add a few new files, so tried to add and recommit, but failed at the add stage). git status shows expected untracked files and ends: nothing added to commit but untracked files present (use "git add" to track) I:\modular-boost\libs\math> .gitignore is the standard modular-boost issue and looks OK. I:\modular-boost\libs\math>git version git version 1.9.5.msysgit.0 Suggestions? Thanks Paul --- Paul A. Bristow Prizet Farmhouse Kendal UK LA8 8AB +44 (0) 1539 561830

2 3

[date_time] Re: [Boost-docs] Pull request #22 on boostorg/date_time
by Rene Rivera 25 Feb '15

25 Feb '15

You emailed the wrong list. On Tue, Feb 24, 2015 at 9:41 PM, Aaron Brooks <brooksaar(a)gmail.com> wrote: > Hi, > > Could I get someone to pull in my changes to date_time? > https://github.com/boostorg/date_time/pull/22 > > Just a small fix - fixes references to date_from_tm in the ptime doc, but > the bug has been open for 10 months and it tripped me up. > > Thanks, > Aaron > > _______________________________________________ > Boost-docs mailing list > Boost-docs(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-docs > > -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

1 0

Re: [boost] [mpl] multiset
by Ganesh Prasad 25 Feb '15

25 Feb '15

> It is not my intention to deprecate MPL. I'm just looking for some > meta-programming utilities that can be proposed to the C++ standard. > > Vicente MPL and 'something else which does exactly the same thing' can co-exist (?), though users are familiar with MPL. Metaprogramming can be made easier with an alternative syntax, like Hana does. But functional is not the only solution. We can try with a Logic oriented syntax. C++ supports almost every major paradigm out there, except for logic (like prolog). And wrapping a logic oriented syntax over metaprograms would actually help programmers to handle complex inheritance patterns conveniently. Well, it's just an idea. I had tried with functional syntax (from scratch) about one year ago. And I have been thinking about a logic oriented syntax (I had even considered something like JQuery, though I rejected that idea eventually). It would be great if the logic programming idea could be acceptable for GSoC, I would be more than happy to work on it. Here is the link to my attempt at functional syntax over metaprogramming. https://github.com/GnsP/GNS--META_LISCPP Also, Bruno C. O. Dutra has worked in a very similar field, in fact he has already implemented a compile time logic library. Best Wishes Ganesh Prasad

2 1

[Context] RFR: Add support for ARM aarch64 architecture
by Edward Nevill 25 Feb '15

25 Feb '15

Hi, I hope this is the right place to post this. The following patch adds support for ARMs aarch64 architecture on Linux (there is existing iOS support for aarch64). I have run the context regression test on this on an aarch64 board running Ubuntu 14.04 with gcc 4.9.1 and it passes all OK. Could someone please review this patch and if OK push it? Many thanks, Ed. --- CUT HERE --- commit bd34672217ff3bcee185f9c7383179342ec2fe9b Author: Edward Nevill <edward.nevill(a)linaro.org> Date: Mon Feb 23 14:37:45 2015 +0000 Add support for ARM aarch64 architecture diff --git a/build/Jamfile.v2 b/build/Jamfile.v2 index 80d1c46..edd4400 100644 --- a/build/Jamfile.v2 +++ b/build/Jamfile.v2 @@ -253,6 +253,14 @@ alias asm_context_sources <toolset>darwin ; +alias asm_context_sources + : [ make asm/make_arm64_elf_gas.o : asm/make_arm64_elf_gas.S : @gas ] + [ make asm/jump_arm64_elf_gas.o : asm/jump_arm64_elf_gas.S : @gas ] + : <address-model>64 + <architecture>arm + <binary-format>elf + ; + # MIPS # MIPS/O32/ELF alias asm_context_sources diff --git a/config/arm.cpp b/config/arm.cpp index 6a83737..6eece0b 100644 --- a/config/arm.cpp +++ b/config/arm.cpp @@ -6,7 +6,7 @@ // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) -#if !defined(__arm__) && !defined(__thumb__) && \ +#if !defined(__aarch64__) && !defined(__arm__) && !defined(__thumb__) && \ !defined(__TARGET_ARCH_ARM) && !defined(__TARGET_ARCH_THUMB) && \ !defined(_ARM) && !defined(_M_ARM) #error "Not ARM" diff --git a/src/asm/jump_arm64_elf_gas.S b/src/asm/jump_arm64_elf_gas.S new file mode 100644 index 0000000..3e0e2c2 --- /dev/null +++ b/src/asm/jump_arm64_elf_gas.S @@ -0,0 +1,128 @@ +/******************************************************* + * * + * ------------------------------------------------- * + * | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | * + * ------------------------------------------------- * + * | 0x0 | 0x4 | 0x8 | 0xc | 0x10| 0x14| 0x18| 0x1c| * + * ------------------------------------------------- * + * | d8 | d9 | d10 | d11 | * + * ------------------------------------------------- * + * ------------------------------------------------- * + * | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | * + * ------------------------------------------------- * + * | 0x20| 0x24| 0x28| 0x2c| 0x30| 0x34| 0x38| 0x3c| * + * ------------------------------------------------- * + * | d12 | d13 | d14 | d15 | * + * ------------------------------------------------- * + * ------------------------------------------------- * + * | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | * + * ------------------------------------------------- * + * | 0x40| 0x44| 0x48| 0x4c| 0x50| 0x54| 0x58| 0x5c| * + * ------------------------------------------------- * + * | x19 | x20 | x21 | x22 | * + * ------------------------------------------------- * + * ------------------------------------------------- * + * | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | * + * ------------------------------------------------- * + * | 0x60| 0x64| 0x68| 0x6c| 0x70| 0x74| 0x78| 0x7c| * + * ------------------------------------------------- * + * | x23 | x24 | x25 | x26 | * + * ------------------------------------------------- * + * ------------------------------------------------- * + * | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | * + * ------------------------------------------------- * + * | 0x80| 0x84| 0x88| 0x8c| 0x90| 0x94| 0x98| 0x9c| * + * ------------------------------------------------- * + * | x27 | x28 | FP | LR | * + * ------------------------------------------------- * + * ------------------------------------------------- * + * | 40 | 41 | 42 | 43 | | | * + * ------------------------------------------------- * + * | 0xa0| 0xa4| 0xa8| 0xac| | | * + * ------------------------------------------------- * + * | PC | align | | | * + * ------------------------------------------------- * + * * + *******************************************************/ + + .cpu generic+fp+simd + .text + .align 2 + .global jump_fcontext + .type jump_fcontext, %function +jump_fcontext: + # prepare stack for GP + FPU + sub sp, sp, #0xb0 + +# Because gcc may save integer registers in fp registers across a +# function call we cannot skip saving the fp registers. +# +# Do not reinstate this test unless you fully understand what you +# are doing. +# +# # test if fpu env should be preserved +# cmp w3, #0 +# b.eq 1f + + # save d8 - d15 + stp d8, d9, [sp, #0x00] + stp d10, d11, [sp, #0x10] + stp d12, d13, [sp, #0x20] + stp d14, d15, [sp, #0x30] + +1: + + # save x19-x30 + stp x19, x20, [sp, #0x40] + stp x21, x22, [sp, #0x50] + stp x23, x24, [sp, #0x60] + stp x25, x26, [sp, #0x70] + stp x27, x28, [sp, #0x80] + stp x29, x30, [sp, #0x90] + + # save LR as PC + str x30, [sp, #0xa0] + + # store RSP (pointing to context-data) in first argument (x0). + # STR cannot have sp as a target register + mov x4, sp + str x4, [x0] + + # restore RSP (pointing to context-data) from A2 (x1) + mov sp, x1 + +# # test if fpu env should be preserved +# cmp w3, #0 +# b.eq 2f + + # load d8 - d15 + ldp d8, d9, [x0, #0x00] + ldp d10, d11, [x0, #0x10] + ldp d12, d13, [x0, #0x20] + ldp d14, d15, [x0, #0x30] + +2: + + # load x19-x30 + ldp x19, x20, [sp, #0x40] + ldp x21, x22, [sp, #0x50] + ldp x23, x24, [sp, #0x60] + ldp x25, x26, [sp, #0x70] + ldp x27, x28, [sp, #0x80] + ldp x29, x30, [sp, #0x90] + + # use third arg as return value after jump + # and as first arg in context function + mov x0, x2 + + # load pc + ldr x4, [sp, #0xa0] + + # restore stack from GP + FPU + add sp, sp, #0xb0 + + ret x4 + .size jump_fcontext,.-jump_fcontext + +# Mark that we don't need executable stack. +.section .note.GNU-stack,"",%progbits diff --git a/src/asm/make_arm64_elf_gas.S b/src/asm/make_arm64_elf_gas.S new file mode 100644 index 0000000..5a6914f --- /dev/null +++ b/src/asm/make_arm64_elf_gas.S @@ -0,0 +1,80 @@ +/******************************************************* + * * + * ------------------------------------------------- * + * | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | * + * ------------------------------------------------- * + * | 0x0 | 0x4 | 0x8 | 0xc | 0x10| 0x14| 0x18| 0x1c| * + * ------------------------------------------------- * + * | d8 | d9 | d10 | d11 | * + * ------------------------------------------------- * + * ------------------------------------------------- * + * | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | * + * ------------------------------------------------- * + * | 0x20| 0x24| 0x28| 0x2c| 0x30| 0x34| 0x38| 0x3c| * + * ------------------------------------------------- * + * | d12 | d13 | d14 | d15 | * + * ------------------------------------------------- * + * ------------------------------------------------- * + * | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | * + * ------------------------------------------------- * + * | 0x40| 0x44| 0x48| 0x4c| 0x50| 0x54| 0x58| 0x5c| * + * ------------------------------------------------- * + * | x19 | x20 | x21 | x22 | * + * ------------------------------------------------- * + * ------------------------------------------------- * + * | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | * + * ------------------------------------------------- * + * | 0x60| 0x64| 0x68| 0x6c| 0x70| 0x74| 0x78| 0x7c| * + * ------------------------------------------------- * + * | x23 | x24 | x25 | x26 | * + * ------------------------------------------------- * + * ------------------------------------------------- * + * | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | * + * ------------------------------------------------- * + * | 0x80| 0x84| 0x88| 0x8c| 0x90| 0x94| 0x98| 0x9c| * + * ------------------------------------------------- * + * | x27 | x28 | FP | LR | * + * ------------------------------------------------- * + * ------------------------------------------------- * + * | 40 | 41 | 42 | 43 | | | * + * ------------------------------------------------- * + * | 0xa0| 0xa4| 0xa8| 0xac| | | * + * ------------------------------------------------- * + * | PC | align | | | * + * ------------------------------------------------- * + * * + *******************************************************/ + + .cpu generic+fp+simd + .text + .align 2 + .global make_fcontext + .type make_fcontext, %function +make_fcontext: + # shift address in x0 (allocated stack) to lower 16 byte boundary + and x0, x0, ~0xF + + # reserve space for context-data on context-stack + sub x0, x0, #0xb0 + + # third arg of make_fcontext() == address of context-function + # store address as a PC to jump in + str x2, [x0, #0xa0] + + # save address of finish as return-address for context-function + # will be entered after context-function returns (LR register) + adr x1, finish + str x1, [x0, #0x98] + + ret x30 // return pointer to context-data (x0) + +finish: + # exit code is zero + mov x0, #0 + # exit application + bl _exit + + .size make_fcontext,.-make_fcontext + +# Mark that we don't need executable stack. +.section .note.GNU-stack,"",%progbits

2 7

Friend class with namespace gives compiler error for C6000 TI
by Alin Popa 25 Feb '15

25 Feb '15

Hi, I compile my project with boost header only files, the compiler is C6000 Texas Instruments. The compile errors occurs for example in "boost/algorithm/string/find_iterator.hpp" I have extracted the cause of the problem in the next example code: namespace boost { namespace iterators { class iterator_core_access { public: iterator_core_access(){} ~iterator_core_access(){} }; } using iterators::iterator_core_access; } class testFriend { private: // don't work, compiler error: error: namespace "boost" has no actual member "iterator_core_access" friend class ::boost::iterator_core_access; // here is the problem // it works, compiles ok, this was my cure //friend class ::boost::iterators::iterator_core_access; }; int main () { // it works ::boost::iterator_core_access a; return 0; } Do you guys know what is the reason of this ? With msvc and g++ works fine. Thanks and best regards, Alin

2 1

[build] check __aarch64__ Aarch64
by Oliver Kowalke 24 Feb '15

24 Feb '15

Hi, I've added an pull request for jam.h (build/engine) to set os.platform correctly to 'ARM' on Aarch64 architecture. This is required in order to build boost.context correctly on the64bit ARM platform. thx, Oliver

1 0

Any online C++ compiler with Boost version to select?
by Boris Schäling 23 Feb '15

23 Feb '15

Does anyone know of an online C++ compiler which does not only come with Boost but allows you to select the Boost version? While http://coliru.stacked-crooked.com/ comes with Boost 1.57.0, http://ideone.com/ and http://cpp.sh/ with 1.55.0 and http://codepad.org/ with 1.34.1 (really!), I can't even tell whether these websites support Boost explicitly or whether it's more of an accident that I can include Boost headers. :) http://isocpp.org/blog/2013/01/online-c-compilers also mentions http://liveworkspace.org/ and http://gcc.godbolt.org/. But I can't open these websites (not sure whether they are temporarily broken or gone for good?). Boris

3 3

[config] test macro for std::index_sequence<>?
by Oliver Kowalke 23 Feb '15

23 Feb '15

Hi, I can not find an macro (BOOST_NO_CXX11_...) for testing the absence of std::index_sequence<> - may I have overlooked it? so long, Oliver

2 2

Re: [boost] [gsoc15] Attn: We need 2015 mentors and project ideas for Boost!
by Antonio Colino 22 Feb '15

22 Feb '15

Here is a random thought for a project idea. Agner fog created a vectorization lib for the sse and avx instruction sets as part of a project called vector class. Intel created the equivalent opencl kernels as part of a project that is called ispc ( Intel simd program compiler ). Research both and submit a single vector lib that auto vectorizes avx, sse both gpu and cpu overloading the std::vector class operators.Just a random thought. Intel SPMD Program Compiler)

1 0

[mpl] Fix to Ticket #11001
by Bruno Dutra 22 Feb '15

22 Feb '15

I just finished a pull request <https://github.com/boostorg/mpl/pull/14> with a fix for Ticket #11001 <https://svn.boost.org/trac/boost/ticket/11001>, which, by the way, I reported myself, so I'm quite confident it's fixed. Could one of the maintainers kindly review it? Oh and it is worth it to mention that I also included a new test case to ensure the fix is working. Kind regards, *Bruno C. O. Dutra*

1 1

GSoC: Enhanced vector and deque containers
by Benedek Thaler 22 Feb '15

22 Feb '15

Hi, I'm looking at the "Enhanced vector and deque containers"[0] item of the GSoC projects. I have to following interface idea: boost::devector: Like std::vector, but the first call to push_back inserts the element to the middle of the buffer. Likewise, reserve puts the contents to the middle of the new buffer (if any). This allows a cheap push_front, pop_front, push_back, pop_back. boost::deque: Like std:deque, but segment size can be specified in the constructor. To make buffer operations easier, a `segment_end` would be provided: iterator segment_end(iterator begin) Which returns the end of the largest consecutive range starting at `begin`. I'm also thinking about the following twist: Assuming this layout: [a,b,c,d] [e,f,g,_] Brackets denote segments, letters are elements, underscore is empty space. Here, inserting `x` after `d` normally results several moves and this layout: [a,b,c,d] [x,e,f,g] But instead, we could allocate a new segment: [a,b,c,d] [_,x,_,_] [e,f,g,_] To make the insertion cheaper. This behavior is similar to a segmented list, i.e: std::list<boost::devector<T>> Are these similar to the "extra functionality" mentioned in the docs you were thinking about? Thanks, Benedek [0]: https://svn.boost.org/trac/boost/wiki/SoC2015#a5.Enhancedvectoranddequecont…

1 0

Enquiry about gsoc project Enhanced vector and deque containers
by Jasdeep Singh 21 Feb '15

21 Feb '15

I had a few doubts regarding this project and was wondering if someone could help me out.It would be much appreciated.

1 0

[MultiIndex] Memory consumption of ordered indices
by Olaf van der Spek 21 Feb '15

21 Feb '15

Hi, What's the memory consumption of ordered indices? Is it implemented as a linked list, so two pointers per element? In that case for a write-only data structure an external ptr vector would make more sense wouldn't it? -- Olaf

3 4