this repo has no description
anil.recoil.org
1opam-version: "2.0"
2maintainer: "byvoid@byvoid.com"
3authors: ["BYVoid <byvoid@byvoid.com>"]
4homepage: "https://github.com/BYVoid/Dlist"
5license: "BSD-3-Clause"
6build: [
7 ["ocp-build" "-init"]
8 ["ocp-build" "build"]
9]
10remove: [
11 ["ocp-build" "-init"]
12 ["ocp-build" "build"]
13 ["ocp-build" "uninstall"]
14]
15depends: [
16 "ocaml" {>= "4.00.1"}
17 "ocp-build" {>= "1.99.6-beta"}
18]
19depopts: [
20 "core_bench"
21 "ounit"
22]
23conflicts: [
24 "core_bench" {< "109.41.00"}
25]
26dev-repo: "git+https://github.com/BYVoid/Dlist"
27install: ["ocp-build" "install"]
28synopsis:
29 "A purely functional list-like data structure supporting O(1) concatenation"
30description: """
31Dlist (Difference List) is a purely functional list-like data structure supporting O(1) concatenation. This is particularly useful for efficient list construction from many lists. Dlist is a lazy immutable data type with no side effect.
32
33This data structure is very handy when your algorithm requires lots of concatenations from many lists.
34
35The idea is inspired by Haskell Data.Dlist and the APIs are influenced by Core.List.
36
37Project: https://github.com/BYVoid/Dlist
38
39Documentation: http://byvoid.github.io/Dlist/Dlist.html"""
40url {
41 src: "https://github.com/BYVoid/Dlist/archive/v0.1.0.tar.gz"
42 checksum: [
43 "sha256=2a2c413ee36b824f65e4173f1d80a15de168f11a2bfaf2dfd48e25788732f5f9"
44 "md5=c1d4231c188b6e512e5037a32ed99039"
45 ]
46}