Benchmark queues and stacks with heap allocated blocks Queues and stacks were previously benchmarked with immediate values only, which unfortunately partially hides the potential cost of write barriers related to setting and clearing elements. Partially hiding the cost of write barriers makes the queue benchmarks unrealistic. Queues and stack are very rarely used with only immediate values.
2a653b
-
Jul 31 07:26 +00:00
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4