January 2015 - Boost - lists.preview.boost.org

A GUI Library
by jinhao 09 Nov '17

09 Nov '17

Hi, all I am developing a GUI library, it takes aim at easy-to-use and portable library for modern C++ methods. The project at http://stdex.sourceforge.net A git repository at http://nanapro.codeplex.com A brief at http://nanaproject.wordpress.com/2011/12/16/preliminary-study-of-nana-c-lib… Is there any interest in this library? Regards Jinhao

8 8

Re: [boost] Boost CRC maintainer (Daryle Walker) missing in action?
by Olaf van der Spek 19 Jun '17

19 Jun '17

Hi Daryle, Any luck on your new setup? Gr, Olaf On Mon, Nov 28, 2011 at 1:11 AM, Daryle Walker <darylew(a)gmail.com> wrote: > I can look at it once I've finished my new setup. > > I had to reset my computer after a partial crash years ago. I never > got around to recreating my programming setup. My computer had been > at its maximum Operating System level back then, which is now 3 > versions behind. For the past few months, I've had my sister's old > laptop, with Windows Vista, and am trying to add a programming setup > to it now. > > > On Tue, Nov 22, 2011 at 7:18 AM, Beman Dawes <bdawes(a)acm.org> wrote: >> Hi Daryle, >> >> This guy has volunteered to take over maintenance of Boost CRC. Should >> we take him up on his offer? > >> ---------- Forwarded message ---------- >> From: >> Date: Wed, Nov 2, 2011 at 7:51 AM >> Subject: [boost] Boost CRC maintainer (Daryle Walker) missing in action? >> To: boost(a)lists.boost.org >> >> >> Hi, >> >> It looks like the Boost CRC maintainer (Daryle Walker) is missing in action? >> >> No response to tickets from the past 3 years. What's the procedure in this case? >> >> https://svn.boost.org/trac/boost/ticket/2492 >> https://svn.boost.org/trac/boost/query?component=crc&col=id&col=summary&col… > > -- > Daryle Walker > Mac, Internet, and Video Game Junkie > darylew AT gmail DOT com -- Olaf

2 2

bad include guards
by Steven Watanabe 26 Jan '17

26 Jan '17

AMDG The following pairs of files have identical include guards ./boost/concept_check/general.hpp ./boost/concept/detail/msvc.hpp ./boost/concept_check/msvc.hpp ./boost/concept/detail/msvc.hpp ./boost/filesystem/cerrno.hpp ./boost/cerrno.hpp ./boost/interprocess/containers/tree.hpp ./boost/interprocess/containers/detail/tree.hpp ./boost/mpl/min_max.hpp ./boost/mpl/max.hpp ./boost/mpl/vector/aux_/front.hpp ./boost/mpl/list/aux_/front.hpp ./boost/multi_index/identity_fwd.hpp ./boost/multi_index/identity.hpp ./boost/python/pointee.hpp ./boost/python/detail/pointee.hpp ./boost/spirit/phoenix/closures.hpp ./boost/lambda/closures.hpp ./boost/xpressive/proto/v1_/proto_typeof.hpp ./boost/xpressive/proto/proto_typeof.hpp ./libs/config/test/boost_no_dep_nested_class.ipp ./libs/config/test/boost_has_vc6_mem_templ.ipp ./libs/config/test/boost_no_mem_templates.ipp ./libs/config/test/boost_has_vc6_mem_templ.ipp ./libs/config/test/boost_no_std_allocator.ipp ./libs/config/test/boost_has_vc6_mem_templ.ipp ./libs/conversion/test.hpp ./libs/any/test.hpp ./libs/interprocess/example/print_container.hpp ./libs/interprocess/example/printcontainer.hpp ./libs/interprocess/test/expand_bwd_test_template.hpp ./libs/interprocess/test/allocation_test_template.hpp ./libs/interprocess/test/printcontainer.hpp ./libs/interprocess/example/printcontainer.hpp ./libs/interprocess/test/print_container.hpp ./libs/interprocess/example/printcontainer.hpp ./libs/iostreams/test/detail/utf8_codecvt_facet.hpp ./boost/detail/utf8_codecvt_facet.hpp ./libs/regex/test/regress/test_regex_search.hpp ./libs/regex/test/regress/test_partial_match.hpp ./libs/serialization/test/C.hpp ./libs/serialization/test/A.hpp ./libs/xpressive/perf/regex_comparison.hpp ./libs/regex/performance/regex_comparison.hpp ./tools/inspect/time_string.hpp ./tools/common/time_string.hpp In Christ, Steven Watanabe

5 8

[multiprecision] uses boost::math::gcd without including the header
by Peter Dimov 04 Jan '16

04 Jan '16

include/boost/multiprecision/cpp_int/misc.hpp uses boost::math::gcd (and lcm), but does not include common_factor_rt.hpp.

2 2

[variant] Opinion on boost::safe_get<> and default boost::get<> behavior
by Antony Polukhin 18 Dec '15

18 Dec '15

Hi all, I'm in doubt and would like to hear opinions on the following issue. boost::get for boost::variant was not making any compile time checks, resulting in runtime errors where a compile time error must be: boost::variant<int, string> v(100); boost::get<bool>(&v); // returns NULL instead of compile time error boost::get<bool>(v); // throws exception on runtime instead of compile time error Now we have an implementation of compile time checked get in a separate branch at git: boost::variant<int, string> v(100); boost::safe_get<bool>(&v); // compile time error boost::safe_get<bool>(v); // compile time error boost::unsafe_get<bool>(&v); // returns NULL instead of compile time error boost::unsafe_get<bool>(v); // throws exception on runtime instead of compile time error I'm in doubt, what the default behavior of boost::get must be: * safe_get behavior is much closer to Standard Library behavior (just like std::get for tuples) and allows to avoid errors in user code * unsafe_get behavior is same as behavior of old boost::get and won't break user's code if boost::get is used in some generic contexs What's your opinion? -- Best regards, Antony Polukhin

10 13

[context] msvc /SAFESEH
by Jeff Flinn 12 Aug '15

12 Aug '15

I need to build my application with /SAFESEH which uses boost coroutine which uses context. I'm getting the following link errors: 1>libboost_context-vc100-mt-gd-1_53.lib(jump_i386_ms_pe_masm.obj) : error LNK2026: module unsafe for SAFESEH image. 1>libboost_context-vc100-mt-gd-1_53.lib(make_i386_ms_pe_masm.obj) : error LNK2026: module unsafe for SAFESEH image. I've built boost static libs with the same MSVC vesion and options (sans /SAFESEH as it's not a compile/lib option) Compiler/linker versions: Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 16.00.40219.01 for 80x86 Microsoft (R) Incremental Linker Version 10.00.40219.01 Has anyone run into this and resolved the error? Any insight is appreciated. Thanks, Jeff

3 9

Arguing about names in Boost libraries
by Edward Diener 06 May '15

06 May '15

What is wrong with the people commenting on libraries for Boost who are so concerned about the names being used ? We are talking only about C++ identifiers and yet there are now endless discussions where people disagree on names or argue that some name is not what they want or that they like some other name, with a list of names that they find adequate. This is irrelevant. There is something mentally wrong about all those peoples spending endless amounts of time around this issue. I notice this does not happen nowadays for just one library but for ever single library, or proposed library, which is mentioned on this mailing list. Is this the way all of you people actually work in your daily jobs, or on your own projects, spending hours and days arguing with others about C++ identifiers for every little thing ? Are you not aware of the absurdity of your endless remarks ? Grow up ! Surely there are better things to do than carry on endlessly about some name, that is should be x or y or z or some other inane preferable list. It's time for somebody to say this, so I will do it. A C++ identifier name, as long as it is vaguely about what the functionality entails, is perfectly adequate. It does not have to satisfy everyone in the universe. Period !

9 10

Latest dependency report
by Peter Dimov 25 Apr '15

25 Apr '15

... generated from the develop branch: http://www.pdimov.com/tmp/report-develop-c3bb6eb/module-overview.html http://www.pdimov.com/tmp/report-develop-c3bb6eb/module-levels.html http://www.pdimov.com/tmp/report-develop-c3bb6eb/module-weights.html

2 2

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

31 Mar '15

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

12 55

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

26 Mar '15

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

5 20

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

23 Mar '15

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

5 6

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

23 Mar '15

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

15 19

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

18 Mar '15

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

24 77

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

07 Mar '15

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

2 1

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

05 Mar '15

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

3 6

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

01 Mar '15

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

4 6

[filesystem] temp_directory_path() behavior on Windows
by Beman Dawes 19 Feb '15

19 Feb '15

temp_directory_path() on Windows is currently implemented by calling the Windows API GetTempPath() function. Ticket https://svn.boost.org/trac/boost/ticket/5300 points out that GetTempPath() does not work as expected for environmental variables longer than roughly 130 characters. I've added a test to Boost.Filesystem that verifies that boost::filesystem::temp_directory() is affected. The suggested fix is to use GetEnvironmentVariable to in effect implement GetTempPath() the way we would like it to work. That makes sense to me, so I looked up the specs for GetTempPath(): The GetTempPath function checks for the existence of environment variables in the following order and uses the first path found: 1. The path specified by the TMP environment variable. 2. The path specified by the TEMP environment variable. 3. The path specified by the USERPROFILE environment variable. 4. The Windows directory. (4) Makes me queasy. I suspect it will fail anyhow because of permissions errors, but I would prefer to have temp_directory_path() report an error if 1, 2, and 3 are not present. temp_directory_path() already reports an error if a path is found but it is not a directory. OTOH, excluding the Windows directory is a breaking change for anyone currently depending on that behavior, so I thought it best to ask for comments before charging ahead. Thoughts? --Beman

8 39

[Review] Boost.Endian mini-review
by Joel FALCOU 18 Feb '15

18 Feb '15

The mini-review of Boost.Endian starts today and runs through Sunday, February 1. The library repository is available on GitHub at https://github.com/boostorg/endian The docs for the library can be viewed online at https://boostorg.github.io/endian/ The objective of the mini-review is to verify that the issues raised during the formal review have been addressed. Those issues are documented at https://boostorg.github.io/endian/mini_review_topics.html which also describes the resolution of each issue. Comments and suggestions unrelated to the mini-review issues are also welcome, but the key question the review manager needs your opinion on is this: Is the library ready to be added to Boost releases? -- Joel Falcou, Endian Review Manager

16 57

[gsoc15] Attn: We need 2015 mentors and project ideas for Boost!
by Niall Douglas 12 Feb '15

12 Feb '15

Dear Boost community, We are now within one month of the beginning of Google Summer of Code 2015! Last year's GSoC furthered the continuing success of the Boost GSoC programme with the first ever Boost funded extension to a GSoC project (that being Boost.Hana by Louis Dionne mentored by Joel Falcou, congrats to both of them on passing an exceptionally tough selection process), and over $50,000 of Google funding brought to Boost in 2014. We also sent three representatives to last year's mentor summit, including one student whose entire expenses the Boost Steering Committee very generously covered. As part of filling in our application for 2015, we must supply to Google a list of potential GSoC mentors and potential GSoC projects for summer 2015. There are a number of changes to how we design project ideas for students this year intended to improve the GSoC experience for both students and mentors, so please examine the ideas page which outlines those changes at https://svn.boost.org/trac/boost/wiki/SoC2015 and if you have any questions or concerns about those changes, please ask now rather than just before the GSoC deadline. If you think yourself able to mentor a student doing some work on Boost this summer, *please* consider adding a description of the proposed work item and your name to the list. Last year we acquired eight slots from Google and had to disappoint two mentors and students, we hope with the improved selection process we can get back to the ten annual slots we once had. If you want to know more about mentoring a Google Summer of Code funded student work before you nominate yourself, please feel free to ask on the main Boost developers mailing list boost(a)lists.boost.org. Thank you in advance for your time. Niall Douglas (Boost Google Summer of Code admin) Boris Schäling (Boost Google Summer of Code admin) --- Boost C++ Libraries Google Summer of Code 2014 admin https://svn.boost.org/trac/boost/wiki/SoC2014

7 19

[voronoi] Issue with boost::polygon::voronoi_diagram<> as class variable
by duke 08 Feb '15

08 Feb '15

For some reason when I have a voronoi_diagram as a class variable (which it needs to be in this case), I get this error on compile: Error 49 error C2248: 'boost::polygon::voronoi_diagram<T>::operator =' : cannot access private member declared in class 'boost::polygon::voronoi_diagram<T>' I'm new to C# so it may be something obvious. - George

2 1

[new libraries] [sort] New Library Check list updated
by Beman Dawes 07 Feb '15

07 Feb '15

As we started through the process of adding the sort library as a module, it became obvious the docs for how to do this were quite out-of-date. The best document for adding new libraries is https://svn.boost.org/trac/boost/wiki/ReleasePractices/ManagerCheckList#New…, and that section has now been updated. Although this document is written from the perspective of release managers, the New Library Checklist section serves as a roadmap for what is expected as a new library goes through the stages of being added to a Boost distribution. Comments and corrections welcome, --Beman

5 6

boost interval arithmetic
by Павел Кудан 05 Feb '15

05 Feb '15

The difference in behaviour of comparison operators and basic arithmetic operators looks as probable misconception. Default and changeable behaviour of comparison operators consists in throwing exception in intermediate situation (intersecting intervals, ! (a>b) == (a <= b) is not applicable). Great decision for correct migration from float numeric code. The only and unchangeable behaviour of arithmetic operators consists in silent returning only one of possible intervals in intermediate situation (possible return is not single, multiple interval result). The source of mistakes and undesired behaviour at migration from float numeric. At least, throwing exception by arithmetic operators at intermediate situation would provide behaviour unity of comparison and arithmetic operators and functions. Best regards, Pavel Coodan

7 51

Boost regression testing on Android
by Dmitry Moskalchuk 04 Feb '15

04 Feb '15

Hi all, We've just published CrystaX NDK 10.1 (https://www.crystax.net/android/ndk) which is a drop-in replacement for the Google's Android NDK, and we've included prebuilt Boost 1.57.0 libraries there, to make life easier for those developers who want to use Boost on Android. The reason I write here is that in CrystaX NDK we were able to build Boost for Android without any changes in Boost sources, just because CrystaX NDK makes Android much more POSIX-conformant than original Android is, and Boost just works on top of it. If you're interested how we did it, please read description of CrystaX NDK release on https://www.crystax.net/android/ndk. Another important point is that we were able to run Boost regression tests on Android devices - again, without any changes in Boost sources, just providing own 'adbrunner' script as tests launcher. The only thing needed is to plug one or more Android devices to USB ports and/or run one or more Android emulators and then run script for Boost testing provided by CrystaX NDK. As long as those devices/emulators are available by ADB, Boost regressions tests will run on all of them. As far as I know, Boost is not yet officially supported on Android platform, mainly because of lack of regular regression testing procedure. I wonder if someone would be interested in our results and, if yes, would he/she like to participate in further Boost-on-Android improvements? -- Dmitry Moskalchuk

3 6

[mixin] Library name
by Borislav Stanimirov 04 Feb '15

04 Feb '15

To those unfamiliar with the Boost.Mixin - it is a new library submitted for review. The docs are here: http://ibob.github.io/boost.mixin/index.html The code is here: https://github.com/iboB/boost.mixin It has been suggested multiple times that perhaps the name "mixin" isn't appropriate, so I was wondering if I can find a better one. The current name, mixin, is, as the library itself, inspired by the mixins in the Ruby programming language. However, it doesn't do exactly what Ruby's mixins do (as mentioned here: http://ibob.github.io/boost.mixin/boost_mixin/introduction.html#boost_mixin… ) My current alternative ideas are: * EntityComponent - not great since it doesn't exactly follow the entity-component-system pattern, although it can be said that it allows the construction of entities from components. * DynamicMixin - to emphasize that it's not to be confused with the CRTP mixins. It still has "mixin" in it's name though. * Trait - since it resembles the traits in Self, Scala, PHP, etc. However, a trait is more a "compile time" feature (even when talking about PHP) * TypeComposition or TyCo - a very vague description * Polymorph - since it allows the composition of polymorphic types at run time, but that's pobably even more vague Other ideas are welcome. Thanks -- Borislav

3 2

Hi everyone
by PUNEET KOHLI 02 Feb '15

02 Feb '15

Hello guys. I came to know about your organization from the melange page.Your projects really got me interested. I am a very proficient in c & c++. I have been doing a lot of competitive programming for more than a year so , i can certainly code.I wish to apply to GSOC this year and would love the opportunity if it comes from your organization. Thus, i am looking for a way to contribute and work for you.

2 3