dev-libs/libdatrie: Double-Array Trie Library

Package-Manager: Portage-3.0.20, Repoman-3.0.3
Signed-off-by: Huang Rui <vowstar@gmail.com>

dev-libs/libdatrie/Manifest

@@ -0,0 +1 @@
+DIST libdatrie-0.2.13.tar.gz 109963 BLAKE2B e4314a8ba78067963fdc3dc948238fda2ef4b1692fb4c5213ad4f1d082d0393bccc2c15d686e7e06d2d264c56e93048461e481e0807c4996d5d395e2ed6f58d4 SHA512 38f5a3ee1f3ca0f0601a5fcfeec3892cb34857d4b4720b8e018ca1beb6520c4c10af3bd2f0e4d64367cb256e8e2bca4d0a59b1c81fb36782613d2c258b64df59

dev-libs/libdatrie/libdatrie-0.2.13.ebuild

@@ -0,0 +1,39 @@
+# Copyright 1999-2021 Gentoo Authors
+# Distributed under the terms of the GNU General Public License v2
+
+EAPI=7
+
+inherit autotools
+
+DESCRIPTION="Double-Array Trie Library"
+HOMEPAGE="https://github.com/tlwg/libdatrie"
+
+if [[ ${PV} == "9999" ]] ; then
+	inherit git-r3
+	EGIT_REPO_URI="https://github.com/tlwg/${PN}.git"
+else
+	SRC_URI="https://github.com/tlwg/${PN}/archive/v${PV}.tar.gz -> ${P}.tar.gz"
+	KEYWORDS="~amd64 ~arm ~arm64 ~riscv ~x86"
+fi
+
+LICENSE="LGPL-2.1"
+SLOT="0"
+
+RDEPEND=""
+DEPEND="${RDEPEND}"
+BDEPEND="dev-vcs/git"
+
+src_prepare() {
+	default
+	# Fixed version if in non git project
+	echo ${PV} > VERSION
+	# From upstreams autogen.sh, to make it utilize the autotools eclass
+	# Here translate the autogen.sh, equivalent to the following code
+	# > sh autogen.sh
+	eautoheader
+	_elibtoolize --force
+	eaclocal
+	eautomake --add-missing
+	# Not allow git-version-gen does refresh
+	eautoconf
+}

dev-libs/libdatrie/metadata.xml

@@ -0,0 +1,21 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
+<pkgmetadata>
+	<maintainer type="person">
+		<email>vowstar@gmail.com</email>
+		<name>Huang Rui</name>
+	</maintainer>
+	<upstream>
+		<remote-id type="github">tlwg/libdatrie</remote-id>
+	</upstream>
+	<longdescription lang="en">
+	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 in which
+	search time is independent of database size. It only takes O(m) search time,
+	where m is the length of the search string. 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.
+	</longdescription>
+</pkgmetadata>