A simple, correct implementation of interval_map
Find a file
Bruno BELANYI dc3408524b
Some checks failed
ci/woodpecker/push/check Pipeline failed
Make implementation follow assignment rules
The assignment wants us to use exactly *one* O(log(N)) call. Hence the
single usage of `upper_bound`.

It also wants us to use a minimal amount of operations on `K` and `V`
values in the map. Finally it asks us to make the answer simple.
2024-08-24 20:24:42 +01:00
.woodpecker Bootstrap project 2024-08-23 21:28:41 +01:00
src Make implementation follow assignment rules 2024-08-24 20:24:42 +01:00
tests Add randomized test 2024-08-24 19:27:36 +01:00
.clang-format Bootstrap project 2024-08-23 21:28:41 +01:00
.envrc Bootstrap project 2024-08-23 21:28:41 +01:00
.gitignore Bootstrap project 2024-08-23 21:28:41 +01:00
.pre-commit-config.yaml Bootstrap project 2024-08-23 21:28:41 +01:00
flake.lock Bootstrap project 2024-08-23 21:28:41 +01:00
flake.nix Bootstrap project 2024-08-23 21:28:41 +01:00
meson.build Bootstrap project 2024-08-23 21:28:41 +01:00