/dports/emulators/mess/mame-mame0226/3rdparty/glm/glm/detail/ |
H A D | type_gentype.inl | 11 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::col_size() 13 return cT; 17 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::row_size() 23 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::value_size() 25 return rT * cT; 31 return rT == 1 && cT == 1; 94 typename base<vT, cT, rT, pT>::size_type stop = cT < rT ? cT : rT; 156 typename base<vT, cT, rT, pT>::col_type& base<vT, cT, rT, pT>::operator[] argument 177 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator= argument 187 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator+= argument [all …]
|
/dports/audio/faust/faust-2.37.3/architecture/smartKeyboard/android/app/oboe/samples/RhythmGame/third_party/glm/detail/ |
H A D | type_gentype.inl | 11 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::col_size() 13 return cT; 17 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::row_size() 23 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::value_size() 25 return rT * cT; 31 return rT == 1 && cT == 1; 94 typename base<vT, cT, rT, pT>::size_type stop = cT < rT ? cT : rT; 156 typename base<vT, cT, rT, pT>::col_type& base<vT, cT, rT, pT>::operator[] argument 177 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator= argument 187 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator+= argument [all …]
|
/dports/graphics/libprojectm/projectm-3.1.12/vendor/glm/detail/ |
H A D | type_gentype.inl | 11 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::col_size() 13 return cT; 17 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::row_size() 23 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::value_size() 25 return rT * cT; 94 typename base<vT, cT, rT, pT>::size_type stop = cT < rT ? cT : rT; 156 typename base<vT, cT, rT, pT>::col_type& base<vT, cT, rT, pT>::operator[] argument 177 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator= argument 187 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator+= argument 203 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator+= argument [all …]
|
/dports/games/solarus/solarus-f43727b232b3ed13d98440a845e2a29e470e4f0d/libraries/win32/mingw32/include/glm/detail/ |
H A D | type_gentype.inl | 11 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::col_size() 13 return cT; 17 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::row_size() 23 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::value_size() 25 return rT * cT; 94 typename base<vT, cT, rT, pT>::size_type stop = cT < rT ? cT : rT; 156 typename base<vT, cT, rT, pT>::col_type& base<vT, cT, rT, pT>::operator[] argument 177 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator= argument 187 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator+= argument 203 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator+= argument [all …]
|
/dports/emulators/mame/mame-mame0226/3rdparty/glm/glm/detail/ |
H A D | type_gentype.inl | 11 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::col_size() 13 return cT; 17 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::row_size() 23 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::value_size() 25 return rT * cT; 31 return rT == 1 && cT == 1; 94 typename base<vT, cT, rT, pT>::size_type stop = cT < rT ? cT : rT; 156 typename base<vT, cT, rT, pT>::col_type& base<vT, cT, rT, pT>::operator[] argument 177 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator= argument 187 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator+= argument [all …]
|
/dports/graphics/nanort/nanort-b1feea8/examples/common/glm/glm/detail/ |
H A D | type_gentype.inl | 11 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::col_size() 13 return cT; 17 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::row_size() 23 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::value_size() 25 return rT * cT; 31 return rT == 1 && cT == 1; 94 typename base<vT, cT, rT, pT>::size_type stop = cT < rT ? cT : rT; 156 typename base<vT, cT, rT, pT>::col_type& base<vT, cT, rT, pT>::operator[] argument 177 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator= argument 187 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator+= argument [all …]
|
/dports/games/dustrac/DustRacing2D-ae380b8/src/game/MiniCore/src/Graphics/contrib/glm/ogl-math/glm/core/ |
H A D | type_gentype.inl | 36 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::col_size() 38 return cT; 42 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::row_size() 48 typename base<vT, cT, rT, pT>::size_type base<vT, cT, rT, pT>::value_size() 50 return rT * cT; 119 typename base<vT, cT, rT, pT>::size_type stop = cT < rT ? cT : rT; 181 typename base<vT, cT, rT, pT>::col_type& base<vT, cT, rT, pT>::operator[] argument 202 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator= argument 212 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator+= argument 228 typename base<vT, cT, rT, pT>::class_type& base<vT, cT, rT, pT>::operator+= argument [all …]
|
/dports/math/psurface/psurface-2.0.0-13-gb5b6825/ |
H A D | IntersectionPrimitiveCollector.cpp | 32 cT.insertExtraEdges(); in collect() 34 for (size_t k=0; k<cT.nodes.size(); k++) in collect() 35 cT.makeCyclicGeometrically(cT.nodes[k]); in collect() 43 …ename PlaneParam<ctype>::DirectedEdgeIterator cE = cT.getDirectedEdgeIterator(cT.edgePoints[k][l],… in collect() 52 cT.makeCyclicGeometrically(cT.nodes[from]); in collect() 53 cT.makeCyclicGeometrically(cT.nodes[to]); in collect() 64 cT.makeCyclicGeometrically(cT.nodes[k]); in collect() 71 if (!cT.nodes[cT.edgePoints[k][l]].isOnCorner()) { in collect() 72 cT.nodes[cT.edgePoints[k][l]].setDomainEdge(k); in collect() 73 cT.nodes[cT.edgePoints[k][l]].setDomainEdgePosition(l); in collect() [all …]
|
H A D | AmiraMeshIO.cpp | 125 int numEdges = cT.getNumRegularEdges(); in writeAmiraMesh() 131 numNodesAndEdgesArray[11*i+4] = cT.patch; in writeAmiraMesh() 137 numNodesAndEdgesArray[11*i+8] = cT.nodes[cT.cornerNode(0)].getNodeNumber(); in writeAmiraMesh() 138 numNodesAndEdgesArray[11*i+9] = cT.nodes[cT.cornerNode(1)].getNodeNumber(); in writeAmiraMesh() 139 numNodesAndEdgesArray[11*i+10] = cT.nodes[cT.cornerNode(2)].getNodeNumber(); in writeAmiraMesh() 145 … numEdgePoints += cT.edgePoints[0].size() + cT.edgePoints[1].size() + cT.edgePoints[2].size() - 6; in writeAmiraMesh() 177 newIdx[cT.cornerNode(0)] = 0; in writeAmiraMesh() 178 newIdx[cT.cornerNode(1)] = 1; in writeAmiraMesh() 179 newIdx[cT.cornerNode(2)] = 2; in writeAmiraMesh() 198 if (cT.nodes[cN].isTOUCHING_NODE()){ in writeAmiraMesh() [all …]
|
H A D | PSurface.cpp | 125 int edge = cT.nodes[cN].getDomainEdge(); in getOtherEndNode() 129 const int cE = cT.getOppositeEdge(cT.vertices[(edge+2)%3]); in getOtherEndNode() 169 != cT.nodes[cT.edgePoints[edge][edgePos]].getNodeNumber()) { in getOtherEndNode() 209 for (int i=0; i<cT.nodes.size(); i++){ in getNumTrueNodes() 240 …StaticVector<ctype,3> p0(surface->points[cT.points[0]][0],surface->points[cT.points[0]][1],surface… in imagePos() 241 …StaticVector<ctype,3> p1(surface->points[cT.points[1]][0],surface->points[cT.points[1]][1],surface… in imagePos() 242 …StaticVector<ctype,3> p2(surface->points[cT.points[2]][0],surface->points[cT.points[2]][1],surface… in imagePos() 312 int numNodes = cT.nodes.size(); in setupOriginalSurface() 316 Node<ctype>& cN = cT.nodes[i]; in setupOriginalSurface() 937 int corner = cT.getCorner(v); in getNodeBundleAtVertex() [all …]
|
H A D | Hdf5IO.cpp | 283 num_nodes_and_edges_array[i][8] = cT.nodes[cT.cornerNode(0)].getNodeNumber(); in writeHdf5Data() 284 num_nodes_and_edges_array[i][9] = cT.nodes[cT.cornerNode(1)].getNodeNumber(); in writeHdf5Data() 285 num_nodes_and_edges_array[i][10] = cT.nodes[cT.cornerNode(2)].getNodeNumber(); in writeHdf5Data() 292 … numEdgePoints += cT.edgePoints[0].size() + cT.edgePoints[1].size() + cT.edgePoints[2].size() - 6; in writeHdf5Data() 514 num_nodes_and_edges_array[i][8] = cT.nodes[cT.cornerNode(0)].getNodeNumber(); in writeBaseHdf5Data() 515 num_nodes_and_edges_array[i][9] = cT.nodes[cT.cornerNode(1)].getNodeNumber(); in writeBaseHdf5Data() 516 num_nodes_and_edges_array[i][10] = cT.nodes[cT.cornerNode(2)].getNodeNumber(); in writeBaseHdf5Data() 522 … numEdgePoints += cT.edgePoints[0].size() + cT.edgePoints[1].size() + cT.edgePoints[2].size() - 6; in writeBaseHdf5Data() 552 newIdxlocal[cT.cornerNode(0)] = 0; in writeBaseHdf5Data() 553 newIdxlocal[cT.cornerNode(1)] = 1; in writeBaseHdf5Data() [all …]
|
H A D | PSurfaceFactory.cpp | 181 cT.nodes.push_back(Node<ctype>()); in addCornerNode() 183 return cT.nodes.size()-1; in addCornerNode() 232 cT.nodes.push_back(Node<ctype>()); in addBoundaryNode() 234 result[0].idx = cT.nodes.size()-1; in addBoundaryNode() 236 cT.nodes.back().setDomainEdge(edge); in addBoundaryNode() 247 cT.nodes.push_back(Node<ctype>()); in addTouchingNode() 250 cT.nodes.back().setDomainEdge(edge); in addTouchingNode() 251 return cT.nodes.size()-1; in addTouchingNode() 293 cT.addEdge(p[0], p[1]); in addParTriangle() 295 cT.addEdge(p[1], p[2]); in addParTriangle() [all …]
|
H A D | CircularPatch.cpp | 39 const DomainTriangle* cT = triangles[i]; 44 const DomainEdge* cE = par->findEdge(cT->points[j], cT->points[(j+1)%3]); 55 if (cT->dihedralAngle(cE->triangles[k]) < threshold) 64 if (triangles[k]->isConnectedTo(cT->points[j]) && 65 triangles[k]->isConnectedTo(cT->points[(j+1)%3])) { 67 if (cT->dihedralAngle(triangles[k]) < threshold) 114 const DomainTriangle<ctype>& cT = par->triangles(triangles[j]); 117 triPoints[0] = par->vertices(cT.vertices[0]); 118 triPoints[1] = par->vertices(cT.vertices[1]); 119 triPoints[2] = par->vertices(cT.vertices[2]); [all …]
|
H A D | PSurfaceSmoother.cpp | 149 for (DomainTriangle* cT=par->triangles.first(); cT; cT=par->triangles.succ(cT)) in applyVertexRelaxation() 293 DomainTriangle* cT = fullStarTris[i]; in applyVertexRelaxation() 296 if (cT->points[0]==centerPoint) in applyVertexRelaxation() 298 else if (cT->points[1]==centerPoint) in applyVertexRelaxation() 312 for (k=0; k<cT->edgePoints[j].size(); k++) in applyVertexRelaxation() 333 cT->edgePoints[0+offset][0] = localCenterNode; in applyVertexRelaxation() 346 cT->nodes.resize(numTriNodes); in applyVertexRelaxation() 359 cT->nodes[j].neighbors[k] = offArr[cT->nodes[j].neighbors[k]]; in applyVertexRelaxation() 362 for (k=0; k<cT->edgePoints[j].size(); k++) in applyVertexRelaxation() 363 cT->edgePoints[j][k] = offArr[cT->edgePoints[j][k]]; in applyVertexRelaxation() [all …]
|
H A D | DomainPolygon.cpp | 59 cT.removeExtraEdges(); in mergeTriangle() 112 nodes.push_back(cT.nodes[k]); in mergeTriangle() 513 cT.nodes[j].neighbors(k) = offArr[cT.nodes[j].neighbors(k)]; in triangulate() 517 cT.edgePoints[j][k] = offArr[cT.edgePoints[j][k]]; in triangulate() 528 const Node<float>& nA = cT.nodes[cT.edgePoints[2][j]]; in triangulate() 529 const Node<float>& nB = cT.nodes[cT.edgePoints[2][j+2]]; in triangulate() 545 if (std::isnan(cT.nodes[j].domainPos()[0]) || std::isnan(cT.nodes[j].domainPos()[1])) { in triangulate() 554 cT.adjustTouchingNodes(); in triangulate() 570 cT.nodes = nodes; in triangulate() 586 if (std::isnan(cT.nodes[j].domainPos()[0]) || std::isnan(cT.nodes[j].domainPos()[1])) { in triangulate() [all …]
|
/dports/math/ogdf/OGDF/src/ogdf/planarity/ |
H A D | EmbedderMinDepthMaxFace.cpp | 70 node cT = e->source(); in doCall() local 74 for(adjEntry adjCT : cT->adjEntries) { in doCall() 76 if (e2->target() != cT) in doCall() 105 node cT = e->source(); in doCall() local 113 if (e2->target() != cT) in doCall() 176 node cT = e->source(); in bottomUpTraversal() local 308 node cT = e_bT_cT->source(); in topDownTraversal() local 480 node cT = e_bT_cT->source(); in topDownTraversal() local 604 const node& cT, in embedBlock() argument 609 if (cT != nullptr) in embedBlock() [all …]
|
H A D | EmbedderMaxFace.cpp | 66 node cT = e->source(); in doCall() local 72 for(adjEntry adjCT : cT->adjEntries) { in doCall() 75 if (e2->target() != cT) in doCall() 113 node cT = e->source(); in computeBlockGraphs() local 114 for(adjEntry adjCT : cT->adjEntries) { in computeBlockGraphs() 116 if (e2->source() == cT) in computeBlockGraphs() 173 node cT = nullptr; in embedBlock() local 174 embedBlock(bT, cT, after); in embedBlock() 180 const node& cT, in embedBlock() argument 185 if (cT != nullptr) in embedBlock() [all …]
|
H A D | EmbedderMinDepth.cpp | 71 node cT = e->source(); in doCall() local 77 if (e2->target() != cT) in doCall() 133 node cT = e->source(); in computeBlockGraphs() local 136 if (e2->source() == cT) in computeBlockGraphs() 170 node cT = e->source(); in bottomUpTraversal() local 460 node cT = e_bT_cT->source(); in topDownTraversal() local 536 node cT = nullptr; in embedBlock() local 537 embedBlock(bT, cT, after); in embedBlock() 543 const node& cT, in embedBlock() argument 548 if (cT != nullptr) in embedBlock() [all …]
|
H A D | EmbedderMaxFaceLayers.cpp | 40 const node& cT, in embedBlock() argument 45 if (cT != nullptr) in embedBlock() 46 cH = pBCTree->cutVertex(cT, bT); in embedBlock() 57 cT, in embedBlock()
|
H A D | EmbedderMinDepthMaxFaceLayers.cpp | 39 const node& cT, in embedBlock() argument 44 if (cT != nullptr) in embedBlock() 45 cH = pBCTree->cutVertex(cT, bT); in embedBlock() 48 if (cT != nullptr && md_M_B[bT].size() == 1 && *(md_M_B[bT].begin()) == cH) in embedBlock() 95 cT, in embedBlock()
|
/dports/graphics/krita/krita-4.4.8/plugins/filters/colors/ |
H A D | kis_minmax_filters.cpp | 91 KoChannelInfo::enumChannelValueType cT = cs->channels()[0]->channelValueType(); in processImpl() local 92 if (cT == KoChannelInfo::UINT8 || cT == KoChannelInfo::INT8) { in processImpl() 94 } else if (cT == KoChannelInfo::UINT16 || cT == KoChannelInfo::INT16) { in processImpl() 96 } else if (cT == KoChannelInfo::FLOAT32) { in processImpl() 128 KoChannelInfo::enumChannelValueType cT = cs->channels()[0]->channelValueType(); in processImpl() local 129 if (cT == KoChannelInfo::UINT8 || cT == KoChannelInfo::INT8) { in processImpl() 131 } else if (cT == KoChannelInfo::UINT16 || cT == KoChannelInfo::INT16) { in processImpl() 133 } else if (cT == KoChannelInfo::FLOAT32) { in processImpl()
|
/dports/science/madness/madness-ebb3fd7/src/madness/tensor/mtxmq_graveyard/ |
H A D | mtxmq.h | 55 template <typename aT, typename bT, typename cT> 58 const cT one = 1.0; // alpha in *gemm in mTxmq() 59 const cT zero = 0.0; // beta in *gemm in mTxmq() 72 template <typename aT, typename bT, typename cT> 95 template <typename aT, typename bT, typename cT> 97 cT* c, const aT* a, const bT* b) { in mTxmq_padding() 103 cT* c_buf = c; in mTxmq_padding() 106 c_buf = (cT*)malloc(sizeof(cT)*dimi*effj); in mTxmq_padding() 122 cT* c_work = c_buf; in mTxmq_padding() 137 cT* ct = c_buf; in mTxmq_padding() [all …]
|
/dports/science/madness/madness-ebb3fd7/src/madness/tensor/ |
H A D | mxm.h | 193 const cT one = 1.0; // alpha in *gemm in mxm() 206 const cT one = 1.0; // alpha in *gemm in mTxm() 219 const cT one = 1.0; // alpha in *gemm in mxmT() 232 const cT one = 1.0; // alpha in *gemm in mTxmT() 259 const cT one = 1.0; // alpha in *gemm 260 const cT zero = 0.0; // beta in *gemm 506 cT* c_buf = c; in mTxmq_padding() 509 c_buf = (cT*)malloc(sizeof(cT)*dimi*effj); in mTxmq_padding() 525 cT* c_work = c_buf; in mTxmq_padding() 540 cT* ct = c_buf; in mTxmq_padding() [all …]
|
/dports/math/R-cran-robustbase/robustbase/inst/doc/ |
H A D | psi_functions.R | 66 cT <- rbind(cc1 = .psi.ggw.findc(ms = -0.5, b = 1.5, eff = 0.95 ), globalVar 67 cc2 = .psi.ggw.findc(ms = -0.5, b = 1.5, bp = 0.50)); cT 74 ccc <- c(0, cT[1, 2:4], 1) 88 cT <- rbind(cc1 = .psi.lqq.findc(ms= -0.5, b.c = 1.5, eff=0.95, bp=NA ), globalVar 90 colnames(cT) <- c("b", "c", "s"); cT
|
/dports/math/ogdf/OGDF/include/ogdf/planarity/ |
H A D | EmbedderMaxFace.h | 108 forEachIngoingNeighbor(bT, [&](node cT) { 109 node cH = pBCTree->cutVertex(cT, bT); 128 forEachIngoingNeighbor(cT, [&](node bT2) { 130 L += getCstrLength(bT2, pBCTree->cutVertex(cT, bT2)); 133 forEachIngoingNeighbor(cT, [&](node pT) { 136 node partnerV = pBCTree->cutVertex(cT, pT); 160 const node cT, in internalEmbedBlock() argument 192 …ListIterator<adjEntry>* pAfter = pBCTree->bcproper(nG) == cT ? &after : new ListIterator<adjEntry>; in internalEmbedBlock() 198 if (cT2 == cT) { in internalEmbedBlock() 307 virtual void embedBlock(const node& bT, const node& cT, ListIterator<adjEntry>& after);
|