opam-version: "2.0"
synopsis: "Resizable arrays with fast insertion/deletion"
description: """

- O(1) constant time for random access `arr.(i)` and updates `arr.(i) <- v`
- O(1) amortized for `push_front` and `pop_front`, `push_back` and `pop_back` to add or remove an element to the start or the end
- O(sqrt N) for `insert_at arr i x` and `delete_at arr i` to insert or delete an element anywhere else

This datastructure was invented by Goodrich and Kloss and is described in their paper "Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences"."""
maintainer: ["art.wendling@gmail.com"]
authors: ["Arthur Wendling"]
license: "MIT"
homepage: "https://github.com/art-w/varray"
bug-reports: "https://github.com/art-w/varray/issues"
depends: [
  "dune" {>= "2.8"}
  "ocaml" {>= "4.08"}
  "monolith" {with-test}
  "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/varray.git"
url {
  src: "https://github.com/art-w/varray/releases/download/0.1/varray-0.1.tbz"
  checksum: [
    "sha256=69a22c87d9eb4cd27ddd74b24d9fd6fe4e3ec28781012f6eb99203a9fb78e167"
    "sha512=c5c2292a1eff693d8f10a7b398b1924b17ab3d7b84788f94e689460106df5f41f7bba3e0e30b51f9faaba88db7b502448f4850c344a4765bfd2e37da7fe7f460"
  ]
}
x-commit-hash: "d08aa2c0e2ea1773b57cc2319a7a391385fa6d0f"