opam-version: "2.0"
synopsis: "Fast combinatorics functions for OCaml."
description: """
combinat provides fast iterators over combinatorial objects such as
permutations, combinations, and integer partitions."""
maintainer: "Jack Feser <feser@csail.mit.edu>"
authors: "Jack Feser <feser@csail.mit.edu>"
homepage: "https://github.com/jfeser/combinat"
doc: "https://jfeser.github.io/combinat/"
bug-reports: "https://github.com/jfeser/combinat/issues"
depends: [
  "ocaml" {>= "4.06"}
  "dune" {>= "1.7"}
  "base" {>= "v0.12"}
  "stdio" {>= "v0.12"}
  "ppx_sexp_conv" {>= "v0.12"}
  "ppx_expect" {>= "v0.12"}
  "core_bench" {with-test & >= "v0.12"}
]
build: ["dune" "build" "-p" name "-j" jobs]
dev-repo: "git+https://github.com/jfeser/combinat.git"
url {
  src:
    "https://github.com/jfeser/combinat/releases/download/1.0/combinat-1.0.tbz"
  checksum: [
    "sha256=6376a91c6d0b82f41a0ef0c857f851486c9de5f9e817ae36141ca86ee60259cb"
    "md5=122247fb70b1bda02818e023de7165c7"
  ]
}