Path to this page:
Next | Query returned 4 messages, browsing 1 to 10 | previous
CVS Commit History:
2024-01-20 06:48:54 by Makoto Fujiwara | Files touched by this commit (2) |
Log message:
(devel/R-cyclocomp) Updated 1.1.0 to 1.1.1
# cyclocomp 1.1.1
* cyclocomp is now much faster on long linear code (@etiennebacher, #21).
|
2021-10-26 12:20:11 by Nia Alarie | Files touched by this commit (3016) |
Log message:
archivers: Replace RMD160 checksums with BLAKE2s checksums
All checksums have been double-checked against existing RMD160 and
SHA512 hashes
Could not be committed due to merge conflict:
devel/py-traitlets/distinfo
The following distfiles were unfetchable (note: some may be only fetched
conditionally):
./devel/pvs/distinfo pvs-3.2-solaris.tgz
./devel/eclipse/distinfo eclipse-sourceBuild-srcIncluded-3.0.1.zip
|
2021-10-07 15:44:44 by Nia Alarie | Files touched by this commit (3017) |
Log message:
devel: Remove SHA1 hashes for distfiles
|
2020-02-10 15:18:23 by Makoto Fujiwara | Files touched by this commit (3) |
Log message:
(devel/R-cyclocomp) import R-cyclocomp-1.1.0
Cyclomatic complexity is a software metric (measurement), used to
indicate the complexity of a program. It is a quantitative measure of
the number of linearly independent paths through a program's source
code. It was developed by Thomas J. McCabe, Sr. in 1976.
|
Next | Query returned 4 messages, browsing 1 to 10 | previous