Tweak README.

This commit is contained in:
Bob Nystrom
2013-12-25 15:03:17 -08:00
parent 507e89d3b3
commit ba0f39a5e0

View File

@ -2,18 +2,18 @@ The benchmarks in here attempt to faithfully implement the exact same algorithm
A bit about each benchmark:
## binary_trees
### binary_trees
This benchmark stress object creation and garbage collection. It builds a few big, deeply nested binaries and then traverses them.
This benchmark stresses object creation and garbage collection. It builds a few big, deeply nested binaries and then traverses them.
## fib
### fib
This is just a simple naïve Fibonacci number calculator. It was the first benchmark I wrote when Wren supported little more than function calls and arithmetic. It isn't particularly representative of real-world code, but it does stress function call and arithmetic.
## for
### for
This microbenchmark just tests the performance of for loops. Not too useful, but i used it when implementing `for` in Wren to make sure it wasn't too far off the mark.
## method_call
### method_call
This is the most useful benchmark: it tests dynamic dispatch and polymorphism. You'll note that the main iteration loop is unrolled in all of the implementations. This is to ensure that the loop overhead itself doesn't dwarf the method call time.