Adding metadata

4 files changed, 0 insertions, 112 deletions

diff --git a/dev-libs/libdatrie/Manifest b/dev-libs/libdatrie/Manifest
deleted file mode 100644
index 89c105c585f1..000000000000
--- a/dev-libs/libdatrie/Manifest
+++ /dev/null
@@ -1 +0,0 @@
-DIST libdatrie-0.2.14.tar.xz 325696 BLAKE2B 2d5036d360df09293d61f8233a737b80f41526c7f3d9a49a724817751ca0a3445fb161bdd86678d54d910053516dbe391d506eae166c9f3034a750a6928af3f7 SHA512 c5df387a1c9b5fae65eff69102651f4f054d873194d97faa8e329282353156fa4fb41a1ea771b24ade3f0ad2a548d85d7950a4aa6ed4e5c356bc504720e792d1
diff --git a/dev-libs/libdatrie/libdatrie-0.2.14-r1.ebuild b/dev-libs/libdatrie/libdatrie-0.2.14-r1.ebuild
deleted file mode 100644
index a521fcfc3e57..000000000000
--- a/dev-libs/libdatrie/libdatrie-0.2.14-r1.ebuild
+++ /dev/null
@@ -1,36 +0,0 @@
-# Copyright 1999-2026 Gentoo Authors
-# Distributed under the terms of the GNU General Public License v2
-
-EAPI=8
-
-DESCRIPTION="Double-Array Trie Library"
-HOMEPAGE="
-	https://linux.thai.net/projects/datrie
-	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}/releases/download/v${PV}/${P}.tar.xz"
-	KEYWORDS="~amd64 ~arm ~arm64 ~riscv ~x86"
-fi
-
-LICENSE="LGPL-2.1+"
-# Subslot: LT_CURRENT - LT_AGE from configure.ac (5 - 4 = 1)
-SLOT="0/1"
-IUSE="doc"
-
-BDEPEND="doc? ( >=app-text/doxygen-1.9.8 )"
-
-src_configure() {
-	econf \
-		$(use_enable doc doxygen-doc) \
-		--with-html-docdir="${EPREFIX}"/usr/share/doc/${PF}/html
-}
-
-src_install() {
-	default
-	find "${ED}" -name '*.la' -delete || die
-}
diff --git a/dev-libs/libdatrie/libdatrie-0.2.14.ebuild b/dev-libs/libdatrie/libdatrie-0.2.14.ebuild
deleted file mode 100644
index 0c6747958ef5..000000000000
--- a/dev-libs/libdatrie/libdatrie-0.2.14.ebuild
+++ /dev/null
@@ -1,45 +0,0 @@
-# Copyright 1999-2026 Gentoo Authors
-# Distributed under the terms of the GNU General Public License v2
-
-EAPI=8
-
-inherit autotools
-
-DESCRIPTION="Double-Array Trie Library"
-HOMEPAGE="
-	https://linux.thai.net/projects/datrie
-	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}/releases/download/v${PV}/${P}.tar.xz"
-	KEYWORDS="~amd64 ~arm ~arm64 ~riscv ~x86"
-fi
-
-LICENSE="LGPL-2.1+"
-# Subslot: LT_CURRENT - LT_AGE from configure.ac (5 - 4 = 1)
-SLOT="0/1"
-IUSE="doc"
-
-BDEPEND="doc? ( >=app-text/doxygen-1.9.8 )"
-
-src_prepare() {
-	default
-	# Fixed version if in non git project
-	echo ${PV} > VERSION
-	eautoreconf
-}
-
-src_configure() {
-	econf \
-		$(use_enable doc doxygen-doc) \
-		--with-html-docdir="${EPREFIX}"/usr/share/doc/${PF}/html
-}
-
-src_install() {
-	default
-	find "${ED}" -name '*.la' -delete || die
-}
diff --git a/dev-libs/libdatrie/metadata.xml b/dev-libs/libdatrie/metadata.xml
deleted file mode 100644
index ea3c0291a80c..000000000000
--- a/dev-libs/libdatrie/metadata.xml
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<!DOCTYPE pkgmetadata SYSTEM "https://docs.baldeagleos.com/dtd/metadata.dtd">
-<pkgmetadata>
-  <maintainer type="person">
-    <email>vowstar@gmail.com</email>
-    <name>Huang Rui</name>
-  </maintainer>
-  <maintainer type="project">
-    <email>proxy-maint@gentoo.org</email>
-    <name>Proxy Maintainers</name>
-  </maintainer>
-  <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>
-  <longdescription lang="zh">
-	这是由 Junichi Aoe 提出的用于表示 Trie（字典树）的双数组结构实现。
-	Trie 是一种数字搜索树，是一种高效的索引方法，其搜索时间与数据库大小无关。
-	它只需要 O(m) 的搜索时间，其中 m 是搜索字符串的长度。与哈希一样高效的同时，
-	Trie 还提供了增量匹配和键拼写操作的灵活性。这使其非常适合用于词法分析器和
-	拼写词典。
-	</longdescription>
-  <origin>baldeagleos-repo</origin>
-</pkgmetadata>