Introduction

RangedHeap is a data structure that maintains a collection of choices associated with integer values within a specified range. It supports efficient addition, deletion, and retrieval of the best choice (either minimum or maximum).

This documentation will guide you through the installation, basic usage, and advanced features of the ranged_heap library.