Crates.io | codesort |
lib.rs | codesort |
version | 0.6.1 |
source | src |
created_at | 2024-03-19 19:30:47.079049 |
updated_at | 2024-04-01 08:56:56.979127 |
description | codesort sorts code |
homepage | |
repository | https://github.com/Canop/codesort |
max_upload_size | |
id | 1179578 |
size | 1,583,148 |
Your code is full of lists: enum variants, struct fields, match arms, function declarations, etc.
When a list grows, it's sometimes useful to sort it alphabetically, to help you keep track of the parts.
Of course you can't just sort lines: the code wouldn't work anymore; comments and annotations would be lost, spacing would be off, etc.
And sorting code manually is a tedious task.
codesort can do it for you, with a shortcut on the desired part of the code, directly in your IDE.
Here's the before and after of sorting around the cursor's line:
match
Having Rust dev environment installed, run
cargo install codesort
codesort --range 6:26 src/my/file.rs
Unless you specifically want to exclude a part of the list from sorting (eg a field you want to keep at the end of a struct), you should prefer to use --around
which selects the range for you.
The first example of this readme has been sorted with the following command:
codesort --around 14 src/my/file.rs
Any other line number from 6
to 26
would have been fine, except the deeper lines 21
and 22
(if you sort around line 22
, you sort start
and end
, which is probably not desired).
When no path is provided to codesort, specify the language using --lang
/-l
:
cat some/file.js | codesort -l js
By default, codesort takes the code to sort from stdin and writes the sorted code to stdout.
It can sort either the whole input, a given range (with --range
), or select the best range around a given line (using --around
).
You can also change the input and output to be files, with --src
and --dst
.
If necessary, you can provide a filename to codesort for langage detection (the file doesn't have to exist, only the extension of the name will be used, eg .js
).
Those options make it easy to integrate codesort in any editor. See below for vim and IntelliJ (contributions welcome for other editors).
When you don't want to sort the whole range (for example because there's a specific entry that you want to keep at the beginning), you can specify the range.
Visually select the selection, then type :
, then !codesort
.
This changes the input to
:'<,'>!codesort
Press the enter
key: the selection is sorted with codesort.
You don't usually have to select the zone to sort. You can ask codesort to automatically select the zone to sort around your current line.
Define this binding in your vim configuration:
" sort the optimal range around the current line
" See https://github.com/Canop/codesort
nnoremap <Leader>cs ma<ESC>:execute ":%!codesort --around ".line('.')." --detect ".shellescape(expand('%:t'))<CR>`a
Typing the leader key then 'cs' will automatically select the set of blocs around the current line and sort it.
Explanation of the command:
a
register with ma
:execute
--around
--detect
Configure the shortcut (File -> Settings -> Tools -> External tools) like this:
Arguments: --range $SelectionStartLine$:$SelectionEndLine$ $FileDir$/$FileName$
To use it: right-click selection -> external tools -> codesort
Arguments: --around $LineNumber$ $FileDir$/$FileName$
3 code analyzers are available now:
Codesort is much tested on Rust, but would need tests and probably improvements for other languages.
Whatever the language and use case, please come discuss on Miaou.
codesort is licenced under AGPL-3.0.
You're free to use the codesort program to sort the code of your choice, even commercial.