blob: b6ed8d527c9abe53c841ad7feb2e130df04b214c (
plain)
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
|
// SortUtils.cpp
#include "StdAfx.h"
#include "SortUtils.h"
static int __cdecl CompareStrings(const void *a1, const void *a2)
{
const UString &s1 = *(*(*((const UString ***)a1)));
const UString &s2 = *(*(*((const UString ***)a2)));
return s1.CompareNoCase(s2);
}
void SortStringsToIndices(const UStringVector &strings, CIntVector &indices)
{
indices.Clear();
if (strings.IsEmpty())
return;
int numItems = strings.Size();
CPointerVector pointers;
pointers.Reserve(numItems);
indices.Reserve(numItems);
int i;
for(i = 0; i < numItems; i++)
pointers.Add((void *)&strings.CPointerVector::operator[](i));
void **stringsBase = (void **)pointers[0];
qsort(&pointers[0], numItems, sizeof(void *), CompareStrings);
for(i = 0; i < numItems; i++)
indices.Add((void **)pointers[i] - stringsBase);
}
void SortStrings(const UStringVector &src, UStringVector &dest)
{
CIntVector indices;
SortStringsToIndices(src, indices);
dest.Clear();
dest.Reserve(indices.Size());
for (int i = 0; i < indices.Size(); i++)
dest.Add(src[indices[i]]);
}
|