How to have multiple ownership on String with high performance?

Runnable code:

use std::rc::Rc;
#[derive(Clone, Debug)]
struct State{
    pub id:Rc<String>,
impl State{
    pub fn id(&mut self) {"".to_string());

fn place_a_piece<'a>(dedup_ids:&mut Vec<Rc<String>>, states:&mut Vec<State>){
    let mut state=State{id:Rc::new("".to_string())};

    // In real game program, the following logics will be executed 80000+ times,
    // to simplify, shrink it just like this eliding all gaming logics.
    let  mut spawned_state=state.clone();

fn main(){
    let size=90_000;
    let mut dedup_ids:Vec<Rc<String>>=Vec::with_capacity(size);
    let mut state:Vec<State>=Vec::with_capacity(size);
    let now = std::time::Instant::now();
    for _ in 0..90_000 {
        place_a_piece(&mut dedup_ids, &mut state);
    println!("{:?}", now.elapsed());


  1. Let State be real owner of's content.
  2. Anywhere else containers like 'dedup_ids' only holds some kind of reference pointing to without copying its content around.

What I did:

  1. Using Rc instead of String.clone() in function place_a_piece().

What I found:

  1. It turns out Rc does not make big difference at all.


  1. Is lifetime a faster solution? How?
  2. What could be the speedy way to fulfill the expectation? I'm desperate for speed.
  3. Is the manual way of cloning State is a faster way to do the same job than simply using Clone in attributes as the code does?

"".to_string() won't make any heap allocation because it's an empty string, so your Rc solution is actually making more heap allocations. Also, Rc<String> allocates at least 56 bytes, so it might still be worse than having two Strings with less than 56 ascii characters.

Consider using normal references if you can, they're always faster. The downside is that you'll have to deal with lifetimes.

You may also consider to use smallstrings if you think you're allocating a lot of small sized (like, less than 20 bytes/ascii character) Strings, or even a fixed sized array if you know your id has a fixed size. In these cases cloning/copying them should be pretty cheap.

Finally there's Rc<String> if none of the above works. This generally the case for when references are not an option and you need to share many big Strings.

…and if OP doesn't need to mutate the string, then Rc<str> is probably better than Rc<String>, because it's only one level of indirection instead of two.


I'm not getting my head around lifetime yet. Maybe fix sized array is a choice, but I need to be de-duplicated, that relates to determining if one array is equal to another, I'll try harder on lifetime and array.

Actually lelt method return &str is my first choice, it works even without Rc, but previously I posted the codes of method for optimization (topic='Focus on String, Rust vs Java, 5.23 seconds vs 464 milliseconds?'), it turns out that guys here suggested should return String to reduce the time complexity, this is where this post comes from.

Hi, where did you get '56 bytes'. Here is what I tried:

impl State{
    pub fn id(&mut self) {"123456789".to_string());
        println!("a={}", std::mem::size_of_val(Rc::get_mut(&mut;
        println!("b={}", std::mem::size_of_val(&;
        println!("c={}", std::mem::size_of::<Rc<String>>());


BTW: How to explain 2=24?

The Rc is 8 bytes stored inline. It points to its allocation, which contains a strong count (8 bytes), a weak count (8 bytes) and a String (24 bytes for pointer, length and capacity). So it's only 48 bytes, but if the string actually allocates it'll be more.

Arrays implement both Eq and Hash if their elements do.

In that thread and the suggestion was to return a String because you weren't storing it anywhere and leaking without a reason is really bad. However if your State struct owns the String then you can return a &str that points to it.

a is the size of a String. It consists of a pointer, the length and the capacity, all of them are the same size of usize, which on a 64bit machine is 8 byte. 3*8 = 24 bytes total
b is the size of of a Rc<String>, which is just a pointer, 8 bytes
c is the same as b

However these sizes ignore what is allocated on the heap. As @Kestrer showed an Rc<String> allocates 40 bytes (yeah, I messed up a bit there) on the heap.

2? Do you mean a?


Sorry, I mean how to explain a=24

Oh, thank you very much, String consists of two parts spatially, I forgot that, that is often the way Rust is working, I should always keep that in mind. So actually, what I'm sizing is all about what's sitting in the stack rather than the data content on the heap as you clearly pointed out.

But that leads to the cost of converting String to &str.

That "cost" is just a cost of copying a pointer-length pair.

1 Like

Followed @SkiFire13's idea as he mentioned before, "cloning array is cheap", now I let be [usize;20], it turns out really fast, but with one not-good-enough, cloning. Do you (@SkiFire13 ) think Rc<[usize;20]> will be faster than [usize;20] alone with no cloning? Thanks to @Cerberuser, I think [usize;20] is faster than growing String then converting it into &str.

Sorry, accidentally reply to myself, don't know how to change.

My experiment shows that sharing reference with Rc<[usize;20]> is slower than cloning [usize;20].

[usize; 20] has a size of 160 bytes (on a 64bit machine) which sounds like a lot of bytes for an id. For comparison, GUIDs and UUIDs are both just 16 bytes and even that may be a bit too much depending on what you're doing. You could consider reducing the size of the id to speed up copying it. For example just brining it down to [usize; 16] will allow to skip a call to memcpy (godbolt link), but if you're using incremental ids a u64 will be even better.


My experiment shows that sharing reference with Rc<[usize;20]> is slower than cloning [usize;20].

Makes sense. When you clone a Rc, it's doing arithmetic, comparison, branching, and using pointers. When you clone a [usize; 20], it's just copying bytes from one location to another.