/
opam
37 lines (31 loc) · 1.18 KB
/
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
opam-version: "2.0"
maintainer: "Sam Riyad"
authors: ["Sam Riyad"]
tags: ["networking" "load balancing" "scalability"]
license: "MIT"
homepage: "https://github.com/xnukernpoll/ocaml-balancers"
dev-repo: "git+https://github.com/xnukernpoll/ocaml-balancers.git"
bug-reports: "https://github.com/xnukernpoll/ocaml-balancers/issues"
build: [
[ "jbuilder" "subst" ] {pinned}
[ "jbuilder" "build" "-p" name "-j" jobs ]
]
depends: [
"ocaml"
"jbuilder" {>= "1.0+beta7"}
"fmt"
"cstruct" {< "6.1.0"}
"lwt"
"hex"
"react"
]
synopsis:
"A collection of load balancing algorithms implemented in pure Ocaml"
description: """
The supported Algorithms are Power of two choices, P2C with Partial Key Grouping (Kafka uses this) , Round Robin, Consistent Hashing, and Consistent Hashing + Least loaded.
Each loadbalancer supports state updates via react (making it easier to work service discovery utilities), along with manually removing and deleting nodes.
Also included are utilities for thread safe shared state under Balancer.Util."""
url {
src: "https://github.com/XnuKernPoll/ocaml-balancers/archive/v1.0.tar.gz"
checksum: "md5=9dc229881dfea7372e065feb1572afba"
}