Changes between Version 10 and Version 11 of GoogleCodeIn2010Tasks
- Timestamp:
- 10/29/10 17:54:50 (11 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
GoogleCodeIn2010Tasks
v10 v11 39 39 Potential Mentors: mikehh, ? 40 40 41 Background Required: some perl, read up on pir, examples to be given41 Background: Perl 5 42 42 43 43 ''Details'': A lot of our tests are still written in perl5 or a combination of perl5 with pir in CODE/OUTPUT blocks. Ultimately we would like to get rid of any dependency on perl5. We will put forward a list of tests that still need converting and set them up as a tasks with one or more tests to be converted. 44 44 45 == Task # 3: Increase test coverage of PMCs - This represents several tasks. ==45 == Task # 3: Increase test coverage of PMCs - This represents several tasks. == 46 46 47 47 Potential Mentors: cotto, ? 48 48 49 Background Required: familiarity with [http://docs.parrot.org/parrot/latest/html/docs/book/pir/ch01_introduction.pod.html PIR] and C, Perl 5 in some cases.49 Background: familiarity with [http://docs.parrot.org/parrot/latest/html/docs/book/pir/ch01_introduction.pod.html PIR] and C, Perl 5 in some cases. 50 50 51 51 ''Details'': Many of our [http://docs.parrot.org/parrot/latest/html/docs/user/pir/pmcs.pod.html PMCs] don't have complete test coverage. Although 100% coverage may not be possible in all cases, we can do better. We will provide a list of PMCs which need increased test coverage and notes about any PMCs which may provide difficulties in reaching 100%. A task will be complete when, at the mentor's discretion, a PMC's coverage is increased as much as is practical, ideally to 100%. This task requires the use of PIR, but increasing test coverage will usually require a small and easily-learned subset of PIR. 52 53 == Task # 4: Increase test coverage of Math::Primality == 54 55 Potential Mentors: bubaflub 56 57 Background: Perl 5, Prime numbers, Devel::Cover 58 59 ''Details'': Math::Primality is a Perl 5 CPAN module that has advanced prime-checking algorithms. It was a GSoC project in 2009. Currently some new algorithms were added, but they don't have proper test coverage. Having better test coverage is necessary because people will rely on the correctness of the algorithms in this module for cryptography and number theory applications. This task will involve the student learning how to build and test Math::Primality, as well as analyzing the test coverage with the Devel::Cover CPAN module. When parts of the code are identified that need more tests, the students will work with the mentor to write tests that verify those parts of the code work correctly.
