Patrick Dougherty

The original issue was that “fast” functions took an extremely long time to benchmark. The ticket should have some examples. If I remember correctly, this blog post served as the...

> The major GC before each benchmark is still justified even before each sample only minor is run. Yes, this definitely sounds correct. Although based on your samples it seems...

I'm remembering now that the GC stats are presented as a diff since the last one. So the pre-loop GC acts as a baseline, and the post-loop GC is used...

Yeah, I suppose that is consistent with the rest of the thinking.

The heap may be another confounding factor. I ran the `ops/map/*` benchmark to generate an eventlog. At the start of the `conduit` benchmark, the heap size was 300 million bytes....

Thank you for the compliment! Unfortunately, when I tested the waters here: https://www.reddit.com/r/haskell/comments/7sqram/new_library_hashgraph_a_graph_implementation/ there was a bit of push-back. People brought up reasonable points that I should address before I...

Currently solved by providing a `fromList` method. Still need to figure out if hashsets are exposed to the user or not.

Yes, it is for labels. You can do `Edge () b` if you don't want labels though. I think the examples folder is a little better than my documentation at...

I would definitely welcome critiques/info about what is unclear or hard to use. I think it is going to change a bit soon? When I tested the water on [reddit](https://www.reddit.com/r/haskell/comments/7sqram/new_library_hashgraph_a_graph_implementation/)...

Thanks for pointing this out! We had a bug in our release process last night that led to only a partial release. It's been resolved now, so if you update...