4 repositorios
High-performance hash sets specifically optimized for integer keys.
Distinguishing note: The candidates are for table existence or email verification; this is a low-level algorithmic integer set
Explore 4 awesome GitHub repositories matching data & databases · Integer Hash Sets. Refine with filters or upvote what's useful.
go-datastructures is a collection of thread-safe and lock-free data structures designed for high-performance concurrent applications in Go. It provides a modular library of specialized algorithmic toolsets, including a lock-free collection library and an immutable data structure library. The project distinguishes itself through a suite of persistent AVL trees and hash array mapped tries that use branch-copying to preserve previous versions. It also implements non-blocking hash maps, queues, and tries that enable linearizable snapshots and concurrent updates without the use of mutual exclusion
Implements a fast hashing algorithm with linear probing to check for the presence of integers.
LogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro
Implements a hash set that supports add, remove, and contains operations with constant average time complexity.
Este proyecto es una guía de preparación para entrevistas de algoritmos y una biblioteca de referencia. Proporciona una colección curada de problemas de programación resueltos e implementaciones de estructuras de datos diseñadas para la práctica de entrevistas técnicas y el estudio de programación competitiva. El repositorio se distingue por organizar los desafíos de codificación a través de un sistema de patrones, niveles de dificultad y filtrado basado en empresas. Incluye recursos educativos como notas sobre conceptos algorítmicos y explicaciones en video para complementar los conjuntos de soluciones. La biblioteca cubre una amplia gama de áreas computacionales, incluyendo estructuras de datos avanzadas para consultas de rango y prefijo, algoritmos de recorrido de grafos y caminos más cortos, y varios conjuntos de problemas centrados en programación dinámica, backtracking y estrategias voraces. También proporciona implementaciones para estructuras fundamentales como heaps, mapas hash, listas enlazadas, pilas y colas.
Provides a collection of coding challenges and solutions centered on implementing and applying hash set logic.
Kvrocks is a disk-based NoSQL database and distributed key-value store that leverages the RocksDB storage engine to persist large datasets to physical disk. It is designed to be a Redis-compatible database, utilizing the standard Redis communication protocol to ensure interoperability with existing client libraries and tools. The project distinguishes itself by combining a disk-persistent storage model with advanced retrieval capabilities, including vector search for k-nearest neighbor queries, full-text search indexing, and geospatial query execution. It supports distributed clustering with
Stores and retrieves ranges of integers in a sorted collection for numerical range queries.