Add libdatrie 0.2.6, a double-array trie implementation library.

svn path=/head/; revision=311352

devel/Makefile

@@ -936,6 +936,7 @@
     SUBDIR += libdaemon
     SUBDIR += libdap
     SUBDIR += libdasm
+    SUBDIR += libdatrie
     SUBDIR += libdbusmenu-qt
     SUBDIR += libdfui
     SUBDIR += libdict

devel/libdatrie/Makefile

@@ -0,0 +1,26 @@
+# Created by: Alexey Dokuchaev <danfe@FreeBSD.org>
+# $FreeBSD$
+
+PORTNAME=	libdatrie
+PORTVERSION=	0.2.6
+CATEGORIES=	devel
+MASTER_SITES=	http://linux.thai.net/pub/thailinux/software/libthai/
+
+MAINTAINER=	danfe@FreeBSD.org
+COMMENT=	Double-array trie implementation library
+
+LICENSE=	LGPL21
+
+USE_XZ=		yes
+GNU_CONFIGURE=	yes
+USE_GNOME=	gnomehack
+USE_ICONV=	yes
+USE_LDCONFIG=	yes
+
+CPPFLAGS+=	-I${LOCALBASE}/include
+LDFLAGS+=	-L${LOCALBASE}/lib
+
+MAN1=		trietool-0.2.1
+PORTDOCS=	README.migration
+
+.include <bsd.port.mk>

devel/libdatrie/distinfo

@@ -0,0 +1,2 @@
+SHA256 (libdatrie-0.2.6.tar.xz) = 8cbefcad704a293d950aeb2fa87b67ee82d2d53f9c57cd1eb0bb9ab8cf3e99ab
+SIZE (libdatrie-0.2.6.tar.xz) = 269288

devel/libdatrie/pkg-descr

@@ -0,0 +1,10 @@
+This 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.
+
+WWW: http://linux.thai.net/projects/datrie/

devel/libdatrie/pkg-plist

@@ -0,0 +1,11 @@
+bin/trietool-0.2
+include/datrie/alpha-map.h
+include/datrie/trie.h
+include/datrie/triedefs.h
+include/datrie/typedefs.h
+lib/libdatrie.a
+lib/libdatrie.la
+lib/libdatrie.so
+lib/libdatrie.so.3
+libdata/pkgconfig/datrie-0.2.pc
+@dirrm include/datrie