blob: a829bcbbdbd266d8d4477c61d5ab09fb01f6cd5e (
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
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
|
/****************************************************************************
* *
* OpenNI 1.x Alpha *
* Copyright (C) 2011 PrimeSense Ltd. *
* *
* This file is part of OpenNI. *
* *
* OpenNI is free software: you can redistribute it and/or modify *
* it under the terms of the GNU Lesser General Public License as published *
* by the Free Software Foundation, either version 3 of the License, or *
* (at your option) any later version. *
* *
* OpenNI 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 Lesser General Public License for more details. *
* *
* You should have received a copy of the GNU Lesser General Public License *
* along with OpenNI. If not, see <http://www.gnu.org/licenses/>. *
* *
****************************************************************************/
#ifndef __XN_ALGORITHMS_H__
#define __XN_ALGORITHMS_H__
//---------------------------------------------------------------------------
// Includes
//---------------------------------------------------------------------------
#include <XnPlatform.h>
//---------------------------------------------------------------------------
// Types
//---------------------------------------------------------------------------
template<class T>
XnBool DefaultComparer(const T& arg1, const T& arg2)
{
return arg1 < arg2;
}
class XnAlgorithms
{
public:
template<class T, class Comparer>
static void BubbleSort(T elements[], XnUInt32 nCount, Comparer comp)
{
XnUInt32 n = nCount;
XnBool bSwapped;
T temp;
if (nCount == 0)
return;
do
{
bSwapped = FALSE;
for (XnUInt32 i = 0; i < n - 1; ++i)
{
if (!comp(elements[i], elements[i+1]))
{
// swap
temp = elements[i];
elements[i] = elements[i+1];
elements[i+1] = temp;
bSwapped = TRUE;
}
}
n -= 1;
} while (bSwapped);
}
template<class T>
static void BubbleSort(T elements[], XnUInt32 nCount)
{
BubbleSort(elements, nCount, DefaultComparer);
}
};
#endif // __XN_ALGORITHMS_H__
|
