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
|
/* $Id: shellsort.cpp $ */
/** @file
* IPRT - RTSortShell and RTSortApvShell.
*/
/*
* Copyright (C) 2010-2023 Oracle and/or its affiliates.
*
* This file is part of VirtualBox base platform packages, as
* available from https://www.virtualbox.org.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation, in version 3 of the
* License.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, see <https://www.gnu.org/licenses>.
*
* The contents of this file may alternatively be used under the terms
* of the Common Development and Distribution License Version 1.0
* (CDDL), a copy of it is provided in the "COPYING.CDDL" file included
* in the VirtualBox distribution, in which case the provisions of the
* CDDL are applicable instead of those of the GPL.
*
* You may elect to license modified versions of this file under the
* terms and conditions of either the GPL or the CDDL or both.
*
* SPDX-License-Identifier: GPL-3.0-only OR CDDL-1.0
*/
/*********************************************************************************************************************************
* Header Files *
*********************************************************************************************************************************/
#include <iprt/sort.h>
#include <iprt/alloca.h>
#include <iprt/assert.h>
#include <iprt/string.h>
RTDECL(void) RTSortShell(void *pvArray, size_t cElements, size_t cbElement, PFNRTSORTCMP pfnCmp, void *pvUser)
{
Assert(cbElement <= 128);
/* Anything worth sorting? */
if (cElements < 2)
return;
uint8_t *pbArray = (uint8_t *)pvArray;
void *pvTmp = alloca(cbElement);
size_t cGap = (cElements + 1) / 2;
while (cGap > 0)
{
size_t i;
for (i = cGap; i < cElements; i++)
{
memcpy(pvTmp, &pbArray[i * cbElement], cbElement);
size_t j = i;
while ( j >= cGap
&& pfnCmp(&pbArray[(j - cGap) * cbElement], pvTmp, pvUser) > 0)
{
memmove(&pbArray[j * cbElement], &pbArray[(j - cGap) * cbElement], cbElement);
j -= cGap;
}
memcpy(&pbArray[j * cbElement], pvTmp, cbElement);
}
/* This does not generate the most optimal gap sequence, but it has the
advantage of being simple and avoid floating point. */
cGap /= 2;
}
}
RTDECL(void) RTSortApvShell(void **papvArray, size_t cElements, PFNRTSORTCMP pfnCmp, void *pvUser)
{
/* Anything worth sorting? */
if (cElements < 2)
return;
size_t cGap = (cElements + 1) / 2;
while (cGap > 0)
{
size_t i;
for (i = cGap; i < cElements; i++)
{
void *pvTmp = papvArray[i];
size_t j = i;
while ( j >= cGap
&& pfnCmp(papvArray[j - cGap], pvTmp, pvUser) > 0)
{
papvArray[j] = papvArray[j - cGap];
j -= cGap;
}
papvArray[j] = pvTmp;
}
/* This does not generate the most optimal gap sequence, but it has the
advantage of being simple and avoid floating point. */
cGap /= 2;
}
}
|
