{"id":15602630,"url":"https://github.com/luanpotter/endless-bitset","last_synced_at":"2025-03-31T01:48:43.164Z","repository":{"id":57225245,"uuid":"100200292","full_name":"luanpotter/endless-bitset","owner":"luanpotter","description":"Endless and fast BitSet implementation","archived":false,"fork":false,"pushed_at":"2017-08-14T00:53:44.000Z","size":12,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-11T11:06:46.601Z","etag":null,"topics":["bigint","bitset","javascript"],"latest_commit_sha":null,"homepage":null,"language":"JavaScript","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/luanpotter.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}},"created_at":"2017-08-13T19:38:31.000Z","updated_at":"2017-08-13T21:42:18.000Z","dependencies_parsed_at":"2022-08-24T11:00:14.185Z","dependency_job_id":null,"html_url":"https://github.com/luanpotter/endless-bitset","commit_stats":null,"previous_names":[],"tags_count":2,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luanpotter%2Fendless-bitset","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luanpotter%2Fendless-bitset/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luanpotter%2Fendless-bitset/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luanpotter%2Fendless-bitset/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/luanpotter","download_url":"https://codeload.github.com/luanpotter/endless-bitset/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246403896,"owners_count":20771526,"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":["bigint","bitset","javascript"],"created_at":"2024-10-03T02:49:06.183Z","updated_at":"2025-03-31T01:48:43.110Z","avatar_url":"https://github.com/luanpotter.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# endless-bitset\n\n[![Build Status](https://travis-ci.org/luanpotter/endless-bitset.svg?branch=master)](https://travis-ci.org/luanpotter/endless-bitset)\n\nAn endless and fast bitset with some nice methods.  \n\nThis is a wrapper around mattkrick's [fast-bitset](https://github.com/mattkrick/fast-bitset) that allows for unlimited sizes.  \n\nIt uses [big-integer](https://github.com/peterolson/BigInteger.js) to access the higher indexes (but should work with plain old JS numbers for smaller indexes).  \n\n## Installation\n\nWith yarn:\n\n`yarn add endless-bitset`\n\nOr with npm:\n\n`npm install endless-bitset --save`\n\n## Features and Limitations\n\nIt's supposed to re-implement all methods from fast-bitset (they are a good selection), but I did just the ones I needed so far.  \nTechnically, I guess it's limited by your RAM, your spare processing time and your call stack. But should be sufficient for most purposes.  \n\n## API\n\nCurrently implemented are these methods from the original API:\n\n* BitSet\n  * new BitSet(nBitsOrKey) : only for integer or bitInt parameters\n  * .get(idx) ⇒ \u003ccode\u003eboolean\u003c/code\u003e\n  * .set(idx) ⇒ \u003ccode\u003eboolean\u003c/code\u003e\n  * .unset(idx) ⇒ \u003ccode\u003eboolean\u003c/code\u003e\n  * .setRange(from, to) ⇒ \u003ccode\u003eboolean\u003c/code\u003e\n  * .nextUnsetBit(idx) ⇒ \u003ccode\u003enumber\u003c/code\u003e\n\nI also added this property:\n\n* BitSet\n  * length ⇒ \u003ccode\u003einteger\u003c/code\u003e : returns the max length, exactly as specified in the constructor\n\nFor the complete documentation, visit [fast-bitset](https://github.com/mattkrick/fast-bitset)'s readme.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fluanpotter%2Fendless-bitset","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fluanpotter%2Fendless-bitset","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fluanpotter%2Fendless-bitset/lists"}