kpriv/pkgsrc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
pkgsrc/devel/libdatrie/Makefile

28 lines
664 B
Makefile
Raw Normal View History

Fix build on SunOS.
2012-02-16 19:45:59 +01:00
# $NetBSD: Makefile,v 1.9 2012/02/16 18:46:51 hans Exp $
Import libdatrie version 0.1.3. datrie is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.
2008-02-11 03:11:24 +01:00
#
Update libdatrie to 0.2.5. 0.2.5 (2011-11-04) ===== - Fix missing 'extern "C"' in header file. [Patch from Aurimas Černius] - Minor documentation fix.
2011-12-06 12:06:51 +01:00
DISTNAME= libdatrie-0.2.5
Import libdatrie version 0.1.3. datrie is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.
2008-02-11 03:11:24 +01:00
CATEGORIES= devel
Update libdatrie to 0.2.2. 0.2.2 (2009-04-29) ===== - Support building with linkers without symbol versioning supports, including Mac, Cygwin, MinGW. - Support other iconv implementations than that's in glibc, for Mac and MinGW. 0.2.1 (2009-04-05) ===== - Fix errors in documentation - Symbol versioning to ease upgrade across SONAME - Minor cleanups 0.2.0 (2009-03-24) ===== - New APIs for performance: trie_state_copy(), trie_state_is_single() - Clean-ups 0.1.99.2 (2008-12-15) ======== - More robust handling of alphabet ranges - Allow co-existence with libdatrie0 0.1.99.1 (2008-12-12) ======== - Breaking ABI with libdatrie0 - More capacity with 32-bit node index - Adjusted API for non-file trie usage - All data in one file, no more *.br and *.tl split - Drop SBTrie wrapper; all features are merged into Trie - Domain characters are now Unicode
2009-05-15 10:52:42 +02:00
MASTER_SITES= http://linux.thai.net/pub/thailinux/software/libthai/ \
ftp://linux.thai.net/pub/ThaiLinux/software/libthai/
Import libdatrie version 0.1.3. datrie is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.
2008-02-11 03:11:24 +01:00
MAINTAINER= obache@NetBSD.org
HOMEPAGE= http://linux.thai.net/~thep/datrie/datrie.html
COMMENT= Implementation of Double-Array Trie
Update libdatrie to 0.2.2. 0.2.2 (2009-04-29) ===== - Support building with linkers without symbol versioning supports, including Mac, Cygwin, MinGW. - Support other iconv implementations than that's in glibc, for Mac and MinGW. 0.2.1 (2009-04-05) ===== - Fix errors in documentation - Symbol versioning to ease upgrade across SONAME - Minor cleanups 0.2.0 (2009-03-24) ===== - New APIs for performance: trie_state_copy(), trie_state_is_single() - Clean-ups 0.1.99.2 (2008-12-15) ======== - More robust handling of alphabet ranges - Allow co-existence with libdatrie0 0.1.99.1 (2008-12-12) ======== - Breaking ABI with libdatrie0 - More capacity with 32-bit node index - Adjusted API for non-file trie usage - All data in one file, no more *.br and *.tl split - Drop SBTrie wrapper; all features are merged into Trie - Domain characters are now Unicode
2009-05-15 10:52:42 +02:00
LICENSE= gnu-lgpl-v2.1
Import libdatrie version 0.1.3. datrie is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.
2008-02-11 03:11:24 +01:00
PKG_DESTDIR_SUPPORT= user-destdir
GNU_CONFIGURE= yes
USE_LIBTOOL= yes
USE_TOOLS+= pkg-config
Fix build on SunOS.
2012-02-16 19:45:59 +01:00
LIBS.SunOS+= -liconv
Update libdatrie to 0.2.2. 0.2.2 (2009-04-29) ===== - Support building with linkers without symbol versioning supports, including Mac, Cygwin, MinGW. - Support other iconv implementations than that's in glibc, for Mac and MinGW. 0.2.1 (2009-04-05) ===== - Fix errors in documentation - Symbol versioning to ease upgrade across SONAME - Minor cleanups 0.2.0 (2009-03-24) ===== - New APIs for performance: trie_state_copy(), trie_state_is_single() - Clean-ups 0.1.99.2 (2008-12-15) ======== - More robust handling of alphabet ranges - Allow co-existence with libdatrie0 0.1.99.1 (2008-12-12) ======== - Breaking ABI with libdatrie0 - More capacity with 32-bit node index - Adjusted API for non-file trie usage - All data in one file, no more *.br and *.tl split - Drop SBTrie wrapper; all features are merged into Trie - Domain characters are now Unicode
2009-05-15 10:52:42 +02:00
PKGCONFIG_OVERRIDE+= datrie-0.2.pc.in
Import libdatrie version 0.1.3. datrie is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.
2008-02-11 03:11:24 +01:00
CONFIGURE_ARGS+= --disable-doxygen-doc
Update libdatrie to 0.2.2. 0.2.2 (2009-04-29) ===== - Support building with linkers without symbol versioning supports, including Mac, Cygwin, MinGW. - Support other iconv implementations than that's in glibc, for Mac and MinGW. 0.2.1 (2009-04-05) ===== - Fix errors in documentation - Symbol versioning to ease upgrade across SONAME - Minor cleanups 0.2.0 (2009-03-24) ===== - New APIs for performance: trie_state_copy(), trie_state_is_single() - Clean-ups 0.1.99.2 (2008-12-15) ======== - More robust handling of alphabet ranges - Allow co-existence with libdatrie0 0.1.99.1 (2008-12-12) ======== - Breaking ABI with libdatrie0 - More capacity with 32-bit node index - Adjusted API for non-file trie usage - All data in one file, no more *.br and *.tl split - Drop SBTrie wrapper; all features are merged into Trie - Domain characters are now Unicode
2009-05-15 10:52:42 +02:00
.include "../../converters/libiconv/buildlink3.mk"
Import libdatrie version 0.1.3. datrie is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries.
2008-02-11 03:11:24 +01:00
.include "../../mk/bsd.pkg.mk"
Reference in a new issue Copy permalink