#include <vtkSortDataArray.h>


Definition at line 40 of file vtkSortDataArray.h.
Public Types | |
| typedef vtkObject | Superclass | 
| typedef vtkObject | Superclass | 
Public Member Functions | |
| virtual const char * | GetClassName () | 
| virtual int | IsA (const char *type) | 
| virtual void | PrintSelf (ostream &os, vtkIndent indent) | 
| virtual const char * | GetClassName () | 
| virtual int | IsA (const char *type) | 
| virtual void | PrintSelf (ostream &os, vtkIndent indent) | 
Static Public Member Functions | |
| static int | IsTypeOf (const char *type) | 
| static vtkSortDataArray * | SafeDownCast (vtkObject *o) | 
| static vtkSortDataArray * | New () | 
| static void | SortArrayByComponent (vtkAbstractArray *arr, int k) | 
| static int | IsTypeOf (const char *type) | 
| static vtkSortDataArray * | SafeDownCast (vtkObject *o) | 
| static vtkSortDataArray * | New () | 
| static void | SortArrayByComponent (vtkAbstractArray *arr, int k) | 
| static void | Sort (vtkIdList *keys) | 
| static void | Sort (vtkAbstractArray *keys) | 
| 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) | 
| static void | Sort (vtkIdList *keys) | 
| static void | Sort (vtkAbstractArray *keys) | 
| 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 Member Functions | |
| vtkSortDataArray () | |
| virtual | ~vtkSortDataArray () | 
| vtkSortDataArray () | |
| virtual | ~vtkSortDataArray () | 
| vtkSortDataArray::vtkSortDataArray | ( | ) |  [protected] | 
        
| virtual vtkSortDataArray::~vtkSortDataArray | ( | ) |  [protected, virtual] | 
        
| vtkSortDataArray::vtkSortDataArray | ( | ) |  [protected] | 
        
| virtual vtkSortDataArray::~vtkSortDataArray | ( | ) |  [protected, virtual] | 
        
| virtual const char* vtkSortDataArray::GetClassName | ( | ) |  [virtual] | 
        
Reimplemented from vtkObject.
| static int vtkSortDataArray::IsTypeOf | ( | const char * | name | ) |  [static] | 
        
Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h.
Reimplemented from vtkObject.
| virtual int vtkSortDataArray::IsA | ( | const char * | name | ) |  [virtual] | 
        
Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h.
Reimplemented from vtkObject.
| static vtkSortDataArray* vtkSortDataArray::SafeDownCast | ( | vtkObject * | o | ) |  [static] | 
        
Reimplemented from vtkObject.
| static vtkSortDataArray* vtkSortDataArray::New | ( | ) |  [static] | 
        
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
Reimplemented from vtkObject.
| virtual void vtkSortDataArray::PrintSelf | ( | ostream & | os, | |
| vtkIndent | indent | |||
| ) |  [virtual] | 
        
| static void vtkSortDataArray::Sort | ( | vtkIdList * | keys | ) |  [static] | 
        
Sorts the given array.
| static void vtkSortDataArray::Sort | ( | vtkAbstractArray * | keys | ) |  [static] | 
        
Sorts the given array.
| static void vtkSortDataArray::SortArrayByComponent | ( | vtkAbstractArray * | arr, | |
| int | k | |||
| ) |  [static] | 
        
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 k-th column of the grid is monotonically increasing. Where two tuples have the same value for the k-th component, their order in the final result is unspecified.
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 vtkSortDataArray::Sort | ( | vtkIdList * | keys, | |
| vtkAbstractArray * | values | |||
| ) |  [static] | 
        
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 vtkSortDataArray::Sort | ( | vtkAbstractArray * | keys, | |
| vtkIdList * | values | |||
| ) |  [static] | 
        
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 vtkSortDataArray::Sort | ( | vtkAbstractArray * | keys, | |
| vtkAbstractArray * | values | |||
| ) |  [static] | 
        
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.
| virtual const char* vtkSortDataArray::GetClassName | ( | ) |  [virtual] | 
        
Reimplemented from vtkObject.
| static int vtkSortDataArray::IsTypeOf | ( | const char * | name | ) |  [static] | 
        
Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h.
Reimplemented from vtkObject.
| virtual int vtkSortDataArray::IsA | ( | const char * | name | ) |  [virtual] | 
        
Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h.
Reimplemented from vtkObject.
| static vtkSortDataArray* vtkSortDataArray::SafeDownCast | ( | vtkObject * | o | ) |  [static] | 
        
Reimplemented from vtkObject.
| static vtkSortDataArray* vtkSortDataArray::New | ( | ) |  [static] | 
        
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
Reimplemented from vtkObject.
| virtual void vtkSortDataArray::PrintSelf | ( | ostream & | os, | |
| vtkIndent | indent | |||
| ) |  [virtual] | 
        
| static void vtkSortDataArray::Sort | ( | vtkIdList * | keys | ) |  [static] | 
        
Sorts the given array.
| static void vtkSortDataArray::Sort | ( | vtkAbstractArray * | keys | ) |  [static] | 
        
Sorts the given array.
| static void vtkSortDataArray::SortArrayByComponent | ( | vtkAbstractArray * | arr, | |
| int | k | |||
| ) |  [static] | 
        
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 k-th column of the grid is monotonically increasing. Where two tuples have the same value for the k-th component, their order in the final result is unspecified.
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 vtkSortDataArray::Sort | ( | vtkIdList * | keys, | |
| vtkAbstractArray * | values | |||
| ) |  [static] | 
        
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 vtkSortDataArray::Sort | ( | vtkAbstractArray * | keys, | |
| vtkIdList * | values | |||
| ) |  [static] | 
        
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 vtkSortDataArray::Sort | ( | vtkAbstractArray * | keys, | |
| vtkAbstractArray * | values | |||
| ) |  [static] | 
        
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.
 1.5.6