Use weak tables to back the main consign

[lenianiva]

This way we don't need to manually garbage clean. e.g.

https://docs.rs/weak-table/latest/weak_table/struct.WeakValueHashMap.html

@AdrienChampion what do you think about this

[AdrienChampion]

The consign uses weak refs, so the node is freed, but with this kind of table the whole binding is removed, right?

[AdrienChampion]

Sounds interesting 😺

[lenianiva]

The consign uses weak refs, so the node is freed, but with this kind of table the whole binding is removed, right?

Yes. If the strong count drops to 0 then an element gets evicted from the consign.

The main issue of this is the table could not be parallelized easily. I don't know how important parallelization is to your application.

[AdrienChampion]

I don't use this crate (or Rust in general) anymore, but the main issue is that if you can't parallelize then having a global table is going to be a problem.

I would assume virtually all use cases have global tables but I could be wrong

[AdrienChampion]

Wait what do you mean by parallelizing the table? It's fine if it's behind a lock right?

[lenianiva]

Wait what do you mean by parallelizing the table? It's fine if it's behind a lock right?

There are some hash table implementations that allow for insertion/removal of elements without &mut access. e.g. https://github.com/ibraheemdev/papaya Therefore they don't require global locks.