|
|
|
|
@ -59,7 +59,7 @@ In this implementation, Rust's [BTreeMap](https://doc.rust-lang.org/beta/std/col |
|
|
|
|
which is supposed to provide the same logarithmic asymptotic complexity in practice. |
|
|
|
|
Range starts are used as keys and range ends as values. |
|
|
|
|
|
|
|
|
|
Memory requirements are `O(log(number of ranges))` plus combined length of all host types. |
|
|
|
|
Memory requirements are `O(number of ranges)` plus combined length of all host types. |
|
|
|
|
|
|
|
|
|
Constant factors were not considered in this implementation. |
|
|
|
|
|
|
|
|
|
|
