(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
package types | |
import "fmt" | |
const ManifestVersion int32 = 0 | |
type SHA256Sum [32]byte // check sum of chunk | |
func (hsum SHA256Sum) String() string { | |
return fmt.Sprintf("%X", hsum) |
Could you please post your method for generating those benchmark results. The error margins appears too high to draw conclusions, so perhaps you ran with insufficient warmup, iterations etc? Did you build the library with the optimizer enabled? (sbt setupPublishCore dist/mkPack will do this.) | |
Microbenchmarks should only call the code under test, so please remove the assertions (they are still run in test/junit/scala/util/matching/RegexTest.scala, the source of the examples you are benchmarking. | |
What was the primary motivation to create a custom benchmark runner for this test? I tend to enable profilers interactively jmh:run -prof gc ... in the SBT shell. |
(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.