<commit_before>/*=========================================================================

  Program:   Visualization Toolkit
  Module:    vtkContourFilter.cxx
  Language:  C++
  Date:      $Date$
  Version:   $Revision$


Copyright (c) 1993-2000 <NAME>, <NAME>, <NAME> 
All rights reserved.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:

 * Redistributions of source code must retain the above copyright notice,
   this list of conditions and the following disclaimer.

 * Redistributions in binary form must reproduce the above copyright notice,
   this list of conditions and the following disclaimer in the documentation
   and/or other materials provided with the distribution.

 * Neither name of <NAME>, <NAME>, or <NAME> nor the names
   of any contributors may be used to endorse or promote products derived
   from this software without specific prior written permission.

 * Modified source versions must be plainly marked as such, and must not be
   misrepresented as being the original software.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS''
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

=========================================================================*/
#include <math.h>
#include "vtkContourFilter.h"
#include "vtkScalars.h"
#include "vtkCell.h"
#include "vtkMergePoints.h"
#include "vtkContourValues.h"
#include "vtkScalarTree.h"
#include "vtkObjectFactory.h"
#include "vtkTimerLog.h"
#include "vtkUnstructuredGrid.h"
#include "vtkContourGrid.h"

//------------------------------------------------------------------------------
vtkContourFilter* vtkContourFilter::New()
{
  // First try to create the object from the vtkObjectFactory
  vtkObject* ret = vtkObjectFactory::CreateInstance("vtkContourFilter");
  if(ret)
    {
    return (vtkContourFilter*)ret;
    }
  // If the factory was unable to create the object, then create it here.
  return new vtkContourFilter;
}




// Construct object with initial range (0,1) and single contour value
// of 0.0.
vtkContourFilter::vtkContourFilter()
{
  this->ContourValues = vtkContourValues::New();

  this->ComputeNormals = 1;
  this->ComputeGradients = 0;
  this->ComputeScalars = 1;

  this->Locator = NULL;

  this->UseScalarTree = 0;
  this->ScalarTree = NULL;
}

vtkContourFilter::~vtkContourFilter()
{
  this->ContourValues->Delete();
  if ( this->Locator )
    {
    this->Locator->UnRegister(this);
    this->Locator = NULL;
    }
  if ( this->ScalarTree )
    {
    this->ScalarTree->Delete();
    }
}

// Overload standard modified time function. If contour values are modified,
// then this object is modified as well.
unsigned long vtkContourFilter::GetMTime()
{
  unsigned long mTime=this->vtkDataSetToPolyDataFilter::GetMTime();
  unsigned long time;

  if (this->ContourValues)
    {
    time = this->ContourValues->GetMTime();
    mTime = ( time > mTime ? time : mTime );
    }
  if (this->Locator)
    {
    time = this->Locator->GetMTime();
    mTime = ( time > mTime ? time : mTime );
    }

  return mTime;
}

//
// General contouring filter.  Handles arbitrary input.
//
void vtkContourFilter::Execute()
{
  int cellId, i, abortExecute=0;
  vtkIdList *cellPts;
  vtkScalars *inScalars;
  vtkCell *cell;
  float range[2];
  vtkCellArray *newVerts, *newLines, *newPolys;
  vtkPoints *newPts;
  vtkDataSet *input=this->GetInput();
  vtkPolyData *output=this->GetOutput();
  int numCells, estimatedSize;
  vtkPointData *inPd=input->GetPointData(), *outPd=output->GetPointData();
  vtkCellData *inCd=input->GetCellData(), *outCd=output->GetCellData();
  int numContours=this->ContourValues->GetNumberOfContours();
  float *values=this->ContourValues->GetValues();
  vtkScalars *cellScalars;
	vtkTimerLog *timer = vtkTimerLog::New();

	timer->StartTimer();
  vtkDebugMacro(<< "Executing contour filter");

	if (input->GetDataObjectType() == VTK_UNSTRUCTURED_GRID)
		{
		vtkContourGrid *cgrid;

		cgrid = vtkContourGrid::New();
		cgrid->SetInput(input);
		cgrid->Update();
		output = cgrid->GetOutput();
		} //if type VTK_UNSTRUCTURED_GRID
	else
		{
		numCells = input->GetNumberOfCells();
	  inScalars = input->GetPointData()->GetScalars();
		if ( ! inScalars || numCells < 1 )
			{
			vtkErrorMacro(<<"No data to contour");
			return;
			}

		inScalars->GetRange(range);
//
// Create objects to hold output of contour operation. First estimate allocation size.
//
	  estimatedSize = (int) pow ((double) numCells, .75);
	  estimatedSize *= numContours;
	  estimatedSize = estimatedSize / 1024 * 1024; //multiple of 1024
	  if (estimatedSize < 1024)
	    {
	    estimatedSize = 1024;
	    }

	  newPts = vtkPoints::New();
	  newPts->Allocate(estimatedSize,estimatedSize);
	  newVerts = vtkCellArray::New();
	  newVerts->Allocate(estimatedSize,estimatedSize);
	  newLines = vtkCellArray::New();
	  newLines->Allocate(estimatedSize,estimatedSize);
	  newPolys = vtkCellArray::New();
	  newPolys->Allocate(estimatedSize,estimatedSize);
	  cellScalars = vtkScalars::New();
	  cellScalars->Allocate(VTK_CELL_SIZE);
  
   // locator used to merge potentially duplicate points
	  if ( this->Locator == NULL )
		  {
			this->CreateDefaultLocator();
			}
		this->Locator->InitPointInsertion (newPts, input->GetBounds(),estimatedSize);

  // interpolate data along edge
  // if we did not ask for scalars to be computed, don't copy them
		if (!this->ComputeScalars)
		  {
		  outPd->CopyScalarsOff();
		  }
		outPd->InterpolateAllocate(inPd,estimatedSize,estimatedSize);
		outCd->CopyAllocate(inCd,estimatedSize,estimatedSize);

  // If enabled, build a scalar tree to accelerate search
  //
		if ( !this->UseScalarTree )
		  {
		  for (cellId=0; cellId < numCells && !abortExecute; cellId++)
		    {
			  cell = input->GetCell(cellId);
				cellPts = cell->GetPointIds();
			  inScalars->GetScalars(cellPts,cellScalars);

			  if ( ! (cellId % 5000) ) 
				  {
					vtkDebugMacro(<<"Contouring #" << cellId);
					this->UpdateProgress ((float)cellId/numCells);
					if (this->GetAbortExecute())
					  {
					  abortExecute = 1;
					  break;
					  }
					}

				for (i=0; i < numContours; i++)
					{
					cell->Contour(values[i], cellScalars, this->Locator, 
					              newVerts, newLines, newPolys, inPd, outPd,
												inCd, cellId, outCd);

					} // for all contour values
				} // for all cells
			} //if using scalar tree
		else
			{
			if ( this->ScalarTree == NULL )
			  {
			this->ScalarTree = vtkScalarTree::New();
			  }
			this->ScalarTree->SetDataSet(input);
			//
			// Loop over all contour values.  Then for each contour value, 
			// loop over all cells.
			//
			for (i=0; i < numContours; i++)
				{
				for ( this->ScalarTree->InitTraversal(values[i]); 
						(cell=this->ScalarTree->GetNextCell(cellId,cellPts,cellScalars)) != NULL; )
					{
					cell->Contour(values[i], cellScalars, this->Locator, 
						            newVerts, newLines, newPolys, inPd, outPd,
												inCd, cellId, outCd);

					} //for all cells
				} //for all contour values
			} //using scalar tree
		} //else (for if vtkUnstructuredGrid)

	vtkDebugMacro(<<"Created: " 
			          << newPts->GetNumberOfPoints() << " points, " 
				        << newVerts->GetNumberOfCells() << " verts, " 
						    << newLines->GetNumberOfCells() << " lines, " 
							  << newPolys->GetNumberOfCells() << " triangles");
  //
  // Update ourselves.  Because we don't know up front how many verts, lines,
  // polys we've created, take care to reclaim memory. 
  //
	output->SetPoints(newPts);
	newPts->Delete();
	cellScalars->Delete();
  
	if (newVerts->GetNumberOfCells())
		{
		output->SetVerts(newVerts);
		}
	newVerts->Delete();

	if (newLines->GetNumberOfCells())
	   {
	  output->SetLines(newLines);
	  }
	newLines->Delete();

	if (newPolys->GetNumberOfCells())
		{
		output->SetPolys(newPolys);
		}
	newPolys->Delete();

	this->Locator->Initialize();//releases leftover memory
	output->Squeeze();

	timer->StopTimer();
	vtkErrorMacro(<<"elapsed time: " << timer->GetElapsedTime());
	timer->Delete();
}

// Specify a spatial locator for merging points. By default, 
// an instance of vtkMergePoints is used.
void vtkContourFilter::SetLocator(vtkPointLocator *locator)
{
  if ( this->Locator == locator ) 
    {
    return;
    }
  if ( this->Locator )
    {
    this->Locator->UnRegister(this);
    this->Locator = NULL;
    }
  if ( locator )
    {
    locator->Register(this);
    }
  this->Locator = locator;
  this->Modified();
}

void vtkContourFilter::CreateDefaultLocator()
{
  if ( this->Locator == NULL )
    {
    this->Locator = vtkMergePoints::New();
    }
}

void vtkContourFilter::PrintSelf(ostream& os, vtkIndent indent)
{
  vtkDataSetToPolyDataFilter::PrintSelf(os,indent);

  os << indent << "Compute Gradients: " << (this->ComputeGradients ? "On\n" : "Off\n");
  os << indent << "Compute Normals: " << (this->ComputeNormals ? "On\n" : "Off\n");
  os << indent << "Compute Scalars: " << (this->ComputeScalars ? "On\n" : "Off\n");
  os << indent << "Use Scalar Tree: " << (this->UseScalarTree ? "On\n" : "Off\n");

  this->ContourValues->PrintSelf(os,indent);

  if ( this->Locator )
    {
    os << indent << "Locator: " << this->Locator << "\n";
    }
  else
    {
    os << indent << "Locator: (none)\n";
    }
}

<commit_msg>This moves the calls to Delete for objects being created only if we do not have an unstructured grid inside the appropriate if statement.<commit_after>/*=========================================================================

  Program:   Visualization Toolkit
  Module:    vtkContourFilter.cxx
  Language:  C++
  Date:      $Date$
  Version:   $Revision$


Copyright (c) 1993-2000 <NAME>, <NAME>, <NAME> 
All rights reserved.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:

 * Redistributions of source code must retain the above copyright notice,
   this list of conditions and the following disclaimer.

 * Redistributions in binary form must reproduce the above copyright notice,
   this list of conditions and the following disclaimer in the documentation
   and/or other materials provided with the distribution.

 * Neither name of <NAME>, <NAME>, or <NAME> nor the names
   of any contributors may be used to endorse or promote products derived
   from this software without specific prior written permission.

 * Modified source versions must be plainly marked as such, and must not be
   misrepresented as being the original software.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS''
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

=========================================================================*/
#include <math.h>
#include "vtkContourFilter.h"
#include "vtkScalars.h"
#include "vtkCell.h"
#include "vtkMergePoints.h"
#include "vtkContourValues.h"
#include "vtkScalarTree.h"
#include "vtkObjectFactory.h"
#include "vtkTimerLog.h"
#include "vtkUnstructuredGrid.h"
#include "vtkContourGrid.h"

//------------------------------------------------------------------------------
vtkContourFilter* vtkContourFilter::New()
{
  // First try to create the object from the vtkObjectFactory
  vtkObject* ret = vtkObjectFactory::CreateInstance("vtkContourFilter");
  if(ret)
    {
    return (vtkContourFilter*)ret;
    }
  // If the factory was unable to create the object, then create it here.
  return new vtkContourFilter;
}




// Construct object with initial range (0,1) and single contour value
// of 0.0.
vtkContourFilter::vtkContourFilter()
{
  this->ContourValues = vtkContourValues::New();

  this->ComputeNormals = 1;
  this->ComputeGradients = 0;
  this->ComputeScalars = 1;

  this->Locator = NULL;

  this->UseScalarTree = 0;
  this->ScalarTree = NULL;
}

vtkContourFilter::~vtkContourFilter()
{
  this->ContourValues->Delete();
  if ( this->Locator )
    {
    this->Locator->UnRegister(this);
    this->Locator = NULL;
    }
  if ( this->ScalarTree )
    {
    this->ScalarTree->Delete();
    }
}

// Overload standard modified time function. If contour values are modified,
// then this object is modified as well.
unsigned long vtkContourFilter::GetMTime()
{
  unsigned long mTime=this->vtkDataSetToPolyDataFilter::GetMTime();
  unsigned long time;

  if (this->ContourValues)
    {
    time = this->ContourValues->GetMTime();
    mTime = ( time > mTime ? time : mTime );
    }
  if (this->Locator)
    {
    time = this->Locator->GetMTime();
    mTime = ( time > mTime ? time : mTime );
    }

  return mTime;
}

//
// General contouring filter.  Handles arbitrary input.
//
void vtkContourFilter::Execute()
{
  int cellId, i, abortExecute=0;
  vtkIdList *cellPts;
  vtkScalars *inScalars;
  vtkCell *cell;
  float range[2];
  vtkCellArray *newVerts, *newLines, *newPolys;
  vtkPoints *newPts;
  vtkDataSet *input=this->GetInput();
  vtkPolyData *output=this->GetOutput();
  int numCells, estimatedSize;
  vtkPointData *inPd=input->GetPointData(), *outPd=output->GetPointData();
  vtkCellData *inCd=input->GetCellData(), *outCd=output->GetCellData();
  int numContours=this->ContourValues->GetNumberOfContours();
  float *values=this->ContourValues->GetValues();
  vtkScalars *cellScalars;

  vtkDebugMacro(<< "Executing contour filter");

	if (input->GetDataObjectType() == VTK_UNSTRUCTURED_GRID)
		{
		vtkContourGrid *cgrid;

		cgrid = vtkContourGrid::New();
		cgrid->SetInput(input);
		cgrid->Update();
		output = cgrid->GetOutput();
		} //if type VTK_UNSTRUCTURED_GRID
	else
		{
		numCells = input->GetNumberOfCells();
	  inScalars = input->GetPointData()->GetScalars();
		if ( ! inScalars || numCells < 1 )
			{
			vtkErrorMacro(<<"No data to contour");
			return;
			}

		inScalars->GetRange(range);
//
// Create objects to hold output of contour operation. First estimate allocation size.
//
	  estimatedSize = (int) pow ((double) numCells, .75);
	  estimatedSize *= numContours;
	  estimatedSize = estimatedSize / 1024 * 1024; //multiple of 1024
	  if (estimatedSize < 1024)
	    {
	    estimatedSize = 1024;
	    }

	  newPts = vtkPoints::New();
	  newPts->Allocate(estimatedSize,estimatedSize);
	  newVerts = vtkCellArray::New();
	  newVerts->Allocate(estimatedSize,estimatedSize);
	  newLines = vtkCellArray::New();
	  newLines->Allocate(estimatedSize,estimatedSize);
	  newPolys = vtkCellArray::New();
	  newPolys->Allocate(estimatedSize,estimatedSize);
	  cellScalars = vtkScalars::New();
	  cellScalars->Allocate(VTK_CELL_SIZE);
  
   // locator used to merge potentially duplicate points
	  if ( this->Locator == NULL )
		  {
			this->CreateDefaultLocator();
			}
		this->Locator->InitPointInsertion (newPts, input->GetBounds(),estimatedSize);

  // interpolate data along edge
  // if we did not ask for scalars to be computed, don't copy them
		if (!this->ComputeScalars)
		  {
		  outPd->CopyScalarsOff();
		  }
		outPd->InterpolateAllocate(inPd,estimatedSize,estimatedSize);
		outCd->CopyAllocate(inCd,estimatedSize,estimatedSize);

  // If enabled, build a scalar tree to accelerate search
  //
		if ( !this->UseScalarTree )
		  {
		  for (cellId=0; cellId < numCells && !abortExecute; cellId++)
		    {
			  cell = input->GetCell(cellId);
				cellPts = cell->GetPointIds();
			  inScalars->GetScalars(cellPts,cellScalars);

			  if ( ! (cellId % 5000) ) 
				  {
					vtkDebugMacro(<<"Contouring #" << cellId);
					this->UpdateProgress ((float)cellId/numCells);
					if (this->GetAbortExecute())
					  {
					  abortExecute = 1;
					  break;
					  }
					}

				for (i=0; i < numContours; i++)
					{
					cell->Contour(values[i], cellScalars, this->Locator, 
					              newVerts, newLines, newPolys, inPd, outPd,
												inCd, cellId, outCd);

					} // for all contour values
				} // for all cells
			} //if using scalar tree
		else
			{
			if ( this->ScalarTree == NULL )
			  {
			this->ScalarTree = vtkScalarTree::New();
			  }
			this->ScalarTree->SetDataSet(input);
			//
			// Loop over all contour values.  Then for each contour value, 
			// loop over all cells.
			//
			for (i=0; i < numContours; i++)
				{
				for ( this->ScalarTree->InitTraversal(values[i]); 
						(cell=this->ScalarTree->GetNextCell(cellId,cellPts,cellScalars)) != NULL; )
					{
					cell->Contour(values[i], cellScalars, this->Locator, 
						            newVerts, newLines, newPolys, inPd, outPd,
												inCd, cellId, outCd);

					} //for all cells
				} //for all contour values
			} //using scalar tree

		vtkDebugMacro(<<"Created: " 
				          << newPts->GetNumberOfPoints() << " points, " 
					        << newVerts->GetNumberOfCells() << " verts, " 
							    << newLines->GetNumberOfCells() << " lines, " 
								  << newPolys->GetNumberOfCells() << " triangles");
		//
		// Update ourselves.  Because we don't know up front how many verts, lines,
		// polys we've created, take care to reclaim memory. 
		//
		output->SetPoints(newPts);
		newPts->Delete();
		cellScalars->Delete();
  
		if (newVerts->GetNumberOfCells())
			{
			output->SetVerts(newVerts);
			}
		newVerts->Delete();

		if (newLines->GetNumberOfCells())
			{
			output->SetLines(newLines);
			}
		newLines->Delete();

		if (newPolys->GetNumberOfCells())
			{
			output->SetPolys(newPolys);
			}
		newPolys->Delete();

		this->Locator->Initialize();//releases leftover memory
		output->Squeeze();
		} //else (for if vtkUnstructuredGrid)
}

// Specify a spatial locator for merging points. By default, 
// an instance of vtkMergePoints is used.
void vtkContourFilter::SetLocator(vtkPointLocator *locator)
{
  if ( this->Locator == locator ) 
    {
    return;
    }
  if ( this->Locator )
    {
    this->Locator->UnRegister(this);
    this->Locator = NULL;
    }
  if ( locator )
    {
    locator->Register(this);
    }
  this->Locator = locator;
  this->Modified();
}

void vtkContourFilter::CreateDefaultLocator()
{
  if ( this->Locator == NULL )
    {
    this->Locator = vtkMergePoints::New();
    }
}

void vtkContourFilter::PrintSelf(ostream& os, vtkIndent indent)
{
  vtkDataSetToPolyDataFilter::PrintSelf(os,indent);

  os << indent << "Compute Gradients: " << (this->ComputeGradients ? "On\n" : "Off\n");
  os << indent << "Compute Normals: " << (this->ComputeNormals ? "On\n" : "Off\n");
  os << indent << "Compute Scalars: " << (this->ComputeScalars ? "On\n" : "Off\n");
  os << indent << "Use Scalar Tree: " << (this->UseScalarTree ? "On\n" : "Off\n");

  this->ContourValues->PrintSelf(os,indent);

  if ( this->Locator )
    {
    os << indent << "Locator: " << this->Locator << "\n";
    }
  else
    {
    os << indent << "Locator: (none)\n";
    }
}


{'fraction_non_alphanumeric': 0.1486811754086852, 'fraction_numerical': 0.004914251328853676, 'mean_word_length': 3.459525939177102, 'pattern_counts': {'":': 0, '<': 155, '<?xml version=': 0, '>': 245, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '1756870', 'n_tokens_mistral': 7161, 'n_tokens_neox': 6320, 'n_words': 1638}