with-branching
SpeciaLUT
| with-branching | SpeciaLUT | |
|---|---|---|
| 5 | 3 | |
| 13 | 26 | |
| - | - | |
| 3.8 | 3.4 | |
| 6 months ago | 7 months ago | |
| Common Lisp | C++ | |
| - | 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.
with-branching
-
Multistage Programming / First Class runtime compiler support
It is not the same, but that does not mean they can't be helpful. Notionally, the compiler is available at runtime--there is no 'staging'--making on-the-fly code generation and compilation a breeze. A pertinent example is with-compile-time-branching, a macro which effects hoisting of branches--similar to what you are asking for.
-
Runtime-constant propagation and branching optimization strategy
related
- Macroexpand-time branching
-
Common Lisp: Macroexpand-time branching
Linked at the end of the blog: https://github.com/phoe/with-branching
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?
Numba - NumPy aware dynamic Python compiler using LLVM
biteopt - Derivative-Free Global Optimization Method (C++, Python binding)
The-Spiral-Language - Functional language with intensional polymorphism and first-class staging.
uninttp - A universal type for non-type template parameters for C++20 or later.
CompTime.jl - Library for compile-time computing in julia
relion - Image-processing software for cryo-electron microscopy
ocaml-asp - Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
introspective - Compile-Time Reflection in C++ for use with Scripting Languages
Cython - The most widely used Python to C compiler
static_string - Experimental compile-time string manipulation C++17 library
LazyMath - Complex Conjugate Gradient linear solver and Levenberg-Marquardt minimizer with and without constraints in C++
LinearAlgebra - C++20 Linear Algebra header only library, with lots of support for complex operations.