-a N Select an action to perform. The number N is a value from 1 to 11, default is 3:
1 = Analyze only, do not fixup and do not optimize.
2 = Analyze and fixup, do not optimize.
3 = Analyze, fixup, and fast optimization (default).
5 = Analyze and force together.
6 = Analyze and move to end of disk.
7 = Analyze and sort files by name (folder + filename).
8 = Analyze and sort files by size (smallest first).
9 = Analyze and sort files by last access (newest first).
10 = Analyze and sort files by last change (oldest first).
11 = Analyze and sort files by creation time (oldest first).
i think that this is a too large list for a single option, and isn't the more efficient, what about other forms of listing? and if i dont want reclaim MFT? and if i only wish sort the files without defrag? i suggest split that options list on:
0=use the windows api (less efficient but safe, default)
?=use another (more efficient) form (like read the MFT and the FAT as you plan in the help files)
1=defragment (default of course xD)
?=another future defrag forms that dont use the windows api (like coping the files on other hardisk an copy back...) or use others windows-free software api (defrag the pagefiles and registry...)
- "reclaim MFT" option
0= no sorting (default)
?= forms of sorting (name a-z, name z-a, size small-big, size big-small...), if we have sorting dont do optimize
0= no optimizing
1= fast optimizing
2= slow optimizing (fill all gaps on the disk if all files are readable, if it cant, part another readable file and fill the spaces if is posible)
3= calculated optimizing (before all, calculate the posible filling of the disk, important files first, small files (1-3 clusters) for fill gaps, large files last (the program dont do that by defrag delays); fill all gaps on the disk if all files are readable, if it cant, fill the spaces with non compacted small files, if that files are over, move the defragmented files and fillup with a fragmented cluster-sized file, the last option is part another (too big) fragmented readable file and fill spaces if is posible)
?=another form of optimization (like force together, move to the end of the disk...) if we have optimizing dont do sorting
its only a idea, maybe i think something that someone thinked before and maybe dont be considered (too many code rewriting) then i aprecciate a non flaming answer