-
Notifications
You must be signed in to change notification settings - Fork 4
/
deque.opam
37 lines (37 loc) · 1.17 KB
/
deque.opam
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
# This file is generated by dune, edit dune-project instead
opam-version: "2.0"
version: "0.1"
synopsis: "Purely Functional, Real-Time Deques with Catenation"
description: """
A double-ended queue is an ordered collection for which elements can be added and removed from the front and the back. This library provides a purely functional implementation, such that the following operations are all worst-case constant time:
- `cons` adds an element to the front of the deque
- `uncons` pops the left-most element
- `snoc` adds an element at the back
- `unsnoc` pops the right-most element
- `append` concatenates two deques
This datastructure was invented by Kaplan and Tarjan and is described in their paper by the same name."""
maintainer: ["[email protected]"]
authors: ["Arthur Wendling"]
license: "MIT"
homepage: "https://github.com/art-w/deque"
bug-reports: "https://github.com/art-w/deque/issues"
depends: [
"dune" {>= "2.8"}
"ocaml" {>= "4.08"}
"odoc" {with-doc}
]
build: [
["dune" "subst"] {dev}
[
"dune"
"build"
"-p"
name
"-j"
jobs
"@install"
"@runtest" {with-test}
"@doc" {with-doc}
]
]
dev-repo: "git+https://github.com/art-w/deque.git"