- Boost - lists.preview.boost.org

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

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

18 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> |

1 0

Queries regarding the Boost.Thread / Parallel algorithms
by Naveen 18 Mar '14

18 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> |

1 0

Re: [boost] Welcome as organization member - HELP !!!!!
by Vicente J. Botet Escriba 18 Mar '14

18 Mar '14

Hi, I have reached to see the projects now, Thanks, Vicente Le 18/03/14 22:27, Niall Douglas a écrit : > Ability to assign mentors opened today, I've assigned all the mentors > to projects in so far as I know which. > > Niall > > > On 18 Mar 2014 at 20:56, Boris Schäling wrote: > >> >>> -----Original Message----- >>> From: Niall Douglas [mailto:s_sourceforge@nedprod.com] >>> Sent: Dienstag, 18. März 2014 02:04 >>> To: Vicente J. Botet Escriba >>> Cc: Boris Schäling >>> Subject: Re: Welcome as organization member - HELP !!!!! >> Hi Niall, >> >>> It's possible. I am unable to accept proposals, so if you can't see >>> proposals until I accept them, that would explain it. >>> >>> I assume that only after submission closes will I be allowed to >>> accept proposals and then you can see them? Boris: you were admin >>> last year, do you know the answer? >> Vicente is a registered mentor but can't see any proposals? Unfortunately I >> don't remember anymore whether that was the case for us last year, too, >> while we were still in the student application period. Can you assign >> Vicente as a possible mentor to a proposal (the one he is interested in)? >> >> Boris >> >>> [...] > > --- > Boost C++ Libraries Google Summer of Code 2014 admin > https://svn.boost.org/trac/boost/wiki/SoC2014 > >

1 0

[GSoC 2014] Boost.odeint application
by Razvan Florea 18 Mar '14

18 Mar '14

Hello, I have added on google melange the first version of my application for Boost.odeint library. You can find it here: [1]. Please take a look on it and give me feedback in order to change the weakest parts. [1]: https://www.google-melange.com/gsoc/proposal/review/student/google/gsoc2014… Best regards, Razvan Florea

1 0

GSoC Summer Project Queries.
by Ashrith H Chinivar 18 Mar '14

18 Mar '14

Hey, This is Ashrith and I have a few queries related to the development of Boost.uBLAS library and the general expectation for the proposal with respect to the algorithmic implementation for Google SoC 2014. I hope the reply will help me narrow down on my options for this year's GSoC. The linear algebra library for Boost which expects the developer to perform Matrix multiplication and various mathematical actions w.r.t the vector spaces and matrix multiplication. Can this be done in C++ with no prior knowledge of MATLAB? I am however, very interested in contributing to the project from algorithmic point of view and including RADIX sort and various other algorithms or short-cuts that would facilitate C++. I am currently undergoing a course on Linear Algebra and Matrices. So I would e happy to consider this as the option to apply for this year's GSoC. So please reply regarding the Boost.uBLAS and other possible implementaions that is expected or which I can submit through my synopsis/proposal. I would be glad to join in on the IRC if that is possible. Thank you, Ashrith H C

1 0

GSoC 2014: boost radix sort
by Shahamat Mehdi 18 Mar '14

18 Mar '14

I have studied radix sort and it does not seem to be a very difficult task. I want to know what exactly will be required from me in this task. It will be highly appreciated if i get a link to the work that is already done so i could understand how to take it ahead. Thanks

1 0

Re: [boost] Arithmetic (opaque) type without implicit conversions
by Gonzalo BG 18 Mar '14

18 Mar '14

> What is the Arithmetic concept? Types that supports all operations provided by integral and floating point types "model" the Arithmetic "constraint" (better than the word concept in this context), as checked by std::is_arithmetic<T> [0], which is defined as std::is_integral<T> || std::is_floating_point<T>. I don't static_assert(std::is_arithmetic<T>) to allow other types that might be viable but for which there is not a specialization of std::is_integral/std::is_floating_point. [0] http://en.cppreference.com/w/cpp/types/is_arithmetic On Tue, Mar 18, 2014 at 5:38 PM, Robert Ramey <robertmacleranramey(a)gmail.com > wrote: > > > On Tuesday, March 18, 2014 8:42:02 AM UTC-7, Gonzalo BG wrote: >> >> Arithmetic<T, U = void> is a type that: >> - models the Arithmetic concept, >> > > What is the Arithmetic concept? > > >> - wraps a T that also models the arithmetic concept, and >> - can be used as a strong/opaque typedef for T. >> >> It is thus similar to Boost.Serialization's BOOST_STRONG_TYPEDEF, >> - but without any implicit conversions (only explicit ones), and >> - it supports move semantics and C++14 constexpr. >> >> The code is here: https://github.com/gnzlbg/arithmetic_type >> The Readme.md is brief, so I refer you to there for more information. >> There are also some tests, although it could use some more. >> >> The LoungeC++ and Morwen(a)codereview.stackexchange deserve credit for >> some >> improvements on the implementation. >> The remaining mistakes are only mine. >> So please, destroy my implementation if you find any mistakes. >> >> I find it useful to strongly type interfaces that involve indices, e.g. >> in >> an octree implementation where child/neighbor indices for a node with >> different types result in clear compilation errors if mixed. >> >> I hope you find it useful too. >> >> Bests, >> Gonzalo BG >> >> _______________________________________________ >> Unsubscribe & other changes: http://lists.boost.org/ >> mailman/listinfo.cgi/boost >> >

1 0

GSoC boost help
by Shahamat Mehdi 18 Mar '14

18 Mar '14

I want to work on radix sort algorithm for boost in this GSoC. Please tell me how can I contact a mentor. I have a some questions before i can submit my proposal. So, please help me.

2 1

Arithmetic (opaque) type without implicit conversions
by Gonzalo BG 18 Mar '14

18 Mar '14

Arithmetic<T, U = void> is a type that: - models the Arithmetic concept, - wraps a T that also models the arithmetic concept, and - can be used as a strong/opaque typedef for T. It is thus similar to Boost.Serialization's BOOST_STRONG_TYPEDEF, - but without any implicit conversions (only explicit ones), and - it supports move semantics and C++14 constexpr. The code is here: https://github.com/gnzlbg/arithmetic_type The Readme.md is brief, so I refer you to there for more information. There are also some tests, although it could use some more. The LoungeC++ and Morwen(a)codereview.stackexchange deserve credit for some improvements on the implementation. The remaining mistakes are only mine. So please, destroy my implementation if you find any mistakes. I find it useful to strongly type interfaces that involve indices, e.g. in an octree implementation where child/neighbor indices for a node with different types result in clear compilation errors if mixed. I hope you find it useful too. Bests, Gonzalo BG

1 0

[ANN] Registration for CppCon 2014 is Open
by Boris Kolpackov 18 Mar '14

18 Mar '14

CppCon, The C++ Conference Opening Keynote by Bjarne Stroustrup September 7–12, 2014 Bellevue, Washington, USA Registration is now open for CppCon 2014 to be held September 7–12, 2014 at the Meydenbauer Center in Bellevue, Washington, USA. This year the conference starts with the keynote by Bjarne Stroustrup titled "Make Simple Tasks Simple!" 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. You will enjoy inspirational talks and a friendly atmosphere designed to help attendees learn from each other, meet interesting people, and generally have a stimulating experience. Taking place this year in the beautiful Seattle neighborhood and including multiple diverse tracks, the conference will appeal to anyone from C++ novices to experts. What you can expect at CppCon: * Invited talks and panels: CppCon keynote by Bjarne Stroustrup will start off a week full of insight from some of the world’s leading experts in C++. Still have questions? Ask them at one of CppCon's panels featuring those at the cutting edge of the language. * Presentations by the C++ community: What do embedded systems, game development, high frequency trading, and particle accelerators have in common? C++, of course! Expect talks from a broad range of domains focused on practical C++ techniques, libraries, and tools. * Lightning talks: Get informed at a fast pace during special sessions of short, informal talks. Never presented at a conference before? This is your chance to share your thoughts on a C++-related topic in an informal setting. * Evening events and "unconference" time: Relax, socialize, or start an impromptu coding session. CppCon’s goal is to encourage the best use of C++ while preserving the diversity of viewpoints and experiences, but other than that it is non-partisan and has no agenda. The conference is a project of the Standard C++ Foundation, a not-for-profit organization whose purpose is to support the C++ software developer community and promote the understanding and use of modern, standard C++ on all compilers and platforms. For more information about the conference and to register, visit: http://cppcon.org

1 0

Boost.Compute v0.1 Released
by Kyle Lutz 18 Mar '14

18 Mar '14

I'm proud to announce the initial release (version 0.1) of Boost.Compute! It is available on GitHub [1] and instructions for using the library can be found in the documentation [2]. Boost.Compute is a GPGPU and parallel-programming library based on OpenCL. It provides an STL-like API and implements many common containers (e.g. vector<T>, array<T, N>) as well as many common algorithms (e.g. sort(), accumulate(), transform()). A full list can be found in the header reference [3]. I hope to propose Boost.Compute for review in the next few months but for I'm looking for more wide-spread testing and feedback from the Boost community (please note the FAQ [4] and design rationale [5] where I hope to have answered some common questions). Thanks, Kyle [1] https://github.com/kylelutz/compute [2] http://kylelutz.github.io/compute/ [3] http://kylelutz.github.io/compute/compute/reference.html [4] http://kylelutz.github.io/compute/boost_compute/faq.html [5] http://kylelutz.github.io/compute/boost_compute/design.html

9 11

[math] Extensive warnings when compiling with clang
by Brian Ravnsgaard Riis 18 Mar '14

18 Mar '14

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I realise these are not that serious, just annoying. See example below. I'm building with clang++, modified to default in C++11 mode. /Brian Riis clang-linux.compile.c++.with-pch bin.v2/libs/math/build/clang-linux-3.4/release/link-static/threading-multi/fminf.o In file included from <built-in>:168: In file included from <command line>:4: In file included from /home/brian/programming/boost/libs/math/build/../src/tr1/pch.hpp:9: In file included from ./boost/math/special_functions.hpp:15: In file included from ./boost/math/special_functions/airy.hpp:10: In file included from ./boost/math/special_functions/bessel.hpp:18: In file included from ./boost/math/special_functions/detail/bessel_jy.hpp:14: In file included from ./boost/math/special_functions/gamma.hpp:28: In file included from ./boost/math/special_functions/lanczos.hpp:1288: ./boost/math/special_functions/detail/lanczos_sse2.hpp:54:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d vx = _mm_load1_pd(&x); ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:55:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d sum_even = _mm_load_pd(coeff); ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:56:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d sum_odd = _mm_load_pd(coeff+2); ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:57:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d nc_odd, nc_even; ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:57:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d nc_odd, nc_even; ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:58:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d vx2 = _mm_mul_pd(vx, vx); ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:139:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d vx = _mm_load1_pd(&x); ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:140:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d sum_even = _mm_load_pd(coeff); ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:141:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d sum_odd = _mm_load_pd(coeff+2); ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:142:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d nc_odd, nc_even; ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:142:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d nc_odd, nc_even; ^~~~~~~~~ ./boost/math/special_functions/detail/lanczos_sse2.hpp:143:4: warning: 'register' storage class specifier is deprecated [-Wdeprecated-register] register __m128d vx2 = _mm_mul_pd(vx, vx); ^~~~~~~~~ 12 warnings generated. -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.12 (GNU/Linux) Comment: Using GnuPG with Thunderbird - http://www.enigmail.net/ iQEcBAEBAgAGBQJTKAqhAAoJEFES4N8QrEodTJ4H/1Hl2vyJ/Ki7JCK+YZsgwLvr MztU3H4IFfaUf4+EXPjnJbhu5f19Fhupn7RH6PLIJElUBYQGvKSEp2DRNddalrDK vKZVxGe25pDAD1HOsPRKH+74xXqSfeAAbYi/PvwusXLwhS2kYH+k6KzdXn6POsEe PrdweMusGLp9TH36DYNM59+SU16oGPdOj53acZSG06ftG8+1FcFXtb2jTMZY7fZX l/3gUBkQ7kl7ZkAoezNNlKcb/r+dIXNfb2oaV7TwSUGD+7ioQvvsSFjr2ytl3cb8 q01hLY4ih2mjMkrvCfflbAwGXH6noyEm/ySmjAxxekyCyP4na/W648+hAhnlimg= =vvz8 -----END PGP SIGNATURE-----

2 2

GSoC '14 - Boost.Compute
by Roshan 18 Mar '14

18 Mar '14

Hey, I wish to propose a project regarding Boost.Compute. I would love to hear your views on it. Here is a link to my proposal: Dropbox Link <https://www.dropbox.com/s/tkpdomvoxpzisg7/GSoC.pdf> Thanks. -- Warm regards Roshan

1 0

GSoC Boost/Monads
by Дмитрий Карпов 17 Mar '14

17 Mar '14

Hello! My name is Dmitry. I have submitted my prorposal in GSoC. But I'd like change it little bit. What is your expectation from this project? I'd like: - to implement common monad's interface: - functions for async and futures (then(), is_ready and I hope I will have enough time to implement some others) - make some experiment with Either and Maybe monads to implement fmap() for smart pointers and containers Should I keep in my mind some other tasks? Can you advise something about State monad? What should be it used for, input/output or, maybe, for secure operation with implicit type conversion or for something else? This is link to my proposal: http://www.google-melange.com/gsoc/proposal/review/student/google/gsoc2014/… -- Best regards, Dmitry Karpov Cell phone: +7 905 271 94 14

2 1

[Boost.Functional][GSoC] Boost.Functional / Monad project proposal
by Benjamin, John C. (MU-Student) 17 Mar '14

17 Mar '14

Name: John Benjamin College/University?: University of Missouri - Columbia Course/Major?: Computer Science Degree Program (B.Sc., M, Sc., PhD, etc.) M.S. Email: jcb638(a)mail.missouri.edu Homepage: github.com/jchbenjamin Availability: How much time do you plan to spend on your GSoC? 30-40 hours per week What are your intended start and end dates? May 16 - August 19 What other factors affect your availability (exams, courses, moving, work, etc.)? I will be doing 3 credit hours of research Background Information I am a master's student in computer science. I've been hacking and programming computers since I was in Junior High. Please summarize your educational background (degrees earned, courses taken, etc.). I have a B.S. in economics from the University of Kansas. Between Spring 2012 and Spring 2013 I did post-baccalaureate study in Computer Science. I have the equivalent coursework for an undergraduate major in Computer Science. Please summarize your programming background (OSS projects, internships, jobs, etc.). I work for a lab associated with the government on campus where we perform remote sensing work across large sets of satellite data. The focus is on high-performance computing and database design. There is a large SVN repository of C++ code for which I am a regular contributor. Please tell us a little about your programming interests. Please tell us why you are interested in contributing to the Boost C++ Libraries. I am interested in Boost because I have been working with Boost for my work and for many classes. Boost has always been the most satisfying library. It is general purpose, always fast, and really attuned to the needs of the programmer. It is an amazing blend of practical use, solid theory, and good engineering. It would be a huge honor to be able to work with this project. What is your interest in the project you are proposing? I am interested in helping to implement a common monad framework for Boost. Have you done any previous work in this area before or on similar projects? I have worked with Haskell for a year with Prof. William Harrison at my school. Last summer I did research with Haskell and wrote a nifty little program that uses a state monad. What are your plans beyond this Summer of Code time frame for your proposed work?. I hope to continue contributing with this work and to help foster awareness and use of monads. I think that Haskell is on to something with some of its language features. Features like lambdas are already becoming part of the new way of structuring programs. I think monads are a powerful way to reason about and understand the properties of a program. But I don't think a full-blown functional language is practical or necessary for most problems. When typical programmers see that Monads can fit into a language used in industry and that builds on what they already know and expect of the behavior of a language they will be more open to thinking about higher level structural concepts from Category Theory. Please rate, from 0 to 5 (0 being no experience, 5 being expert), your knowledge of the following languages, technologies, or tools: C++ :: 4 C++ Standard Library :: 4 Boost C++ Libraries :: 3 Subversion :: 3 What software development environments are you most familiar with (Visual Studio, Eclipse, KDevelop, etc.)? Eclipse, gnu autotools What software documentation tool are you most familiar with (Doxygen, DocBook, Quickbook, etc.)? Doxygen Project Proposal The proposal is not too creative, just what is described in Boost.Functional / Monads Please provide a description of your proposed work. I will work to make sure the Monad implementation meets the actual description of a monad. One thing I think is important is to be able to have recursive monads that are efficient. The IO monad for example is particularly amenable to recursive structures that allow for easy sanitation of input and output. Proposed Milestones and Schedule Rough draft of milestones and schedules: May 19 - June 2 : review Monads and Category Theory. Understand the current state of Boost.Functional / Monad. Read through Pure and discuss how our implementation is different. June 2 - June 30 : Propose, discuss, and finalize working prototype which implements all the required existing instances of monads and meets syntactic conventions. Begin coding July 1 - July 21 : Implement finalized proposal and prepare for testing July 21- end of summer : test and document my work Please provide any feedback. If you need more information or a more specific proposal please let me know. John Benjamin?

2 1

GSoC 2014 proposal for Boost.Chrono/Date
by Arun Sori 17 Mar '14

17 Mar '14

Hey all, I am interested in the Boost.Chrono/Date project for this year's GSoC. I've made a proposal here<https://docs.google.com/document/d/1jzqAuVh_GZL2TihIlMlG6qX6IfMfOrRw1hOfUre…>, with some good help from the project's mentor. It's open for reviews. Please have a look and point out any mistakes,typos or anything else I am missing. Any feedback is much appreciated. Thanks, Arun

1 0