9 packages returned for Tags:"BTree"

==CSharpTest.Net.Collections== * BPlusTree - a fairly full featured IDictionary backed by a B+Tree on disk. * BTreeDictionary - a fully in-memory IDictionary implemented by a B+Tree. * BTreeList - an... More information

Data structure library

==CSharpTest.Net.BPlusTree== This library is a fairly full featured IDictionary<TKey, TValue> implementation backed by a B+Tree on disk. The instance is thread-safe and supports a form of MVCC (Multi... More information

This package provides an in-memory B-Tree implementation for C#, useful as an ordered, mutable data structure.

High-performance, memory-efficient collections for .NET. Right now, the package has a fast, compact B-tree based on Google's C++ B-tree library. Other collections are coming soon!

Generic B-tree written in C#, which can be replaced with NoSQL database stored in the memory. The B-tree is a generalization of a binary search tree in that a node can have more than two children (Comer 1979,... More information

KaosCollections is a .NET library that provides generic collection classes for storing elements that are both sorted and indexed. Two of these classes emulate Microsoft's SortedDictionary and SortedSet while... More information

A library for all the data structures in C#. Every class is generic and reusable.

Eugene is a data structure persistence library for .NET, providing access to traditional in-memory data structures such as arrays, linked lists, array lists, hash tables, binary trees, trie trees, etc., in a... More information