{"id":16351594,"url":"https://github.com/tomeraberbach/sorted-ranges","last_synced_at":"2025-06-18T15:39:46.079Z","repository":{"id":256274110,"uuid":"843181866","full_name":"TomerAberbach/sorted-ranges","owner":"TomerAberbach","description":"⚖️ A lightweight and performant sorted range map and set.","archived":false,"fork":false,"pushed_at":"2024-10-15T03:41:43.000Z","size":288,"stargazers_count":3,"open_issues_count":2,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-06T10:59:19.983Z","etag":null,"topics":["javascript","node-module","nodejs","npm-module","range-map","range-set","sorting-algorithms"],"latest_commit_sha":null,"homepage":"https://npm.im/sorted-ranges","language":"TypeScript","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/TomerAberbach.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":"license","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-08-16T00:38:28.000Z","updated_at":"2024-12-19T01:02:22.000Z","dependencies_parsed_at":"2024-09-10T00:21:00.924Z","dependency_job_id":null,"html_url":"https://github.com/TomerAberbach/sorted-ranges","commit_stats":null,"previous_names":["tomeraberbach/sorted-ranges"],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TomerAberbach%2Fsorted-ranges","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TomerAberbach%2Fsorted-ranges/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TomerAberbach%2Fsorted-ranges/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TomerAberbach%2Fsorted-ranges/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/TomerAberbach","download_url":"https://codeload.github.com/TomerAberbach/sorted-ranges/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":238247985,"owners_count":19440879,"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":["javascript","node-module","nodejs","npm-module","range-map","range-set","sorting-algorithms"],"created_at":"2024-10-11T01:23:18.517Z","updated_at":"2025-02-11T06:31:27.152Z","avatar_url":"https://github.com/TomerAberbach.png","language":"TypeScript","funding_links":["https://github.com/sponsors/TomerAberbach"],"categories":[],"sub_categories":[],"readme":"\u003ch1 align=\"center\"\u003e\n  sorted-ranges\n\u003c/h1\u003e\n\n\u003cdiv align=\"center\"\u003e\n  \u003ca href=\"https://npmjs.org/package/sorted-ranges\"\u003e\n    \u003cimg src=\"https://badgen.net/npm/v/sorted-ranges\" alt=\"version\" /\u003e\n  \u003c/a\u003e\n  \u003ca href=\"https://github.com/TomerAberbach/sorted-ranges/actions\"\u003e\n    \u003cimg src=\"https://github.com/TomerAberbach/sorted-ranges/workflows/CI/badge.svg\" alt=\"CI\" /\u003e\n  \u003c/a\u003e\n  \u003ca href=\"https://unpkg.com/sorted-ranges/dist/index.min.js\"\u003e\n    \u003cimg src=\"https://deno.bundlejs.com/?q=sorted-ranges\u0026badge\" alt=\"gzip size\" /\u003e\n  \u003c/a\u003e\n  \u003ca href=\"https://unpkg.com/sorted-ranges/dist/index.min.js\"\u003e\n    \u003cimg src=\"https://deno.bundlejs.com/?q=sorted-ranges\u0026config={%22compression%22:{%22type%22:%22brotli%22}}\u0026badge\" alt=\"brotli size\" /\u003e\n  \u003c/a\u003e\n  \u003ca href=\"https://github.com/sponsors/TomerAberbach\"\u003e\n    \u003cimg src=\"https://img.shields.io/static/v1?label=Sponsor\u0026message=%E2%9D%A4\u0026logo=GitHub\u0026color=%23fe8e86\" alt=\"Sponsor\"\u003e\n  \u003c/a\u003e\n\u003c/div\u003e\n\n\u003cdiv align=\"center\"\u003e\n  A lightweight and performant sorted range map and set.\n\u003c/div\u003e\n\n## Features\n\n- **Tiny:** only ~960 B minzipped for `SortedRangeMap`, or ~1.09 kB for both\n  `SortedRangeMap` and `SortedRangeSet`\n- **Performant:** uses binary search to limit how many ranges are traversed\n- **Idiomatic:** beautiful API resembling native `Map` and `Set`\n\n## Install\n\n```sh\n$ npm i sorted-ranges\n```\n\n## Usage\n\n\u003c!-- eslint-disable unicorn/no-useless-spread --\u003e\n\n```js\nimport { SortedRangeMap, SortedRangeSet } from 'sorted-ranges'\n\nconst rangeSet = new SortedRangeSet()\n\nrangeSet.add([5, 6])\nconsole.log([...rangeSet]) //=\u003e [ [ 5, 6 ] ]\n\nconsole.log(rangeSet.has(4)) //=\u003e false\nconsole.log(rangeSet.has(5)) //=\u003e true\nconsole.log(rangeSet.hasAll([4, 6])) //=\u003e false\nconsole.log(rangeSet.hasAll([5, 6])) //=\u003e true\nconsole.log(rangeSet.hasAny([4, 6])) //=\u003e true\nconsole.log(rangeSet.hasAny([1, 3])) //=\u003e false\n\nrangeSet.add([1, 4])\nconsole.log([...rangeSet]) //=\u003e [ [ 1, 6 ] ]\nrangeSet.add([3, 7])\nconsole.log([...rangeSet]) //=\u003e [ [ 1, 7 ] ]\nrangeSet.add([-4, -2])\nconsole.log([...rangeSet]) //=\u003e [ [ -4, -2 ], [ 1, 7 ] ]\n\nrangeSet.delete([3, 5])\nconsole.log([...rangeSet]) //=\u003e [ [ -4, -2 ], [ 1, 2 ], [ 6, 7 ] ]\nrangeSet.delete([-5, 0])\nconsole.log([...rangeSet]) //=\u003e [ [ 1, 2 ], [ 6, 7 ] ]\n\nconsole.log(rangeSet.at(0)) //=\u003e [ 1, 2 ]\nconsole.log(rangeSet.at(1)) //=\u003e [ 6, 7 ]\nconsole.log(rangeSet.at(-1)) //=\u003e [ 6, 7 ]\n\nconsole.log(rangeSet.indexOf(0)) //=\u003e -1 (~insertIndex)\nconsole.log(rangeSet.indexOf(1)) //=\u003e 0\nconsole.log(rangeSet.indexOf(2)) //=\u003e 0\nconsole.log(rangeSet.indexOf(6)) //=\u003e 1\nconsole.log(rangeSet.indexOf(7)) //=\u003e 1\nconsole.log(rangeSet.indexOf(8)) //=\u003e -3 (~insertIndex)\n\nconsole.log(rangeSet.get(2)) //=\u003e [ 1, 2 ]\nconsole.log(rangeSet.get(6)) //=\u003e [ 6, 7 ]\n\nconsole.log(rangeSet.size) //=\u003e 2\nconsole.log([...rangeSet.keys()]) //=\u003e [ 1, 2, 6, 7 ]\nconsole.log([...rangeSet.slice([2, 6])]) //=\u003e [ [ 2, 2 ], [ 6, 6 ] ]\n\nrangeSet.clear()\nconsole.log([...rangeSet]) // =\u003e []\n\nconst rangeMap = new SortedRangeMap()\n\nrangeMap.set([5, 6], 42)\nconsole.log([...rangeMap]) //=\u003e [ [ [ 5, 6 ], 42 ] ]\n\nconsole.log(rangeMap.has(4)) //=\u003e false\nconsole.log(rangeMap.has(5)) //=\u003e true\nconsole.log(rangeMap.hasAll([4, 6])) //=\u003e false\nconsole.log(rangeMap.hasAll([5, 6])) //=\u003e true\nconsole.log(rangeMap.hasAny([4, 6])) //=\u003e true\nconsole.log(rangeMap.hasAny([1, 3])) //=\u003e false\n\nrangeMap.set([1, 4], 42)\nconsole.log([...rangeMap]) //=\u003e [ [ [ 1, 6 ], 42 ] ]\nrangeMap.set([3, 7], 3)\nconsole.log([...rangeMap]) //=\u003e [ [ [ 1, 2 ], 42 ], [ [ 3, 7 ], 3 ] ]\nrangeMap.set([-4, -2], 8)\nconsole.log([...rangeMap]) //=\u003e [ [ [ -4, 2 ], 8 ], [ [ 1, 2 ], 42 ], [ [ 3, 7 ], 3 ] ]\n\nrangeMap.delete([3, 5])\nconsole.log([...rangeMap]) //=\u003e [ [ [ -4, 2 ], 8 ], [ [ 1, 2 ], 42 ], [ [ 6, 7 ], 3 ] ]\nrangeMap.delete([-5, 0])\nconsole.log([...rangeMap]) //=\u003e [ [ [ 1, 2 ], 42 ], [ [ 6, 7 ], 3 ] ]\n\nconsole.log(rangeMap.at(0)) //=\u003e [ [ 1, 2 ], 42 ]\nconsole.log(rangeMap.at(1)) //=\u003e [ [ 6, 7 ], 3 ]\nconsole.log(rangeMap.at(-1)) //=\u003e [ [ 6, 7 ], 3 ]\n\nconsole.log(rangeMap.indexOf(0)) //=\u003e -1 (~insertIndex)\nconsole.log(rangeMap.indexOf(1)) //=\u003e 0\nconsole.log(rangeMap.indexOf(2)) //=\u003e 0\nconsole.log(rangeMap.indexOf(6)) //=\u003e 1\nconsole.log(rangeMap.indexOf(7)) //=\u003e 1\nconsole.log(rangeMap.indexOf(8)) //=\u003e -3 (~insertIndex)\n\nconsole.log(rangeMap.get(2)) //=\u003e [ [ 1, 2 ], 42 ]\nconsole.log(rangeMap.get(6)) //=\u003e [ [ 6, 7 ], 3 ]\n\nconsole.log(rangeMap.size) //=\u003e 2\nconsole.log([...rangeMap.ranges()]) //=\u003e [ [ 1, 2 ], [ 6, 7 ] ]\nconsole.log([...rangeMap.keys()]) //=\u003e [ 1, 2, 6, 7 ]\nconsole.log([...rangeMap.values()]) //=\u003e [ 42, 3 ]\nconsole.log([...rangeMap.slice([2, 6])]) //=\u003e [ [ [ 2, 2 ], 42 ], [ [ 6, 6 ], 3 ] ]\n\nrangeMap.clear()\nconsole.log([...rangeMap]) // =\u003e []\n```\n\n## Contributing\n\nStars are always welcome!\n\nFor bugs and feature requests,\n[please create an issue](https://github.com/TomerAberbach/sorted-ranges/issues/new).\n\n## License\n\n[MIT](https://github.com/TomerAberbach/sorted-ranges/blob/main/license) ©\n[Tomer Aberbach](https://github.com/TomerAberbach)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftomeraberbach%2Fsorted-ranges","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftomeraberbach%2Fsorted-ranges","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftomeraberbach%2Fsorted-ranges/lists"}