search

theodesp / go-heaps

Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci
MIT License
96 stars 29 forks source link

Add benchmarks #3

Open theodesp opened 6 years ago

theodesp commented 6 years ago

Add benchmark testing

pbgnz commented 5 years ago

Hi Theofanis,

I am interested in helping you benchmark your library.

I was thinking of using the Go testing package built-in benchmark facility to test your code, similar to this post.

What do you think ?

theodesp commented 5 years ago

Sure go ahead. Try to get a few extra hints from this guide here: https://github.com/golang/go/wiki/Performance

For example: heap allocations and unnecessary escapes Garbage collection

theodesp commented 5 years ago

@theodesp Any luck with any benchmarks?

spinales commented 3 years ago

It can?