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
|
/*
* $Revision: 3556 $
*
* last checkin:
* $Author: beyer $
* $Date: 2013-06-07 19:36:11 +0200 (Fri, 07 Jun 2013) $
***************************************************************/
/** \file
* \brief The NodeComparer compares nodes on base of the value
* stored in a node array given as constructor parameter
*
* \author Karsten Klein
*
* \par License:
* This file is part of the Open Graph Drawing Framework (OGDF).
*
* \par
* Copyright (C)<br>
* See README.txt in the root directory of the OGDF installation for details.
*
* \par
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* Version 2 or 3 as published by the Free Software Foundation;
* see the file LICENSE.txt included in the packaging of this file
* for details.
*
* \par
* 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.
*
* \par
* You should have received a copy of the GNU General Public
* License along with this program; if not, write to the Free
* Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
* \see http://www.gnu.org/copyleft/gpl.html
***************************************************************/
#ifdef _MSC_VER
#pragma once
#endif
#ifndef OGDF_NODECOMPARER_H
#define OGDF_NODECOMPARER_H
#include <ogdf/basic/basic.h>
#include <ogdf/basic/NodeArray.h>
namespace ogdf {
template<class sorterType>
class NodeComparer
{
public:
NodeComparer(NodeArray<sorterType> &valArray, bool ascending = true)
: m_valArray(&valArray)
{
if (ascending)
{
m_smaller = -1;
// m_greater = 1;
}//if
else
{
m_smaller = 1;
// m_greater = -1;
}
}//constructor
int compare(const node &v1, const node &v2) const
{
if ((*m_valArray)[v1] < (*m_valArray)[v2]) return m_smaller;
else if ((*m_valArray)[v1] > (*m_valArray)[v2]) return -m_smaller;//m_greater;
else return 0;
}
void init(NodeArray<sorterType> &valArray) {m_valArray = &valArray;}
OGDF_AUGMENT_COMPARER(node)
private:
NodeArray<sorterType> *m_valArray;
int m_smaller;
// int m_greater;
};//NodeComparer
}//namespace
#endif
|
