subset_sum 0.20.0

Solves subset sum problem and returns a set of decomposed integers. It also can match corresponding numbers from two vectors and be used for Account reconciliation.
Documentation 
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

[dependencies.itertools]
version = "0.10.2"

[dependencies.pyo3]
features = ["extension-module"]
optional = true
version = "0.16.1"

[dependencies.rayon]
version = "1"

[dependencies.wasm-bindgen]
optional = true
version = "0.2.79"

[features]
python = ["pyo3"]
wasm = ["wasm-bindgen"]

[lib]
crate-type = ["cdylib", "rlib"]
name = "dpss"

[package]
authors = ["Tomohiro Endo <europeanplaice@gmail.com>"]
categories = ["algorithms"]
description = "Solves subset sum problem and returns a set of decomposed integers. It also can match corresponding numbers from two vectors and be used for Account reconciliation."
edition = "2018"
keywords = ["dynamic_programming", "subset_sum", "accounting"]
license = "MIT"
name = "subset_sum"
readme = "readme.md"
repository = "https://github.com/europeanplaice/subset_sum"
version = "0.20.0"
[profile.release]
codegen-units = 1
lto = true