20 packages tagged with “deque”
A double-ended queue.
.NET bindings for the axe-core accessiblity testing engine
DequeNET (pronounced Deck Net) provides a concurrent lock-free deque C# implementation. A deque, or double-ended queue, is a data structure that allows insertion and removal of items on both ends. ConcurrentDeque<T> supports 6 operations in constant time O(1): PushRight, PopRight, PeekRight, PushLeft, PopLeft and PeekLeft. The library also offers a simpler Deque<T> (not thread safe), implemented as a ring buffer. This implementation allows Pop and Peek operations to run in O(1) time and Push operations in amortized O(1) time.
Tools for using aXe for web accessibility testing with C# and Selenium
Automated accessibility testing via axe for tests written with Microsoft Playwright .NET
Provides additional data collections, primitives and polyfills for .NET: ConcurrentHashSet<T>, AssociativeArray<T>, PriorityQueue<T>, Deque<T>.
Wintellect Power Collections is a community project to develop the best public license type-safe collection classes for .NET. Power Collections implements classical data structures (lists, sets, bags, dictionaries) in C#, which are well optimized for performance, and makes heavy use of .NET generics. The goal of the project is to provide generic high-performance collection classes that are not available in .NET standard library. Data structures, implemented in PowerCollections: Set<T>: a collection of items (maintained in unpredictable order). Duplicate items are not allowed. Bag<T>: a collection of items, which allows duplicates. Similar to Set<T> but allows duplicates. BigList<T>: a list of items, optimized for efficient operations on large lists (especially for insertions, deletions, copies, and concatenations). Deque<T>: implementation of Deque (Double Ended Queue), with efficient inserting elements at the beginning and at the end. MultiDictionary<TKey, TValue>: a dictionary collection, which associates multiple values with a key. Lookup by key returns an enumeration of items. OrderedSet<T>: a collection of items, maintained in a sorted order (duplicates are not allowed). Each item has an index in the set (0…Count-1). Provides efficient sub-range extraction. OrderedBag<T>: a collection of items, maintained in a sorted order, with duplicates. Provides efficient sub-range extraction. OrderedDictionary<TKey, TValue>: a dictionary collection that associates keys to values. The keys are maintained in a sorted order. Provides efficient sub-range extraction. OrderedMultiDictionary<TKey, TValue>: a dictionary collection that associates multiple values with a key. The keys are maintained in a sorted order. Lookup by key returns an enumeration of items. Provides efficient sub-range extraction. This library was originally produced by Wintellect and is offered AS IS. It has been available on the Wintellect site for some time, later moved to Codeplex to encourage its growth and use, and then it was lost with the shutdown of Codeplex. Power Collections is free for all to use within the bounds of the standard Eclipse Public License (EPL). The code is originally written by Peter Golde (at Wintellect, in the period 2004-2007), then evolved in the open-source community.
Binaries for the Deque library. Visit https://github.com/tejacques/Deque for an overview and usage examples.
Add asynchrony to your apps
A powerful library of immutable and persistent data structures for the .NET platform.
This library provides F# integration for the Imms immutable collections library.
Provides collection types and searching methods.
Double-ended queue for .NET
Provides a simple set of list based extensions for Double-ended Queue, or Deque, operation.
Collection of useful classes for your .NET application: Object Pool, Thread Pool, Queue Async Processor, BlockingQueue, DiskQueue, ThreadSetManager, Throttling, Semaphore, EntryCounteringEvent, Collections, ReadOnlyCollections, IoC, WeakEvent and other.
Advanced data structures for .NET
Advanced and complementary data structures for modern .NET. Includes DoublyLinkedList, SortedList, PriorityQueue, Deque, PriorityStack, BinarySearchTree, and Graph implementations.