pkgsrc/textproc/ruby-levenshtein/PLIST

@comment $NetBSD: PLIST,v 1.3 2015/03/08 15:17:21 taca Exp $
${GEM_HOME}/cache/${GEM_NAME}.gem
${GEM_EXTSDIR}/gem.build_complete
${GEM_EXTSDIR}/levenshtein/levenshtein_fast.${RUBY_DLEXT}
${GEM_LIBDIR}/CHANGELOG
${GEM_LIBDIR}/LICENSE
${GEM_LIBDIR}/README
${GEM_LIBDIR}/VERSION
${GEM_LIBDIR}/ext/levenshtein/extconf.rb
${GEM_LIBDIR}/ext/levenshtein/levenshtein.h
${GEM_LIBDIR}/ext/levenshtein/levenshtein_fast.c
${GEM_LIBDIR}/lib/levenshtein.rb
${GEM_LIBDIR}/lib/levenshtein/levenshtein_fast.${RUBY_DLEXT}
${GEM_LIBDIR}/lib/levenshtein/version.rb
${GEM_LIBDIR}/test/test.rb
${GEM_HOME}/specifications/${GEM_NAME}.gemspec
Add ${GEM_EXTSDIR}/gem.build_complete for new rubygems and updated ruby. 2015-03-08 16:17:17 +01:00			`@comment $NetBSD: PLIST,v 1.3 2015/03/08 15:17:21 taca Exp $`
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 . 2013-01-26 11:49:03 +01:00			`${GEM_HOME}/cache/${GEM_NAME}.gem`
Add ${GEM_EXTSDIR}/gem.build_complete for new rubygems and updated ruby. 2015-03-08 16:17:17 +01:00			`${GEM_EXTSDIR}/gem.build_complete`
Add GEM_EXTSDIR support. Use ${RUBY_DLEXT} instead of "so". 2014-03-26 14:30:56 +01:00			`${GEM_EXTSDIR}/levenshtein/levenshtein_fast.${RUBY_DLEXT}`
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 . 2013-01-26 11:49:03 +01:00			`${GEM_LIBDIR}/CHANGELOG`
			`${GEM_LIBDIR}/LICENSE`
			`${GEM_LIBDIR}/README`
			`${GEM_LIBDIR}/VERSION`
			`${GEM_LIBDIR}/ext/levenshtein/extconf.rb`
			`${GEM_LIBDIR}/ext/levenshtein/levenshtein.h`
			`${GEM_LIBDIR}/ext/levenshtein/levenshtein_fast.c`
			`${GEM_LIBDIR}/lib/levenshtein.rb`
Add GEM_EXTSDIR support. Use ${RUBY_DLEXT} instead of "so". 2014-03-26 14:30:56 +01:00			`${GEM_LIBDIR}/lib/levenshtein/levenshtein_fast.${RUBY_DLEXT}`
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 . 2013-01-26 11:49:03 +01:00			`${GEM_LIBDIR}/lib/levenshtein/version.rb`
			`${GEM_LIBDIR}/test/test.rb`
			`${GEM_HOME}/specifications/${GEM_NAME}.gemspec`