A Radix Tree based router for HTTP and other routing needs with support for middlewares and endpoints with a Cython boost
-
Updated
Oct 9, 2018 - Python
A Radix Tree based router for HTTP and other routing needs with support for middlewares and endpoints with a Cython boost
RadixTree<T> implements java.util.Map<String, T>
🌳 Lightweight and fast router for JavaScript based on Radix Tree. This fork adds functional matching!
Common Data Structures And Algorithms Implemented In C++. FOR LEARNING PURPOSES ONLY
✨ Lightweight and fast router for JavaScript based on Radix Tree 🌱
Fides is a library for cryptographic primitives.
Persistent Adaptive Radix Trees in Java
STL-compliant map and set container based on a C++11 Adaptive Radix Tree implementation.
Implementation of radix-tree data structure
Fast zero-allocation HTTP routing for Go ⚡
An example of radix tree (not space optimized)
An implementation of the Adaptive Radix Tree with Optimistic Lock Coupling.
Persistent set of integers, implemented using PATRICIA tree data structure
Blazing fast ⚡ pincode-merchant retrieval engine for ONDC! 🚀 (Developed for ONDC's Build for Bharat 2024 Hackathon)
Add a description, image, and links to the radix-tree topic page so that developers can more easily learn about it.
To associate your repository with the radix-tree topic, visit your repo's landing page and select "manage topics."