Found 10 packages
A library containing useful data structures like Trees, Tries, Sparse Arrays, Bloom Filters and indexing tailored dictionaries.
A small library for performing matrix math, linear algebra - now including sparse matrix solve. Most functions are static and use simple arrays (e.g double[,]) making it easy to use in other projects.
The SparseCollections library provides the SparseArray<T> and SparseMatrix<T> collection classes. The array class allow statements such as "array[1000000] = 5" or "array[-1000000] = 6" without having to create a large array. The matrix class does the same thing using a two-dimensional-array metaphor.
TreeLib: Balanced Binary Trees, Rank Augmented provides binary tree collections (AVL, red-black and splay) with optional rank information for order-statistic and sparse indexing applications. This package contains array-embedded implementations.
A graph data structure efficient for large sparse graph representation written in F#
MatFileHandler provides a simple interface for reading and writing MATLAB .mat files (of so-called "Level 5") and extracting the contents of numerical arrays, logical arrays, sparse arrays, char arrays, cell arrays and structure arrays.
Library of sparse collections and tools for working with them.
SliceAndDice features ArraySlice<T>, a lightweight wrapper around indexable data structures like T[] for creating arbitrary N-dimimensional views of the data as well as views of (sparse) sub-sections of array slices without copying the underlying data.
Portable .Net data encoders supporting .Net primitives, buffers, nullable types, arrays and sparse arrays (up to rank 3), and jagged arrays (up to 2 deep)
A .NET library providing a high-performance Wavelet Matrix, Suffix Array, FM-Index, LCP Index and Burrows Wheeler Transform. Core Data Structures: - Wavelet Matrix: Generic implementation supporting various data types with efficient Rank, Select, Quant - Sparse Table: For fast Range Minimum Queries (RMQ) on static arrays. Text Analysis Components: - Suffix Array: The foundational class for most text analysis. It builds a Suffix Array and LCP Array from a given text, enabling fast substring searches. - LCP Index: Provides O(1) LCP queries between any two suffixes using a Sparse Table. - FM-Index: A full-text index based on the Burrows-Wheeler Transform, allowing efficient substring search operations (Count/Locate). Ideal for applications in bioinformatics, text processing, and data compression. For more details, please visit the project repository on GitHub.