{"id":15047920,"url":"https://github.com/ivanpinezhaninov/intervaltree","last_synced_at":"2025-08-02T09:16:07.741Z","repository":{"id":200661561,"uuid":"104053594","full_name":"IvanPinezhaninov/IntervalTree","owner":"IvanPinezhaninov","description":"A red-black self-balancing interval tree","archived":false,"fork":false,"pushed_at":"2020-08-06T06:41:17.000Z","size":88,"stargazers_count":29,"open_issues_count":1,"forks_count":7,"subscribers_count":5,"default_branch":"master","last_synced_at":"2025-04-10T01:08:11.428Z","etag":null,"topics":["balanced-tree","balanced-trees","cplusplus","cplusplus-11","cpp","cpp11","header-only","interval","interval-tree","intervals","intervaltree","red-black-tree","red-black-trees","redblacktree","redblacktrees","segment","segment-tree","segments","segmenttree","self-balancing-trees"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/IvanPinezhaninov.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":".github/FUNDING.yml","license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null},"funding":{"patreon":"pinezhaninov"}},"created_at":"2017-09-19T09:16:38.000Z","updated_at":"2025-03-21T12:56:46.000Z","dependencies_parsed_at":null,"dependency_job_id":"147a9476-6357-493e-bb85-3fa6bb17a1ad","html_url":"https://github.com/IvanPinezhaninov/IntervalTree","commit_stats":null,"previous_names":["ivanpinezhaninov/intervaltree"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IvanPinezhaninov%2FIntervalTree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IvanPinezhaninov%2FIntervalTree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IvanPinezhaninov%2FIntervalTree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IvanPinezhaninov%2FIntervalTree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/IvanPinezhaninov","download_url":"https://codeload.github.com/IvanPinezhaninov/IntervalTree/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248137887,"owners_count":21053775,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["balanced-tree","balanced-trees","cplusplus","cplusplus-11","cpp","cpp11","header-only","interval","interval-tree","intervals","intervaltree","red-black-tree","red-black-trees","redblacktree","redblacktrees","segment","segment-tree","segments","segmenttree","self-balancing-trees"],"created_at":"2024-09-24T21:06:06.318Z","updated_at":"2025-04-10T01:08:19.551Z","avatar_url":"https://github.com/IvanPinezhaninov.png","language":"C++","readme":"# IntervalTree\n\n[![Linux Build Status](https://travis-ci.org/IvanPinezhaninov/IntervalTree.svg?branch=master)](https://travis-ci.org/IvanPinezhaninov/IntervalTree)\n[![Windows Build Status](https://ci.appveyor.com/api/projects/status/github/IvanPinezhaninov/intervaltree?svg=true)](https://ci.appveyor.com/project/IvanPinezhaninov/intervaltree)\n[![MIT License](https://img.shields.io/badge/license-mit-blue.svg?style=flat)](http://opensource.org/licenses/MIT)\n\n## Overview\n\nA red-black self-balancing interval tree C++11 header-only implementation\n\n## Usage\n\n```c++\n#include \u003ciostream\u003e\n#include \"intervaltree.hpp\"\n\nusing namespace Intervals;\n\nint main()\n{\n    // Create an interval tree\n    IntervalTree\u003cint\u003e tree;\n\n    // Insert intervals to the tree\n    tree.insert({20, 30});\n    tree.insert({40, 60});\n    tree.insert({70, 90});\n    tree.insert({60, 70});\n    tree.insert({40, 90});\n    tree.insert({80, 90});\n\n    // Wanted interval and point\n    Interval\u003cint\u003e wantedInterval(50, 80);\n    auto wantedPoint = 50;\n\n    // Find intervals\n    const auto \u0026overlappingIntervals = tree.findOverlappingIntervals(wantedInterval);\n    const auto \u0026innerIntervals = tree.findInnerIntervals(wantedInterval);\n    const auto \u0026outerIntervals = tree.findOuterIntervals(wantedInterval);\n    const auto \u0026intervalsContainPoint = tree.findIntervalsContainPoint(wantedPoint);\n\n    // Print all intervals\n    std::cout \u003c\u003c \"All intervals:\" \u003c\u003c std::endl;\n    for (const auto \u0026interval : tree.intervals()) {\n        std::cout \u003c\u003c interval \u003c\u003c std::endl;\n    }\n    std::cout \u003c\u003c std::endl;\n\n    // Print overlapping intervals\n    std::cout \u003c\u003c \"Overlapping intervals for \" \u003c\u003c wantedInterval \u003c\u003c \":\" \u003c\u003c std::endl;\n    for (const auto \u0026interval : overlappingIntervals) {\n        std::cout \u003c\u003c interval \u003c\u003c std::endl;\n    }\n    std::cout \u003c\u003c std::endl;\n\n    // Print inner intervals\n    std::cout \u003c\u003c \"Inner intervals for \" \u003c\u003c wantedInterval \u003c\u003c \":\" \u003c\u003c std::endl;\n    for (const auto \u0026interval : innerIntervals) {\n        std::cout \u003c\u003c interval \u003c\u003c std::endl;\n    }\n    std::cout \u003c\u003c std::endl;\n\n    // Print outer intervals\n    std::cout \u003c\u003c \"Outer intervals for \" \u003c\u003c wantedInterval \u003c\u003c \":\" \u003c\u003c std::endl;\n    for (const auto \u0026interval : outerIntervals) {\n        std::cout \u003c\u003c interval \u003c\u003c std::endl;\n    }\n    std::cout \u003c\u003c std::endl;\n\n    // Print intervals contain the point\n    std::cout \u003c\u003c \"Intervals contain the point with the value \"\n              \u003c\u003c wantedPoint \u003c\u003c \":\" \u003c\u003c std::endl;\n    for (const auto \u0026interval : intervalsContainPoint) {\n        std::cout \u003c\u003c interval \u003c\u003c std::endl;\n    }\n\n    return 0;\n}\n```\n\n## Build and test\n\n```bash\ngit clone https://github.com/IvanPinezhaninov/IntervalTree.git\ncd IntervalTree\nmkdir build\ncd build\ncmake .. -DCMAKE_BUILD_TYPE=Release -DBUILD_TESTS=YES\nmake -j4\ncd ./test\n./Test --rng-seed time\n```\n\n## License\nThis code is distributed under the [MIT License](LICENSE)\n\n## Author\n[Ivan Pinezhaninov](mailto:ivan.pinezhaninov@gmail.com)\n","funding_links":["https://patreon.com/pinezhaninov"],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fivanpinezhaninov%2Fintervaltree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fivanpinezhaninov%2Fintervaltree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fivanpinezhaninov%2Fintervaltree/lists"}