I recently participated in a hackathon, and our project was centered around PostGIS. We wanted to work with our queries in a more interactive way without having to fiddle with frontend stuff, so I did a very cursory search and found QGIS. It allowed us to iterate faster and instantly became an invaluable tool. The ability to run SQL queries and see and compare queries results visually saved us days of work.
asdf maintainer here. We are in the process of re-organizing the README and all of the documentation. In it's present state the README isn't particularly clear about what asdf is and why it is useful. One of the maintainers already has a PR out to fix this - https://github.com/asdf-vm/asdf/pull/441
If you have any suggestions on what the readme should say feel free to open an issue or a small PR.
I'm sorry to hear that but I'm happy to help if there is anything I can do as a maintainer. The Haskell plugin isn't maintained by the core team, and it may have some issues of it's own that need to be fixed. If there was something specific that caused you trouble let me know and I'll see what I can do to get it addressed.
Big +1 for this. I personally haven't done any ballroom dancing, but I've done a lot of Contra dancing over the years and it has been a lot of fun [1]. Any social dance is great exercise and great for brain health [2]. Contra dancing is much more laid back than ballroom but many of these things in the article still apply to some degree. Contra dancers are usually very friendly and it's not hard to find a partner dances, even if you are new.
There has been quite a bit of discussion on the name. Apparently there are other projects with the same name and similar ones. Perhaps a rename will be in order if the project grows in popularity. https://lobste.rs/s/aqijyr/asdf_-_extendable_version_manager...
Thanks for the link. That does look really minimal but almost exactly what I need. I'll give it a try. Perhaps I should start out by writing a Lua plugin for it.
I had thought about that but never got around to building a sliding window that worked that way. The challenge is that then the `events/0` call might return events outside the window of time. But there is a potential performance improvement if we don't have to always be removing old events one by one.
I'll have to try improving the list implementation with "buckets"... I wonder if buckets could be represented as lists stored inside a tuple or another list...
Your right. There will be a huge latency spike when the out list needs to be refilled.
My throughput benchmark does take this into account though. It attempts to add 100,000 events to a window that only keeps events for 10 seconds. Adding 100,000 events takes much longer than 10 seconds, so the out list will be repopulated a couple times before the test is complete. The throughput benchmark is only an average though... And a longer running throughput test would yield a more accurate average.