"natural" compare function for sort

[Tommi Prami 130]

Hello is there any implementation for compare function for ordering strings with numbers into numeric order:

Random list to this:

1 test

2 test

10 test

11 test

20 test

21 test
test 1

test 2

test 10

test 11

test 12

test 20

 

etc,

Edited December 22, 2020 by Tommi Prami

[FPiette 383]

Are you showing the list sorted as you like or is it the unsorted list?

[Tommi Prami 130]

2 minutes ago, FPiette said:

Are you showing the list sorted as you like or is it the unsorted list?

Sorry bad example. Edited the list a bit.

Not just alphabetically but numbers would always be Smaller or larger first (depending if Ascending or Descending sort).

 

Can't remeber which this was called. Maybe natural sort etc.,.,

[Tommi Prami 130]

This -> https://en.wikipedia.org/wiki/Natural_sort_order

[FPiette 383]

Look there: https://stackoverflow.com/questions/5134712/how-to-get-the-sort-order-in-delphi-as-in-windows-explorer

 

[Tommi Prami 130]

15 minutes ago, FPiette said:

Look there: https://stackoverflow.com/questions/5134712/how-to-get-the-sort-order-in-delphi-as-in-windows-explorer

 

Thanks.

That API works if one is using Windows, as we are.

If someone has code for this, pleace share, I think would be usable for others tool.

 

-Tee-

[FPiette 383]

If you like my answer, you should like it (The heart icon on the answer bottom right). Thanks.

 

[Uwe Raabe 2057]

TStringHelper.Compare has an overload where you can give the option TCompareOption.coDigitAsNumbers for this purpose.

[David Heffernan 2345]

3 hours ago, FPiette said:

If you like my answer, you should like it (The heart icon on the answer bottom right). Thanks.

 

Seems a bit needy

[Mike Torrettinni 198]

5 hours ago, FPiette said:

Look there: https://stackoverflow.com/questions/5134712/how-to-get-the-sort-order-in-delphi-as-in-windows-explorer

 

Thanks! Pretty cool example with TStringList, will use it.

[Anders Melander 1783]

Googling "delphi natural sort" would have gotten you the answer.

[aehimself 396]

9 hours ago, David Heffernan said:

Seems a bit needy

Seems to be offtopic.

[programmerdelphi2k 237]

@Tommi Prami

 

in time, (almost 3 year is nothing... isn't)  my sample no-dependences of DLL, then you can use it in any platform!

https://en.delphipraxis.net/topic/9276-my-tstringlist-custom-sorting-trying-to-mimic-windows-explorer-way/

 

Edited June 26, 2023 by programmerdelphi2k

[Ian Branch 127]

Hi Team,

I have been following this thread because I have a need.

What would be the correct natural sort order for these?

'file10.txt', 'File2.txt', '2fileb.txt', 'file1.txt', '1FileA.txt', 'file20.txt', '12fiLe.txt', 'file11.txt', '10file.txt'

Is there a reference for dictating Natural Sort Order rules?

I have my own StringArray Natural Sorting routines and they seem to work.  I just want to make sure they are giving me the correct result IAW NSO rules.

This is what I am producing att:

 

Regards & TIA,

Ian

Edited June 27, 2023 by Ian Branch

[programmerdelphi2k 237]

@Ian Branch

 

I think that the Natural Order (to computer) is based on "symbol's" numerical value on the table used not? (normally ASCII table)

 

Which would come first for you: the letter "a=97 / A=65" (lowercase or uppercase), or the number "0 = 48" (zero)?

 

   me(...) X StrCmpLogicalW(...)

Edited June 28, 2023 by programmerdelphi2k

[Ian Branch 127]

Hi Team,

I redid my routine to use StrCmpLogicalW.  Now I get...

uses System.Generics.Defaults;

procedure SortStringArray(var AStringArray: TArray<string>);
var
  Comparer: IComparer<string>;
begin
    Comparer := TComparer<string>.Construct(
      function(const ALeft, ARight: string): Integer
      begin
        Result := StrCmpLogicalW(PChar(ALeft.ToLower), PChar(ARight.ToLower));
      end
    );

  // Sort the string array using the custom comparer
  TArray.Sort<string>(AStringArray, Comparer);
end;

 

Regards & Tks.

 

Ian