1
0
mirror of https://git.FreeBSD.org/ports.git synced 2024-11-24 00:45:52 +00:00

- Add rubygem-algorithms 0.6.1

algorithms started as a Google Summer of Code 2008 project.

The original proposal is as follows:
Using the right data structure or algorithm for the situation is an important
aspect of programming. In computer science literature, many data structures and
algorithms have been researched and extensively documented. However, there is
still no standard library in Ruby implementing useful structures and algorithms
like Red/Black Trees, tries, different sorting algorithms, etc. This project
will create such a library with documentation on when to use a particular
structure/algorithm. It will also come with a benchmark suite to compare
performance in different situations.

WWW: https://github.com/kanwei/algorithms
RG:  https://rubygems.org/gems/algorithms
This commit is contained in:
Sunpoet Po-Chuan Hsieh 2015-05-30 13:48:11 +00:00
parent 61a6349d20
commit bb0c7fa84a
Notes: svn2git 2021-03-31 03:12:20 +00:00
svn path=/head/; revision=387966
4 changed files with 35 additions and 0 deletions

View File

@ -4421,6 +4421,7 @@
SUBDIR += rubygem-activemessaging
SUBDIR += rubygem-activesupport
SUBDIR += rubygem-activesupport4
SUBDIR += rubygem-algorithms
SUBDIR += rubygem-allison
SUBDIR += rubygem-analogger
SUBDIR += rubygem-annoy

View File

@ -0,0 +1,18 @@
# Created by: Sunpoet Po-Chuan Hsieh <sunpoet@FreeBSD.org>
# $FreeBSD$
PORTNAME= algorithms
PORTVERSION= 0.6.1
CATEGORIES= devel rubygems
MASTER_SITES= RG
MAINTAINER= sunpoet@FreeBSD.org
COMMENT= Ruby algorithms and data structures
LICENSE= MIT
USE_RUBY= yes
USE_RUBYGEMS= yes
RUBYGEM_AUTOPLIST= yes
.include <bsd.port.mk>

View File

@ -0,0 +1,2 @@
SHA256 (rubygem/algorithms-0.6.1.gem) = c5cee5cb10bb5810fbc12b8cd52fc53ebf993bc351e122f7214d64b13aa6f28a
SIZE (rubygem/algorithms-0.6.1.gem) = 322560

View File

@ -0,0 +1,14 @@
algorithms started as a Google Summer of Code 2008 project.
The original proposal is as follows:
Using the right data structure or algorithm for the situation is an important
aspect of programming. In computer science literature, many data structures and
algorithms have been researched and extensively documented. However, there is
still no standard library in Ruby implementing useful structures and algorithms
like Red/Black Trees, tries, different sorting algorithms, etc. This project
will create such a library with documentation on when to use a particular
structure/algorithm. It will also come with a benchmark suite to compare
performance in different situations.
WWW: https://github.com/kanwei/algorithms
RG: https://rubygems.org/gems/algorithms