Sammlung (/'zamlʊŋ/) is german for collection and is pronounced some-loong.

Is is a library for C# containing a plethora of collection types which are not provided out of the box by the .NET standard libraries. The NuGet package is provided for both .NET Framework 3.5 and newer and .NET Core .NET standard 2.1 and newer.

Rationale

Why is there another collection library? I am a software engineer in my everyday job and I like to use data structures which obey the rules of proper software engineering. One of this rules is a guaranteed computational complexity bound and another is a well-implemented, well-tested and performant realization of the data structure. Though creating a new library for collections I am not interested in inventing the wheel over and over again. If anything I am interested in merging good collections together and create new ones which are more performant in other field of application.

Vision

Sammlung has the vision to be the go-to NuGet package, when it comes to collections beyond the standard collections.

We aim to deliver:

• high-end default collection implementations
• multiple options for a container type, if reasonable
• container types which operate memory-aware and perform on the file system, in this case we prefer cache-oblivious algorithms.

For every collection class there should be a benchmark, testing the performance of the particular container. When possible we deliver theoretical bounds for the particular operations of a collection.

We also use extensive tests to ensure the quality of the library.

Contribution

We encourage everyone to contribute to this project. Open-source lives from participation! If you're not a programmer, you can help translating documentations. If you're a graphic artist you may help us with illustrations. If you're not familiar with C#, do code reviews with us. If you're a theoretical computer scientists, help us calculating bounds. If you encounter a bug, a vulnerability, a code quality issue, report it! Every input is welcome.

If you'd like to donate to us. Point out a platform where someone can donate to us. I currently have no clue about this topic.

Collection List

Ticked means available in the newest package.

• Dictionaries
  • Bidirectional Dictionary
    • Non-Thread-Safe (Sammlung.Dictionaries.BidiDictionary)
    • Thread-Safe, Blocking (Sammlung.Dictionaries.Concurrent.BlockingBidiDictionary)
    • Thread-Safe, Lock-Free
  • Multi-Key Dictionary
    • Non-Thread-Safe (Sammlung.Dictionaries.MultiKeyDictionary)
    • Thread-Safe, Blocking (Sammlung.Dictionaries.Concurrent.BlockingMultiKeyDictionary)
    • Thread-Safe, Lock-Free
• Heaps / Priority-Queues
  • Binary Heap
    • Non-Thread-Safe (Sammlung.Heaps.BinaryHeap)
    • Thread-Safe, Blocking
    • Thread-Safe, Lock-Free
  • Pairing Heap
    • Non-Thread-Safe
    • Thread-Safe, Blocking
    • Thread-Safe, Lock-Free
  • Fibonacci Heap
    • Non-Thread-Safe
    • Thread-Safe, Blocking
    • Thread-Safe, Lock-Free
  • Brodal Queue
    • Non-Thread-Safe
    • Thread-Safe, Blocking
    • Thread-Safe, Lock-Free
• Priority-Stacks
• Queues
  • All-Types: Thread-Safe, Blocking (Sammlung.Queues.Concurrent.BlockingDeque)
  • Continuous Queue / Deque
    • Non-Thread-Safe (Sammlung.Queues.ArrayDeque)
  • Pointer Queue / Deque
    • Non-Thread-Safe (Sammlung.Queues.LinkedDeque)
    • Thread-Safe, Lock-Free (Sammlung.Queues.Concurrent.LockFreeLinkedDeque)
  • File-System Based Queue / Deque
    • Non-Thread-Safe
    • Thread-Safe, with transactions
• Graphs
  • Undirected Graph
  • Directed Graph
  • Multi Graph
  • Algorithms on Graphs (poss. Separate NuGet package)
    • Dijkstra-Algorithm
    • Kruskal-Algorithm
    • Minimum Spanning tree (MST)
• Search Trees
  • Binary Search Tree
  • ABSearchTree :: (a,b)-tree
  • RedBlackSearchTree :: red-black tree
• Circular Buffers
  • Static Circular Buffer
    • Non-Thread-Safe (Sammlung.CircularBuffers.StaticCircularBuffer)
    • Thread-Safe, Blocking
    • Thread-Safe, Lock-Free
  • Dynamic Circular Buffer
    • Non-Thread-Safe (Sammlung.CircularBuffers.DynamicCircularBuffer)
    • Thread-Safe, Blocking
    • Thread-Safe, Lock-Free
  • BipBuffers
    • Non-Thread-Safe
    • Thread-Safe, Blocking
    • Thread-Safe, Lock-Free

Literature

• Algorithms and Data Structures - Kurt Mehlhorn, Peter Sanders
• CAS-Based Lock-Free Algorithm for Shared Deques - Maged M. Michael

Documentation

Our documentation can be found here.

Contributors

• Ralf Schleicher