Thanks to everyone for discussion in MagicRc, MagicWeak, MagicHashSet , it greatly clarified the question, which I am reposting here. Suppose we have a 2D table. In the top row, we have obj-id. In the left colunmn, we have snapshot-id. Some (not all) cells are filled in. snapshots only contain so…

Usually for this sort of thing, you’ll have a main storage that’s organized in row-major or column-major order depending in your primary access pattern which contains owned copies of all the cells. The following assumes you chose row-major; column-major works similarly. Deleting a row is simply re…

2d table dropping of objects

anon80458984 September 4, 2020, 2:10am 3

I do not understand the focus on sparsity / high performance.

IMHO, the core of the issue is we need a 'table cell' that drops when EITHER snapshot-id drops or obj-id drops.

MagicRc, MagicWeak, MagicHashSet

Topic		Replies	Views
2D arrays, lack of help	12	1799	November 26, 2022
Memory-friendly 2d array with variable-length rows	9	406	December 2, 2023
First Rust project - how do I deal with memory leaks? help	12	1996	January 12, 2023
Best way to initialize array of 'drop' objects inplace help	74	4100	June 11, 2022
Hashmap<K, Weak<V>> that auto drops the 0-strong-count Weak<V>'s?	8	348	December 14, 2023

2d table dropping of objects

Related Topics