Showing 35 of 71 projects
A C++ reference implementation of the Dragonbox algorithm for fast, correct, and shortest float-to-string conversion.
A hyper-fast diffing algorithm for real DOM nodes that efficiently updates only changed elements.
A Go package implementing graph data structures and algorithms with comprehensive tutorials and visualizations.
Fastest JavaScript implementation of the Levenshtein distance algorithm for measuring string similarity.
A JavaScript library for querying and manipulating object properties using expressive paths with wildcards, regexps, slices, and unions.
A generic C++17 header-only library providing sorting algorithms, sorter adapters, and related tools with a unified interface.
Fast, sensitive, and accurate integration of single-cell RNA-seq data across multiple datasets, batches, or experimental conditions.
A Python framework for multiobjective evolutionary algorithms (MOEAs) with support for NSGA-II, NSGA-III, MOEA/D, and other optimization methods.
A TypeScript implementation of the C++ Standard Template Library (STL) with containers, algorithms, and functors.
A Python framework for gradient-free optimization, featuring common algorithms like genetic algorithms and simulated annealing.
A collection of Go solutions for problems from the Elements of Programming Interviews book.
A high-performance Go library for calculating Levenshtein distance between strings, including Unicode support.
A Go library implementing Exponentially Weighted Moving Average algorithms for efficient time-series data smoothing.
A lightweight, header-only C++20 graph library designed as a simpler alternative to the Boost Graph Library.
A Go implementation of Google's jump consistent hash algorithm for minimal disruption when resizing hash tables.
A C++20 implementation of TimSort, a stable O(n log n) sorting algorithm optimized for partially-sorted data.
A Rust implementation of k-dimensional trees for fast geospatial indexing and nearest neighbor lookups.
A fast feature selection algorithm for tree-based models like XGBoost, designed to outperform Boruta in speed and performance.
A Rust library for computing CRC (16, 32, 64) checksums with support for various standards and pluggable implementations.
A Rust priority queue with efficient priority change operations, implemented using IndexMap and a heap of indexes.
A Ruby gem providing a fast, accurate, and encoding-aware implementation of the Jaro-Winkler string similarity algorithm.
A Delphi library for securely hashing and verifying passwords using the BCrypt algorithm.
Swift implementation of the longest common subsequence (LCS) algorithm for comparing collections.
A single-header C++ library for reading, writing, and processing 24-bit bitmap images with drawing, effects, and color utilities.
A trading environment for reinforcement learning agents, supporting backtesting, live trading, and multiple RL algorithms.
A Ruby gem for calculating edit distance between strings using Levenshtein, Damerau-Levenshtein, and Boehmer & Rees algorithms.
Interactive web-based visualizations of sorting and pathfinding algorithms, built entirely with Rust.
A curated list of awesome computational geometry visualizations, libraries, and educational resources.
A fast and convenient diffing framework for iOS, macOS, and tvOS using Paul Heckel's algorithm.
Solutions to Cracking the Coding Interview problems implemented in Go for learning purposes.
An incremental update tool for UITableView and UICollectionView that automates diff calculation and UI updates.
A GDScript port of Delaunator for fast Delaunay triangulation of 2D points in Godot Engine.
A Java library implementing rolling hash functions like Randomized Karp-Rabin and Cyclic Polynomial hashing for efficient n-gram hashing.
A high-performance JavaScript library for computing cartesian products of arrays.
An Erlang implementation of the SIMD-oriented Fast Mersenne Twister pseudorandom number generator, with both NIF and pure Erlang modules.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.