Listlib
sc
| Listlib | sc | |
|---|---|---|
| 1 | 17 | |
| 1 | 2,165 | |
| - | - | |
| 10.0 | 6.3 | |
| almost 2 years ago | 27 days ago | |
| C | C | |
| MIT License | BSD 3-clause "New" or "Revised" 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.
Listlib
-
Structure array help?
You may have chosen the wrong language for this kind of implementation. Since the number of teams is unknown at completive, you're going to need to allocate the array dynamically with malloc which can be quite verbose. I have a working but buggy implementation of something like this on my GitHub (https://github.com/Alessandro-Salerno/Listlib), you can take a look If you want, but if your goal is just to build a socket application quickly, I would suggest using something like Python, JS or Java as those languages provide higher level interfaces for this kind of stuff.
sc
- A simple hash table in C
- Advice for bigger c projects?
- sc - Common libraries and data structures for C
-
Hacker News top posts: May 17, 2022
Common libraries and data structures for C\ (107 comments)
-
Common libraries and data structures for C
Can someone tell me what is this line from sc_signal.c:247 in sc/signal/
If the way it is used requires the user to break the abstraction/encapsulation and manually buffer some fields in order not to break the data structure and leak memory, I would call that a bug.
There is one use of sc_array_clear() in the test code [1] which really makes it look as if it is being used in a way that I think (again, I haven't single-stepped this code, only read it) leaks memory.
I agree on the pain of everything being macros, it's more pain than it's worth I think and will likely lead to code duplication (and more pain in debugging, probably).
I would even go so far as to think that this kind of single-file design, where each file is independent of the others, makes it harder and more annoying to implement more complicated data structures.
[1]: https://github.com/tezc/sc/blob/master/array/array_test.c#L3...
-
Uthash – C macros for hash tables and more
https://github.com/tezc/sc/tree/master/map
For those who are interested in faster hashmaps, I tried bunch of hashmaps and this one performs better than others. This is for C. Maybe C++ has better hashmaps.
What are some alternatives?
frr - The FRRouting Protocol Suite
wazero - wazero: the zero dependency WebAssembly runtime for Go developers
chibicc - A small C compiler
stage0 - A set of minimal dependency bootstrap binaries
pottery - Pottery - A container and algorithm template library in C
gcc
libderp - C collections. Easy to build, boring algorithms. Dumb is good.
uthash - C macros for hash tables and more
rizin - UNIX-like reverse engineering framework and command-line toolset.
webfsd - A simple HTTP server for mostly static content written in C
Fortress-of-Solitude - This Library has resources to solve common data structure algorithm problems like a Doubly linked list, Generic trees, Queue, Stack, and other algorithms. Each lib has an option to carry your custom data in elements. Custom data in detail, other fantastic resources.
live-bootstrap - Use of a Linux initramfs to fully automate the bootstrapping process