- Boost - lists.preview.boost.org

[gsoc-2013] Boost.uBLAS
by Jignesh Jain 17 Apr '13

17 Apr '13

I am interested in this project for Gsoc, which involves unification of vector and matrix libraries. I have been browsing boost ublas code, but have no idea about how should I begin as I am totally new to Boost. Can Someone please guide me some approach for getting started in this project. Thank you.

2 1

[log] Segfault in "rotating_file" example
by Jason 16 Apr '13

16 Apr '13

I'm working from SVN trunk revision 83923. I've been experiencing segfaults when trying to set up a file sink that has date/time format specifiers in its file name. I thought I was doing something wrong, but I found that the "rotating_file" example also illustrates the same behavior. Here is a sample backtrace: #0 0x000000000077c0b8 in ?? () #1 0x0000000000415d25 in boost::date_time::microsec_clock<boost::posix_time::ptime>::create_time (converter=0x77c0b8) at /code/env/include/boost/date_time/microsec_time_clock.hpp:100 #2 0x00000000004d628b in boost::log::v2s_mt_posix::sinks::(anonymous namespace)::date_and_time_formatter::operator()(std::string const&, unsigned int) const [clone .isra.401] () #3 0x00000000004d639a in boost::log::v2s_mt_posix::aux::light_function<std::string (unsigned int)>::impl<boost::_bi::bind_t<boost::_bi::unspecified, boost::log::v2s_mt_posix::sinks::(anonymous namespace)::date_and_time_formatter, boost::_bi::list2<boost::_bi::bind_t<boost::_bi::unspecified, boost::log::v2s_mt_posix::sinks::(anonymous namespace)::file_counter_formatter, boost::_bi::list2<boost::_bi::value<std::string>, boost::arg<1> > >, boost::arg<1> > > >::invoke_impl(boost::log::v2s_mt_posix::aux::light_function<std::string (unsigned int)>::impl_base*, unsigned int) () #4 0x00000000004d3c90 in boost::log::v2s_mt_posix::sinks::text_file_backend::consume(boost::log::v2s_mt_posix::record_view const&, std::string const&) () #5 0x00000000004206c6 in boost::log::v2s_mt_posix::sinks::basic_formatting_sink_frontend<char>::feed_record<boost::log::v2s_mt_posix::aux::fake_mutex, boost::log::v2s_mt_posix::sinks::text_file_backend> (this=this@entry=0x783600, rec=..., backend_mutex=..., backend=...) at /code/env/include/boost/log/sinks/basic_sink_frontend.hpp:445 #6 0x000000000042082f in boost::log::v2s_mt_posix::sinks::basic_formatting_sink_frontend<char>::try_feed_record<boost::mutex, boost::log::v2s_mt_posix::sinks::text_file_backend> (this=0x783600, rec=..., backend_mutex=..., backend=...) at /code/env/include/boost/log/sinks/basic_sink_frontend.hpp:489 #7 0x00000000004c1475 in boost::log::v2s_mt_posix::core::push_record_move(boost::log::v2s_mt_posix::record&) () #8 0x000000000040dff1 in push_record (this=<optimized out>, rec=...) at /code/env/include/boost/log/core/core.hpp:308 #9 push_record_unlocked (rec=..., this=<optimized out>) at /code/env/include/boost/log/sources/basic_logger.hpp:268 #10 push_record (rec=..., this=<optimized out>) at /code/env/include/boost/log/sources/basic_logger.hpp:582 #11 ~record_pump (this=0x7fffffffddc0, __in_chrg=<optimized out>) at /code/env/include/boost/log/sources/record_ostream.hpp:279 #12 main (argc=<optimized out>, argv=<optimized out>) at main.cpp:84 Looking at the disassembly of where the segfault happens, it seems to have gone off the rails and is executing invalid code. Specifically, the function pointer "converter" inside the date_time::microsec_clock<>:create_time() function seems to be invalid. Any ideas? I'm using gcc 4.7.2 on Ubuntu 12.10. Jason -- View this message in context: http://boost.2283326.n4.nabble.com/log-Segfault-in-rotating-file-example-tp… Sent from the Boost - Dev mailing list archive at Nabble.com.

3 4

[smart_ptr] No more shared_ptr<T>::value_type?
by Andrew Hundt 16 Apr '13

16 Apr '13

I updated from boost 1.52 to 1.53 and it appears that the typedefs have been removed, I couldn't find any mention of it in the release notes, and I searched the list for shared_ptr value_type and saw no mention of the change there. Was this a deliberate change? This breaks a *lot* of code for me, and will make more difficult for me to convince my team to continue to use boost or upgrade in the future because they are very apprehensive of breaking changes. I understand if it has been removed to be C++11 compliant but I expected some warning before breaking changes like this. boost::thread and boost::filesystem are good examples of changes that were made with solid advance notice. This caught me completely by surprise, did I miss something obvious? Could someone point me to the recommended alternative as well? 1.52 has typedef T value_type: http://www.boost.org/doc/libs/1_52_0/boost/smart_ptr/shared_ptr.hpp 1.53 does not: http://www.boost.org/doc/libs/1_53_0/boost/smart_ptr/shared_ptr.hpp Thanks for your help! Cheers! Andrew Hundt

3 3

Windows Binary Builds
by Tom Kent 16 Apr '13

16 Apr '13

A couple months ago some of us got an e-mail from Dave Abrams saying that since BoostPro was going to be shutting down, there wouldn't be anyone maintaining the windows binary installer that they had been offering. Since I have been making windows binaries available on my site for the last several releases [http://boost.teeks99.com] he suggested that I take this over. I currently have a simple zip file (self extracting though) that just grabs all the 32 bit or 64 bit binaries...and they're huge, 6-8GB installed. So going forward I've built a system to make one installer for each tool/architecture: msvc-8.0-32, msvc-9.0-32, msvc-10.0-32, msvc-11.0-32, msvc-8.0-64, msvc-9.0-64, msvc-10.0-64, msvc-11.0-64. In addition to the binaries for that architecture, I would also include the boost release inside the installer. This way it is a single download/single install for everything an end-user developer would need (for each architecture). If a user wants multiple architectures, he/she can run multiple installers and they will instill on top of each other (with seperate lib directories for each set of binaries...for example: boost_1_53_0/lib_32-msvc-8.0 and boost_1_53_0/lib_64-msvc-11.0). All the scripts I use to build these (assume visual studio pro 8.0, 9.0, 10.0, and 11.0) are on my github account at: https://github.com/teeks99/boost-build If you want to see for yourself, I have the 1.53 installers on my website at: http://boost.teeks99.com/bin/boost_1_53_0-msvc-8.0-32.exe http://boost.teeks99.com/bin/boost_1_53_0-msvc-9.0-32.exe http://boost.teeks99.com/bin/boost_1_53_0-msvc-10.0-32.exe http://boost.teeks99.com/bin/boost_1_53_0-msvc-11.0-32.exe http://boost.teeks99.com/bin/boost_1_53_0-msvc-8.0-64.exe http://boost.teeks99.com/bin/boost_1_53_0-msvc-9.0-64.exe http://boost.teeks99.com/bin/boost_1_53_0-msvc-10.0-64.exe http://boost.teeks99.com/bin/boost_1_53_0-msvc-11.0-64.exe If we like this going forward, I'd be happy to upload these to sourceforge for each release, instead of having to go to my site for them. Thoughts? Tom Kent

5 9

Reading uBLAS Documentation
by Yosef Hamza 16 Apr '13

16 Apr '13

i'm little confused here ... should i read the documentation in the same sequence they are written ?(i started that way and i'm having a hard time but still on it) or should i start from (Storage and Special Containers) and down? Thanks in advance!

1 0

Google Summer of Code 2013 - Boost.org - Boost.Multiprecision
by Saurav 16 Apr '13

16 Apr '13

Hi! I am a CS undergraduate student and I really want to work on Boost.Multiprecision<https://svn.boost.org/trac/boost/wiki/SoC2013#Boost.Multiprecision>. C++ has been my favorite programming language and I find GSoC 2013 a wonderful opportunity to create something valuable with it, while getting some 'value' out of it for myself. I like learning new things and trying to find out better ways of doing existing things. I like coding and listening to music (sometimes simultaneously too). Greetings to the entire Boost community. And Thank you! I really appreciate the great work Boost is doing for the rest of us, and I want to be on the other side now, and do something for the rest of them. That's all from my side. I wish to get through to Christopher Kormanyo, the mentor for the project I am interested in, to discuss more specifically about the further steps. Thanking you all once again, Best regards, Saurav

3 4

What Should we do About Boost.Test?
by Dave Abrahams 16 Apr '13

16 Apr '13

Hi All, I was just going through Boost.Test to try to figure out how to teach it, and while it looks to have substantial value, it is also in quite a mess. It contains loads of features that are exercised in the examples/ directory but neither included in any of the tests nor documented. There are facilities for command-line argument parsing! There are "decorators" that turn on/off features for test cases. There is support for mock objects! These are cool and sometimes necessary features, but who knew? The third tutorial page (http://www.boost.org/doc/libs/1_51_0/libs/test/doc/html/tutorials/new-year-…) has a glaring typo in the code examples: "BOOST_AUTO_EST_CASE". There's no reference manual at all. There are nearly-identical files in the examples/ directory called "est_example1.cpp" and "test_example1.cpp" (Did the "t" key on someone's keyboard break?) I could go on, but where would I stop? I don't know what to do about this. Because of the lack of redundancy (i.e. tests and documentation), it's hard to tell whether this library is correct or even to define what "correct" should mean. It seems like, as long as the code is incompletely / incorrectly documented and tested, it's just someone's personal coding project that we happen to keep shipping with Boost, and not really a library for general use. This situation reflects poorly on Boost as a whole and the fact that it centers around a _testing_ library, which is concerned with robustness... well, let's just say that the irony isn't lost on me. I don't mean this posting as an attack on Gennadiy in any way, but I think the situation is unacceptable and therefore am opening a discussion about what should happen. As a straw man, I'll make this suggestion: - Boost.Test is officially deprecated in the next release - Its documentation, such as it is, is removed from the release after that - Meanwhile, other tests in Boost that use this library are rewritten to use a different mechanism - The code is removed from Boost thereafter I am not at all attached to removing Boost.Test from Boost, but IMO rescuing it would require a significant new investment of time and energy from people who are committed to bringing the library up to par with the rest of what we do. (I seriously thought about volunteering for this myself, but realistically speaking, I don't have the time, and volunteering for something you can't actually do is worse than not volunteering at all.) Even if volunteers show up, I'd suggest proceeding with the plan above, subject to reversal at any time the work actually gets done. Thoughts? -- Dave Abrahams BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

34 85

[any] last commit breaks program_options
by Jürgen Hunold 15 Apr '13

15 Apr '13

Hi! It seems that introducing move semantics to Boot.Any in r 83901 breaks compilation of program_options. /home/hunold/src/devel/boost/boost/program_options/variables_map.hpp:58:38: note: no known conversion for argument 1 from ‘boost::program_options::variable_value’ to ‘boost::program_options::variable_value&’ Full build log attached. Any Ideas? Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! * voice: ++49 4257 300 ! Fährstraße 1 * fax : ++49 4257 300 ! 31609 Balge/Sebbenhausen * jhunold(a)gmx.eu ! Germany

5 6

GSOC 2013 Parallelized Backend
by Muhammad Junaid Muzammil 15 Apr '13

15 Apr '13

Hello, This is Junaid form National University of Sciences and Technology. I have gone through the GSOC 2013 idea listing. I am pretty much interested in extension of odeint. I am more interested for the parallelization over the GPUs preferably NVIDIA. From the details listed there, it seems that Boost community is more interested in parallelization over the CPUs i.e. much preference is given to OpenMP and MPI. Is that the case here? Regards, Junaid.

2 1

GSOC 2013: Boost.Math Bernoulli Numbers and Applications to Special Functions
by Shubham Gupta 15 Apr '13

15 Apr '13

I am a fourth year Dual Degree (B.Tech+M.Tech) student of Computer Science and Engineering at IIT, Delhi, and would like to express my interest in the project concerned with extending the Boost.Math library to include implementation for Bernoulli numbers. I have read the Wikipedia page for Bernoulli numbers and also some of their applications and definitions. As suggested in the Projects page, I have implemented the Akiyama–Tanigawa algorithm for second Bernoulli numbers and also tested my implementation for the first 10 second Bernoulli numbers using Boost.Test library. Even though I have been using C++ in algorithmic coding competitions for over 2 years, I am still comparatively new to the Boost libraries. I am currently browsing through the capabilities provided by Boost.Math, and also their implementations I would request the concerned mentors and the community to advise me on how to proceed from here, and point out additional things which I can do. -- Shubham Gupta Undergraduate Student Computer Science and Engineering Indian Institute of Technology, Delhi

2 1

[gsoc 2013] What about projects without a mentor?
by Hardy Huang 15 Apr '13

15 Apr '13

Hi! In the boost home page for GSOC 2013, there are some ideas without details and mentors on the bottom of the page, such as some project about algorithms and data structure. Since I am good at algorithm and data structure, knowing that there are some idea projects relative with algorithm and data structure, like radix sort, trie, I want to know something detail about the plan to develop algorithm and data structure. Are these projects involved in gsoc 2013? Can anyone tell me about it, if they were, how can I get more information about them? Thanks very much, I am expecting to receive some useful replies. Best Regards Huang Zhe

1 0

library for uBLabs.. GSOC 2013
by Niranjan Singh 15 Apr '13

15 Apr '13

Hello david, First of all thank you for your kind concern to my proposal. For uBLabs, As I go through the ideas and page, then i see that many challenges are quite interesting projects, and can be done. I would like to work in matrix and vector handling Regarding this here is what I understand and my thought. As its true linear algebra so we have to go as in maths so if we have to multiply two vectors then as it can be represented in matrix (row matrix or column matrix ) form so first of all we have to convert into one form then we have to multiply both the matrix and then convert back to vector form. Simmilarly * can be done with two matrices or one matrix and one vector. For implementing this in c++ we would be needing classes for defining various properties and methods for matrix and vectors. I can be more specific if I know what developments in this have been done, so that we can start with that. with many thanks and regards, Niranjan Singh

1 1

Re: [boost] JSON Parser GSoC 2013
by Stephan Bourgeois 15 Apr '13

15 Apr '13

Michael Marcin wrote: I find the most useful interface is to just provide a datatype you're > expecting and let the json parser try its best to do the right thing. > For example: > string raw_json = R"({ > data:{ > a:"hello", > b:"world", > c:3, > widget:3.5 > } > })"; > [...] > struct my_type5 > { > struct my_data > { > string a; > string b; > int c; > float widget; > } data; > }; > // these should all just work, with maybe a little bit of > // metaprogramming to describe the types to the json library > json::deserialize<my_type5>( json ); I agree. This is, by far, the most intuitive interface. I understand how this can be implemented for data types like map or even Boost.Fusion vector in case of JSON multiple type arrays. However, I have no idea how to implement this in the example above with a struct! Unless of course there is no field name check nor type checking, and the JSON values are just copied sequentially into the struct regardless of field names. Btw I don't even know how to do this without using C++0x extended initializer lists. Otherwise we require some form of reflection in C++. I imagine I should look into Boost.Serialization...? I looked at Boost.Fusion adapt_struct, but that looks quite complicated. Am I missing something? Please let me know what you think. Kind regards, Stephan.

2 1

gsoc project
by Shamsher Siddiqui 14 Apr '13

14 Apr '13

i know c++ well and i like algorithm very much .So I have chosen 1)Algorithms 2)Boost.Chrono/Date I would like to work on this project this summer . I have read https://svn.boost.org/svn/boost/sandbox/chrono_date/libs/date/doc/date.html this plz give me how to start developing. I have completed the Algorithm course in my major and pretty good at it .help me in this project so that i can on this project

2 3

[gsoc 2013] Boost.odeint project
by Artemy Margaritov 14 Apr '13

14 Apr '13

Hello. My name is Artemy Margaritov. I am a third year student of Moscow Institute of Physics and Technology and I'd like to participate in Gsoc this year. I have some questions to start with. 1. Are the parts "Implicit Routines" and "Parallelized Backends" of Boost.odeint project separate tasks? 2. Is it possible for two students to be enrolled in Boost.odeint (one student to "Implicit Routines", another to "Parallelized Backends")? -- Best regards, Artemy Margaritov

2 1

Re: [boost] GSOC 2013
by Antony Polukhin 14 Apr '13

14 Apr '13

2013/4/14 Niranjan Singh <niranjan32331(a)gmail.com>: > Hello sir, > > Sorry for not being clear in my previous message , here I want to propose > you two ideas..which we can work on > > 1. Implementing a graphical interface for problems so that all outputs can > be viewed by user in a good way. Algorithms will be the same like Dijkstra's > , Bellman ford , Kruskul e.t.c as they are already present in BGL. BGL can output to DOT format (the one that is used by graphviz to visualize graphs). Are you going to improve that output or proposing something absolutely different? > 2. Implementing algorithms for Travelling Salesman problem or Chinese > postman problem, Job scheduling or Edge colouring. This sounds interesting. Can you write code using same approaches as in Boost.Graph? See some sources of BGL, get the idea of how it works. > P.S: Actually Sir I have many ideas in my mind, that's why I tell them > whichever be the best or worth full. :)) > > with many thanks > Niranjan Singh See this link https://svn.boost.org/trac/boost/wiki/SoCSubmissionTemplate and fill a proposal. This link may also help https://svn.boost.org/trac/boost/wiki/SoCHints -- Best regards, Antony Polukhin

1 0

[preprocessor] BOOST_PP_OVERLOAD not defined if variadic macros not supported.
by Mostafa 14 Apr '13

14 Apr '13

I just found out the hard way that BOOST_PP_OVERLOAD is "silently" not defined if variadic macros are not supported , ie in c++03. This led to quite a frustrating session of debugging on the premise that there's something wrong with my include paths/environment variables. It would be very nice if BOOST_PP_OVERLOAD errored explicitly if variadic macros were not supported by the compiler, or at lease have a gentle reminder to the reader in BOOST_PP_OVERLOAD documentation (and, where appropriate, in other places) that variadic macros are only standard in c++11 and may not be supported on all compilers, hence one might get a BOOST_PP_OVERLOAD undeclared error. Mostafa

4 10

GSOC 2013 . BOOST GLB
by Niranjan Singh 14 Apr '13

14 Apr '13

@antoshk Hello sir, As I go through the graph library of boost, everything seems to be done like all major algorithms for graphs. That's pretty good however we can use it to implement a structure of methods which deals with problems like Chinese postman problem, Decision making poblem , Project management.,Graph partitioning and clustering , Distribution of Eigen values and compression e.t.c With graph we can solve friend-of-friend problems and also implement a simple command line social network based on c++ with the help of graphs. This would be really interesting. However shortest path algorithms can be implemented from one cutting plane algorithm , and Ant algorithm. It would be better if we can change the input and output display by using graphics so that user gets an interactive output of graph. With these graph techniques and algorithms can be use for calculating polynomials time verification via hamiltonian cycles and NP problems. May be useful in Boost uBLabs. with many thanks and regards Niranjan Singh

1 0

GSOC 2013
by Niranjan Singh 14 Apr '13

14 Apr '13

@antoshk Hello sir, As I go through the graph library of boost, everything seems to be done like all major algorithms for graphs. That's pretty good however we can use it to implement a structure of methods which deals with problems like Chinese postman problem, Decision making poblem , Project management.,Graph partitioning and clustering , Distribution of Eigen values and compression e.t.c With graph we can solve friend-of-friend problems and also implement a simple command line social network based on c++ with the help of graphs. This would be really interesting. However shortest path algorithms can be implemented from one cutting plane algorithm , and Ant algorithm. It would be better if we can change the input and output display by using graphics so that user gets an interactive output of graph. With these graph techniques and algorithms can be use for calculating polynomials time verification via hamiltonian cycles and NP problems. May be useful in Boost uBLabs.

1 0

GSOC 2013
by Niranjan Singh 13 Apr '13

13 Apr '13

Hello, My name is Niranjan , It was really a pleasure seeing a poject like this, and the ideas were also very good. I like to contribute to the vector ,making new matrix class. I would like to propose you my idea as below As *Graph theory* as a subject also and is becoming increasingly significant as it is applied to other areas of mathematics, science and technology. It is being actively used in fields as varied as *biochemistry (genomics), electrical engineering (communication networks and coding theory), computer science (algorithms and computation) and operations research (scheduling).* The powerful *combinatorial methods* found in graph theory have also been used to prove fundamental results in other areas of pure mathematics. And so is becoming an important subject in mathematics and algorithms also. So I was thinking to make a library to implement all the graph functions and its various properties and applications in it so that it can be used by student to understand the concept and it can also be used to solve problems like *Travelling Salesman problem, finding chromatic number, edge colouring. * Finding *shortest path , face colouring* e.t.c. With the help of small functions user can create a program which tackles the big problem. Lots of data-structures can also be implemented. Thanks. P.S. Sir, As my end semester are exams are on .. so its possible that i couldn't reply you fast but I do want to do this project. Exams will over on 30 april.. Thanks for you concern.

4 3

Niranjan Singh has invited you to open a Google mail account
by Niranjan Singh 13 Apr '13

13 Apr '13

I've been using Gmail and thought you might like to try it out. Here's an invitation to create an account. You're Invited to Google Mail! Niranjan Singh has invited you to open a Google Mail account. Google Mail is Google's free email service, built on the idea that email can be intuitive, efficient and fun. Google Mail has: *Less spam* Keep unwanted messages out of your inbox with Google's innovative technology. *Lots of space* Enough storage so that you'll never have to delete another message. *Built-in chat* Text or video chat with Niranjan Singh and other friends in real time. *Mobile access* Get your email anywhere with Google Mail on your mobile phone. You can even import your contacts and email from Yahoo!, Hotmail, AOL or any other web mail or POP accounts. Once you create your account, Niranjan Singh will be notified of your new Google Mail address so you can stay in touch. Learn more<http://mail.google.com/mail/help/intl/en/about.html>or get started<http://mail.google.com/mail/a-b2df9a7699-186fc6feff-CUGUbjU3pJUkhZ0HbL1w6xE…> ! Sign up<http://mail.google.com/mail/a-b2df9a7699-186fc6feff-CUGUbjU3pJUkhZ0HbL1w6xE…> Google Inc. | 1600 Amphitheatre Parkway | Mountain View, California 94043

1 0

JSON Parser GSoC 2013
by Stephan Bourgeois 13 Apr '13

13 Apr '13

Hi everybody, I am studying for an MSc in Computer Science at Oxford Brookes University. I have taken a compiler construction course this year and I am therefore interested in the JSON Parser idea for the Boost library. Open Source JSON parsers have already been implemented in C++ and in Java. Examples of Java libraries are: Gson, quick-json. Even if other libraries already exist, developers who are using Boost for their project will appreciate having a JSON parser within Boost. >From a compiler construction background, writing a JSON parser is not difficult. The JSON grammar is simple and the specification is easy to find. Potential difficulties can exist with robustness of error handling and recovery. The question is what data structure we should use to represent JSON objects, and how the user can access key/value pairs in those objects. (examples: Boost.PropertyTree, pre-existing C++ object, ...) Ideally we should offer validating and non-validating implementations. We should also offer JSON generation as well as parsing. Let me know what you think. Kind regards, Stephan.

10 14

Regarding proposal for GSOC
by Niranjan Singh 12 Apr '13

12 Apr '13

If I have to send my proposal for the poject in GSOC then whom should I mail. This link only or is there some other email. Thanks

2 1

JSON Parser GSoC 2013 (part 2)
by Stephan Bourgeois 12 Apr '13

12 Apr '13

Hi everybody, thank you for all your replies. I will try to summarize my impressions so far: 1. Although there is a solution in Boost.PropertyTree, a majority of users consider it to be incomplete, and quite a few developers are using external libraries at present. 2. As Bjorn Reese pointed out, a solution should offer several different interfaces. Some being already implemented in the protoc library. Michael Marcin suggested that something similar to JsonFX in C# be added to Bjorn's list. 3. There is already a Lexer implementation as part of the tokenizer API in protoc. This is how I imagine I could contribute to the project: 1. Collect requirements for functionality and interfaces. 2. review existing Java, C++, C#, Android library solutions. 3. Write a Parser with error recovery using the Lexer from the protoc library. Or adapt an existing parser if there is a good reason for doing so. 4. review JSON specific issues like type casting and how to deserialize arrays with multiple types. (see posts by Arindam Mukherjee and Michael Marcin on deserialization) 5. With the help of my mentor, implement the different interfaces, preferably in a modular way. (I know an example of this in compiler design using the visitor pattern for code generation) Please don't be offended as I only had the time to have a quick look at a single library. I understand that I need to look at a wider code base from other libraries and familiarize myself with general issues related to JSON and serialization. Bjorn Reese offered to mentor this project, please let us know if someone more "officially involved" with Boost needs to approve this. Please let me know what you think. Stephan

1 0

[gsoc-2013] Physics Library Abstraction Layer
by Preston Hamlin 12 Apr '13

12 Apr '13

Hello, my name is Preston Hamlin and I am a current CS undergraduate at the Florida State University. I was reading over the list of ideas provided and then referenced the source code libraries to get a feel for what was being asked for. I found the prospect of writing an abstraction layer for PhysX or related libraries to be interesting. I am somewhat familiar with THREE.js which is an abstraction of WebGL. In THREE.js there is a heavy amount of abstraction to the degree of providing geometric primitives, particles effect presets, simple materials and basic data structures (matrices, vectors, etc...). Given the platform that THREE.js operates on, such a degree is understandable. How much of the physics library is to be abstracted away in generic structures and functions? I would think that having a few simple primitives (cube, low-poly sphere, etc...) would be required since they are commonly used. However more advanced meshes like a torus might be better produced through using modifiers on said primitives rather than a built-in preset. I think the degree of abstraction is most important for modifiers, and I desire to get a feel for what is being looked for. I assume the end goal is to be able to produce Blender/Unity/3dsMax usable code as well as standalone utilities. Many thanks, -Preston

4 7

Re: [boost] JSON Parser GSoC 2013
by John Venarchick 12 Apr '13

12 Apr '13

> 2013/4/12 Michael Marcin <mike.marcin(a)gmail.com> > >> Arindam Mukherjee wrote: >> >>> In JSON we typically deal with maps and arrays. The arrays themselves >>> could >>> have arbitrary types (string, object, array, numeric, boolean, null) as >>> elements. The key types in the maps are always strings and the value types >>> in the maps could be anything that can appear in an array, including >>> another map or array. >>> >>> Due to this, I'd imagine being able to use Boost.Variant or Boost.Any in a >>> list and as a value_type in a map would help. >>> >>> I have been doing some work with JSON and boost by modifying the current 1.53 ptree. I created a type for use as the data_type of the ptree that represents the various options for JSON data (no value, null value, bool, integer, float, string). It uses boost::variant and visitors. I have it working for my purposes, but would want to make it a little nicer before submitting a patch. I also implemented property_tree::translator_ between to make it work with the spirit classic parser in json_parser_read and json_parser_write. I can post more if anyone is interested. I'm also working a generic way to load arbitrary structures from the created ptree. -John V

1 0

Re: [boost] [gsoc-2013] Physics Library Abstraction Layer
by Preston Hamlin 12 Apr '13

12 Apr '13

Considering that I have received positive feedback on this project, I shall likely make a proposal for it when the time comes. Before then, I would like to pin down the scope and breadth of this library. I am in possession of the PhysX SDK and have been reading it over to come up with some questions to ask so that (should my proposal be accepted) I would not have to be overly concerned later. On the first page of the SDK documentation, it is denoted that several distributable (PhysX) DLLs are required for applications on the Windows platform. Since Boost is a library project, I am unsure what to do with DLL files other than unceremoniously stick them in a Resources folder until the time comes, or have a script built into one of the library files. Perhaps contact Nvidia? I have worked a little with WinAPI, but not in the case of using an SDK. Since this would be a beginning point for the library, might I assume that complex mesh deformations and simulations (e.g. fluid dynamics) are beyond the scope of what should be done over the summer? Certainly one could implement certain models with effort, but I mean that the library will lack explicit methods for something of the following degree: http://www.youtube.com/watch?v=7Who8EpbvCY The same question goes for Multithreading. I will continue to tinker with and read over the SDK(s) and brush up on my matrix arithmetic. For the proposal, should I have a couple concrete classes? Or would pseudocode/feature descriptors suffice? More questions on the way, -Preston

1 0

Fwd: How to start contributing for Boost
by Hasit Bhatt 12 Apr '13

12 Apr '13

I'm 3rd year B.Tech student in Computer Science with quite good proficiency in c,c++ and python. I'm applying for Google Summer Of Code. How should I start?

2 1

Can C++11 INVOKE be defined with C++98 compilers?
by Vicente J. Botet Escriba 12 Apr '13

12 Apr '13

Hi, I would like to implement C++11 INVOKE on C++98 compilers. I have a C++11 implementation on boost/thread/detail/invoke.hpp based on the one of libc++. Could this be done or there is something that can not be done inherently? Best, Vicente

2 4

GSoC 2013: ODE or B-trees?
by Артём Серов 11 Apr '13

11 Apr '13

Hello! My name is Artem Serov. I would like to participate GSoC in Boost and I have a dilemma. I don't have enough information to choose one of two projects in boost: B-trees and Ordinary Differential Equations and want to find out which project matches me better. Before composing a formal application (with all formal requirements) for a project and deeper investigating of the environment i hope to get a piece of advice about my doubts. A few facts: - the 3rd year student of Moscow Institute of Physics and Technology (State University), Russia. - ~1 year exprerience of C/C++ industrial programming in Intel as intern. - no experience in open souce project contribution. Both projects are very challenging and interesting for me. ODE: I had cources of Theory of ODE, Computional Mathematics and Parallel programming (OpenMPI) at the university, so i am familiar with the topic. B-trees: The topic "B-trees" is located in the additional list of ideas for GSoC, so there is no concrete information except the title. Could someone (maybe who have put this in the ideas list) will tell anything: maybe requirements, any thoughts, why is it mentioned in GSoC ideas list, why isn't this idea in a main list or any information like in projects in the main ideas list, please? What would you advise me: to apply for the concrete project from the main list or to develop the project from additional list? What is preferable for the community? Could you give a kind of very brief estimation and comparisson of difficulty of both projects? -- Thanks, Artem Serov

3 3

[Graph] Efficiently finding cycles in a (multi)graph
by Louis Dionne 11 Apr '13

11 Apr '13

Dear Boost, I have implemented the `hawick_circuits` algorithm described in [1] for finding all the elementary circuits of a directed (multi)graph. I implemented it in a generic fashion, planning to propose it for inclusion in Boost. Boost.Graph currently contains the `tiernan_all_cycles` algorithm for finding all the cycles in a graph. However, it is undocumented and it has a time bound (for which no precise analysis is provided) that makes it unsuitable even for moderately sized graphs. In fact, I implemented `hawick_circuits` because `tiernan_all_cycles` did not cut it for my application. My implementation is available at [2]. It is licensed under the Boost license and was tested using the test suite at [3]. I am posting this message for two reasons: 1. To know whether there is interest for such an algorithm in Boost.Graph. 2. To spread the word that this implementation exists for C++, to save people the hassle of reinventing the wheel before Boost.Graph officially provides it. I will create a Trac ticket if there is interest, but note that I won't submit a patch immediately because I am in deep juice with school right now. Regards, Louis Dionne P.S.: More information on the test suite can be found at [4]. [1] http://bit.ly/12LMwIr [2] http://bit.ly/10MSAhW [3] http://bit.ly/YdLHVn [4] http://bit.ly/16SvlW6

1 1

GSoC 2013
by İslam Yaşar 11 Apr '13

11 Apr '13

Hi, I'm a graduate student and work since 2 years as a C++ developer on Unix-like systems (FreeBSD and Linux), i want to implement a library for Boost. It is a thread-safe queue that is implemented on disk. You can use it as a IPC. Is anyone interested to mentor this project ? Thanks Islam Yasar

3 2

Boost.uBLAS for GSoC 2013
by Sathyam Vellal 11 Apr '13

11 Apr '13

Hello. I'm Sathyam Vellal, a 3rd year undergraduate student pursuing Computer Science. I'm interested in contributing to Boost.uBLAS in unifying the vector and matrix representations. I've looked at the docs ( http://www.boost.org/doc/libs/1_53_0/libs/numeric/ublas/doc/index.htm) to get an idea of the library. Does anyone have any suggestions on how I could proceed more and connected to this project? Thank you -- Sathyam M Vellal Computer Science and Engineering, P.E.S. Institute of Technology, Bangalore, India.

2 1

GSoC 2013 : Boost.uBLAS
by Jignesh Jain 11 Apr '13

11 Apr '13

I am interested in this project for Gsoc, which involves unification of vector and matrix libraries. I have been browsing boost ublas code, but have no idea about how should I begin as I am totally new to Boost. Can Someone please guide me some approach for getting started in this project. Thank you.

1 0

Boost.Multiprecision GSoC 2013
by Nikhar Agrawal 10 Apr '13

10 Apr '13

Hi, My name is Nikhar Agrawal. I'm a 2nd year Computer Science student. I'm interested to work for Boost in GSoC and I found the project Boost.Multiprecision really really interesting. Any pointers on how should I go about it? Meanwhile, I'll go through this book:- http://www.loria.fr/~zimmerma/mca/mca-cup-0.5.1.pdf Thanks

3 3

[thread] using Boost.Thread with move-only arguments
by Fernando Pelliccioni 10 Apr '13

10 Apr '13

Hi Vicente, I have an issue with Boost.Thread contructor using move-only type arguments. The "Thread Constructor with arguments" section of the documentation says ... template <class F,class A1,class A2,...> thread(F f,A1 a1,A2 a2,...); Preconditions: F and each An must by copyable or movable. http://www.boost.org/doc/libs/1_53_0/doc/html/thread/thread_management.html… "An" could be copyable or movable, but the following example fails to compile... error: use of deleted function 'A::A(const A&)' //Begin code ------------------------------------ #include <boost/thread.hpp> struct A { A() = default; A( const A& other) = delete; A& operator=( const A& other) = delete; A( A&& other) = default; A& operator=( A&& other) = default; void run() {} }; void f( A a ) { a.run(); } void exec_boost() { A a; boost::thread t( f, std::move(a) ); t.join(); } //End code -------------------------------------- I think we should modify ... template <class F,class A1> thread(F f,A1 a1,typename disable_if<boost::thread_detail::is_convertible<F&,thread_attributes >, dummy* >::type=0): thread_info(make_thread_info(boost::bind(boost::type<void>(),f,a1))) { start_thread(); } ... by ... template <class F,class A1> thread(F&& f,A1&& a1,typename disable_if<boost::thread_detail::is_convertible<F&,thread_attributes >, dummy* >::type=0): thread_info(make_thread_info(boost::bind(boost::type<void>(),f,boost::forward<A1>(a1)))) { start_thread(); } ( In the all family of related ctors in "boost/thread/detail/thread.hpp" ) But, I don't know if boost::bind is forwarding its arguments I think we should modify Boost.Bind to be similar to std::bind. Is there any reason why Bind has not changed so far? Have you found any limitations? If Bind can not be changed, I think Boost.Thread should use some other tool similar to Bind to make forwarding parameters. GCC Libstdc++ use a Bind-lite tool for std::thread. I can work on this if you want. What do you think? Environment: Windows 7 64bits MinGW - GCC 4.7.2 MSVC 2010 MSVC 2012 Boost 1.53.0 Non-Variadic template code branch Regards, Fernando Pelliccioni

2 10

Re: [boost] GSoC 2013 : Implementing Dynamic Programming Algorithms
by Aman Gupta 09 Apr '13

09 Apr '13

Hi, Thanks for the reply. The first thing I want to implement is a Integer-Knapsack problem which takes in a precision error(i.e. an epsilon which is a indicator of the allowed error in the input) The input parameters are Weights, Values and the error. The first thing to do is massage the values according to the error (e.g. if the value is ~10^4 divide it down to ~10^3 according to the error) then run the a dynamic programming algorithm, which has a running time of O(n^3/e) (n : number of items, e :error) Hence, an arbitrarily close approximation is possible with a running time trade-off. Also, a vanilla variety of the knapsack problems(with small instances) which gives the optimal solution can also be implemented. I also want to implement the assignment problem, which also arises in a lot of situations in real life ( http://en.wikipedia.org/wiki/Assignment_problem) using the Hungarian Algorithm. I realize this requires effort but I'm really interested in adding a feature to the boost library. Regards, Aman Gupta

1 0

GSoC 2013 - Boost registration?
by Paul A. Bristow 09 Apr '13

09 Apr '13

http://www.google-melange.com/gsoc/events/google/gsoc2013 March 18: 19:00 UTC Mentoring organizations can begin submitting applications to Google. March 29: 19:00 UTC Mentoring organization application deadline. Just checking that Boost has/is registering? Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

3 3

GSoC 2013 : Implementing Dynamic Programming Algorithms
by Aman Gupta 09 Apr '13

09 Apr '13

Hi, I am Aman Gupta from BITS-Pilani India, I am a 4th year Undergraduate Student majoring in Computer Science. I've noticed that boost does not contain dynamic programming algorithms like Integer-Knapsack, Longest Common Sub-sequence. I was thinking that implementing this would be a good project. I realize most of these problems are non-polynomial in complexity but I was thinking implementing them to a certain size will not be problem. Also, since some of the dynamic programming algorithms have alternate greedy algorithms which compromise on correctness but are faster, implementing those can be useful. The knapsack problem(which comes in a lot of situations) for which there exists an algorithm which gives an arbitrarily close approximation to the optimal value can be implemented. ( e.g. f(weights,values,error) could be the function, the user has a trade-off between error and computation time). I think it could be useful in situations where the user just decides the error he wants or perhaps how fast he wants his computation. Please let me know if this seems like a valid project idea to you! Thanks, Aman Gupta

2 1

[move] move's is_convertible does not compile with aligned data
by Tobias Loew 09 Apr '13

09 Apr '13

The implementation of move's is_convertible-type has the same problems on MSVC with aligned types as reported for type_trait's is_convertibale in Ticket #5271 https://svn.boost.org/trac/boost/ticket/5271 As type_trait's implementation has been fixed, a simple solution would be letting the user (and not the code in move.hpp:41) [not] define BOOST_MOVE_AVOID_BOOST_DEPENDENCIES regards Tobias -- View this message in context: http://boost.2283326.n4.nabble.com/move-move-s-is-convertible-does-not-comp… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 2

boost/thread.hpp UBICOM processor
by Aswin Paranji 09 Apr '13

09 Apr '13

Hi, I'm trying to compile boost library 1.53 using the ubicom toolchain provided by our embedded partner. During compilation of the boost library there was a linker error (_sync_fetch_add). This was overcome by adding define statement BOOST_SP_USE_PTHREADS, along with FENCED in user-config.hpp. The application was linked properly. Running the application within the embedded box exits with a segmentation fault happening before printing the first line of the main function. This was narrowed down to boost/thread.hpp header. Removing the header allows the application to print the first line and return. The problem I have is, I do not have GDB/GDBServer to assist me. Also, i could not use back_trace as the toolchain does not have the necessary header files. Can anyone tell me what might be causing the problem. I'm sure there is some sort of conflict between the processor architecture with thread or the toolchain which was used to compile boost. The GCC version is 4.4.1 Appreciate if someone can help me on this. Thanks, Aswin Paranji

2 2

[phoenix] doesn't compile with gcc 4.9 snapshot
by Nathan Ridge 08 Apr '13

08 Apr '13

Hi, I'm trying to compile some code that uses Boost with a GCC 4.9 snapshot, but something seems to be going badly wrong. Something as simple as a file containing the include: #include <boost/phoenix/core.hpp> fails to compile, with the following errors: In file included from boost/proto/matches.hpp:42:0, from boost/phoenix/core/domain.hpp:12, from boost/phoenix/core/actor.hpp:17, from boost/phoenix/core.hpp:15, from test.cpp:1: boost/proto/traits.hpp: In instantiation of 'struct boost::proto::tag_of<boost::proto::_>': boost/phoenix/core/domain.hpp:25:18: required from here boost/proto/traits.hpp:241:42: error: no type named 'proto_tag' in 'struct boost::proto::_' typedef typename Expr::proto_tag type; ^ In file included from boost/phoenix/core/argument.hpp:15:0, from boost/phoenix/core.hpp:17, from test.cpp:1: boost/phoenix/core/terminal.hpp: In instantiation of 'struct boost::phoenix::detail::placeholder_idx<boost::proto::make<boost::is_placeholder<boost::proto::_value>()> >': boost/phoenix/core/terminal.hpp:122:18: required from here boost/phoenix/core/terminal.hpp:115:16: error: 'value' is not a member of 'boost::proto::make<boost::is_placeholder<boost::proto::_value>()>' struct placeholder_idx ^ The exact same code compiles fine with GCC 4.8 and earlier. Any ideas as to what might be going wrong? Thanks, Nate

1 1

Boost.Graph for GSoC
by Daniel Mitchell 08 Apr '13

08 Apr '13

Hi all, I'm a researcher and graduate student at the University of Texas at Austin and I'm interested in doing a Boost.Graph project for GSoC. I was thinking of doing one or more planar graph algorithms, in particular the multiple source shortest paths algorithm for planar graphs described at http://courses.csail.mit.edu/6.889/fall11/lectures/L11.html The algorithm assumes that the sources are located on a single face. It proceeds by calculating the shortest paths tree from one source and then minimally modifying the tree to efficiently get the shortest paths from the other sources. The algorithm uses a dynamic tree data structure, so developing that data structure would be part of the project too. I've made prior contributions to BGL. I worked with Doug Gregor to implement color maps for the breadth first and Dijkstra's algorithms. One of my current areas of research is movement ecology, where planar graphs can be used to study movement. Let me know what you think. Daniel Mitchell

3 4

[container] stable_vector::back() is broken in Boost 1.53
by Klaim - Joël Lamotte 08 Apr '13

08 Apr '13

Tested on both VS2010 and VS2012, boost 1.53, with default boost no option set: ############ #include <boost/container/stable_vector.hpp> #include <iostream> int main() { boost::container::stable_vector< int > values; values.emplace_back( 42 ); int& bad_value = values.back(); // bad address int& good_value = values.front(); int& also_good_value = values.at(0); // imply values[0] std::cout<< " ADDRESS OF BAD VALUE : " << &bad_value << std::endl; std::cout<< " ADDRESS OF GOOD VALUE : " << &good_value << std::endl; std::cout<< " ADDRESS OF ALSO GOOD VALUE : " << &also_good_value << std::endl; } ############ This code displays addresses of the bad_value object very low on Debug and very high on Release. I believe that .back() is broken. However, when I test there : http://liveworkspace.org/code/3F11CK$2 it seems to work with any available compiler. So either it's LiveWorkspace which use an older boost version, or this issue arise only on VC. I made a ticket: https://svn.boost.org/trac/boost/ticket/8412 Joel Lamotte

6 10

GSoC 2013: Boost is a mentoring organization
by Boris Schaeling 08 Apr '13

08 Apr '13

Boost is a mentoring organization in this year's GSoC program. Thanks to everyone who added proposals to <https://svn.boost.org/trac/boost/wiki/SoC2013> and to Google for inviting us! According to the GSoC calendar at <https://google-melange.appspot.com/gsoc/events/google/gsoc2013> we have now two weeks where would-be student participants discuss application ideas. If you are interested in participating in the program - either as a student or as a mentor - get active now! :) 1) Have a look at our ideas list at <https://svn.boost.org/trac/boost/wiki/SoC2013>. Find something which interests you or think of a brand new project. 2) Send a mail to the mailing list at <mailto:boost@lists.boost.org> to let people know what you are interested in and what you have to offer. 3) Discuss your idea with others and try to turn it into an actual GSoC project. You need at least a project description, a goal, a mentor and a student. :) Boris

1 0

Adding some image libs to boost build
by Christian Henning 08 Apr '13

08 Apr '13

I have added jpeg, png, and tiff jam files to boost trunk. These files will be needed by gil::io tests. There are still some remaining issues which I like to discuss in this thread: 1. building these libs sometimes requires renaming header and/or source files to the correct architecture. Should we leave that up to the user or should bjam take care of it. And if so, how will we configure that. One example is jpeg: see jconfig.vc -> jconfig.h 2. Tiff has a file nmake.opt which is included in the makefile. How will we include all those options? Regards, Christian

3 5

Release milestone.
by Vicente J. Botet Escriba 08 Apr '13

08 Apr '13

Hi, I would like to merge some fixes in Boost.Thread, but I suspect that the release branche should be blocked as for https://svn.boost.org/trac/boost/wiki/ReleaseSchedule. On which stage (milestone) is the release process? Best, Vicente

2 2

[gil] numeric extension, arithmetic operators
by Harg Tholan 08 Apr '13

08 Apr '13

Hey, Do we plan to overload arithmetic operators for Pixel as wrappers of the numeric extension? or should users derive a class from Pixel adding such functionality? ATM, for diving two pixels (rgb_8 for example), I have to call the division this way: pix_r = pixel_divide_t<rgb_8_pixel_t, rgb_8_pixel_t, rgb_8_pixel_t>().operator()(pix2, pix1); The thing is that I have a template class that makes use of operator/ at some point on one of the template parameters, and I would like to be able to use it with 'Pixel' type. Thank you!

3 7

future<>::then() Error returning future<void> (on trunk)
by Fernando Pelliccioni 07 Apr '13

07 Apr '13

Hi Vicente, hi all, I noticed that in the trunk there is a implementation of future<>::then(). Thank you very much for your efforts to implement it! The following example, compiles OK boost::future<int> f1 = boost::async([]() { return 123; }); f1.then([](boost::future<int> const& f) { return std::string(""); }); But this one fails to compile: boost::future<int> f1 = boost::async([]() { return 123; }); f1.then([](boost::future<int> const& f) { }); Here future<>::then() have to returns future<void> like ... boost::async([]() { }); Am I right? On the other hand, have you taken into account the following paper? http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3451.pdf Regards, Fernando Pelliccioni.

3 5

C++11 and compilers not supported by vendors any more
by Antony Polukhin 06 Apr '13

06 Apr '13

Hi, I've got an almost ready patch for Boost.Any, that adds rvalues support to it via Boost.Move. But the trouble is following: Current version of patch may (and would) break compilation on ancient compilers, like MSVC6, BCC 5.5 and g++ 2.95. It can be tuned, to work even on those platforms, but: * I have no access to those antiquities, so it is impossible to run tests * It will take huge amount of time, to make it work What is the current policy in such situations (may ancient compilers support be dropped)? -- Best regards, Antony Polukhin

4 3

Review managers wanted for augmented data structures
by Vadim Stadnik 06 Apr '13

06 Apr '13

Hi all, At present, neither Boost library nor STL provides containers using augmented data structures. I suggest that the Boost community consider solving the challenging problem – how to extend STL by integrating advanced data structures. Is there an alternative of not integrating advanced data structures into STL? IMO, no, since it is equivalent to “STL must go”. C++ cannot ignore performance benefits provided by these data structures. On the other hand, advanced data structures can be implemented in many programming languages and this will make C++ less competitive. Augmented red-black trees could have been included in the very first version of STL. Why is it difficult and has not been done yet? The major obstacle for the integration is the C++ standard specification of computational complexities of single operations for containers and iterators. Augmented trees are non-standard due to different performance guarantees. At the same these data structures are beneficial for complex algorithms, since they offer a wider set of more efficient operations compared to standard containers. The typical performance improvement for one operation is O(log N) against O(N). For less efficient operations these trees normally provide running time O(log N) against O(1), which is good enough for many applications. The C++ STL will be under pressure as long as there are new data structures that offer better running time for user algorithms. Asymptotically, the main parameter that determines the running time of an algorithm is the total computational cost (to simplify the discussion we omit the effect of locality of reference). By definition, the total computational cost is the sum of costs of single operations multiplied by their frequencies. For a general purpose library, such as STL, it is impossible at the design stage to know frequencies of all container and iterator operations required in all possible user algorithms. A more reasonable and practical approach to STL would be to provide a wide set of interchangeable containers and data structures with different performance guarantees and allow programmers to make decisions about the most suitable containers for specific applications. Relatively small frequencies of inefficient operations do not have significant effect on the total computational cost of an algorithm. Thus, in principle, containers and iterators can provide even inefficient operation in order to support more unified interfaces and to improve the generality. The replacement of interchangeable containers offers the advantage of low development cost solutions to performance bottlenecks that arise due to enhancement requests and/or an increase in the number of elements processed by a user algorithm. Also, I’d like to note that the representation of sequences using augmented trees is a frequent point of confusion and probably the fact that was overlooked in the development of previous versions of STL. The general description of the method of augmenting data structures is given in the section 14.2 of this book T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 2nd Edition, MIT Press and McGraw-Hill, 2001. The specific application of this method is provided for order statistic trees and interval trees. Unfortunately, there is no example of a sequence that stores unordered elements. Probably for this reason augmented red-black trees are often considered to be an improvement of search trees only. The efficient representation of sequences by the described red-black trees follows from the fact that augmenting by the counter of children nodes supports efficient mapping from non-negative integers into container elements. It works both for ordered and unordered containers with unique and multiple elements or keys. There are two libraries in the Boost review schedule: http://www.boost.org/community/review_schedule.html "STL Extensions" and "Countertree". None of them has as yet a review manager. The order of the reviews may not be significant. It is more important that at least one library pass the review. This would help integrating other advanced data structures. Are there Boost experts who could volunteer to take responsibility of review manager for any of these two libraries? Regards, Vadim Stadnik

2 4

[any] C++11 support
by Antony Polukhin 06 Apr '13

06 Apr '13

Hi, There is a patch for Boost.Any, that adds rvalue references support (via Boost.Move) and noexcepts (see ticket #6999 any.patch). It also includes a set of tests, and they pass well. Previous maintainers of the library are away for a long time, so if there will be no objections till the end of next weekend, I'll apply the patch. -- Best regards, Antony Polukhin

1 0

Scope Tracer or General Scope Function with parameter or variable values
by Anlin Zhang 06 Apr '13

06 Apr '13

Hi, I'm wondering if a "Scope Tracer" or a "General Scope Function" can be easily implemented with existing boost libraries now. One example use case is to log variable or parameter values or any program state when entering or leaving a scope, but it can do more than just logging, it can, for example, lock/unlock mutex, or prepare/teardown test cases, etc. For logging requirement, to give you an idea, the expected log message looks like this: >04/10/09 05:29:12:210257 entering func foo with parameter a=10, b=1.5, d.x=10, d.y=[string], global d=2, filename:test.cpp>04/10/09 05:29:12:210257 entering while() a=10, b=1.5, d.x=10>04/10/09 05:29:12:210257 leaving while() a=9, b=1.5, d.x=9>04/10/09 05:29:12:210257 entering while() a=9, b=1.5, d.x=9>04/10/09 05:29:12:210257 leaving while() a=8, b=1.5, d.x=8>...>04/10/09 05:29:12:210257 entering while() a=2, b=1.5, d.x=2>04/10/09 05:29:12:210257 leaving while() a=1, b=1.5, d.x=1>04/10/09 05:29:12:210257 entering while() a=1, b=1.5, d.x=1>04/10/09 05:29:12:210257 leaving while() a=0, b=1.5, d.x=0>04/10/09 05:29:12:210257 leaving function foo with parameter a=0, b=1.5, d.x=0, d.y=[string], global d=2, filename:test.cpp It does not have to be logging, it can do any general processing when entering/leaving a scope. I implemented a small library to do so in 2008 mainly for tracing, it worked fine for me and I never revisited it again until recently. Wondering if boost has libraries to support such a requirment. My implementation has a template class logger_class which can manage the log-level at runtime and send the log message to standard-output or other places. Application code use a macro to invoke the library, the macro can be disabled at compile time, or weakened to only log scope without variables. Example of the macro definition: #ifdef ENABLE_ONLY_SCOPE_TRACER #define SCOPE_TRACER(logger_class, logger, args, level, scope) \ scope_tracer<logger_class> tracer_obj(logger, __FUNCTION__, __FILE__, __LINE__); \ if (logger.get_level() >= level){ \ tracer_obj.init(level, scope).noMore(); \ } #else #ifdef DISABLE_SCOPE_VAR_TRACER #define SCOPE_TRACER(logger_class, logger, args, level, scope) #else #define SCOPE_TRACER(logger_class, logger, args, level, scope) \ scope_tracer<loggerClass> tracer_obj(logger, __FUNCTION__, __FILE__, __LINE__); \ if (logger.get_level() >= level){ \ tracer_obj.init(level, scope) << args; \ tracer_obj.noMore(); \ } #endif#endif Application code example: int globalVar; void MyClass::func1( A a, B&b, C* c, int d, std::string & s){ SCOPE_TRACER(MyLogger, test_logger, a<<b<<c<<d<<s<<globalVar, LOG_LEVEL_TRACE, "func1"); ... int localVar; while(x){ SCOPE_TRACER(MyLogger, test_logger, x<<a<<b<<c<<d<<s<<globalVar<<localVar, LOG_LEVEL_TRACE, "while(x)"); ... } ... } As you see, "<<" operator is being used. But it does not have to be only "<<" operator. Basically any C++ operator can be supported between the logger class and logged type. And the logger_class is not limited to just do tracing, it can virtuall do anything. I can attach the code if needed. The code was compiled with GCC on linux and VisualStudio on Windows. If the above functionality can be easily achieved using existing boot library, please advise how. Otherwise is it worth to request such a feature in boost? Thanks,Anlin

2 1

Regression tests crashing
by Tom Kent 03 Apr '13

03 Apr '13

Sometime yesterday most of the regression tests that I run (not the incremental ones?) started crashing and not sending any results. The screen output is the general error: "No such file or directory: '/home/tomkent/teeks99-02/a/results/boost/bin.v2/libs/any/test/any_test.test'" Looking at the tail of the results/bjam.log file shows this: error: at /home/tomkent/teeks99-02/a/tools_bb/kernel/modules.jam:107 error: Unable to find file or target named error: 'has_float128.cpp' error: referred to from project at error: '../libs/multiprecision/config' That was on Ubuntu 12.04, running the gcc-4.6 tests, but the others (including windows) have the same error. I don't believe anything else changed on the machines that were running the regression tests. You can still see the previous results on the regression results page. Tom Kent

1 0

[utility]result_of - erroneous result type from a C++11 lambda
by Vicente J. Botet Escriba 03 Apr '13

03 Apr '13

Hi, I've started to use C++11 lambda functions with Boost.Thread. The following works with clang-3.2 boost::future<int> f1 = boost::async( []() -> int {return 123;} ); But it fails with gcc-4.6.2, 4.7.2 and 4.8.0 ../example/lambda_future.cpp:25:91: erreur: conversion from ‘boost::future<void>’ to non-scalar type ‘boost::future<int>’ requested boost::future<int> f1 = boost::async( []() -> int {return 123;} ); The current implementation of boost::async uses boost::result_of to get the result type of the callable parameter. Is this a know bug on boost::result_of or gcc compiler? Best, Vicente

9 15

generate algorithm
by Fabian Bösch 02 Apr '13

02 Apr '13

Dear Boost community I am developing a library which extends the STL generate algorithm. It's aim is to improve performance for highly optimized (e.g. vectorized) generation mechanisms while it retains the same interface. This is especially useful when dealing with random number generation as there are several libraries (e.g. Intel MKL or AMD ACML) which provide means to generate a block of random values at once. However, the current STL generate algorithm is not able to cope with such "range generation". Is there any interest in a such a library for Boost? Cheers, Fabian Bösch

4 5

[boost.lockfree] Lockfree on Windows?
by Philip Bennefall 02 Apr '13

02 Apr '13

Hello, I am in need of a lock free fifo for my current project so I looked into lockfree. However, in the documentation I see: boost.lockfree has been tested on the following platforms: a.. g++ 4.4, 4.5 and 4.6, linux, x86 & x86_64 b.. clang++ 3.0, linux, x86 & x86_64 My question is what the status is on Windows? The documentation for boost.atomic says that Windows has been tested, so is there a reason why lockfree might have platform specific issues? When I run the example provided for the single producer/single consumer queue, I get the expected results so it does seem to work. It also states that the queue is lock free. Is it safe to use on Windows at present? Thanks in advance for any information. Kind regards, Philip Bennefall

2 3

[extension] library under construction status
by Lorenzo Caminiti 02 Apr '13

02 Apr '13

Hello all, What's the status of Jeremy Pack's library under construction Boost.Extension? P.S. I read the docs and I have a couple of comments: 1. shared_library as RAII Why isn't shared_library an RAII object? If there's a good reason for that, a RAII object should also be provided scoped_library that will open at construction and automatically close at destruction. 2. get should use function type syntax get<result_type, arg1_type, arg2_type, ...> should be changed to get<result_type (arg1_type, arg2_type, ...)> 3. type_map purpose/name The introduction of type_map seems arbitrary... some rationale needs to be provided as soon as it's introduced in Tutorial 2. Is there a better name than type_map? That name tells me little about what it is.. maybe, factory_map given that it's a map strings to factories? 4. call(type_map) lib.call(type_map) the name call is too generic, it should be changed to set or even better get_factories: type_map types; if(!lib.call(types)) ... Changed to: factory_map factories; if(!lib.get_factories(factories)) ... 5. type_map doesn't allow for multiple constructors type_map doesn't allow for derived classes to have constructors with different signatures than the base class. It also doesn't allow for classes (derived or base) to have multiple constructors. In any case, the syntax should use member function types, changing the current syntax: std::map<std::string, factory<animal, int> >... to: std::map<std::string, factory<void (*::animal)(int)> 6. I didn't understand parameter_map purpose, usage, etc :( Thanks. --Lorenzo

3 3

Building ThreadPool with boost::function in boost::lockfree::queue
by Ryan Fogarty 01 Apr '13

01 Apr '13

I am having trouble typedef-ing a lockfree::queue with boost::function as the element for a ThreadPool class I am writing. TestJobQueue1 below compiles fine while TestJobQueue2 compile fails. I am using gcc 4.7.2 and boost_1_53_0. void doSomething() { std::cout << "Called doSomething\n"; } typedef boost::function<void ()> FunctionType; class TestJobQueue1 { public: typedef std::vector<FunctionType> FunctionArray; TestJobQueue1() { std::cout << sizeof(FunctionType) << std::endl; FunctionType f(&doSomething); FunctionArray funcArray; funcArray.push_back(f); std::cout << funcArray.size() << std::endl; } }; class TestJobQueue2 { public: typedef boost::lockfree::queue<FunctionType> QueueType; TestJobQueue2() { std::cout << sizeof(FunctionType) << std::endl; FunctionType f(&doSomething); QueueType funcQueue; funcQueue.push(f); } }; >> g++ -c -I/usr/local/boost_1_53_0/include TestFunctionCompleteness.cpp produces: In file included from TestFunctionCompleteness.cpp:11:0: /usr/local/boost_1_53_0/include/boost/lockfree/queue.hpp: In instantiation of ‘class boost::lockfree::queue<boost::function<void()> >’: TestFunctionCompleteness.cpp:42:17: required from here /usr/local/boost_1_53_0/include/boost/lockfree/queue.hpp:79:1: error: invalid application of ‘sizeof’ to incomplete type ‘boost::STATIC_ASSERTION_FAILURE<false>’ /usr/local/boost_1_53_0/include/boost/lockfree/queue.hpp:83:1: error: invalid application of ‘sizeof’ to incomplete type ‘boost::STATIC_ASSERTION_FAILURE<false>’ >> g++ -c --std=c++0x -I/usr/local/boost_1_53_0/include TestFunctionCompleteness.cpp produces: In file included from TestFunctionCompleteness.cpp:11:0: /usr/local/boost_1_53_0/include/boost/lockfree/queue.hpp: In instantiation of ‘class boost::lockfree::queue<boost::function<void()> >’: TestFunctionCompleteness.cpp:42:17: required from here /usr/local/boost_1_53_0/include/boost/lockfree/queue.hpp:79:5: error: static assertion failed: (boost::has_trivial_destructor<T>::value) /usr/local/boost_1_53_0/include/boost/lockfree/queue.hpp:83:5: error: static assertion failed: (boost::has_trivial_assign<T>::value) Is boost::function somehow an incomplete type and not expected to work in boost::lockfree::queue or is this a bug in the queue implementation? Can anyone suggest a simple workaround? Thank you, Ryan Fogarty

2 3

traits classes vs. metafunctions
by Stefan Strasser 01 Apr '13

01 Apr '13

Hi everyone, are there any guidelines for boost libraries on when to use traits classes and when to use a metafunction for each member of a would-be traits class? I've seen both in boost libraries. c++11 uses traits classes (iterator_traits, pointer traits, ...), but Abrahams and Gurtovoy [1] argue that traits classes ("traits blobs") should be avoided "at all costs" because they are an unnecessary concatenation of multiple metafunctions into one metafunction with multiple return values. in practice, this means that if a single 'traits class member' aka 'metafunction result' ought to differ from the defaults, the entire traits class has to be reimplemented by the user, not only the metafunction whose result ought to differ from the default. on the other hand, asking a user to implement 5 or more metafunctions is much more tedious than implementing a traits class. possibility 1) template<...> struct property1 : mpl::bool_<...>{}; template<...> struct property2 : mpl::bool_<...>{}; template<...> struct property3 : mpl::bool_<...>{}; 2) template<...> struct ..._traits{ typedef mpl::bool_<...> property1; typedef mpl::bool_<...> property2; typedef mpl::bool_<...> property3; }; you could provide both, but in which "direction"? does a traits class refer to metafunctions, or do metafunctions refer to a traits class? a) template<...> struct ..._traits{ typedef typename property1<...>::type property1; typedef typename property2<...>::type property2; typedef typename property3<...>::type property3; }; b) template<...> struct property1 : ..._traits<...>::property1{} template<...> struct property2 : ..._traits<...>::property2{} template<...> struct property3 : ..._traits<...>::property3{} which is accessed when "calling" the metafunction? it seems to me that metafunctions are better for the "caller" and traits classes are better for the implementor of the traits/metafunctions. in my case, the caller is a library and the implementor is the user, so you might choose a traits class over metafunctions. but what if a new member is added that wasn't there before (like "property4"). the implementor of an (old) traits class could not have known about the new member, so accessing the new member (by the library) will result in an error, while a new metafunction "property4" could simply return a default. should new properties of traits classes only be accessed after making sure they exist, using SFINAE? there isn't a precedent for this in c++11. only new traits classes were introduced, but no new members of already existing traits classes. should metafunctions always be preferred? why did c++11 choose traits classes over metafunctions, even though the concept of a metafunction was introduced in c++11 (<type_traits>). Thanks [1] Abrahams; Gurtovoy: C++ Template Metaprogramming, 2.2 Metafunctions

7 14

[config] gcc-4.8 and __GXX_EXPERIMENTAL_CXX0X__
by Vicente J. Botet Escriba 01 Apr '13

01 Apr '13

Hi, it seems that gcc-4.8 doesn't defines any more __GXX_EXPERIMENTAL_CXX0X__ when the flag -std=c++11 is given. This means that all the BOOST_NO_CXX11_ are defined. Could something be done to make usable gcc-4.8 in c++11 mode? Best, Vicente

2 4

[mpi] Boost.MPI and MPI 3!
by Renato Forti 01 Apr '13

01 Apr '13

Hi All, Boost.MPI project will support MPI version 3 with that provide some support to fault tolerance! Have any work in this area? Thanks

2 2

[build & test] clang-3.2 for Win32
by Jim Bell 01 Apr '13

01 Apr '13

I took the liberty to run regressions with clang-3.2 on Win32. It's pretty unhappy, and most failures have to do with it not building shared libraries (DLLs) correctly. Not finding symbols. I found a (non-boost) thread that talks about that being a problem with it. Even so, I had a couple questions: 1. It gets labeled clang-linux-3.2, though it's under the Windows umbrella in the regression matrix. How do we fix that? user-config.jam 'using clang ;' does seem to work fine. 2. I get these warnings. They seem like clang's problem, not ours. Am I right? ..\boost/test/execution_monitor.hpp:59:7: warning: 'dllexport' attribute only applies to variables and functions [-Wignored-attributes] class BOOST_TEST_DECL translate_exception_base { ..\boost/test/detail/config.hpp:88:29: note: expanded from macro 'BOOST_TEST_DECL' # define BOOST_TEST_DECL BOOST_SYMBOL_EXPORT ..\boost/config/platform/win32.hpp:30:42: note: expanded from macro 'BOOST_SYMBOL_EXPORT' # define BOOST_SYMBOL_EXPORT __declspec(dllexport) <built-in>:154:38: note: expanded from macro '__declspec' #define __declspec(a) __attribute__((a)) 3. I tried to coerce the regression to use only static libraries (since clang does build boost static pretty well)... --bjam-options='link=static runtime-link=static' but this made some part of the regression tests very unhappy: error: link=shared together with runtime-link=static is not allowed error: such property combination is either impossible error: or too dangerious to be of any use That's understandable, as it goes against the grain. But is there a way to inform the tests somehow? It's easy to imagine wanting to explicitly test what a shared library does, but what about cases where it doesn't matter if it's shard or static? (Are they distinguishable?) If anyone's interested, please peruse the mess I made of the regression matrix. And purge them from the matrix, too, eventually.

1 0

Associative container using a vector
by Stefan Strasser 01 Apr '13

01 Apr '13

Hi everyone, I often find myself using a specific data structure and I'm wondering whether: - it has a wellknown name - there is a generic equivalent in a boost library - or there is interest to add one. The basic idea is that you have a bunch of values stored in one object of type A: struct A{ vector<Value> values; }; and then you have multiple objects of type B that each have to associate data with each value stored in A. you could use: struct B{ map<Value,Data> data; }; but since A::values already provides a contiguous index for the values you can just as well store the data in B in a vector with matching indexes, and make sure that the indexes used in A::values don't change: struct A{ vector<Value> values; vector<std::size_t> freelist; map<Value,std::size_t> index; void erase(...){ push index of unused value to freelist; } void push_back(Value){ reuse a freelist entry or values.push_back; } }; struct B{ vector<optional<Data> > data; }; keep in mind that there is one object A for many objects B. you can now access the associated data of many objects B by looking up the index once in object A, and by wasting some space in B::data for unused entries: b.data[a.index[value]] If Data is a pointer or any other type that knows an empty() state, you can also get rid of optional<> and generalize it as two template like: template<class Value> class index; template<class Mapped,class OptionalTraits=boost_optional_traits> class vector_map; Is there anything like that?

3 4

[config] BOOST_NOEXCEPT on MSVC
by Michael Marcin 01 Apr '13

01 Apr '13

Why isn't BOOST_NOEXCEPT defined to be throw() for msvc? Microsoft Visual Studio 11.0\VC\include\yvals.h defines: #define _NOEXCEPT throw () and the rest of the standard library implementation uses it ex. void swap(thread& _Other) _NOEXCEPT { // swap with _Other _STD swap(_Thr, _Other._Thr); } http://msdn.microsoft.com/en-us/library/wfa0edys.aspx states: throw() The function does not throw an exception. However, if an exception is thrown out of a function marked throw(), the Visual C++ compiler will not call unexpected (see unexpected (CRT) and unexpected (<exception>) for more information). If a function is marked with throw(), the Visual C++ compiler will assume that the function does not throw C++ exceptions and generate code accordingly. Due to code optimizations that might be performed by the C++ compiler (based on the assumption that the function does not throw any C++ exceptions) if a function does throw an exception, the program may not execute correctly. It seems a better choice here than expanding BOOST_NOEXCEPT to nothing.

2 1

[fusion] What do we do with nil ?
by Joel de Guzman 31 Mar '13

31 Mar '13

Hello, This is a constantly nagging issue. There are a couple of places where nil is a PP define especially on the Mac: - objc.h #ifndef nil #define nil __DARWIN_NULL #endif and - MacTypes.h #ifndef nil #define nil NULL #endif So people complain because fusion uses nil as: namespace boost { namespace fusion { struct nil; }} So, nil is a reserved word in Objective-C. But this is C++! And that define is SUCH A BAD PRACTICE in C++! Some folks, like Paul Mensonides maintains a strong stance against this: I would just use #define nil nil as a sanity check and call it done. If the symbol is already defined, compilation error (or at least warning on overly permissive compilers). The symbol will be need to be undefined in between the inclusion of the two libraries. Workarounds like nil_ and (min)(...) just perpetuate the problem. Fix the root problem rather than treating the symptom indefinitely. Otherwise, where is the line drawn? Even if you can't provide a transparent fix (such as defining nil as a constant and min/max as functions), the backwards compatibility argument fails in the long run. The amount of effort required to make the necessary changes to existing code will eventually be outweighed by the effort to implement workarounds put into new code (as well as educate everyone that they are necessary)--especially in cases like these which can mostly be emulated in a way that causes most existing code to work. As I said over and over again, I'm listening and I would want to "fix" this issue if someone comes up with a reasonable (tested) patch that: 1) Detects the platform 2) Renames fusion::nil to something else (only for the affected platform) Yet, no-one wants to do this. Instead we get nasty remarks such as those found here: https://svn.boost.org/trac/boost/ticket/5010#comment:16 What do we do? I'm seeking for a resolution. Regards, -- Joel de Guzman http://www.boostpro.com http://boost-spirit.com

4 5

Re: [boost] Review managers wanted for augmented data structures
by Jonathan Wakely 31 Mar '13

31 Mar '13

8:08 PM, "Vadim Stadnik" wrote: > > Is there an alternative of not integrating advanced data structures into > STL? Why do they need to be put "into STL"? Why can't they exist in addition to it, or alongside it? > Augmented trees are non-standard due to different performance guarantees. They're non-standard because they're not in the standard. > A more reasonable and practical approach to STL would be to provide a wide > set of interchangeable containers and data structures with different > performance guarantees and allow programmers to make decisions about the > most suitable containers for specific applications. That's exactly what the STL is. The STL is about iterators and algorithms and concepts, not a fixed set of predefined containers. You've claimed the STL makes your containers "illegal" which is an odd claim that I can't agree with. Extending the STL with alternative containers is not just acceptable, I'm pretty sure it was intended by Stepanov et al. If your containers don't meet the complexity requirements of an Associative Container as defined in the standard that's fine, just don't claim it is an Associative Container and there shouldn't be a problem, surely. I don't understand why you think there are objections to non-standard containers. The containers in the standard are not suitable for all situations and are not the only choices, if there's a more suitable non-standard container then using it makes sense. This doesn't put the STL "under pressure", it proves its value, because existing algorithms work with both standard and non-standard containers if they model the required concepts.

4 8

[gil] undocumented/unintended concept requirements in color_convert
by Michael Marcin 31 Mar '13

31 Mar '13

I was trying to add other color spaces support and noticed that the rgb to cmyk converter contains: typedef typename channel_type<P2>::type T2; T2 x = channel_traits<T2>::max_value()-get_color(dst,black_t()); if (x>0.0001f) { float x1 = channel_traits<T2>::max_value()/float(x); T2 should model: http://www.boost.org/doc/libs/1_53_0/libs/gil/doc/html/g_i_l_0264.html but this code additionally requires T2 to be greater-than comparable to float and convertible to float.

3 4

[exception] uncaught_exception_count, scope(failure), scope(success)
by Evgeny Panasyuk 31 Mar '13

31 Mar '13

Hello All, There is implementation of uncaught_exception_count - https://github.com/panaseleus/stack_unwinding/blob/master/boost/exception/u… . uncaught_exception_count is a function similar to std::uncaught_exception from standard library, but instead of boolean result it returns unsigned int showing current count of uncaught exceptions. uncaught_exception_count allow us to implement scope(failure) and scope(success) features from D language in C++. ( previous discussion is at http://boost.2283326.n4.nabble.com/scope-exit-D-style-scope-failure-and-sco… ) Implementation of uncaught_exception_count is tested on {Clang 3.2, GCC 3.4.6, GCC 4.1.2, GCC 4.4.6, GCC 4.4.7, MSVC2005SP1, MSVC2008SP1, MSVC2010SP1, MSVC2012} x {x32, x64}. There are also live stress tests - detection of 500 simultaneous uncaught exceptions: GCC 4.6.3: http://liveworkspace.org/code/2qmSso%240 GCC 4.7.2: http://liveworkspace.org/code/dY0VD%240 Clang 3.2: http://liveworkspace.org/code/49MaPk%240 I think that uncaught_exception_count (and uncaught_exception_count_latch primitive) can be added into Boost.Exception library, at least into "detail" section. After that scope(failure) and scope(success) features can be implemented in Boost.ScopeExit library. Note, approximately 14 of 16 Boost.ScopeExit examples in manual are in fact emulations of scope(failure)/scope(success). So, looks like in first place Boost.ScopeExit was introduced to simplify emulation of scope(failure) and scope(success) features. What do you think? Thank you. Best Regards, Evgeny Panasyuk

5 11

Experimenting with modular Boost
by Jonathan Wakely 30 Mar '13

30 Mar '13

The instructions at https://svn.boost.org/trac/boost/wiki/TryModBoost seem to be bogus, apparently because the cloned repo contains no .gitmodules file so the 'git submodule update --init' command does nothing, and I then get an error for the last step: $ cmake -P forward_headers.cmake CMake Error: Error processing file:forward_headers.cmake I'm "only" using Git 1.7.12 but I don't think that's the problem. The older instructions at https://svn.boost.org/trac/boost/wiki/CMakeModularizationStatus refer to a non-existent http://github.com/boost-lib/boost URL, so they don't work either. I've looked at several other wiki pages, but they're also inconsistent or don't help. Is there any accurate documentation for modular Boost? How does someone try modular boost?

2 1

[Filesystem] v3 path separator changes
by Alexander Lamaison 30 Mar '13

30 Mar '13

I'm finally getting round to moving to Filesystem v3 and now my code is breaking all over the place. The cause is the output of string() on Windows which has changed behaviour. I'm manipulating Unix paths for use over SFTP, but doing so on Windows. For instance I might want to append "c" to the Unix path "/a/b". path p("/a/b"); p /= "c"; cout << p.string(); In version 2 this would output "/a/b/c" but now it produces "/a/b\c". Why the breaking change? I'm trying to understand the rationale behind many of the v3 changes which [1] and [2] don't even begin to cover. [1] http://www.boost.org/doc/libs/1_53_0/libs/filesystem/doc/v3.html [2] http://www.boost.org/doc/libs/1_53_0/libs/filesystem/doc/deprecated.html Alex -- Swish - Easy SFTP for Windows Explorer (http://www.swish-sftp.org)

8 33

[switch generator] status
by Jeff Flinn 29 Mar '13

29 Mar '13

Does anyone know the current status of Steven's switch generator library, I see it was reviewed/accepted in 2008, but I don't see it in trunk or any release. Thanks, Jeff

2 1

[config] gcc implemented N3276 decltype
by Michel Morin 29 Mar '13

29 Mar '13

gcc 4.8.1 and 4.9.0 will support N3276 decltype. ( http://gcc.gnu.org/bugzilla/show_bug.cgi?id=52748 ) May I commit an attached patch? Regards, Michel

3 4

Helping With Boost?
by Thales 29 Mar '13

29 Mar '13

Hello! I'm a C++ programmer (Windows 7 platform, Visual Studio) and I'm interested in helping with this project. I've downloaded the latest from the repository and have built the Win32 libraries. Is there anything I can try my hand at to get started? :-) Thanks for any feedback, ...John

4 5

GSoC: Getting ready for the application
by Boris Schaeling 27 Mar '13

27 Mar '13

Can those who planned to add a proposal but didn't do yet update https://svn.boost.org/trac/boost/wiki/SoC2013 as soon as possible? And can those who added a proposal check it one last time? Andrew reminded me that Boost wasn't accepted last year because we had a superficial list of ideas without realistic goals and expectations. We should be able to increase our chances if we document actual requirements and possibly design approaches. According to Google they look extensively at every org's ideas page. So this is really important. Thanks, Boris

5 4

Serialise on Mac OSX 10.8, XCode and GCC
by Tim Burgess 27 Mar '13

27 Mar '13

Hi, I have an XCode c++ project that uses the static serialisation library (as well as FileSystem, IOStream and System). The project started out on XCode 3.6 on Mac OSX 10.6, where it successfully built and ran using Boost 1_49_0, built against Apple's 10.6 SDK. However, I needed to use the XCode debugger to track down some run-time issues and found I couldn't access the debugger on this version of XCode (I'm blind and have to use the VoiceOver utility to gain access to my Mac). Having taken advice, I upgraded to Mac OSX 10.8, SDK 10.8 and XCode 4.6, which solves my debugging issue. Unfortunately, my project no longer links correctly. The linker complains that it can't find symbols for my architecture (x86_64) - the messages are in the the form: "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_sta rt(char const*)", referenced from: "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_ove rride(boost::archive::version_type&, int)", referenced from: "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_ove rride(boost::archive::class_id_type&, int)", referenced from: (I've truncated the output here for brevity). I get no linker errors for any of the other Boost binaries - it's only the serialisation library that creates a problem. The project is configured to compile with the llvmgcc42 compiler, as it also uses the wxWidgets libraries, which don't support compilation using clang. Boost versions tried: 1_50_0, 1_52_0 and 1_53_0. Boost build options tried: 1 - Default (no options specified) - this worked on Mac OSX 10.6, Snow Leopard. 2 - As follows: macosx-version=10.3 macosx-version-min=10.6 architecture=combined threading=multi link=static address-model=32_64 3 - As follows: architecture=combined address-model=32_64 I'm a novice using Boost and the Mac, so would appreciate any suggestions as to how I can resolve this issue. Best wishes. Tim Burgess Raised Bar Ltd. Tel: +44 (0)1827 719822 Web: http://www.raisedbar.net We can supply Roland and Avid products with specialist pre and post-sales support for visually-impaired users - just drop us a line for a quote. Don't forget to sign our on-line petition to lobby for improved access to music education and music technology at: http://www.raisedbar.net/petition.htm

6 18

Re: [boost] [Boost-commit] svn:boost r83608 - trunk/status
by Steven Watanabe 27 Mar '13

27 Mar '13

AMDG On 03/27/2013 12:13 PM, chhenning(a)gmail.com wrote: > > Modified: trunk/status/Jamfile.v2 > ============================================================================== > --- trunk/status/Jamfile.v2 (original) > +++ trunk/status/Jamfile.v2 2013-03-27 15:13:44 EDT (Wed, 27 Mar 2013) > @@ -86,6 +86,7 @@ > fusion/test # test-suite fusion > geometry/test # test-suite geometry > gil/test # test-suite gil > + gil/io/test # test-suite gil::io This just broke the regression tests: ERROR: rule "jpeg.init" unknown in module "toolset". /run/media/steven/regression/tools_bb/build/project.jam:995: in using ../libs/gil/io/test/Jamfile.v2:12: in modules.load In Christ, Steven Watanabe

2 1

Adding gil extensions to boost_release
by Christian Henning 27 Mar '13

27 Mar '13

Hi all, quick question: Is the release branch open? Thanks, Christian

4 8

[gil] YCbCr color space added
by Christian Henning 27 Mar '13

27 Mar '13

Hi all, there has been some interest in adding the ycbcr color space to gil. For that I just added the color space with color conversions and a new image type for subsampled images. Thanks for Juan Puertos for the color conversion routines! I believe, so far, the ycbcr is very rudimentary and there is a lot of more work to do but it's a beginning. Please let me know what you think. Sources: http://svn.boost.org/svn/boost/trunk/boost/gil/extension/toolbox/color_spac… http://svn.boost.org/svn/boost/trunk/boost/gil/extension/toolbox/image_type… Regards, Christian

1 0

Re: [boost] [multi-array] compiler errors with visual studio 2012 (nfarnsworth@web.de)
by Dan Searles 27 Mar '13

27 Mar '13

>Date: Sat, 23 Mar 2013 14:12:24 +0100 (CET) >From: nfarnsworth(a)web.de >To: boost(a)lists.boost.org >Subject: [boost] [multi-array] compiler errors with visual studio 2012 >Message-ID: > <trinity-07de36eb-bb16-4dc9-b97b-68516d068e24-1364044344811@3capp-webde-bs37> > >Content-Type: text/plain; charset="UTF-8" > > > Hello, > have this c++ example which compiles with Visual Studio 2010 but with Visual > Studio 2012 I got this compiler errors: > 1>------ Build started: Project: MultiArrayDemo, Configuration: Debug Win32 > ------ > 1> MultiArrayDemo.cpp > 1>d:\sandbox\multiarraydemo\multiarraydemo\multiarraydemo.cpp(11):error > C2059: syntax error : '<' > 1> d:\sandbox\multiarraydemo\multiarraydemo\multiarraydemo.cpp(25) > : see reference to class template instantiation 'Data<T>' being compiled > 1>d:\sandbox\multiarraydemo\multiarraydemo\multiarraydemo.cpp(11):error > C2238: unexpected token(s) preceding ';' > ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== > The example uses the boost 1.53 version. Here is the example code: > #include "stdafx.h" > #include <boost/multi_array.hpp> > const int rows = 3; > const int cols = 5; > template<class T> struct Data > { > typedef boost::multi_array<T,2> data_type; > typedef typename data_type::array_view<1>::type view_type; //here is the > first error > typedef typename data_type::index_range range; > Data() > :A(boost::extents[rows][cols]) > { > double tmp[] = > {1.0,2.0,3.0,4.0,5.0,6.0,7.0,8.0,9.0,10.0,11.0,12.0,13.0,14.0,15.0}; > A.assign(tmp,tmp+ (rows * cols)); > } > data_type A; > }; > int _tmain(int argc, _TCHAR* argv[]) > { > > Data<double>* data = new Data<double>(); > Data<double>::view_type myView = > data->A[boost::indices[0][Data<double>::range()]]; > delete data; > return 0; > } > Does anybody know how to solve this problem? > Best regards and thank you in advance > Niklas According to Microsoft, the code is non-conformant. Visual Studio 2010 allowed the code to be compiled, but 2012 tightened the requirement. See: http://msdn.microsoft.com/en-us/library/bb531344.aspx (Second point, "Use the template keyword...", but note that they highlighted the wrong keyword). The simple fix is to add the keyword 'template': typedef typename data_type::template array_view<1>::type view_type; //here is the first error Dan Searles

1 0

[fusion] sequence io manipulators
by Jeff Flinn 27 Mar '13

27 Mar '13

When streaming unrelated fusion sets to unrelated ostringstreams from different threads, I get an invalid iterator error. This appears to be due to using a boost::fusion::detail::stream_data::attach's local static arena instance. static void attach(Stream& stream, T const& data) { static arena ar; // our arena ar.data.push_back(new T(data)); stream.pword(get_xalloc_index<Tag>()) = ar.data.back(); } I assume there are issues with using the unguarded stream_data::data std::vector<T*> from multiple threads. This implementation looks problematic in that the arena data does not get cleaned up until program exit as well. Jeff

5 7

[atomic] Could you merge to trunk?
by Vicente J. Botet Escriba 26 Mar '13

26 Mar '13

Hi, there are some modification on trunk that need to be merged to release branch because there are some incompatibilities. Could this be done soon? Thanks, Vicente

3 2

GSoC: Backup admin wanted
by Boris Schaeling 26 Mar '13

26 Mar '13

Anyone who wants to be the backup admin for the GSoC program (in case Boost is accepted)? Drop me a mail if you are interested. We need one for the application. :) Thanks, Boris

1 0

[persistent] BerkeleyDB, SQLite, more
by Stefan Strasser 26 Mar '13

26 Mar '13

Hello everyone, if this is the first time you're hearing about this library proposal, please start by reading the "Motivation" and "Approach" sections here: http://tinyurl.com/ct2vfp5 I've had some time to kill lately, so there are now working storage backends for BerkeleyDB and SQLite. Here's a simple example storing and modifying some objects in a BerkeleyDB: http://pastebin.com/yXJbTdz7 There is also a virtual interface that lets you decide which database to use at runtime, or dynamically link different DBMSs. You'll also be able to use multiple databases at once and have global transactions among them, if the DBMS supports two-phase commits. Are there any suggestions for other storage engines to support? If you are familiar with one you are also very welcome to contribute. The interface is very simple and no knowledge of library internals is needed. At this point storage engines to support should be: - transactional. There is code for a MVCC transaction layer from my own storage engine, but it's not generic enough yet to just put it on top of a non-transactional engine like google's LevelDB. - good at handling BLOBs to store serialized objects. Object/Relational mapping is a whole other project. - preferrably have a very free license. The BerkeleyDB code is seperated from the rest so I don't think there are problems with the GPL-like license "infecting" the entire library if you don't use it. But if you do, it's GPL or commercial. I've looked at Tokyo Cabinet in some detail, but it seems more like a collection of functions to me, that one could use to build a DB with, than a robust product. I would like to be proven wrong on this, as it's often compared to BerkeleyDB and is LGPL-licensed. Suggestions for other embedded databases that could be supported are also welcome. Best regards, Stefan

1 0

New regression test reporting system
by Steven Watanabe 26 Mar '13

26 Mar '13

AMDG I just replaced the XSL scripts used to generate the regression test reports with a C++ implementation. If you encounter any broken links, bad markup, etc., please let me know. I rushed this a bit because xsltproc was misbehaving, and the old reports were coming out empty, so I haven't checked the output as thoroughly as I would have liked, yet. It should become more stable in the next day or two. In Christ, Steven Watanabe

2 2

[gil] Pixel Hasher
by Harg Tholan 26 Mar '13

26 Mar '13

Hey, I've been looking for a hashing function for PixelBased types... with no succes, so I created one. Does this have any value for users? Regards,

2 5

[gil] numeric extensions pixel division.
by Harg Tholan 26 Mar '13

26 Mar '13

Hey, It seems that in the numeric extensions it is implemented the division of channels, but not the division of pixels. Are you planning to include it at some point? thanks.

2 4

Boost.Graph for GSoC 2013 - Yes/No/Maybe?
by Darius L. 25 Mar '13

25 Mar '13

Hi all, I'd like to gauge the interest in proposing a project in Boost.Graph for GSoC (and beyond). Would anyone be interested in additions to Boost.Graph? (to-do list here hasn't changed in a while: http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/challenge.html) If so, what exactly would you be interested in? Also, would anyone be open to mentoring for this project?

4 3

[boost-build] Android support
by Antony Polukhin 25 Mar '13

25 Mar '13

Greetings, There is a project at github, that has a series of patches for Android support. It contains android.jam and android.py files for bjam, and those files have Boost license https://github.com/MysticTreeGames/Boost-for-Android. Why don't we adopt those patches to boost trunk? This will help a lot of people, who use boost under Android. -- Best regards, Antony Polukhin

3 4

License of endian and limits in Boost detail
by Philip Bennefall 25 Mar '13

25 Mar '13

Hi all, For my project, I am trying to stick exclusively to the Boost Software license. I wanted to use boost/cstdint.hpp, which pulls in a lot of content (boost/config.hpp is the one that includes the most). Among the things it includes I see boost/detail/endian.hpp and boost/detail/limits.hpp. In both of these, I see: /* * Copyright (c) 1997 * Silicon Graphics Computer Systems, Inc. * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation. Silicon Graphics makes no * representations about the suitability of this software for any * purpose. It is provided "as is" without express or implied warranty. */ This looks to me like it enforces inclusion of the above text in object code distributions, which as far as I know is something that the Boost license requirements say must not be done. Looking at http://www.boost.org/users/license.html I see: Must not require that the license appear with executables or other binary uses of the library. Is there a Boost license alternative? Kind regards, Philip Bennefall

3 2

Boost compatibility with Interix
by Andrin K. Foster 25 Mar '13

25 Mar '13

Hello all, When including the boost libraries on a Windows XP SP3 machine via Interix v3.5 using gcc 3.4.6 I would receive a number of pre-compiler errors complaining that boost threads were "unavailable on this platform". I resolved this issue by prepending the following code to the first inclusion of a boost library: #ifdef ARCH_Interix // an internal definition # include <boost/config.hpp> # define BOOST_HAS_THREADS # define BOOST_HAS_PTHREADS #endif There must be a more eloquent way of setting the thread definitions for Interix from within files such as /boost/thread/detail/platform.hpp or boost/thread/detail/config.hpp but I'll leave that to the development teams prerogative. In any case, making the boost libraries comparable with Interix should not be overly complex. Please let me know if I can provide more information. Thanks, AKF

3 2

[system][filesystem] Could I merge ticket 7278 to release branch?
by Vicente J. Botet Escriba 24 Mar '13

24 Mar '13

Le 24/03/13 10:52, Boost C++ Libraries a écrit : > #7278: Add noexcept to conform with C++11 > -------------------------------+-------------------------------------------- > Reporter: viboes | Owner: bemandawes > Type: Feature Requests | Status: closed > Milestone: Boost 1.54.0 | Component: system > Version: Boost 1.51.0 | Severity: Problem > Resolution: fixed | Keywords: > -------------------------------+-------------------------------------------- > Changes (by viboes): > > * milestone: To Be Determined => Boost 1.54.0 > > > Comment: > > Could I merge this ticket to release branch? > > svn merge -c 81808 "^/trunk" > svn merge -c 83197 "^/trunk" > -- > Ticket URL:<https://svn.boost.org/trac/boost/ticket/7278#comment:8> P.S. Note that the ASIO part was already merged and adapted, so no change is needed. Best, Vicente

2 2

Contributing to Boost
by Sathyam Vellal 24 Mar '13

24 Mar '13

Hello. I'm Sathyam, an undergraduate student pursuing B.E. in Computer Science. I've always liked C++ and would really be a wonderful experience for me to contribute to this community! I'm very keen on addressing the challenges listed for the Boost Graph library, presented in Boost Graph Library challenges ( http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/challenge.html) I'd be glad if you could guide me on how to proceed contributing to this community. Thank you -- Sathyam M Vellal, Computer Science and Engineering, P.E.S. Institute of Technology, Bangalore, India

5 5

[multi-array] compiler errors with visual studio 2012
by nfarnsworth＠web.de 23 Mar '13

23 Mar '13

Hello, have this c++ example which compiles with Visual Studio 2010 but with Visual Studio 2012 I got this compiler errors: 1>------ Build started: Project: MultiArrayDemo, Configuration: Debug Win32 ------ 1> MultiArrayDemo.cpp 1>d:\sandbox\multiarraydemo\multiarraydemo\multiarraydemo.cpp(11):error C2059: syntax error : '<' 1> d:\sandbox\multiarraydemo\multiarraydemo\multiarraydemo.cpp(25) : see reference to class template instantiation 'Data<T>' being compiled 1>d:\sandbox\multiarraydemo\multiarraydemo\multiarraydemo.cpp(11):error C2238: unexpected token(s) preceding ';' ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== The example uses the boost 1.53 version. Here is the example code: #include "stdafx.h" #include <boost/multi_array.hpp> const int rows = 3; const int cols = 5; template<class T> struct Data { typedef boost::multi_array<T,2> data_type; typedef typename data_type::array_view<1>::type view_type; //here is the first error typedef typename data_type::index_range range; Data() :A(boost::extents[rows][cols]) { double tmp[] = {1.0,2.0,3.0,4.0,5.0,6.0,7.0,8.0,9.0,10.0,11.0,12.0,13.0,14.0,15.0}; A.assign(tmp,tmp+ (rows * cols)); } data_type A; }; int _tmain(int argc, _TCHAR* argv[]) { Data<double>* data = new Data<double>(); Data<double>::view_type myView = data->A[boost::indices[0][Data<double>::range()]]; delete data; return 0; } Does anybody know how to solve this problem? Best regards and thank you in advance Niklas

1 0

[gil] GIL_FORCEINLINE replaced with BOOST_FORCEINLINE?
by Mateusz Loskot 22 Mar '13

22 Mar '13

Hi, In boost/gil/gil_config.hpp, there is GIL_FORCEINLINE defined, but there is no easy way to undef/redefine it. Would it be a good idea to replace GIL_FORCEINLINE with BOOST_FORCEINLINE defined in boost/config/suffix.hpp? Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

4 6

GSOC 2013
by David Bellot 22 Mar '13

22 Mar '13

Only 2 projects have been proposed so far for GSOC 2013: wake up Boost ! https://svn.boost.org/trac/boost/wiki/SoC2013 :-D

7 7

[thread] boost::async and launch::deferred - Runtime Error + PATCH
by Fernando Pelliccioni 22 Mar '13

22 Mar '13

Hi Vicente, hi all, The following code snippet throws an exception at runtime boost::future<int> f1 = boost::async( boost::launch::deferred, []() { return 123; }); int x= f1.get(); //exception thrown I am using Boost Trunk revision 83512 I attached a patch, but I'm not sure that's correct, I had no time to see the full future.hpp code I noticed that according to N3558, the future::is_ready() function should be called "ready". http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2013/n3558.pdf What do you think? Thanks and regards, Fernando.

2 2

Abstract STL Container Adaptors
by Andy Jost 21 Mar '13

21 Mar '13

Hi Boosters, Is there any interest in an abstract container adaptor library (I'll describe what I mean below)? I'm a little surprised if this has never come up in the context of Boost, but I couldn't find anything on the archives. I did find something on stack overflow (http://stackoverflow.com/questions/5329555/abstract-wrapper-for-stl-contain…) but it did not uncover an existing solution. Motivation: Sometimes we want to write functions that take a container as an argument. For instance, say I have a graph object implemented in terms of ``class Node``. I may expose an algorithm like this: void my_algorithm(Node & root, std::set<Node const *> const & marked); In this case, ``root`` is the root of a graph, and ``marked`` is a set of marked nodes. The problem with this approach is that it forces a particular choice of the set implementation onto the caller. He may, for example, prefer to use ``tr1::unordered_set``. We could get around that limitation by using a template parameter, like this: template<typename Set> void my_algorithm(Node & root, Set const & marked); The problem here is that it forces the implementer of ``my_algorithm`` to expose that code and, potentially, recompile it many times (for different Set types). In some cases, particularly when compile times are more critical than execution times, it would be preferable to let the caller choose the set implementation without losing the advantages of separate compilation. A simple solution is to write an adaptor that mimics the interface of ``set``. With that, the function call would appear as shown here: void my_algorithm(Node & root, abstract_set<Node const *> const & marked); Here, abstract_set<Node const *> is implicitly convertible from any type having the interface of std::set<Node const *>. It internally holds a reference to some implementation of a suitable set-like object and mediates interactions with the outside world through virtual methods. It seems the implementation of this would be a straightforward application of type erasure. It seems too easy, in fact, which makes me wonder whether I'm missing something. In any case, is this a good idea? -Andy

15 34

[config] consexpr workaround
by vicente.botet 21 Mar '13

21 Mar '13

Hi, in order to make easier the introduction of constexpr in a portable way I would like we add a Boost Config workarround. We can define some macros depending on whether BOOST_NO_CONSTEXPR is defined or not. #if defined(BOOST_NO_CONSTEXPR) #define BOOST_CONSTEXPR #define BOOST_CONSTEXPR_OR_CONST const #else #define BOOST_CONSTEXPR constexpr #define BOOST_CONSTEXPR_OR_CONST constexpr #endif For most of the constexpr functions or constructors BOOST_CONSTEXPR will work. constexpr tuple(); =versus= BOOST_CONSTEXPR tuple(); When used for static constants BOOST_CONSTEXPR_OR_CONST is needed as we need to preserv the const keyword when consexpr is not available. static constexpr UIntType xor_mask = a; =versus= static BOOST_CONSTEXPR_OR_CONST UIntType xor_mask = a; We could also add a STATIC_CONSTEXPR macro #define BOOST_STATIC_CONSTEXPR static BOOST_CONSTEXPR_OR_CONST static constexpr UIntType xor_mask = a; =versus= BOOST_STATIC_CONSTEXPR UIntType xor_mask = a; For this case the existing macro BOOST_STATIC_CONSTANT could be modified to use BOOST_CONSTEXPR_OR_CONST when static const was used. static constexpr UIntType xor_mask = a; =versus= BOOST_STATIC_CONSTANT(UIntType, xor_mask = a); Can we introduce this workaround? Best regards, Vicente _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

6 17

[container][intrusive] Treap for Boost.Container?
by Phil Endecott 20 Mar '13

20 Mar '13

Dear All, I have been playing with boost::intrusive::treap, and it seems like a useful thing. I think it would be helpful to create a boost::container::treap, i.e. a non-intrusive treap container, implemented using the intrusive version. That could make this useful data structure available to users who wouldn't otherwise need to learn how to use Boost.Intrusive. (While I'm here.... does anyone know about a list-like container that has lower memory overhead when the data type is small, i.e. ints or chars? I was considering something using chunks like a std::list< std::vector<T> >, but insertion would invalidate other iterators in the same chunk, which is unacceptable. Any ideas?) Regards, Phil.

4 3

[units] c++11 features to speed up compilation times
by Oliver Esser 20 Mar '13

20 Mar '13

Hi, I was wondering if there was a policy for boost including C++11 features into the libraries. Obviously there might be many projects out there that do not (yet) have access to a compiler implementing the new standard or choosing not to use such a compiler. Anyways I was looking for a dimensional analysis library for compile time units checking and found Boost.Units to be quite slow at compile time even for the relatively small example code in the quickstart documentation. So I've written a bit of code that follows the approach of Boost.Units but uses C++11 features (constexpr, variadic templates, suffix operator, auto). It is not a complete library that I would use in a production environment, but it looks promising, since compilation times are about a factor 2-3 faster on my machine. It would be great if some of you could take a look. https://github.com/legento/units Maybe one could add an implementation like that to Boost.Units as a C++11 compiler detected feature to speed things up. Maybe I am totally wrong and it is some coincidence that this compiles faster on my platform. I did just minimalistic 'ok it seems to work' testing and was about as thorough with measurements. So see this as an implementation sketch. Regards Oliver

3 2

C++Now 2013 is full [ 53 days before the conference ]
by Marshall Clow 19 Mar '13

19 Mar '13

Whoa. In the immortal words of W.C. Fields, "I expected this, but not so soon" We've set up a wait list in case we get any cancellations. -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

1 0

Re: [boost] [range][iterator] contiguous iterators
by Stefan Strasser 19 Mar '13

19 Mar '13

From [boost-users]: Am 18.03.2013 16:06, schrieb Jeffrey Lee Hellrung, Jr.: > On Sat, Mar 16, 2013 at 7:42 AM, Stefan Strasser <strasser(a)uni-bremen.de > is there any way to generically determine at compiletime whether an > iterator or a boost range refers to contiguous memory? > > is_contiguous<T *>::value == true > is_contiguous<vector<T>::iterator>::value == true > is_contiguous<std::list<T>::iterator>::value == false > AFAIK, not presently, but this has been discussed quite a bit in several > past threads on the Boost developers list. Then I'd like to suggest this again to the maintainers of Boost.Iterator and Boost.Range. I'd also like to suggest another addition to Boost.Range: a RangeOutputIterator, i.e. an OutputIterator that doesn't only accept single values, but assignment of ranges: template<class RangeOutputIterator> ... (...RangeOutputIterator out){ *out=range; where range can be any Boost.Range. You can find an implementation of this concept here, in the form of an back insert iterator that can insert entire ranges into a vector: http://pastebin.com/9M5rPDh9 Using these two things together can make generic algorithms as efficient as is possible, e.g. if the container that is being written to is a vector and the value type is a POD, there's one call to std::memcpy. think e.g. about file or database operations like database.get(1024*1024,out); This is in my "namespace detail" right now and I'd be willing to help make it public and document it. Stefan

2 8

Idea for O(1) hash-table
by Rani Sharoni 19 Mar '13

19 Mar '13

Hi All, I hope that you will find the following idea interesting. I have been using hash-table with, AFAICT, unique implementation and I thought that it might be handy for boost. The hash table is O(1) *non-amortized* lookup via extremely balanced buckets (for example, max 6 entries per bucket). The implementation itself is absurdly simple ;-) The hash-table is basically variation of linear addressing using double-hashing hash-table with special re-insert strategy. Algorithm for linear addressing (easy to adjust for chained hashing): Consider a two dimensional N*K array – N buckets with up to K elements per bucket. Assume that the zero-key is marking an empty entry. Lookup(key): for (hash = key, I = 0 ; I < K ;++i) { hash = HASH(hash); // double-hashing if (A[hash % N][i] == key) return found; } return not-found; Insert(key): for (hash = key, I = 0 ; I < K ;++i) { hash = HASH(hash); // double-hashing if (A[hash % N][i] == 0) { A[hash % N][i] = key; return true; } } return false; The above insert is basically a bounded double-hashing and as-is it has a low utilization (a bit similar to bloom filter). For example, for 100K buckets and K=6 - insert will fail when the table has less than 50% utilization (i.e. fail to insert though most entries are empty). The trick is to perform “re-insert”: Pick some random element, key1, from failed insert phase, replace it with the new key, and (re) Insert(key1). Retrying up to, say, 12 rounds of re-insert improves the utilization, of N=100K/K=6, to ~97%! Table resize is done (if needed) when such repetitive re-insert fails. Altogether this implementation trade-off insert for fast lookup which is very appealing to caches (i.e. insert done in the expensive path - only after a cache miss). Just for comparison, hash-table using naïve liner probing (A[HASH(key)%N][i]) has only ~80% utilization even when using K=128 (i.e. deep buckets)! Such unbalanced behavior is also typical classical hash-tables with link-lists (chained-hashing) since statistically some buckets will outgrow the average. The performance of the classic double-hashing algorithm itself is quite poor when the table is highly utilize since many steps are required to find empty entries. Though this hash-table is general purposed it has some interesting properties: 1) O(1) non-amortized with very low chance for collisions (each key has its own unique “virtual” bucket). 2) Can be implemented on continuous memory without pointers and with excellent utilization 3) Allow wait free implementation of caches (i.e. no lock or even interlocked needed). 4) Allow caches on shared memory – corruption safe/hazard algorithm (assuming at least 64 bit keys). 5) Allow persistent using direct memory to file mapping (i.e. disk representation is same as in-memory one). 6) Average 50% LRU eviction for caches (i.e. on average entry half from the oldest is evicted) BTW – there is little chance for patenting this algorithm since I already published similar idea in the public domain ;-) Thanks, Rani

4 4

[math] Support for libquadmath/ __float128
by Claas 19 Mar '13

19 Mar '13

I have experimented with the quadmath library included with gcc and the boost::math::constants library and encountered several problems. - typeid is seemingly not supported for __float128, which requires an overload of nameof<__float128> - the stream extraction operator has to be provided for __float128 for string conversion to work - a specialisation of numeric_limits has to be provided. Is there an interest in incorporating __float128 into boost ? If so, would it be a good idea to specialise constants for __float128 as well, apart from float, double and long double? Regards Claas

6 19

Libaries accepted by not in Boost release yet - suitable for GSoC?
by Paul A. Bristow 19 Mar '13

19 Mar '13

I note there are some libraries that have been accepted but are not yet in a Boost release - and development seems to be stalled. This seems unfortunate - much effect from many people has gone into the whole process but we are not quite there yet - so a lot of work may be wasted? No doubt authors have other more pressing priorities J I spotted "Constrained value" and "endian" for example. Are any accepted but unfinished libraries suitable for Google Summer of Code students - with the task being to knock them into final shape? Is anyone willing to mentor these? Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

5 5

[local_function] End scope function name declaration makes code hard to read.
by Mostafa 18 Mar '13

18 Mar '13

(This is a feature request/inquiry.) I'm just now seriously starting to use local_function, and I'm finding that having to "visually parse" until the end of scope to determine the local function name makes the code much harder to read. Is it possible to declare the function name at the beginning of the scope? (I don't mind having to also register the function name at the end of the scope.) Something like: BLF2(add, (int), (int lhs, int rhs)) { return lhs + rhs; } BLF2_REGISTER(add); Having said, I don't see why needing an "ending macro" for the local function scope is a requirement (albeit my understanding of the library internals is limited to implementation annex of the documentation). Can't the start macro just expand to something like: //----------------------------- //Macro Generated Output Start. //----------------------------- //Local class definition. //Local class instance registration. //Out of class method definition starts here: inline void local_add::body(int& sum, const int& factor, const int& num) //----------------------------- //Macro Generated Output End. //----------------------------- //User generated content starts here: { return lhs + rhs; } Thanks, Mostafa

4 8

[docs] How to install boost documentation?
by Mostafa 18 Mar '13

18 Mar '13

I'm having a real hard time trying to figure out how to install boost documentation. Can't find any instructions on boost.org nor any on google. Am I missing something really obvious?

2 3

[gil] Pixel arithmetic operations.
by Harg Tholan 18 Mar '13

18 Mar '13

Hi, Has it ever been considered to overload arithmetic operators for "pixel"? In many situations it may be useful to add, sub or divide the value of two or more pixels. Thanks.

2 1

[gil] What is the status of the Gil extension numeric?
by Krzysztof Czainski 18 Mar '13

18 Mar '13

Hello, During my first steps wit Boost.Gil I bumped onto an example [1], that uses the numeric extension. For this extension, the the example [1] and a ling from Boost.Gil docs [4] point to [2], where I couldn't find any Gil extensions to download. Most Google links pointed to the same page, but I finally found [3]. So my questions are: a) Is there a plan to add the extension numeric to Boost? b) Is [3] the newest version? And could the Boost.Gil docs be updated to point to the right place? c) I corrected a few bugs in boost/gil/extension/numeric/sampler.hpp -- is this list the right place to discuss modifications to the numeric extension? Regards, Kris [1] http://www.boost.org/doc/libs/1_53_0/libs/gil/example/resize.cpp [2] http://opensource.adobe.com/gil [3] http://code.google.com/p/gil-contributions/ [4] http://www.boost.org/doc/libs/1_53_0/libs/gil/doc/index.html

1 0

[test] Any dependency on Boost.Test requires C++11 ?
by John Maddock 18 Mar '13

18 Mar '13

At present any test in Boost.Math that depends on Boost.Test fails for GCC prior to 4.5 because the build script for Boost.Test has: <toolset>gcc:<cxxflags>-std=gnu++0x Is this really required? It looks wrong headed to me: * We already have testers that test both C++03 and C++11 modes - so we don't need this to test C++11 support. * It's presence makes testing gcc in C++03 mode impossible if the library uses Boost.Test - so there may be C++03 breakages that we don't know about because of this. * As mentioned above, this is a hard error for GCC prior to 4.5, so those compilers can't be tested either. Can this be safely removed? Many thanks, John.

4 4

[boost.thread] Documentation code error
by Philip Bennefall 16 Mar '13

16 Mar '13

Hello, In the chapter about synchronization in the boost.thread documentation, where the hello world example with the bank account is being shown, I see a small problem in the class: int GetBalance() { mtx_.lock(); int b = balance_; mtx_.unlock(); return balance_; } I believe it should be: int GetBalance() { mtx_.lock(); int b = balance_; mtx_.unlock(); return b; } Kind regards, Philip Bennefall

1 0

Help in setupping regression tests on ARM
by Antony Polukhin 16 Mar '13

16 Mar '13

I've successfully run nests on x86, but on ARM I've got the following message: # Running Boost.Build tests Traceback (most recent call last): File "run.py", line 60, in <module> runner(root) File "/home/pi/boost_maintain/run_trunk/tools_regression_src/regression.py", line 205, in __init__ self.main() File "/home/pi/boost_maintain/run_trunk/tools_regression_src/regression.py", line 566, in main getattr(self,action_m)() File "/home/pi/boost_maintain/run_trunk/tools_regression_src/regression.py", line 531, in command_regression self.command_test() File "/home/pi/boost_maintain/run_trunk/tools_regression_src/regression.py", line 329, in command_test self.command_test_boost_build() File "/home/pi/boost_maintain/run_trunk/tools_regression_src/regression.py", line 369, in command_test_boost_build "boost/bin.v2/libs/any/test/any_test.test")); OSError: [Errno 2] No such file or directory: '/home/pi/boost_maintain/run_trunk/results/boost/bin.v2/libs/any/test/any_test.test' I try to run tests on RaspberryPi, it is armhf. Compilller is GCC-4.6.3, 25Gb of free space on SD card. It looks strange, that I see only a few folders in /home/pi/boost_maintain/run_trunk/results/boost/bin.v2/libs/ (there are only 6 folders) -- Best regards, Antony Polukhin

2 7

[detail][lightweight_test.hpp] Proposal to add BOOST_TEST_THROWS to boost/detail/lightweight_test.hpp
by Ion Gaztañaga 16 Mar '13

16 Mar '13

Hi, In my tests I use boost/detail/lightweight_test.hpp as it has nearly all I need to test my libraries with very little overhead. However I needed a simple utility to check if an expression throws an exception and I think it can be added to this header with very little code. See attached patch. Do you find this a good idea? Ok to commit? Best, Ion

4 8

comparing-the-c-standard-and-boost
by Neal Becker 15 Mar '13

15 Mar '13

http://slashdot.org/topic/bi/comparing-the-c-standard-and-boost/

1 0

[type_traits] Some traits are missing
by Antony Polukhin 15 Mar '13

15 Mar '13

Hi all, Equivalents of following traits are in C++11 Standard, but missing in Boost.TypeTraits library: has_nothrow_move_assign has_nothrow_move_constructor has_trivial_move_assign has_trivial_move_constructor Extremely naive implementation of those functions exist in Boost.Variant, so as a start we can use them. Or am I missing something and there is a reason, why those traits are not included in Boost.TypeTraits? -- Best regards, Antony Polukhin

3 6

Re: [boost] "Re: boost_svn_expor"
by DongInn Kim 15 Mar '13

15 Mar '13

Hi Rene, I am sorry for answering late. I did not know that I disabled receiving the boost mails. > It runs as part of the testing process if a tester has configured things to > not use the svn client directly. Disabling it causes some testers to stop > working. I don't know what the problem is with the cpu usage though as it > should be a rarely executed program as there are a small number of testers > and this would run only a small number of times in a day. > > On Wed, Mar 13, 2013 at 3:37 PM, DongInn Kim <dikim_at_[hidden]> wrote: > > I disabled the script /home/grafik/ > > www.boost.org/boost_svn_export_archive.sh for now. I have no idea what > > invokes the script but it seems that I could not find any troubles with the > > disabled script. > > > > Please let me know if you find anything wrong with the boost web services > > including the svn service. > > > > Regards, > > > > -- > > - DongInn > > > Can you tell me exactly what your test program does? It clearly invoked 4 or 5 apache processes which used almost all the resources. Does it create the 4 ~ 5 apache processes whenever you run the test program? Did you or your cronjob run it at that time? How could it run? Regards, -- - DongInn

2 1

Review Wizard Status Report for March 2013
by Ronald Garcia 14 Mar '13

14 Mar '13

============================================== Review Wizard Status Report for March 2013 ============================================== News ==== 1. Boost 1.52.0 Released. No New Libraries. 2. Boost 1.53.0 Released. New Libraries: Atomic, Coroutine, Lockfree, Multiprecision, Odeint. Open Issues =========== The following libraries have review managers, but have not yet been scheduled for review: * Range Extensions - added May 2012; review manager: Neil Groves. The following libraries have been reviewed and await reports from their review managers: * Predef - reviewed February 2012; review manager: Joel Falcou. The following libraries have been accepted to Boost, but have not yet been submitted to SVN: * Constrained Value - accepted September 2010; author: Robert Kawulak. * GIL.IO - accepted January 2011; author: Christian Henning. * Contract - accepted September 2012; author: Lorenzo Caminiti. The following libraries have been accepted and submitted to SVN, but have not yet appeared in a release: * Type Traits Introspection - accepted August 2011; author: Edward Diener. * Type Erasure - accepted August 2012; author: Steven Watanabe The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Endian - accepted provisionally November 2011; author: Beman Dawes. * Log - accepted provisionally March 2010; author: Andrey Semashev. General Announcements ===================== As always, we need experienced review managers. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants, including library contributors, infrastructure contributors, and other mailing list participants with a substantial track record of constructive participation. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "rxg at cs dot cmu dot edu" and "phillips at pacific dot mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. If you are interested in reviewing a library but won't have time during the review period, you can always prepare your review ahead of time. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report, please email Ron or John. The review schedule is an unordered list of the libraries awaiting review. As such, any library on the schedule can be reviewed once the developer is ready, a review manager has been secured, and the manager, developer, and wizards agree on a date to schedule the review. Review Schedule =============== * Join (M) * Pimpl (M) * Sorting (M) * Quaternions, Vectors, Matrices (M) * Variadic Macro Data (M) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Metaparse (M) * Range Extensions * Nowide (M) * Array (M) * TypeIndex (M) * STL Extensions (M) * Countertree (M) * Process (M) ``(M)`` marks libraries that need review managers. -------------------- Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: https://github.com/boost-vault/Miscellaneous/blob/master/Pimpl.zip :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: https://github.com/boost-vault/Sorting :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 2X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 70% faster than std::sort. string_sort is roughly 2X as fast as std::sort. Quaternions, Vectors, Matrices ------------------------------ :Author: Emil Dotchevski :Review Manager: Needed :Download: http://www.revergestudios.com/boost-qvm/ :Description: QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size. The library also defines vector and matrix data types, however it allows users to introduce their own types by specializing the q_traits, v_traits and m_traits templates. Variadic Macro Data ------------------- :Author: Edward Diener :Review Manager: Needed :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/variadic_macro_data/>`__ :Description: This library adds support and functionality for variadic macros to Boost as well as integrating variadic macros with the Boost PP library without changing the latter library in any way. Block Pointer ------------- :Author: Phil Bouchard :Review Manager: Needed :Download: https://svn.boost.org/svn/boost/sandbox/block_ptr/ :Description: Deterministic memory manager of constant complexity capable of handling cyclic collections. Singularity ----------- :Author: Ben Robinson :Review Manager: Needed :Download: https://github.com/cppmaven/Singularity :Description: The Singularity Design Pattern allows you to restrict any class to a single instance. Unlike the infamous Singleton, Singularity gives you direct control over the lifetime of the object, does not require you to grant global access to the object, nor does it limit you to the default constructor for that object. Extended Complex Numbers ------------------------ :Author: Matthieu Schaller :Review Manager: Needed :Download: http://code.google.com/p/cpp-imaginary-numbers/ :Description: The library is an extension of the std::complex class addressing two issues: 1. The standard does not guaranty the behaviour of the complex class if instantiated with types other than float/double/long double. 2. Some calculation where pure imaginary numbers (i.e. multiples of sqrt(-1)) appear are unnecessarily slowed down due to the lack of support for these numbers. The code I submit contains two interleaved classes boost::complex and boost::imaginary which can be instantiated with any type T provided T overloads the usual arithmetic operators and some basic (real) mathematical functions depending on which complex function will be used. It is thus an extended version of Thorsten Ottosen's n1869 proposal (http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1869.html) Metaparse --------- :Author: Abel Sinkovics :Review Manager: Needed :Download: http://abel.web.elte.hu/metaparse/metaparse.zip :Description: Metaparse is a library for constructing parsers parsing at compile-time based on template metaprogramming. The parsers built with the library take boost::mpl::strings as input and can produce - types - objects (types with public static members) - callable C++ functions (types with public static method) - template metafunction classes as output (based on the input being parsed). On compilers supporting constexpr the library provides the following syntactic sugar for writing the input of the parsers: BOOST_STRING("this is a string") The library can be used for implementing DSLs in C++, including DSLs making C++ template metaprogramming easier (see examples). Range Extensions ---------------- :Author: Akira Takahashi :Review Manager: Neil Groves :Download: https://github.com/faithandbrave/OvenToBoost :Description: This project adds some features of the Oven Range Library to Boost.Range. Features: - Additional Range Adaptors (taken, taken_while, dropped, dropped_while, elements, elements_key, memoized, outdirected) - Extensions for using Lambda (regular function, regular operator) - Infinite Range (iteration function) - and additional range utilities. Nowide ------ :Author: Artyom Beilis :Review Manager: Needed :Download: http://cppcms.com/files/nowide/ :Description: This library makes cross platform Unicode aware programming easier. It provides an implementation of standard C and C++ library functions, such that their inputs are UTF-8 aware on Windows without requiring to use Wide API. Array ----- :Author: Brian Smith :Review Manager: Needed :Download: https://github.com/BrianJSmith/Array :Description: The array class is a C++11 compatible implementation of static multidimensional arrays. TypeIndex --------- :Author: Antony Polukhin :Review Manager: Needed :Download: https://github.com/apolukhin/type_index :Description: TypeIndex is an extended C++11 type_index library, that * works with disabled RTTI * can store const-volatile-reference info about types (if user requested it) * has all the functionality of std::type_index * has portable across compilers and platforms functionality for getting demangled type names * works across modules/shared libraries * does not require C++11 to work STL Extensions -------------- :Author: Vadim Stadnik :Review Manager: Needed :Download: https://github.com/vstadnik/stl_ext_adv_review :Description: The proposed library [stl_ext_adv] offers augmented array based B+ trees and STL containers that support the interfaces of the C++03 sequences and associative containers. The library offers a number of extensions and performance improvements that are not available in C++03 and C++11 standard containers. Countertree ----------- :Author: Francisco Jose Tapia :Review Manager: Needed :Download: https://dl.dropbox.com/u/8437476/works/countertree_code_doc.zip :Description: This library is an implementation of a binary red-black counter tree. This tree have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators. COUNTERTREE This kind of trees have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators. With unordered information we have a vector with the same speed inserting and deleting in any position (O(log N)). With ordered information, we have the classes set, multiset, map and multimap, with identical interface than the STL classes, with the plus of access to the elements by position, like in a vector. The iterators are random access , and you can subtract them. SUBALLOCATOR The suballocator is a layer between the allocator and the data structures, compatible with any allocator with the STL definition. The suballocator replace to the allocator in the allocation of equal size elements. It provides speed, return the unused memory and decrease the memory used by the program and improve the cache performance due to the data locality improvement ( 30% of improvement of speed respect the std::allocator with GCC 4.7) Process ------- :Author: Boris Schaeling :Download: http://www.highscore.de/boost/process0.5/process.zip :Description: Boost.Process is a library to manage system processes. It can be used to: * create child processes * setup streams for child processes * communicate with child processes through streams (synchronously or asynchronously) * wait for processes to exit (synchronously or asynchronously) * terminate processes Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

1 0

Re: [boost] [support.osuosl.org #20948] Transition of Boost's bug tracking system
by DongInn Kim 14 Mar '13

14 Mar '13

Hi Olaf, Thanks for the update. I have never heard about transitioning from SVN to Git on the boost server machine. I am wondering how the transition could happen without the sysadmin's access though. To the boost group people, do you have any specific plan for this transition? Regards, -- - DongInn On Mar 14, 2013, at 12:04 PM, Olaf van der Spek <ml(a)vdspek.org> wrote: > Hi, > > AFAIK Boost is currently transitioning to Git for version control. I > hit some roadblocks when trying the conversions of Trac to Chili or > Redmine and thought it'd be better to wait until the transition to Git > is complete. > Simplest thing to do might be to move Trac without conversion to the > new host if the old server gets too old. > > Olaf > > On Wed, Mar 13, 2013 at 3:38 PM, DongInn Kim via RT <support(a)osuosl.org> wrote: >> Hi, >> >> What is the status of the transition of Boost's bug tracking system? The current server is quite old and my boss and I need to decide what to do pretty soon. >> >> Regards, >> >> -- >> - DongInn >> >> On Dec 11, 2012, at 8:28 PM, Olaf van der Spek via RT <support(a)osuosl.org> wrote: >> >>> On Wed, Dec 12, 2012 at 1:36 AM, Daniel Takamori via RT >>> <support(a)osuosl.org> wrote: >>>> Added your public key to your user account on boost.osuosl.org It should work >>>> now. >>> >>> Thanks. Given that I don't have a password, how do I use sudo? >>> >>> $ sudo -s >>> >>> We trust you have received the usual lecture from the local System >>> Administrator. It usually boils down to these three things: >>> >>> #1) Respect the privacy of others. >>> #2) Think before you type. >>> #3) With great power comes great responsibility. >>> >>> [sudo] password for boostadmin: >>> >>> $ passwd >>> Changing password for user boostadmin. >>> Changing password for boostadmin. >>> (current) UNIX password: >>> passwd: Authentication token manipulation error >>> $ >>> >>> >>> >>> >>> >>> -- >>> Olaf >>> >> >> > > > > -- > Olaf

1 0

[gil] IMC4 Pixel format
by Harg Tholan 14 Mar '13

14 Mar '13

Hey, I've been trying to find a definition for the IMC4<http://www.fourcc.org/yuv.php#IMC4>pixel format for GIL with no success, not even anything similar (planar pixel formats in which some of the channels are sub-sampled). I've spent many hours already trying to figure out how could I create such pixel format, and I am totally lost... The question is how can I specify that a pixel format is planar, and planes have different sizes due to sub-sampling!....I guess I'll have to override some operator[] operator++, operator-- Or to make a specialization of some classes. But how and where? planar_pixel_iterator? channel_iterator? I need some aid! please! Thanks is advance. H4rg.

3 4

[graph] Archetype's redundant members (Re: [graph]Direct Edge Access)
by Takatoshi Kondo 14 Mar '13

14 Mar '13

Hi Jeremiah, Thanks for your advice. I studied about archetypes. If I understood the minimal archetype requirements based on concepts correctly, some graph archetypes seems to have redundant members. In addition, vertex_list_graph_archetype::degree_size_type should inherit from incidence_graph_archetype. So, I wrote a patch. After applying the patch, all Boost.Graph tests passed. Could you check the patch? -- Takatoshi Kondo On Thu, Mar 7, 2013 at 4:41 PM, Jeremiah Willcock <jewillco(a)osl.iu.edu> wrote: > On Thu, 7 Mar 2013, Takatoshi Kondo wrote: > >> Hi Jeremiah, >> >> Thank you for your reply. I'm relieved that I understand correctly. I >> come up with a related question. >> I think that general graph algorithm developers should test two >> different things. >> >> One is concepts. If function my_algo() required >> VertexAndEdgeListGraphConcept for the parameter g, it should be >> checked as follows: >> >> #include <boost/graph/graph_concepts.hpp> >> >> template <typename Graph> >> void my_algo(Graph g) { >> BOOST_CONCEPT_ASSERT(( boost::VertexAndEdgeListGraphConcept<Graph> )); >> >> boost::edge(0, 1, g); // accidental invalid use ... Line A >> } >> >> But this test cannot detect out of concepts functions usage as Line A >> if class Graph accidentally provide them. >> So, these problems should be detected the following test: >> >> void my_algo_test() { >> typedef /* Only satisfies VertexAndListGraphConcept*/ Graph; // ... >> Line B >> Graph g; >> my_algo(g); >> } >> >> How do I define the type that is only satisfied specific concepts? > > > Those are called "archetypes" in the terminology of the Boost Concept Check > Library > (http://www.boost.org/doc/libs/1_53_0/libs/concept_check/concept_check.htm) > There is a set of them for Boost.Graph concepts in > <boost/graph/graph_archetypes.hpp>. They do not appear to have > documentation, but example uses include most files with the name pattern > *_cc.cpp in libs/graph/test (e.g., bfs_cc.cpp). > > > -- Jeremiah Willcock > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost

1 1

boost_svn_expor
by DongInn Kim 13 Mar '13

13 Mar '13

Hi, Can anyone tell me what boost_svn_expor does? I did not look up the program and who is running it yet but I thought someone in the boost group may already have answer for this. > [root@wowbagger dikim]# pstree 8271 > httpd─┬─59*[httpd] > └─httpd───boost_svn_expor─┬─boost_svn_expor─┬─boost_svn_expor───svn > │ ├─boost_svn_expor───boost_svn_expor > │ ├─bzip2 > │ ├─cut > │ ├─star───star > │ ├─tar───tar───bzip2 > │ └─tee > └─cat > [root@wowbagger dikim]# ps -ef | grep boost_svn > apache 23534 23510 0 15:40 ? 00:00:00 /bin/sh /home/grafik/www.boost.org/boost_svn_export_archive.sh trunk > apache 23543 23534 0 15:40 ? 00:00:00 /bin/sh /home/grafik/www.boost.org/boost_svn_export_archive.sh trunk > apache 23544 23543 0 15:40 ? 00:00:00 /bin/sh /home/grafik/www.boost.org/boost_svn_export_archive.sh trunk > apache 23552 23543 0 15:40 ? 00:00:00 /bin/sh /home/grafik/www.boost.org/boost_svn_export_archive.sh trunk > root 23809 23332 0 15:42 pts/1 00:00:00 grep boost_svn > [root@wowbagger dikim]# This program almost kills the boost server. Its loadaverage is > 30 now. :-( Regards, -- - DongInn

2 2

[spirit] hold_any invalid assignment to destructed object?
by Rob Desbois 13 Mar '13

13 Mar '13

Hi, The boost::spirit::hold_any implementation includes the following functions defined in the detail sub-namespace: // member of fxns<mpl::true_> specialisation, line 99 static void move(void* const* src, void** dest) { reinterpret_cast<T*>(dest)->~T(); *reinterpret_cast<T*>(dest) = *reinterpret_cast<T const*>(src); } // member of fxns<mpl::false_> specialisation, line 99 static void move(void* const* src, void** dest) { (*reinterpret_cast<T**>(dest))->~T(); **reinterpret_cast<T**>(dest) = **reinterpret_cast<T* const*>(src); } As I understand it, the object is destroyed _and then assigned to_; does it not need to be constructed at this point, i.e. have something like this (for the first specialisation): new (reinterpret_cast<T*>(dest)) T( *reinterpret_cast<T const*>(src) ); Thanks & apologies if I've misunderstood --rob <http://theotherbranch.wordpress.com/>

2 3

Meeting C++ 2013 - Call for Papers
by Jens Weller 12 Mar '13

12 Mar '13

Hello C++ & boost Community! Today, the 2nd Edition of the Meeting C++ conference has been announced! We will meet in Düsseldorf again at the 2nd November Weekend for two days full of C++! Call for Papers: http://www.meetingcpp.com/index.php/newsreader/items/call-for-papers-124.ht… Announcement with further Details on the conference: http://www.meetingcpp.com/index.php/newsreader/items/meeting-cpp-2013-annou… Talks about boost, C++11/14 are very welcome to the conference! kind regards, Jens Weller

1 0

[BGL] ticket 6780
by Fernando Vilas 12 Mar '13

12 Mar '13

Hi, I am still working on a few studies involving maximum adjacency search. How close is ticket 6780 to being accepted? The test cases for Stoer-Wagner now pass again on my computer. -- Thanks, Fernando Vilas fvilas(a)iname.com

1 0

[log] Release candidate 1
by Andrey Semashev 11 Mar '13

11 Mar '13

Hi, I've finished the docs update and released the RC1 of Boost.Log v2. The code can be downloaded here: http://sourceforge.net/projects/boost-log/files/boost-log-2.0-RC1-r847.zip/… The code can also be checked out from SVN: svn co https://boost-log.svn.sourceforge.net/svnroot/boost-log/trunk/boost-log The updated docs are available online: http://boost-log.sourceforge.net/libs/log/doc/html/index.html Aside from the docs updates there were a few changes I made as a part of the reviewing process (some were pointed out by users): - The add_attr manipulator was renamed to add_value. The new name better follows the terminology of the library. - The attribute value visitation API no longer forwards the result of the visitor. This feature is rarely needed but it slows down compilation significantly. To acquire the result one can use the new save_result function object wrapper. - Formatter and sink factories for settings parsers are now classes rather than simple function objects. This follows the pattern set by filter factories, which were classes before. - Fixed a few bugs and compilation problems. Sadly, there was almost no discussion of the library in this list. I received a few private emails on the library, mostly concerning some problems here and there and porting issues from v1. While valuable, this feedback can hardly replace a good review of the Boost community. I encourage everyone interested to take a look at the library, however deep you like, and provide your feedback. I don't plan to make any significant changes to the code, except maybe some include optimization and fixing the problems. If everything's fine, I'm going to post a request for permission to merge to trunk in a week or two.

6 25

Re: [boost] [log] Release candidate 1 usage question
by Alex Perry 11 Mar '13

11 Mar '13

Hi, I've been following with interest the development of this Log v2 code which looks very useful. However having read through the documentation I can't see any easy way of solving the following issue. I'm wondering if I'm just missing something obvious so thought I'd ask. I was hoping to replace some existing logging in an application which has been built on top of log4cpp - as far as I can see all the functionality of log4cpp we use is included (or some equivalent behaviour) in the boost log v2 and in a much more "natural looking" C++ idiom. However I can't see any easy way of solving the main problem we have with our current logging which is why I am looking to change it in the first place. The application is delivered as a group of related processes rather than as a single individual process - the logging is currently configured for this group and so messages need to be formatted with a source pid as well as a source tid - then grouped together and output to the appropriately configured streams (be it to a rolling file appender or syslog appender to use log4cpp names). Currently this is implemented by having one process taking the role of logging-server which is responsible for reading and managing the configuration for log4cpp, setting up the appropriate named loggers and appenders, then reading output from a shared memory circular buffer. The other logging-client processes then simply write their log output to this shared memory. Other than a bit of faffing around with timestamps to make sure that the timestamp recorded for a log message is the one when the message was written to the shared memory rather than when it was written to the log4cpp layer by the server, the server simply reads the shared memory and outputs the log messages to the current log4cpp configuration. The biggest issue with this setup is supporting the "filtering" required of log messages - obviously there is quite a large overhead in formatting a log message, locking the shared memory and writing to it. To avoid this overhead the server process writes the maximum severity of messages required for a "named log stream" to the shared memory - in the client processes this severity is checked before proceeding with the formatting of the log message. However unfortunately there is currently only support for a fixed number of these "named streams" - this actually means in practise (though wasn't the original design intention) that all logging output is written to one of 2 named log streams "trace" and/or "audit". Whilst this has worked well enough up to now enabling "trace" at "DEBUG" level can generate huge amounts of logging information which can be very time-consuming to parse when diagnosing a problem. I would like to go to a much more granular approach in the logging - so each component or sub-process, particularly for the general purpose "trace", "DEBUG" log messages, has its own name and may be switched on independently - preferably dynamically rather than by being loaded from some static configuration file. Having looked through the boost.log documentation I can't see anything that directly supports this type of multi-process logging. Whilst I'd be very happy to write a sink backend which writes to some shared memory in a similar manner to our current implementation and a custom log source to read from this and write in one "elevated" process , I'm not quite sure that this is the correct design. It appears to me that I really want to share the majority of the configuration of the logging "core" between the processes. Ie the configuration of filtering in particular needs to be shared between the processes. I see that support for loading the configuration of the core from a boost.ptree already exists. Would a good approach be to get the "server" process to write the configuration into a ptree which is then serialised and passed to the other processes by some mechanism (+some way of signalling that a change to logging configuration has occurred)? Or is there some way that the logging core could be maintained in boost interprocess containers or some such avoiding complex message passing between the processes (actually probably a bad idea - how do you avoid locking contention in the filtering check)? I can't imagine that I'm the only one ever to want this sort of "logger server/daemon" behaviour however what is other peoples experience with this sort of logging? Is it just simpler to let each process write to its own separate log for debug tracing? Whilst this will make for more searching when diagnosing issues (which process actually fulfilled the particular request I'm interested in) the simplicity will win out provided that more general "audit" messages are collated and in a single output to make finding which log output to search possible. Alex

2 1

[sandbox] [tree_node] Major update
by Cromwell Enage 11 Mar '13

11 Mar '13

Hello, fellow Boosters. In the hope that some of you here are still interested in easily extensible / augmented tree implementations, I've updated my Boost.TreeNode library in the sandbox. It provides adaptors for augmenting counts (a la countertree), heights, and even Boost.Accumulator values (which can solve the use cases mentioned in <http://je4d.blogspot.com/2013/01/boostintrusive-annotated-trees-part-1.html>), as well as concepts against which you can write your own adaptors. For a quick glance, documentation is at <http://svn.boost.org/svn/boost/sandbox/tree_node/libs/tree_node/doc/html/in…>. I'm still looking at the other two proposals. They have performance benchmarks which my library does not currently possess. However, at first glance I see no comparably straightforward way to augment user-defined data (e.g. Boost.Accumulator features) in either library. Feedback appreciated! Cromwell D. Enage

5 6

[test] spurious clang complier warnings
by Ian Emmons 10 Mar '13

10 Mar '13

When I compile my test code with clang on Macintosh (now Apple's default compiler), I get the two compiler warnings listed below. Could these be suppressed, please? I know this is a low priority item, but I expect it's pretty easy to fix. -Ian Emmons ============================== In file included from MyTest.cpp:6: In file included from ./MyTest.h:7: In file included from /Users/iemmons/dev/boost_1_53_0/boost/test/unit_test.hpp:19: In file included from /Users/iemmons/dev/boost_1_53_0/boost/test/test_tools.hpp:21: /Users/iemmons/dev/boost_1_53_0/boost/test/floating_point_comparison.hpp:251:25: warning: unused variable 'check_is_close' [-Wunused-variable] check_is_close_t const& check_is_close = unit_test::ut_detail::static_constant<check_is_close_t>::value; ^ /Users/iemmons/dev/boost_1_53_0/boost/test/floating_point_comparison.hpp:273:25: warning: unused variable 'check_is_small' [-Wunused-variable] check_is_small_t const& check_is_small = unit_test::ut_detail::static_constant<check_is_small_t>::value; ^ 2 warnings generated.

4 3

boost::interprocess::unique_ptr vs Boost.SmartPtr
by Adam Romanek 09 Mar '13

09 Mar '13

Hi! If I'm correct then the first "serious" implementation of unique_ptr for C++03 was written by Howard Hinnant, which was later adopted to Boost.Interprocess library. Unfortunately, I suppose not many people are aware of the fact that unique_ptr for C++03 is available in Boost. Even worse, I know people who are aware of it but who are afraid of using it just because it is provided by Boost.Interprocess, not by Boost.SmartPtr. Therefore, here's my proposal: - boost::interprocess::unique_ptr could be pulled into the top-level boost namespace - Boost.SmartPtr could provide a header file for unique_ptr that would pull the implementation from Boost.Interprocess; such a header file could also be placed in the top-level boost directory so that it could be accessed more easily - boost::unique_ptr could be documented in the documentation for Boost.SmartPtr library, providing use cases, emulation limitations etc. I believe that would make unique_ptr for C++03 available to wider audience. What do you think about this idea? With best regards, Adam Romanek

3 2

Context support for power architecture and mach-o ABI
by John Gleeson 09 Mar '13

09 Mar '13

I am interested in developing *ppc*_macho_gas.S implementations for the Boost.Context library. Has anyone already done some work on this combination? Any suggestions are welcome. I have prior experience in assembly programming and some understanding of processor scheduling concepts, but I have not done any work in these areas for a long time. I expect my re-learning curve to be steep. Thanks, John

1 0

[Serialization] Link issue on Mac OSX 10.8 (Mountain lion)
by Sean Farrow 08 Mar '13

08 Mar '13

Hi, I'm currently working with a client and we are facing an issue where by we can successfully build the boost libraries using the version of gcc that comes with xcode 4.6. However when we try to compile a project including serialization, the library and hence symbols cannot be found. We are using the latest mac os (mountain lion) and xcode 4.6. The strange thing is that this all worked under SnowLepard. If anyone can help this would be much appreciated. Moving to clang is not an option due to other dependencies. The entire log is as follows: Ld /Users/tim/Library/Developer/Xcode/DerivedData/SurfaceReader-fwryryuvfvwihnglkuymbbjtxpac/Build/Products/Debug/SurfaceReader.app/Contents/MacOS/SurfaceReader normal x86_64 cd /Users/tim/Developer/SurfaceReader setenv MACOSX_DEPLOYMENT_TARGET 10.8 /Applications/Xcode.app/Contents/Developer/usr/bin/llvm-g++-4.2 -arch x86_64 -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.8.sdk -L/Users/tim/Library/Developer/Xcode/DerivedData/SurfaceReader-fwryryuvfvwihnglkuymbbjtxpac/Build/Products/Debug -L/usr/local/lib -L/Users/tim/Developer/SurfaceReader/../Libraries/cryptopp561 -F/Users/tim/Library/Developer/Xcode/DerivedData/SurfaceReader-fwryryuvfvwihnglkuymbbjtxpac/Build/Products/Debug -filelist /Users/tim/Library/Developer/Xcode/DerivedData/SurfaceReader-fwryryuvfvwihnglkuymbbjtxpac/Build/Intermediates/SurfaceReader.build/Debug/SurfaceReader.build/Objects-normal/x86_64/SurfaceReader.LinkFileList -mmacosx-version-min=10.8 -L/Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib -framework IOKit -framework Carbon -framework Cocoa -framework AudioToolbox -framework System -framework OpenGL /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_osx_cocoau_xrc-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_osx_cocoau_webview-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_osx_cocoau_qa-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_baseu_net-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_osx_cocoau_html-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_osx_cocoau_adv-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_osx_cocoau_core-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_baseu_xml-2.9.a /Users/tim/developer/libraries/wxwidgets-2.9.4/build-debug/lib/libwx_baseu-2.9.a -framework WebKit -lexpat -lwxregexu-2.9 -lwxtiff-2.9 -lwxjpeg-2.9 -lwxpng-2.9 -lz -lpthread -liconv -stdlib=libc++ -fobjc-arc -fobjc-link-runtime -lboost_filesystem -lboost_iostreams -lboost_serialization -lboost_system -lcryptopp -framework CoreMIDI -framework CoreAudio -framework Cocoa -o /Users/tim/Library/Developer/Xcode/DerivedData/SurfaceReader-fwryryuvfvwihnglkuymbbjtxpac/Build/Products/Debug/SurfaceReader.app/Contents/MacOS/SurfaceReader Undefined symbols for architecture x86_64: "boost::filesystem::path_traits::convert(wchar_t const*, wchar_t const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> >&, std::codecvt<wchar_t, char, __mbstate_t> const&)", referenced from: void boost::filesystem::path_traits::dispatch<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >(std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> >&, std::codecvt<wchar_t, char, __mbstate_t> const&)in SurfaceFrame.o "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_start(char const*)", referenced from: void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >(boost::serialization::nvp<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >(boost::serialization::nvp<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::vector<long, std::allocator<long> > >(boost::serialization::nvp<std::vector<long, std::allocator<long> > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, MessageDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, MessageDefinition> > > >(boost::serialization::nvp<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, MessageDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, MessageDefinition> > > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, DisplayDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, DisplayDefinition> > > >(boost::serialization::nvp<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, DisplayDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, DisplayDefinition> > > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > > > > > >(boost::serialization::nvp<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > > > > > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >(boost::serialization::nvp<std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > const&, int)in SurfaceFrame.o ... "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override(boost::archive::version_type&, int)", referenced from: void boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::load_override<boost::archive::version_type>(boost::archive::version_type&, int)in SurfaceFrame.o "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override(boost::archive::class_id_type&, int)", referenced from: void boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::load_override<boost::archive::class_id_type>(boost::archive::class_id_type&, int)in SurfaceFrame.o "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override(boost::archive::tracking_type&, int)", referenced from: void boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::load_override<boost::archive::tracking_type>(boost::archive::tracking_type&, int)in SurfaceFrame.o "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override(boost::archive::object_id_type&, int)", referenced from: void boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::load_override<boost::archive::object_id_type>(boost::archive::object_id_type&, int)in SurfaceFrame.o "boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_end(char const*)", referenced from: void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >(boost::serialization::nvp<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >(boost::serialization::nvp<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::vector<long, std::allocator<long> > >(boost::serialization::nvp<std::vector<long, std::allocator<long> > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, MessageDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, MessageDefinition> > > >(boost::serialization::nvp<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, MessageDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, MessageDefinition> > > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, DisplayDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, DisplayDefinition> > > >(boost::serialization::nvp<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, DisplayDefinition, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, DisplayDefinition> > > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > > > > > >(boost::serialization::nvp<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::map<unsigned char, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::less<unsigned char>, std::allocator<std::pair<unsigned char const, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > > > > > > > const&, int)in SurfaceFrame.o void boost::archive::basic_xml_iarchive<boost::archive::xml_wiarchive>::load_override<std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >(boost::serialization::nvp<std::pair<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > const&, int)in SurfaceFrame.o ... "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_start(char const*)", referenced from: void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<bool>(boost::serialization::nvp<bool> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<boost::serialization::collection_size_type>(boost::serialization::nvp<boost::serialization::collection_size_type> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<boost::serialization::item_version_type const>(boost::serialization::nvp<boost::serialization::item_version_type const> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<long const>(boost::serialization::nvp<long const> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<unsigned char const>(boost::serialization::nvp<unsigned char const> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<unsigned char>(boost::serialization::nvp<unsigned char> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >(boost::serialization::nvp<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > const&, int)in SurfaceFrame.o ... "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::end_preamble()", referenced from: void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, bool>(boost::archive::xml_woarchive&, bool const&)in SurfaceFrame.o void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, boost::serialization::collection_size_type>(boost::archive::xml_woarchive&, boost::serialization::collection_size_type const&)in SurfaceFrame.o void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, boost::serialization::item_version_type>(boost::archive::xml_woarchive&, boost::serialization::item_version_type const&)in SurfaceFrame.o void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, long>(boost::archive::xml_woarchive&, long const&)in SurfaceFrame.o void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, unsigned char>(boost::archive::xml_woarchive&, unsigned char const&)in SurfaceFrame.o void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >(boost::archive::xml_woarchive&, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > const&)in SurfaceFrame.o void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >(boost::archive::xml_woarchive&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)in SurfaceFrame.o ... "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::version_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::version_type const>(boost::archive::version_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::class_id_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::class_id_type const>(boost::archive::class_id_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::tracking_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::tracking_type const>(boost::archive::tracking_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::object_id_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::object_id_type const>(boost::archive::object_id_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::class_name_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::class_name_type const>(boost::archive::class_name_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::object_reference_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::object_reference_type const>(boost::archive::object_reference_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::class_id_optional_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::class_id_optional_type const>(boost::archive::class_id_optional_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override(boost::archive::class_id_reference_type const&, int)", referenced from: boost::archive::xml_woarchive& boost::archive::detail::interface_oarchive<boost::archive::xml_woarchive>::operator<< <boost::archive::class_id_reference_type const>(boost::archive::class_id_reference_type const&)in SurfaceFrame.o "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_end(char const*)", referenced from: void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<bool>(boost::serialization::nvp<bool> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<boost::serialization::collection_size_type>(boost::serialization::nvp<boost::serialization::collection_size_type> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<boost::serialization::item_version_type const>(boost::serialization::nvp<boost::serialization::item_version_type const> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<long const>(boost::serialization::nvp<long const> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<unsigned char const>(boost::serialization::nvp<unsigned char const> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<unsigned char>(boost::serialization::nvp<unsigned char> const&, int)in SurfaceFrame.o void boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::save_override<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >(boost::serialization::nvp<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > const&, int)in SurfaceFrame.o ... "boost::archive::basic_xml_oarchive<boost::archive::xml_woarchive>::~basic_xml_oarchive()", referenced from: boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::~xml_woarchive_impl()in SurfaceFrame.o boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::~xml_woarchive_impl()in SurfaceFrame.o boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::~xml_woarchive_impl()in SurfaceFrame.o "boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::load_override(boost::archive::class_name_type&, int)", referenced from: boost::archive::xml_wiarchive& boost::archive::detail::interface_iarchive<boost::archive::xml_wiarchive>::operator>><boost::archive::class_name_type>(boost::archive::class_name_type&)in SurfaceFrame.o "boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::load(std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >&)", referenced from: void boost::archive::load_access::load_primitive<boost::archive::xml_wiarchive, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >(boost::archive::xml_wiarchive&, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >&)in SurfaceFrame.o "boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::load(std::basic_string<char, std::char_traits<char>, std::allocator<char> >&)", referenced from: void boost::archive::load_access::load_primitive<boost::archive::xml_wiarchive, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >(boost::archive::xml_wiarchive&, std::basic_string<char, std::char_traits<char>, std::allocator<char> >&)in SurfaceFrame.o "boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::xml_wiarchive_impl(std::basic_istream<wchar_t, std::char_traits<wchar_t> >&, unsigned int)", referenced from: boost::archive::xml_wiarchive::xml_wiarchive(std::basic_istream<wchar_t, std::char_traits<wchar_t> >&, unsigned int)in SurfaceFrame.o "boost::archive::xml_wiarchive_impl<boost::archive::xml_wiarchive>::~xml_wiarchive_impl()", referenced from: boost::archive::xml_wiarchive::xml_wiarchive(std::basic_istream<wchar_t, std::char_traits<wchar_t> >&, unsigned int)in SurfaceFrame.o boost::archive::xml_wiarchive::~xml_wiarchive()in SurfaceFrame.o boost::archive::xml_wiarchive::~xml_wiarchive()in SurfaceFrame.o "boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::save(std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > const&)", referenced from: void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >(boost::archive::xml_woarchive&, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > const&)in SurfaceFrame.o "boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::save(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)", referenced from: void boost::archive::save_access::save_primitive<boost::archive::xml_woarchive, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >(boost::archive::xml_woarchive&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)in SurfaceFrame.o "boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::xml_woarchive_impl(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >&, unsigned int)", referenced from: boost::archive::xml_woarchive::xml_woarchive(std::basic_ostream<wchar_t, std::char_traits<wchar_t> >&, unsigned int)in SurfaceFrame.o "boost::archive::basic_text_oprimitive<std::basic_ostream<wchar_t, std::char_traits<wchar_t> > >::~basic_text_oprimitive()", referenced from: boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::~xml_woarchive_impl()in SurfaceFrame.o boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::~xml_woarchive_impl()in SurfaceFrame.o boost::archive::xml_woarchive_impl<boost::archive::xml_woarchive>::~xml_woarchive_impl()in SurfaceFrame.o ld: symbol(s) not found for architecture x86_64 collect2: ld returned 1 exit status Regards Sean.

1 0

[unordered_map] assert fail
by Steve Lorimer 08 Mar '13

08 Mar '13

I got an assert fail on a call to: return _map.insert(std::make_pair(newKey, value.second)); The assertion was in delete_buckets() BOOST_ASSERT(!this->size_); Here is a stack trace: #0 0x00007f3b7c645945 in raise () from /lib64/libc.so.6 #1 0x00007f3b7c646f21 in abort () from /lib64/libc.so.6 #2 0x00007f3b7c63e810 in __assert_fail () from /lib64/libc.so.6 #3 0x000000000075d59f in boost::unordered::detail::buckets<std::allocator<std::pair<char const* const, Spl::Market::Symbol*> >, boost::unordered::detail::ptr_bucket, boost::unordered::detail::ptr_node<std::pair<char const* const, Spl::Market::Symbol*> >, boost::unordered::detail::mix64_policy<unsigned long> >::delete_buckets (this=0x7f3b772ac0b0) at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/detail/buckets.hpp:834 #4 0x000000000075d125 in boost::unordered::detail::buckets<std::allocator<std::pair<char const* const, Spl::Market::Symbol*> >, boost::unordered::detail::ptr_bucket, boost::unordered::detail::ptr_node<std::pair<char const* const, Spl::Market::Symbol*> >, boost::unordered::detail::mix64_policy<unsigned long> >::~buckets (this=0x7f3b772ac0b0, __in_chrg=<optimized out>) at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/detail/buckets.hpp:805 #5 0x000000000075cebe in boost::unordered::detail::table_impl<boost::unordered::detail::map<std::allocator<std::pair<char const* const, Spl::Market::Symbol*> >, char const*, Spl::Market::Symbol*, Spl::String::Map<Spl::Market::Symbol*>::HashFunction, Spl::String::Map<Spl::Market::Symbol*>::Predicate> >::rehash_impl (this=0xfd1670, num_buckets=64) at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/detail/unique.hpp:746 #6 0x000000000075c915 in boost::unordered::detail::table<boost::unordered::detail::map<std::allocator<std::pair<char const* const, Spl::Market::Symbol*> >, char const*, Spl::Market::Symbol*, Spl::String::Map<Spl::Market::Symbol*>::HashFunction, Spl::String::Map<Spl::Market::Symbol*>::Predicate> >::reserve_for_insert (this=0xfd1670, size=33) at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/detail/table.hpp:413 #7 0x000000000075c48b in boost::unordered::detail::table_impl<boost::unordered::detail::map<std::allocator<std::pair<char const* const, Spl::Market::Symbol*> >, char const*, Spl::Market::Symbol*, Spl::String::Map<Spl::Market::Symbol*>::HashFunction, Spl::String::Map<Spl::Market::Symbol*>::Predicate> >::emplace_impl<std::pair<char const* const, Spl::Market::Symbol*> >(char const* const&, std::pair<char const* const, Spl::Market::Symbol*>&&) (this=0xfd1670, k=@0x7f3b772ac360: 0x10f0da40 "XJO.5025P13.AX") at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/detail/unique.hpp:464 #8 0x000000000075c0a1 in boost::unordered::detail::table_impl<boost::unordered::detail::map<std::allocator<std::pair<char const* const, Spl::Market::Symbol*> >, char const*, Spl::Market::Symbol*, Spl::String::Map<Spl::Market::Symbol*>::HashFunction, Spl::String::Map<Spl::Market::Symbol*>::Predicate> >::emplace<std::pair<char const* const, Spl::Market::Symbol*> >(std::pair<char const* const, Spl::Market::Symbol*>&&) (this=0xfd1670) at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/detail/unique.hpp:430 #9 0x000000000075bebf in boost::unordered::unordered_map<char const*, Spl::Market::Symbol*, Spl::String::Map<Spl::Market::Symbol*>::HashFunction, Spl::String::Map<Spl::Market::Symbol*>::Predicate, std::allocator<std::pair<char const* const, Spl::Market::Symbol*> > >::emplace<std::pair<char const* const, Spl::Market::Symbol*> >(std::pair<char const* const, Spl::Market::Symbol*>&&) (this=0xfd1670) at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/unordered_map.hpp:239 #10 0x000000000075bcf0 in boost::unordered::unordered_map<char const*, Spl::Market::Symbol*, Spl::String::Map<Spl::Market::Symbol*>::HashFunction, Spl::String::Map<Spl::Market::Symbol*>::Predicate, std::allocator<std::pair<char const* const, Spl::Market::Symbol*> > >::insert(std::pair<char const* const, Spl::Market::Symbol*>&&) (this=0xfd1670, x=...) at /hostname/trading/sdk/include/boost-1.51.0/boost/unordered/unordered_map.hpp:388

2 1

[compute] GPGPU Library - Request For Feedback
by Kyle Lutz 08 Mar '13

08 Mar '13

Hi everyone, A while back I posted a message asking for interest in a GPGPU computing library and the response seemed positive. I've been slowly working on it for the last few months and it has finally reached a usable state. I've made an initial release on GitHub (details below) and would like to get feedback from the community. The Boost Compute library provides a partial implementation of the C++ standard library for GPUs and multi-core CPUs. It includes common containers (vector<T>, flat_set<T>) and standard algorithms (transform, sort, accumulate). It also features a number of extensions including parallel-computing focused algorithms (exclusive_scan, scatter, reduce) along with a number of fancy iterators (transform_iterator, permutation_iterator). The library is built around the OpenCL framework which allows it to be portable across many types of devices (GPUs, CPUs, and accelerator cards) from many different vendors (NVIDIA, Intel, AMD). The source code and documentation are available from the links below. Code: https://github.com/kylelutz/compute Documentation: http://kylelutz.github.com/compute Bug Tracker: https://github.com/kylelutz/compute/issues I've tested the library with GCC 4.7 and Clang 3.3 on both NVIDIA GPUs and Intel CPUs. However, I would not yet consider the library production-ready. Most of my time has been devoted to reaching a solid and well-tested API rather than on performance. Over time this will improve. Feel free to send any questions, comments or feedback. Thanks, Kyle

7 13

[graph]Direct Edge Access
by Takatoshi Kondo 08 Mar '13

08 Mar '13

Hello, I'm using Boost.Graph version 1.53.0. I'm trying to write some graph algorithms and I want to minimize the requirements of the input graph. I have a question about Boost.Graph concepts. I wrote a very simple code as follows: typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS> G; int main() { G g; boost::add_edge(0, 1, g); auto res = boost::edge(0, 1, g); // Why can I call it? std::cout << std::boolalpha << res.second << std::endl; boost::graph_traits<G>::edge_descriptor e = res.first; std::cout << boost::source(e, g) << "," << boost::target(e, g) << std::endl; } It works, but I don't understand why I can call boost::edge(). According to the following document, AdjacencyMatrix concept provides Direct Edge Access functionality, so I can call edge(u,v,g) : http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/AdjacencyMatrix.html The class template adjacency_list is a model of VertexAndEdgeListGraph, MutablePropertyGraph, CopyConstructible, Assignable, and Serializable. http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/adjacency_list.html So, adjacency_list is not satisfied AdjacencyMatrix concept. I checked which function template is called, then I found the following function is called: boost/graph/detail/adjacency_list.hpp:1582 template <class Config, class Base> inline std::pair<typename Config::edge_descriptor, bool> edge(typename Config::vertex_descriptor u, typename Config::vertex_descriptor v, const adj_list_helper<Config, Base>& g_) { typedef typename Config::graph_type Graph; typedef typename Config::StoredEdge StoredEdge; const Graph& cg = static_cast<const Graph&>(g_); typedef typename Config::out_edge_iterator out_edge_iterator; const typename Config::OutEdgeList& el = cg.out_edge_list(u); typename Config::OutEdgeList::const_iterator it = graph_detail:: find(el, StoredEdge(v)); return std::make_pair( typename Config::edge_descriptor (u, v, (it == el.end() ? 0 : &(*it).get_property())), (it != el.end())); } Also, I found the following document: http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/using_adjacency_list.ht… This document describes that: edge() The time complexity for this operation is O(E/V) when the OutEdgeList type is a Sequence and it is O(log(E/V)) when the OutEdgeList type is an AssociativeContainer. It seems that edge() is a part of the public interface of adjacency_list. But I think that it is not a part of any graph concepts. If I want to write an algorithm that depends on several graph concepts, not actual classes such as adjancency_list, I can use edge(u,v,g) only if the input graph class satisfies AdjacencyMatrix concept. Am I understanding correctly? Thanks, Taka

2 3

[locale] Memory leaks?
by Jookia 07 Mar '13

07 Mar '13

Hello! I've been debugging my application that uses Boost.Locale for the past five hours or so, and I've found it curious that it leaks memory. In order to stop it, I have to do a couple of weird things, such as including ICU in to my projects and calling u_cleanup at the end of my application. I also have to disable certain facets. I've put all this together in some source code, that by default won't leak, but uncommenting various parts will cause it to leak: // ---- BEGIN CODE ---------------------------------------------------- #include <boost/locale.hpp> #include <unicode/uclean.h> #include <iostream> using namespace boost::locale; using namespace std; int main() { generator gen; gen.categories( convert_facet | //collation_facet | // Various errors. //formatting_facet | // Various errors. //parsing_facet | // Various errors. message_facet | //codepage_facet | // Various errors. boundary_facet | calendar_facet | information_facet); locale newLoc = gen("zh_CN.GB18030"); locale::global(newLoc); cout.imbue(newLoc); // ios_info::get doesn't clean up after itself. //cout << as::date << time(0) << endl; // Do this at the end of the program to clean up resources. locale::global(std::locale("C")); cout.imbue(std::locale("C")); u_cleanup(); } // ---- END CODE ------------------------------------------------------ Dumping this as 'hello.cpp' and running this is how I'm debugging it: g++ hello.cpp -lboost_locale -licuuc && valgrind --leak-check=full --show-reachable=yes ./a.out Thanks, Jookia.

1 0

[interprocess] leaked named mutexes
by Eric Niebler 07 Mar '13

07 Mar '13

I recently discovered that a process can very easily leave a named mutex dangling. Consider the following: #include <cstdlib> #include <iostream> #include <boost/interprocess/sync/named_mutex.hpp> #include <boost/interprocess/sync/scoped_lock.hpp> namespace ip = boost::interprocess; char const *name = "mynamedmutex"; int main(int argc, char*argv[]) { ip::named_mutex mtx(ip::open_or_create, name); std::cout << "acquiring named mutex" << std::endl; ip::scoped_lock<ip::named_mutex> lock(mtx); std::cout << "acquired" << std::endl; exit(EXIT_FAILURE); // whoops } On my Linux box, this runs fine the first time, but the second time it hangs waiting to acquire the mutex. I have to manually delete the semaphore in /dev/shm/. This will happen whenever the process exits without calling destructors of locals; for instance: - std::exit - std::quick_exit - std::abort - std::terminate - a crash - assert failure - an unhandled exception - etc.. I find I can handle *some* of this by registering a terminate handler, an exit handler (and on C++11, a quick_exit handler) that calls boost::interprocess::named_mutex::remove. This raises a few questions, though... - Is there a better way? - Is it safe to `remove` the same named mutex multiple times? - Does this clean up only this process's use of the named_mutex, or does it nuke it from the system, even if another process is using it? (The docs suggest the latter, which is not what I want, is it?) Thanks, -- Eric Niebler Boost.org

5 5

[Graph][Parallel][PBGL] Bug deleting self loop edges
by bminano 07 Mar '13

07 Mar '13

Hello, I think I found a bug in the graph parallel library. I have a bidirectional adjacency list which has some self loop edges. When I try to delete them with remove_edge_if (or remove_out_edge_if or remove_in_edge_if) the edges are deleted, but it seems that some reference gets broken in the graph. If I iterate over the in_edges a reference to a self loop is found. But it does not happen if I iterate over the out_edges. If the graph is written in a graphviz file the self loop edges does not appear. I think there is some broken reference into the adjacency list that keeps the in_edges. I have two different pieces of code (one with pbgl and the other with bgl). They do the same, create a graph, delete the self-edges and print the in_edges. Could someone have a look at this problem? We want to use this library in our research but with this problem will not be possible. Thank you pbgl_in_edges.cpp <http://boost.2283326.n4.nabble.com/file/n4643903/pbgl_in_edges.cpp> bgl_in_edges.cpp <http://boost.2283326.n4.nabble.com/file/n4643903/bgl_in_edges.cpp> -- View this message in context: http://boost.2283326.n4.nabble.com/Graph-Parallel-PBGL-Bug-deleting-self-lo… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

make_shared causes stack overflow with large objects
by Gregor Jasny 07 Mar '13

07 Mar '13

Hello, the bug described in #7965 causes stack overflows and sometimes hard to track crashes. I'd really appreciate if anyone could have a look. Thanks, Gregor

2 3

[thread] thread_specific_ptr leaks on VS2012 when using std::async()
by Klaim - Joël Lamotte 05 Mar '13

05 Mar '13

Hi, The title says it all. I think I found a memory leak with the help of boost.log author Andrei Semashev. I was using Boost.Log in Visual Studio 2012 (released one) and tried to use Visual Leak Detector because Visual Studio basic leak detector was reporting leaks. I isolated the leaks to usage of log and switched to VLD to check if the basic detector wasn't giving me false positive. I contacted Andrei to see if he could check it but he don't have VS2012 available so I setup some tests to isolate the problem. In the end of our exchange we concluded it was a false positive (it only leak on end of program). However it is still an annoying noise in the leak report logs, so people not understanding the source of this problem might be interested in this email. I attach the whole email exchange to this email, tell me if leak logs are necessary too. The last version of my test is at the end of the email (first program). Basically, the leak appear only when using std::async() in combination of boost::thread_specific_ptr : - using exclusively boost threading libraries (both with dynamic and static linking) result in no leak - using exclusively std threading libraries but not std::async() result in no leak - using std::async() result in a leak The second test program shows that using Intel Threading Building Blocks, I get leaks only if : - I use std::async() in combination with boost::thread_specific_ptr, as before (I mean I use tbb without a leak, then I add a std::async() call to the same task function and there is a leak) - I don't use std::async() but I don't manage the lifetime of tbb task scheduler We think the threads spawned by both tbb (that is supposed to be a superset of ppl) and std::async() (that is supposed to use ppl/concrt task scheduler) are not ended yet when the program reach the end of main (which seems logical as the task scheduler is then managed as a static global), making boost::thread_specific_ptr not release some data on thread destruction, as it is notified too late and any leak detection tool willl generate noise due to this. A way to fix this is to explicitely end the task scheduler, being tbb or ppl/concrt. I will use tbb task scheduler explicitely initialized/terminated in my project so it will solve the problem on my side. Joel Lamotte ------------------------------------ // this program was used to see the memory leak #define TEST_ASYNC // comment this to make it linear and not leak //#define WITH_BOOST_THREADS #define WITH_STD_ASYNC // uncomment this to leak //#define WITH_BOOST_LOG // boost log also leak if std::async is used #include <boost/thread.hpp> #ifdef WITH_BOOST_THREADS # include <boost/thread/future.hpp> # include <boost/chrono.hpp> # define THIS_THREAD boost::this_thread # define THREAD_LIB boost::thread # define CHRONO_LIB boost::chrono # define MY_FUTURE boost::future #else # include <future> # include <thread> # include <chrono> # define THIS_THREAD std::this_thread # define THREAD_LIB std::thread # define CHRONO_LIB std::chrono # define MY_FUTURE std::future #endif #ifdef WITH_BOOST_LOG # include <boost/log/trivial.hpp> # define MY_LOG BOOST_LOG_TRIVIAL(info) #else # include <iostream> # define MY_LOG std::cout << '\n' #endif #define BASIC_VS_LEAK_DETECTOR 0 #define VISUAL_LEAK_DETECTOR 1 #define LEAK_DETECTOR VISUAL_LEAK_DETECTOR #if LEAK_DETECTOR == BASIC_VS_LEAK_DETECTOR # define _CRTDBG_MAP_ALLOC # include <stdlib.h> # include <crtdbg.h> #else # include "vld.h" #endif struct my_data { char data[1024]; my_data() { MY_LOG << "CONSTRUCTOR my_data - " << THIS_THREAD::get_id(); } ~my_data() { MY_LOG << "DESTRUCTOR my_data - " << THIS_THREAD::get_id(); } }; boost::thread_specific_ptr< my_data > ts_ptr; void my_thread_foo() { ts_ptr.reset(new my_data()); } int work() { for( int i = 0; i < 42; ++i ) { MY_LOG << "THIS IS A MESSAGE - I = " << i; MY_LOG << "ts_ptr = " << ts_ptr.get(); my_thread_foo(); THIS_THREAD::sleep_for( CHRONO_LIB::milliseconds(10) ); } return 0; } int main(int argc, char *argv[]) { #if LEAK_DETECTOR == BASIC_VS_LEAK_DETECTOR // First simple memory leak detection for Visual Studio // use _crtBreakAlloc to put a breakpoint on the provided memory leak id allocation //_crtBreakAlloc = 1149; _CrtSetDbgFlag ( _CRTDBG_ALLOC_MEM_DF | _CRTDBG_LEAK_CHECK_DF ); #endif //int* k = new int[42]; // to check that memory leak detection does work MY_LOG << "Hello, World!"; #ifdef TEST_ASYNC # ifndef WITH_BOOST_THREADS std::vector< std::future<int> > work_in_progress(2); # ifdef WITH_STD_ASYNC for( auto& ftr : work_in_progress ) { ftr = std::async( work ); } # else for( auto& ftr : work_in_progress ) { std::packaged_task< int() > task(work); ftr = task.get_future(); std::thread thread( std::move(task) ); thread.detach(); } # endif for( auto& ftr : work_in_progress ) { ftr.get(); } # else std::vector< boost::unique_future<int> > work_in_progress(42); for( auto& ftr : work_in_progress ) { boost::packaged_task<int> task(work); // boost's packaged_task don't take the full signature as parameter, it takes the return type only ftr = task.get_future(); boost::thread thread( boost::move(task) ); thread.detach(); } for( auto& ftr : work_in_progress ) { ftr.get(); } # endif #else for( int i = 0; i < 42; ++i ) { work(); } #endif MY_LOG << "END"; return EXIT_SUCCESS; } -------------------------------------- // this program tests if the memory leaks appear with Threading Building Blocks #define BASIC_VS_LEAK_DETECTOR 0 #define VISUAL_LEAK_DETECTOR 1 #define LEAK_DETECTOR VISUAL_LEAK_DETECTOR #define WITH_ROOT_TASK //#define WITH_BOOST_LOG //#define WITH_STD_ASYNC // uncomment to leak #ifdef WITH_STD_ASYNC # include <future> #endif #include <thread> #include <atomic> #include <boost/thread.hpp> #include <tbb/tbb.h> #include <tbb/task_scheduler_init.h> #ifdef WITH_BOOST_LOG # include <boost/log/trivial.hpp> # define MY_LOG BOOST_LOG_TRIVIAL(info) #else # include <iostream> # define MY_LOG std::cout << '\n' #endif #if LEAK_DETECTOR == BASIC_VS_LEAK_DETECTOR # define _CRTDBG_MAP_ALLOC # include <stdlib.h> # include <crtdbg.h> #else # include "vld.h" #endif namespace test { struct my_data { char data[1024]; }; boost::thread_specific_ptr< my_data > ts_ptr; void my_thread_foo() { ts_ptr.reset(new my_data()); } class UpdateTask : public tbb::task { public: UpdateTask() : idx( s_idx++ ) { MY_LOG << "[UpdateTask " << idx << " ] " << std::endl; } ~UpdateTask() { MY_LOG << "[/UpdateTask " << idx << " ]" << std::endl; } tbb::task* execute() { MY_LOG << "[" << std::this_thread::get_id() << "] Tick "<< m_count <<std::endl; my_thread_foo(); ++m_count; if( m_count < 100 ) { // make sure this is re-executed this->increment_ref_count(); this->recycle_as_safe_continuation(); } return nullptr; } private: static std::atomic<int> s_idx; std::atomic<int> m_count; const int idx; }; std::atomic<int> UpdateTask::s_idx = 0; class TaskScheduler // using TBB { public: #ifdef WITH_ROOT_TASK TaskScheduler() : m_root_task( *new (tbb::task::allocate_root()) tbb::empty_task ) { m_root_task.increment_ref_count(); } ~TaskScheduler() { m_root_task.destroy(m_root_task); } #endif void register_update_task() { #ifdef WITH_ROOT_TASK m_root_task.increment_ref_count(); UpdateTask& updater = *new(m_root_task.allocate_child()) UpdateTask(); #else UpdateTask& updater = *new(tbb::task::allocate_root()) UpdateTask(); #endif m_task_list.push_back( updater ); } void run_and_wait() { #ifdef WITH_ROOT_TASK m_root_task.spawn( m_task_list ); m_root_task.wait_for_all(); #else tbb::task::spawn_root_and_wait( m_task_list ); #endif } private: tbb::task_list m_task_list; // uncomment the following line to not leak tbb //tbb::task_scheduler_init m_engine_instance; // We explicitly create and destroy the TBB task scheduler to avoid memory leak warning noises. #ifdef WITH_ROOT_TASK tbb::task& m_root_task; #endif }; void tbb_test() { TaskScheduler task_scheduler; for( int i = 0; i < 50; ++i ) { task_scheduler.register_update_task(); } task_scheduler.run_and_wait(); } } int main(int argc, char *argv[]) { #if LEAK_DETECTOR == BASIC_VS_LEAK_DETECTOR // First simple memory leak detection for Visual Studio // use _crtBreakAlloc to put a breakpoint on the provided memory leak id allocation //_crtBreakAlloc = 148; _CrtSetDbgFlag ( _CRTDBG_ALLOC_MEM_DF | _CRTDBG_LEAK_CHECK_DF ); #endif #ifdef WITH_STD_ASYNC std::atomic<bool> finished = false; std::async( [&]{ while( !finished ) { MY_LOG << "POP"; test::my_thread_foo(); std::this_thread::sleep_for( std::chrono::milliseconds(500) ); } } ); #endif test::tbb_test(); #ifdef WITH_STD_ASYNC finished = true; #endif MY_LOG << "\nEND"; std::this_thread::sleep_for( std::chrono::seconds(4) ); return 0; }

3 5

[thread] C++11 once_flag enabled when constexpr is not available
by Andrey Semashev 05 Mar '13

05 Mar '13

Hi, Vicente! I see you applied my patch for call_once but you seem to forgot to disable the C++11 call_once interface when the compiler does not support constexpr. Was that intentional or you just missed it? Anyway, please find the patch attached.

3 3

[locale] Composing asymmetric locale for character encoding conversion
by Andrey Semashev 05 Mar '13

05 Mar '13

Hi, Suppose I have a logging application that writes log records in wide (wchar_t, UTF-16) and narrow (char, UTF-8) encodings and I want these logs to be stored in a UTF-16LE encoded file. For simplicity, let's assume that I write log files with std::wofstream. Now, the standard says that the file stream buffer is supposed to convert wide characters to byte sequences using the locale imbued into the buffer. However, it seems that the locale should be the same as the one imbued into the stream (basic_ostream::imbue makes sure of that). What this leads to is that in order to achieve my goal the locale should be able to convert narrow characters of UTF-8 to wide characters of UTF-16 and wide characters of UTF-16 to narrow characters representing byte sequence of UTF16LE. Is it possible to make such an asymmetric locale with Boost.Locale? Or maybe there is another way of doing this? An additional question. Is it possible to to achieve my goal with std::ofstream (as opposed to std::wofstream)? I have a very strong suspicion that the answer is no because the narrow characters will pass on unconverted to the file instead of being translated from UTF-8 to UTF-16LE, but maybe I'm missing something. Thank you.

3 4

[coroutine] documentation comment
by Brian Wood 05 Mar '13

05 Mar '13

I wrote about this last month on Boost users but there wasn't a reply. I have a comment about a sentence on this page: http://www.boost.org/doc/libs/1_53_0/libs/coroutine/doc/html/coroutine/intr… "The principal difference between coroutines and routines is that a coroutine enables explicit suspend and resume their progress via additional operations by preserving local state ..." I'm wondering if it would be helpful to change that to this: The principal difference between coroutines and routines is that coroutines enable explicit suspend and resume of their progress via additional operations by preserving local state ... Shalom Brian Wood Ebenezer Enterprises http://webEbenezer.net (651) 251-9384

2 1

[tweener] Preliminary Submission
by Julien Jorge 05 Mar '13

05 Mar '13

Hello, I would like to propose the Boost.Tweener library for preliminary submission. The purpose of the Boost.Tweener library is to provide solutions to interpolate the intermediate values between two given values during a time interval. Various easing functions can be applied to control the computation of the intermediate values. I felt the need of such a library while developing games but I have also seen this need in various animation softwares. The library provides the following functionalities: - Interpolation is done on the value of a given variable or using an user-provided callback function, - The interpolated values are computed using a predefined easing function or any user-provided function respecting the contract, - Several tweeners can easily be executed simultaneously or in a row, - The type of the interpolated values are user defined. Please follow this link to download a Zip of the library: http://sourceforge.net/projects/libclaw/files/boost/boost-tweener-rc1.tar.g… Can you check that the library works as expected or tell me what should be fixed before submitting for review? There are various example programs in the archive. Regards, Julien Jorge

6 15

[thread] boost::thread and thread safety annotations
by Wladimir 04 Mar '13

04 Mar '13

Hello, The Clang C++ compiler project is currently working on a thread safety analyzer. By making use of so-called thread safety annotations within the source code, several problems with synchronization primitives can be found statically. For example: usage of a data structure without acquiring its guarding lock. See here for an overview of the available attributes: http://clang.llvm.org/docs/LanguageExtensions.html#threadsafety It is customary to use these attributes by defining macros, for compatibility: http://www.mail-archive.com/linuxkernelnewbies@googlegroups.com/msg01455.ht… At one time, it was also supposed to end up in G++, but this was abandoned in favor of clang (see http://gcc.gnu.org/wiki/ThreadSafetyAnnotation) But at least the annotations are fairly standardized. I think it would be useful to add these annotations to boost::thread, so that projects using that library can make use of the static checking. As I understand it, is only a matter of marking data structures that serve as lock/scoped_lock (such as boost::mutex, boost::recursive_mutex, ...), and methods that act upon the lock with the appropriate attributes. Any interest in this? Regards, Wladimir

2 1

[thread] barrier::wait() not marked as interruption_point
by Oliver Kowalke 04 Mar '13

04 Mar '13

In the documentation (1.53 beta) barrier::wait() is not marked as interruption-point nor that it will throw thread_interrupted if thread blocked inside barrier::wait() if it gets interrupted. Because barrier::wait() calls condition_variable::wait() and condition_variable::wait() is a interruption-point barrier::wait() should it be too - or do I miss something? Oliver

2 1

Re: [boost] [persistent] Library preview: Persistent
by Stefan Strasser 04 Mar '13

04 Mar '13

Am 04.03.2013 16:52, schrieb Jarrad Waterloo: > So if your library is in need, which it is, than release it, preferably > to boost under the boost license. You can always improve, add on latter. > You may solicit architecture and requirements from the list to increase > its usefulness and minimize rewrites. If you can't provide enough > manpower to complete it or even if you can, than solicit help. If four > people throughout the world can get it done in half the time of one > person than WOO HOO! There are many who would like to contribute from > the beginning, which also can't hurt acceptance. The important thing is > to have a vision, preferably shared, and to release something usable, > useful and working, as quickly as possible before interest dries up and > in a timely manner. > > Thanks for your remarks! Specifically for Persistent: > Have you considered an MVCC [option] where there are no updates from a > users perspective but are rather inserts; This sacrifices hard drive > space for a lock free/low lock database. yes, the entire storage backend is based on MVCC [1]. there currently is no lock-based option. objects are MVCC in memory for concurrency (see section "concurrent transactions" [2]), and on disk to achieve atomic updates. when an update is safely synced to disk the old object versions are discarded. I haven't written much about the backend in the documentation for two reasons: the interface is most important, and I actually don't think it would get used much in the long term. as much as I try to make it safe and efficient, a backend using an industrially proven storage engine like BerkeleyDB or SQLite would almost always be preferred, if the stored data has any value. I've written more about this in a previous reply to Klaim-Joël Lamotte in this thread. Would you like to share anything on the architecture of the interface? > Since you in some ways may be competing against relational databases by > making a object oriented database, maybe equivalent administrative > functionality are in order such as import and export into some textual > representations. > On a related note, ways to access system information such external > id/OIDS, timestamps, version numbers via an API for tooling and maybe > querying purposes > ?File format specifications? this and much more is certainly needed for database applications. but since we don't have the resources to implement an industrial-strength storage engine, my approach was to provide one "black-box" implementation for applications that would have used (boost.)serialization or other files otherwise, and provide resource managers using external databases later on. > > Concerning my interest, why haven't you given this to me two years ago, > how much longer must I wait. [Ha Ha Ha] *pointing to the copyright notice* :p Regards, Stefan [1] http://en.wikipedia.org/wiki/Multiversion_concurrency_control [2] https://svn.boost.org/svn/boost/sandbox/persistent/libs/persistent/doc/html…

2 1

Is there interest in a collection of call stack utilities?
by Aurelian Melinte 04 Mar '13

04 Mar '13

Hello, I have a collection of debugging/diagnostic utilities to inspect the run-time call stack and to resolve symbol information. The tools are currently C++11 code and support GNU-Linux and Windows. An overview is available at https://freeshell.de//~amelinte/call_stack_usage.html Is there interest for potential inclusion in boost? Thanks, Aurelian

9 15

[persistent] Library preview: Persistent
by Stefan Strasser 04 Mar '13

04 Mar '13

Hi everyone, I'm thinking about finishing a library that was proposed a couple of years ago. It was pretty far along, and there is documentation available in the sandbox (somewhat outdated): https://svn.boost.org/svn/boost/sandbox/persistent/libs/persistent/doc/html… It is a library with the goal of storing C++ objects on disk, with an interface that is as close as possible to accessing regular C++ objects in memory. A very simple example could look like this: shared_loc<person> p=...; { transaction tx; p->name="..."; p->address="..."; tx.commit(); } It is based on Boost.Serialization, but automatically maintains a consistent state on disk (ACID transactions), which can be updated incrementally. Part of its code was moved to a library named Transact to work alongside other transactional resources (like memory) and is available in the sandbox: https://svn.boost.org/svn/boost/sandbox/transaction/boost/transact/ I'd like to know whether the boost community is still interested in such a library, and I suppose there are quite a few new people here so your comments are welcome as well. Thank You!

6 9

[thread] why is 'thread_group' in 'boost/thread/detail'?
by pavel 03 Mar '13

03 Mar '13

as of 1.53 the docs say the 'thread_group' class is included by this instruction: #include <boost/thread/thread_group.hpp> http://www.boost.org/doc/libs/1_53_0/doc/html/thread/thread_management.html… whereas the actual file is not in the 'boost/thread', but accidentally is in 'boost/thread/detail' is that intentional? -- Pavel P.S. if you notice a grammar mistake or weird phrasing in my message please point it out

3 3

Copyright notice update policy
by Mateusz Loskot 03 Mar '13

03 Mar '13

Hi, What is the policy of updating year in copyright notices? There are several pages ([1], [2], [3]) where copyright notice is explained, but without any notes on the year detail I found one thread [4] about copyright policy, but it discusses only copyrighting patches and fixes. I understand it may depend on local law in particular country, (i.e. it seems U.S. requires year [5]). However, without digging law backgrounds, I'd simply like to know what is Boost policy for the notice updates. For example, a file created in 2009 includes relevant copyright notice and in 2013 the file receives update. Is it required to update the copyright year to 2009-2013? [1] http://www.boost.org/users/license.html [2] http://www.boost.org/users/faq.html [3] http://www.boost.org/users/index.html [4] http://lists.boost.org/Archives/boost/2012/01/189315.php [5] http://www.contentious.com/2007/01/07/copyright-notice-is-the-year-really-n… Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

3 3

[exception][locale][timer] Pre-built library list in getting started guide.
by Daniel James 03 Mar '13

03 Mar '13

According to this ticket, building details are missing from the getting started guide: https://svn.boost.org/trac/boost/ticket/7324 Exception, locale and timer either need to be built, or have optional parts that need to be built. Please can appropriate people comment (in the ticket, not here) on what the libraries' need, so that I can fill in missing entries. If details are needed please write some text that I can copy and paste into the document, since you should be able to do a better job of writing it than I could. thanks, Daniel

1 0

variant with shrink
by Niitsuma Hirotaka 03 Mar '13

03 Mar '13

boost::variant should be variant<int,int> => int variant<int,double> => double variant<int,boost::rational<int> > => boost::rational<int> variant<int,double,std::string> => variant<double,std::string> I wrote such extension https://github.com/niitsuma/variant_shrink Default generalize order is int < boost::rational<int> < float < double < std::complex<double> You can use other custom generalize relation by defining function object is_generalizable_to<Type,TypeTo>

1 0

[type traits] is_literal_type ?
by Robert Ramey 02 Mar '13

02 Mar '13

Any chance of a boost implementation for is_literal_type? Robert Ramey

4 6

Git Conversion Schedule
by Sebastian Redl 02 Mar '13

02 Mar '13

Hi, According to the timeline linked from the svn.boost.org frontpage, we're already using Git: https://svn.boost.org/trac/boost/wiki/ModCvtSchedule But I'm pretty sure that's not the case, right? What is the current schedule? Sebastian

3 2

[tweener] How to copy image files in documentation
by Julien Jorge 01 Mar '13

01 Mar '13

Hi, I wrote the documentation of Boost.Tweener in boostbook format. I have references to some images in the documentation but they are not copied in the target html directory when I type bjam html How can I make the image directory to be automatically copied in the target directory of the generated documentation? Since I am not familiar with the build process of Boost yet, I would accept a reason not to do this as an answer :) Regards, Julien Jorge

2 2

[graph]matching example is not consistent
by Takatoshi Kondo 01 Mar '13

01 Mar '13

Hello, I found some inconcistency on the following example: http://www.boost.org/doc/libs/1_53_0/libs/graph/example/matching_example.cpp This code has graph diagrams as follows: 0 1---2 3 \ / \ / 4---5 6---7 | | | | 8---9 10---11 / \ / \ 12 13 14---15 16 17 Vertices 1 and 2 is connected on the diagram. But "add_edge(1,2,g)" isn't called. I attached the patch that adds the code above. After applying the patch, result is changed. But I think that the essence of the example is not changed. Thanks, Taka

2 1

[type_erasure] overloading macro
by Christophe Henry 28 Feb '13

28 Feb '13

Hi all, I played a bit more with overloading and it started being annoying and error-prone to add more overloads of concept_map (with more arguments) so I wrote a small macro to 1) generate my overloads and 2) save myself the time reading compiler errors when I use BOOST_TYPE_ERASURE_MEMBER and make a mistake in the number of arguments. It's for C++11 (argument pack) as it's all I need at the moment but I suppose that with Boost.Preprocessor, it'd be for C++03 doable. Well, in case it'd be of any use to someone, here it is, with a small test (tested with g+ 4.5 with -std=c++0x). #include <boost/type_erasure/concept_interface.hpp> #include <boost/type_erasure/rebind_any.hpp> #include <boost/type_erasure/derived.hpp> #include <boost/type_erasure/is_placeholder.hpp> #include <boost/type_erasure/constructible.hpp> #include <boost/type_erasure/relaxed_match.hpp> #include <boost/type_erasure/any.hpp> #include <boost/type_erasure/builtin.hpp> #include <boost/type_erasure/any_cast.hpp> #include <boost/type_erasure/detail/macro.hpp> #include <boost/mpl/vector.hpp> #include <iostream> #ifndef BOOST_NO_CXX11_VARIADIC_TEMPLATES #define BOOST_TYPE_ERASURE_MEMBER_VARIADIC_I(qualname,concept_name,member) \ BOOST_TYPE_ERASURE_OPEN_NAMESPACE(qualname) \ template <typename T, typename... Args> \ struct concept_name{ \ static void apply(const T& t, const Args... a) { t.member(a...); } }; \ BOOST_TYPE_ERASURE_CLOSE_NAMESPACE(qualname) \ namespace boost { namespace type_erasure { \ template<class T, typename... U, class Base, class Enable> \ struct concept_interface< BOOST_TYPE_ERASURE_QUALIFIED_NAME(qualname)<T, U... >, Base, T, Enable> : Base { \ typedef void _fun_defined; \ void member(typename rebind_any<Base, U>::type... arg)const \ {call(BOOST_TYPE_ERASURE_QUALIFIED_NAME(qualname)<T, U...>(), *this, arg...);} }; \ template<class T, typename... U, class Base> \ struct concept_interface< BOOST_TYPE_ERASURE_QUALIFIED_NAME(qualname)<T, U...>, Base, T, typename Base::_fun_defined> : Base{ \ using Base::member; void member(typename rebind_any<Base, U >::type... arg)const \ {call(BOOST_TYPE_ERASURE_QUALIFIED_NAME(qualname)<T, U...>(), *this, arg...);} }; \ }} #endif #define BOOST_TYPE_ERASURE_MEMBER_VARIADIC(qualified_name,member) \ BOOST_TYPE_ERASURE_MEMBER_VARIADIC_I( \ qualified_name, \ BOOST_PP_SEQ_ELEM(BOOST_PP_DEC(BOOST_PP_SEQ_SIZE(qualified_name)), qualified_name), \ member) // supports overloading, does not require any number of arguments BOOST_TYPE_ERASURE_MEMBER_VARIADIC((n1)(n2)(foo),foo) namespace mpl = boost::mpl; using namespace boost::type_erasure; struct Test { void foo()const { std::cout << "foo() called" << std::endl; } void foo(int i)const { std::cout << "foo(int) called with: " << i << std::endl; } void foo(int i,char c)const { std::cout << "foo(int,char) called with: " << i << "," << c << std::endl; } void foo(double d)const { std::cout << "foo(double) called with: " << d << std::endl; } void foo(int i,double d)const { std::cout << "foo(int,double) called with: " << i << "," << d << std::endl; } void foo(int i,double d,char c)const { std::cout << "foo(int,double,char) called with: " << i << "," << d << "," << c << std::endl; } }; int main() { Test t; any< mpl::vector< n1::n2::foo<_self>, n1::n2::foo<_self, int>, n1::n2::foo<_self, double>, n1::n2::foo<_self, int, double>, n1::n2::foo<_self, int, char>, n1::n2::foo<_self, int, double, char>, copy_constructible<> > > x (t); x.foo(); // calls foo() x.foo(1); // calls foo(int) x.foo(1.0); // calls foo(double) x.foo(1,1.0); // calls foo(int, double) x.foo(1,'a'); // calls foo(int, char) x.foo(1,1.0,'a'); // calls foo(int, double,char) return 0; }

2 21

[ptr_container, crc, format] Open tickets - code patches available
by Joachim Faulhaber 28 Feb '13

28 Feb '13

Hi, there are open tickets: https://svn.boost.org/trac/boost/ticket/7430 (ptr_container: warning fixes) https://svn.boost.org/trac/boost/ticket/7433 (crc: runtime check issue) https://svn.boost.org/trac/boost/ticket/7435 (format: crash) that we have submitted 5 months ago. Along with the bug reports there are code patches for the reported issues, that have been tested and used in production code on different platforms. We would kindly ask the maintainers to look at these issues and to apply the patches to the library code, so they can be integrated in the next release. In case the maintainers do not have time to fix these issues within say the next 2 weeks, I (Joachim) would like to ask for permission to apply the patches. Fixing the issues would be very helpful for us, so we don't have to patch the code locally for every new version. Thanks a lot, Joachim & Franz -- Interval Container Library [Boost.Icl] http://www.joachim-faulhaber.de

3 6

Releasing gil::io
by Christian Henning 28 Feb '13

28 Feb '13

Hi all, I have taken a look at the requirements to release a new library. There is some points I like to discuss. Technically speaking gil::io is a replacement of the older gil io extension. So, it's not really a new library. But of course, I don't mind fulfilling all the requirements. Here are the requirements before merging: * root/libs/libraries.htm entry is OK, both in the alphabetic list and in the category lists. Should I add a gil::io entry? * root/libs/maintainers.txt entry is OK. Should I add a gil::io entry? * The library's root/libs/xxx directory contains an index.html file with either the main docs or a redirection to the main docs. Done * The primary docs pages meet Boost requirements and guidelines. Don't leave this until too late; it has turned up lots of issues in the past. I'm using boostbook and the default templates. * Trunk inspection report is clean. I would need some help here to hook up gil::io test with general boost testing. * Trunk regression tests are reasonably clean or marked up. TODO Thanks, Christian

2 3

Fwd: [Thread] Solution to conflict with MFC?
by Thorsten Ottosen 28 Feb '13

28 Feb '13

Hi Thread maintainers, Anthony speaks about a patch to make this work. Does anyone know where it is? And could it be applied? Thanks -Thorsten -------- Original Meddelelse -------- Subject: [Thread] Solution to conflict with MFC? Date: Tue, 26 Apr 2011 13:28:56 +0200 From: Christian Larsen <contact(a)dword.dk> Reply-To: boost-users(a)lists.boost.org To: boost-users(a)lists.boost.org Newsgroups: gmane.comp.lib.boost.user Hello, I know this has been asked before, but I could not find a good solution. I'm experiencing problems with an application using both MFC and Boost.Thread. Specifically the assertion ASSERT(AfxGetModuleState() != AfxGetAppModuleState()); in AfxCoreInitModule() fails. I link Boost.Thread statically into a DLL in my project. From previous posts to this list and elsewhere, e.g. http://lists.boost.org/boost-users/2009/04/46929.php, I see that the issue is caused by setting _pRawDllMain in tss_pe.cpp. Commenting this line does "solve" the problem, but I would rather not have to hack the Boost source code this way. It seems there is a patch somewhere for this problem (referred to in http://lists.boost.org/boost-users/2009/04/47015.php) but it appears it never made it into the source. Is there any chance of this issue being solved in a better way? Best regards, Christian Larsen

5 9

[Config] N3276 decltype support on VC++ 11
by Michel Morin 28 Feb '13

28 Feb '13

IIRC, Stephan said that VC++ 11 supports N3276 decltype. Shall we "undef" BOOST_NO_CXX11_DECLTYPE_N3276 for VC++ 11? This enables automatic use of decltype-based `boost::result_of`. Trivial patch attached. Regards, Michel

11 79

[multi_index] Move Semantics
by Mark Snelling 27 Feb '13

27 Feb '13

Hi, I've been a user of Boost.MultiIndex for a number of years and think it's a great library. Is there any firm plan to add move semantics? It's been noted under "Future Work" in the docs since Boost 1.32. Regards, Mark

6 10

Proposed interface change to boost::algorithm::copy_while
by Marshall Clow 26 Feb '13

26 Feb '13

In 1.50, I introduced: template<typename InputIterator, typename OutputIterator, typename Predicate> OutputIterator copy_while ( InputIterator first, InputIterator last, OutputIterator result, Predicate p ); (and copy_until), which do pretty much what you would expect: copy items from the input to the output as long as the predicate holds. Sean Parent has convinced me that this is wrong; that I have to return the modified input iterator as well. When I wrote these, I was thinking (if I actually was thinking) of actual input iterators, and since they're all the same, so the caller can pick up on the input sequence after the call returns. However, if you're processing (say) a list, it would be kind of useful to know how far in the list the call advanced. I'm proposing to change the interface to: template<typename InputIterator, typename OutputIterator, typename Predicate> std::pair<InputIterator, OutputIterator> copy_while ( InputIterator first, InputIterator last, OutputIterator result, Predicate p ); i.e, changing the return type to return both iterators. What this means: * If you're not calling copy_while (or copy_until), then this change won't affect you. * If you're not using the return value, then this change won't affect you. * If you are using the return value, then you will have to change your code thus: Old foo = copy_while ( first, last, out, p ); New: foo = copy_while ( first, last, out, p ).second; * if you were not using these calls because they didn't return the input iterator, now you can. Questions? Comments? (Except for the "How could you miss that when you wrote those routines?" - I've already asked myself that) Improvements? -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

7 10

[context][iostreams] Cygwin Boost 1.53 error building some libraries.
by Mostafa 26 Feb '13

26 Feb '13

On Windows 7, cygwin 2.7, trying to build Boost 1.53 with the following options fails: ./b2.exe --layout=system --variant=release --link=static,shared --threading=single,multi install -j4 with the following errors: gcc.compile.asm bin.v2/libs/context/build/gcc-4.5.3/release/link-static/threading-multi/asm/make_i386_sysv_elf_gas.o libs/context/src/asm/make_i386_sysv_elf_gas.S: Assembler messages: libs/context/src/asm/make_i386_sysv_elf_gas.S:37: Warning: .type pseudo-op used outside of .def/.endef ignored. libs/context/src/asm/make_i386_sysv_elf_gas.S:37: Error: junk at end of line, first unrecognized character is `m' libs/context/src/asm/make_i386_sysv_elf_gas.S:77: Warning: .size pseudo-op used outside of .def/.endef ignored. libs/context/src/asm/make_i386_sysv_elf_gas.S:77: Error: junk at end of line, first unrecognized character is `m' gcc.archive bin.v2/libs/atomic/build/gcc-4.5.3/release/link-static/threading-multi/libboost_atomic.a "g++" -x assembler-with-cpp -O3 -finline-functions -Wno-inline -Wall -DBOOST_ALL_NO_LIB=1 -DNDEBUG -I"." -c -o "bin.v2/libs/context/build/gcc-4.5.3/release/link-static/threading-multi/asm/make_i386_sysv_elf_gas.o" "libs/context/src/asm/make_i386_sysv_elf_gas.S" ...failed gcc.compile.asm bin.v2/libs/context/build/gcc-4.5.3/release/link-static/threading-multi/asm/make_i386_sysv_elf_gas.o... common.copy /home/HPC/boost/v1_53_0/lib/libboost_atomic.a gcc.archive bin.v2/libs/system/build/gcc-4.5.3/release/link-static/threading-multi/libboost_system.a ... common.mkdir bin.v2/libs/date_time/build/gcc-4.5.3/release/link-static gcc.compile.asm bin.v2/libs/context/build/gcc-4.5.3/release/link-static/threading-multi/asm/jump_i386_sysv_elf_gas.o libs/context/src/asm/jump_i386_sysv_elf_gas.S: Assembler messages: libs/context/src/asm/jump_i386_sysv_elf_gas.S:37: Warning: .type pseudo-op used outside of .def/.endef ignored. libs/context/src/asm/jump_i386_sysv_elf_gas.S:37: Error: junk at end of line, first unrecognized character is `j' libs/context/src/asm/jump_i386_sysv_elf_gas.S:72: Warning: .size pseudo-op used outside of .def/.endef ignored. libs/context/src/asm/jump_i386_sysv_elf_gas.S:72: Error: junk at end of line, first unrecognized character is `j' "g++" -x assembler-with-cpp -O3 -finline-functions -Wno-inline -Wall -DBOOST_ALL_NO_LIB=1 -DNDEBUG -I"." -c -o "bin.v2/libs/context/build/gcc-4.5.3/release/link-static/threading-multi/asm/jump_i386_sysv_elf_gas.o" "libs/context/src/asm/jump_i386_sysv_elf_gas.S" ...failed gcc.compile.asm bin.v2/libs/context/build/gcc-4.5.3/release/link-static/threading-multi/asm/jump_i386_sysv_elf_gas.o... ...skipped <pbin.v2/libs/context/build/gcc-4.5.3/release/link-static/threading-multi>libboost_context.a(clean) for lack of <pbin.v2/libs/context/build/gcc-4.5.3/release/link-static/threading-multi>asm/make_i386_sysv_elf_gas.o... ...skipped <pbin.v2/libs/context/build/gcc-4.5.3/release/link-static/threading-multi>libboost_context.a for lack of <pbin.v2/libs/context/build/gcc-4.5.3/release/link-static/threading-multi>asm/make_i386_sysv_elf_gas.o... ... common.mkdir bin.v2/libs/locale/build/gcc-4.5.3/release/link-static common.mkdir bin.v2/libs/locale/build/gcc-4.5.3/release/link-static/threading-multi gcc.compile.c++ bin.v2/libs/iostreams/build/gcc-4.5.3/release/link-static/threading-multi/bzip2.o libs\iostreams\src\bzip2.cpp:20:56: fatal error: bzlib.h: No such file or directory compilation terminated. "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -mthreads -DBOOST_ALL_NO_LIB=1 -DBOOST_IOSTREAMS_USE_DEPRECATED -DNDEBUG -I"." -c -o "bin.v2\libs\iostreams\build\gcc-4.5.3\release\link-static\threading-multi\bzip2.o" "libs\iostreams\src\bzip2.cpp" ...failed gcc.compile.c++ bin.v2/libs/iostreams/build/gcc-4.5.3/release/link-static/threading-multi/bzip2.o... ...skipped <pbin.v2/libs/iostreams/build/gcc-4.5.3/release/link-static/threading-multi>libboost_iostreams.a(clean) for lack of <pbin.v2/libs/iostreams/build/gcc-4.5.3/release/link-static/threading-multi>bzip2.o... ...skipped <pbin.v2/libs/iostreams/build/gcc-4.5.3/release/link-static/threading-multi>libboost_iostreams.a for lack of <pbin.v2/libs/iostreams/build/gcc-4.5.3/release/link-static/threading-multi>bzip2.o... ... ...failed updating 6 targets... ...skipped 14 targets... ...updated 3818 targets...

2 2

bjam compiler error
by Christian Henning 26 Feb '13

26 Feb '13

Hi, I'm getting an compiler error when I try to build gil::io documentation. ...patience... ...patience... ...found 1737 targets... ...updating 5 targets... compile-c-c++ ..\..\..\..\bin.v2\tools\quickbook\src\msvc-10.0\release\link-static\threading-multi\values.obj values.cpp C:\boost\tools\quickbook\src\values.cpp(444) : error C2593: 'operator ==' is ambiguous ..\..\..\..\boost/utility/string_ref.hpp(275): could be 'bool boost::operator ==<char,std::char_traits<char>>(boost::basic_string_ref<charT,traits>,boost::basic_string_ref<charT,traits>)' [found using argument-dependent lookup] with [ charT=char, traits=std::char_traits<char> ] ..\..\..\..\boost/utility/string_ref.hpp(270): or 'bool boost::operator ==<char,std::char_traits<char>>(boost::basic_string_ref<charT,traits>,boost::basic_string_ref<charT,traits>)' [found using argument-dependent lookup] with [ charT=char, traits=std::char_traits<char> ] ..\..\..\..\boost/utility/string_ref.hpp(265): or 'bool boost::operator ==<char,std::char_traits<char>>(boost::basic_string_ref<charT,traits>,boost::basic_string_ref<charT,traits>)' [found using argument-dependent lookup] with [ charT=char, traits=std::char_traits<char> ] while trying to match the argument list '(boost::string_ref, boost::string_ref)' C:\boost\tools\quickbook\src\values.cpp(499) : error C2593: 'operator ==' is ambiguous ..\..\..\..\boost/utility/string_ref.hpp(275): could be 'bool boost::operator ==<char,std::char_traits<char>>(boost::basic_string_ref<charT,traits>,boost::basic_string_ref<charT,traits>)' [found using argument-dependent lookup] with [ charT=char, traits=std::char_traits<char> ] ..\..\..\..\boost/utility/string_ref.hpp(270): or 'bool boost::operator ==<char,std::char_traits<char>>(boost::basic_string_ref<charT,traits>,boost::basic_string_ref<charT,traits>)' [found using argument-dependent lookup] with [ charT=char, traits=std::char_traits<char> ] ..\..\..\..\boost/utility/string_ref.hpp(265): or 'bool boost::operator ==<char,std::char_traits<char>>(boost::basic_string_ref<charT,traits>,boost::basic_string_ref<charT,traits>)' [found using argument-dependent lookup] with [ charT=char, traits=std::char_traits<char> ] while trying to match the argument list '(boost::string_ref, boost::string_ref)' call "C:\program files (x86)\microsoft visual studio 10.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"..\..\..\..\bin.v2\tools\quickbook\src\msvc-10.0\release\link-static\threading-multi\values.obj.rsp" ...failed compile-c-c++ ..\..\..\..\bin.v2\tools\quickbook\src\msvc-10.0\release\link-static\threading-multi\values.obj... ...skipped <p..\..\..\..\bin.v2\tools\quickbook\src\msvc-10.0\release\link-static\threading-multi>quickbook.exe for lack of <p..\..\..\..\bin.v2\tools\quickbook\src\msvc-10.0\release\link-static\threading-multi>values.obj... ...skipped <p..\..\..\..\bin.v2\libs\gil\io\doc\msvc-10.0\debug\threading-multi>io.xml for lack of <p..\..\..\..\bin.v2\tools\quickbook\src\msvc-10.0\release\link-static\threading-multi>quickbook.exe... ...skipped <p..\..\..\..\bin.v2\libs\gil\io\doc\msvc-10.0\debug\threading-multi>io.docbook for lack of <p..\..\..\..\bin.v2\libs\gil\io\doc\msvc-10.0\debug\threading-multi-object(xinclude-scanner)@1505>io.xml... ...skipped <phtml>standalone_HTML.manifest for lack of <p..\..\..\..\bin.v2\libs\gil\io\doc\msvc-10.0\debug\threading-multi>io.docbook... ...failed updating 1 target... ...skipped 4 targets... Regards, Christian

5 5

[type_erasure] Some issues
by Fabio Fracassi 25 Feb '13

25 Feb '13

Hi Steven, I recently gave a presentation about type erasure in general, and your library in particular, at our local C++ UG (see here http://prezi.com/kg6d82f-_yky/type-erasure/ or the examples at https://github.com/CppUGBerlin/Talks/tree/master/2013_02_19_TypeErasure if you are interested). During the preparation I discovered some issues I'd like to ask you about. First I think I discovered a bug either in your lib or in clang(with libc++) when compiling one of the documentation examples in C++11 mode. #include <boost/type_erasure/any.hpp> #include <boost/type_erasure/any_cast.hpp> #include <boost/type_erasure/builtin.hpp> #include <boost/type_erasure/operators.hpp> #include <boost/type_erasure/tuple.hpp> #include <iostream> namespace bte = boost::type_erasure; namespace mpl = boost::mpl; int main() { typedef bte::any< mpl::vector< bte::copy_constructible<>, bte::typeid_<>, bte::addable<>, bte::ostreamable<> > > any_type; any_type x(10); any_type y(7); any_type z(x + y); std::cout << z << std::endl; } Compiling this in C++03 mode is fine, in C++11 mode it fails with this error: In file included from te_multi03.cpp:5: ../../Staging/type_erasure/boost/type_erasure/operators.hpp:187:1: error: no matching function for call to 'call' BOOST_TYPE_ERASURE_BINARY_OPERATOR(addable, +) see [1] below for full error. The next are some things which I didn't get to work, and the documentation is silent on any pitfalls. I tried to implement Sean Parent's example from his Value Semantics talk and failed to write a concept that calls free functions instead of members. Here is what I tried (full code and error at [2] below): template<class OBJ, class T> struct drawable { static void apply(const OBJ& obj, T& os, size_t pos) { draw(obj, os, pos); } }; I get an error like: error call to function 'draw' that is neither visible in the template definition nor found by argument-dependent lookup I worked around this problem by defining a concept map, but that is not realy a good solution. On researching a better solution I saw that you already added the convenience macros BOOST_TYPE_ERASURE_MEMBER and BOOST_TYPE_ERASURE_FREE, but didn't have much luck with them. Is there a compileable example where they are used somewhere? Best regards Fabio **** [1] *************************************************************** [1] full error docu example: In file included from te_multi03.cpp:5: ../../Staging/type_erasure/boost/type_erasure/operators.hpp:187:1: error: no matching function for call to 'call' BOOST_TYPE_ERASURE_BINARY_OPERATOR(addable, +) ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../../Staging/type_erasure/boost/type_erasure/operators.hpp:166:20: note: expanded from macro 'BOOST_TYPE_ERASURE_BINARY_OPERATOR' return ::boost::type_erasure::call(name<T, U, R>(), lhs, rhs); \ ^~~~~~~~~~~~~~~~~~~~~~~~~~~ te_multi03.cpp:25:17: note: in instantiation of member function 'boost::type_erasure::operator+' requested here any_type z(x + y); ^ ../../Staging/type_erasure/boost/type_erasure/call.hpp:323:1: note: candidate template ignored: failed template argument deduction call( ^ ../../Staging/type_erasure/boost/type_erasure/call.hpp:356:1: note: candidate template ignored: substitution failure [with Op = boost::type_erasure::addable<boost::type_erasure::_self, boost::type_erasure::_self, boost::type_erasure::_self>, U = <const boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, boost::type_erasure::typeid_<boost::type_erasure::_self>, boost::type_erasure::addable<boost::type_erasure::_self, boost::type_erasure::_self, boost::type_erasure::_self>, boost::type_erasure::ostreamable<std::__1::basic_ostream<char>, boost::type_erasure::_self>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self>, boost::type_erasure::param<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, boost::type_erasure::typeid_<boost::type_erasure::_self>, boost::type_erasure::addable<boost::type_erasure::_self, boost::type_erasure::_self, boost::type_erasure::_self>, boost::type_erasure::ostreamable<std::__1::basic_ostream<char>, boost::type_erasure::_self>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, const boost::type_erasure::_self &>>]: no type named 'type' in 'boost::type_erasure::detail::call_result<boost::type_erasure::addable<boost::type_erasure::_self, boost::type_erasure::_self, boost::type_erasure::_self>, void (const boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, boost::type_erasure::typeid_<boost::type_erasure::_self>, boost::type_erasure::addable<boost::type_erasure::_self, boost::type_erasure::_self, boost::type_erasure::_self>, boost::type_erasure::ostreamable<std::__1::basic_ostream<char>, boost::type_erasure::_self>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self> &, boost::type_erasure::param<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, boost::type_erasure::typeid_<boost::type_erasure::_self>, boost::type_erasure::addable<boost::type_erasure::_self, boost::type_erasure::_self, boost::type_erasure::_self>, boost::type_erasure::ostreamable<std::__1::basic_ostream<char>, boost::type_erasure::_self>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, const boost::type_erasure::_self &> &), void>' call( ^ 1 error generated. **** [2] *************************************************************** [2] Code and error for Value semantic example: #include <boost/type_erasure/any.hpp> #include <boost/type_erasure/concept_interface.hpp> #include <boost/type_erasure/rebind_any.hpp> #include <boost/type_erasure/free.hpp> #include <vector> namespace bte = boost::type_erasure; namespace mpl = boost::mpl; //-------------------------------------------------------------------------------------------------- template<class OBJ, class T> struct drawable { static void apply(const OBJ& obj, T& os, size_t pos) { draw(obj, os, pos); } }; namespace boost { namespace type_erasure { template<class OBJ, class T, class Base> struct concept_interface< ::drawable<OBJ, T>, Base, OBJ> : Base { void draw(typename rebind_any<Base, T&>::type os, size_t pos) const { call(::drawable<OBJ, T>(), *this, os, pos); } }; } } using object_t = bte::any< mpl::vector< bte::copy_constructible<>, drawable<bte::_self, std::ostream> >>; //-------------------------------------------------------------------------------------------------- void draw(const int& value, std::ostream& out, size_t position) { out << std::string(position, ' ') << "int = " << value << std::endl; } void draw(const std::string& value, std::ostream& out, size_t position) { out << std::string(position, ' ') << "string = " << value << std::endl; } struct my_class_t {}; void draw(const my_class_t&, std::ostream& out, size_t position) { out << std::string(position, ' ') << "my_class_t" << std::endl; } //-------------------------------------------------------------------------------------------------- using document_t = std::vector<object_t>; // or std::vector<copy_on_write<object_t>>; void draw(const document_t& x, std::ostream& out, size_t position) { out << std::string(position, ' ') << "<document>" << std::endl; for (auto& e : x) { e.draw(out, position + 2); } out << std::string(position, ' ') << "</document>" << std::endl; } //-------------------------------------------------------------------------------------------------- using history_t = std::vector<document_t>; void commit(history_t& x) { assert(x.size()); x.push_back(x.back()); } void undo(history_t& x) { assert(x.size()); x.pop_back(); } document_t& current(history_t& x) { assert(x.size()); return x.back(); } //-------------------------------------------------------------------------------------------------- int main () { history_t h(1); current(h).emplace_back(0); current(h).emplace_back(std::string("Hello!")); draw(current(h), std::cout, 0); std::cout << "--------------------------" << std::endl; commit(h); current(h).emplace_back(current(h)); current(h).emplace_back(my_class_t()); draw(current(h), std::cout, 0); std::cout << "--------------------------" << std::endl; undo(h); draw(current(h), std::cout, 0); } **** Error: ************************************************************ te_sp_copy.cpp:14:59: error: call to function 'draw' that is neither visible in the template definition nor found by argument-dependent lookup static void apply(const OBJ& obj, T& os, size_t pos) { draw(obj, os, pos); } ^ ../../Staging/type_erasure/boost/type_erasure/detail/instantiate.hpp:91:28: note: in instantiation of member function 'drawable<int, std::__1::basic_ostream<char> >::apply' requested here BOOST_PP_REPEAT(N, BOOST_TYPE_ERASURE_INSTANTIATE_IMPL, concept_sequence) ^ /usr/local/include/boost/preprocessor/repetition/repeat.hpp:38:60: note: expanded from macro 'BOOST_PP_REPEAT_1' # define BOOST_PP_REPEAT_1(c, m, d) BOOST_PP_REPEAT_1_I(c, m, d) ^ /usr/local/include/boost/preprocessor/repetition/repeat.hpp:43:63: note: expanded from macro 'BOOST_PP_REPEAT_1_I' # define BOOST_PP_REPEAT_1_I(c, m, d) BOOST_PP_REPEAT_1_ ## c(m, d) ^ /usr/local/include/boost/preprocessor/repetition/repeat.hpp:54:62: note: expanded from macro 'BOOST_PP_REPEAT_1_3' # define BOOST_PP_REPEAT_1_3(m, d) BOOST_PP_REPEAT_1_2(m, d) m(2, 2, d) ^ ../../Staging/type_erasure/boost/type_erasure/detail/instantiate.hpp:70:47: note: expanded from macro 'BOOST_TYPE_ERASURE_INSTANTIATE_IMPL' (void)&::boost::mpl::at_c<data, n>::type::apply; ^ ../../Staging/type_erasure/boost/type_erasure/any.hpp:182:13: note: in instantiation of function template specialization 'boost::type_erasure::detail::instantiate_concept3::apply<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::mpl::map1<boost::mpl::pair<boost::type_erasure::_self, int> > >' requested here BOOST_TYPE_ERASURE_INSTANTIATE1(Concept, T, U), ^ ../../Staging/type_erasure/boost/type_erasure/detail/instantiate.hpp:51:14: note: expanded from macro 'BOOST_TYPE_ERASURE_INSTANTIATE1' >::type::apply( \ ^ /usr/bin/../lib/c++/v1/memory:1681:31: note: in instantiation of function template specialization 'boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self>::any<int>' requested here ::new((void*)__p) _Up(_VSTD::forward<_Args>(__args)...); ^ /usr/bin/../lib/c++/v1/memory:1608:18: note: in instantiation of function template specialization 'std::__1::allocator<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self> >::construct<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self>, int>' requested here {__a.construct(__p, _VSTD::forward<_Args>(__args)...);} ^ /usr/bin/../lib/c++/v1/memory:1492:14: note: in instantiation of function template specialization 'std::__1::allocator_traits<std::__1::allocator<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self> > >::__construct<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self>, int>' requested here {__construct(__has_construct<allocator_type, pointer, _Args...>(), ^ /usr/bin/../lib/c++/v1/vector:1519:25: note: in instantiation of function template specialization 'std::__1::allocator_traits<std::__1::allocator<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self> > >::construct<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self>, int>' requested here __alloc_traits::construct(this->__alloc(), ^ te_sp_copy.cpp:71:15: note: in instantiation of function template specialization 'std::__1::vector<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self>, std::__1::allocator<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self> > >::emplace_back<int>' requested here current(h).emplace_back(0); ^ te_sp_copy.cpp:33:6: note: 'draw' should be declared prior to the call site void draw(const int& value, std::ostream& out, size_t position) { ^ te_sp_copy.cpp:14:59: error: call to function 'draw' that is neither visible in the template definition nor found by argument-dependent lookup static void apply(const OBJ& obj, T& os, size_t pos) { draw(obj, os, pos); } ^ ../../Staging/type_erasure/boost/type_erasure/detail/instantiate.hpp:91:28: note: in instantiation of member function 'drawable<std::__1::basic_string<char>, std::__1::basic_ostream<char> >::apply' requested here BOOST_PP_REPEAT(N, BOOST_TYPE_ERASURE_INSTANTIATE_IMPL, concept_sequence) ^ /usr/local/include/boost/preprocessor/repetition/repeat.hpp:38:60: note: expanded from macro 'BOOST_PP_REPEAT_1' # define BOOST_PP_REPEAT_1(c, m, d) BOOST_PP_REPEAT_1_I(c, m, d) ^ /usr/local/include/boost/preprocessor/repetition/repeat.hpp:43:63: note: expanded from macro 'BOOST_PP_REPEAT_1_I' # define BOOST_PP_REPEAT_1_I(c, m, d) BOOST_PP_REPEAT_1_ ## c(m, d) ^ /usr/local/include/boost/preprocessor/repetition/repeat.hpp:54:62: note: expanded from macro 'BOOST_PP_REPEAT_1_3' # define BOOST_PP_REPEAT_1_3(m, d) BOOST_PP_REPEAT_1_2(m, d) m(2, 2, d) ^ ../../Staging/type_erasure/boost/type_erasure/detail/instantiate.hpp:70:47: note: expanded from macro 'BOOST_TYPE_ERASURE_INSTANTIATE_IMPL' (void)&::boost::mpl::at_c<data, n>::type::apply; ^ ../../Staging/type_erasure/boost/type_erasure/any.hpp:182:13: note: in instantiation of function template specialization 'boost::type_erasure::detail::instantiate_concept3::apply<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::mpl::map1<boost::mpl::pair<boost::type_erasure::_self, std::__1::basic_string<char> > > >' requested here BOOST_TYPE_ERASURE_INSTANTIATE1(Concept, T, U), ^ ../../Staging/type_erasure/boost/type_erasure/detail/instantiate.hpp:51:14: note: expanded from macro 'BOOST_TYPE_ERASURE_INSTANTIATE1' >::type::apply( \ ^ /usr/bin/../lib/c++/v1/memory:1681:31: note: in instantiation of function template specialization 'boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self>::any<std::__1::basic_string<char> >' requested here ::new((void*)__p) _Up(_VSTD::forward<_Args>(__args)...); ^ /usr/bin/../lib/c++/v1/memory:1608:18: note: in instantiation of function template specialization 'std::__1::allocator<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self> >::construct<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self>, std::__1::basic_string<char> >' requested here {__a.construct(__p, _VSTD::forward<_Args>(__args)...);} ^ /usr/bin/../lib/c++/v1/memory:1492:14: note: in instantiation of function template specialization 'std::__1::allocator_traits<std::__1::allocator<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self> > >::__construct<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self>, std::__1::basic_string<char> >' requested here {__construct(__has_construct<allocator_type, pointer, _Args...>(), ^ /usr/bin/../lib/c++/v1/vector:1519:25: note: in instantiation of function template specialization 'std::__1::allocator_traits<std::__1::allocator<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self> > >::construct<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self>, std::__1::basic_string<char> >' requested here __alloc_traits::construct(this->__alloc(), ^ te_sp_copy.cpp:72:15: note: in instantiation of function template specialization 'std::__1::vector<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self>, std::__1::allocator<boost::type_erasure::any<boost::mpl::vector<boost::type_erasure::copy_constructible<boost::type_erasure::_self>, drawable<boost::type_erasure::_self, std::__1::basic_ostream<char> >, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::type_erasure::_self> > >::emplace_back<std::__1::basic_string<char> >' requested here current(h).emplace_back(std::string("Hello!")); ^ te_sp_copy.cpp:37:6: note: 'draw' should be declared prior to the call site void draw(const std::string& value, std::ostream& out, size_t position) { ^ 2 errors generated.

2 3

[gil::io] Feedback for scanline_read_iterator
by Christian Henning 25 Feb '13

25 Feb '13

Hi all, I'm getting close to finally commit the new io extension for boost::gil. As it was required from the boost review I have implemented a basic image_read_iterator to read large images. I would like to get some feedback on my interface and maybe on the actual implementation, as well. I must admit this is my first iterator that I have designed and implemented from scratch with some help by other people. The latest io code can be found here via svn: http://code.google.com/p/gil-contributions/source/browse/#svn%2Ftrunk%2Fgil… A basic usage of the code is here: http://pastebin.com/3E7KpfwE Thanks! Christian

7 51

[utility]proposal for a small utility of namespace
by law chrono 25 Feb '13

25 Feb '13

I like c++ and boost，but write namespace is a boring work for brace-matching. So I write a small util with boost.preprocessor, like below: #ifndef BOOST_NAMESPACE_UTILITY_HPP_ #define BOOST_NAMESPACE_UTILITY_HPP_ #include <boost/preprocessor/seq/for_each.hpp> #define _PP_NS_BEGIN_FUNC(r,data,elem) namespace elem { #define _PP_NS_END_FUNC(r,data,elem) } #define BOOST_BEGIN_NAMESPACE(SEQ) \ BOOST_PP_SEQ_FOR_EACH(_PP_NS_BEGIN_FUNC, ~, SEQ) #define BOOST_ END_ NAMESPACE (SEQ) \ BOOST_PP_SEQ_FOR_EACH(_PP_NS_END_FUNC, ~, SEQ) #endif //BOOST_NAMESPACE_UTILITY_HPP_ Then the code can be more clear and easy-reading: BOOST_BEGIN_NAMESPACE((boost)(asio)(ip)) //namespace boost{namespace asio{namespace ip{ ... //to something BOOST_END_NAMESPACE((boost)(asio)(ip)) //}}} c++11 inline namespace also can work: inline BOOST_BEGIN_NAMESPACE((detail)) ... //to something BOOST_END_NAMESPACE((detail)) I wander to know whether this util could be a part of boost. Thanks a lot.

3 2

[thread|shared_ptr|atomic] segmentation fault in exception_ptr assignment
by Oliver Kowalke 24 Feb '13

24 Feb '13

I've replaced shared_ptr<> by intrusive_ptr<> + atomic< std::size_t > in boost.thread's future implementation. atomic< std::size_t > use_count; // initialized with '0' in ctor friend inline void intrusive_ptr_add_ref( future_continuation_base * p) BOOST_NOEXCEPT { ++p->use_count; // should be seq_cst } friend inline void intrusive_ptr_release( future_continuation_base * p) { if ( 0 == --p->use_count) // should be seq_cst delete p; } I get an error if I compile the code with gcc-4.7.2 on x86_64: segmentation fault backtrace: 0x0000000000426a96 in boost::detail::atomic_exchange_and_add (pw=0x436a40, dv=-1) at ../../../boost/smart_ptr/detail/sp_counted_base_gcc_x86.hpp:50 50 ); (gdb) bt #0 0x0000000000426a96 in boost::detail::atomic_exchange_and_add (pw=0x436a40, dv=-1) at ../../../boost/smart_ptr/detail/sp_counted_base_gcc_x86.hpp:50 #1 0x0000000000426ba7 in boost::detail::sp_counted_base::release (this=0x436a38) at ../../../boost/smart_ptr/detail/sp_counted_base_gcc_x86.hpp:143 #2 0x0000000000426c57 in boost::detail::shared_count::~shared_count (this=0x7fffffffc868, __in_chrg=<optimized out>) at ../../../boost/smart_ptr/detail/shared_count.hpp:368 #3 0x0000000000427c3e in boost::shared_ptr<boost::exception_detail::clone_base const>::~shared_ptr (this=0x7fffffffc860, __in_chrg=<optimized out>) at ../../../boost/smart_ptr/shared_ptr.hpp:316 #4 0x000000000042b2cd in boost::shared_ptr<boost::exception_detail::clone_base const>::operator= (this=0x75df00, r=...) at ../../../boost/smart_ptr/shared_ptr.hpp:485 #5 0x0000000000427d6f in boost::exception_ptr::operator= (this=0x75df00, other=...) at ../../../boost/exception/detail/exception_ptr.hpp:73 #6 0x0000000000429a2f in boost::fibers::detail::future_object_base::mark_exceptional_finish_internal (this=0x75def0, e=..., lock=...) at ../../../boost/fiber/future.hpp:278 #7 0x000000000043749a in boost::fibers::detail::task_base<int>::owner_destroyed (this=0x75def0) at ../../../boost/fiber/future.hpp:1241 #8 0x000000000042e768 in boost::fibers::packaged_task<int>::~packaged_task (this=0x7fffffffc9b0, __in_chrg=<optimized out>) at ../../../boost/fiber/future.hpp:1341 called funtions: ~packaged_task() -> task_base::owner_destroyed() -> future_object_base::mark_exceptional_finish_internal() -> exception_ptr::operator=(excepton_ptr const&) -> shared_ptr -> shared_count -> sp_counted_base_gcc_x86 -> boost::detail::atomic_exchange_and_add() I'm wondering why a simple assignement of excpetion_ptr causes a segmentation fault if future's implementation uses intrusive_ptr + atomic + sequential - consistent ops instead of shared_ptr. Does someone have an explanation?

2 1

[thread] ~condition_variable_any verifications
by Tim Blechmann 24 Feb '13

24 Feb '13

hi, one of my project uses exit() to terminate the program. this is sometimes called while some threads are waiting on a global condition_variable_any. when calling exit(), this global variable is destroyed while other threads are still waiting on it, which causes BOOST_VERIFY to fire an assertion failure !pthread_cond_destroy(&cond). this scares the hell out of my users. i know that these verifications can be really useful in many case, but in my use case, it makes exit() rather unusable, and i'd have to redesign some of the internal logic to avoid this assertion failure. thoughts? thnx, tim

4 5

[lexical_cast][math] can't unconditionally call math::changesign with long double
by Eric Niebler 24 Feb '13

24 Feb '13

lexical_cast is using math::changesign with long double regardless of whether BOOST_MATH_NO_LONG_DOUBLE_MATH_FUNCTIONS is defined or not. This is causing Boost.Test build problems (see here http://tinyurl.com/af5453h) I'm pretty sure this is a bug in lexical_cast, so I've opened a ticket: https://svn.boost.org/trac/boost/ticket/8162 I've assigned it to the last person to touch lexical_cast.hpp. Apologies if that's not right. There is no entry for lexical_cast in libs/maintainers.txt. -- Eric Niebler Boost.org http://www.boost.org

6 6

[tuple] - Move constructors for Tuple
by Moore, Andrew 23 Feb '13

23 Feb '13

Are there plans for move constructors/assignment operations in the tuples library?

4 8

Re: [boost] [thread] ~condition_variable_any verifications
by Martin Elzen 22 Feb '13

22 Feb '13

Because the standard exit function doesn't call destructors for 'temporary or automatic objects that exist at the time of the call' (see: http://msdn.microsoft.com/en-us/library/6wdz5232%28v=vs.80%29.aspx ) which just ... seems surprising, I prefer not to use it in C++ projects. So I think it's not necessarily a bad thing to re-write code to get rid of it.

1 0

New gil::io has been added
by Christian Henning 22 Feb '13

22 Feb '13

Hi all, I have successfully replaced the old gil::io extension with the new gil::io. The new io has been developed on and off over the last few years and I believe it's a great improvement over the old one. Before going into details I like thank everyone that has been helping me out along the way. I have learned a lot of things and I'm very grateful for the experience! There are numerous improvements and perhaps it's best to study the documentation before using it. Here are some noteworthy points that come to my mind: * updating code that uses the old version only requires to change the header from "boost/extension/io/jpeg_io.hpp" to "boost/extension/io/jpeg/jpeg_io_old.hpp" * new formats: bmp, pnm, raw, targa * read numerous meta information from images. See boost/gil/extension/io/png_tags.hpp for example. * use all sorts of file metaphers or file names, like FILE*, ifstream, stringstream, wstring, filesystem::path, etc * in-memory images are supported * read large images with a scanline_read_iterator * have access to the file format backend * etc. There are some items left for which I need help from the boost maintainers. * How do I hook up the gil::io documentation so it's build when all boost documentation is build? * Same for the test suite. * Should I update boost_release? Or should the new extension "simmer" for a while? Again thanks for everything, Christian

3 7

Re: [boost] boost serialization backwardscompatibility ofbinary archives broken
by Markus Henschel 22 Feb '13

22 Feb '13

> -----Original Message----- > > You didn't comment any part of my mail that proposed a fix for > > compatibility of archives prior to 1.42. Does that mean that you > > consider this issue solved or will you look into that later? > > Actually I'm afraid to touch it. But I'm willing to take a look at it. > Maybe you should add your patch and email (and maybe my > response) as a comment to one of the trac items which touch upon this > subject. Another benefit of this - and another reason that I left the items > open is that other people how had variations on this problem will get notified > when you append to the trac item and that might also be helpful. > > Robert Ramey I posted my analysis of the problem to this track item: https://svn.boost.org/trac/boost/ticket/4660#comment:51 I will provide a patch against the current svn trunk next week. May be it will be possible to reduce the problem to archives created by 1.44.0. Have a nice weekend

2 1

[flat_map] doxygen bug
by Steve Lorimer 22 Feb '13

22 Feb '13

Hi all The default types for 'Predicate' and 'Allocator' exposed to doxygen in flat_map are incorrect. See below ./flat_map.hpp: #ifdef BOOST_CONTAINER_DOXYGEN_INVOKED template <class Key ,class T ,class Pred = std::less< std::pair< Key, T> > <-- incorrect ,class A = std::allocator<T> > <-- incorrect #else template <class Key, class T, class Pred, class A> #endif class flat_map; ./container_fwd.hpp: template <class Key ,class T ,class Pred = std::less<Key> ,class A = std::allocator<std::pair<Key, T> > > class flat_map;

1 0

Problems with building quickbook docs
by Andrey Semashev 21 Feb '13

21 Feb '13

Hi, I'm having problems with building quickbook docs for my library. I have the using quickbook ; as well as doxygen, xsltproc and boostbook in my ~/user-config.jam. When I run: bjam -j 2 release link=static libs/log/doc I get the following error: .../boost-release/tools/build/v2/build/generators.jam:978: in try-one-generator-really *** argument error * rule object(generator)(a)60.run ( project name ? : property-set : sources + ) * called with: ( object(project-target)@1010 filters_reference-xml : object(property-set)@1387 : ) * missing argument sources .../boost-release/tools/build/v2/build/generators.jam:370:see definition of rule 'object(generator)(a)60.run' being called .../boost-release/tools/build/v2/build/generators.jam:1040: in try-one-generator .../boost-release/tools/build/v2/build/generators.jam:1254: in construct-really .../boost-release/tools/build/v2/build/generators.jam:1338: in generators.construct .../boost-release/tools/build/v2/build/targets.jam:1495: in construct .../boost-release/tools/build/v2/build/targets.jam:1298: in object(typed-target)(a)1058.generate .../boost-release/tools/build/v2/build/targets.jam:732: in generate-really .../boost-release/tools/build/v2/build/targets.jam:704: in object(main-target)(a)1164.generate .../boost-release/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference .../boost-release/tools/build/v2/build/targets.jam:1217: in generate-dependencies .../boost-release/tools/build/v2/build/targets.jam:1269: in object(typed-target)(a)1061.generate .../boost-release/tools/build/v2/build/targets.jam:732: in generate-really .../boost-release/tools/build/v2/build/targets.jam:704: in object(main-target)(a)1165.generate .../boost-release/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference .../boost-release/tools/build/v2/build/targets.jam:1217: in generate-dependencies .../boost-release/tools/build/v2/build/targets.jam:1269: in object(typed-target)(a)1062.generate .../boost-release/tools/build/v2/build/targets.jam:732: in generate-really .../boost-release/tools/build/v2/build/targets.jam:704: in object(main-target)(a)1166.generate .../boost-release/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference .../boost-release/tools/build/v2/build/targets.jam:1217: in generate-dependencies .../boost-release/tools/build/v2/build/targets.jam:1269: in object(install-target-class)(a)1065.generate .../boost-release/tools/build/v2/build/targets.jam:732: in generate-really .../boost-release/tools/build/v2/build/targets.jam:704: in object(main-target)(a)1167.generate .../boost-release/tools/build/v2/build/targets.jam:848: in targets.generate-from-reference .../boost-release/tools/build/v2/build/targets.jam:1217: in generate-dependencies .../boost-release/tools/build/v2/build/targets.jam:1399: in basic-target.compute-usage-requirements .../boost-release/tools/build/v2/build/alias.jam:47: in compute-usage-requirements .../boost-release/tools/build/v2/build/targets.jam:1319: in object(alias-target-class)(a)1068.generate .../boost-release/tools/build/v2/build/targets.jam:732: in generate-really .../boost-release/tools/build/v2/build/targets.jam:704: in object(main-target)(a)1168.generate .../boost-release/tools/build/v2/build/targets.jam:258: in object(project-target)(a)1010.generate .../boost-release/tools/build/v2/build-system.jam:736: in load .../boost-release/tools/build/v2/kernel/modules.jam:283: in import .../boost-release/tools/build/v2/kernel/bootstrap.jam:142: in boost-build .../boost-release/boost-build.jam:17: in module scope index.html libs/index.html more/getting_started.html tools/index.html I'm using the release branch. Does anyone know what the problem could be?

2 2

boost serialization backwards compatibility of binary archives broken
by Markus Henschel 21 Feb '13

21 Feb '13

Hello, in its current state boost serialization isn't able to read binary archives from older versions. The documentation states that there is a problem with version 1.42-1.44 but this is not the whole story. My archives from 1.34 don't work either. There are currently open bugs for this: https://svn.boost.org/trac/boost/ticket/4903 https://svn.boost.org/trac/boost/ticket/5567 https://svn.boost.org/trac/boost/ticket/4660 This situation has been like this for a very long time now. Comments of users even suggest not using binary archives or switching to another serialization library because of maintenance problems. I'm posting to this list as it seems like no one cares about these bug reports anymore. The least thing that should be done I think is to update the release notes. There are even patches in the bug reports that provide fixes although I don't know if they work for all situations. The current situation is quite uncomfortable for me as I have to patch every new boost version to get serialization working. What can be done to improve this situation? Thanks, Markus Henschel

2 5

[test][thread] double free or corruption
by Vicente J. Botet Escriba 21 Feb '13

21 Feb '13

Hi, before moving from Boost.Test to lightweight_test.hpp the following error occurred on Boost.Thread test_barrier. After the change the error has disappeared. The same kind of error occurs on all the test using Boost.Test Could other confirm that this error is on Boost.Test? Best, Vicente Sandia-gcc-4.7.1 ------------------------------------------------------------------------ Tests are run on Linux platform. ------------------------------------------------------------------------ Command Line run.py --proxy=http://wwwproxy.sandia.gov:80 --runner=Sandia-gcc-4.7.1 \ --bjam-toolset=gcc --pjl-toolset=gcc --toolsets=gcc-4.7.1 \ "--bjam-options=-j15 warnings=on warnings-as-errors=on" Test output: Sandia-gcc-4.7.1 - thread - test_barrier / gcc-4.7.1 Rev 82993 / Tue, 19 Feb 2013 08:14:00 +0000 *Report Time: *Tue, 19 Feb 2013 19:31:12 +0000 Compile [2013-02-19 08:54:27 UTC]: succeed "/sierra/Sntools/extras/compilers/gcc-4.7.1/bin/g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -pedantic -Werror -g -pthread -fPIC -Wextra -Wno-long-long -Wno-variadic-macros -Wunused-function -pedantic -DBOOST_ALL_NO_LIB=1 -DBOOST_CHRONO_DYN_LINK=1 -DBOOST_SYSTEM_DYN_LINK=1 -DBOOST_SYSTEM_NO_DEPRECATED -DBOOST_TEST_NO_AUTO_LINK=1 -DBOOST_THREAD_BUILD_DLL=1 -DBOOST_THREAD_POSIX -DBOOST_THREAD_THROW_IF_PRECONDITION_NOT_SATISFIED -DBOOST_THREAD_USE_DLL=1 -I".." -c -o "/scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/test_barrier.test/gcc-4.7.1/debug/threading-multi/test_barrier.o" "../libs/thread/test/test_barrier.cpp" Link [2013-02-19 08:54:27 UTC]: succeed "/sierra/Sntools/extras/compilers/gcc-4.7.1/bin/g++" -Wl,-R -Wl,"/scratch/kbelco/boost/results/boost/bin.v2/libs/chrono/build/gcc-4.7.1/debug/threading-multi" -Wl,-R -Wl,"/scratch/kbelco/boost/results/boost/bin.v2/libs/system/build/gcc-4.7.1/debug/threading-multi" -Wl,-R -Wl,"/scratch/kbelco/boost/results/boost/bin.v2/libs/thread/build/gcc-4.7.1/debug/threading-multi" -Wl,-rpath-link -Wl,"/scratch/kbelco/boost/results/boost/bin.v2/libs/chrono/build/gcc-4.7.1/debug/threading-multi" -Wl,-rpath-link -Wl,"/scratch/kbelco/boost/results/boost/bin.v2/libs/system/build/gcc-4.7.1/debug/threading-multi" -Wl,-rpath-link -Wl,"/scratch/kbelco/boost/results/boost/bin.v2/libs/thread/build/gcc-4.7.1/debug/threading-multi" -o "/scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/test_barrier.test/gcc-4.7.1/debug/threading-multi/test_barrier" -Wl,--start-group "/scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/test_barrier.test/gcc-4.7.1/debug/threading-multi/test_barrier.o" "/scratch/kbelco/boost/results/boost/bin.v2/libs/test/build/gcc-4.7.1/debug/link-static/threading-multi/libboost_unit_test_framework.a" "/scratch/kbelco/boost/results/boost/bin.v2/libs/chrono/build/gcc-4.7.1/debug/threading-multi/libboost_chrono.so.1.54.0" "/scratch/kbelco/boost/results/boost/bin.v2/libs/thread/build/gcc-4.7.1/debug/threading-multi/libboost_thread.so.1.54.0" "/scratch/kbelco/boost/results/boost/bin.v2/libs/system/build/gcc-4.7.1/debug/threading-multi/libboost_system.so.1.54.0" -Wl,-Bstatic -Wl,-Bdynamic -lrt -Wl,--end-group -g -pthread Run [2013-02-19 08:54:27 UTC]: fail Running 1 test case... *** No errors detected *** glibc detected *** /scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/test_barrier.test/gcc-4.7.1/debug/threading-multi/test_barrier: double free or corruption (out): 0x000000000f903530 *** ======= Backtrace: ========= /lib64/libc.so.6[0x30ab67245f] /lib64/libc.so.6(cfree+0x4b)[0x30ab6728bb] /sierra/Sntools/extras/compilers/gcc-4.7.1/lib64/libstdc++.so.6(_ZNSsD1Ev+0x20)[0x2b123aaa5660] /scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/test_barrier.test/gcc-4.7.1/debug/threading-multi/test_barrier[0x421c1a] /scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/test_barrier.test/gcc-4.7.1/debug/threading-multi/test_barrier[0x421c34] /scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/test_barrier.test/gcc-4.7.1/debug/threading-multi/test_barrier[0x42028f] /scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/test_barrier.test/gcc-4.7.1/debug/threading-multi/test_barrier[0x421b97] /scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/test_barrier.test/gcc-4.7.1/debug/threading-multi/test_barrier[0x421bca] /scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/test_barrier.test/gcc-4.7.1/debug/threading-multi/test_barrier[0x47918f] /scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/test_barrier.test/gcc-4.7.1/debug/threading-multi/test_barrier[0x478fb2] /lib64/libc.so.6(exit+0xe5)[0x30ab6334f5] /lib64/libc.so.6(__libc_start_main+0xfb)[0x30ab61d99b] /scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/test_barrier.test/gcc-4.7.1/debug/threading-multi/test_barrier(_ZNSt8ios_base4InitD1Ev+0x39)[0x4116d9] ======= Memory map: ======== 00400000-004f1000 r-xp 00000000 68:11 12550145 /scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/test_barrier.test/gcc-4.7.1/debug/threading-multi/test_barrier 006f1000-006f3000 rw-p 000f1000 68:11 12550145 /scratch/kbelco/boost/results/boost/bin.v2/libs/thread/test/test_barrier.test/gcc-4.7.1/debug/threading-multi/test_barrier 006f3000-006f6000 rw-p 006f3000 00:00 0 0f8fb000-0f91c000 rw-p 0f8fb000 00:00 0 [heap] 414fe000-414ff000 ---p 414fe000 00:00 0 414ff000-416ff000 rw-p 414ff000 00:00 0 416ff000-41700000 ---p 416ff000 00:00 0 41700000-41900000 rw-p 41700000 00:00 0 41a48000-41a49000 ---p 41a48000 00:00 0 41a49000-41c49000 rw-p 41a49000 00:00 0 41f6d000-41f6e000 ---p 41f6d000 00:00 0 41f6e000-4216e000 rw-p 41f6e000 00:00 0 4216e000-4216f000 ---p 4216e000 00:00 0 4216f000-4236f000 rw-p 4216f000 00:00 0 4236f000-42370000 ---p 4236f000 00:00 0 42370000-42570000 rw-p 42370000 00:00 0 42570000-42571000 ---p 42570000 00:00 0 42571000-42771000 rw-p 42571000 00:00 0 42771000-42772000 ---p 42771000 00:00 0 42772000-42972000 rw-p 42772000 00:00 0 42972000-42973000 ---p 42972000 00:00 0 42973000-42b73000 rw-p 42973000 00:00 0 42b73000-42b74000 ---p 42b73000 00:00 0 42b74000-42d74000 rw-p 42b74000 00:00 0 30ab200000-30ab21c000 r-xp 00000000 68:05 27394072 /lib64/ld-2.5.so 30ab41b000-30ab41c000 r--p 0001b000 68:05 27394072 /lib64/ld-2.5.so 30ab41c000-30ab41d000 rw-p 0001c000 68:05 27394072 /lib64/ld-2.5.so 30ab600000-30ab74e000 r-xp 00000000 68:05 27394073 /lib64/libc-2.5.so 30ab74e000-30ab94e000 ---p 0014e000 68:05 27394073 /lib64/libc-2.5.so 30ab94e000-30ab952000 r--p 0014e000 68:05 27394073 /lib64/libc-2.5.so 30ab952000-30ab953000 rw-p 00152000 68:05 27394073 /lib64/libc-2.5.so 30ab953000-30ab958000 rw-p 30ab953000 00:00 0 30aba00000-30aba82000 r-xp 00000000 68:05 27394266 /lib64/libm-2.5.so 30aba82000-30abc81000 ---p 00082000 68:05 27394266 /lib64/libm-2.5.so 30abc81000-30abc82000 r--p 00081000 68:05 27394266 /lib64/libm-2.5.so 30abc82000-30abc83000 rw-p 00082000 68:05 27394266 /lib64/libm-2.5.so 30ac200000-30ac216000 r-xp 00000000 68:05 27394078 /lib64/libpthread-2.5.so 30ac216000-30ac415000 ---p 00016000 68:05 27394078 /lib64/libpthread-2.5.so 30ac415000-30ac416000 r--p 00015000 68:05 27394078 /lib64/libpthread-2.5.so 30ac416000-30ac417000 rw-p 00016000 68:05 27394078 /lib64/libpthread-2.5.so 30ac417000-30ac41b000 rw-p 30ac417000 00:00 0 30ade00000-30ade07000 r-xp 00000000 68:05 27394095 /lib64/librt-2.5.so 30ade07000-30ae007000 ---p 00007000 68:05 27394095 /lib64/librt-2.5.so 30ae007000-30ae008000 r--p 00007000 68:05 27394095 /lib64/librt-2.5.so 30ae008000-30ae009000 rw-p 00008000 68:05 27394095 /lib64/librt-2.5.so 2b123a378000-2b123a37a000 rw-p 2b123a378000 00:00 0 2b123a37a000-2b123a387000 r-xp 00000000 68:11 67521223 /scratch/kbelco/boost/results/boost/bin.v2/libs/chrono/build/gcc-4.7.1/debug/threading-multi/libboost_chrono.so.1.54.0 2b123a387000-2b123a587000 ---p 0000d000 68:11 67521223 /scratch/kbelco/boost/results/boost/bin.v2/libs/chrono/build/gcc-4.7.1/debug/threading-multi/libboost_chrono.so.1.54.0 2b123a587000-2b123a588000 rw-p 0000d000 68:11 67521223 /scratch/kbelco/boost/results/boost/bin.v2/libs/chrono/build/gcc-4.7.1/debug/threading-multi/libboost_chrono.so.1.54.0 2b123a588000-2b123a589000 rw-p 2b123a588000 00:00 0 2b123a589000-2b123a5ba000 r-xp 00000000 68:11 70570074 /scratch/kbelco/boost/results/boost/bin.v2/libs/thread/build/gcc-4.7.1/debug/threading-multi/libboost_thread.so.1.54.0 2b123a5ba000-2b123a7b9000 ---p 00031000 68:11 70570074 /scratch/kbelco/boost/results/boost/bin.v2/libs/thread/build/gcc-4.7.1/debug/threading-multi/libboost_thread.so.1.54.0 2b123a7b9000-2b123a7bc000 rw-p 00030000 68:11 70570074 /scratch/kbelco/boost/results/boost/bin.v2/libs/thread/build/gcc-4.7.1/debug/threading-multi/libboost_thread.so.1.54.0 2b123a7bc000-2b123a7c0000 r-xp 00000000 68:11 70568307 /scratch/kbelco/boost/results/boost/bin.v2/libs/system/build/gcc-4.7.1/debug/threading-multi/libboost_system.so.1.54.0 2b123a7c0000-2b123a9bf000 ---p 00004000 68:11 70568307 /scratch/kbelco/boost/results/boost/bin.v2/libs/system/build/gcc-4.7.1/debug/threading-multi/libboost_system.so.1.54.0 2b123a9bf000-2b123a9c0000 rw-p 00003000 68:11 70568307 /scratch/kbelco/boost/results/boost/bin.v2/libs/system/build/gcc-4.7.1/debug/threading-multi/libboost_system.so.1.54.0 2b123a9c0000-2b123a9c1000 rw-p 2b123a9c0000 00:00 0 2b123a9e6000-2b123a9e7000 rw-p 2b123a9e6000 00:00 0 2b123a9e7000-2b123aad1000 r-xp 00000000 00:4a 2200568155 /sierra/Sntools/extras/compilers/gcc-4.7.1/lib64/libstdc++.so.6.0.17 2b123aad1000-2b123acd0000 ---p 000ea000 00:4a 2200568155 /sierra/Sntools/extras/compilers/gcc-4.7.1/lib64/libstdc++.so.6.0.17 2b123acd0000-2b123acd8000 r--p 000e9000 00:4a 2200568155 /sierra/Sntools/extras/compilers/gcc-4.7.1/lib64/libstdc++.so.6.0.17 2b123acd8000-2b123acda000 rw-p 000f1000 00:4a 2200568155 /sierra/Sntools/extras/compilers/gcc-4.7.1/lib64/libstdc++.so.6.0.17 2b123acda000-2b123acef000 rw-p 2b123acda000 00:00 0 2b123acef000-2b123ad04000 r-xp 00000000 00:4a 2201263450 /sierra/Sntools/extras/compilers/gcc-4.7.1/lib64/libgcc_s.so.1 2b123ad04000-2b123af03000 ---p 00015000 00:4a 2201263450 /sierra/Sntools/extras/compilers/gcc-4.7.1/lib64/libgcc_s.so.1 2b123af03000-2b123af04000 rw-p 00014000 00:4a 2201263450 /sierra/Sntools/extras/compilers/gcc-4.7.1/lib64/libgcc_s.so.1 2b123af04000-2b123af07000 rw-p 2b123af04000 00:00 0 7fff4d39e000-7fff4d3b3000 rw-p 7ffffffe9000 00:00 0 [stack] 7fff4d3f6000-7fff4d3fa000 r-xp 7fff4d3f6000 00:00 0 [vdso] ffffffffff600000-ffffffffffe00000 ---p 00000000 00:00 0 [vsyscall] EXIT STATUS: 134 TinyUrl <javascript:make_tinyurl()>

1 0

[tuple] Functionals for tuple element access?
by Jan Hudec 21 Feb '13

21 Feb '13

Hello All, Doing some heavy template work on collections of pairs and tuples I came across the need for functors returning tuple and pair members. So I looked whether Boost has anything like that, but couldn't find any. Now the functors can be written using bind like: bind(_1, &TupleType::get<3>); bind(_1, &PairType::first); except that requires explicitly mentioning the tuple/pair type. Trying to use simply &boost::tuples::get<3, WHAT?!?!?> even failed for me as boost::tuples::get is actually a 3-argument template based on boost::tuples::cons, which looks like implementation detail I better not rely on. Besides bost methods involve pointer-to-{function,member}, which might interfere with inlining. So I think it would be convenient to have functions like this somewhere in boost: template <int N> struct getter { template <typename X> struct result; template <typename F, typename T> struct result<F(T &)> { typedef BOOST_DEDUCED_TYPENAME element<N, T>::type &type; }; template <typename F, typename T> struct result<F(T const &)> { typedef BOOST_DEDUCED_TYPENAME element<N, T>::type const &type; }; template <typename T> BOOST_DEDUCED_TYPENAME element<N, T>::type & operator()(T &t) { return get<N>(t); } template <typename T> BOOST_DEDUCED_TYPENAME element<N, T>::type const & operator()(T const &t) { return get<N>(t); } }; I would like to ask: 1. Would there be interest in adding this? Should I polish it up? 2. What would be good name and place for it (boost::tuples::getter)? 3. To support pairs, would it be preferred to specialize the N=0 and N=1 cases (unfortunately I don't see how to handle the result struct without copy-paste) or define separate first_getter and second_getter or something like that? 4. The definition of result with const and non-const reference was enough for my uses in boost::transform_value_property_map, but I suspect it does not cover all necessary cases (I need non-reference and rvalue reference for C++11 too, right?) My actual use-case was with boost::transform_value_property_map. I needed several property maps with the same set of keys, so I created one boost::associative_property_map with tuple values and splitted it to maps for the items using the above functor. Obviously nothing of this is needed with C++11 lambdas, but I am stuck having to support some obscure platforms like WinCE 4.2 and for it with MSVC++9.0. -- Jan 'Bulb' Hudec <bulb(a)ucw.cz>

3 2

[range] [general] making member functions SFINAE-friendly
by Nathan Ridge 21 Feb '13

21 Feb '13

Hi, I recently came across a request to make iterator_range<I>::size() SFINAE-friendly [1]. The respect in which it is not currently SFINAE-friendly is that it is only applicable to instantiations where I is a random-access iterator, but it is defined for all instantiations, and fails with a static assertion if I is not random-access. This makes it impossible to use SFINAE techniques to detect whether "r.size()" is valid where r is some iterator_range. The suggested workaround is to give iterator_range a base class, specialize this base class for random-access iterators, and only define size() in this specialization. I think this deficiency and workaround can be generalized to any template class 'C<T>' with a member function 'foo' that is only applicable for a subset of valid template arguments for 'T'. I am curious what the Boost community thinks about applying this workaround (factoring out the member function into a base class) as a general rule in such situations? Is making the member function SFINAE-friendly worth the decrease in readability? Are there other disadvantages to this workaround? Are there alternative ways of making such a function SFINAE- friendly that don't require introducing a base class? Finally, if the consensus is that such a workaround is not justified in general, is there any reason it should be justified specifically for iterator_range<I>::size()? Regards, Nate [1] https://svn.boost.org/trac/boost/ticket/8011

15 49

[git] Should I commit to SVN or Git?
by Joaquín Mª López Muñoz 20 Feb '13

20 Feb '13

Hi, I'd like to commit some changes to one of my libs for delivery with Boost 1.54. Should I use SVN as always or begin now using Git for the commit? I've skimmed thru the Git transition project wiki and it doesn't seem to have anything on dates for SVN deprecation etc. Thank you, Joaquín M López Muñoz Telefónica Digital ________________________________ Este mensaje se dirige exclusivamente a su destinatario. Puede consultar nuestra política de envío y recepción de correo electrónico en el enlace situado más abajo. This message is intended exclusively for its addressee. We only send and receive email on the basis of the terms set out at: http://www.tid.es/ES/PAGINAS/disclaimer.aspx

5 5

[thread] Is there interest in shared_lock_prioritized?
by Antony Polukhin 20 Feb '13

20 Feb '13

Hi, I've got a very basic implementation and tests of shared_lock_prioritized, that can be used like that: // Events are written down in order of // their execution in different threads shared_lock_prioritized<2 /*priorities count*/ > lock; // thread #1 // Lock with minimal priority lock_shared(); // thread #2 // Lock with minimal priority lock_shared(0); // thread #3 // Lock for writing with priority // greater than locks of threads 1 and 2 // Waits till already acquired locks in #1 and #2 finish // and then writes lock(1); // thread #4 // Will wait till thread #3 finishes, only then acquire lock lock_shared(0); Such shared lock gives us ability to manage order/priority of different lock attempts, we can make write locks have bigger priority that read locks, have multiple priorities writes (ordered write locks) and so on... Is there an interest in it? -- Best regards, Antony Polukhin

2 2

[PropertyMap] proposing compose_property_map
by Guillaume Pinot 19 Feb '13

19 Feb '13

Hi. Using boost graph, and particulary reverse_graph, I needed a compose_property_map adaptor. As it may be interesting to everyone, I propose my code. http://texitoi.eu/~texitoi/compose_property_map/ I had problems to find a good return type for the get() free function. The solution proposed here has the drawback of needing a copy constructible type for the value_type of the FPMap in the concept checks. I didn't find any other type for the get() function that pass the concept checks and that do not return stack variable, and avoid useless copy. The patch may not work completely as I am discovering the boost build system. I am open to any comment. Thanks.

2 4

[interprocess] atomic<offset_ptr>
by Tim Blechmann 19 Feb '13

19 Feb '13

hi ion, i was wondering, what would be the best way to provide an atomic<offset_ptr>? it cannot be used out of the box, as offset_ptr does not conform to the std/boost::atomic<> requirements. afaict, one would have to pre-compute the offset for a specific memory location when performing a compare_exchange or store and fix up the offset after an atomic load. to do that, it will probably be required to access some internals of the offset_ptr. also, if i'm going to work on it (not sure if i will have time), where shall the implementation go? in a way, i'd rather put it into interprocess than into atomic. thoughts? cheers, tim

2 2

[test] recent commit causing general failure
by Joaquín Mª López Muñoz 19 Feb '13

19 Feb '13

Boost.MultiIndex trunk tests fail all over with message errors like this: C:\...\boost/test/impl/test_main.ipp(39) : error C3861: 'BOOST_CHECK': identifier not found which is seemingly caused by the suppresion of an internal #include in a recent change to Boost.Test: https://svn.boost.org/trac/boost/changeset/82718#file5 Thank you, Joaquín M López Muñoz Telefónica Digital ________________________________ Este mensaje se dirige exclusivamente a su destinatario. Puede consultar nuestra política de envío y recepción de correo electrónico en el enlace situado más abajo. This message is intended exclusively for its addressee. We only send and receive email on the basis of the terms set out at: http://www.tid.es/ES/PAGINAS/disclaimer.aspx

4 6

Tests failing?
by Marshall Clow 19 Feb '13

19 Feb '13

A bunch of my (String.Algo and Boost.Algo) tests are failing locally, with errors like: darwin.compile.c++ ../../../bin.v2/libs/test/build/darwin-4.2.1/debug/link-static/test_main.o In file included from ../../../libs/test/src/test_main.cpp:16: ../../../boost/test/impl/test_main.ipp: In member function 'void test_main_caller::operator()()': ../../../boost/test/impl/test_main.ipp:39: error: 'BOOST_CHECK' was not declared in this scope "g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -pedantic -g -gdwarf-2 -fexceptions -DBOOST_ALL_NO_LIB=1 -I"../../.." -c -o "../../../bin.v2/libs/test/build/darwin-4.2.1/debug/link-static/test_main.o" "../../../libs/test/src/test_main.cpp" ...failed darwin.compile.c++ ../../../bin.v2/libs/test/build/darwin-4.2.1/debug/link-static/test_main.o... Before I dive into this - is anyone else seeing this? Looking at the test results on the web site, it appears that Boost.Test is broken for several libraries. For example: http://www.boost.org/development/tests/trunk/developer/algorithm.html http://www.boost.org/development/tests/trunk/developer/crc.html http://www.boost.org/development/tests/trunk/developer/geometry.html -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

7 16

Re: [boost] (no subject)
by Vishnu M Menon 19 Feb '13

19 Feb '13

http://www.morguardlogistics.com/ssgd/uc9d53wpgmm.9z7a?nvb0jr11asciq Vishnu M Menon 2/19/2013 6:03:25 PM

1 0

[algorithm] gather.hpp include guard
by Ian Hobson 19 Feb '13

19 Feb '13

Hi, The include guard in boost/algorithm/gather.hpp on SVN is incorrect: #ifndef BOOST_ALGORITHM_GATHER_HPP #define ADOBE_ALGORITHM_GATHER_HPP Best, Ian

2 1

Release Managers: permission to merge small feature to release?
by Marshall Clow 19 Feb '13

19 Feb '13

I have a ticket <https://svn.boost.org/trac/boost/ticket/7652> asking for compile-time checked access to elements of a boost::array. I have implemented a specialization of boost::get (and for c++11, std::get) that does this, and it's been on the trunk and being tested for a couple weeks. This is technically not a bug fix, but new functionality, but I'd like to get it into the next release. So, I'm asking permission to merge to release. The change lists are 82083 (for the functionality), 82084 and 82102 (for the tests), and 82103 (for the docs) Thanks! -- Marshall

5 5

Cannot commit due to "svn:mime_type is not set"
by Christian Henning 18 Feb '13

18 Feb '13

Hi there, I'm trying to commit the gil::io test suite and I get the following errors: Error: Commit failed (details follow): Error: Commit blocked by pre-commit hook (exit code 1) with output: Error: /home/subversion/boost/hooks/check-mime-type.pl: Error: Error: trunk/libs/gil/io/test_images/bmp/readme.txt : svn:mime-type is not set Error: trunk/libs/gil/io/test_images/png/PngSuite/readme.txt : svn:mime-type is not set Error: trunk/libs/gil/io/test_images/pnm/readme.txt : svn:mime-type is not set Error: trunk/libs/gil/io/test_images/raw/readme.txt : svn:mime-type is not set Error: trunk/libs/gil/io/test_images/targa/fileformat.info/readme.txt : svn:mime-type Error: is not set Error: trunk/libs/gil/io/test_images/tiff/graphicmagick/readme.txt : svn:mime-type is Error: not set Error: trunk/libs/gil/io/test_images/tiff/libtiffpic/readme.txt : svn:mime-type is not Error: set Error: Error: Error: Every added file must have the svn:mime-type property set. In Error: addition text files must have the svn:eol-style property set. Error: Error: For binary files try running Error: svn propset svn:mime-type application/octet-stream path/of/file Error: Error: For text files try Error: svn propset svn:mime-type text/plain path/of/file Error: svn propset svn:eol-style native path/of/file Error: Error: You may want to consider uncommenting the auto-props section Error: in your ~/.subversion/config file. Read the Subversion book Error: (http://svnbook.red-bean.com/) Chapter 7, Properties section, Error: Automatic Property Setting subsection for more help. Also, Error: see http://svn.boost.org/trac/boost/wiki/BoostSubversion I'm using Tortoise subversion and in my configuration file I set the mime types as follows: *.txt = svn:eol-style=native;svn:keywords=Author Date Id Rev URL;svn:mime-type=text/plain *.png = svn:mime-type=image/png *.jpg = svn:mime-type=image/jpeg *.bmp = svn:mime-type=image/bmp *.tga = svn:mime-type=image/tga *.tif = svn:mime-type=image/tiff Can someone help out, please. Thanks, Christian

2 2

[type_erasure] Overloading
by Christophe Henry 18 Feb '13

18 Feb '13

Hi Steven, I'm afraid I might need some help again. I try to take as model the example in the doc (http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure…) First problem, it seems that the example has a typo. It will not compile without a :Base in the concept_interface specialization: struct concept_interface< ::foo<T, U,void>, Base, T, Enable> : Base ... Second, the example overload.cpp includes a as_param.hpp which no more exists. But my problem is that I need an overload with 1 and 2 parameters: Test t; any< mpl::vector< foo<_self, int>, foo<_self, int, double>, boost::type_erasure::copy_constructible<> > > x (t); x.foo(1); // calls foo(int) x.foo(1,1.0); // calls foo(int, double) I don't get this to compile, the second foo cannot be found, I suppose the first one hides the second. Thanks in advance, Christophe Here my failed attempt (well, one of them ;-) ): template<class T, class U, class V=void, class Enable=void> struct foo {}; template<class T, class U, class V> struct foo<T,U,V,typename boost::disable_if<boost::is_same<V,void> >::type > { static void apply(T& t, const U& u, const V& v) { t.foo(u,v); } }; template<class T, class U, class V> struct foo<T,U,V,typename boost::enable_if<boost::is_same<V,void> >::type > { static void apply(T& t, const U& u) { t.foo(u); } }; namespace boost { namespace type_erasure { template<class T, class U, class Base, class Enable> struct concept_interface< ::foo<T, U,void>, Base, T, Enable> : Base { typedef void _fun_defined; void foo(typename rebind_any<Base, const U&>::type arg) { call(::foo<T, U, void>(), *this, arg); } }; template<class T, class U, class V, class Base> struct concept_interface< ::foo<T, U,V>, Base, T, typename Base::_fun_defined> : Base { using Base::foo; void foo(typename rebind_any<Base, const U&>::type arg, typename rebind_any<Base, const V&>::type arg2) { call(::foo<T, U,V>(), *this, arg,arg2); } }; } } struct Test { void foo(int) { std::cout << "foo(int) called" << std::endl; } void foo(double) { std::cout << "foo(double) called" << std::endl; } void foo(int,double) { std::cout << "foo(int,double) called" << std::endl; } }; int main() { Test t; any< mpl::vector< foo<_self, int>, foo<_self, int, double>, boost::type_erasure::copy_constructible<> > > x (t); x.foo(1); // calls foo(int) x.foo(1,1.0); // calls foo(int, double) return 0; }

2 2

*BSD detail/endian.hpp header patch looking for review
by Brad Smith 18 Feb '13

18 Feb '13

Hi, There is a patch for the detail/endian.hpp header for *BSD OS's in ticket 6013 that needs review and to be commited. Anyone able to help out here? -- This message has been scanned for viruses and dangerous content by MailScanner, and is believed to be clean.

3 9

Re: [boost] [geometry] Documentation building
by Alexey Kutumov 18 Feb '13

18 Feb '13

> I'm working on CMake'fication of boost libraries, and i 've got issue when > > building documentation of Boost.Geometry. This library uses > doxygen_xml2qbk > > utility for convertiong doxygen XML to quickbook, and this utility uses > > RapidXML for xml processing. I found rapidxml in Boost.PropertyTree > > library, but it is in detail subdirectory and also have different > > namespaces (`boost::property_tree::detail::rapidxml` vs `rapidxml`) > > > > Can i use rapidxml from PropertyTree library, or i must write CMake > script > > for searching rapidxml as thirdparty library? > > Unfortunately they're not interchangeable. PropertyTree has rapidxml in > boost::property_tree::detail namespace and in the "official" release it > is in global namespace. The doxygen_xml2qbk currently assumes that the > "official" one is used. > > Aside from this. During my work on the spatial index library I've > developed an version of this tool which supports additional doxygen > features like paragraphs, warnings, text formatting and automatic > references. You might check it out. It can be found here: > > > http://svn.boost.org/svn/boost/sandbox-branches/geometry/index/doc/src/tool… > > If --output_style alt is passed as a parameter like in > > > http://svn.boost.org/svn/boost/sandbox-branches/geometry/index/doc/make_qbk… > > the alternative qbk is generated for a class or a group. > > The example of a reference which structure is defined here: > > > http://svn.boost.org/svn/boost/sandbox-branches/geometry/index/doc/rtree/re… > > looks like this: > > > http://svn.boost.org/svn/boost/sandbox-branches/geometry/index/doc/html/geo… Thanks for responce, i'll try these changes. I'm not sure whether my sources is up to date, but i made some changes, you can find them here: https://github.com/boost-cmake/geometry/tree/master/doc/src/docutils/tools/… * Added optional parameter with output file (it is needed for CMake script). * Also i fixed issue with brackets in description (added proper escaping).

1 0

[algorithm] adjacent_for_each interest?
by Ian Hobson 18 Feb '13

18 Feb '13

Hi, Is there any interest in a version of for_each that operates on each adjacent pair of elements in a range? #include <iostream> #include <boost/algorithm/adjacent_for_each.hpp> void PrintInts(int a, int b) { std::cout << '(' << a << ", " << b << ")\n"; } int main() { const int ints[] = {0, 1, 2, 3, 4}; boost::algorithm::adjacent_for_each(ints, ints + 5, PrintInts); } Output: (0, 1) (1, 2) (2, 3) (3, 4) Initial implementation available at http://github.com/irh/adjacent_for_each Best, Ian

7 18

[git] Bad superproject.
by Rene Rivera 18 Feb '13

18 Feb '13

In trying to use the new boost git superproject there's a reference to a non-existent subrepo "boostorg/spirit_classic.git". This of course makes it impossible to do a full clone. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

3 4

[Test] Allowing assert to break into debugger
by Alexander Lamaison 18 Feb '13

18 Feb '13

Normally when debugging a program in Visual Studio 2005, the debugger will let the user break the program if it asserts. But when the program in a Boost.Test runner, that doesn't happen. In this thread [1] other people report the same problem but Gennadiy says that it should work. Was this ever fixed? I'm using Boost 1.50. [1] http://boost.2283326.n4.nabble.com/BOOST-ASSERT-any-one-against-improving-d… Thanks, Alex -- Swish - Easy SFTP for Windows Explorer (http://www.swish-sftp.org)

1 0

[Installer] Windows 1.51 installer is broken
by Alexander Lamaison 18 Feb '13

18 Feb '13

I'm not sure who's dealing with this now, but the installer for 1.51 on Windows is broken with multiple File Not Found (404) errors. The sourceforge directory it tries to access seems to not be a real folder. Or at least it appear strangely when browsed: http://sourceforge.net/projects/boost/files/boost-binaries/ Alex -- Swish - Easy SFTP for Windows Explorer (http://www.swish-sftp.org)

1 0

[gil::io] Objections to replace gil::io
by Christian Henning 17 Feb '13

17 Feb '13

I'm ready to replace the old gil:io extension with the new version. Does anyone have any objections? Thanks, Christian

1 0