biteopt
SpeciaLUT
biteopt | SpeciaLUT | |
---|---|---|
2 | 3 | |
127 | 26 | |
- | - | |
6.0 | 3.4 | |
2 months ago | 7 months ago | |
C++ | C++ | |
GNU General Public License v3.0 or later | BSD 2-clause "Simplified" 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.
biteopt
SpeciaLUT
-
C++ Show and Tell - December 2022
I made SpeciaLUT to convert bool/enum runtime tests to compile-time conditionals — by compiling all branching combinations in hot functions and saving them in a lookup-table, so the optimal one can be called at runtime. Reason: as an HPC consultant I encountered many codes that grew without good architecture, in which features would just be added and branching would propagate through all levels. This yields 10% to 50% performance increase in such codes.
-
Runtime-constant propagation and branching optimization strategy
I have implemented this as a C++ library, where you extract const states as template parameters, and the library compiles all specializations and allows you to choose the optimal one at runtime.
-
Runtime calling of a template specialisation using compile-time LUTs
So here's my C++20 implementation of the above: SpeciaLUT
What are some alternatives?
OrangeC - OrangeC Compiler And Tool Chain
uninttp - A universal type for non-type template parameters for C++20 or later.
LazyMath - Complex Conjugate Gradient linear solver and Levenberg-Marquardt minimizer with and without constraints in C++
relion - Image-processing software for cryo-electron microscopy
palanteer - Visual Python and C++ nanosecond profiler, logger, tests enabler
introspective - Compile-Time Reflection in C++ for use with Scripting Languages
gago - :four_leaf_clover: Evolutionary optimization library for Go (genetic algorithm, partical swarm optimization, differential evolution)
with-branching - An implementation of macroexpand-time conditionalization.
shenanigans - Semi-random funky stuff, mainly for my PhD experiments and articles. Contains calculations and algorithm implementations for various applied mathematics and astrophysics articles I worked on.
static_string - Experimental compile-time string manipulation C++17 library
zoofs - zoofs is a python library for performing feature selection using a variety of nature-inspired wrapper algorithms. The algorithms range from swarm-intelligence to physics-based to Evolutionary. It's easy to use , flexible and powerful tool to reduce your feature size.