{"id":24869746,"url":"https://github.com/huseynovvusal/boundit","last_synced_at":"2026-02-14T04:02:16.376Z","repository":{"id":274695628,"uuid":"923798936","full_name":"huseynovvusal/boundit","owner":"huseynovvusal","description":"🔍 JavaScript and TypeScript implementation of lower_bound and upper_bound for efficient data searching.","archived":false,"fork":false,"pushed_at":"2025-01-28T21:11:31.000Z","size":49,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2026-01-15T13:37:20.526Z","etag":null,"topics":["binary-search","bisect","javascript","lower-bound","typescript","upper-bound"],"latest_commit_sha":null,"homepage":"https://www.npmjs.com/package/boundit","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/huseynovvusal.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":"2025-01-28T20:55:59.000Z","updated_at":"2025-10-24T09:21:51.000Z","dependencies_parsed_at":null,"dependency_job_id":"d3adfaaa-63b3-4a5e-9ad0-c78f6894986d","html_url":"https://github.com/huseynovvusal/boundit","commit_stats":null,"previous_names":["huseynovvusal/boundit"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/huseynovvusal/boundit","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huseynovvusal%2Fboundit","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huseynovvusal%2Fboundit/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huseynovvusal%2Fboundit/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huseynovvusal%2Fboundit/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/huseynovvusal","download_url":"https://codeload.github.com/huseynovvusal/boundit/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/huseynovvusal%2Fboundit/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29435390,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-14T03:34:37.767Z","status":"ssl_error","status_checked_at":"2026-02-14T03:34:09.092Z","response_time":53,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":["binary-search","bisect","javascript","lower-bound","typescript","upper-bound"],"created_at":"2025-02-01T03:31:46.829Z","updated_at":"2026-02-14T04:02:16.357Z","avatar_url":"https://github.com/huseynovvusal.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Boundit\n\n[![npm version](https://badge.fury.io/js/boundit.svg)](https://badge.fury.io/js/boundit) [![npm downloads](https://img.shields.io/npm/dm/boundit.svg)](https://www.npmjs.com/package/boundit) [![License](https://img.shields.io/npm/l/boundit.svg)](https://github.com/huseynovvusal/boundit/blob/main/LICENSE)\n\n🔍 JavaScript and TypeScript implementation of `lower_bound` and `upper_bound` for efficient data searching.\n\n## Installation\n\nYou can install the package using npm:\n\n```bash\nnpm install boundit\n```\n\n## Usage\n\n### lowerBound\n\nReturns the index of the first element in the array which is greater than or equal to the target.\n\n```typescript\nimport { lowerBound } from \"boundit\"\n\nconst array = [1, 2, 4, 4, 5, 6]\nconst target = 4\nconst index = lowerBound(array, target)\n\nconsole.log(index) // Output: 2\n```\n\n### upperBound\n\nReturns the index of the first element in the array which is greater than the target, or the length of the array if no such element is found.\n\n```typescript\nimport { upperBound } from \"boundit\"\n\nconst array = [1, 2, 4, 4, 5, 6]\nconst target = 4\nconst index = upperBound(array, target)\n\nconsole.log(index) // Output: 4\n```\n\n### binarySearch\n\nBinary search is a fast search algorithm with run-time complexity of O(log n). This search algorithm works on the principle of divide and conquer. For this algorithm to work properly, the data collection should be in the sorted form.\n\n```typescript\nimport { binarySearch } from \"boundit\"\n\nconst array = [1, 2, 4, 4, 5, 6]\nconst target = 5\nconst index = binarySearch(array, target)\n\nconsole.log(index) // Output: 4\n```\n\n## License\n\nThis project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.\n\n## Contributing\n\nContributions are welcome! Please open an issue or submit a pull request for any changes.\n\n## Author\n\nVusal Huseynov\n\n## Links\n\n- [Repository](https://github.com/huseynovvusal/boundit)\n- [Issues](https://github.com/huseynovvusal/boundit/issues)\n- [Readme](https://github.com/huseynovvusal/boundit#readme)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhuseynovvusal%2Fboundit","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhuseynovvusal%2Fboundit","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhuseynovvusal%2Fboundit/lists"}