/usr/include/vtk-5.10/vtkScalarTree.h is in libvtk5-dev 5.10.1+dfsg-2.1build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /*=========================================================================
Program: Visualization Toolkit
Module: vtkScalarTree.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.
=========================================================================*/
// .NAME vtkScalarTree - organize data according to scalar values (used to accelerate contouring operations)
// .SECTION Description
// vtkScalarTree is an abstract class that defines the API to concrete
// scalar tree subclasses. A scalar tree is a data structure that organizes
// data according to its scalar value. This allows rapid access to data for
// those algorithms that access the data based on scalar value. For example,
// isocontouring operates on cells based on the scalar (isocontour) value.
//
// To use subclasses of this class, you must specify a dataset to operate on,
// and then specify a scalar value in the InitTraversal() method. Then
// calls to GetNextCell() return cells whose scalar data contains the
// scalar value specified.
// .SECTION See Also
// vtkSimpleScalarTree
#ifndef __vtkScalarTree_h
#define __vtkScalarTree_h
#include "vtkObject.h"
class vtkCell;
class vtkDataArray;
class vtkDataSet;
class vtkIdList;
class vtkTimeStamp;
class VTK_FILTERING_EXPORT vtkScalarTree : public vtkObject
{
public:
vtkTypeMacro(vtkScalarTree,vtkObject);
void PrintSelf(ostream& os, vtkIndent indent);
// Description:
// Build the tree from the points/cells defining this dataset.
virtual void SetDataSet(vtkDataSet*);
vtkGetObjectMacro(DataSet,vtkDataSet);
// Description:
// Construct the scalar tree from the dataset provided. Checks build times
// and modified time from input and reconstructs the tree if necessary.
virtual void BuildTree() = 0;
// Description:
// Initialize locator. Frees memory and resets object as appropriate.
virtual void Initialize() = 0;
// Description:
// Begin to traverse the cells based on a scalar value. Returned cells
// will have scalar values that span the scalar value specified.
virtual void InitTraversal(double scalarValue) = 0;
// Description:
// Return the next cell that may contain scalar value specified to
// initialize traversal. The value NULL is returned if the list is
// exhausted. Make sure that InitTraversal() has been invoked first or
// you'll get erratic behavior.
virtual vtkCell *GetNextCell(vtkIdType &cellId, vtkIdList* &ptIds,
vtkDataArray *cellScalars) = 0;
protected:
vtkScalarTree();
~vtkScalarTree();
vtkDataSet *DataSet; //the dataset over which the scalar tree is built
vtkDataArray *Scalars; //the scalars of the DataSet
vtkTimeStamp BuildTime; //time at which tree was built
double ScalarValue; //current scalar value for traversal
virtual void ReportReferences(vtkGarbageCollector*);
private:
vtkScalarTree(const vtkScalarTree&); // Not implemented.
void operator=(const vtkScalarTree&); // Not implemented.
};
#endif
|