/usr/include/vtk-7.1/vtkPResampleWithDataSet.h is in libvtk7-dev 7.1.1+dfsg1-2.
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 | /*=========================================================================
Program: Visualization Toolkit
Module: vtkPResampleWithDataSet.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.
=========================================================================*/
/**
* @class vtkPResampleWithDataSet
* points from another dataset.
*
* vtkPResampleWithDataSet is the parallel version of vtkResampleWithDataSet
* filter
* @sa
* vtkResampleWithDataSet vtkPResampleToImage
*/
#ifndef vtkPResampleWithDataSet_h
#define vtkPResampleWithDataSet_h
#include "vtkFiltersParallelDIY2Module.h" // For export macro
#include "vtkResampleWithDataSet.h"
class vtkMultiProcessController;
class VTKFILTERSPARALLELDIY2_EXPORT vtkPResampleWithDataSet : public vtkResampleWithDataSet
{
public:
vtkTypeMacro(vtkPResampleWithDataSet, vtkResampleWithDataSet);
void PrintSelf(ostream& os, vtkIndent indent);
static vtkPResampleWithDataSet *New();
//@{
/**
* By defualt this filter uses the global controller,
* but this method can be used to set another instead.
*/
virtual void SetController(vtkMultiProcessController*);
vtkGetObjectMacro(Controller, vtkMultiProcessController);
//@}
//@{
/**
* Set/Get if the filter should use Balanced Partitioning for fast lookup of
* the input points. Balanced Partitioning partitions the points into similar
* sized bins. It takes logarithmic time to search for the candidate bins, but
* search inside border bins takes constant time.
* The default is to use Regular Partitioning which partitions the space of the
* points into regular sized bins. Based on their distribution, the bins may
* contain widely varying number of points. It takes constant time to search
* for the candidate bins but search within border bins can vary.
* For most cases, both techniques perform the same with Regular Partitioning
* being slightly better. Balanced Partitioning may perform better when the
* points distribution is highly skewed.
*/
vtkSetMacro(UseBalancedPartitionForPointsLookup, bool);
vtkGetMacro(UseBalancedPartitionForPointsLookup, bool);
vtkBooleanMacro(UseBalancedPartitionForPointsLookup, bool);
//@}
protected:
vtkPResampleWithDataSet();
~vtkPResampleWithDataSet();
virtual int RequestData(vtkInformation *, vtkInformationVector **,
vtkInformationVector *);
vtkMultiProcessController *Controller;
bool UseBalancedPartitionForPointsLookup;
private:
vtkPResampleWithDataSet(const vtkPResampleWithDataSet&) VTK_DELETE_FUNCTION;
void operator=(const vtkPResampleWithDataSet&) VTK_DELETE_FUNCTION;
};
#endif // vtkPResampleWithDataSet_h
|