MoreComplexDataStructures 1.1.0

.NET Framework 4.5 This package targets .NET Framework 4.5. The package is compatible with this framework or higher.
There is a newer version of this package available.
See the version list below for details. 
dotnet add package MoreComplexDataStructures --version 1.1.0                

                    
                

            
NuGet\Install-Package MoreComplexDataStructures -Version 1.1.0
This command is intended to be used within the Package Manager Console in Visual Studio, as it uses the NuGet module's version of Install-Package. 
<PackageReference Include="MoreComplexDataStructures" Version="1.1.0" />
For projects that support PackageReference, copy this XML node into the project file to reference the package. 
paket add MoreComplexDataStructures --version 1.1.0                

                    
                

            
#r "nuget: MoreComplexDataStructures, 1.1.0"
#r directive can be used in F# Interactive and Polyglot Notebooks. Copy this into the interactive tool or source code of the script to reference the package. 
// Install MoreComplexDataStructures as a Cake Addin
#addin nuget:?package=MoreComplexDataStructures&version=1.1.0

// Install MoreComplexDataStructures as a Cake Tool
#tool nuget:?package=MoreComplexDataStructures&version=1.1.0

MoreComplexDataStructures is a class library containing a collection of data structures more complex than those found in the standard .NET framework.

The project currently contains the following data structures...

WeightBalancedTree - An implementation of a weight-balanced tree.  Although self-balancing is not yet implemented, the tree maintains counts of the nodes in each node's subtrees.  This allows methods GetCountGreaterThan(T item) and GetCountLessThan(T item) (which return the number of items greater than and less than a specified item) to return with order O(log(n)) time complexity.  The class also provides methods to perform pre, post, and in-order depth-first search, and breadth-first search.

MinHeap / MaxHeap - Tree-based implementations of a min and max heap.  Insert() and ExtractMin() / ExtractMax() methods return with order O(log(n)) time complexity.  Also provides methods to traverse the nodes of the underlying trees via a breadth-first search.

LongIntegerStatusStorer - Stores a true/false status for a complete set of long (Int64) integers.  Uses an underlying tree holding ranges of integers to store the statuses.  Also provides a method TraverseTree() to traverse the ranges stored in the tree via a breadth-first search.

ListRandomizer - Randomizes a List or Array using the Fisher/Yates/Knuth algorithm (O(n) time complexity).

Product Compatible and additional computed target framework versions.
.NET Framework net45 is compatible.  net451 was computed.  net452 was computed.  net46 was computed.  net461 was computed.  net462 was computed.  net463 was computed.  net47 was computed.  net471 was computed.  net472 was computed.  net48 was computed.  net481 was computed. 
Compatible target framework(s)
Included target framework(s) (in package)
Learn more about Target Frameworks and .NET Standard.

This package has no dependencies.

NuGet packages

This package is not used by any NuGet packages.

GitHub repositories (1)

Showing the top 1 popular GitHub repositories that depend on MoreComplexDataStructures:

Repository Stars
BG-IT-Edu/School-Programming
Хранилище за свободно учебно съдържание по програмиране, информатика и ИТ за българските училища в помощ на ИТ учителите
Version Downloads Last updated
1.9.2 147 7/14/2024
1.9.1 5,830 3/29/2020
1.9.0 1,071 11/6/2019
1.8.0 1,066 9/16/2019
1.7.0 1,008 9/7/2019
1.6.0 1,026 7/27/2019
1.5.0 1,097 5/18/2019
1.4.0 1,635 2/10/2018
1.3.0 1,376 10/16/2017
1.2.0 1,438 8/26/2017
1.1.0 1,430 6/23/2017