Home
last modified time | relevance | path

Searched refs:nEdge (Results 1 – 25 of 73) sorted by relevance

123

/dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/livarot/
H A DPathStroke.cpp441 dest->ebData[nEdge].tSt=dest->ebData[nEdge].tEn=tID; in DoLeftJoin()
469 dest->ebData[nEdge].tSt=dest->ebData[nEdge].tEn=tID; in DoLeftJoin()
499 dest->ebData[nEdge].tSt=dest->ebData[nEdge].tEn=tID; in DoLeftJoin()
505 dest->ebData[nEdge].tSt=dest->ebData[nEdge].tEn=tID; in DoLeftJoin()
520 dest->ebData[nEdge].tSt=dest->ebData[nEdge].tEn=tID; in DoLeftJoin()
526 dest->ebData[nEdge].tSt=dest->ebData[nEdge].tEn=tID; in DoLeftJoin()
532 dest->ebData[nEdge].tSt=dest->ebData[nEdge].tEn=tID; in DoLeftJoin()
555 dest->ebData[nEdge].tSt=dest->ebData[nEdge].tEn=tID; in DoLeftJoin()
585 dest->ebData[nEdge].tSt=dest->ebData[nEdge].tEn=tID; in DoRightJoin()
665 dest->ebData[nEdge].tSt=dest->ebData[nEdge].tEn=tID; in DoRightJoin()
[all …]
/dports/cad/repsnapper/repsnapper-2.5a4/libraries/amf/amftools-code/src/
H A DnEdge.cpp15 nEdge::nEdge(void) in nEdge() function in nEdge
21 nEdge::~nEdge(void) in ~nEdge()
25 nEdge& nEdge::operator=(const nEdge& In) in operator =()
40 void nEdge::Clear(void) in Clear()
53 bool nEdge::WriteXML(CXmlStreamWrite* pXML, std::string* pMessage) in WriteXML()
71 bool nEdge::ReadXML(CXmlStreamRead* pXML, nAmf* pAmf, bool StrictLoad, std::string* pMessage) in ReadXML()
90 bool nEdge::CheckValid(nAmf* pAmf, bool FixNode, std::string* pMessage) in CheckValid()
H A DnVertices.cpp56 for(std::vector<nEdge>::iterator it = EdgeList.begin(); it != EdgeList.end(); it++){ in WriteXML()
79 nEdge tmpEdge; in ReadXML()
101 for (std::vector<nEdge>::iterator it = EdgeList.begin(); it!=EdgeList.end(); it++){ in CheckValid()
151 for (std::vector<nEdge>::iterator it = EdgeList.begin(); it!=EdgeList.end(); it++){ in Rotate()
/dports/games/openjk/OpenJK-07675e2/code/Ragl/
H A Dgraph_triangulate.h245 int nEdge; in floor_shape() local
274 nEdge= mEdges.alloc(); in floor_shape()
276 mEdges[nEdge].mA = R; in floor_shape()
277 mEdges[nEdge].mB = L; in floor_shape()
551 if (nEdge==0)
553 nEdge= mEdges.alloc();
558 mEdges[nEdge].mA = A;
559 mEdges[nEdge].mB = B;
562 mEdges[nEdge].mFlips = 0;
591 if (mEdges[nEdge].mA==A)
[all …]
/dports/cad/repsnapper/repsnapper-2.5a4/libraries/amf/amftools-code/include/
H A DnEdge.h20 class nEdge
23 nEdge(void);
24 ~nEdge(void);
25 nEdge(const nEdge& In) {*this = In;} //copy constructor in nEdge() function
26 nEdge& operator=(const nEdge& In); //overload Equals
H A DnVertices.h42 std::vector<nEdge> EdgeList;
48 int AddEdge(nEdge& EIn){EdgeList.push_back(EIn); return EdgeList.size()-1;} //returns index in AddEdge()
/dports/databases/grass7/grass-7.8.6/lib/vector/dglib/
H A Dedgemgmt-template.c32 dglInt32_t nEdge, in DGL_ADD_EDGE_FUNC() argument
207 findEdge.nKey = nEdge; in DGL_ADD_EDGE_FUNC()
225 pEdgeset[DGL_EDGESET_EDGECOUNT(pEdgeset) + 1] = nEdge; in DGL_ADD_EDGE_FUNC()
250 DGL_EDGE_ID(pEdge) = nEdge; in DGL_ADD_EDGE_FUNC()
279 return DGL_ADD_EDGE_FUNC(pgraph, nTail, nHead, nCost, nEdge, in DGL_ADD_EDGE_FUNC()
287 int DGL_DEL_EDGE_FUNC(dglGraph_s * pgraph, dglInt32_t nEdge) in DGL_DEL_EDGE_FUNC() argument
306 findEdgeItem.nKey = nEdge; in DGL_DEL_EDGE_FUNC()
373 if (id == nEdge) { in DGL_GET_EDGE_FUNC()
376 else if (nEdge < id) { in DGL_GET_EDGE_FUNC()
379 else if (nEdge > id) { in DGL_GET_EDGE_FUNC()
[all …]
H A Dnodemgmt-template.c64 dglInt32_t nEdge) in DGL_DEL_NODE_OUTEDGE_FUNC() argument
82 if (DGL_EDGE_ID(pnEdge) == nEdge) { in DGL_DEL_NODE_OUTEDGE_FUNC()
95 if (pnEdgeset[1 + i2] != nEdge) { in DGL_DEL_NODE_OUTEDGE_FUNC()
130 dglInt32_t nEdge) in DGL_DEL_NODE_INEDGE_FUNC() argument
148 if (DGL_EDGE_ID(pnEdge) == nEdge) { in DGL_DEL_NODE_INEDGE_FUNC()
161 if (pnEdgeset[1 + i2] != nEdge) { in DGL_DEL_NODE_INEDGE_FUNC()
H A Dgraph_v2.h124 dglInt32_t nEdge,
199 dglInt32_t nEdge);
201 dglInt32_t nEdge);
/dports/graphics/yafaray/libYafaRay-3.5.1/src/yafraycore/
H A Dkdtree.cc311 int nEdge; in minimalCost() local
317 nEdge=0; in minimalCost()
326 ++nEdge; in minimalCost()
332 nEdge += 2; in minimalCost()
342 ++nEdge; in minimalCost()
348 nEdge += 2; in minimalCost()
372 split.nEdge = nEdge; in minimalCost()
387 split.bestOffset = nEdge-1; in minimalCost()
388 split.nEdge = nEdge; in minimalCost()
395 for (int i = 0; i < nEdge; ++i) { in minimalCost()
[all …]
H A Dray_kdtree.cc324 int nEdge; in minimalCost() local
330 nEdge=0; in minimalCost()
339 ++nEdge; in minimalCost()
345 nEdge += 2; in minimalCost()
355 ++nEdge; in minimalCost()
361 nEdge += 2; in minimalCost()
385 split.nEdge = nEdge; in minimalCost()
400 split.bestOffset = nEdge-1; in minimalCost()
401 split.nEdge = nEdge; in minimalCost()
408 for (int i = 0; i < nEdge; ++i) { in minimalCost()
[all …]
/dports/editors/libreoffice/libreoffice-7.2.6.2/svx/source/table/
H A Dtablehandles.cxx65 void TableEdgeHdl::SetEdge( sal_Int32 nEdge, sal_Int32 nStart, sal_Int32 nEnd, TableEdgeState eStat… in SetEdge() argument
67 if( (nEdge >= 0) && (nEdge <= sal::static_int_cast<sal_Int32>(maEdges.size())) ) in SetEdge()
69 maEdges[nEdge].mnStart = nStart; in SetEdge()
70 maEdges[nEdge].mnEnd = nEnd; in SetEdge()
71 maEdges[nEdge].meState = eState; in SetEdge()
H A Dsvdotable.cxx591 if( !((nEdge >= 0) && mxTable.is())) in DragEdge()
599 if (nEdge <= getRowCount()) in DragEdge()
601 sal_Int32 nHeight = mpLayouter->getRowHeight( (!nEdge)?nEdge:(nEdge-1) ); in DragEdge()
602 if(nEdge==0) in DragEdge()
607 …Reference< XPropertySet > xRowSet( xRows->getByIndex( (!nEdge)?nEdge:(nEdge-1) ), UNO_QUERY_THROW … in DragEdge()
622 if (nEdge <= getColumnCount()) in DragEdge()
632 nWidth = mpLayouter->getColumnWidth( (!nEdge)?nEdge:(nEdge-1) ); in DragEdge()
636 if(bRTL && nEdge<getColumnCount()) in DragEdge()
641 else if(!bRTL && nEdge>0) in DragEdge()
647 if( nEdge > 0 && nEdge < mxTable->getColumnCount() ) in DragEdge()
[all …]
H A Dtablertfimporter.cxx103 void InsertColumnEdge( sal_Int32 nEdge );
260 void SdrTableRTFParser::InsertColumnEdge( sal_Int32 nEdge ) in InsertColumnEdge() argument
262 auto aNextEdge = std::lower_bound( maLastEdge, maColumnEdges.end(), nEdge ); in InsertColumnEdge()
264 if ( aNextEdge == maColumnEdges.end() || nEdge != *aNextEdge ) in InsertColumnEdge()
266 maLastEdge = maColumnEdges.insert( aNextEdge , nEdge ); in InsertColumnEdge()
267 mnLastEdge = nEdge; in InsertColumnEdge()
/dports/editors/libreoffice6/libreoffice-6.4.7.2/svx/source/table/
H A Dtablehandles.cxx68 void TableEdgeHdl::SetEdge( sal_Int32 nEdge, sal_Int32 nStart, sal_Int32 nEnd, TableEdgeState eStat… in SetEdge() argument
70 if( (nEdge >= 0) && (nEdge <= sal::static_int_cast<sal_Int32>(maEdges.size())) ) in SetEdge()
72 maEdges[nEdge].mnStart = nStart; in SetEdge()
73 maEdges[nEdge].mnEnd = nEnd; in SetEdge()
74 maEdges[nEdge].meState = eState; in SetEdge()
H A Dsvdotable.cxx586 if( (nEdge >= 0) && mxTable.is()) try in DragEdge()
591 if (nEdge <= getRowCount()) in DragEdge()
593 sal_Int32 nHeight = mpLayouter->getRowHeight( (!nEdge)?nEdge:(nEdge-1) ); in DragEdge()
594 if(nEdge==0) in DragEdge()
599 …Reference< XPropertySet > xRowSet( xRows->getByIndex( (!nEdge)?nEdge:(nEdge-1) ), UNO_QUERY_THROW … in DragEdge()
613 if (nEdge <= getColumnCount()) in DragEdge()
623 nWidth = mpLayouter->getColumnWidth( (!nEdge)?nEdge:(nEdge-1) ); in DragEdge()
627 if(bRTL && nEdge<getColumnCount()) in DragEdge()
632 else if(!bRTL && nEdge>0) in DragEdge()
638 if( nEdge > 0 && nEdge < mxTable->getColumnCount() ) in DragEdge()
[all …]
H A Dtablertfimporter.cxx95 void InsertColumnEdge( sal_Int32 nEdge );
252 void SdrTableRTFParser::InsertColumnEdge( sal_Int32 nEdge ) in InsertColumnEdge() argument
254 auto aNextEdge = std::lower_bound( maLastEdge, maColumnEdges.end(), nEdge ); in InsertColumnEdge()
256 if ( aNextEdge == maColumnEdges.end() || nEdge != *aNextEdge ) in InsertColumnEdge()
258 maLastEdge = maColumnEdges.insert( aNextEdge , nEdge ); in InsertColumnEdge()
259 mnLastEdge = nEdge; in InsertColumnEdge()
/dports/math/saga/saga-8.1.3/saga-gis/src/tools/terrain_analysis/ta_cliffmetrics/CliffMetrics/
H A Dcoast.cpp61 void CCoast::SetStartEdge(int const nEdge) in SetStartEdge() argument
63 m_nStartEdge = nEdge; in SetStartEdge()
72 void CCoast::SetEndEdge(int const nEdge) in SetEndEdge() argument
74 m_nEndEdge = nEdge; in SetEndEdge()
/dports/science/py-pymol/pymol-open-source-2.4.0/layer3/
H A DEditor.cpp1172 int nEdge; in draw_bond() local
1179 nEdge = 50; in draw_bond()
1180 if(nEdge < 3) in draw_bond()
1181 nEdge = 3; in draw_bond()
1315 int nEdge; in draw_globe() local
1325 nEdge = 50; in draw_globe()
1326 if(nEdge < 3) in draw_globe()
1327 nEdge = 3; in draw_globe()
1397 c = a % nEdge; in draw_globe()
1422 c = a % nEdge; in draw_globe()
[all …]
/dports/cad/opencascade/opencascade-7.6.0/src/TopoDSToStep/
H A DTopoDSToStep_MakeStepWire.cxx244 for (Standard_Integer nEdge = 1; nEdge <= sbwd->NbEdges(); nEdge++) { in Init() local
246 CurrentEdge = sbwd->Edge(nEdge); in Init()
/dports/math/dune-uggrid/dune-uggrid-bc2d1229420367563410ce9e519f5ff82b45266f/dune/uggrid/gm/
H A Dmgio.cc501 pge->nEdge = lge[i].nEdge = intList[s++]; in Read_GE_Elements()
503 if (pge->nEdge>0 || pge->nSide>0) in Read_GE_Elements()
505 if (Bio_Read_mint(2*pge->nEdge+4*pge->nSide,intList)) in Read_GE_Elements()
510 for (j=0; j<pge->nEdge; j++) in Read_GE_Elements()
563 intList[s++] = lge[i].nEdge = pge->nEdge; in Write_GE_Elements()
565 for (j=0; j<pge->nEdge; j++) in Write_GE_Elements()
983 m = 3*lge[ge].nEdge; in Read_pinfo()
985 for (i=0; i<lge[ge].nEdge; i++) in Read_pinfo()
1040 for (i=0; i<lge[ge].nEdge; i++) in Write_pinfo()
/dports/science/py-pymol/pymol-open-source-2.4.0/layer2/
H A DRepCylBond.cpp941 static void RepCylinderImmediate(const float *v1arg, const float *v2arg, int nEdge, in RepCylinderImmediate() argument
1008 for(c = nEdge; c >= 0; c--) { in RepCylinderImmediate()
1009 x = (float) radius * cos(c * 2 * PI / nEdge); in RepCylinderImmediate()
1010 y = (float) radius * sin(c * 2 * PI / nEdge); in RepCylinderImmediate()
1044 for(c = nEdge; c >= 0; c--) { in RepCylinderImmediate()
1045 x = (float) radius * cos(c * 2 * PI / nEdge); in RepCylinderImmediate()
1046 y = (float) radius * sin(c * 2 * PI / nEdge); in RepCylinderImmediate()
1077 for(c = 0; c <= nEdge; c++) { in RepCylinderImmediate()
1078 x = (float) radius * cos(c * 2 * PI / nEdge); in RepCylinderImmediate()
1079 y = (float) radius * sin(c * 2 * PI / nEdge); in RepCylinderImmediate()
[all …]
/dports/science/elmerfem/elmerfem-release-9.0/elmerice/Solvers/
H A DFabricSolve.F901108 SUBROUTINE FindParentUVW( Edge, nEdge, Parent, nParent, U, V, W, Basis )
1112 INTEGER :: nEdge, nParent local
1116 REAL(KIND=dp) :: NodalParentU(nEdge),NodalParentV(nEdge),NodalParentW(nEdge)
1118 DO i = 1,nEdge
1128 U = SUM( Basis(1:nEdge) * NodalParentU(1:nEdge) )
1129 V = SUM( Basis(1:nEdge) * NodalParentV(1:nEdge) )
1130 W = SUM( Basis(1:nEdge) * NodalParentW(1:nEdge) )
1149 INTEGER :: i, j, p, q, dim, t, nEdge, nParent local
/dports/math/freefem++/FreeFem-sources-4.6/src/femlib/
H A DMeshLn.cpp325 int nv=-1,nEdge=-1,nPts=-1; in load() local
327 nEdge=GmfStatKwd(inm,GmfEdges); // segment elements in load()
329 this->set(nv,nEdge,nPts); in load()
331 if(nEdge == 0) { in load()
337 …<< ", num Edge elts:= " << nEdge << ", num vertice:= " << nv << " num Points boundaries:= " << nPt… in load()
342 if( nv<=0 && (nEdge <=0 || nPts <0) ) { in load()
367 for(int i=0;i<nEdge;++i) { in load()
384 for(int i=0;i<nEdge;++i) { in load()
/dports/science/py-pymol/pymol-open-source-2.4.0/layer0/
H A DTriangle.cpp66 int nEdge; member
702 I->edge[I->nEdge].vert3 = i2; in TriangleAdd()
703 I->edge[I->nEdge].tri1 = I->nTri; in TriangleAdd()
707 I->nEdge++; in TriangleAdd()
722 I->edge[I->nEdge].vert3 = i1; in TriangleAdd()
723 I->edge[I->nEdge].tri1 = I->nTri; in TriangleAdd()
727 I->nEdge++; in TriangleAdd()
742 I->edge[I->nEdge].vert3 = i0; in TriangleAdd()
743 I->edge[I->nEdge].tri1 = I->nTri; in TriangleAdd()
747 I->nEdge++; in TriangleAdd()
[all …]

123