PommaLabs.Hippie 3.2.0

Hippie

Fully managed library providing five types of heap.

Library is feature complete and no further development is planned on this project, except for routine maintenance and bug fixes.

Currently implemented heaps are:

• Array
• Binary
• Binomial
• Fibonacci
• Pairing

Table of Contents

• Install
• Usage
• Maintainers
• Contributing
  • Editing
  • Restoring dependencies
  • Running tests
• License

Install

NuGet package PommaLabs.Hippie is available for download:

dotnet add package PommaLabs.Hippie

Usage

For example, using this library you can write a very simple heap sort in this way:

T[] HeapSort<T>(IEnumerable<T> elems) where T : IComparable<T>
{
    var heap = HeapFactory.NewBinaryHeap<T>();
    foreach (var elem in elems) {
        heap.Add(elem);
    }
    var orderedElems = new T[heap.Count];
    for (var i = 0; heap.Count > 0; ++i) {
        orderedElems[i] = heap.RemoveMin();
    }
    return orderedElems;
}

Please check project examples to find out what you can do with this library.

Maintainers

@pomma89.

Contributing

MRs accepted.

Small note: If editing the README, please conform to the standard-readme specification.

Editing

Visual Studio Code, with Remote Containers extension, is the recommended way to work on this project.

A development container has been configured with all required tools.

Visual Studio Community is also supported and an updated solution file, hippie.sln, has been provided.

Restoring dependencies

When opening the development container, dependencies should be automatically restored.

Anyway, dependencies can be restored with following command:

dotnet restore

Running tests

Tests can be run with following command:

dotnet test

Tests can also be run with following command, which collects coverage information:

./build.sh --target run-tests

License

MIT © 2012-2023 PommaLabs Team and Contributors