Home
last modified time | relevance | path

Searched refs:interList (Results 1 – 17 of 17) sorted by relevance

/dports/multimedia/opentoonz/opentoonz-1.5.0/toonz/sources/common/tvectorimage/
H A Dtregionutil.cpp171 it1 != interList.end(); it1++) in cleanIntersectionMarks()
190 it1 != interList.end(); it1++) in cleanNextIntersection()
337 while (it1 != interList.end()) { in doEraseIntersection()
368 it1 = interList.erase(it1); in doEraseIntersection()
667 for (i1 = interList.begin(); i1 != interList.end(); i1++) { in findNearestIntersection()
824 interList.m_strokeList.push_back(item); in insertBranch()
1032 interList.m_strokeList.push_back(item1); in makeIntersection()
1050 interList.m_strokeList.push_back(item1); in makeIntersection()
1054 interList.m_strokeList.push_back(item2); in makeIntersection()
1058 interList.m_strokeList.push_back(item1); in makeIntersection()
[all …]
H A Dtcomputeregions.cpp424 for (p = interList.first(); p; p = p->next()) in cleanIntersectionMarks()
444 for (p = interList.first(); p; p = p->next()) in cleanNextIntersection()
915 for (p1 = interList.first(); p1; p1 = p1->next()) { in findNearestIntersection()
1176 insertBranch(interList, item1, true); in makeEdgeIntersection()
1178 if (!eraseP2a) insertBranch(interList, item2, true); in makeEdgeIntersection()
1182 insertBranch(interList, item1, true); in makeEdgeIntersection()
1191 insertBranch(interList, item1, true); in makeEdgeIntersection()
1197 insertBranch(interList, item1, true); in makeEdgeIntersection()
1206 insertBranch(interList, item1, true); in makeEdgeIntersection()
1212 insertBranch(interList, item1, true); in makeEdgeIntersection()
[all …]
H A Dtsweepboundary.cpp1620 Intersection interList; in makeIntersection() local
1624 interList.m_intersection = s[ii]->getPoint(inter.first); in makeIntersection()
1644 interList.m_strokeList.push_back(item1); in makeIntersection()
1648 interList.m_strokeList.push_back(item2); in makeIntersection()
1652 interList.m_strokeList.push_back(item1); in makeIntersection()
1656 interList.m_strokeList.push_back(item2); in makeIntersection()
1659 return interList; in makeIntersection()
1697 void findNearestIntersection(list<Intersection> &interList) { in findNearestIntersection() argument
1701 for (i1 = interList.begin(); i1 != interList.end(); i1++) { in findNearestIntersection()
1704 if ((*i2).m_nextIntersection != interList.end()) // already set in findNearestIntersection()
[all …]
/dports/math/vtk8/VTK-8.2.0/Filters/General/
H A DvtkBooleanOperationPolyDataFilter.cxx49 vtkIdList* interList, in SortPolyData() argument
66 interList->InsertNextId( cid ); in SortPolyData()
152 vtkSmartPointer< vtkIdList > interList = vtkSmartPointer< vtkIdList >::New(); in RequestData() local
155 this->SortPolyData(pd0, interList, unionList); in RequestData()
168 this->CopyCells(pd0, outputSurface, 0, pointFields, cellFields, interList, in RequestData()
193 interList->Reset(); in RequestData()
196 this->SortPolyData(pd1, interList, unionList); in RequestData()
205 this->CopyCells(pd1, outputSurface, 1, pointFields, cellFields, interList, in RequestData()
/dports/math/vtk6/VTK-6.2.0/Filters/General/
H A DvtkBooleanOperationPolyDataFilter.cxx51 vtkIdList* interList, in SortPolyData() argument
68 interList->InsertNextId( cid ); in SortPolyData()
149 vtkSmartPointer< vtkIdList > interList = vtkSmartPointer< vtkIdList >::New(); in RequestData() local
152 this->SortPolyData(pd0, interList, unionList); in RequestData()
165 this->CopyCells(pd0, outputSurface, 0, pointFields, cellFields, interList, in RequestData()
190 interList->Reset(); in RequestData()
193 this->SortPolyData(pd1, interList, unionList); in RequestData()
202 this->CopyCells(pd1, outputSurface, 1, pointFields, cellFields, interList, in RequestData()
/dports/math/vtk9/VTK-9.1.0/Filters/General/
H A DvtkBooleanOperationPolyDataFilter.cxx141 vtkSmartPointer<vtkIdList> interList = vtkSmartPointer<vtkIdList>::New(); in RequestData() local
144 this->SortPolyData(pd0, interList, unionList); in RequestData()
156 this->CopyCells(pd0, outputSurface, 0, pointFields, cellFields, interList, false); in RequestData()
178 interList->Reset(); in RequestData()
181 this->SortPolyData(pd1, interList, unionList); in RequestData()
189 this->CopyCells(pd1, outputSurface, 1, pointFields, cellFields, interList, in RequestData()
/dports/science/fastcap/fastcap-2.0wr/src/
H A DmulStruct.h119 struct cube **interList; /* explicit interaction list member
H A DmulMats_old.c860 nexti = na->interList[i];
956 ni = nc->interList[j];
H A DmulMats.c945 nexti = na->interList[i];
1043 ni = nc->interList[j];
H A DmulMats_mod.c919 nexti = na->interList[i];
1015 ni = nc->interList[j];
H A DmulSetup.c1030 if(vects > 0) CALLOC(child->interList, vects, cube*, ON, AMSC);
1031 for(j = 0; j < vects; j++) child->interList[j] = cstack[j];
/dports/science/fasthenry/fasthenry-3.0wr/src/fasthenry/
H A DmulStruct.h89 struct cube **interList; /* explicit interaction list member
H A DmulMats.c927 nexti = na->interList[i];
1039 ni = nc->interList[j];
H A DmulSetup.c1206 if(vects > 0) CALLOC(child->interList, vects, cube*, ON, AMSC);
1207 for(j = 0; j < vects; j++) child->interList[j] = cstack[j];
/dports/science/fasthenry/fasthenry-3.0wr/src/zbuf/
H A DmulStruct.h119 struct cube **interList; /* explicit interaction list member
/dports/science/votca/votca-2021.2-18560-gfbe18d971/csg/csg-da5c1dc/src/tools/
H A Dcsg_fmatch.cc573 std::vector<Interaction *> interList =
576 for (Interaction *inter : interList) {
/dports/science/votca/votca-2021.2-18560-gfbe18d971/csg/src/tools/
H A Dcsg_fmatch.cc573 std::vector<Interaction *> interList = in EvalBonded() local
576 for (Interaction *inter : interList) { in EvalBonded()