- Boost - lists.preview.boost.org

[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