|
|
|
|
|
by Sinidir
1420 days ago
|
|
>Because I've actually benchmarked it: https://quick-bench.com/q/ISEetAHOohv-GaEuYR-7MajJgTc
18.5 nanoseconds fits under no reasonable definition of "crazy expensive", not when a regular increment clocks in at 5.9 nanoseconds. And there is extremely few situations where you increment a reference count more than, like, 5 times. It's just not an issue. Congratulations. You tested a construct meant for multicore/threading
in a single threaded benchmark and then marvel at the low overhead. Of course you will only start seeing the cost if there is actually contention to operate on the value between multiple threads running simultaniously.
See.: https://travisdowns.github.io/blog/2020/07/06/concurrency-co... |
|