awesome-repositories.com
Blog
awesome-repositories.com

Descoperă cele mai bune repository-uri open source cu căutare AI.

ExploreazăCăutări recomandateAlternative open-sourceSoftware self-hostedBlogHartă site
ProiectDespreCum realizăm clasamentulPresăServer MCP
LegalConfidențialitateTermeni
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

30 repository-uri

Awesome GitHub RepositoriesPriority Queues

Implementation guides for managing elements with associated priorities.

Distinct from Queue Implementations: Focuses on the priority queue variant specifically rather than general queue implementations.

Explore 30 awesome GitHub repositories matching software engineering & architecture · Priority Queues. Refine with filters or upvote what's useful.

Awesome Priority Queues GitHub Repositories

Găsește cele mai bune repo-uri cu AI.Vom căuta cele mai potrivite repository-uri folosind AI.
  • geekxh/hello-algorithmAvatar geekxh

    geekxh/hello-algorithm

    36,074Vezi pe 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
    Vezi pe GitHub↗36,074
  • kodecocodes/swift-algorithm-clubAvatar kodecocodes

    kodecocodes/swift-algorithm-club

    29,099Vezi pe 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

    A priority queue that stores a fixed number of elements and ejects the lowest priority item when full.

    Swiftalgorithmsdata-structuresswift
    Vezi pe GitHub↗29,099
  • wangzheng0822/algoAvatar wangzheng0822

    wangzheng0822/algo

    23,159Vezi pe 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
    Vezi pe GitHub↗23,159
  • apple/foundationdbAvatar apple

    apple/foundationdb

    16,446Vezi pe 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

    Implements priority queues for managing collections of values with associated priorities for extreme element retrieval.

    C++aciddistributed-databasefoundationdb
    Vezi pe GitHub↗16,446
  • federico-busato/modern-cpp-programmingAvatar federico-busato

    federico-busato/Modern-CPP-Programming

    15,808Vezi pe 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
    Vezi pe GitHub↗15,808
  • resque/resqueAvatar resque

    resque/resque

    9,480Vezi pe 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
    Vezi pe GitHub↗9,480
  • node-schedule/node-scheduleN

    node-schedule/node-schedule

    9,210Vezi pe 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
    Vezi pe GitHub↗9,210
  • symfony/event-dispatcherAvatar symfony

    symfony/event-dispatcher

    8,541Vezi pe 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
    Vezi pe GitHub↗8,541
  • boostorg/boostAvatar boostorg

    boostorg/boost

    8,493Vezi pe 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

    Implements priority queues that order elements by priority while supporting stability and heap merging.

    HTML
    Vezi pe GitHub↗8,493
  • crazyguitar/pysheeetAvatar crazyguitar

    crazyguitar/pysheeet

    8,150Vezi pe GitHub↗

    pysheeet este o bibliotecă de referință tehnică ce oferă o colecție curatoriată de fragmente de cod și modele de implementare pentru dezvoltarea avansată în Python, integrarea sistemelor și calculul de înaltă performanță. Servește ca un ghid cuprinzător pentru implementarea programării de rețea de nivel scăzut, extensiilor native C și programării asincrone și concurente. Proiectul oferă framework-uri specializate pentru dezvoltarea și implementarea modelelor de limbaj mari, inclusiv instrumente pentru inferență distribuită pe GPU și servire de înaltă performanță. Include, de asemenea, modele detaliate pentru orchestrarea clusterelor de calcul de înaltă performanță, acoperind alocarea resurselor GPU și gestionarea sarcinilor de lucru pe mai multe noduri. Biblioteca acoperă o gamă largă de capabilități, inclusiv comunicarea securizată în rețea și criptografia, object-relational mapping și gestionarea bazelor de date, precum și implementarea structurilor de date și algoritmilor complecși. Oferă, de asemenea, utilitare pentru gestionarea memoriei, interoperabilitate nativă prin interfețe de funcții străine (FFI) și integrarea la nivel de sistem de operare.

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

    Python
    Vezi pe GitHub↗8,150
  • 7kms/react-illustration-seriesAvatar 7kms

    7kms/react-illustration-series

    7,932Vezi pe 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
    Vezi pe GitHub↗7,932
  • coells/100daysAvatar coells

    coells/100days

    7,488Vezi pe 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
    Vezi pe GitHub↗7,488
  • mahmoud/boltonsAvatar mahmoud

    mahmoud/boltons

    6,897Vezi pe GitHub↗

    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

    Provides a priority queue implementation where the highest priority item is processed first.

    Python
    Vezi pe GitHub↗6,897
  • huri000/swiftentrykitAvatar huri000

    huri000/SwiftEntryKit

    6,760Vezi pe GitHub↗

    SwiftEntryKit is a Swift presentation framework and UI overlay library used to orchestrate banners, pop-up views, and custom modal presentations on top of an iOS application window. It functions as a view orchestrator that manages the lifecycle, animations, and layering of multiple overlapping user interface elements. The framework features a priority-based queueing system to determine the display order and precedence of overlays, ensuring specific elements can override others. It includes a dedicated animation toolkit for translation, scale, and fade transitions, alongside haptic integration

    Features a priority-based queuing system to determine the display order and precedence of overlapping overlays.

    Swift
    Vezi pe GitHub↗6,760
  • beanstalkd/beanstalkdAvatar beanstalkd

    beanstalkd/beanstalkd

    6,697Vezi pe GitHub↗

    Beanstalkd is a distributed work queue server designed for asynchronous job processing. It functions as a standalone server that distributes background tasks between producers and consumers to improve application responsiveness and throughput. The system organizes tasks using numeric priority levels to ensure critical work is processed first. It manages the job lifecycle through discrete states and uses a simple line-based text protocol over TCP for communication. To ensure reliability, the server persists job data to a sequential disk log, allowing the queue state to be recovered after a sy

    Uses priority queues to organize tasks, ensuring higher-priority jobs are dequeued before lower-priority ones.

    C
    Vezi pe GitHub↗6,697
  • chancejs/chancejsAvatar chancejs

    chancejs/chancejs

    6,541Vezi pe GitHub↗

    Chance is a JavaScript library for generating random data, designed to produce realistic test data for automated tests and prototypes. It uses a Mersenne Twister pseudo-random number generator that accepts an optional seed value, enabling reproducible sequences of random values across multiple runs. The library provides a wide range of generators for common data types, including random integers, floats, booleans, characters, strings, and dates, all with configurable ranges and character pools. It can generate realistic geographic data like addresses, as well as financial data such as credit c

    Produces random numbers within inclusive minimum and maximum bounds for integers, floats, and primes.

    JavaScript
    Vezi pe GitHub↗6,541
  • angus-c/justAvatar angus-c

    angus-c/just

    6,204Vezi pe GitHub↗

    Just este o colecție de biblioteci de utilitare JavaScript concepute pentru manipularea datelor, programarea funcțională, optimizarea performanței, analiza statistică și procesarea șirurilor de caractere. Oferă un set de instrumente pentru deep cloning, filtrarea și transformarea obiectelor și array-urilor complexe. Proiectul este structurat ca o serie de module fără dependențe, permițând utilizarea independentă a utilitarelor pentru a minimiza dimensiunea bundle-ului. Implementează tipare de programare funcțională, inclusiv currying, piping și aplicare parțială, și oferă controlul execuției prin memoizare, debouncing și throttling. Biblioteca acoperă o gamă largă de capabilități, inclusiv manipularea profundă a obiectelor, generarea combinatorie de date și operațiuni matematice precum verificarea numerelor prime și numeric clamping. Include, de asemenea, instrumente statistice pentru calcularea metricilor precum varianța și deviația standard, precum și utilitare de procesare a textului pentru conversia cazurilor și interpolarea șirurilor.

    Provides utilities to generate random integers within specified inclusive minimum and maximum bounds.

    JavaScript
    Vezi pe GitHub↗6,204
  • aalhour/c-sharp-algorithmsAvatar aalhour

    aalhour/c-sharp-algorithms

    6,159Vezi pe GitHub↗

    Acest proiect este o bibliotecă de algoritmi C# și o colecție de structuri de date. Servește ca referință de informatică oferind implementări practice ale tiparelor clasice de sortare, căutare și traversare a grafurilor. Biblioteca include un set de instrumente dedicat procesării șirurilor pentru analizarea similitudinii textului, calcularea distanțelor de editare și gestionarea căutărilor bazate pe prefix. De asemenea, dispune de o implementare a teoriei grafurilor pentru modelarea relațiilor de rețea și calcularea celor mai scurte căi. Codul sursă acoperă o gamă largă de capabilități, inclusiv gestionarea colecțiilor liniare și ierarhice, manipularea și vizualizarea structurilor de date de tip arbore și calcularea secvențelor numerice matematice.

    Implements priority queues using various heap structures to manage elements with associated priorities.

    C#
    Vezi pe GitHub↗6,159
  • apache/nifiAvatar apache

    apache/nifi

    5,976Vezi pe GitHub↗

    Apache NiFi is a flow-based programming platform that enables the visual design, monitoring, and management of data pipelines. At its core, it provides a web-based visual dataflow designer where users build directed graphs of processors to route, transform, and mediate data movement between any source and destination without writing custom code. The system records fine-grained data provenance for every data item from ingestion to delivery, supporting audit, debugging, and replay of data lineage. The platform distinguishes itself through a zero-master cluster architecture that distributes proc

    Queues data with priority-based ordering to control processing order within the dataflow.

    Javaapachehacktoberfestjava
    Vezi pe GitHub↗5,976
  • gothenburgbitfactory/taskwarriorAvatar GothenburgBitFactory

    GothenburgBitFactory/taskwarrior

    5,906Vezi pe GitHub↗

    Taskwarrior is a command-line task manager that lets you create, modify, filter, and complete to-do items directly from the terminal. It stores all tasks in a single plain-text file for portability and manual editing, and includes a custom expression language for selecting tasks by status, priority, tags, and date ranges. The tool distinguishes itself through several integrated capabilities. It computes a numeric urgency score for each task based on weighted factors like age, tags, and due date to determine ordering. A recurrence template engine generates new task instances from a template af

    Computes a numeric urgency score for each task based on age, tags, and due date to determine ordering.

    C++gtdtask-managertaskwarrior
    Vezi pe GitHub↗5,906
Înapoi12Înainte
  1. Home
  2. Software Engineering & Architecture
  3. Queue Implementations
  4. Priority Queues

Explorează sub-etichetele

  • Android Priority Job Queues1 sub-tagAndroid libraries that manage a persistent, priority-ordered queue of background jobs with configurable execution policies. **Distinct from Priority Queues:** Distinct from Priority Queues: specifically targets Android platform with persistence and configurable execution policies.
  • Bounded1 sub-tagPriority queues with a fixed maximum capacity that automatically eject lowest-priority elements. **Distinct from Priority Queues:** Focuses on the capacity-limiting and ejection logic of bounded queues versus unbounded priority queues.
  • DataflowQueues that order data items by configurable priority within a dataflow pipeline to control processing order. **Distinct from Priority Queues:** Distinct from general Priority Queues: specifically designed for dataflow pipeline processing order control, not generic queue implementations.
  • Dataflow Priority Queue ManagersQueues that order data items by priority within a dataflow pipeline to control processing order. **Distinct from Priority Queues:** Distinct from general Priority Queues: specifically designed for dataflow pipeline processing order control, not generic queue implementations.
  • Deadline-DrivenQueues that prioritize rendering work units by deadlines to maintain responsive frame rates. **Distinct from Priority Queues:** Distinct from Priority Queues: adds deadline-driven scheduling for rendering tasks, not general priority ordering.
  • Listener QueuesListeners are stored in a sorted priority queue and executed in order of their assigned priority. **Distinct from Priority Queues:** Distinct from Priority Queues: focuses on ordering event listeners by priority rather than general data priority queues.
  • Multi-Cluster Queue PrioritizationManages queue priority across clusters so high-priority queues secure resources first. **Distinct from Priority Queues:** Distinct from generic priority queue implementations: focuses on hierarchical queue priority management across multiple Kubernetes clusters.
  • Presentation1 sub-tagQueueing systems that manage the arrival and priority of visual elements to determine if they override current views. **Distinct from Priority Queues:** Applies priority queue logic specifically to the timing and sequence of UI presentation rather than general data structures.
  • Task Execution QueuesOrdering of asynchronous setup tasks using priority queues to ensure correct execution sequence. **Distinct from Priority Queues:** Distinct from the generic Priority Queues data structure by applying it specifically to the orchestration of setup tasks.
  • Task Ordering1 sub-tagMechanisms for sequencing tasks based on numeric priority levels to ensure critical work is processed first. **Distinct from Priority Queues:** Focuses on the application of priority queues to task execution order, rather than the data structure implementation itself.
  • TransactionalPriority queues that support atomic operations within a software transactional memory context. **Distinct from Priority Queues:** Adds transactional atomicity to the general concept of priority queues
  • UI DisplayQueues that manage the visual layering and display order of UI elements based on priority. **Distinct from Priority Queues:** Focuses on the visual precedence of UI overlays rather than general data structure implementations.