Is this fsater than the uuid library? Benchmarks?

Question

Is this fsater than the uuid library? Benchmarks?

Closed this issue 4 years ago · 2 comments

Is this faster than https://hackage.haskell.org/package/uuid-1.3.13 ? Are there any benchmarks to validate this?

Answer 1 · 2021-02-15T22:04:57.000Z

It is not intended to be fast. It uses the system UUID generator. For V1 UUIDs, this means the same counter is used as any other process on the system.

Since it does a system call for each UUID, it might be slower than the other library you linked to.

The real use case for this library is a situation where the (somewhat edge of the wedge) guarantees of the system UUID generator are significant, either due to requirements or the nature of how you're explaining guarantees to users of your software.

Answer 2 · 2021-02-16T03:33:09.000Z

Thanks for replying @solidsnack. I ran some benchmarks and found this library to be slower for my use-case, so I'm going with the uuid library for now.