NuGet Gallery Feed for MoreComplexDataStructuresMoreComplexDataStructures 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 algorithmhttps://www.nuget.org/packages/MoreComplexDataStructures/2020-03-29T09:17:06Zhttps://www.nuget.org/packages/MoreComplexDataStructures/1.9.1MoreComplexDataStructures 1.9.12020-03-29T09:15:03Z2020-03-29T09:17:06Zalastairwysehttps://www.nuget.org/profiles/alastairwyseMoreComplexDataStructures 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 algorithmhttps://www.nuget.org/packages/MoreComplexDataStructures/1.9.0MoreComplexDataStructures 1.9.02019-11-06T14:06:29Z2019-11-06T14:11:34Zalastairwysehttps://www.nuget.org/profiles/alastairwyseMoreComplexDataStructures 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 algorithmhttps://www.nuget.org/packages/MoreComplexDataStructures/1.8.0MoreComplexDataStructures 1.8.02019-09-16T07:55:10Z2019-09-16T08:01:21Zalastairwysehttps://www.nuget.org/profiles/alastairwyseMoreComplexDataStructures 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 algorithmhttps://www.nuget.org/packages/MoreComplexDataStructures/1.7.0MoreComplexDataStructures 1.7.02019-09-07T02:44:50Z2019-09-07T02:49:03Zalastairwysehttps://www.nuget.org/profiles/alastairwyseMoreComplexDataStructures 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 algorithmhttps://www.nuget.org/packages/MoreComplexDataStructures/1.6.0MoreComplexDataStructures 1.6.02019-07-27T04:51:05Z2019-07-27T04:55:17Zalastairwysehttps://www.nuget.org/profiles/alastairwyseMoreComplexDataStructures 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 algorithmhttps://www.nuget.org/packages/MoreComplexDataStructures/1.5.0MoreComplexDataStructures 1.5.02019-05-18T08:22:08Z2019-05-18T08:26:37Zalastairwysehttps://www.nuget.org/profiles/alastairwyseMoreComplexDataStructures 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 - An implementation of a weight-balanced tree. The tree maintains counts of the nodes in each node's subtrees, and implements basic self balancing by performing rotations on any nodes where the subtree sizes differ, and rotation would improve the balance. The class implements several methods to traverse based on item value comparison (e.g. GetNextLessThan(), GetNextGreaterThan(), GetAllLessThan(), GetAllGreaterThan()), and executes GetCountLessThan() and GetCountGreaterThan() in O(log(n)) time (since these values are stored and maintained at each node). The class also provides methods to perform pre, post, and in-order depth-first search, breadth-first search, and to return a random node item.
MinHeap / MaxHeap - Tree-based implementations of a min and max heap. Insert() and ExtractMin() / ExtractMax() methods return with order O(log(n)) time complexity. Also provides methods to traverse the nodes of the underlying trees via a breadth-first search.
LongIntegerStatusStorer - Stores a true/false status for a complete set of long (Int64) integers. Uses an underlying tree holding ranges of integers to store the statuses. Also provides a method TraverseTree() to traverse the ranges stored in the tree via a breadth-first search. Designed to be more memory efficient than an equivalent boolean array when large sets of the Int64 key values are contiguous (and hence can be 'condensed' into a range), and to support ranges larger than Int32.MaxValue.
ListRandomizer - Randomizes a List or Array using the Fisher/Yates/Knuth algorithm (O(n) time complexity).
WeightedRandomGenerator - Returns items randomly based on configured weightings. The underlying implementation uses a tree, so the Generate() method returns with order O(log(n)) time complexity (where n is the number of weightings defined).
Trie - An implementation of trie / prefix tree. Nodes of the trie maintain a count of the number of sequences in each subtree, hence the GetCountOfSequencesWithPrefix() method returns a list of sequences with the specified prefix with order O(n) time complexity (where n is the number of elements in the prefix sequence).
FrequencyTable - A simple (Dictionary-based) frequency table, which stores the frequency of occurrence of objects.
BinarySearchTreeBalancedInserter - Inserts a set of items into a binary search tree, ensuring that the tree is balanced, and depth is minimized.
CharacterTrie - Effectively a Trie<Char>, but with special implementations of the Insert(), Delete(), and Contains() methods which accept String parameters (and avoid the overhead of having to call String.ToCharArray() as is required with a Trie<Char>).
LRUCache - A simple implementation of a least-recently-used cache using an underlying Dictionary and LinkedList. By default the cache stores a fixed number of items (defined by constructor parameter 'itemLimit'), but it optionally allows overriding the routine to check whether the cache is full (e.g. to decide instead based on total memory usage, etc...).
UnflaggedNumberGenerator - Allows 'flagging' (i.e. setting true or false) for each number in a consecutive range (where the range length is <= Int64.MaxValue), and then provides methods to identify which numbers have not been flagged (GetLowestUnflaggedNumbers(), GetHighestUnflaggedNumbers(), etc...).
UniqueRandomGenerator - Generates unique Int64 random numbers within a given range (where the range length is <= Int64.MaxValue). The underlying implementation uses a balanced tree of integer ranges, so the Generate() method returns with order O(log(n)) time complexity.https://www.nuget.org/packages/MoreComplexDataStructures/1.4.0MoreComplexDataStructures 1.4.02018-02-10T14:48:44Z2018-12-18T21:19:52Zalastairwysehttps://www.nuget.org/profiles/alastairwyseMoreComplexDataStructures 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 - An implementation of a weight-balanced tree. Although self-balancing is not yet implemented, the tree maintains counts of the nodes in each node's subtrees. This allows methods GetCountGreaterThan(T item) and GetCountLessThan(T item) (which return the number of items greater than and less than a specified item) to return with order O(log(n)) time complexity. The class also provides methods to perform pre, post, and in-order depth-first search, and breadth-first search.
MinHeap / MaxHeap - Tree-based implementations of a min and max heap. Insert() and ExtractMin() / ExtractMax() methods return with order O(log(n)) time complexity. Also provides methods to traverse the nodes of the underlying trees via a breadth-first search.
LongIntegerStatusStorer - Stores a true/false status for a complete set of long (Int64) integers. Uses an underlying tree holding ranges of integers to store the statuses. Also provides a method TraverseTree() to traverse the ranges stored in the tree via a breadth-first search.
ListRandomizer - Randomizes a List or Array using the Fisher/Yates/Knuth algorithm (O(n) time complexity).
WeightedRandomGenerator - Returns items randomly based on configured weightings. The underlying implementation uses a tree, so the Generate() method returns with order O(log(n)) time complexity (where n is the number of weightings defined).
Trie - An implementation of trie / prefix tree. Nodes of the trie maintain a count of the number of sequences in each subtree, hence the GetCountOfSequencesWithPrefix() method returns a list of sequences with the specified prefix with order O(n) time complexity (where n is the number of elements in the prefix sequence).
FrequencyTable - A simple (Dictionary-based) frequency table, which stores the frequency of occurrence of objects.
BinarySearchTreeBalancedInserter - Inserts a set of items into a binary search tree, ensuring that the tree is balanced, and depth is minimized.https://www.nuget.org/packages/MoreComplexDataStructures/1.3.0MoreComplexDataStructures 1.3.0.02017-10-16T14:12:54Z2018-12-18T21:19:45Zalastairwysehttps://www.nuget.org/profiles/alastairwyseMoreComplexDataStructures 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 - An implementation of a weight-balanced tree. Although self-balancing is not yet implemented, the tree maintains counts of the nodes in each node's subtrees. This allows methods GetCountGreaterThan(T item) and GetCountLessThan(T item) (which return the number of items greater than and less than a specified item) to return with order O(log(n)) time complexity. The class also provides methods to perform pre, post, and in-order depth-first search, and breadth-first search.
MinHeap / MaxHeap - Tree-based implementations of a min and max heap. Insert() and ExtractMin() / ExtractMax() methods return with order O(log(n)) time complexity. Also provides methods to traverse the nodes of the underlying trees via a breadth-first search.
LongIntegerStatusStorer - Stores a true/false status for a complete set of long (Int64) integers. Uses an underlying tree holding ranges of integers to store the statuses. Also provides a method TraverseTree() to traverse the ranges stored in the tree via a breadth-first search.
ListRandomizer - Randomizes a List or Array using the Fisher/Yates/Knuth algorithm (O(n) time complexity).
WeightedRandomGenerator - Returns items randomly based on configured weightings. The underlying implementation uses a tree, so the Generate() method returns with order O(log(n)) time complexity (where n is the number of weightings defined).
Trie - An implementation of trie / prefix tree. Nodes of the trie maintain a count of the number of sequences in each subtree, hence the GetCountOfSequencesWithPrefix() method returns a list of sequences with the specified prefix with order O(n) time complexity (where n is the number of elements in the prefix sequence).
FrequencyTable - A simple (Dictionary-based) frequency table, which stores the frequency of occurrence of objects.
BinarySearchTreeBalancedInserter - Inserts a set of items into a binary search tree, ensuring that the tree is balanced, and depth is minimized.https://www.nuget.org/packages/MoreComplexDataStructures/1.2.0MoreComplexDataStructures 1.2.0.02017-08-26T05:33:37Z2018-12-18T21:19:47Zalastairwysehttps://www.nuget.org/profiles/alastairwyseMoreComplexDataStructures is a class library containing a collection of data structures more complex than those found in the standard .NET framework.
The project currently contains the following data structures...
WeightBalancedTree - An implementation of a weight-balanced tree. Although self-balancing is not yet implemented, the tree maintains counts of the nodes in each node's subtrees. This allows methods GetCountGreaterThan(T item) and GetCountLessThan(T item) (which return the number of items greater than and less than a specified item) to return with order O(log(n)) time complexity. The class also provides methods to perform pre, post, and in-order depth-first search, and breadth-first search.
MinHeap / MaxHeap - Tree-based implementations of a min and max heap. Insert() and ExtractMin() / ExtractMax() methods return with order O(log(n)) time complexity. Also provides methods to traverse the nodes of the underlying trees via a breadth-first search.
LongIntegerStatusStorer - Stores a true/false status for a complete set of long (Int64) integers. Uses an underlying tree holding ranges of integers to store the statuses. Also provides a method TraverseTree() to traverse the ranges stored in the tree via a breadth-first search.
ListRandomizer - Randomizes a List or Array using the Fisher/Yates/Knuth algorithm (O(n) time complexity).
WeightedRandomGenerator - Returns items randomly based on configured weightings. The underlying implementation uses a tree, so the Generate() method returns with order O(log(n)) time complexity (where n is the number of weightings defined).https://www.nuget.org/packages/MoreComplexDataStructures/1.1.0MoreComplexDataStructures 1.1.0.02017-06-23T00:51:27Z2018-12-18T21:19:49Zalastairwysehttps://www.nuget.org/profiles/alastairwyseMoreComplexDataStructures is a class library containing a collection of data structures more complex than those found in the standard .NET framework.
The project currently contains the following data structures...
WeightBalancedTree - An implementation of a weight-balanced tree. Although self-balancing is not yet implemented, the tree maintains counts of the nodes in each node's subtrees. This allows methods GetCountGreaterThan(T item) and GetCountLessThan(T item) (which return the number of items greater than and less than a specified item) to return with order O(log(n)) time complexity. The class also provides methods to perform pre, post, and in-order depth-first search, and breadth-first search.
MinHeap / MaxHeap - Tree-based implementations of a min and max heap. Insert() and ExtractMin() / ExtractMax() methods return with order O(log(n)) time complexity. Also provides methods to traverse the nodes of the underlying trees via a breadth-first search.
LongIntegerStatusStorer - Stores a true/false status for a complete set of long (Int64) integers. Uses an underlying tree holding ranges of integers to store the statuses. Also provides a method TraverseTree() to traverse the ranges stored in the tree via a breadth-first search.
ListRandomizer - Randomizes a List or Array using the Fisher/Yates/Knuth algorithm (O(n) time complexity).