diff options
author | yyamano <yyamano> | 2008-01-14 09:46:45 +0000 |
---|---|---|
committer | yyamano <yyamano> | 2008-01-14 09:46:45 +0000 |
commit | b4d336a67e3a65a050cc33c8e9fd67672521cb64 (patch) | |
tree | f21a3a73a75c59b01cc96c7201222c951256114a /www/htdig-devel | |
parent | 5f97747117b1e9ea61060e20cc3051ba0bc59bd5 (diff) | |
download | pkgsrc-b4d336a67e3a65a050cc33c8e9fd67672521cb64.tar.gz |
Make this build on Darwin.
Diffstat (limited to 'www/htdig-devel')
-rw-r--r-- | www/htdig-devel/distinfo | 4 | ||||
-rw-r--r-- | www/htdig-devel/patches/patch-af | 13 |
2 files changed, 13 insertions, 4 deletions
diff --git a/www/htdig-devel/distinfo b/www/htdig-devel/distinfo index d78a1e12f80..8146c66e44d 100644 --- a/www/htdig-devel/distinfo +++ b/www/htdig-devel/distinfo @@ -1,10 +1,10 @@ -$NetBSD: distinfo,v 1.4 2006/07/02 14:36:31 markd Exp $ +$NetBSD: distinfo,v 1.5 2008/01/14 09:46:45 yyamano Exp $ SHA1 (htdig-3.2.0b6.tar.bz2) = 0b28134386e78fe724c56583fbc61b280551122a RMD160 (htdig-3.2.0b6.tar.bz2) = 1e0900e11618ffe3d43a6fc26163e3ed926a1012 Size (htdig-3.2.0b6.tar.bz2) = 2498246 bytes SHA1 (patch-aa) = 6f4d22f84fe8caa809c1062e210200d9cea1a555 -SHA1 (patch-af) = d366aeac016505fce044e6bbdff9506fa68877ba +SHA1 (patch-af) = 17b6f2f18c805cab76bd3b399057e035af16c70d SHA1 (patch-ag) = 6105b1526f31bb7b757c3ceeae286c7f2c0aa007 SHA1 (patch-ah) = e6e87151c7bd0a44d138d431bdcc7ce7f950d1ee SHA1 (patch-ai) = f49a6cf6bc385e1025c7aa90cb268e2117e61dab diff --git a/www/htdig-devel/patches/patch-af b/www/htdig-devel/patches/patch-af index 256b1f2652d..dca85343836 100644 --- a/www/htdig-devel/patches/patch-af +++ b/www/htdig-devel/patches/patch-af @@ -1,7 +1,16 @@ -$NetBSD: patch-af,v 1.1.1.1 2005/12/17 19:26:26 markd Exp $ +$NetBSD: patch-af,v 1.2 2008/01/14 09:46:45 yyamano Exp $ ---- htsearch/htsearch.cc.orig 2004-05-29 01:15:24.000000000 +1200 +--- htsearch/htsearch.cc.orig 2004-05-28 22:15:24.000000000 +0900 +++ htsearch/htsearch.cc +@@ -68,7 +68,7 @@ StringList collectionList; + // reconised word prefixes (for field-restricted search and per-word fuzzy + // algorithms) in *descending* alphabetical order. + // Don't use a dictionary structure, as setup time outweights saving. +-struct {char *name; unsigned int flag; } colonPrefix [] = ++static struct {char *name; unsigned int flag; } colonPrefix [] = + { + { "url", FLAG_URL }, + { "title", FLAG_TITLE }, @@ -211,8 +211,7 @@ main(int ac, char **av) } if (access((char*)configFile, R_OK) < 0) |