Awesome GitHub RepositoriesHash Maps

Comprehensive Rust is a structured educational curriculum designed to teach the Rust programming language, focusing on its core principles of memory safety, performance, and type correctness. The project provides a comprehensive learning path for software engineers, covering the language's ownership model, borrow checking, and compile-time validation mechanisms that eliminate common memory-related errors without the need for a garbage collector. The curriculum distinguishes itself by offering specialized modules that demonstrate how to apply these safety guarantees in diverse, high-performanc

This project is a comprehensive collection of common computer science algorithms and data structures implemented in Swift. It serves as an educational reference and library for studying computational complexity, algorithmic logic, and data structure engineering through practical code examples. The repository provides a wide suite of data structure implementations, including various types of linked lists, heaps, hash tables, and an extensive range of hierarchical trees such as Red-Black, B-Tree, and Splay trees. It also covers diverse sorting and searching techniques, from basic bubble sort to

Garnet is a multi-threaded in-memory database and distributed key-value store. It functions as a high-performance remote cache store that implements the RESP wire protocol to maintain compatibility with existing Redis clients and libraries. The project is distinguished by a shared-memory architecture that enables parallel request processing across multiple cores for sub-millisecond latency. It features a tiered storage system that automatically offloads colder data from system memory to SSD or cloud storage layers, and includes a specialized vector search database for high-dimensional similar

phpredis is a C-based native extension that bridges PHP applications with Redis servers for high-performance data storage and retrieval. It serves as an interface for manipulating strings, hashes, lists, sets, and sorted sets while providing a direct path for executing Redis commands and server-side scripts. The extension provides comprehensive support for distributed environments and high availability. It interfaces with Redis Cluster to distribute data across multiple nodes using hash slots and manages Redis Sentinel for service discovery and automatic failover. It also enables shared state

Redis is a high-performance in-memory key-value store that functions as a distributed cache, message broker, and NoSQL database. It provides sub-millisecond read and write access to data stored in RAM and can operate as a vector database for indexing high-dimensional embeddings. The system supports a wide range of data storage and synchronization primitives, including the management of strings, hashes, lists, sets, and JSON documents. It enables real-time data operations through atomic transactions, hybrid persistence using snapshots and append-only logs, and high-availability configurations

This project is a comprehensive library of practical Python code examples and patterns. It provides a collection of scripts and snippets designed to demonstrate a wide range of programming tasks, from basic syntax to advanced implementation patterns. The repository focuses on several core domains, including the implementation of concurrency and multithreading examples, data analysis snippets for cleaning and manipulating tabular data, and various data visualization examples. It also covers automation scripts for file system management and a variety of general programming patterns. Additional

The 1BRC (One Billion Row Challenge) is a Java performance benchmarking exercise that processes one billion temperature records from a text file to compute the minimum, mean, and maximum temperature per weather station. At its core, it is a large-scale data aggregation challenge designed to test how efficiently a Java program can parse and aggregate structured data from a plain text file, serving as both a programming exercise and a benchmark for Java performance optimization. The project distinguishes itself through a collection of performance-oriented architectural patterns for high-through

This project is a computer science educational resource and library providing implementations of data structures and algorithms in JavaScript. It serves as an algorithm implementation reference and a toolkit for building foundational data containers, including a collection of sorting algorithms and a guide for learning time and space complexity. The project differentiates itself by pairing class-based implementations with Big O analysis to illustrate asymptotic complexity. It includes a non-linear data structure toolkit featuring self-balancing trees, hash maps, and graphs, alongside comparis

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

language-ext is a functional programming framework for C# that provides a suite of immutable data structures and monadic types. It enables the implementation of pure functional programming patterns, utilizing containers to manage side effects, optional values, and error handling. The library is distinguished by its advanced concurrency and state management tools, including a software transactional memory system and lock-free atomic references. It also provides specialized utilities for distributed systems, such as vector clocks for causality tracking and deterministic data conflict resolution

Boltons is a comprehensive utility toolkit and extension of the Python standard library. It provides a collection of reusable recipes and specialized data structures, system utilities, and helper libraries designed to support common programming tasks across various domains. The project is distinguished by a standard-library-only dependency model, ensuring maximum portability with zero external dependencies. It provides advanced implementations for data structures, such as immutable mappings and priority queues, alongside recursive data transformation tools for reshaping complex nested diction

This repository is a collection of practical code snippets and implementation patterns for Flutter and Dart. It serves as a comprehensive guide and reference for asynchronous programming, state management patterns, and UI component design. The project provides advanced language reference material covering generics, reflection, factory constructors, and null-aware operators. It also includes specific utilities for manipulating Dart collections, such as helper methods for transforming and filtering maps, lists, and iterables. The coverage extends to high-level capabilities including asynchrono

Dieses Projekt ist eine kuratierte Bibliothek mit Algorithmen-Implementierungen und gelösten Programmieraufgaben. Sie dient als Referenz-Repository für Competitive Programming und Datenstrukturen und bietet optimierte Lösungen für eine Vielzahl von Coding-Challenges. Die Sammlung organisiert Code-Beispiele nach algorithmischen Techniken, mit besonderem Fokus auf die Implementierung von Bäumen, Graphen und Heaps zur Optimierung der Zeit- und Platzkomplexität. Sie bietet sprachspezifische Lösungen für High-Performance-Coding-Aufgaben. Das Repository deckt ein breites Spektrum an Funktionen ab, darunter Graphentraversierungen, dynamische Programmierung, String-Pattern-Processing und binäre Suchoperationen. Es enthält zudem Implementierungen für Range-Data-Querying, Bit-Manipulation sowie das Design benutzerdefinierter Datenstrukturen wie Caches und Autocomplete-Engines. Zusätzliche Themen umfassen mathematische Berechnungen und das Tracking von Wettbewerbsergebnissen.

Dieses Projekt ist eine C#-Algorithmenbibliothek und eine Sammlung von Datenstrukturen. Sie dient als Informatik-Referenz und bietet praktische Implementierungen klassischer Sortier-, Such- und Graphentraversierungsmuster. Die Bibliothek enthält ein dediziertes Toolkit für String-Verarbeitung zur Analyse von Textähnlichkeit, Berechnung von Edit-Distanzen und Verwaltung Präfix-basierter Suchen. Zudem bietet sie eine Graphentheorie-Implementierung zur Modellierung von Netzwerkbeziehungen und zur Berechnung kürzester Pfade. Die Codebasis deckt ein breites Spektrum an Funktionen ab, einschließlich der Verwaltung linearer und hierarchischer Sammlungen, Baumdatenmanipulation und -visualisierung sowie der Berechnung mathematischer Zahlenfolgen.

node-lru-cache ist ein Key-Value-Store für Node.js, der einen speicherbegrenzten Cache implementiert. Er verhindert Speichererschöpfung durch Deckelung der Gesamtzahl der Elemente oder der Gesamt-Byte-Größe und entfernt automatisch die am wenigsten verwendeten Elemente (Least-Recently-Used), um diese Limits einzuhalten. Das Projekt bietet spezialisierte Caching-Muster, einschließlich Time-to-Live-Dauern zur Sicherstellung der Datenfrische und einen Stale-While-Revalidate-Mechanismus, der abgelaufene Inhalte bereitstellt, während im Hintergrund asynchron Updates abgerufen werden. Es enthält zudem Diagnose-Tools zur Überwachung von Cache-Hits, Misses und Eviction-Metriken über operative Statusobjekte und Diagnose-Kanäle. Die Implementierung deckt weiterführende Funktionen für Speichermanagement und Datenwiederherstellung ab, wie etwa das automatische Abrufen von Daten für fehlende Einträge, das manuelle Bereinigen veralteter Elemente und die Ausführung von Cleanup-Funktionen beim Ablauf von Elementen, um externe Ressourcen freizugeben.

Highway is a portable C++ library and hardware abstraction layer designed for writing single instruction multiple data (SIMD) code. It provides a unified interface that maps data-parallel logic to various CPU instruction sets, enabling the development of high-performance software that runs across different processor architectures without requiring architecture-specific assembly. The project features a dynamic instruction dispatcher that selects the most efficient CPU instruction set at runtime based on detected hardware. It also supports static target specialization and extensible mechanisms

This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides a suite of tools for general algorithm implementation, including data structure management, graph theory analysis, and string processing. The library is distinguished by its specialized toolkits for cryptographic hashing and encoding, featuring implementations of MD5, SHA-1, and Base64. It also includes advanced capabilities for high-performance string processing via suffix trees and arrays, as well as computational number theory for primality testing and arbitrary-precision

Vyper is a security-focused, typed programming language and compiler designed for creating smart contracts that execute on the Ethereum Virtual Machine. It utilizes a Pythonic syntax to define contract logic and state, serving as a target for formal verification to allow for machine-checked proofs of correctness. The language distinguishes itself through strict architectural constraints that prioritize predictability and security. It enforces acyclic call graphs by prohibiting recursion and mandates bounded loops to ensure static gas prediction. Additionally, it features a native fixed-point

uthash ist eine makrobasierte Datenstruktur-Bibliothek für C, die Header-only-Implementierungen von Hash-Tabellen, verketteten Listen, Stacks und dynamischen Arrays bereitstellt. Sie ermöglicht schlüsselbasierte Lookups und organisierte Datenspeicherung, ohne dass externe Bibliotheken gelinkt werden müssen. Die Bibliothek nutzt intrusives Linking, um Metadaten über Makros direkt in benutzerdefinierte Strukturen einzubetten. Dieser Ansatz ermöglicht die In-Place-Erweiterung von Strukturen, sodass Hash- und Link-Felder zu bestehenden Structs hinzugefügt werden können, ohne dass separate Speicherallokationen für Container-Knoten erforderlich sind. Das Projekt umfasst zudem spezialisiertes Speicher- und Datenstrommanagement, einschließlich kreisförmiger Puffer mit fester Größe für kontinuierliche Datenströme sowie String-Puffer mit automatischer Speicherverwaltung. Diese Hilfsmittel erleichtern die Datenverarbeitung in ressourcenbeschränkten Umgebungen und eingebetteten Systemen.

Redka ist ein SQL-basierter Key-Value-Store, der eine Redis-kompatible Schnittstelle implementiert. Er fungiert als relationale Datenbrücke, die nicht-relationale Protokollbefehle in relationale Abfragen übersetzt, um Persistenz und ACID-Transaktionen unter Verwendung eines SQL-Datenbank-Backends bereitzustellen. Das System ermöglicht die relationale Datenintrospektion, indem es interne Key-Value-Daten als SQL-Views offenlegt, was direkte Abfragen und Analysen mittels relationaler Syntax ermöglicht. Es kann als eigenständiger Netzwerkserver oder als eingebettete Bibliothek innerhalb einer Go-Anwendung bereitgestellt werden. Das Projekt unterstützt eine Vielzahl von Datenstrukturen, einschließlich Strings, Listen, Hashes, ungeordneten Sets und sortierten Sets. Es bietet Funktionen für das Key-Lifecycle-Management mit Time-to-Live-Metadaten, atomare numerische Operationen und Set-Algebra. Zur Verwaltung von Performance und Zugriff enthält es einen In-Memory-Speichermodus und einen Read-Only-Verbindungsmodus.