CVS log for pkgsrc/textproc/ruby-levenshtein/distinfo
Up to [cvs.NetBSD.org] / pkgsrc / textproc / ruby-levenshtein
Request diff between arbitrary revisions
Keyword substitution: kv
Default branch: MAIN
Revision 1.4: download - view: text, markup, annotated - select for diffs
Tue Oct 26 11:23:24 2021 UTC (5 years ago) by nia
Branches: MAIN
CVS tags: pkgsrc-2026Q3-base,
pkgsrc-2026Q3,
pkgsrc-2026Q2-base,
pkgsrc-2026Q2,
pkgsrc-2026Q1-base,
pkgsrc-2026Q1,
pkgsrc-2025Q4-base,
pkgsrc-2025Q4,
pkgsrc-2025Q3-base,
pkgsrc-2025Q3,
pkgsrc-2025Q2-base,
pkgsrc-2025Q2,
pkgsrc-2025Q1-base,
pkgsrc-2025Q1,
pkgsrc-2024Q4-base,
pkgsrc-2024Q4,
pkgsrc-2024Q3-base,
pkgsrc-2024Q3,
pkgsrc-2024Q2-base,
pkgsrc-2024Q2,
pkgsrc-2024Q1-base,
pkgsrc-2024Q1,
pkgsrc-2023Q4-base,
pkgsrc-2023Q4,
pkgsrc-2023Q3-base,
pkgsrc-2023Q3,
pkgsrc-2023Q2-base,
pkgsrc-2023Q2,
pkgsrc-2023Q1-base,
pkgsrc-2023Q1,
pkgsrc-2022Q4-base,
pkgsrc-2022Q4,
pkgsrc-2022Q3-base,
pkgsrc-2022Q3,
pkgsrc-2022Q2-base,
pkgsrc-2022Q2,
pkgsrc-2022Q1-base,
pkgsrc-2022Q1,
pkgsrc-2021Q4-base,
pkgsrc-2021Q4,
HEAD
Diff to: previous 1.3: preferred, colored
Changes since revision 1.3: +2 -2
lines
textproc: Replace RMD160 checksums with BLAKE2s checksums
All checksums have been double-checked against existing RMD160 and
SHA512 hashes
Unfetchable distfiles (fetched conditionally?):
./textproc/convertlit/distinfo clit18src.zip
Revision 1.3: download - view: text, markup, annotated - select for diffs
Thu Oct 7 15:02:31 2021 UTC (5 years, 1 month ago) by nia
Branches: MAIN
Diff to: previous 1.2: preferred, colored
Changes since revision 1.2: +1 -2
lines
textproc: Remove SHA1 hashes for distfiles
Revision 1.2: download - view: text, markup, annotated - select for diffs
Wed Nov 4 02:00:09 2015 UTC (11 years ago) by agc
Branches: MAIN
CVS tags: pkgsrc-2021Q3-base,
pkgsrc-2021Q3,
pkgsrc-2021Q2-base,
pkgsrc-2021Q2,
pkgsrc-2021Q1-base,
pkgsrc-2021Q1,
pkgsrc-2020Q4-base,
pkgsrc-2020Q4,
pkgsrc-2020Q3-base,
pkgsrc-2020Q3,
pkgsrc-2020Q2-base,
pkgsrc-2020Q2,
pkgsrc-2020Q1-base,
pkgsrc-2020Q1,
pkgsrc-2019Q4-base,
pkgsrc-2019Q4,
pkgsrc-2019Q3-base,
pkgsrc-2019Q3,
pkgsrc-2019Q2-base,
pkgsrc-2019Q2,
pkgsrc-2019Q1-base,
pkgsrc-2019Q1,
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
Diff to: previous 1.1: preferred, colored
Changes since revision 1.1: +2 -1
lines
Add SHA512 digests for distfiles for textproc category
Problems found locating distfiles:
Package cabocha: missing distfile cabocha-0.68.tar.bz2
Package convertlit: missing distfile clit18src.zip
Package php-enchant: missing distfile php-enchant/enchant-1.1.0.tgz
Otherwise, existing SHA1 digests verified and found to be the same on
the machine holding the existing distfiles (morden). All existing
SHA1 digests retained for now as an audit trail.
Revision 1.1: download - view: text, markup, annotated - select for diffs
Sat Jan 26 10:49:03 2013 UTC (13 years, 9 months ago) by obache
Branches: MAIN
CVS tags: pkgsrc-2015Q3-base,
pkgsrc-2015Q3,
pkgsrc-2015Q2-base,
pkgsrc-2015Q2,
pkgsrc-2015Q1-base,
pkgsrc-2015Q1,
pkgsrc-2014Q4-base,
pkgsrc-2014Q4,
pkgsrc-2014Q3-base,
pkgsrc-2014Q3,
pkgsrc-2014Q2-base,
pkgsrc-2014Q2,
pkgsrc-2014Q1-base,
pkgsrc-2014Q1,
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 .
CVSweb <webmaster@jp.NetBSD.org>