{"id":17277679,"url":"https://github.com/chreekat/usort","last_synced_at":"2025-04-14T09:14:42.896Z","repository":{"id":142781215,"uuid":"53782738","full_name":"chreekat/usort","owner":"chreekat","description":"With usort, the sort is you!","archived":false,"fork":false,"pushed_at":"2024-08-27T09:34:09.000Z","size":409,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-04-14T09:14:39.793Z","etag":null,"topics":["command-line","haskell-application","sort"],"latest_commit_sha":null,"homepage":"","language":"Haskell","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"agpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/chreekat.png","metadata":{"files":{"readme":"README.md","changelog":"CHANGELOG","contributing":null,"funding":null,"license":"LICENSE.md","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":"2016-03-13T11:58:27.000Z","updated_at":"2024-08-27T09:34:13.000Z","dependencies_parsed_at":"2024-08-27T10:58:51.298Z","dependency_job_id":null,"html_url":"https://github.com/chreekat/usort","commit_stats":null,"previous_names":[],"tags_count":4,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chreekat%2Fusort","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chreekat%2Fusort/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chreekat%2Fusort/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chreekat%2Fusort/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/chreekat","download_url":"https://codeload.github.com/chreekat/usort/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248852183,"owners_count":21171842,"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":["command-line","haskell-application","sort"],"created_at":"2024-10-15T09:09:41.133Z","updated_at":"2025-04-14T09:14:42.872Z","avatar_url":"https://github.com/chreekat.png","language":"Haskell","funding_links":[],"categories":[],"sub_categories":[],"readme":"# usort\n\n## Synopses\n\nSort a file's contents:\n\n ```\n $ usort list.txt\n ```\n\nSort pasted content:\n\n ```\n $ usort\n \u003cpaste in content\u003e\n \u003cc-d\u003e\n ```\n\n(I wish that worked with pipes, but it does not.)\n\n## About\n\n[![builds.sr.ht status](https://builds.sr.ht/~chreekat/usort.svg)](https://builds.sr.ht/~chreekat/usort?)\n\nPrioritizing task lists or backlogs is an important part of being organized.\nEven when it isn't strictly required, I find thinking about priorities to be a\nuseful brainstorming device. But what's the best way to do it?\n\nStaring at a drag-and-drop list and moving things at random always feels like\na futile, ineffecient exercise. Have I thought about this thing yet? Wait, did\nI mean to put it above or *below* this other thing? Didn't I already decide on\nthat?\n\nIt seems especially silly since sorting a list is Computer Science 101. We've\ngot algorithms for that! We just need to use one of those algorithms to\nefficiently choose items to be compared, and then do the comparisons ourselves.\n\nAnd that's what usort is. Give it a list of items and it will prompt you to\ncompare them, one comparison at a time. At the end, it will print out your list.\nSorted! *rimshot*\n\n### insort\n\nVersion 0.3 introduces insort, for sorting top-level [vimin] items using\nstandard alphabetic comparison.\n\n## History\n\nThis utility started as a [simple script] using a standard Perl function,\n[sort], that is parameterized over the comparator function. That worked for\nyears, and only got replaced when I wanted the ability to **edit** items in\nplace, **delete** them, or **undo** previous actions. More features are slowly\nbeing added over time.\n\nSee the [CHANGELOG].\n\n[simple script]: https://github.com/chreekat/bscripts/blob/3f3e6c69bab951ad5d54f9f34e20dd90dfe4b1e7/bryansort\n[sort]: http://perldoc.perl.org/functions/sort.html\n[vimin]: https://github.com/chreekat/vimin\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchreekat%2Fusort","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fchreekat%2Fusort","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchreekat%2Fusort/lists"}