Our great sponsors
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
I don't know, only have some theories.
1. The name isn't particularly catchy or descriptive. It is the correct name for the data structure, but not too many people know the data structure.
2. People don't even know what they're missing. It's not a very Google-able problem to begin with. Slotmap provides an interesting solution to (circular) ownership and safe allocator / weak pointer design problems, but people don't recognize that they're having them or that slotmap could help.
As an example of this, the doubly linked list example (https://github.com/orlp/slotmap/blob/master/examples/doubly_...) can safely remove nodes from the linked list given their handle, in O(1), even from the middle, completely safely and correctly, even in the presence of double deletions or ABA memory re-use. You can't replicate this with just pointers, without introducing heavy refcounting solutions.
What about using ghost cell? https://github.com/matthieu-m/ghost-cell
Related posts
- 3 years of fulltime Rust game development, and why we're leaving Rust behind
- Fyrox Game Engine – a Rust game engine with a real editor and scripting system
- Voronoi, Manhattan, random
- CrabGrab: new OSS Rust crate for cross-platform screen/window capture
- Implement React v18 from Scratch Using WASM and Rust - [8] Support Hooks