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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkSortDataArray.h
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/*
* Copyright 2003 Sandia Corporation.
* Under the terms of Contract DE-AC04-94AL85000, there is a non-exclusive
* license for use of this work by or on behalf of the
* U.S. Government. Redistribution and use in source and binary forms, with
* or without modification, are permitted provided that this Notice and any
* statement of authorship are reproduced on all copies.
*/
// .NAME vtkSortDataArray - Provides several methods for sorting vtk arrays.
#ifndef __vtkSortDataArray_h
#define __vtkSortDataArray_h
#include "vtkObject.h"
class vtkIdList;
class vtkAbstractArray;
class VTK_COMMON_EXPORT vtkSortDataArray : public vtkObject
{
public:
vtkTypeMacro(vtkSortDataArray, vtkObject);
static vtkSortDataArray *New();
virtual void PrintSelf(ostream &os, vtkIndent indent);
// Description:
// Sorts the given array.
static void Sort(vtkIdList *keys);
static void Sort(vtkAbstractArray *keys);
// Description:
// Sorts the given data array using the specified component as a key.
// Think of the array as a 2-D grid with each tuple representing a row.
// Tuples are swapped until the \a k-th column of the grid is
// monotonically increasing. Where two tuples have the same value for
// the \a k-th component, their order in the final result is unspecified.
static void SortArrayByComponent( vtkAbstractArray* arr, int k );
// Description:
// Sorts the given key/value pairs based on the keys. A pair is given
// as the entries at a given index of each of the arrays. Obviously,
// the two arrays must be of equal size.
static void Sort(vtkIdList *keys, vtkIdList *values);
static void Sort(vtkIdList *keys, vtkAbstractArray *values);
static void Sort(vtkAbstractArray *keys, vtkIdList *values);
static void Sort(vtkAbstractArray *keys, vtkAbstractArray *values);
protected:
vtkSortDataArray();
virtual ~vtkSortDataArray();
private:
vtkSortDataArray(const vtkSortDataArray &); // Not implemented.
void operator=(const vtkSortDataArray &); // Not implemented.
};
#endif //__vtkSortDataArray_h
|
