The NetBSD Project

CVS log for pkgsrc/textproc/ruby-levenshtein/PLIST

[BACK] Up to [cvs.NetBSD.org] / pkgsrc / textproc / ruby-levenshtein

Request diff between arbitrary revisions


Default branch: MAIN


Revision 1.3 / (download) - annotate - [select for diffs], Sun Mar 8 15:17:21 2015 UTC (4 years ago) by taca
Branch: MAIN
CVS Tags: pkgsrc-2018Q4-base, pkgsrc-2018Q4, pkgsrc-2018Q3-base, pkgsrc-2018Q3, pkgsrc-2018Q2-base, pkgsrc-2018Q2, pkgsrc-2018Q1-base, pkgsrc-2018Q1, pkgsrc-2017Q4-base, pkgsrc-2017Q4, pkgsrc-2017Q3-base, pkgsrc-2017Q3, pkgsrc-2017Q2-base, pkgsrc-2017Q2, pkgsrc-2017Q1-base, pkgsrc-2017Q1, pkgsrc-2016Q4-base, pkgsrc-2016Q4, pkgsrc-2016Q3-base, pkgsrc-2016Q3, pkgsrc-2016Q2-base, pkgsrc-2016Q2, pkgsrc-2016Q1-base, pkgsrc-2016Q1, pkgsrc-2015Q4-base, pkgsrc-2015Q4, pkgsrc-2015Q3-base, pkgsrc-2015Q3, pkgsrc-2015Q2-base, pkgsrc-2015Q2, pkgsrc-2015Q1-base, pkgsrc-2015Q1, pkgsrc-, HEAD
Changes since 1.2: +2 -1 lines
Diff to previous 1.2 (colored)

Add ${GEM_EXTSDIR}/gem.build_complete for new rubygems and updated ruby.

Revision 1.2 / (download) - annotate - [select for diffs], Wed Mar 26 13:30:56 2014 UTC (4 years, 11 months ago) by taca
Branch: MAIN
CVS Tags: pkgsrc-2014Q4-base, pkgsrc-2014Q4, pkgsrc-2014Q3-base, pkgsrc-2014Q3, pkgsrc-2014Q2-base, pkgsrc-2014Q2, pkgsrc-2014Q1-base, pkgsrc-2014Q1
Changes since 1.1: +3 -2 lines
Diff to previous 1.1 (colored)

Add GEM_EXTSDIR support.
Use ${RUBY_DLEXT} instead of "so".

Revision 1.1 / (download) - annotate - [select for diffs], Sat Jan 26 10:49:03 2013 UTC (6 years, 1 month ago) by obache
Branch: MAIN
CVS Tags: pkgsrc-2013Q4-base, pkgsrc-2013Q4, pkgsrc-2013Q3-base, pkgsrc-2013Q3, pkgsrc-2013Q2-base, pkgsrc-2013Q2, pkgsrc-2013Q1-base, pkgsrc-2013Q1

Import ruby-levenshtein-0.2.2 as textproc/ruby-levenshtein.

The Levenshtein distance is a metric for measuring the amount
of difference between two sequences (i.e., the so called edit
distance). The Levenshtein distance between two sequences is
given by the minimum number of operations needed to transform
one sequence into the other, where an operation is an
insertion, deletion, or substitution of a single element.

The two sequences can be two strings, two arrays, or two other
objects responding to :each. All sequences are by generic
(fast) C code.

All objects in the sequences should respond to :hash and :eql?.

More information about the Levenshtein distance algorithm:
http://en.wikipedia.org/wiki/Levenshtein_distance .

This form allows you to request diff's between any two revisions of a file. You may select a symbolic revision name using the selection box or you may type in a numeric name using the type-in text box.




CVSweb <webmaster@jp.NetBSD.org>