GenPrime

I Use This!

Inactive

Analyzed about 18 hours ago. based on code collected 2 days ago.

Project Summary

GenPrime is a very simple discovery algorithm to find prime numbers.

This particular variant is a programming language benchmark, using simple arithmetic, loops, and operators. This essentially acts as a stress test for the most fundamental features of any programming language, showing the deeply seated weaknesses of interpreted languages. There are currently implementations in C, C++, Java, Objective-C, Perl, PHP, Python, and Ruby.

In a Nutshell, GenPrime...

...
has had 61 commits made by 3 contributors
representing 975 lines of code
...
is mostly written in Python
with a very low number of source code comments
...
has a well established, mature codebase
maintained by nobody
with stable Y-O-Y commits
...
took an estimated 1 years of effort (COCOMO model)
starting with its first commit in November, 2008
ending with its most recent commit about 11 years ago

Quick Reference

Project Links:

Download

Code Locations:

https://github.com/tycho/genprime

Similar Projects:

Managers:

Steven Noonan

Licenses

BSD 4-clause (University of California-Specific)

Permitted

Commercial Use

Modify

Distribute

Place Warranty

Forbidden

Hold Liable

Use Trademarks

Required

Include Copyright

Include License

These details are provided for information only. No information here is legal advice and should not be used as such.

All Licenses

This Project has No vulnerabilities Reported Against it

Did You Know...

...
nearly 1 in 3 companies have no process for identifying, tracking, or remediating known open source vulnerabilities
...
learn about Open Hub updates and features on the Open Hub blog
...
65% of companies leverage OSS to speed application development in 2016
...
by exploring contributors within projects, you can view details on every commit they have made to that project