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

GSoC14: Projects currently needing potential mentors
by Niall Douglas 20 Mar '14

20 Mar '14

Dear Boost, The following GSoC 14 project proposals are currently lacking potential mentors. If you'd like to mentor one of these proposals, please go to https://www.google-melange.com/gsoc/homepage/google/gsoc2014, register as a mentor using the bottom link and ask the Boost C++ org for a role. 1. Suffix array Data Structure by Prabhat Kumar 2. Path Planner Library by Pritam Khan 3. Boost.Fixed-Point by Nikhar Agrawal Thanks, Niall --- Boost C++ Libraries Google Summer of Code 2014 admin https://svn.boost.org/trac/boost/wiki/SoC2014

2 2

Boost.Odeint Proposal GSoC 2014
by Animesh Gaitonde 20 Mar '14

20 Mar '14

Hi everyone, I have added my proposal on melange.Kindly have a look at it.I will be glad to receive a feedback regarding my proposal Here is a link to my proposal :-https://www.google-melange.com/gsoc/proposal/review/student/google/gsoc2014/animesh371/5629499534213120 Let me know if there are any visibility issues. Regards & Thanks Animesh Gaitonde 4th year Undergraduate Bits-Pilani Goa Campus

1 0

[admin] Communicating with other write access contributors to a library
by Edward Diener 19 Mar '14

19 Mar '14

What is the proper way to communicate with other contributors of a library with write access under modular-boost in GitHub ? Is there a list of all write access members for a particular Boost library ?

2 2

[Parallel Algorithms] Queries regarding the Boost.Thread / Parallel algorithms
by NAVEEN NAMASHIVAYAM 19 Mar '14

19 Mar '14

Hi, I am interested in the implementation of parallel algorithms. From given documentation in http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2012/n3429.pdf I could understand the basic crux of the project. But the part which I was not able to figure from the documentation are these; 1. The type of network layer or the communication layer to be used. Can we make use of GASNet or ARMCI as the communication layer and build of ideas on it? Or do we have any specific library to work on this? 2. And the implementation of parallel_for and parallel_for_each, are we trying to mimic the available functionality from the parallel programming models like OpenMP? How far are these functions different from them. 3. Should we analyze about compiler optimizations. Because once these external parallel libraries are called; this necessarily means all the compiler optimizations within this parallel region should be excluded or else the complexity of the parallel library would be increased. Please confirm whether, my understanding is correct or am i looking at the project in a completely unrelated way. Regards, *NAVEEN* | Mobile: 832-720-2393 | about.me <http://about.me/naveen.namashivayam> |

2 1

Boost.BLAS
by Ashrith H Chinivar 19 Mar '14

19 Mar '14

Hey, This is Ashrith and I have a few queries related to the development of Boost.uBLAS library. I am currently undergoing a course on Linear Algebra and Matrices in my 3rd year of college and I would like to apply this in making kernel subroutines for Basic Linear Algebra under Boost.uBLAS. I hope to contribute by adding matrix multiplication, inversion algorithms and various other operations into the Boost. Please do let me know if I am missing something. I feel I may have over-seen some obvious prerequisites. Thank you, Ashrith

2 1

GSoC 2014: Boost Radix Sort
by Shahamat Mehdi 19 Mar '14

19 Mar '14

I am very interested in contributing to the radix sort algorithm in this year GSoC. I am currently studying Algorithms course and i have studied the radix sort algorithm and i really want it to be implemented. I want to ask from mentors weather we will be implementing it only on integers? or will it be a template function. I can think of doing it on integers, strings and doubles. But if there are others on which radix sort will perform better than count sort please let me know so that i could start thinking about that too. Thank you Shahamat Mehdi

1 0

setting option specific for compiler in Jamfile
by Oliver Kowalke 19 Mar '14

19 Mar '14

How can I apply an option in Jamfile which applies only for toolset-version onward? instead of writing: <toolset>gcc-4.7:<cxxflags>-fxyz <toolset>gcc-4.8:<cxxflags>-fxyz <toolset>gcc-4.9:<cxxflags>-fxyz I'd like to have a single line. <toolset>gcc-greater-eqal-4.7:<cxxflags>-fxyz best regards, Oliver

1 0

[git] Super-project workflow
by Brian Ravnsgaard Riis 19 Mar '14

19 Mar '14

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi, According to https://svn.boost.org/trac/boost/wiki/SuperProjectWorkflow the super project should be loosely based on git-flow, which would mean that branch 'master' should currently reflect 1.55. There should be a branch 'latest', which maps to develop of all submodules, and a branch 'develop', which maps to master of all submodules. A quick glance at 'master' shows commits within the last day, updating submodule references. Also, quite a bit of pre-1.56 work has been done. Should this not happen on 'develop'? Or are we using a completely different workflow after all? How do I get 1.55 from the git repo atm? /Brian Riis -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.12 (GNU/Linux) Comment: Using GnuPG with Thunderbird - http://www.enigmail.net/ iQEcBAEBAgAGBQJTKEFjAAoJEFES4N8QrEodPysIAJKyI9d10uqHSsO1qqIRWJCA Xktr5Nfu4cZGtp59q7m8ydAZWTHK4r0dzdl0MB20Zb6Sn5fJ0LGrARb8GOse9CS/ IZ5dtIZBQ4w4X++yLdxqKmeM8Scm4CHI/uyQtK3x4jn+AYAHWIXcbLQXw2ESNFJ7 vVazOLdrWKV408C1f6tko5dycseeizlah1Svx0WGvmUkRrGUCxRL44AOhl1Nj0eL DLuMZ99a6YjKYE253pO63F4s32s8SMC542kl9RqLI10SzlEVHc9ed97/Qqab3xmn BYgYT3wIHCMNsKG6qBWH+3m3vqGczVCqi11uYeAazTgqsEmJ4p3XQZIABFvrsr8= =YJha -----END PGP SIGNATURE-----

2 2

[fusion] Feature Request: alias templates
by Joe Gottman 19 Mar '14

19 Mar '14

I recently started using boost::fusion, and one feature that would make it much more user friendly is template aliases like the ones that were added for the standard type traits in C++14. For example, template <typename I> using deref_t = typename result_of::deref<I>::type; Joe Gottman

1 0

[GSoC][Trie][Radix sort]
by matijas9 19 Mar '14

19 Mar '14

Hello, On list of items for Google Summer of Code is "Trie data structure, extending the work done during GSoC 2013". I would like to know what exactly mean "extending the work", i.e. what is to do in implementation of trie from previous GSoC. Secondly, I would like to add to my proposition of project for GSoC radix sort algorithm. I would like to know how generalized can be types of input datas for radix sort. Elements of sequences which are sorted must belong to some finite universe and should be comparable in constant time, so in my opinion radix sort can sort only sequences of natural numbers well. Therefore I think about preparing version of radix sort sorting sequences of numbers and another version sorting strings (which can be interpreted as sequences of numbers). Can someone think of some other, usefull types of objects that can be sorted using radix sort? Best Regards, Mateusz Wasylkiewicz

2 1