{"id":16962366,"url":"https://github.com/aeharding/timeout-sort","last_synced_at":"2026-05-17T18:31:53.135Z","repository":{"id":35911869,"uuid":"40199094","full_name":"aeharding/timeout-sort","owner":"aeharding","description":"Timeout sort is an asynchronous integer sorting algorithm. It can sort all integers with O(max(input)+n).","archived":false,"fork":false,"pushed_at":"2015-11-12T20:22:55.000Z","size":116,"stargazers_count":5,"open_issues_count":2,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-26T11:23:01.382Z","etag":null,"topics":[],"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/aeharding.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-08-04T17:34:38.000Z","updated_at":"2024-11-08T07:55:34.000Z","dependencies_parsed_at":"2022-08-26T17:31:47.836Z","dependency_job_id":null,"html_url":"https://github.com/aeharding/timeout-sort","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aeharding%2Ftimeout-sort","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aeharding%2Ftimeout-sort/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aeharding%2Ftimeout-sort/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aeharding%2Ftimeout-sort/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/aeharding","download_url":"https://codeload.github.com/aeharding/timeout-sort/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244825448,"owners_count":20516590,"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-13T23:06:20.273Z","updated_at":"2026-05-17T18:31:48.102Z","avatar_url":"https://github.com/aeharding.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# timeout-sort\n\nTimeout sort is an asynchronous integer sorting algorithm. It can sort all integers (+ \u0026 -) with O(max(abs(input))+n).\n\n```js\nvar timeoutSort = require(\"timeout-sort\");\n\n// callback form\ntimeoutSort([5, 20, 642, -80], function cbSort(sortedArray, err) {\n  if (err) console.log(\"You suck!\");\n  console.log(sortedArray);\n});\n\n// promise form\ntimeoutSort([5, 20, 642, -80]).then(function resolvedWithSort(sortedArray) {\n  console.log(sortedArray);\n});\n```\n\n## Development\n\n`npm install -g mocha coffee-script`\n\nthen\n\n`npm start` (to compile)\n\n`npm test`\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faeharding%2Ftimeout-sort","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faeharding%2Ftimeout-sort","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faeharding%2Ftimeout-sort/lists"}