dump1090_rs
pottery
dump1090_rs | pottery | |
---|---|---|
10 | 14 | |
92 | 119 | |
- | - | |
7.2 | 1.8 | |
3 months ago | about 2 years ago | |
Rust | C | |
GNU General Public License v3.0 only | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
dump1090_rs
-
[Media] Announcing rsadsb v0.6.0 - Track airplanes in the sky with Rust!
I test it all the time with my own https://github.com/rsadsb/dump1090_rs. But it should be able to use the adsbexchange c program: https://github.com/adsbxchange/readsb.
-
Raspberry Pi in-car ADS-B Display - with Rust
github/dump1090_rs
-
[Media] View airplanes in the sky, with Rust! Announcing rsadsb v0.4.0
I'd like to use the following: https://github.com/kevinmehall/rust-soapysdr, but for now I'm using my own bindings that just support rtlsdr: https://github.com/rsadsb/dump1090_rs/blob/master/src/rtlsdr.rs
-
View airplanes in the sky with Rust! Announcing rsadsb v0.4.0
The github projects are https://github.com/rsadsb/adsb_deku and https://github.com/rsadsb/dump1090_rs.
- Ask HN: What you up to? (Who doesn't want to be hired?)
- Show HN: Ads-B Decoder written in Rust
-
adsb_deku now supports a Coverage display!
Thanks, I'll have to fix my ui scaling it looks like. Also, I have a rust version of dump1090: https://github.com/wcampbell0x2a/dump1090_rs.
-
Released v0.1.1 of adsb_deku and dump1090_rs
https://github.com/wcampbell0x2a/adsb_deku https://github.com/wcampbell0x2a/dump1090_rs
-
Announcing: v0.1.0 adsb_deku/dump1090_rs
dump1090_rs is a demodulator that can forward info to the radar and 1090 apps included with my library for the display of the information.
pottery
-
Popular Data Structure Libraries in C ?
Pottery - The page for open hash map reads "Documentation still needs to be written. In the meantime check out the examples."
-
So what's the best data structures and algorithms library for C?
"Using macros" is a broad description that covers multiple paradigms. There are libraries that use macros in combination with typed pointers and functions that take void* parameters to provide some degree of API genericity and type safety at the same time (e.g. stb_ds and, as you mentioned, my own CC). There are libraries that use macros (or #include directives) to manually instantiate templates (e.g. STC, M*LIB, and Pottery). And then there are libraries that are implemented entirely or almost entirely as macros (e.g. uthash).
-
Better C Generics: The Extendible _Generic
The prototype of CC used this mechanism to provide a generic API for types instantiated via templates (so basically like other container libraries, but with an extendible-_Generic-based API laid over the top of the generated types). This approach has some significant advantages over the approach CC now uses, but I got a bit obsessed with eliminating the need to manually instantiate templates.
- C_dictionary: A simple dynamically typed and sized hashmap in C - feedback welcome
-
Common libraries and data structures for C
I think it's common for C programmers to roll their own. I did the same [0].
I went pretty deep into composable C templates to build mine so it's more powerful than most. The containers can handle non-bitwise-movable types with full C++-style lifecycle functions and such, and the sort algorithms can handle dynamic and non-contiguous arrays (they are powerful enough to implement qsort() [1], which is more than I can say for any other C sort templates I've seen.) My reasoning for the complexity at the time was that any powerful container library is going to be reasonably complex in implementation (as anyone who's looked at STL source code knows), so it just needs to be encapsulated behind a good interface.
I'm not so sure that's true anymore. These sorts of simpler libraries like the one linked here definitely seem to be more popular among C programmers. I think if people are using C, it's not just the C++ language complexity they want to get away from, but also the implementation complexity of libraries and such. There's a balance to be had for sure, and I think the balance varies from person to person, which is why no library has emerged as the de facto standard for containers in C.
[0]: https://github.com/ludocode/pottery
- C++ containers but in C
- Pottery – A pure C, include-only, type-safe, algorithm template library
- Ask HN: What you up to? (Who doesn't want to be hired?)
-
Type-safe generic data structures in C
Yes! The include style of templates in C is way better than the old way of huge macros to instantiate code. The template code can look mostly like idiomatic C, it interacts way better with a debugger, it gives better compiler errors... everything about it is better and it's finally starting to become more popular.
I've open sourced my own C template library here:
https://github.com/ludocode/pottery
Not only does it use the #include style of templates, but it actually makes the templates composable. It takes this idea pretty far, for example having a lifecycle template that lets you define operations on your type like move, copy, destroy, etc. This way the containers can fully manage the lifecycles of your types even if they're not bitwise movable.
There's also this other more popular C template library, one that tries to more directly port C++ templates to C but with a lot less features:
https://github.com/glouw/ctl/
-
Beating Up on Qsort (2019)
This article doesn't really make it clear but the merge sort discussion is specifically about glibc's implementation of qsort(). glibc's qsort() and Wine's qsort() are the only ones I know of that use merge sort to implement qsort(). Most implementations use quick sort.
I recently did my own benchmarking on various qsort()s since I was trying to implement a faster one. The various BSDs and macOS qsort() are all faster than glibc at sorting integers and they don't allocate memory:
https://github.com/ludocode/pottery/tree/master/examples/pot...
Of course sorting is much faster if you can inline the comparator so a templated sort algorithm is always going to be faster than a function that takes a function pointer. But this does not require C++; it can be done in plain C. The templated intro_sort from Pottery (linked above) is competitive with std::sort, as are the excellent swensort/sort templates:
https://github.com/swenson/sort
What are some alternatives?
tui-rs - Build terminal user interfaces and dashboards using Rust
mpack - MPack - A C encoder/decoder for the MessagePack serialization format / msgpack.org[C]
create-rust-app - Set up a modern rust+react web app by running one command.
pdqsort - Pattern-defeating quicksort.
adsb_deku - ✈️ Rust ADS-B decoder + tui radar application
mavis - opinionated typing library for elixir
VW_Flash - Flashing tools for VW AG control units over UDS. Compression, encryption, RSA bypass, and checksums are supported for Simos18.1/6/10, DQ250-MQB, DQ381-MQB, and Haldex4Motion-Gen5-MQB.
sc - Common libraries and data structures for C.
rust-soapysdr - Rust bindings for SoapySDR, the vendor-neutral software defined radio hardware abstraction layer
Klib - A standalone and lightweight C library
readsb - ADS-B decoder swiss knife
ctl - My variant of the C Template Library