Debian Codegraph @

apps/tools/ivfix/IfSorter.c++

raw
1 /*
2 *
3 * Copyright (C) 2000 Silicon Graphics, Inc. All Rights Reserved.
4 *
5 * This library is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU Lesser General Public
7 * License as published by the Free Software Foundation; either
8 * version 2.1 of the License, or (at your option) any later version.
9 *
10 * This library is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * Lesser General Public License for more details.
14 *
15 * Further, this software is distributed without any warranty that it is
16 * free of the rightful claim of any third person regarding infringement
17 * or the like. Any license provided herein, whether implied or
18 * otherwise, applies only to this software file. Patent licenses, if
19 * any, provided herein do not apply to combinations of this program with
20 * other software, or any other product whatsoever.
21 *
22 * You should have received a copy of the GNU Lesser General Public
23 * License along with this library; if not, write to the Free Software
24 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
25 *
26 * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
27 * Mountain View, CA 94043, or:
28 *
29 * http://www.sgi.com
30 *
31 * For further information regarding this notice, see:
32 *
33 * http://oss.sgi.com/projects/GenInfo/NoticeExplan/
34 *
35 */
36
37 #include <cstdlib>
38 #include "IfAssert.h"
39 #include "IfShape.h"
40 #include "IfSorter.h"
41
42 IfSorter *IfSorter::curSorter; // Saves "this" during qsort
43
44 /////////////////////////////////////////////////////////////////////////////
45 //
46 // Constructor.
47 //
48 /////////////////////////////////////////////////////////////////////////////
49
50 IfSorter::IfSorter()
51 {
52 }
53
54 /////////////////////////////////////////////////////////////////////////////
55 //
56 // Destructor.
57 //
58 /////////////////////////////////////////////////////////////////////////////
59
60 IfSorter::~IfSorter()
61 {
62 }
63
64 /////////////////////////////////////////////////////////////////////////////
65 //
66 // This sorts the given IfShapeList by various properties. The list is
67 // sorted in place.
68 //
69 /////////////////////////////////////////////////////////////////////////////
70
71 void
72 IfSorter::sort(IfShapeList &shapeList)
73 {
74 curSorter = this;
75 curShapeList = &shapeList;
76
77 // Use quicksort. This assumes that the shapeList is a contiguous
78 // array of pointers to IfShape instances.
79 IfShape **shapes = shapeList.getArray();
80 qsort(shapes, shapeList.getLength(), sizeof(IfShape *), compareCB);
81
82 // Once the shapes have been sorted, compare all neighbors to
83 // determine the level at which they differ
84 shapeList[0]->differenceLevel = 0;
85 for (int i = 1; i < shapeList.getLength(); i++)
86 IfShape::compare(shapeList[i-1], shapeList[i],
87 shapeList[i]->differenceLevel,
88 shapeList[i]->differenceCode);
89 }
90
91 /////////////////////////////////////////////////////////////////////////////
92 //
93 // Compares 2 shapes for qsort.
94 //
95 /////////////////////////////////////////////////////////////////////////////
96
97 int
98 IfSorter::compare(const IfShape *shape1, const IfShape *shape2)
99 {
100 int level;
101 IfShape::DifferenceCode dCode;
102 return IfShape::compare(shape1, shape2, level, dCode);
103 }