{"id":16649679,"url":"https://github.com/luispedro/outsort","last_synced_at":"2026-05-15T16:04:05.827Z","repository":{"id":66806279,"uuid":"102493149","full_name":"luispedro/outsort","owner":"luispedro","description":"Generic sorting of large datasets (using temporary files as temporary space)","archived":false,"fork":false,"pushed_at":"2019-07-11T06:38:50.000Z","size":16,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-28T02:53:14.271Z","etag":null,"topics":["external-sorting","haskell","library","sorting"],"latest_commit_sha":null,"homepage":null,"language":"Haskell","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/luispedro.png","metadata":{"files":{"readme":"README.md","changelog":"ChangeLog","contributing":null,"funding":null,"license":"COPYING","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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2017-09-05T14:41:22.000Z","updated_at":"2019-07-11T06:38:51.000Z","dependencies_parsed_at":null,"dependency_job_id":"acc49ddc-8503-4197-8f19-0f7b04d5c23c","html_url":"https://github.com/luispedro/outsort","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/luispedro/outsort","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luispedro%2Foutsort","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luispedro%2Foutsort/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luispedro%2Foutsort/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luispedro%2Foutsort/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/luispedro","download_url":"https://codeload.github.com/luispedro/outsort/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luispedro%2Foutsort/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33071583,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-15T11:35:32.926Z","status":"ssl_error","status_checked_at":"2026-05-15T11:35:31.362Z","response_time":103,"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":["external-sorting","haskell","library","sorting"],"created_at":"2024-10-12T09:11:33.528Z","updated_at":"2026-05-15T16:04:05.822Z","avatar_url":"https://github.com/luispedro.png","language":"Haskell","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Outsort: generic (Haskell-based) external sorting\n\n\nExample\n\n```haskell\n    import qualified Data.Conduit.Combinators as CC\n    import qualified Data.Conduit.Binary as CB\n\n    import Algorithms.OutSort (isolateBySize)\n    import Algorithms.SortMain (sortMain)\n\n    main :: IO ()\n    main = sortMain\n        CB.lines\n        CC.unlinesAscii\n        (isolateBySize (const 1) 500000)\n```\n\nAll that is needed is a decoder (`ConduitT ByteString a m ()`), an encoder\n(`ConduitT ByteString a m ()`), and a function to split the input into blocks\n(`ConduitT a a m ()`). Given these elements, the result is a programme which can\nsort arbitrarily large inputs using external memory.\n\nLicence: MIT\n\nAuthor: [Luis Pedro Coelho](http://luispedro.org) (email:\n[coelho@embl.de](mailto:coelho@embl.de)) (on twitter:\n[@luispedrocoelho](https://twitter.com/luispedrocoelho))\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fluispedro%2Foutsort","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fluispedro%2Foutsort","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fluispedro%2Foutsort/lists"}