A data structure to find smallest key that is larger than the query.
Suppose we have a following weight dependent price table.
weight,price
100,10
200,15
500,30
,50
The price is decided by the smallest entry whose weight
key is larger than the query.
examples
sh
cargo add threshold_dict
A ThresholdDict
can be created by passing kv pairs and a default value. If query is larger than any of the keys, the default value is used.
```rust let kvpairs = vec![(100, 10), (200, 15), (500, 30)]; let defaultvalue = 50; let dict = ThresholdDict::new(kvparis, defaultvalue);
assert_eq!(dict.get(90), 10); ```