awesome-repositories.com
المدونة
awesome-repositories.com

اكتشف أفضل مستودعات المصادر المفتوحة باستخدام بحث مدعوم بالذكاء الاصطناعي.

استكشفعمليات بحث منسقةبدائل مفتوحة المصدربرمجيات ذاتية الاستضافةالمدونةخريطة الموقع
المشروعحولكيفية ترتيب النتائجالصحافةخادم MCP
قانونيالخصوصيةالشروط
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

54 مستودعات

Awesome GitHub RepositoriesQueue Implementations

Specialized queue structures including double-ended and priority-based variants.

Distinguishing note: Minting under Software Engineering & Architecture as a foundational data structure category.

Explore 54 awesome GitHub repositories matching software engineering & architecture · Queue Implementations. Refine with filters or upvote what's useful.

Awesome Queue Implementations GitHub Repositories

اعثر على أفضل المستودعات باستخدام الذكاء الاصطناعي.سنبحث عن أفضل المستودعات المطابقة باستخدام الذكاء الاصطناعي.
  • krahets/hello-algoالصورة الرمزية لـ krahets

    krahets/hello-algo

    127,271عرض على GitHub↗

    This project is an educational resource and reference library designed to teach fundamental data structures and algorithmic problem-solving. It provides a structured pedagogical framework that organizes complex technical concepts into a logical progression, helping learners understand how data is organized, stored, and processed to solve computational problems efficiently. The repository distinguishes itself through a multi-language codebase that maintains parallel, consistent implementations of core algorithms and data structures across various programming languages. It bridges the gap betwe

    Details operational strategies and implementation techniques for double-ended queues.

    Javaalgoalgorithmalgorithms
    عرض على GitHub↗127,271
  • geekxh/hello-algorithmالصورة الرمزية لـ geekxh

    geekxh/hello-algorithm

    36,074عرض على GitHub↗

    This project is a comprehensive technical knowledge base and study guide focused on data structures, algorithms, and computer science fundamentals. It provides a curated collection of tutorials and educational resources designed to support technical growth and academic learning. The repository distinguishes itself through a heavy emphasis on visual learning, utilizing mind maps, diagrams, and illustrated breakdowns to explain complex algorithmic logic. It further supports career readiness by providing a repository of company-specific interview questions and real-world candidate experiences.

    Provides guides on managing collections of elements with associated priorities to ensure high-priority processing.

    Javaalgorithmsdynamic-programminginterview-questions
    عرض على GitHub↗36,074
  • kodecocodes/swift-algorithm-clubالصورة الرمزية لـ kodecocodes

    kodecocodes/swift-algorithm-club

    29,099عرض على GitHub↗

    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

    Implements a fixed-size queue using circular indexing for efficient, constant-time operations.

    Swiftalgorithmsdata-structuresswift
    عرض على GitHub↗29,099
  • wangzheng0822/algoالصورة الرمزية لـ wangzheng0822

    wangzheng0822/algo

    23,159عرض على GitHub↗

    This project is a data structures and algorithms library providing a collection of fifty standard code implementations for managing data and solving common computational problems. It serves as an algorithm implementation reference and study resource for educational use. The codebase covers graph theory implementations for modeling networks and performing searches, as well as string pattern matching libraries for the retrieval of character sequences. It includes a collection of hierarchical data structures, such as binary search trees and priority heaps, and provides optimized solutions for dy

    Implements priority queues for efficiently extracting the highest or lowest value elements.

    Python
    عرض على GitHub↗23,159
  • nats-io/nats-serverالصورة الرمزية لـ nats-io

    nats-io/nats-server

    20,076عرض على GitHub↗

    NATS Server is a high-performance, lightweight messaging system designed for cloud-native applications, edge computing, and distributed microservices. It functions as a distributed publish-subscribe broker that routes messages using hierarchical, dot-separated subject strings, enabling decoupled communication between services without requiring centralized broker lookups. The system supports core messaging patterns including asynchronous publish-subscribe, request-reply, and load-balanced queue processing. The platform distinguishes itself through a decentralized architecture that eliminates t

    Tracks failed delivery attempts to route problematic data to specialized handlers for inspection or recovery.

    Gocloudcloud-computingcloud-native
    عرض على GitHub↗20,076
  • lmax-exchange/disruptorالصورة الرمزية لـ LMAX-Exchange

    LMAX-Exchange/disruptor

    18,375عرض على GitHub↗

    The Disruptor is a lock-free inter-thread messaging library and high-performance event bus. It implements a concurrent ring buffer designed for high-concurrency and low-latency message sequencing. The project utilizes a specific messaging architecture to eliminate lock contention, enabling high-throughput event routing and the exchange of continuous event streams between threads. It ensures strict first-in-first-out ordering and immediate data visibility across processing threads. The library provides capabilities for lock-free data streaming, sequential data ordering, and sequence-based eve

    Implements a high-performance concurrent ring buffer to sequence events with minimal garbage collection.

    Javaconcurrencydisruptorjava
    عرض على GitHub↗18,375
  • emirpasic/godsالصورة الرمزية لـ emirpasic

    emirpasic/gods

    17,401عرض على GitHub↗

    This project is a comprehensive container framework for Go that provides a suite of fundamental data structures and algorithms. It offers a standardized set of tools for managing, sorting, and traversing complex data collections, enabling developers to implement efficient storage and retrieval logic within their applications. The library distinguishes itself through an interface-driven design that allows for interchangeable use of different storage implementations. It supports custom ordering and sorting behavior through external comparison functions, which decouple the data structures from s

    Provides specialized stack and queue structures, including priority queues and circular buffers, for controlled data processing.

    Goavl-treeb-treebinary-heap
    عرض على GitHub↗17,401
  • apple/foundationdbالصورة الرمزية لـ apple

    apple/foundationdb

    16,446عرض على GitHub↗

    FoundationDB is an ACID-compliant distributed transactional key-value store. It functions as a scalable database engine that ensures strict serializability and data consistency across a cluster of servers using a shared-nothing architecture. The system is distinguished by its multi-region replication capabilities, allowing data to be synchronized across different datacenters for high availability and disaster recovery. It utilizes optimistic concurrency control to manage distributed transactions and employs a majority-based coordination system to maintain cluster state. The platform provides

    Manages ordered data items using subspaces and range reads to support concurrent enqueue and dequeue operations.

    C++aciddistributed-databasefoundationdb
    عرض على GitHub↗16,446
  • federico-busato/modern-cpp-programmingالصورة الرمزية لـ federico-busato

    federico-busato/Modern-CPP-Programming

    15,808عرض على GitHub↗

    This project is a comprehensive educational resource and programming course covering C++ language semantics and features from C++03 through C++26. It provides structured tutorials and technical guides focused on modern C++ development. The material offers specialized instruction on template metaprogramming, including the use of type traits and compile-time computations. It features detailed guides on concurrency and parallelism for multi-core execution, as well as a reference for software design applying SOLID principles and RAII. Additionally, it covers build performance optimization to redu

    Covers the implementation and usage of priority queues to manage elements based on priority.

    HTMLc-plus-pluscode-qualitycompilers
    عرض على GitHub↗15,808
  • aws/aws-cdkالصورة الرمزية لـ aws

    aws/aws-cdk

    12,817عرض على GitHub↗

    The AWS Cloud Development Kit is an infrastructure-as-code framework that enables developers to define and provision cloud resources using familiar programming languages. By utilizing construct-based synthesis, it translates high-level, object-oriented code into declarative templates, allowing for the automated management of complex cloud environments through a centralized, code-driven control plane. The framework distinguishes itself through its ability to model infrastructure as a dependency-aware resource graph, ensuring that components are provisioned and updated in the correct order. It

    Redirects failed message processing attempts to secondary queues for isolation and analysis.

    TypeScriptawscloud-infrastructurehacktoberfest
    عرض على GitHub↗12,817
  • mission-peace/interviewالصورة الرمزية لـ mission-peace

    mission-peace/interview

    11,306عرض على GitHub↗

    This project is a comprehensive library of reference implementations for fundamental data structures and algorithms, designed to support technical interview preparation and software engineering assessments. It provides a structured collection of computational techniques for solving complex problems involving arrays, strings, graphs, trees, and mathematical analysis. The library distinguishes itself by offering specialized implementations for advanced topics, including concurrent programming patterns and geometric algorithms. It features thread-safe primitives for managing shared state and tas

    Implements fixed-size circular array structures for efficient data insertion and removal.

    Java
    عرض على GitHub↗11,306
  • tporadowski/redisالصورة الرمزية لـ tporadowski

    tporadowski/redis

    9,987عرض على GitHub↗

    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

    Routes exhausted tasks to dedicated streams containing failure reasons and payloads for diagnosis.

    Credisredis-for-windowsredis-msi-installer
    عرض على GitHub↗9,987
  • resque/resqueالصورة الرمزية لـ resque

    resque/resque

    9,480عرض على GitHub↗

    Resque is a Ruby library for enqueueing and processing asynchronous tasks using Redis as a data store. It functions as a distributed task processor and queue manager, allowing long-running work to be moved out of the main request cycle. The system executes background jobs in isolated child processes to prevent memory leaks and provides a web-based dashboard for monitoring queue depths, worker activity, and failed job statistics. Capability areas include distributed worker coordination via signals, error handling with job retry mechanisms, and priority-ordered queue management. It also suppor

    Determines job execution order by iterating through a sequence of queues in a specific priority order.

    Rubyasynchronous-tasksasynctaskbackground-jobs
    عرض على GitHub↗9,480
  • node-schedule/node-scheduleN

    node-schedule/node-schedule

    9,210عرض على GitHub↗

    node-schedule is a job scheduler for Node.js that executes arbitrary functions based on specific dates or recurring rules. It functions as a date-based and event-driven scheduling system for JavaScript environments, allowing for the automation of one-off events and periodic tasks. The project supports recurring job scheduling through cron-style strings and recurrence rules, as well as the ability to schedule tasks for precise, single execution dates. It includes timezone-aware date calculations to map recurring rules against global or local time offsets. The system provides a comprehensive j

    Uses a priority-ordered queue to ensure the most imminent scheduled task is processed first.

    JavaScript
    عرض على GitHub↗9,210
  • apache/beamالصورة الرمزية لـ apache

    apache/beam

    8,612عرض على GitHub↗

    Apache Beam is a distributed data pipeline framework and unified data processing model designed to handle both bounded batch data and unbounded real-time streams. It provides a system for building scalable, data-parallel workflows that operate across compute clusters using a single programming model. The framework utilizes a cross-runner pipeline abstraction that decouples the data processing logic from the underlying execution backend, allowing the same pipeline to run on different distributed compute engines. It supports multi-language pipeline development by translating high-level code fro

    Captures and diverts malformed data to dead-letter queues to prevent pipeline failure and enable auditing.

    Java
    عرض على GitHub↗8,612
  • symfony/event-dispatcherالصورة الرمزية لـ symfony

    symfony/event-dispatcher

    8,541عرض على GitHub↗

    Symfony Event Dispatcher is a library that implements the observer pattern, enabling event-driven communication between application components. It provides a central dispatch mechanism where components can broadcast named events and register listeners to react to them, decoupling event producers from consumers. The library supports any PHP callable as an event listener and organizes listeners in a priority-ordered queue for controlled execution. Listeners can stop event propagation to prevent subsequent handlers from running, and the subscriber-based registration system allows grouping multip

    Organizes event listeners in a priority-ordered queue for controlled execution order.

    PHPcomponentphpsymfony
    عرض على GitHub↗8,541
  • boostorg/boostالصورة الرمزية لـ boostorg

    boostorg/boost

    8,493عرض على GitHub↗

    Boost is a collection of portable, high-performance source libraries that extend the C++ standard library. It provides a wide range of reusable components, data structures, and algorithms designed to add capabilities to the base language across different platforms. The project is distinguished by its extensive focus on compile-time template metaprogramming and generic programming. It implements advanced architectural patterns such as policy-based design, concept-based type validation, and the use of SFINAE for conditional template resolution to minimize runtime overhead. The library covers a

    Provides a standard-compliant ring buffer container for efficient fixed-size circular queuing.

    HTML
    عرض على GitHub↗8,493
  • crazyguitar/pysheeetالصورة الرمزية لـ crazyguitar

    crazyguitar/pysheeet

    8,150عرض على GitHub↗

    pysheeet هي مكتبة مرجعية تقنية توفر مجموعة مختارة من مقتطفات التعليمات البرمجية وأنماط التنفيذ لتطوير Python المتقدم، وتكامل النظام، والحوسبة عالية الأداء. تعمل كدليل شامل لتنفيذ برمجة الشبكات منخفضة المستوى، وإضافات C الأصلية، والبرمجة غير المتزامنة والمتزامنة. يوفر المشروع أطر عمل متخصصة لتطوير ونشر نماذج اللغات الكبيرة، بما في ذلك أدوات لاستنتاج GPU الموزع والخدمة عالية الأداء. يتضمن أيضاً أنماطاً مفصلة لتنظيم مجموعات الحوسبة عالية الأداء، وتغطية تخصيص موارد GPU وإدارة عبء العمل متعدد العقد. تغطي المكتبة سطحاً واسعاً من القدرات، بما في ذلك اتصالات الشبكة الآمنة والتشفير، والتعيين الكائني-العلائقي وإدارة قواعد البيانات، وتنفيذ هياكل البيانات والخوارزميات المعقدة. كما توفر أدوات لإدارة الذاكرة، وقابلية التشغيل البيني الأصلية عبر واجهات الوظائف الخارجية، وتكامل نظام التشغيل على مستوى النظام.

    Implements priority queue data structures to ensure the highest priority items are processed first.

    Python
    عرض على GitHub↗8,150
  • 7kms/react-illustration-seriesالصورة الرمزية لـ 7kms

    7kms/react-illustration-series

    7,932عرض على GitHub↗

    This project is a visual guide that explains the internal architecture of a UI library through annotated diagrams and step-by-step walkthroughs. It covers core mechanisms including how browser events are normalized into a unified system, how the fiber tree is constructed and reconciled for incremental updates, how state and effect hooks are managed through their lifecycle, and how the scheduler prioritizes work units to maintain responsive rendering. The resource distinguishes itself by mapping the library's package dependency hierarchy and providing visual explanations of how these internal

    Visualizes how a UI library's scheduler prioritizes work units using a deadline-driven queue for responsive rendering.

    TypeScriptfiberhookreact
    عرض على GitHub↗7,932
  • coells/100daysالصورة الرمزية لـ coells

    coells/100days

    7,488عرض على GitHub↗

    This project is a comprehensive collection of computer science implementations and an algorithm tutorial repository. It serves as a study guide and reference for competitive programming, providing executable code examples that demonstrate fundamental algorithmic problem solving and mathematical computation. The library covers a wide range of specialized domains, including cryptography and security primitives, lossless data compression techniques, and computational geometry for spatial analysis. It also features implementations of machine learning models, linear algebra operations, and formal

    Provides a priority queue implementation for efficient element retrieval in pathfinding.

    Jupyter Notebook
    عرض على GitHub↗7,488
السابق123التالي
  1. Home
  2. Software Engineering & Architecture
  3. Queue Implementations

استكشف الوسوم الفرعية

  • Dead Letter QueuesMechanisms for routing failed message delivery attempts to specialized handlers for inspection or recovery. **Distinct from Queue Implementations:** Distinct from general Queue Implementations: focuses on error handling and message recovery patterns rather than basic data structure implementation.
  • DistributedImplementing concurrent, ordered queue operations across a distributed system using keyspace ranges and atomic transactions. **Distinct from Queue Implementations:** Specifically covers the distribution of the queue across a cluster, whereas the parent covers general queue structures.
  • Monotonic QueuesQueues that maintain elements in a specific order to efficiently retrieve extrema. **Distinct from Queue Implementations:** Specific to monotonic ordering for window extrema, whereas Queue Implementations covers general FIFO structures.
  • Pluggable Queue OrderingsEnables custom ordering strategies for task queues, replacing default FIFO with user-defined logic. **Distinct from Priority Queues:** Distinct from Priority Queues: allows any user-defined ordering, not just priority-based.
  • Priority Queues12 وسوم فرعيةImplementation guides for managing elements with associated priorities. **Distinct from Queue Implementations:** Focuses on the priority queue variant specifically rather than general queue implementations.
  • Ring Buffers4 وسوم فرعيةFixed-size circular queues that use indexing to provide constant-time enqueue and dequeue operations. **Distinct from Queue Implementations:** Specializes general queue implementations into circular buffers