summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJakov Smolić <jsmolic@gentoo.org>2022-08-22 09:53:26 +0200
committerJakov Smolić <jsmolic@gentoo.org>2022-08-22 10:03:06 +0200
commit2b8e9a4f7260b42b6ba20a5deb07d9dfee807d19 (patch)
tree21f1c2b71b9fa94c554ba10ce471610f370244f7 /dev-haskell/chimera/metadata.xml
parentdev-haskell/chunked-data: treeclean (diff)
downloadgentoo-2b8e9a4f7260b42b6ba20a5deb07d9dfee807d19.tar.gz
gentoo-2b8e9a4f7260b42b6ba20a5deb07d9dfee807d19.tar.bz2
gentoo-2b8e9a4f7260b42b6ba20a5deb07d9dfee807d19.zip
dev-haskell/chimera: treeclean
Signed-off-by: Jakov Smolić <jsmolic@gentoo.org>
Diffstat (limited to 'dev-haskell/chimera/metadata.xml')
-rw-r--r--dev-haskell/chimera/metadata.xml37
1 files changed, 0 insertions, 37 deletions
diff --git a/dev-haskell/chimera/metadata.xml b/dev-haskell/chimera/metadata.xml
deleted file mode 100644
index 3cc879fea818..000000000000
--- a/dev-haskell/chimera/metadata.xml
+++ /dev/null
@@ -1,37 +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>
- <use>
- <flag name="representable">Define Representable instance from adjunctions package</flag>
- </use>
- <longdescription>
- There are plenty of memoizing libraries on Hackage, but they
- usually fall into two categories:
-
- * Store cache as a flat array, enabling us
- to obtain cached values in O(1) time, which is nice.
- The drawback is that one must specify the size
- of the array beforehand,
- limiting an interval of inputs,
- and actually allocate it at once.
- * Store cache as a lazy binary tree.
- Thanks to laziness, one can freely use the full range of inputs.
- The drawback is that obtaining values from a tree
- takes logarithmic time and is unfriendly to CPU cache,
- which kinda defeats the purpose.
-
- This package intends to tackle both issues,
- providing a data type 'Chimera' for
- lazy infinite compact streams with cache-friendly O(1) indexing.
-
- Additional features include:
-
- * memoization of recursive functions and recurrent sequences,
- * memoization of functions of several, possibly signed arguments,
- * efficient memoization of boolean predicates.
- </longdescription>
-</pkgmetadata>