Jacob Finkelman
Jacob Finkelman
Yes. That is what I had in mind.
Now that I think about it we could have an iterator that returns q's sorted by the shortest path p->q. If you want a k nearest: `iterator.take(k)`. If you want...
Only when it can be done more efficiently than the alternatives. Do Contraction Hierarchies help make it more efficient than a Dijkstra's on an unprepared Graph? If so then yes...
It is a C++ python Library, it has in the past caused our entire model to segfault. I spent today trying to diagnose a regression in performance, our model is...
Note that I did a lot of work on designing an preparing to make this happen at https://github.com/servo/homu/issues/102. All sow the developers behind bors-ng have reached out in the past...
The Stan language was considering using Rust for there new compiler, in so doing they tried pest and describe it as ["is not fully documented yet and I wasn’t able...
I don't know if they want to give Rust another chance, I think they have settled on OCaml. That is the problem with documentation issues, a lot of the people...
I just tried to get set up with a project that relied on this one. But the z3 get model code was always returning 0s. I think it is because...
I will admit that I got the RFC discussions confused, and so was the source of the erroneous explanation. Sorry. Being confused by what all the options are, how they...
Yes, that is the plan and so far we are still on schedule for it.