Changes between Version 12 and Version 13 of SoC2015


Ignore:
Timestamp:
Feb 17, 2015, 1:01:07 AM (8 years ago)
Author:
Niall Douglas
Comment:

moved gsoc idea template to separate page

Legend:

Unmodified
Added
Removed
Modified
  • SoC2015

    v12 v13  
    3939= Suggested GSoC project proposals =
    4040
    41 == INSTRUCTIONS FOR ADDING SUGGESTED PROPOSALS ==
    42 
    43 Please follow the following proposal structure. See the concurrent hash tables proposal below for an example.
    44 
    45 === No. Title ===
    46 Potential mentors: names
    47 
    48 ==== Background ====
    49 Explanation of proposal background, history etc with hyperlinks.
    50 
    51 ==== GSoC project proposal ====
    52 Bullet points of items to complete for the GSoC.
    53 
    54 ==== Potential project extension funded by Boost ====
    55 Not as much detail as the GSoC proposal itself, but enough detail that such an extension could be specced out.
    56 
    57 If there is no good extension, simply say N/A here.
    58 
    59 ==== Programming competency test ====
    60 Some code for them to write to prove they can program sufficiently. Ideally it should be a small part of the proposal itself modifying real Boost library code, but there is nothing wrong with an actual exam paper, except that maybe they might cheat if you give them too much time and flexibility in when to do it, so if setting an exam question make sure you say here it will be written and set to interested students on some date after GSoC applications close and they'll get X days to finish it.
    61 
    62 How they submit their results is up to you. They can append them to their project proposal, or provide a gist, or email them to you for marking, or whatever.
    63 
    64 If there is no programming competency test, please add your proposal to the second section below the special section for proposals without competency testing.
    65 
    66 
    6741== Self-contained standalone GSoC Projects with programming competency test ==
    6842The following projects and programming competency test have been suggested by potential mentors. Selecting one of these, in consultation with the [http://www.boost.org/community/groups.html#main Boost developers mailing list], provides the highest chance that a mentor can be found for your GSoC project proposal and that your proposal will be preferentially ranked (see above). A template for the proposal can be found [wiki:SoCSubmissionTemplate here].
     43
     44MENTORS PLEASE FOLLOW [wiki:GSoCIdeaTemplate THE GSOC IDEA TEMPLATE HERE] WHEN ADDING IDEAS.
    6945
    7046=== 1. Concurrent Hash Tables (boost::concurrent_unordered_[multi]set|[multi]map) ===
     
    186162The following projects have been suggested by potential mentors. Selecting one of these, in consultation with the [http://www.boost.org/community/groups.html#main Boost developers mailing list], provides the highest chance that a mentor can be found for your GSoC project proposal. You should only choose one of these proposals if you already have at least 1,000 lines of C++ library code out there we can examine for your programming competency, otherwise your proposal cannot be preferentially ranked (see above). Make SURE you provide a link to your existing C++ code base in the proposal you submit to Melange. A template for the proposal can be found [wiki:SoCSubmissionTemplate here].
    187163
     164MENTORS PLEASE FOLLOW [wiki:GSoCIdeaTemplate THE GSOC IDEA TEMPLATE HERE] WHEN ADDING IDEAS.
     165
    188166=== 1. Boost.odeint Implicit Routines ===
    189167Potential mentors: Karsten Ahnert and Mario Mulansky
     
    210188==== Potential project extension funded by Boost ====
    211189N/A
     190
     191
     192== GSoC Projects which have been prearranged by students with mentors for 2015 ==
     193The following students successfully sought out mentors and prearranged GSoC project proposals. They have also proven their programming competency by supplying C++ library code they have written for inspection.
     194
     1951. Damian Vicino. Topic: Safe Numerics. Mentor: Robert Ramey.
     196
     1972. Louis Dionne. Topic: Heterogeneous collections (Boost.Hana). Mentor: Joel Falcou.
    212198
    213199