# RangedHeap
Welcome to the RangedHeap documentation! This documentation provides an overview of the RangedHeap data structure, its methods, and examples of its usage.
For more details, please refer to the [documentation](https://giuseppeambrosio97.github.io/ranged-heap/).
## What is RangedHeap?
RangedHeap is a data structure designed to manage a collection of choices associated with integer values within a specified range [0, k]. It supports efficient operations for adding, deleting, and retrieving choices based on their integer values.
## Features
- **Efficient Choice Management**: Manage choices efficiently within a specified integer range.
- **Dynamic Updates**: Support dynamic updates to the heap as choices change.
- **Optimized Retrieval**: Quickly retrieve the best choice based on specified criteria (minimum or maximum).
## How to Use
The RangedHeap is particularly useful for implementing algorithms that require optimal selection from a set of integer-ranged choices, such as greedy algorithms.
### Example Usage
```python
import ranged_heap as rh
choices = [(1, 4), (2, 3), (3, 5), (0, 6), (5, 7), (8, 9)]
k = max(end for _, end in choices)
ranged_heap = rh.RangedHeap(k, choices)
```
Raw data
{
"_id": null,
"home_page": "https://github.com/giuseppeambrosio97/ranged-heap",
"name": "ranged_heap",
"maintainer": "Giuseppe Ambrosio",
"docs_url": null,
"requires_python": "<4.0,>=3.9",
"maintainer_email": "giuambro97@gmail.com",
"keywords": "datastructure, heap, greedy-algorithm",
"author": "Giuseppe Ambrosio",
"author_email": "giuambro97@gmail.com",
"download_url": "https://files.pythonhosted.org/packages/16/5f/0503a5ea8b46eb9fddd59eb5d5a089b0cf87de0dc25272fa9a4b6f987b71/ranged_heap-0.1.0.tar.gz",
"platform": null,
"description": "# RangedHeap\n\nWelcome to the RangedHeap documentation! This documentation provides an overview of the RangedHeap data structure, its methods, and examples of its usage.\n\nFor more details, please refer to the [documentation](https://giuseppeambrosio97.github.io/ranged-heap/).\n\n## What is RangedHeap?\n\nRangedHeap is a data structure designed to manage a collection of choices associated with integer values within a specified range [0, k]. It supports efficient operations for adding, deleting, and retrieving choices based on their integer values.\n\n## Features\n\n- **Efficient Choice Management**: Manage choices efficiently within a specified integer range.\n- **Dynamic Updates**: Support dynamic updates to the heap as choices change.\n- **Optimized Retrieval**: Quickly retrieve the best choice based on specified criteria (minimum or maximum).\n\n## How to Use\n\nThe RangedHeap is particularly useful for implementing algorithms that require optimal selection from a set of integer-ranged choices, such as greedy algorithms.\n\n### Example Usage\n\n```python\nimport ranged_heap as rh\n\nchoices = [(1, 4), (2, 3), (3, 5), (0, 6), (5, 7), (8, 9)]\nk = max(end for _, end in choices)\nranged_heap = rh.RangedHeap(k, choices)\n```\n",
"bugtrack_url": null,
"license": "Apache-2.0",
"summary": "RangedHeap data structure",
"version": "0.1.0",
"project_urls": {
"Homepage": "https://github.com/giuseppeambrosio97/ranged-heap",
"Repository": "https://github.com/giuseppeambrosio97/ranged-heap"
},
"split_keywords": [
"datastructure",
" heap",
" greedy-algorithm"
],
"urls": [
{
"comment_text": "",
"digests": {
"blake2b_256": "cb91215b00b6c4e5c67726e7854574290ddaebfecccf86c28fd17ba56c19e9f2",
"md5": "e63d86eb34c1df81e0a5fa02353599e8",
"sha256": "2ac4dca08ca3e152cc0e6a0d71ca6b36b7f9265e275890995501b6148b174fd5"
},
"downloads": -1,
"filename": "ranged_heap-0.1.0-py3-none-any.whl",
"has_sig": false,
"md5_digest": "e63d86eb34c1df81e0a5fa02353599e8",
"packagetype": "bdist_wheel",
"python_version": "py3",
"requires_python": "<4.0,>=3.9",
"size": 5285,
"upload_time": "2024-07-14T14:48:50",
"upload_time_iso_8601": "2024-07-14T14:48:50.490730Z",
"url": "https://files.pythonhosted.org/packages/cb/91/215b00b6c4e5c67726e7854574290ddaebfecccf86c28fd17ba56c19e9f2/ranged_heap-0.1.0-py3-none-any.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "165f0503a5ea8b46eb9fddd59eb5d5a089b0cf87de0dc25272fa9a4b6f987b71",
"md5": "a2dc6ca086a2245f03d1d08bbc82404f",
"sha256": "8fa34b34e3b38f56c3fb4f9ffbc3c98d95095d53e41e1cfc1c1710d9465ac9ad"
},
"downloads": -1,
"filename": "ranged_heap-0.1.0.tar.gz",
"has_sig": false,
"md5_digest": "a2dc6ca086a2245f03d1d08bbc82404f",
"packagetype": "sdist",
"python_version": "source",
"requires_python": "<4.0,>=3.9",
"size": 4198,
"upload_time": "2024-07-14T14:48:51",
"upload_time_iso_8601": "2024-07-14T14:48:51.862789Z",
"url": "https://files.pythonhosted.org/packages/16/5f/0503a5ea8b46eb9fddd59eb5d5a089b0cf87de0dc25272fa9a4b6f987b71/ranged_heap-0.1.0.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2024-07-14 14:48:51",
"github": true,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"github_user": "giuseppeambrosio97",
"github_project": "ranged-heap",
"travis_ci": false,
"coveralls": false,
"github_actions": true,
"lcname": "ranged_heap"
}
JSON
