The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
notes
Posts with mentions or reviews of notes.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-11-22.
-
Looking for interesting performance engineering examples for class
https://github.com/apankrat/notes/tree/master/fast-case-conversion
- Fast character case conversion (or how to compress sparse arrays)
- Fast character case conversion
- Fast case conversion or how to compress sparse arrays
- Fast case conversion or how to really compress sparse arrays
-
Using a std::list to manage a time-sorted list of resources in C++, is there a better way?
Alternatively, you can switch to using "intrusive" containers as these require no heap operations for their manipulation (link).
-
C Template Library
Nice, very nice. All of it. Long live C.
Being stuck with C++ I did something in reverse - ported C-style ("intrusive") containers to ++, making them a bit safer to use, but keeping the syntax nearly the same.
https://github.com/apankrat/notes/tree/master/intrusive-cont...
ctl
Posts with mentions or reviews of ctl.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2020-12-29.
-
C Template Library
I recall a few years back doing something like this implementing a binary heap just as a hobby project (https://github.com/Equationist/ctl/blob/master/pqueue.h). I was curious to see how unoptimized it was vis a vis the STL, and ran compiled equivalent test code for both my priority queue and the STL's C++ implementation, with just integers. I was kind of shocked to find that my implementation was like 30% faster when both were compiled at -O3 levels. Seeing this backport I guess there isn't anything fancy in the STL implementations, so it's less surprising that my naive implementation could be just as fast (or happen to be faster).
What are some alternatives?
When comparing notes and ctl you can also consider the following projects:
frr - The FRRouting Protocol Suite
pottery - Pottery - A container and algorithm template library in C
nusort - Japanese direct-to-kanji input system with 2-key codes
musl
src - Read-only git conversion of OpenBSD's official CVS src repository. Pull requests not accepted - send diffs to the tech@ mailing list.
ctl - The C Template Library
nlutils - Nitrogen Logic C Utility Library
sort - Sorting routine implementations in "template" C