- use a specialised class, layered on top of std::array - use additional storage to mark filling degree - check/fail on link owerflow directly there We still use fixed size inline storage for the node links, yet adding this comparatively small overhead in storage helps getting the code simpler and adding links is now constant-complexity |
||
|---|---|---|
| .. | ||
| gear | ||
| mem | ||
| DIR_INFO | ||