ntfy-android
pottery
Our great sponsors
ntfy-android | pottery | |
---|---|---|
20 | 14 | |
449 | 119 | |
- | - | |
3.0 | 1.8 | |
20 days ago | about 2 years ago | |
Kotlin | C | |
Apache License 2.0 | 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.
ntfy-android
- Show HN: Ntfy.sh – open-source push notifications via PUT/POST
-
Notifications panel is empty or cannot show app notifications on Android TV / Google TV
Maybe try Ntfy, it has great support for automation apps through intents(for reacting) and http requests(for sending). Great documentation too.
-
Tasker integration: variable with message received
I've found the intent in the code (that is linked in the docs):https://github.com/binwiederhier/ntfy-android/blob/main/app/src/main/java/io/heckel/ntfy/msg/BroadcastService.kt
-
tips for nfc-tags to boos workplace productivity?
Also, I had recommended AutoRemote/Join since it has a friendly interface and ditect events in Tasker. You could also possibly use Ntfy, but it is not very user friendly and has no direct events/action; you have to custom create http requests/receive intents and other complexities etc(though it's free).
-
Welcome to the brand new ntfy subreddit 🎉
GitHub (Android): https://github.com/binwiederhier/ntfy-android
-
⟳ 10 apps added, 50 updated at f-droid.org
ntfy - PUT/POST to your phone (version 1.14.0): Send notifications to your phone from any script using PUT/POST requests
-
HTTP Requests in Tasker
Integrate it with the Ntfy notification app that has great HTTP Put/Post support.
-
I'm self-studying to learn Android development. I know a little Java, but my Java skills need work. Should I polish up my Java, or start fresh with Kotlin?
https://github.com/binwiederhier/ntfy-android (disclaimer: mine, self-learner too)
- Google meet call on MAC pushing notifications to my android device
- Show HN: Self-hostable app to send push notifications and files to phone/desktop
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?
Neo-Launcher - Neo-Launcher
mpack - MPack - A C encoder/decoder for the MessagePack serialization format / msgpack.org[C]
ntfy - Send push notifications to your phone or desktop using PUT/POST
pdqsort - Pattern-defeating quicksort.
passport-reader - e-Passport NFC Reader Android app
mavis - opinionated typing library for elixir
lldap - Light LDAP implementation
sc - Common libraries and data structures for C.
egglog0 - Datalog + Egg = Good
Klib - A standalone and lightweight C library
bbolt - An embedded key/value database for Go.
ctl - My variant of the C Template Library