dateinamen "speziell" sortieren

[glkgereon]

Noch eine Möglichkeit wäre, einfach die Priorität für alle Chars zu verändern.

Beispiel:

Delphi-Quellcode:

function OwnSort(List: TStringList; Index1, Index2: Integer): Integer;
const LookUp: array [Char] of Byte = (
  0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,
  29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,
  55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,
  81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,
  105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,
  124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,
  143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,
  162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,
  181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,
  200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,
  219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,
  238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255
  );
var i, M: Integer;
    S1, S2: String;
begin
  S1:=List[Index1];
  S2:=List[Index2];
  M:=Min(Length(S1),Length(S2));
  Result:=0;
  for i:=1 to M do
    begin
    if LookUp[S1[i]]>LookUp[S2[i]] then Result:=1
    else if LookUp[S1[i]]<LookUp[S2[i]] then Result:=2;
    if Result<>0 then Break;
    end;
end;

das solle ganz normal sortieren, du kann ja dann die entsprechenden Werte ändern LookupTables