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
The price is decided by the smallest entry whose weight
key is greater than or equal to the query.
examples
- weight=90 -> price=10
- weight=100 -> price=10
- weight=250 -> price=30
- weight=600 -> price=Not Found
cargo add threshold_dict
A ThresholdDict
can be created by passing kv pairs. If query is greater than all of the keys, None is returned.
let kv_pairs = vec![(100, 10), (200, 15), (500, 30)];
let dict = ThresholdDict::from(kv_pairs);
assert_eq!(dict.query(&90), Some(&10));
assert_eq!(dict.query(600), None);