`BTreeSet` composite key

help
1

When I have BTreeSet<String>, I can check that it contains some string via let s: &str = ...; set.contains(s) - no clone involved. But if I have BTreeSet<(i32, String)>, I cant just set.contains((number, s)), I need set.contains(&(number, s.to_string()). Is there some way to avoid needless allocations and fulfill the use case?

As I see it, Borrow trait as a solution for maps is poor, as it is extremely limited.

2

You could use Cow<str> instead of String.

3

How? Cow requires a lifetime, but set needs to be 'static. But &str is not.

4 
use std::borrow::Cow;
use std::collections::BTreeSet;

pub fn main() {
    let mut set: BTreeSet<(i32, Cow<str>)> = BTreeSet::new();
    
    set.insert((1, Cow::Owned("One".to_owned())));
    set.contains(&(1, Cow::Borrowed("One")));
}
5

You can do this with some dyn Trait tricks, but I think the coherence rules will require that you define your own key type instead of using a bare tuple.

3 Likes
6

This topic was automatically closed 90 days after the last reply. We invite you to open a new topic if you have further questions or comments.