Just wanted to say thanks for making this crate! Had that moment where I realized that a BTreeMap's ordering was based on Ord of K and not insertion. This just solved my problem and didn't require me to create a new struct and implement Ord. Thank you for making it so simple!
Just wanted to say thanks for making this crate! Had that moment where I realized that a BTreeMap's ordering was based on Ord of
Kand not insertion. This just solved my problem and didn't require me to create a new struct and implement Ord. Thank you for making it so simple!