15 packages returned for Tags:"Sparse"

A library containing useful data structures like Trees, Tries, Sparse Arrays, Bloom Filters and indexing tailored dictionaries.

While there are already countless math libraries for performing common matrix/array functions, StarMath is distinguished by its simplicity and flexbility. There is no need to declare vectors and matrices in a specific library format. It works simliar to Math.function calls in C#. The library is a... More information

Loyc.Collections is a library of sophisticated data structures that implement standard .NET collection interfaces. It includes ALists, VLists, hash tree types (Set<T>, MSet<T>, Map<K,V> and MMap<K,V>), and min/max heaps.

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... More information

CSparse.NET provides numerical methods for sparse LU, Cholesky and QR decomposition of real and complex linear systems.

A library of interfaces, extension methods, and small bits of functionality that are useful in almost any software project, according to the theme "things that should be built into the .NET framework, but aren’t". At least half of Loyc.Essentials is devoted to collections: collection... More information

Provides a library of APIs for working with dense, (DOK) sparse and compressed (CRS, CCS, CVS) matrices.

A set of useful libraries for many kinds of .NET developers, starting with Loyc.Essentials, a library that "fills in the gaps" in the core of the .NET Base Class Library. LoycCore is especially focused on collections: classes, interfaces, adapters, and extension methods. Plus, Loyc.Syntax.dll parses... More information

Numbers stored as the positions of 1's in their binary form, useful for math with power of 2 towers. Main type: SparseInteger

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 the primary implementations.

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 the interface definition assembly.

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 HugeList, a class for efficiently managing very large lists.

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.

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 implementations with Int64 rank indexing.

Class library implementing advanced mathematical algorithms, transforms, and time series manipulations. Implementations favour a good balance of low computational complexity and simplicity as opposed to trying to obtain every last bit of computational performance.