https://github.com/chreekat/usort
With usort, the sort is you!
https://github.com/chreekat/usort
command-line haskell-application sort
Last synced: about 1 year ago
JSON representation
With usort, the sort is you!
- Host: GitHub
- URL: https://github.com/chreekat/usort
- Owner: chreekat
- License: agpl-3.0
- Created: 2016-03-13T11:58:27.000Z (over 10 years ago)
- Default Branch: master
- Last Pushed: 2024-08-27T09:34:09.000Z (almost 2 years ago)
- Last Synced: 2025-04-14T09:14:39.793Z (about 1 year ago)
- Topics: command-line, haskell-application, sort
- Language: Haskell
- Homepage:
- Size: 399 KB
- Stars: 3
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- Changelog: CHANGELOG
- License: LICENSE.md
Awesome Lists containing this project
README
# usort
## Synopses
Sort a file's contents:
```
$ usort list.txt
```
Sort pasted content:
```
$ usort
```
(I wish that worked with pipes, but it does not.)
## About
[](https://builds.sr.ht/~chreekat/usort?)
Prioritizing task lists or backlogs is an important part of being organized.
Even when it isn't strictly required, I find thinking about priorities to be a
useful brainstorming device. But what's the best way to do it?
Staring at a drag-and-drop list and moving things at random always feels like
a futile, ineffecient exercise. Have I thought about this thing yet? Wait, did
I mean to put it above or *below* this other thing? Didn't I already decide on
that?
It seems especially silly since sorting a list is Computer Science 101. We've
got algorithms for that! We just need to use one of those algorithms to
efficiently choose items to be compared, and then do the comparisons ourselves.
And that's what usort is. Give it a list of items and it will prompt you to
compare them, one comparison at a time. At the end, it will print out your list.
Sorted! *rimshot*
### insort
Version 0.3 introduces insort, for sorting top-level [vimin] items using
standard alphabetic comparison.
## History
This utility started as a [simple script] using a standard Perl function,
[sort], that is parameterized over the comparator function. That worked for
years, and only got replaced when I wanted the ability to **edit** items in
place, **delete** them, or **undo** previous actions. More features are slowly
being added over time.
See the [CHANGELOG].
[simple script]: https://github.com/chreekat/bscripts/blob/3f3e6c69bab951ad5d54f9f34e20dd90dfe4b1e7/bryansort
[sort]: http://perldoc.perl.org/functions/sort.html
[vimin]: https://github.com/chreekat/vimin