11 个仓库
Implements specialized data structures like bitmaps and heaps for efficient collection management.
Distinct from Data Structure Implementations: Distinct from Data Structure Implementations: focuses on production-grade optimized structures for smart contracts rather than educational examples.
Explore 11 awesome GitHub repositories matching data & databases · Optimized Data Structures. Refine with filters or upvote what's useful.
This project is a curated educational resource and solution repository for algorithmic challenges, specifically focused on LeetCode problems. It serves as a technical reference for common data structures and algorithmic patterns, providing verified code implementations across multiple programming languages alongside detailed logic and complexity analysis. The repository functions as a comprehensive study guide for competitive programming and technical interview preparation. It includes specialized learning tools such as an Anki flashcard dataset for spaced repetition and a browser extension t
Implements priority queues using heap structures for efficient retrieval of minimum or maximum elements.
Antigravity-Manager is an artificial intelligence model orchestration platform that functions as a unified gateway for interacting with multiple external service providers. It standardizes heterogeneous vendor data structures into a consistent internal schema, allowing third-party tools to interface with various models through a single, normalized API. The system distinguishes itself through automated infrastructure management, including the lifecycle tracking of service accounts and the secure rotation of authentication credentials. By acting as a middleware layer, it intercepts traffic to p
Routes tasks to optimal backend services based on real-time performance metrics and priority logic.
OpenZeppelin Contracts is a library of modular, secure, and reusable smart contract components designed for the development of decentralized applications. It provides a foundational framework for building standard-compliant contracts, offering battle-tested implementations for token standards, access control, and common utility patterns. The project distinguishes itself through its comprehensive support for complex architectural patterns, including proxy-based upgradeability, role-based access control, and account abstraction. It enables developers to implement modular logic injection via hoo
Implements optimized data structures to handle collections more efficiently than native arrays or mappings.
This project is a comprehensive, community-maintained knowledge base and toolkit designed for competitive programming. It serves as a centralized repository for algorithmic theory, data structures, and mathematical techniques, providing a structured reference for informatics and collegiate programming competitions. The project distinguishes itself by integrating educational content with a robust suite of automation utilities. It provides a complete workflow for competitive programming, including tools for automated test case generation, solution verification, and direct interaction with onlin
Data Structures maintain ordered pairs of values to efficiently manage state in graph traversal algorithms like Dijkstra.
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
Provides priority queues with floating-point keys and efficient decrease-key operations for graph algorithms.
algs4 is a Java data structures library and algorithm reference collection designed as the source code for a standard computer science textbook curriculum. It provides a comprehensive suite of fundamental implementations for sorting, searching, and core data organization. The project serves as a graph theory framework, offering tools for representing directed and undirected graphs and performing complex traversals and pathfinding. It also includes a broad sorting algorithm suite and a specialized library of Java data structures, including stacks, queues, priority queues, and symbol tables. I
Provides an indexed priority queue to efficiently retrieve and update elements associated with integer indices.
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
Implements priority queues using binary heaps to efficiently extract minimum or maximum items.
这是一个面向 .NET 生态系统的科学计算框架,提供了一套全面的数值分析、统计和数学优化库。它作为开发机器学习、数字信号处理和计算机视觉应用的基础工具包。 该框架提供了用于训练和部署预测模型的专用工具包,包括神经网络、支持向量机和决策树。它还通过对实时视觉分析(如对象跟踪和面部特征检测)的深度集成,以及用于捕获和过滤音频及传感器信号的专用数字信号处理库而脱颖而出。 其功能范围扩展到高级矩阵分解和线性代数、概率状态建模和启发式搜索算法。它还涵盖了广泛的数据操作实用程序,从降维和归一化到空间数据组织和科学可视化组件。 该系统包括用于摄像机配置、GPIO 端口管理和专用深度传感硬件的硬件集成控制器。
Implements a priority queue to manage elements based on assigned priority for efficient state management.
This library provides a collection of specialized data structures for the Swift language that extend the standard library with advanced container types. It includes implementations for double-ended queues using ring-buffers, priority queues based on min-max heaps, and memory-efficient bit-set and bit-array storage for boolean values. The project features ordered collections that maintain elements in sorted order via B-tree implementations, as well as persistent sets and dictionaries that use compressed prefix trees to share data between mutated copies. It also provides specialized containers
Implements priority queues using a min-max heap backed by an array for efficient priority-based retrieval.
This repository is a curated guide and implementation library of coding patterns used to solve data structures and algorithms problems. It serves as a technical interview study resource, providing a comprehensive set of strategies and computational logic examples for optimizing time and space complexity. The project focuses on standardized algorithmic patterns, including sliding windows, two pointers, and dynamic programming. It features specific implementations for a wide range of challenges, such as LeetCode problem solutions and specialized techniques like cyclic sort and bitwise XOR opera
Provides optimized implementations of fundamental data structures like heaps and arrays to improve time and space complexity.
此仓库是算法问题解决的综合库,提供计算机科学基础挑战的参考实现。它旨在作为技术面试准备和竞赛编程训练的资源,专注于掌握编码评估所需的常见模式和数据结构。 该项目通过提供强调符合习惯的 Python 用法和性能优化的解决方案而脱颖而出。它涵盖了广泛的算法技术,包括贪心选择、动态规划、图论和二分查找,同时提供关于分析执行复杂度以识别特定任务最高效逻辑的指导。 除了核心算法外,该集合还包括栈、队列和邻接表图表示等标准数据结构的实现。它还提供了集成外部 Web 服务和管理结构化数据的示例,确保了竞赛环境和实际软件开发所需的广泛技术技能覆盖。
Utilizes heap-based priority queues to optimize shortest path selection in graph algorithms.