Simple C++ code to benchmark fast division algorithms

Simple C++ code to benchmark fast division algorithms relying on constant divisors.

Related Repos

vidalt Modern implementation of the hybrid genetic search (HGS) algorithm specialized to the capacitated vehicle routing problem (CVRP). This code also includes an additional neighborhood called SWAP*.

electech6 Detailed comments for ORB-SLAM3

ethz-asl libnabo is a fast K Nearest Neighbour library for low-dimensional spaces. It provides a clean, legacy-free, scalar-type–agnostic API thanks to C++ templates. Its current CPU implementation is strongly inspired by ANN, but with more compact data types. On the average, libnabo is 5% to 20% faster than ANN.

graphcore PopTorch is a set of extensions for PyTorch enabling models to be trained, evaluated and used on the GraphCore IPU.

jizhang-cmu Autonomous Navigation and Collision Avoidance for Ground Robots

bytedance ByteDance-HIDS English | 简体中文 ByteDance-HIDS is a Cloud-Native Host-Based Intrusion Detection solution project to provide next-generation Threat Detec

pegasusTrader CTP 高频量化交易平台 C++ Trade Platform for quant developer

petercerno High-performance backtesting engine written in C++ for evaluating trading strategies restricted to a single trading pair (e.g. BTC/USD) and finding their optimal hyper-parameters. This software gives you a full control over every single bit that goes into backtesting. Licensed under MIT.