{"id":41249927,"url":"https://github.com/dstructs/anagram-hash","last_synced_at":"2026-01-23T01:36:26.138Z","repository":{"id":29667159,"uuid":"33209342","full_name":"dstructs/anagram-hash","owner":"dstructs","description":"Anagram hash table.","archived":false,"fork":false,"pushed_at":"2015-04-17T22:13:47.000Z","size":256,"stargazers_count":4,"open_issues_count":0,"forks_count":0,"subscribers_count":4,"default_branch":"master","last_synced_at":"2025-09-17T07:46:31.185Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","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/dstructs.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":"2015-03-31T20:54:04.000Z","updated_at":"2017-01-04T19:10:23.000Z","dependencies_parsed_at":"2022-09-18T00:42:12.996Z","dependency_job_id":null,"html_url":"https://github.com/dstructs/anagram-hash","commit_stats":null,"previous_names":["compute-io/anagram-hash"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/dstructs/anagram-hash","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dstructs%2Fanagram-hash","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dstructs%2Fanagram-hash/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dstructs%2Fanagram-hash/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dstructs%2Fanagram-hash/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dstructs","download_url":"https://codeload.github.com/dstructs/anagram-hash/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dstructs%2Fanagram-hash/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28677710,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-23T01:00:35.747Z","status":"ssl_error","status_checked_at":"2026-01-23T01:00:19.529Z","response_time":144,"last_error":"SSL_read: 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":[],"created_at":"2026-01-23T01:36:25.465Z","updated_at":"2026-01-23T01:36:26.133Z","avatar_url":"https://github.com/dstructs.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"Anagram Hash\n===\n[![NPM version][npm-image]][npm-url] [![Build Status][travis-image]][travis-url] [![Coverage Status][coveralls-image]][coveralls-url] [![Dependencies][dependencies-image]][dependencies-url]\n\n\u003e [Anagram](http://en.wikipedia.org/wiki/Anagram) hash table.\n\n\n## Installation\n\n``` bash\n$ npm install compute-anagram-hash\n```\n\nFor use in the browser, use [browserify](https://github.com/substack/node-browserify).\n\n\n## Usage\n\n``` javascript\nvar createHash = require( 'compute-anagram-hash' );\n```\n\n#### createHash( [arr] )\n\nCreates an [anagram](http://en.wikipedia.org/wiki/Anagram) hash table.\n\n``` javascript\nvar hash = createHash();\n```\n\nTo initialize the hash table, provide a `string array`.\n\n``` javascript\nvar arr = [\n\t'beep',\n\t'boop',\n\t'bop',\n\t'bap',\n\t'foo',\n\t'bar',\n\t'cat',\n\t'bat',\n\t'moot',\n\t'woot',\n\t'moto',\n\t'tab',\n\t'pad',\n\t'Shakespeare is awesome!'\n];\n\nvar hash = createHash( arr );\n```\n\nThe hash table has the following methods...\n\n\n\n#### hash.push( str[, str,...,str] )\n\nAdd `strings` to the [anagram](http://en.wikipedia.org/wiki/Anagram) hash table.\n\n``` javascript\nhash.push( 'dog', 'rad', 'super' );\n```\n\n\n#### hash.get( [str[, key]] )\n\nReturns a list of [anagrams](http://en.wikipedia.org/wiki/Anagram). If provided an input `string`, the method returns a list of corresponding anagrams from the hash table; otherwise, the method returns all anagram lists. If no anagrams exist, the method returns `null`.\n\n``` javascript\n// Get all anagrams:\nvar lists = hash.get();\n// returns [['bat','tab'],['moot','moto']]\n\n// Get anagrams corresponding to a particular string:\nvar list = hash.get( 'moot' );\n// returns ['moto']\n\nlist = hash.get( 'beep' );\n// returns null\n```\n\nIf the input `string` is a hash __key__, set the `key` flag to `true`. When provided a hash __key__, the method returns all anagrams associated with a particular __key__ (possibly including the __key__ itself).\n\n``` javascript\nvar list = hash.get( 'abt', true );\n// returns ['bat','tab']\n\nlist = hash.get( 'beep', true );\n// returns ['beep']\n```\n\n__Note__: when returning all anagram lists, the list order is __not__ guaranteed. \n\n\n\n#### hash.getKey( str )\n\nHashing function. Converts an input `string` to an [alphagram](http://en.wikipedia.org/wiki/Alphagram).\n\n``` javascript\nvar key = hash.getKey( 'tab' );\n// returns 'abt'\n\nvar list = hash.get( key, true );\n// returns ['bat','tab']\n```\n\n__Note__: the returned __key__ only contains lowercase `alphanumeric` characters.\n\n\n#### hash.keys( [opts] )\n\nReturns a list of hash __keys__.\n\n``` javascript\nvar keys = hash.keys();\n// returns ['abp','abr','abt','act',...]\n```\n\nThe method accepts the following `options`:\n\n*\t__min__: minimum number of anagrams.\n* \t__max__: maximum number of anagrams.\n\nTo return `keys` having at least a `min` number of anagrams, set the `min` option.\n\n``` javascript\nvar keys = hash.keys({ 'min': 2 });\n// returns ['abt','moot']\n```\n\nTo return `keys` having at most a `max` number of anagrams, set the `max` option.\n\n``` javascript\nvar keys = hash.keys({ 'max': 1 });\n// returns ['abp','abr','act','adp',...]\n```\n\n\n\n\n#### hash.merge( hash1[, hash2,...,hashN] )\n\nMerges [anagram](http://en.wikipedia.org/wiki/Anagram) hash tables into the current anagram hash instance.\n\n``` javascript\nvar mhash1, mhash2;\n\nmhash1 = createHash( ['yes','no'] );\nmhash2 = createHash( ['beep','bepe'] );\n\nhash.merge( mhash1, mhash2 );\n\nvar list = hash.get( 'beep', true );\n// returns ['beep','bepe']\n```\n\n\n#### hash.copy( [keys] )\n\nCopies an [anagram](http://en.wikipedia.org/wiki/Anagram) hash table to a new hash table instance.\n\n``` javascript\nvar copy = hash.copy();\n\nvar list = copy.get( 'abt', true );\n// returns ['bat','tab']\n```\n\nTo only copy specific __keys__ to a new hash table, provide a __keys__ `array`.\n\n``` javascript\nvar copy = hash.copy( ['beep'] );\n\nvar keys = copy.keys();\n// returns ['beep']\n```\n\n\n\n\n## Examples\n\n``` javascript\nvar createHash = require( 'compute-anagram-hash' );\n\n// Load a string array containing tokenized words:\nvar words = require( './words.json' );\n\n// Create a new hash:\nvar hash = createHash( words );\n\n// Get all anagram lists:\nvar lists = hash.get();\n\n// Get a single anagram list:\nvar list = hash.get( 'rome' );\n```\n\nTo run the example code from the top-level application directory,\n\n``` bash\n$ node ./examples/index.js\n```\n\n\n## Tests\n\n### Unit\n\nUnit tests use the [Mocha](http://mochajs.org/) test framework with [Chai](http://chaijs.com) assertions. To run the tests, execute the following command in the top-level application directory:\n\n``` bash\n$ make test\n```\n\nAll new feature development should have corresponding unit tests to validate correct functionality.\n\n\n### Test Coverage\n\nThis repository uses [Istanbul](https://github.com/gotwarlost/istanbul) as its code coverage tool. To generate a test coverage report, execute the following command in the top-level application directory:\n\n``` bash\n$ make test-cov\n```\n\nIstanbul creates a `./reports/coverage` directory. To access an HTML version of the report,\n\n``` bash\n$ make view-cov\n```\n\n\n---\n## License\n\n[MIT license](http://opensource.org/licenses/MIT). \n\n\n## Copyright\n\nCopyright \u0026copy; 2015. Athan Reines.\n\n\n[npm-image]: http://img.shields.io/npm/v/compute-anagram-hash.svg\n[npm-url]: https://npmjs.org/package/compute-anagram-hash\n\n[travis-image]: http://img.shields.io/travis/compute-io/anagram-hash/master.svg\n[travis-url]: https://travis-ci.org/compute-io/anagram-hash\n\n[coveralls-image]: https://img.shields.io/coveralls/compute-io/anagram-hash/master.svg\n[coveralls-url]: https://coveralls.io/r/compute-io/anagram-hash?branch=master\n\n[dependencies-image]: http://img.shields.io/david/compute-io/anagram-hash.svg\n[dependencies-url]: https://david-dm.org/compute-io/anagram-hash\n\n[dev-dependencies-image]: http://img.shields.io/david/dev/compute-io/anagram-hash.svg\n[dev-dependencies-url]: https://david-dm.org/dev/compute-io/anagram-hash\n\n[github-issues-image]: http://img.shields.io/github/issues/compute-io/anagram-hash.svg\n[github-issues-url]: https://github.com/compute-io/anagram-hash/issues\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdstructs%2Fanagram-hash","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdstructs%2Fanagram-hash","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdstructs%2Fanagram-hash/lists"}