30 repositorios
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
pysheeet es una biblioteca de referencia técnica que proporciona una colección curada de fragmentos de código y patrones de implementación para el desarrollo avanzado en Python, integración de sistemas y computación de alto rendimiento. Sirve como una guía completa para implementar programación de red de bajo nivel, extensiones nativas en C y programación asíncrona y concurrente. El proyecto proporciona frameworks especializados para el desarrollo y despliegue de modelos de lenguaje de gran tamaño, incluyendo herramientas para inferencia distribuida en GPU y servicio de alto rendimiento. También incluye patrones detallados para la orquestación de clústeres de computación de alto rendimiento, cubriendo la asignación de recursos de GPU y la gestión de cargas de trabajo en múltiples nodos. La biblioteca cubre una amplia superficie de capacidades, incluyendo comunicación de red segura y criptografía, mapeo objeto-relacional y gestión de bases de datos, y la implementación de estructuras de datos y algoritmos complejos. También proporciona utilidades para la gestión de memoria, interoperabilidad nativa a través de interfaces de funciones externas e integración de sistemas operativos a nivel de sistema.
Implements priority queue data structures to ensure the highest priority items are processed first.
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.
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.
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.
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.
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.
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.
Just es una colección de librerías de utilidades de JavaScript diseñadas para la manipulación de datos, programación funcional, optimización del rendimiento, análisis estadístico y procesamiento de cadenas. Proporciona un conjunto de herramientas para clonación profunda, filtrado y transformación de objetos y arrays complejos. El proyecto está estructurado como una serie de módulos sin dependencias, permitiendo que las utilidades se utilicen de forma independiente para minimizar el tamaño del bundle. Implementa patrones de programación funcional incluyendo currying, piping y aplicación parcial, y proporciona control de ejecución mediante memoización, debouncing y throttling. La librería cubre un amplio rango de capacidades, incluyendo manipulación profunda de objetos, generación de datos combinatorios y operaciones matemáticas como verificación de números primos y acotación numérica. También incluye herramientas estadísticas para calcular métricas como varianza y desviación estándar, así como utilidades de procesamiento de texto para conversión de casos e interpolación de cadenas.
Provides utilities to generate random integers within specified inclusive minimum and maximum bounds.
Este proyecto es una biblioteca de algoritmos en C# y una colección de estructuras de datos. Sirve como referencia de ciencias de la computación proporcionando implementaciones prácticas de patrones clásicos de ordenamiento, búsqueda y recorrido de grafos. La biblioteca incluye un kit de herramientas de procesamiento de cadenas dedicado para analizar la similitud de texto, calcular distancias de edición y gestionar búsquedas basadas en prefijos. También cuenta con una implementación de teoría de grafos para modelar relaciones de red y calcular caminos más cortos. El código base cubre una amplia gama de capacidades, incluyendo la gestión de colecciones lineales y jerárquicas, manipulación y visualización de estructuras de datos de árbol, y el cálculo de secuencias numéricas matemáticas.
Implements priority queues using various heap structures to manage elements with associated priorities.
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.
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.