Vinzent Steinberg

What about a KETOSPATH environment variable? Like Python is having.

@hauleth I think the split is a good idea. I wrote down my thoughts in https://github.com/rust-num/num/issues/102.

@cuviper It was at least a year ago. I'll dig up my use case, port it to `num` and evaluate the performance again. (I think it was calculating the discrete...

@cuviper Performance is much better now, it is only one order of magnitude slower than GMP. (I also had to implement a few algorithms that are not provided by `num`...

I agree it would be nice to add a comment. However, the compiler advice is very clear in this case? If you later push an element into the vector, the...

Here is how to setup Travis to push the docs to Github pages: https://stackoverflow.com/questions/23277391/how-to-publish-to-github-pages-from-travis-ci It is a bit tricky to setup in a secure way.

Then maybe just add a link to the docs hosted at GSI?

I'm not really an expert on data structures, but I would be interested having a look at performance! So thanks for marking me.

This crate looks promising: [priority-queue](https://crates.io/crates/priority-queue) It is built with an ordered hash map ([indexmap](https://crates.io/crates/indexmap)). We could try to swap it in and see whether it improves performance.

> The priority is mainly determined by `Time`, but the tie-breaking for equal times needs to be deterministic. It is deterministic, and independent of the hasher: https://github.com/garro95/priority-queue/issues/29