24 packages tagged with “sets”
A utility library for GitHub repository ruleset related operations
LinksPlatform's Platform.Collections Class Library
Multiple extension methods to determine, manipulate and adjust enumerable data sets
ISetEx and base class implementation, builds on ISet
A PascalSet space optimized for having fewer elements over a large range of integers.
Ordered Set implemenetation.
XUnit tests for adjunct-System.DataStructures.SparsePascalSet
The CData SAS Data Sets Data Provider allows you to display SAS Data Sets files in a table format. Just specify your credentials to retrieve SAS Data Sets data and display it in a table.
A Sparse Character Set
XUnit tests for adjunct-System.DataStructures.SetBase
XUnit tests for adjunct-System.DataStructures.OrderedSet
Defines useful set-related interfaces, such as IReadOnlySet.
Basic .NET library containing utility code (re)used within the last decade (or longer) by the author.
The Web Link Set Editor allows users to conveniently edit and clone portal web link sets along with their associated child web links.
Defines an IImmutableSet that implements IReadOnlySet.
Generic sets for numbers or numberlike objects and Union, Interection and Difference for them. The sets track if they contain their endpoints and thus wether they are Open, Closed or neither.
A simple, extensible system for identifying and selecting scopes within sets.
Package Description
The Sets library extends YAMP with Sets and set operations.
Ccr.Algorithms package for Sequential sets, pairs, triples, and quads; String algorithms, and spline interpolation algorithms.
A high-throughput, thread-safe set whose bucketed entries automatically expire after a fixed time window.
MoreStructures is a library of classical algorithms and data structures, written 100% in (safe, managed) C# 10, for .NET 6 and above. Data structures - Stacks, Queues, Priority Queues, Disjoint Sets, Trees, Graphs, Suffix Trees, Suffix Tries. Algorithms - Strings sorting and matching. Lists searching and sorting. Trees augmentation and visit. Graphs: visits, minimum spanning tree, shortest distance, shortest path, topological sorting, strongly connected components. Suffix Trees and Tries construction and matching.