42 packages tagged with “Priority”
Provides an ITestCaseOrderer that allows you to control the order of execution of Xunit tests within a class.
Extensions for ordered testing with Xunit. Full support for ordering at all levels - test collections, test classes and test cases. Support for AssemblyFixture including IMessageSink injection and IAsyncLifetime. Supports .NET Core 1.x, .NET Core 2.x. and .NET 4.5.2+
Dangl.Xunit.Extensions.Ordering - www.dangl-it.com
Top-quality toolkit of algorithms and data structures for .NET developers.
An enumerator for email priorities
Deckard is a messaging system inspired by projects like: Google Cloud PubSub, Nats, Kafka and others.
Priority queue, reversible dictionary, reversible sorted dictionary, dynamic multidimensional array, heap, heapsort etc.
A fast generic PriorityQueue data structure .NET
King.Collections Class Library
A simple and super efficient priority queue
A C# .NET 6 library for parallel async request handling. Features include priority settings, retry functions, and expandable classes, making it ideal for HTTP requests and CPU-intensive tasks.
Keyed fan-out with multiple priority lanes - priority items drain first while maintaining per-key ordering.
Lightweight generic Graph implementation in C#
This is a small library that implements a meldable priority queue and a generalizable A* search algorithm on top of that. The performance is good. It targets PCL profile 111.
A simple and quick C# priority queue
PriorityStorageQueueReader is a priority based reader message reader for Azure Queue that supports great multi-threading processing capability A single reader may read form multiple queues within the same storage account and process on multiple handlers new PriorityStorageQueueReader(cnn , new QueueMessageReceiveHandler(1, "999-test1", OnNext) , new QueueMessageReceiveHandler(2, "999-test2", OnNext) , new QueueMessageReceiveHandler(3, "999-test3", OnNext) )) q: info@antonioesposito.it
Asynchronous and synchronous lock with two priorities in C#
The current repository allows you to maintain your start-up project class cleanly, and organize solution structure more clearly, simply readable, and reusable. And with the possibility to order initialize and use it or not. Using this functionality allows you to safely add new dependence, adjust existing or remove/relocate it without pain and with a few adjustments.
Help developers in priority management of any list with any items in it.
DataStructures for graphs, vertices,edges,nodes and trees. Contains a Binary Search Tree, AVL Tree and a PriorityQueue based on BST Tree which can handle duplicates
Priority-based processing with automatic failover. Routes work to primary processor, with instant failover to backup on repeated failures and self-healing recovery probing.
Awesome priority queue
MoreComplexDataStructures is a class library containing a collection of data structures (plus related utility classes) more complex than those found in the standard .NET framework. The project currently contains the following data structures and utility classes... WeightBalancedTree<T> - A weight-balanced binary search tree MinHeap<T> - A tree-based min heap MaxHeap<T> - A tree-based max heap PriorityQueue<T> - A tree-based double-ended priority queue Trie<T> - A trie (or prefix tree) CharacterTrie - A trie which stores characters (with some performance enhancements over Trie<Char>) WeightedRandomGenerator<T> - A weighted random number (or item) generator UniqueRandomGenerator - A random number generator guaranteed to always produce unique numbers within a given range FrequencyTable<T> - A frequency table LRUCache<TKey, TValue> - A simple least recently used cache UnflaggedNumberGenerator - Allows the 'flagging' (marking) of numbers in a specified range, and provides methods to identify numbers which were not flagged LongIntegerStatusStorer - Stores a boolean status for a complete set of long integers ListRandomizer - Randomizes the elements of a list using the Fisher/Yates/Knuth algorithm
Ordering XUnit testcase based on priority.
Priority queue for net standard. GitHub link: https://github.com/spiri91/PQ.NET
HeapQueue is a generic priority queue implementation that uses a binary heap.
Fast and efficient implementation of a Priority Queue.