.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.
A .NET library intended to add core functionality and make advanced topics as clean and simple as possible: data structures, algorithms, mathematics, metadata, extensions, console, and more. :)
This package provides multiple collection such as improvided (KdTree with selection, Fibonacci heaps, ...)
implementation and commonly used extension for .Net types.based methods and algorithms to handle math computing taks.
For more details how to use MARS, please use the...
More information
Sequences is a port of Scala's Stream[+A] to C#.
A Sequence<T> is an immutable lazy list whose elements are only evaluated when they are needed. A sequence is composed by a head (the first element) and a lazily-evaluated tail (the remaining elements).
The fact that the tail is lazily-evaluated,...
More information
