File: TestSortFieldData.cxx

package info (click to toggle)
paraview 5.11.0%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 497,236 kB
  • sloc: cpp: 3,171,290; ansic: 1,315,072; python: 134,290; xml: 103,324; sql: 65,887; sh: 5,286; javascript: 4,901; yacc: 4,383; java: 3,977; perl: 2,363; lex: 1,909; f90: 1,255; objc: 143; makefile: 119; tcl: 59; pascal: 50; fortran: 29
file content (153 lines) | stat: -rw-r--r-- 4,247 bytes parent folder | download | duplicates (5)
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
/*=========================================================================

  Program:   Visualization Toolkit
  Module:    TestSortFieldData.cxx

  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.

=========================================================================*/
#include "vtkDoubleArray.h"
#include "vtkFieldData.h"
#include "vtkIntArray.h"
#include "vtkMath.h"
#include "vtkSortFieldData.h"
#include "vtkStringArray.h"
#include "vtkVariantArray.h"

#include <locale>  // C++ locale
#include <sstream> // to_string chokes some compilers

// A simple test sorts on one of the components of a 3-tuple array, and then
// orders all of the arrays based on the sort indices.
int TestSortFieldData(int, char*[])
{
  // Create the arrays
  vtkIntArray* iArray = vtkIntArray::New();
  iArray->SetName("Int Array");
  iArray->SetNumberOfComponents(3);
  iArray->SetNumberOfTuples(10);

  vtkStringArray* sArray = vtkStringArray::New();
  sArray->SetName("String Array");
  sArray->SetNumberOfComponents(1);
  sArray->SetNumberOfTuples(10);

  vtkDoubleArray* dArray = vtkDoubleArray::New();
  dArray->SetName("Double Array");
  dArray->SetNumberOfComponents(2);
  dArray->SetNumberOfTuples(10);

  vtkVariantArray* vArray = vtkVariantArray::New();
  vArray->SetName("Variant Array");
  vArray->SetNumberOfComponents(1);
  vArray->SetNumberOfTuples(10);

  // Populate the arrays. Mostly random numbers with a some values
  // set to compare against expected output.
  std::ostringstream ostr;
  ostr.imbue(std::locale::classic());
  int permute[] = { 3, 0, 9, 6, 7, 4, 5, 8, 2, 1 };
  for (int i = 0; i < 10; ++i)
  {
    iArray->SetComponent(i, 0, i);
    iArray->SetComponent(permute[i], 1, i);
    iArray->SetComponent(i, 2, static_cast<int>(vtkMath::Random(0, 100)));
    ostr.str(""); // clear it out
    ostr << i;
    sArray->SetValue(permute[i], ostr.str());
    dArray->SetComponent(i, 0, static_cast<double>(vtkMath::Random(-1, 1)));
    dArray->SetComponent(permute[i], 1, static_cast<double>(i));
    vArray->SetValue(permute[i], vtkVariant(ostr.str()));
  }

  // Create the field data
  vtkFieldData* fd = vtkFieldData::New();
  fd->AddArray(iArray);
  fd->AddArray(dArray);
  fd->AddArray(vArray);
  fd->AddArray(sArray);

  // Sort the data
  vtkIdType* idx = vtkSortFieldData::Sort(fd, "Int Array", 1, 1, 0);

  // Now test the result
  cout << "Ordering:\n\t( ";
  for (int i = 0; i < 10; ++i)
  {
    cout << idx[i] << " ";
    if (idx[i] != permute[i])
    {
      cout << "Bad sort order!\n";
      delete[] idx;
      return 1;
    }
  }
  delete[] idx;
  cout << ")";

  cout << "\n\nInteger Array (sorted by component==1):\n";
  for (int i = 0; i < 10; ++i)
  {
    cout << "\t(" << iArray->GetComponent(i, 0) << "," << iArray->GetComponent(i, 1) << ","
         << iArray->GetComponent(i, 2) << ")\n";
    if (iArray->GetComponent(i, 1) != i)
    {
      cout << "Bad sort order!\n";
      return 1;
    }
  }

  cout << "\nDouble Array:\n";
  for (int i = 0; i < 10; ++i)
  {
    cout << "\t(" << dArray->GetComponent(i, 0) << "," << dArray->GetComponent(i, 1) << ")\n";
    if (dArray->GetComponent(i, 1) != i)
    {
      cout << "Bad sort order!\n";
      return 1;
    }
  }

  cout << "\nString Array:\n\t( ";
  for (int i = 0; i < 10; ++i)
  {
    cout << sArray->GetValue(i) << " ";
    ostr.str(""); // clear it out
    ostr << i;
    if (sArray->GetValue(i) != ostr.str())
    {
      cout << "Bad sort order!\n";
      return 1;
    }
  }
  cout << ")\n";

  cout << "\nVariant Array:\n\t( ";
  for (int i = 0; i < 10; ++i)
  {
    cout << vArray->GetValue(i).ToString() << " ";
    ostr.str(""); // clear it out
    ostr << i;
    if (vArray->GetValue(i).ToString() != ostr.str())
    {
      cout << "Bad sort order!\n";
      return 1;
    }
  }
  cout << ")\n";

  // Clean up
  iArray->Delete();
  sArray->Delete();
  dArray->Delete();
  vArray->Delete();
  fd->Delete();

  return 0;
}