March 2014 - Boost - lists.preview.boost.org

[git][iostreams] Forking without an established merge point
by Bjorn Reese 31 Mar '14

31 Mar '14

If I look at the develop branch of Boost.Iostreams then GitHub says that "This branch is 253 commits ahead and 91 commits behind master". It appears that Boost.Iostreams has not established a merge point between master and develop as described in: https://svn.boost.org/trac/boost/wiki/PostCvtMergePoint I am trying to fork Boost.Iostreams to create some patches for it. Normally I would need to work off the develop branch (or a branch originating from develop), but if I do so my pull-requests will include the entire commit history of the component. If I look at the network graph of Iostreams, it appears that everybody else branches off the master branch. How do I proceed?

2 2

[GSOC 2014] Boost.Thread / Work-Stealing-Thread-Pool
by Shuxiong Ye 30 Mar '14

30 Mar '14

Hi boost community, My name is Shuxiong Ye, and I am applying GSOC2014. My proposal is here[1]. There are very few comments on it. Any suggestions or questions will be welcome to improve it. Thanks. [1] https://google-melange.appspot.com/gsoc/proposal/review/student/google/gsoc… Shuxiong Ye

2 3

New numeric data type proposal
by Damian Alberto Vicino 30 Mar '14

30 Mar '14

Hi, I work in a simulation tools' research group and we developed a basic data type for handling time representation that we want to share. The data type is kind of a mix between MultiPresicionFloatingPoint and Rational. We are using this kind of data type in concrete simulator implementations because of a theoretic problem with the formalisms we implement, in which the floating point error can not be bounded. We published a paper in Simutools14 a few days ago explaining how this unbound errors are reached under a specific formalism (DEVS) and why they are not easy to detect. I can share the paper if someone interested in the details, or provide some toy examples to discuss. And we are working in showing same kind of errors in other formalisms. A simplified version of the proposed data type is: Number<N, D, M, E> where in the common case the four are some integer-like type. The number can be interpreted as N/D * M * 2^E where N and D are never modified unless required for operation of compatibility. Compatibility operation is called when an operation between 2 numbers having different N/D happens. It can also be thought as a variable radix MPFP. We choose this implementation because when used as replacement of integer or float, it doesn’t decrease significantly the performance. It only decrease significantly when operating with values that were not representable in any of those (if we simplify N/D). I will love to discuss implementation details, alternative ideas to handle the problem (this one worked for us, but sure there is other options too that may be more generic or performant in generic scenarios). Also, I’m up to code the whole thing, and to share the naive implementation we got in our simulator so far to start the discussion. Best regards, Damian Vicino

3 11

[spirit] How to detect Spirit.Qi expressions?
by Andrey Semashev 30 Mar '14

30 Mar '14

Hi, Is there a way to detect at compile time that a certain type is a Boost.Spirit.Qi parser? That includes template expressions and grammars. Basically, I want to detect if qi::parse(b, e, expr) would be a sensible thing to do. I tried this: boost::is_same< typename proto::domain_of< ExpressionT >::type, spirit::qi::domain > But domain_of returns default_domain for Boost.Spirit.Qi template expressions.

2 2

Getting fully uptodate
by Paul A. Bristow 29 Mar '14

29 Mar '14

Sync SHA-1: 44d48257a7eb39837880afb81ceb2153e86e5a8c * Changed Boost.Log to Boost.Sync in the supported compilers section. Fixes #9388. Current HEAD detached, you are working on (no branch). Do you want to create branch now? Chose "no" [detached HEAD 3a9d142] deletions 37 files changed, 4971 deletions(-) delete mode 100644 include/boost/sync/condition_variables/condition_variable.hpp delete mode 100644 include/boost/sync/condition_variables/cv_status.hpp delete mode 100644 include/boost/sync/condition_variables/notify_all_at_thread_exit.hpp delete mode 100644 include/boost/sync/detail/condition_variables/basic_condition_variable_windows.h pp delete mode 100644 include/boost/sync/detail/condition_variables/condition_variable_posix.hpp delete mode 100644 include/boost/sync/detail/condition_variables/condition_variable_windows.hpp delete mode 100644 include/boost/sync/detail/config.hpp delete mode 100644 include/boost/sync/detail/footer.hpp delete mode 100644 include/boost/sync/detail/header.hpp delete mode 100644 include/boost/sync/detail/interlocked.hpp delete mode 100644 include/boost/sync/detail/link_config.hpp delete mode 100644 include/boost/sync/detail/mutexes/basic_mutex_windows.hpp delete mode 100644 include/boost/sync/detail/mutexes/mutex_posix.hpp delete mode 100644 include/boost/sync/detail/mutexes/mutex_windows.hpp delete mode 100644 include/boost/sync/detail/pthread.hpp delete mode 100644 include/boost/sync/detail/system_error.hpp delete mode 100644 include/boost/sync/detail/throw_exception.hpp delete mode 100644 include/boost/sync/detail/time_traits.hpp delete mode 100644 include/boost/sync/detail/time_units.hpp delete mode 100644 include/boost/sync/detail/tss.hpp delete mode 100644 include/boost/sync/detail/waitable_timer.hpp delete mode 100644 include/boost/sync/detail/weak_linkage.hpp delete mode 100644 include/boost/sync/exceptions/lock_error.hpp delete mode 100644 include/boost/sync/exceptions/resource_error.hpp delete mode 100644 include/boost/sync/exceptions/runtime_exception.hpp delete mode 100644 include/boost/sync/exceptions/wait_error.hpp delete mode 100644 include/boost/sync/locks/lock_guard.hpp delete mode 100644 include/boost/sync/locks/lock_guard_fwd.hpp delete mode 100644 include/boost/sync/locks/lock_options.hpp delete mode 100644 include/boost/sync/locks/shared_lock.hpp delete mode 100644 include/boost/sync/locks/shared_lock_fwd.hpp delete mode 100644 include/boost/sync/locks/unique_lock.hpp delete mode 100644 include/boost/sync/locks/unique_lock_fwd.hpp delete mode 100644 include/boost/sync/locks/upgrade_lock.hpp delete mode 100644 include/boost/sync/locks/upgrade_lock_fwd.hpp delete mode 100644 include/boost/sync/mutexes/mutex.hpp delete mode 100644 include/boost/sync/traits/is_condition_variable_compatible.hpp Success (78 ms @ 29-Mar-14 15:49:53) All appears OK, I:\modular-boost\libs\sync>git status HEAD detached from 44d4825 nothing to commit, working directory clean but the Tortoise GIT folder icon for /libs/sync is still red (Red ! icon means "modified"?) so I have committed to develop and it is still red :-( Fumbling, I have tried a git.exe submodule update --init -- "libs/sync" No submodule mapping found in .gitmodules for path 'libs/sync' git did not exit cleanly (exit code 1) (875 ms @ 29-Mar-14 17:09:10) Suggestions as to what I am misunderstanding/doing wrong to get develop branch to a fully uptodate state? Paul PS I have a similar problem with /tools/regression/build where there appear to be no modifications and nothing to revert, but the build folder icon is red, leaving me uneasy that a red face will follow ;-) I've added the build vcide folder items and committed and finally the icon is green. This doesn't feel something that I should have to do in order to get uptodate... so I must be missing something. It would be quicker to clone from scratch! Paul A. Bristow Prizet Farmhouse Kendal UK LA8 8AB +44 01539 561830 07714330204

2 2

Post-git forking process
by Sohail Somani 29 Mar '14

29 Mar '14

Hey all, Often, I find bugs in Boost that I need to patch manually before the next release. What I used to do before was keep a copy of Boost in my source tree which made this easier: just patch it directly. This made it easy to modify, but annoying to post patches and honestly, they just got lost most of the time. With Git, it should become easier to contribute said patches as well as pull in whichever particular changes I need. However when I attempted such a fork recently, I was a bit lost. As I understood it, the process should have been: 1. Create a fork of https://github.com/boostorg/boost and use this fork in my project 2. Create a fork of the library/libraries I wanted to patch 3. Update the submodules in my boostorg/boost fork to point to my forked libraries 4. Post a pull request for the respective libraries. Once the changes have been accepted, point back to the official boostorg repo I failed terribly, no doubt due to PEBKAC. Is there a chance that someone could write a tutorial or a how-to guide for the recommended process of forking Boost with Git? The main thing I need is the ability to have a patched version of Boost that I can use while the patches are being reviewed/accepted/rejected. Thanks, Sohail

6 20

[variant] assign and access the assigned value simultaneously
by feverzsj 28 Mar '14

28 Mar '14

hi list, for common case: boost::variant<Val,...> var; var = val; Val& v = boost::get<Val>(var); why not supply a interface like: Val& v = var.assign(val); for simplity, and the unnecessary "get" is also elimited. regards -- View this message in context: http://boost.2283326.n4.nabble.com/variant-assign-and-access-the-assigned-v… Sent from the Boost - Dev mailing list archive at Nabble.com.

5 5

1.56 release
by Barend Gehrels 27 Mar '14

27 Mar '14

Hi, The last message about the release schedule was (if I see it correctly) at January 15, and the calendar is empty. Is there more news about the release planning? I'm especially interested in the planning for the 1.56 release. Thanks, Barend Gehrels

9 16

[Parallel Algorithms] Queries regarding the Boost. Thread / Parallel Algorithms
by Naveen 27 Mar '14

27 Mar '14

Hi, I am look into various available reduction algorithms available to make a performance comparison for boost threads. I made a decent search on all the documents available for various reduction algorithms. If there are any specific implementations, please share the details. Regards, *NAVEEN* | Mobile: 832-720-2393 | about.me <http://about.me/naveen.namashivayam> |

1 0

Creating a new(-ish) library in modular boost ?
by Paul A. Bristow 26 Mar '14

26 Mar '14

I have fumbled (and stumbled) trying to create a revised-possibly-to-be-proposed for Boost library in the new modular boost format. So far I have created a folder /modular-boost/svg_plot And copied all the files into it in the new modular format and got the library working OK (compiling, tests, examples, docs etc). Then I created my repository by doing I:\modular-boost\libs>git init svg_plot Initialized empty Git repository in I:/modular-boost/libs/svg_plot/.git/ Then I GIT Added various files, and committed these to my repository. (Should I have pushed?) I tried to tell git to ignore some files like log files, etc (but I don't get a .gitignore file when I think I should - the Tortoise GIT window has various options like .gitignore in the repos root, but no 'OK' button, just a close??? I have a .gitignore at /modular-boot/ but it does not contain the files to ignore (and I would not expect it to). I've set the GITHub default storage directory to \modular-boost\libs but a scan for repos only find modular-boost I went to my GITHUB page and followed the invitation to drag the svg_plot repository onto the page. Some files are listed (but ones I want to ignore) and then all options are unresponsive or greyed out and eventually GITHUB hangs and then crashes :-( So both GIT and I are confused ! Can anyone suggest what sequence of actions I should take to set this up? Thanks Paul Paul A. Bristow Prizet Farmhouse Kendal UK LA8 8AB +44 01539 561830 07714330204

2 2

[range] Proposal: addition of front(), back(), at(), operator[]
by Adam Wulkiewicz 26 Mar '14

26 Mar '14

Hi, I propose to add the functions described below to the Boost.Range. I found the use of those very convenient WRT the corresponding use of begin() and end(), and a lot more readable. 1. front() returning the reference to the first element precondition (assert): !empty(rng) return *begin(rng); 2. back() returning the reference to the last element precondition (assert): !empty(rng) For BidirectionalRange return *(--end(rng)); For SinglePassRange it could iterate over the range and return the reference to the last element 3. at() returning the reference to the i-th element of the range precondition (throw std::out_of_range or assert): index < size(rng) For RandomAccessRange return *(begin(rng) + index); For SinglePassRange it could iterate over the range and return the required element For me, non-throwing at() would be more useful however this behavior won't be intuitive. So the following should also be provided: 4. sub(), subscript(), el(), element(), at_index(), at_(), index(), indexed(), access(), operator[], ...? the implementation of indexing operator[] same as 3 but instead of throwing an assert would be used The use of operator[] could be similar to this: { using boost::range::subscript_operator; rng[index]; } So not very convenient. But maybe you have a better idea? Regards, Adam

6 14

Re: [boost] [Parallel Algorithms] Queries regarding the Boost.Thread / Parallel algorithms
by Naveen 26 Mar '14

26 Mar '14

Hi, In my previous mail, I was speaking about the compiler optimization dependencies while creating a parallel version of the following code: DO J = 1, 100 DO I = 1, 100 DO K = 1, 100 C(I,J) = C(I,J) + A(I,K) * B(K,J) END DO END DO END DO As you know, the above code is the 2D-Matrix multiplication logic. I tested the above logic using various compiler optimization levels from -o0, -o1, -o2 and -o3. There were no problems due to the compiler optimizations. I have used pthreads to convert the serial code to its parallel version. Initially, the serial version took 72sec to execute and the parallel version with 4 threads took around 16sec. Please have a look at the attachment for the complete working source code. The question now is, I have used the threads as shown in the pseudo code below: int main() { create_pthreads(assign_thread_ID, call the function); join_threads(thread_ID); destroy_threads(); } function_called_by_each_thread(thread_ID) { all_computations; } All thread documentation reaches to some sort of options like this. Is this the correct way to approach the problem for creating parallel algorithms for boost threads. Please clarify, whether there are any alternative approaches available to achieve parallelism using threads. PS: Please have a look at the code for further details Regards, *NAVEEN* | Mobile: 832-720-2393 | about.me <http://about.me/naveen.namashivayam> |

2 1

Re: [boost] [Parallel Algorithms] Queries regarding the Boost.Thread / Parallel algorithms
by Naveen 26 Mar '14

26 Mar '14

Hi, Based on understanding the proposal, I'm just curious to know how we are gonna use the compiler optimizations when creating the parallel_xxx functions. Say any normal loop would be optimized by the compiler using any of the loop transformations like loop interchange, loop unrolling, loop fusion etc., let us consider a sample FORTRAN code to : DO J = 1, 100 DO I = 1, 100 DO K = 1, 100 C(I,J) = C(I,J) + A(I,K) * B(K,J) END DO END DO END DO which may or may not be optimized by the compiler into something like this DO K = 1, 100 DO I = 1, 100 DO J = 1, 100 C(I,J) = C(I,J) + A(I,K) * B(K,J) END DO END DO END DO so, when we try to introduce our parallel algorithm in to the loop containing J, it may be interchanged depending upon the compiler properties. So, should we plan for such scenarios. When we try to introduce our parallel functions the only way possible is to make the compiler optimizations temporarily inactive on those tasks. But, by doing so the performance of the application will be affected. Should we really tackle this scenario or am i looking into a completely irrelevant picture? Regards, *NAVEEN* | Mobile: 832-720-2393 | about.me <http://about.me/naveen.namashivayam> |

3 2

[bind] BOOST_BIND_NO_PLACEHOLDERS and unspecified-placeholder-type's
by Joaquín Mª López Muñoz 25 Mar '14

25 Mar '14

Hello, The non-documented BOOST_BIND_NO_PLACEHOLDERS macro suppresses the definition of (anonymous namespace)::_1, (anonymous namespace)::_2, etc., presumably to cope with potential clashes with other libs' placeholders such as Boost.Lambda's when in the presence of using directives. The problem with this is that using Boost.Bind without placeholder names requires writing code such as bind(f,boost::arg<1>(),boost::arg<2>()); but boost::arg<> is not documented!! (in fact, Boost.Bind synopsis explicitly defines _1, _2 etc. as having undocumented types unspecified-placeholder-type-1, unspecified-placeholder-type-2 and so on). Maybe Boost.Bind documentation can be changed so that BOOST_BIND_NO_PLACEHOLDERS and boost::arg<> are documented? 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 5

[ANN] CppCon 2014 Call for Submissions
by Boris Kolpackov 25 Mar '14

25 Mar '14

Hi, CppCon is the annual, week-long face-to-face gathering for the entire C++ community. The conference is organized by the C++ community for the community and so we invite you to present. Have you learned something interesting about C++, maybe a new technique possible in C++11? Or perhaps you have implemented something cool related to C++, maybe a new C++ library? If so, consider sharing it with other C++ enthusiasts by giving a talk at CppCon 2014. Submissions deadline is May 15 with decisions sent by June 13. For topic ideas, possible formats, and submission instructions, see the Submissions page: http://cppcon.org/submissions/ Hope to hear you speak! Boris

1 0

[Fusion] Can repetitive_view support "at" function?
by TONGARI J 25 Mar '14

25 Mar '14

I know it's a bit weird for asking repetitive_view which cannot model BidirectionalSequence to support the functionality of RandomAccessSequence, but it seems quite reasonable to support "at" when the underlying sequence models RandomAccessSequence even though repetitive_view cannot model RandomAccessSequence itself. Thoughts?

2 2

[algorithm] Test failure in C++14
by Ben Pope 25 Mar '14

25 Mar '14

"clang++-3.4" -c -x c++ -std=c++1y -stdlib=libc++ -O0 -g -fno-inline -Wall -g -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_TEST_DYN_LINK=1 -DBOOST_TEST_NO_AUTO_LINK=1 -I".." -o "/home/ben/development/boost/test/build/results/boost/bin.v2/libs/algorithm/test/is_permutation_test1.test/clang-linux-3.4~c14_libc++/debug/is_permutation_test1.o" "../libs/algorithm/test/is_permutation_test1.cpp" In file included from ../libs/algorithm/test/is_permutation_test1.cpp:13: ../boost/algorithm/cxx11/is_permutation.hpp:178:6: error: declaration conflicts with target of using declaration already in scope bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, ^ /usr/include/c++/v1/algorithm:1374:1: note: target of using declaration is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, ^ ../boost/algorithm/cxx11/is_permutation.hpp:104:12: note: using declaration using std::is_permutation; // Section 25.2.12 ^ ../boost/algorithm/cxx11/is_permutation.hpp:205:6: error: declaration conflicts with target of using declaration already in scope bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, ^ /usr/include/c++/v1/algorithm:1361:1: note: target of using declaration is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, ^ ../boost/algorithm/cxx11/is_permutation.hpp:104:12: note: using declaration using std::is_permutation; // Section 25.2.12 ^ 2 errors generated. I haven't looked in detail, but it looks like those two overloads were added in C++14 and need guarding with a suitable #if __cplusplus >= C++1Y_version_here Ben

3 5

[GSoC 14] Request community to rank proposals
by Niall Douglas 24 Mar '14

24 Mar '14

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

1 0

[build][testing] Auto-generated tests not present in reports
by Andrey Semashev 24 Mar '14

24 Mar '14

Hi, Recently I added auto-generation of compile tests which basically check that every Boost.Log public header is self-contained (i.e. can be included on its own, does not have any missing includes etc.) This is done in the test/Jamfile.v2 as follows: rule test_all { local all_rules = ; local file ; local headers_path = [ path.make $(BOOST_ROOT)/libs/log/include/boost/log ] ; for file in [ path.glob-tree $(headers_path) : *.hpp ] { local rel_file = [ path.relative-to $(headers_path) $(file) ] ; if ! [ MATCH "detail/(.*)" : $(rel_file) ] { #ECHO $(rel_file) ; all_rules += [ compile compile/self_contained_header.cpp : <define>"BOOST_LOG_TEST_HEADER=$(rel_file)" : self_contained_header/$(rel_file) ] ; } } ... other test targets are also generated here return $(all_rules) ; } This rule also generates targets for other tests, including compile tests. It works locally, I can see the generated tests for all headers being compiled. However, I made this change quite some time ago but still I don't see these tests in the test reports table. I can see other tests which are generated by the same test_all rule, so it works. What could be the problem? Any ideas? Thanks.

2 3

[Boost][Range] Non-mutating algorithm on non const qualified range
by Albert Yiamakis 24 Mar '14

24 Mar '14

Hello, In the users mailing list I have remarked that this piece of code: https://gist.github.com/Kojirion/9714131 will fail to compile, without providing 'mutable' iterators. I have since found out it will also compile by simply const qualifying the dummy object. (ie const Dummy dummy;) The reason is that without it this: is_const<Dummy> gets evaluated to false, resulting in boost::mpl::eval_if_c<false, boost::range_const_iterator<Dummy>, boost::range_mutable_iterator<Dummy> > Surely this is not intended behavior and it should be possible to use a range that has only const iterators in a non-mutating algorithm without const qualifying it? Albert

2 1

[GSoC 2014] Boost.Binaries Proposal (was " Boost.Binaries")
by Antony Polukhin 23 Mar '14

23 Mar '14

2014-03-21 16:31 GMT+04:00 Flavius Condrea <flavius.condrea(a)gmail.com>: > Hi everyone, > > I am very excited to have the opportunity to contribute to Boost C++ > Libraries. This is my proposal for GSoC 2014: > > https://docs.google.com/file/d/0B93eH9bi8ER0UHQtdDdFNFNoRGc/edit > I'd like to mention that Flavius Condrea has successfully done the test task for that that project and has shown a good knowledge of a problem domain. I've already recommended to make optional the "implement specific encrypt/decrypt algo" part of proposal, put more efforts into work with binaries and thinking of additional functionality. I have enough free time to mentor student during this GSOC. I wish to mentor this project if there'll be no objections. Any ideas,comments and additions to proposal are welcomed. -- Best regards, Antony Polukhin

3 2

[config] std::regex unusable on gcc?
by Andrey Semashev 23 Mar '14

23 Mar '14

Hi, I'm trying to use std::regex and it's failing with even the simplest patterns: #include <regex> int main(int, char* argv[]) { std::regex rex("\\d"); return std::regex_match("1", rex); } g++ -std=c++11 rex_test.cpp -o rex_test ./rex_test terminate called after throwing an instance of 'std::regex_error' what(): regex_error Aborted (core dumped) GCC version: gcc version 4.8.1 (Ubuntu/Linaro 4.8.1-10ubuntu9). GCC 4.7.3 exhibits the same behavior. Replacing "\\d" pattern with "[0-9]" results in the same failure. It works with Boost.Regex, Boost.Xpressive and with clang 3.4 & libc++. Am I doing something wrong? If my use of std::regex is correct then for me this basically means that std::regex is unusable. In this case, could we define BOOST_NO_CXX11_HDR_REGEX in Boost.Config for all versions of libstdc++?

3 3

[algorithm] How to contribute?
by Maciej Poleski 23 Mar '14

23 Mar '14

Hello I want to spend some time working on Boost. I saw this: https://svn.boost.org/trac/boost/wiki/SoC2014#Algorithms. I have some "algorithms and data structures" knowledge and I think about implementing something that would be valuable to Boost users and give me opportunity to dig a bit into Boost. I think about something simple to start with (like Radix sort). If everything go ok, I will try something more complex (parallel algorithms?). Let me know if this piece of work would make sense. Feel free to give another propositions if something different is more important. Maciej Poleski

2 1

[GSoC 2014] Boost.Fixed-Point Proposal
by Nikhar Agrawal 22 Mar '14

22 Mar '14

Hello everyone, Kindly find my proposal for Boost.Fixed-Point on the following link. http://www.google-melange.com/gsoc/proposal/review/student/google/gsoc2014/… I have been in touch with the potential mentors of this project for quite some time now. The proposal is a result of my discussions with them. Do let me know what you think of it. Any feedback would be invaluable. If there are any visibility issues, kindly let me know. Thank you. Nikhar

6 10

Boost.Binaries
by Flavius Condrea 21 Mar '14

21 Mar '14

Hi everyone, I am very excited to have the opportunity to contribute to Boost C++ Libraries. This is my proposal for GSoC 2014: https://docs.google.com/file/d/0B93eH9bi8ER0UHQtdDdFNFNoRGc/edit Best regards, Flavius Condrea

1 0