Home
last modified time | relevance | path

Searched refs:mP (Results 1 – 25 of 631) sorted by relevance

12345678910>>...26

/dports/devel/upp/upp/bazaar/plugin/assimp/code/X/
H A DXFileParser.cpp137 mP[8] << mP[9] << mP[10] << mP[11] << "'"); in XFileParser()
660 if( *mP == ';' || *mP == ',') in ParseDataObjectMeshVertexColors()
691 if(mP < mEnd && *mP == ';') in ParseDataObjectMeshMaterialList()
1046 if( *mP == ';' || *mP == ',') in TestForSeparator()
1047 mP++; in TestForSeparator()
1189 if( *mP == ';' || *mP == '}' || *mP == '{' || *mP == ',') in GetNextToken()
1221 if( (mP[0] == '/' && mP[1] == '/') || mP[0] == '#') in FindNextNoneWhiteSpace()
1247 ++mP; in GetNextTokenAsString()
1249 while( mP < mEnd && *mP != '"') in GetNextTokenAsString()
1257 if ( mP[ 1 ] != ';' || mP[ 0 ] != '"' ) { in GetNextTokenAsString()
[all …]
/dports/multimedia/assimp/assimp-5.1.3/code/AssetLib/X/
H A DXFileParser.cpp136 ThrowException("Unsupported xfile format '", mP[8], mP[9], mP[10], mP[11], "'"); in XFileParser()
624 if (*mP == ';' || *mP == ',') in ParseDataObjectMeshVertexColors()
654 if (mP < mEnd && *mP == ';') in ParseDataObjectMeshMaterialList()
973 if (*mP == ';' || *mP == ',') in TestForSeparator()
1112 if (*mP == ';' || *mP == '}' || *mP == '{' || *mP == ',') { in GetNextToken()
1140 if ((mP[0] == '/' && mP[1] == '/') || mP[0] == '#') in FindNextNoneWhiteSpace()
1164 ++mP; in GetNextTokenAsString()
1166 while (mP < mEnd && *mP != '"') in GetNextTokenAsString()
1174 if (mP[1] != ';' || mP[0] != '"') { in GetNextTokenAsString()
1187 if (*mP == '\n' || *mP == '\r') { in ReadUntilEndOfLine()
[all …]
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/ec_order/eco_gfp/wep_rat_function/
H A Dwep_rat_function_appl.cc75 assert(mP.on_curve()); in main_LiDIA()
82 add(mP, mP, P); in main_LiDIA()
83 assert(mP.on_curve()); in main_LiDIA()
94 subtract(mP, mP, P); in main_LiDIA()
96 assert(mP.on_curve()); in main_LiDIA()
109 multiply_by_2(mP, P); in main_LiDIA()
110 assert(mP.on_curve()); in main_LiDIA()
113 multiply_by_2(mP, mP); in main_LiDIA()
114 assert(mP.on_curve()); in main_LiDIA()
123 mP.assign_zero(); in main_LiDIA()
[all …]
H A Dwep_rat_function_timing.cc59 wep_rat_function P, mP, m2P; in main() local
66 rg >> i; i = i % 100; multiply(mP, i, P); in main()
71 multiply_by_2(mP, mP); in main()
78 add(mP, mP, m2P); in main()
/dports/games/stuntrally/stuntrally-2.6.1/source/road/
H A DRoad_Edit.cpp315 mP[*it].onTer = !mP[*it].onTer; in ToggleOnTerrain()
320 mP[iChosen].onTer = !mP[iChosen].onTer; in ToggleOnTerrain()
330 mP[*it].cols = 1-mP[*it].cols; in ToggleColumn()
336 mP[iChosen].cols = 1-mP[iChosen].cols; in ToggleColumn()
346 mP[*it].onPipe = onp(mP[*it].onPipe); in ToggleOnPipe()
360 mP[*it].notReal = !mP[*it].notReal; in ToggleNotReal()
366 mP[iChosen].notReal = !mP[iChosen].notReal; in ToggleNotReal()
415 { mP[*it].mYaw = 0; mP[*it].mRoll = 0; } in AngZero()
483 mP.insert(mP.begin()+iChosen+1, pt); in Insert()
511 else mP.erase(mP.begin() + iChosen); in Delete()
[all …]
H A DRoad_Markers.cpp165 if (mP[i].pipe > 0.f && mP[i].onPipe==0) in SelectMarker()
169 ndChk->setScale(mP[i].chkR * 2.f * mP[i].width * Vector3::UNIT_SCALE); in SelectMarker()
198 if (mP[i].onTer) in UpdAllMarkers()
218 Vector3 vr = GetRot(mP[i].aYaw, mP[i].aRoll); in UpdRot()
219 Vector3 rpos = mP[i].pos + vr * mP[i].width * 0.54f; in UpdRot()
242 mP[seg].chkR = std::max(0.f, mP[seg].chkR + relR); in AddChkR()
246 if (relR < 0.f && mP[seg].chkR < 1.f) mP[seg].chkR = 0.f; else in AddChkR()
247 if (relR > 0.f && mP[seg].chkR < 1.f) mP[seg].chkR = 1.f; in AddChkR()
254 bool bridge = !mP[seg].onTer || !mP[next].onTer || !mP[prev].onTer; in AddChkR()
299 cs.r = mP[i].chkR * mP[i].width; in SetChecks()
[all …]
H A DRoad_Prepass.cpp166 { mP[seg].aYaw = mP[seg].mYaw; mP[seg].aRoll = mP[seg].mRoll; } in PrepassAngles()
168 { mP[seg].aRoll = 0.f; in PrepassAngles()
176 { mP[seg].aYaw += mP[seg].mYaw; mP[seg].aRoll += mP[seg].mRoll; } in PrepassAngles()
211 Real sp = mP[seg].pipe, sp1 = mP[seg1].pipe, sp0 = mP[seg0].pipe; in PrepassLod()
232 if (!mP[seg].notReal) in PrepassLod()
243 int hid = mP[seg].idMtr, hid1 = mP[seg1].idMtr, hid0 = mP[seg0].idMtr; in PrepassLod()
251 if (mP[seg].onTer != mP[seg1].onTer || mP[seg].onTer != mP[seg0].onTer) in PrepassLod()
277 Real ay = mP[seg].aYaw, ar = mP[seg].aRoll; in PrepassLod()
280 if (mP[seg].onTer && mP[seg1].onTer) // perpendicular on xz in PrepassLod()
289 if (mP[seg].onPipe==2) in PrepassLod()
[all …]
H A DSplineBase.cpp106 const Vector3& p1 = mP[id].pos, p2 = mP[id1].pos; in interpolate()
112 const Vector3& n1 = mP[id].tan, n2 = mP[id1].tan; in interpolate()
128 const Real& p1 = mP[id].width, p2 = mP[id1].width; in interpWidth()
131 const Real& n1 = mP[id].wtan, n2 = mP[id1].wtan; in interpWidth()
146 int i, num = mP.size(); in recalcTangents()
153 mP[i].tan = 0.5 * (mP[next].pos - mP[prev].pos); in recalcTangents()
154 mP[i].wtan= 0.5 * (mP[next].width - mP[prev].width); in recalcTangents()
162 return mP[index].pos; in getPos()
167 mP[index].pos = value; in setPos()
174 return mP[index]; in getPoint()
[all …]
H A DRoad_Rebuild.cpp60 DS.onTer = mP[seg].onTer && mP[seg1].onTer; in BuildSeg()
67 !mP[seg ].onTer && mP[seg0].isnt() : in BuildSeg()
68 !mP[seg ].onTer && !mP[seg].isnt() && mP[seg0].isnt(); in BuildSeg()
70 !mP[seg1].onTer && mP[seg1].isnt() : in BuildSeg()
71 !mP[seg1].onTer && mP[seg1].isnt(); in BuildSeg()
73 !mP[seg0].onTer && mP[seg02].isnt() : in BuildSeg()
74 !mP[seg0].onTer && !mP[seg0].isnt() && mP[seg02].isnt(); in BuildSeg()
170 if (mP[seg].onTer && mP[seg1].onTer) in BuildSeg()
206 Real p1 = mP[seg].pipe, p2 = mP[seg1].pipe; in BuildSeg()
274 if (mP[seg].onPipe == 1 && mP[seg].idMtr >= 0 || in BuildSeg()
[all …]
H A DRoad_File.cpp269 mP[iP1].chk1st = true; in LoadFile()
334 if (mP[i].chk1st) in SaveFile()
365 bool onTer = mP[i].onTer, onTer1 = mP[(i+1)%num].onTer, onTer_1 = mP[(i-1+num)%num].onTer; in SaveFile()
370 p.SetAttribute("w", toStrC( mP[i].width )); in SaveFile()
381 if (mP[i].cols != 1) in SaveFile()
383 if (mP[i].pipe > 0.f) in SaveFile()
386 if (mP[i].idMtr != 0) in SaveFile()
389 if (mP[i].notReal) in SaveFile()
392 if (mP[i].chkR > 0.f) in SaveFile()
394 if (mP[i].loop) in SaveFile()
[all …]
/dports/graphics/qgis/qgis-3.22.3/src/core/geometry/
H A Dqgswkbptr.cpp21 mStart = mP; in QgsWkbPtr()
22 mEnd = mP + wkb.length(); in QgsWkbPtr()
27 mP = p; in QgsWkbPtr()
28 mStart = mP; in QgsWkbPtr()
29 mEnd = mP + size; in QgsWkbPtr()
34 if ( !mP || mP + size > mEnd ) in verifyBound()
41 mEnd = mP + wkb.length(); in QgsConstWkbPtr()
49 mEnd = mP + size; in QgsConstWkbPtr()
56 if ( !mP ) in readHeader()
72 if ( !mP || mP + size > mEnd ) in verifyBound()
[all …]
H A Dqgswkbptr.h45 mutable unsigned char *mP; variable
54 memcpy( &v, mP, sizeof v ); in read()
55 mP += sizeof v; in read()
61 memcpy( mP, &v, sizeof v ); in write()
62 mP += sizeof v; in write()
68 memcpy( mP, data.constData(), data.length() ); in write()
69 mP += data.length(); in write()
140 mutable unsigned char *mP;
158 memcpy( &v, mP, sizeof( v ) ); in read()
159 mP += sizeof( v ); in read()
[all …]
/dports/graphics/qgis-ltr/qgis-3.16.16/src/core/geometry/
H A Dqgswkbptr.cpp21 mStart = mP; in QgsWkbPtr()
22 mEnd = mP + wkb.length(); in QgsWkbPtr()
27 mP = p; in QgsWkbPtr()
28 mStart = mP; in QgsWkbPtr()
29 mEnd = mP + size; in QgsWkbPtr()
34 if ( !mP || mP + size > mEnd ) in verifyBound()
41 mEnd = mP + wkb.length(); in QgsConstWkbPtr()
49 mEnd = mP + size; in QgsConstWkbPtr()
56 if ( !mP ) in readHeader()
72 if ( !mP || mP + size > mEnd ) in verifyBound()
[all …]
H A Dqgswkbptr.h45 mutable unsigned char *mP; variable
54 memcpy( &v, mP, sizeof v ); in read()
55 mP += sizeof v; in read()
61 memcpy( mP, &v, sizeof v ); in write()
62 mP += sizeof v; in write()
68 memcpy( mP, data.constData(), data.length() ); in write()
69 mP += data.length(); in write()
132 mutable unsigned char *mP;
150 memcpy( &v, mP, sizeof( v ) ); in read()
151 mP += sizeof( v ); in read()
[all …]
/dports/math/kig/kig-21.12.3/misc/
H A Dkigpainter.cpp37 : mP ( device ), in KigPainter()
61 mP.drawRect(qr); in drawRect()
67 mP.drawRect(r); in drawRect()
77 mP.drawEllipse ( qr ); in drawCircle()
84 mP.drawLine( tF, tT ); in drawSegment()
131 mP.drawRect( qr ); in drawFatPoint()
145 mP.drawRect( qr ); in drawFatPoint()
239 mP.setPen(p); in setPen()
246 mP.setBrush( b ); in setBrush()
263 mP.setFont( f ); in setFont()
[all …]
/dports/net-im/libqtelegram-ae/libqtelegram-aseman-edition-6.1-stable/secret/
H A Dsecretstate.cpp25 mP(0) { in SecretState()
30 if (mP) BN_clear_free(mP); in ~SecretState()
48 if (mP) BN_free(mP); in setP()
49 mP = BN_bin2bn(reinterpret_cast<const uchar*>(bigEndianP.data()), 256, 0); in setP()
50 Utils::ensurePtr(mP); in setP()
58 QByteArray mPBytes = Utils::bignumToBytes(mP); in save()
/dports/graphics/netpbm/netpbm-10.91.01/converter/pbm/
H A Dpbmtoepson.c200 char * const mP) { in computeM() argument
208 *mP = 2; in computeM()
211 case ESCP9: *mP = 5; break; in computeM()
212 case ESCP: *mP = 6; break; in computeM()
220 *mP = 0; in computeM()
223 *mP = adjacence == ADJACENT_NO ? 2 : 1; in computeM()
229 *mP = 3; in computeM()
235 *mP = 4; in computeM()
244 *mP = 5; in computeM()
250 *mP = 6; in computeM()
[all …]
/dports/math/mpsolve/mpsolve-3.2.1/src/libmps/monomial/
H A Dmonomial-matrix-poly.c29 poly->mP = mps_newv (mpc_t, poly->m * poly->m * (degree + 1)); in mps_monomial_matrix_poly_new()
33 mpc_vinit2 (poly->mP, poly->m * poly->m * (degree + 1), ctx->mpwp); in mps_monomial_matrix_poly_new()
57 mpc_vclear (mpoly->mP, mpoly->m * (poly->degree + mpoly->m)); in mps_monomial_matrix_poly_free()
58 free (mpoly->mP); in mps_monomial_matrix_poly_free()
122 mpc_set_cplx (mpoly->mP[j], mpoly->P[j]); in mps_monomial_matrix_poly_set_coefficient_d()
176 if (mpc_get_prec (mpoly->mP[0]) < mpc_get_prec (value)) in mps_monomial_matrix_poly_meval()
181 mps_mhessenberg_shifted_determinant (ctx, mpoly->mP, x, mpoly->m, value, error); in mps_monomial_matrix_poly_meval()
197 mpc_set_prec (mpoly->mP[i], wp); in mps_monomial_matrix_poly_raise_data()
203 mpc_set_q (mpoly->mP[i], mpoly->mpqPr[i], mpoly->mpqPi[i]); in mps_monomial_matrix_poly_raise_data()
206 return mpc_get_prec (mpoly->mP[0]); in mps_monomial_matrix_poly_raise_data()
/dports/misc/visp/visp-3.4.0/example/ogre-simulator/
H A DAROgreBasic.cpp349 mP[0].setWorldCoordinates(-L, -l, 0); // (X,Y,Z) in computeInitialPose()
350 mP[1].setWorldCoordinates(L, -l, 0); in computeInitialPose()
351 mP[2].setWorldCoordinates(L, l, 0); in computeInitialPose()
352 mP[3].setWorldCoordinates(-L, l, 0); in computeInitialPose()
363 mP[i].set_x(x); in computeInitialPose()
364 mP[i].set_y(y); in computeInitialPose()
370 mPose->addPoint(mP[i]); // and added to the pose computation point list in computeInitialPose()
485 vpPoint mP[4]; in main() local
557 mP[i].set_x(x); in main()
558 mP[i].set_y(y); in main()
[all …]
H A DAROgre.cpp482 mP[0].setWorldCoordinates(-L, -l, 0); // (X,Y,Z) in computeInitialPose()
483 mP[1].setWorldCoordinates(L, -l, 0); in computeInitialPose()
484 mP[2].setWorldCoordinates(L, l, 0); in computeInitialPose()
485 mP[3].setWorldCoordinates(-L, l, 0); in computeInitialPose()
496 mP[i].set_x(x); in computeInitialPose()
497 mP[i].set_y(y); in computeInitialPose()
503 mPose->addPoint(mP[i]); // and added to the pose computation point list in computeInitialPose()
613 vpPoint mP[4]; in main() local
677 mP[i].set_x(x); in main()
678 mP[i].set_y(y); in main()
[all …]
/dports/math/jacop/jacop-4.8.0/src/test/fz/upTo5sec/gardner_prime_puzzle/
H A Dgardner_prime_puzzle.fzn18 var 2222..7777: mP:: output_var:: is_defined_var;
21 …ODUCED_8,X_INTRODUCED_9,X_INTRODUCED_10,X_INTRODUCED_11,X_INTRODUCED_12,X_INTRODUCED_13,mP,nP,mnP];
24 …traint int_lin_eq(X_INTRODUCED_39,[mP,X_INTRODUCED_0,X_INTRODUCED_1,X_INTRODUCED_2,X_INTRODUCED_3]…
25 constraint int_times(mP,nP,mnP):: defines_var(mnP);
/dports/games/stuntrally/stuntrally-2.6.1/source/editor/
H A DWarnings.cpp53 if (road->mP[i].chk1st) in WarningsCheck()
56 if (iP1 >= 0 && iP1 < cnt && road->mP[iP1].chkR >= 1.f) in WarningsCheck()
58 Vector3 ch1 = road->mP[iP1].pos; in WarningsCheck()
66 Vector3 pPrev = road->mP[(iP1 - road->iDir + cnt) % cnt].pos; in WarningsCheck()
107 if (road->mP[iP1].chkR < 0.1f) in WarningsCheck()
114 for (int i=0; i < road->mP.size(); ++i) in WarningsCheck()
116 const SplinePoint& p = road->mP[i]; in WarningsCheck()
150 if (iClosest >= 0) { rdW = road->mP[iClosest].width; in WarningsCheck()
151 … point width: "+fToStr(rdW,1,4)+", distance "+fToStr(stPos.distance(road->mP[iClosest].pos),0,3)); in WarningsCheck()
/dports/audio/openal-soft/openal-soft-1.21.1/common/
H A Dpolyphase_resampler.cpp141 mP = dstRate / gcd;
149 if(mP > mQ)
151 cutoff = 0.475 / mP;
152 width = 0.05 / mP;
167 mF[i] = SincFilter(l, beta, mP, cutoff, i);
187 const uint p{mP}, q{mQ}, m{mM}, l{mL};
/dports/audio/audacity/audacity-Audacity-3.1.3/src/effects/
H A DReverb.cpp188 mP = (Reverb_priv_t *) calloc(sizeof(*mP), mNumChans); in ProcessInitialize()
192 reverb_create(&mP[i].reverb, in ProcessInitialize()
203 mP[i].wet); in ProcessInitialize()
213 reverb_delete(&mP[i].reverb); in ProcessFinalize()
216 free(mP); in ProcessFinalize()
243 mP[c].dry = (float *) fifo_write(&mP[c].reverb.input_fifo, len, ichans[c]); in ProcessBlock()
244 reverb_process(&mP[c].reverb, len); in ProcessBlock()
254 mP[w].dry[i] + in ProcessBlock()
256 (mP[0].wet[w][i] + mP[1].wet[w][i]); in ProcessBlock()
265 mP[0].dry[i] + in ProcessBlock()
[all …]
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/mesquite/Misc/
H A DMsqHessian.cpp57 mR(0), mZ(0), mP(0), mW(0), cgArraySizes(0), maxCGiter(50) in MsqHessian()
78 delete[] mP; mP = 0; in clear()
501 delete[] mP; in cg_solver()
505 mP = new Vector3D[mSize]; in cg_solver()
525 for (i=0; i<mSize; ++i) mP[i] = mZ[i] ; // p_1 = z_0 in cg_solver()
532 axpy(mW, mSize, *this, mP, mSize, 0,0,err); // w = A * p_k in cg_solver()
534 alpha_ = inner(mP,mW,mSize); // alpha_ = p_k^T A p_k in cg_solver()
537 for (i=0; i<mSize; ++i) x[i] += mP[i]; // x_{k+1} = x_k + p_{k+1} in cg_solver()
544 for (i=0; i<mSize; ++i) x[i] += alpha*mP[i]; // x_{k+1} = x_k + alpha_{k+1} p_{k+1} in cg_solver()
553 for (i=0; i<mSize; ++i) mP[i] = mZ[i] + beta*mP[i]; // p_k = z_{k-1} + Beta_k * p_{k-1} in cg_solver()

12345678910>>...26