summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJakov Smolić <jsmolic@gentoo.org>2022-08-21 23:36:28 +0200
committerJakov Smolić <jsmolic@gentoo.org>2022-08-21 23:50:29 +0200
commitf3c99b9619bccec04432671874ed0393a3454e52 (patch)
tree367e83b6079864339a05ef28009b48b2f4ca0768 /dev-haskell/psqueue
parentdev-haskell/publicsuffixlist: treeclean (diff)
downloadgentoo-f3c99b9619bccec04432671874ed0393a3454e52.tar.gz
gentoo-f3c99b9619bccec04432671874ed0393a3454e52.tar.bz2
gentoo-f3c99b9619bccec04432671874ed0393a3454e52.zip
dev-haskell/psqueue: treeclean
Signed-off-by: Jakov Smolić <jsmolic@gentoo.org>
Diffstat (limited to 'dev-haskell/psqueue')
-rw-r--r--dev-haskell/psqueue/Manifest1
-rw-r--r--dev-haskell/psqueue/metadata.xml17
-rw-r--r--dev-haskell/psqueue/psqueue-1.1.0.1.ebuild36
3 files changed, 0 insertions, 54 deletions
diff --git a/dev-haskell/psqueue/Manifest b/dev-haskell/psqueue/Manifest
deleted file mode 100644
index 3c4a85c6de5d..000000000000
--- a/dev-haskell/psqueue/Manifest
+++ /dev/null
@@ -1 +0,0 @@
-DIST PSQueue-1.1.0.1.tar.gz 6408 BLAKE2B 5852064aabcea6e9495234cf16d4292878ed5b645fa822aaafb5d1bc869ba2fc30ce83ef4b5fa009faae4616b814cc776f796b38f51bae877324194755ab5bcb SHA512 76d5cd09d7955c4d7500b7e68fd4776b84d5cbbcc6eb1a101549119e11fdd8a452bc87cb473eef37655a18f5a5e616d126e020edb907901feae77a0b10b86eb9
diff --git a/dev-haskell/psqueue/metadata.xml b/dev-haskell/psqueue/metadata.xml
deleted file mode 100644
index 8d1d3cb246f9..000000000000
--- a/dev-haskell/psqueue/metadata.xml
+++ /dev/null
@@ -1,17 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<!DOCTYPE pkgmetadata SYSTEM "https://www.gentoo.org/dtd/metadata.dtd">
-<pkgmetadata>
- <maintainer type="project">
- <email>haskell@gentoo.org</email>
- <name>Gentoo Haskell</name>
- </maintainer>
- <longdescription>
- A /priority search queue/ efficiently supports the
- opperations of both a search tree and a priority queue. A
- 'Binding' is a product of a key and a priority. Bindings
- can be inserted, deleted, modified and queried in
- logarithmic time, and the binding with the least priority
- can be retrieved in constant time. A queue can be built
- from a list of bindings, sorted by keys, in linear time.
- </longdescription>
-</pkgmetadata>
diff --git a/dev-haskell/psqueue/psqueue-1.1.0.1.ebuild b/dev-haskell/psqueue/psqueue-1.1.0.1.ebuild
deleted file mode 100644
index acc11464c422..000000000000
--- a/dev-haskell/psqueue/psqueue-1.1.0.1.ebuild
+++ /dev/null
@@ -1,36 +0,0 @@
-# Copyright 1999-2020 Gentoo Authors
-# Distributed under the terms of the GNU General Public License v2
-
-EAPI=7
-
-# ebuild generated by hackport 0.6.4.9999
-
-CABAL_FEATURES="lib profile haddock hoogle hscolour"
-inherit haskell-cabal
-
-MY_PN="PSQueue"
-MY_P="${MY_PN}-${PV}"
-
-DESCRIPTION="Priority Search Queue"
-HOMEPAGE="https://hackage.haskell.org/package/PSQueue"
-SRC_URI="https://hackage.haskell.org/package/${MY_P}/${MY_P}.tar.gz"
-
-LICENSE="BSD"
-SLOT="0/${PV}"
-KEYWORDS="~amd64 ~x86"
-IUSE=""
-
-RDEPEND=">=dev-lang/ghc-7.4.1:=
-"
-DEPEND="${RDEPEND}
- >=dev-haskell/cabal-2.0
-"
-
-S="${WORKDIR}/${MY_P}"
-
-src_prepare() {
- default
-
- cabal_chdeps \
- 'base >= 4.3 && < 4.13' 'base >= 4.3'
-}