Re:Static search trees: 40x faster than binary search
by quotemstr on Tuesday December 31, 2024 @08:46PM
(#42563317)
> Regarding Python, how could such optimizations be implemented in Python? Generating LLVM bytecodes directly aside.
You don't. You instead use your favorite Python extension system (regular Python modules, Cython, Numba, whatever) to implement this tree algorithm and expose it to Python already shaped into a container.
You don't. You instead use your favorite Python extension system (regular Python modules, Cython, Numba, whatever) to implement this tree algorithm and expose it to Python already shaped into a container.