These are chat archives for rust-lang/rust
@vitvakatu A binary heap. The only operations used in A* are insert and find the minimal value.
On the subject of heaps in Rust--does anyone know why Rust went with a max-heap in the standard library? It seems like a lot of algorithms (e.g. Dijkstra, A*) prefer min-heaps instead. And often you don't want to reverse the definition of Ord for your struct just for the purpose of putting things in a min-heap instead of a max-heap, which is what they do in the Dijkstra's algorithm example on the binary heap page. (I know there is probably an ordering adaptor similar to Haskell's "Down" somewhere on crates.io but if so I haven't found it yet)
Anyone have any experience with
I'm learning Rust and trying to build a GTK app that fetches data from an API and displays it to the user.
I have been able to that, but I run into trouble having it update automatically. I've tried:
gtk::timeout_addwhich works, but causes lag in the program while it makes the HTTP request
staticstate and a Mutex, which is currently not working
lapinto send topic event exchanges?
Nvm for now!
I discovered it was not a Mutex I needed but a