- Update to 0.15 (this involved a big change in the algorithms used)

- Tidy COMMENT
- Update pkg-descr to the new description

3 files changed, 13 insertions, 9 deletions

diff --git a/astro/match/Makefile b/astro/match/Makefile
index b655e9c5cf6b..6ff2bb3bfe67 100644
--- a/astro/match/Makefile
+++ b/astro/match/Makefile
@@ -7,13 +7,13 @@
 #
 
 PORTNAME=	match
-PORTVERSION=	0.14
+PORTVERSION=	0.15
 CATEGORIES=	astro
 MASTER_SITES=	http://spiff.rit.edu/match/ \
 		http://www.c-s.li/ports/
 
 MAINTAINER=	cs@FreeBSD.org
-COMMENT=	A program for matching star lists
+COMMENT=	Program for matching star lists
 
 LICENSE=	GPLv2
 
diff --git a/astro/match/distinfo b/astro/match/distinfo
index 6424872ca281..fb926a387114 100644
--- a/astro/match/distinfo
+++ b/astro/match/distinfo
@@ -1,2 +1,2 @@
-SHA256 (match-0.14.tar.gz) = f4afc1275ca1ce4447810c6d85f9b708f479fb27f3ce31503dcfcdaef2f252ec
-SIZE (match-0.14.tar.gz) = 180101
+SHA256 (match-0.15.tar.gz) = 73e7ba7ce43fae657e2845515c2bb77e52fe8ae10bf24fc51a0a94340203a102
+SIZE (match-0.15.tar.gz) = 194219
diff --git a/astro/match/pkg-descr b/astro/match/pkg-descr
index a98ca6cc025b..38a7d368c108 100644
--- a/astro/match/pkg-descr
+++ b/astro/match/pkg-descr
@@ -1,14 +1,18 @@
 This program is designed to match up items in two different lists, which may
 have two different systems of coordinates. The program allows the two sets of
-coordinates to be related by a linear, quadratic, or cubic transformation. It
-is an implementation of the algorithm described in Valdes et al., Publications
-of the Astronomical Society of the Pacific, vol 107, page 1119 (1995).
+coordinates to be related by a linear, quadratic, or cubic transformation.
+There was a major change in version 0.15: the first stage uses the clever method
+of finding the most likely triangles described in Tabur, Publications of the
+Astronomical Society of Australia, vol 24 , page 189 (2007). This replaces the
+more brute-force-ish method of Valdes et al., Publications of the Astronomical
+Society of the Pacific, vol 107, page 1119 (1995), which was employed in version
+up to 0.14.
 
 The program was designed and written to work on lists of stars and other
 astronomical objects, but it might be applied to other types of data. In order
 to match two lists of N points, the main algorithm calls for O(N^6) operations
 (yes, that's N-to-the-sixth), so it's not the most efficient choice. I find
-myself becoming impatient for N >= 100, but your mileage may vary. On the
-other hand, it does allow for arbitrary translation, rotation, and scaling...
+myself becoming impatient for N >= 100, but your mileage may vary. On the other
+hand, it does allow for arbitrary translation, rotation, and scaling... 
 
 WWW: http://spiff.rit.edu/match/