{"id":16345077,"url":"https://github.com/davidegrayson/anagram","last_synced_at":"2025-07-07T13:32:50.220Z","repository":{"id":141115780,"uuid":"2207408","full_name":"DavidEGrayson/anagram","owner":"DavidEGrayson","description":"Some algorithms for finding two-word anagrams.  Probably not useful to anyone.","archived":false,"fork":false,"pushed_at":"2011-08-18T01:26:35.000Z","size":132,"stargazers_count":6,"open_issues_count":0,"forks_count":2,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-07-01T07:04:04.071Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Ruby","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/DavidEGrayson.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2011-08-15T00:21:15.000Z","updated_at":"2018-12-25T14:06:39.000Z","dependencies_parsed_at":"2023-03-12T02:25:59.955Z","dependency_job_id":null,"html_url":"https://github.com/DavidEGrayson/anagram","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/DavidEGrayson/anagram","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DavidEGrayson%2Fanagram","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DavidEGrayson%2Fanagram/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DavidEGrayson%2Fanagram/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DavidEGrayson%2Fanagram/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/DavidEGrayson","download_url":"https://codeload.github.com/DavidEGrayson/anagram/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DavidEGrayson%2Fanagram/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":264085836,"owners_count":23555249,"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":[],"created_at":"2024-10-11T00:29:48.998Z","updated_at":"2025-07-07T13:32:50.166Z","avatar_url":"https://github.com/DavidEGrayson.png","language":"Ruby","funding_links":[],"categories":[],"sub_categories":[],"readme":"We are trying to find the fastest algorithm for finding all the\ntwo-word anagrams of the word 'documenting'.\n\nTo install the prerequisites, run:\n\n    gem install bundler\n    bundle\n\nTo choose which algorithm you want to work on, run one of:\n\n    export ALGORITHM=kata\n    export ALGORITHM=david\n    export ALGORITHM=josh\n    export ALGORITHM=paul\n\nAlternatively, you can prepend \"ALGORITHM=name\" to any of the\nother commands listed in this documentation.\n\nWhile you are developing an algorithm, test it for correctness\nby running:\n\n    watchr watch.rb\n\nor\n\n    rspec spec.rb\n\nTest it for speed and correctness by running:\n\n    time ./go.rb\n\nFigure out how to speed it up by running ruby-prof (which adds significant overhead):\n\n    ruby-prof go.rb\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdavidegrayson%2Fanagram","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdavidegrayson%2Fanagram","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdavidegrayson%2Fanagram/lists"}