Home
last modified time | relevance | path

Searched refs:uniqueFound (Results 1 – 4 of 4) sorted by relevance

/dports/math/vtk8/VTK-8.2.0/Common/DataModel/
H A DvtkKdTree.cxx1906 int **uniqueFound = new int * [this->NumberOfRegions]; in BuildMapForDuplicatePoints() local
1908 if (!idCount || !uniqueFound) in BuildMapForDuplicatePoints()
1911 delete [] uniqueFound; in BuildMapForDuplicatePoints()
1923 if (!uniqueFound[i]) in BuildMapForDuplicatePoints()
1926 for (int j=0; j<i; j++) delete [] uniqueFound[j]; in BuildMapForDuplicatePoints()
1927 delete [] uniqueFound; in BuildMapForDuplicatePoints()
1954 delete [] uniqueFound; in BuildMapForDuplicatePoints()
1974 uniqueFound[regionId][idCount[regionId]++] = idx; in BuildMapForDuplicatePoints()
2005 uniqueFound[regionId][idCount[regionId]++] = idx2; in BuildMapForDuplicatePoints()
2017 delete [] uniqueFound[i]; in BuildMapForDuplicatePoints()
[all …]
/dports/math/vtk9/VTK-9.1.0/Common/DataModel/
H A DvtkKdTree.cxx1891 int** uniqueFound = new int*[this->NumberOfRegions]; in BuildMapForDuplicatePoints() local
1893 if (!idCount || !uniqueFound) in BuildMapForDuplicatePoints()
1896 delete[] uniqueFound; in BuildMapForDuplicatePoints()
1908 if (!uniqueFound[i]) in BuildMapForDuplicatePoints()
1912 delete[] uniqueFound[j]; in BuildMapForDuplicatePoints()
1913 delete[] uniqueFound; in BuildMapForDuplicatePoints()
1940 delete[] uniqueFound[i]; in BuildMapForDuplicatePoints()
1941 delete[] uniqueFound; in BuildMapForDuplicatePoints()
1961 uniqueFound[regionId][idCount[regionId]++] = idx; in BuildMapForDuplicatePoints()
2004 delete[] uniqueFound[i]; in BuildMapForDuplicatePoints()
[all …]
/dports/math/vtk6/VTK-6.2.0/Common/DataModel/
H A DvtkKdTree.cxx1900 int **uniqueFound = new int * [this->NumberOfRegions]; in BuildMapForDuplicatePoints() local
1902 if (!idCount || !uniqueFound) in BuildMapForDuplicatePoints()
1905 delete [] uniqueFound; in BuildMapForDuplicatePoints()
1917 if (!uniqueFound[i]) in BuildMapForDuplicatePoints()
1920 for (int j=0; j<i; j++) delete [] uniqueFound[j]; in BuildMapForDuplicatePoints()
1921 delete [] uniqueFound; in BuildMapForDuplicatePoints()
1948 delete [] uniqueFound; in BuildMapForDuplicatePoints()
1968 uniqueFound[regionId][idCount[regionId]++] = idx; in BuildMapForDuplicatePoints()
1999 uniqueFound[regionId][idCount[regionId]++] = idx2; in BuildMapForDuplicatePoints()
2011 delete [] uniqueFound[i]; in BuildMapForDuplicatePoints()
[all …]
/dports/graphics/opensubdiv/OpenSubdiv-3_4_4/opensubdiv/vtr/
H A DfvarLevel.cpp378 int* uniqueFound = std::find(uniqueBegin, uniqueEnd, vValues[i]); in completeTopologyFromFaceValues() local
379 if (uniqueFound == uniqueEnd) { in completeTopologyFromFaceValues()
382 vValueSiblings[i] = (Sibling) (uniqueFound - uniqueBegin); in completeTopologyFromFaceValues()