Home
last modified time | relevance | path

Searched refs:xC (Results 1 – 25 of 2772) sorted by relevance

12345678910>>...111

/dports/editors/libreoffice/libreoffice-7.2.6.2/unotools/source/i18n/
H A Dcalendarwrapper.cxx46 if ( xC.is() ) in loadDefaultCalendar()
59 if ( xC.is() ) in loadCalendar()
73 if ( xC.is() ) in getAllCalendars()
88 if ( xC.is() ) in getUniqueID()
102 if ( xC.is() ) in setDateTime()
115 if ( xC.is() ) in getDateTime()
129 if ( xC.is() ) in setLocalDateTime()
144 if ( xC.is() ) in getLocalDateTime()
160 if ( xC.is() ) in setValue()
173 if ( xC.is() ) in isValid()
[all …]
/dports/editors/libreoffice6/libreoffice-6.4.7.2/unotools/source/i18n/
H A Dcalendarwrapper.cxx46 if ( xC.is() ) in loadDefaultCalendar()
59 if ( xC.is() ) in loadCalendar()
73 if ( xC.is() ) in getAllCalendars()
88 if ( xC.is() ) in getUniqueID()
102 if ( xC.is() ) in setDateTime()
115 if ( xC.is() ) in getDateTime()
129 if ( xC.is() ) in setLocalDateTime()
144 if ( xC.is() ) in getLocalDateTime()
160 if ( xC.is() ) in setValue()
173 if ( xC.is() ) in isValid()
[all …]
/dports/math/miracl/miracl-5.6/
H A Dake24blsa.cpp320 xC=Qx7; in HashG2()
321 xA+=xC; in HashG2()
323 xA+=xC; in HashG2()
325 xC=Qx7; in HashG2()
326 xB+=xC; in HashG2()
328 xB+=xC; in HashG2()
332 xB+=xC; in HashG2()
334 xB+=xC; in HashG2()
336 xB+=xC; in HashG2()
338 xB+=xC; in HashG2()
[all …]
H A Dbls_pair.cpp969 xC=Qx7; in HashG2()
970 xA+=xC; in HashG2()
972 xA+=xC; in HashG2()
974 xC=Qx7; in HashG2()
975 xB+=xC; in HashG2()
977 xB+=xC; in HashG2()
981 xB+=xC; in HashG2()
983 xB+=xC; in HashG2()
985 xB+=xC; in HashG2()
987 xB+=xC; in HashG2()
[all …]
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/optim/univariate/
H A DBracketFinder.java134 double xC = xB + GOLD * (xB - xA); in search() local
135 double fC = eval(func, xC); in search()
161 xC = w; in search()
165 w = xC + GOLD * (xC - xB); in search()
175 xB = xC; in search()
176 xC = w; in search()
177 w = xC + GOLD * (xC - xB); in search()
183 w = xC + GOLD * (xC - xB); in search()
189 xB = xC; in search()
191 xC = w; in search()
[all …]
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/optimization/univariate/
H A DBracketFinder.java133 double xC = xB + GOLD * (xB - xA); in search() local
134 double fC = eval(func, xC); in search()
160 xC = w; in search()
164 w = xC + GOLD * (xC - xB); in search()
174 xB = xC; in search()
175 xC = w; in search()
176 w = xC + GOLD * (xC - xB); in search()
182 w = xC + GOLD * (xC - xB); in search()
188 xB = xC; in search()
190 xC = w; in search()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/
H A DTestDriverInterface.cpp1565 double x0_sq = xC[0]*xC[0], x1_sq = xC[1]*xC[1]; in poly_prod()
2637 + 6.63*xC[5]*xC[8] - 7.7*xC[6]*xC[7] + 0.32*xC[8]*xC[9]; in side_impact_perf()
2640 - 11*xC[1]*xC[7] - 0.0215*xC[4]*xC[9] - 9.98*xC[6]*xC[7] in side_impact_perf()
2646 - 0.019*xC[1]*xC[6] + 0.0144*xC[2]*xC[4] + 0.0008757*xC[4]*xC[9] in side_impact_perf()
2651 + 0.03099*xC[1]*xC[5] - 0.018*xC[1]*xC[6] + 0.0208*xC[2]*xC[7] in side_impact_perf()
2652 + 0.121*xC[2]*xC[8] - 0.00364*xC[4]*xC[5] + 0.0007715*xC[4]*xC[9] in side_impact_perf()
2658 fnVals[7] = 4.72 - 0.5*xC[3] - 0.19*xC[1]*xC[2] - 0.0122*xC[3]*xC[9] in side_impact_perf()
2662 + 0.02054*xC[2]*xC[9] - 0.0198*xC[3]*xC[9] + 0.028*xC[5]*xC[9]; in side_impact_perf()
3464 fnVals[1] = xC[0]*(xC[2]*xC[2] - 0.5*xC[3]); in text_book_ouu()
3468 fnVals[2] = xC[1]*(xC[3]*xC[3] - 0.5*xC[2]); in text_book_ouu()
[all …]
/dports/misc/otter/otter-3.3f/examples/kalman/
H A Di4.in44 -H(C,xA,xB,xC,xD,xE,xF) | K1(C,F,xC,xF,xA,xB,xD,xE).
45 -H(D,xA,xB,xC,xD,xE,xF) | K1(D,B,xD,xB,xA,xC,xE,xF).
46 -H(D,xA,xB,xC,xD,xE,xF) | K1(D,E,xD,xE,xA,xB,xC,xF).
47 -H(E,xA,xB,xC,xD,xE,xF) | K1(E,F,xE,xF,xA,xB,xC,xD).
77 -K2(C,F,xC,xF,xA,xB,xD,xE) | H(F,xA,xB,xC,xD,xE,xF).
78 -K2(D,B,xD,xB,xA,xC,xE,xF) | H(B,xA,xB,xC,xD,xE,xF).
79 -K2(D,E,xD,xE,xA,xB,xC,xF) | H(E,xA,xB,xC,xD,xE,xF).
80 -K2(E,F,xE,xF,xA,xB,xC,xD) | H(F,xA,xB,xC,xD,xE,xF).
103 -H(B,[],[R,u],xC,xD,xE,xF) | H(B,[u],[R],xC,xD,xE,xF).
104 -H(B,[],[R,u,v],xC,xD,xE,xF) | H(B,[v],[R,u],xC,xD,xE,xF).
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/test/
H A Dgerstner_string.cpp36 std::vector<double> xC(num_vars-1); in main() local
38 fin >> xC[i]; in main()
97 fnVal += (i%2) ? odd_coeff*exp(-xC[i]*xC[i]) : in main()
98 even_coeff*exp(-xC[i]*xC[i]); break; in main()
103 fnVal += odd_coeff*exp(xC[i]) in main()
104 + inter_coeff*exp(xC[i]*xC[i-1]); in main()
106 fnVal += even_coeff*exp(xC[i]); in main()
111 sum -= (i%2) ? odd_coeff*xC[i]*xC[i] : even_coeff*xC[i]*xC[i]; in main()
/dports/math/octave-forge-octclip/octclip-2.0.1/src/
H A Dsegmento.c44 const double xC, in TresPuntosColineales2D() argument
88 const double xC, in PtoComunSegmParalelos2D() argument
131 *x = xC; in PtoComunSegmParalelos2D()
183 const double xC, in IntersecSegmentos2D() argument
202 GEOC_MAX(yA,yB),GEOC_MIN(xC,xD),GEOC_MAX(xC,xD), in IntersecSegmentos2D()
213 xc = (xA+xB+xC+xD)/4.0; in IntersecSegmentos2D()
219 xCc = xC-xc; in IntersecSegmentos2D()
314 const double xC, in IntersecSegmentos2DSimple() argument
333 GEOC_MAX(yA,yB),GEOC_MIN(xC,xD),GEOC_MAX(xC,xD), in IntersecSegmentos2DSimple()
342 xc = (xA+xB+xC+xD)/4.0; in IntersecSegmentos2DSimple()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/pecos/test/
H A DTestFunctions.hpp69 double genz(String an_comp, RealVector &xC) in genz() argument
92 int numVars = xC.length(); in genz()
101 fnVals += c[d] * xC[d]; in genz()
110 fnVals += c[d]* xC[d]; in genz()
123 if (xC.length() != 2 ) in gerstner()
150 Real fnVals, x=xC[0], y=xC[1]; in gerstner()
168 double custPol(String an_comp, RealVector &xC) in custPol() argument
172 int numVars = xC.length(); in custPol()
205 fnVals += cMain[d ] * xC[d] * xC[d]; in custPol()
206 fnVals += cMain[d+numVars] * xC[d] ; in custPol()
[all …]
/dports/devel/t1lib/t1lib-5.1.2/lib/type1/
H A Dcurves.h31 #define StepConic(R,xA,yA,xB,yB,xC,yC,r) t1_StepConic(R,xA,yA,xB,yB,xC,yC,r) argument
32 #define StepBezier(R,xA,yA,xB,yB,xC,yC,xD,yD) t1_StepBezier(R,xA,yA,xB,yB,xC,yC,xD,yD) argument
34 #define FlattenConic(xM,yM,xC,yC,r) t1_StepConic(NULL,(fractpel)0,(fractpel)0,xM,yM,xC,yC,… argument
35 #define FlattenBezier(xB,yB,xC,yC,xD,yD) t1_StepBezier(NULL,(fractpel)0,(fractpel)0,xB,yB,xC,yC… argument
H A Dcurves.c116 static struct segment *StepBezierRecurse(I,xA,yA,xB,yB,xC,yC,xD,yD) in StepBezierRecurse() argument
120 fractpel xC,yC; /* C control point */
124 if (BezierTerminationTest(xA,yA,xB,yB,xC,yC,xD,yD))
142 xBC = xB + xC; yBC = yB + yC;
143 xCD = xC + xD; yCD = yC + yD;
193 struct segment *StepBezier(R, xA, yA, xB, yB, xC, yC, xD, yD) in StepBezier() argument
197 fractpel xC,yC; /* C control point */
207 xC -= xA;
213 if ( TOOBIG(xB) || TOOBIG(yB) || TOOBIG(xC) || TOOBIG(yC)
218 (fractpel) 0, (fractpel) 0, xB, yB, xC, yC, xD, yD));
/dports/net/tightvnc/vnc_unixsrc/Xvnc/lib/font/Type1/
H A Dcurves.h31 #define StepConic(R,xA,yA,xB,yB,xC,yC,r) t1_StepConic(R,xA,yA,xB,yB,xC,yC,r) argument
32 #define StepBezier(R,xA,yA,xB,yB,xC,yC,xD,yD) t1_StepBezier(R,xA,yA,xB,yB,xC,yC,xD,yD) argument
34 #define FlattenConic(xM,yM,xC,yC,r) t1_StepConic(NULL,(fractpel)0,(fractpel)0,xM,yM,xC,yC,… argument
35 #define FlattenBezier(xB,yB,xC,yC,xD,yD) t1_StepBezier(NULL,(fractpel)0,(fractpel)0,xB,yB,xC,yC… argument
H A Dcurves.c115 static struct segment *StepBezierRecurse(I,xA,yA,xB,yB,xC,yC,xD,yD) in StepBezierRecurse() argument
119 fractpel xC,yC; /* C control point */
123 if (BezierTerminationTest(xA,yA,xB,yB,xC,yC,xD,yD))
141 xBC = xB + xC; yBC = yB + yC;
142 xCD = xC + xD; yCD = yC + yD;
190 struct segment *StepBezier(R, xA, yA, xB, yB, xC, yC, xD, yD) in StepBezier() argument
194 fractpel xC,yC; /* C control point */
204 xC -= xA;
210 if ( TOOBIG(xB) || TOOBIG(yB) || TOOBIG(xC) || TOOBIG(yC)
215 (fractpel) 0, (fractpel) 0, xB, yB, xC, yC, xD, yD));
/dports/math/grace/grace-5.1.25/T1lib/type1/
H A Dcurves.h31 #define StepConic(R,xA,yA,xB,yB,xC,yC,r) t1_StepConic(R,xA,yA,xB,yB,xC,yC,r) argument
32 #define StepBezier(R,xA,yA,xB,yB,xC,yC,xD,yD) t1_StepBezier(R,xA,yA,xB,yB,xC,yC,xD,yD) argument
34 #define FlattenConic(xM,yM,xC,yC,r) t1_StepConic(NULL,(fractpel)0,(fractpel)0,xM,yM,xC,yC,… argument
35 #define FlattenBezier(xB,yB,xC,yC,xD,yD) t1_StepBezier(NULL,(fractpel)0,(fractpel)0,xB,yB,xC,yC… argument
H A Dcurves.c116 static struct segment *StepBezierRecurse(I,xA,yA,xB,yB,xC,yC,xD,yD) in StepBezierRecurse() argument
120 fractpel xC,yC; /* C control point */
124 if (BezierTerminationTest(xA,yA,xB,yB,xC,yC,xD,yD))
142 xBC = xB + xC; yBC = yB + yC;
143 xCD = xC + xD; yCD = yC + yD;
193 struct segment *StepBezier(R, xA, yA, xB, yB, xC, yC, xD, yD) in StepBezier() argument
197 fractpel xC,yC; /* C control point */
207 xC -= xA;
213 if ( TOOBIG(xB) || TOOBIG(yB) || TOOBIG(xC) || TOOBIG(yC)
218 (fractpel) 0, (fractpel) 0, xB, yB, xC, yC, xD, yD));
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/examples/linked_interfaces/Scilab/Rosenbrock/
H A Drosenbrock.sci19 f0 = Dakota('xC')(2)-Dakota('xC')(1)*Dakota('xC')(1);
20 f1 = 1.-Dakota('xC')(1);
39 Dakota('fnGrads')(1,1) = -20.*Dakota('xC')(1);
50 Dakota('fnGrads')(1,1) = -400.*f0*Dakota('xC')(1) - 2.*f1;
72 fx = Dakota('xC')(2) - 3.*Dakota('xC')(1)*Dakota('xC')(1);
74 Dakota('fnHessians')(1)(1,2) = -400.*Dakota('xC')(1);
75 Dakota('fnHessians')(1)(2,1) = -400.*Dakota('xC')(1);
/dports/print/texlive-base/texlive-20150521-source/texk/ps2pk/
H A Dcurves.h31 #define StepConic(R,xA,yA,xB,yB,xC,yC,r) t1_StepConic(R,xA,yA,xB,yB,xC,yC,r) argument
32 #define StepBezier(R,xA,yA,xB,yB,xC,yC,xD,yD) t1_StepBezier(R,xA,yA,xB,yB,xC,yC,xD,yD) argument
34 #define FlattenConic(xM,yM,xC,yC,r) t1_StepConic(NULL,(fractpel)0,(fractpel)0,xM,yM,xC,yC,… argument
35 #define FlattenBezier(xB,yB,xC,yC,xD,yD) t1_StepBezier(NULL,(fractpel)0,(fractpel)0,xB,yB,xC,yC… argument
/dports/misc/mnn/MNN-1.2.0/backupcode/cpubackend/
H A DConvolutionWinograd3D.cpp133 int dstZStep = xC * 4; in onExecute()
134 int unitStep = ic_4 * xC * 4; in onExecute()
135 for (int xi = 0; xi < xC; ++xi) { in onExecute()
197 int srcZStep = xC * 4; in onExecute()
198 int unitStep = dc_4 * xC * 4; in onExecute()
199 for (int xi = 0; xi < xC; ++xi) { in onExecute()
255 const int element = (end - start) * dc_4 * xC * 4, offset = start * dc_4 * xC * 4; in onExecute()
264 if (xC == CONVOLUTION_TILED_NUMBER) { in onExecute()
265 … MNNGemmFloatUnit_4(tempDst + i * dc_4 * xC * 4, _srcOrigin + i * ic_4 * 4 * xC, in onExecute()
268 … MNNGemmFloatCommon_4(tempDst + i * dc_4 * xC * 4, _srcOrigin + i * ic_4 * 4 * xC, in onExecute()
[all …]
H A DConvolution3D3x3.cpp270 const int dstStepD = BLOCK_UNIT2 * ic_4 * xC * 4; in onExecute()
272 for (int xi = 0; xi < xC; ++xi) { in onExecute()
290 auto dstStart = dstUnit + z * 4 * xC; in onExecute()
309 for (int xi = 0; xi < xC; ++xi) { in onExecute()
325 auto srcZ = _srcUnit + z * xC * 4; in onExecute()
327 destTransform(srcZ, dstBlock, dc_4 * 4 * xC); in onExecute()
346 const int element = (end - start) * dc_4 * xC * 4, offset = start * dc_4 * xC * 4; in onExecute()
355 if (xC == CONVOLUTION_TILED_NUMBER) { in onExecute()
356 … MNNGemmFloatUnit_4(tempDst + i * dc_4 * xC * 4, _srcOrigin + i * ic_4 * 4 * xC, in onExecute()
359 … MNNGemmFloatCommon_4(tempDst + i * dc_4 * xC * 4, _srcOrigin + i * ic_4 * 4 * xC, in onExecute()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/examples/linked_interfaces/Matlab/
H A Drosenbrock.m35 f0 = Dakota.xC(2)-Dakota.xC(1)*Dakota.xC(1);
36 f1 = 1.-Dakota.xC(1);
55 Dakota.fnGrads(1,1) = -20.*Dakota.xC(1);
66 Dakota.fnGrads(1,1) = -400.*f0*Dakota.xC(1) - 2.*f1;
88 fx = Dakota.xC(2) - 3.*Dakota.xC(1)*Dakota.xC(1);
90 Dakota.fnHessians(1,1,2) = -400.*Dakota.xC(1);
91 Dakota.fnHessians(1,2,1) = -400.*Dakota.xC(1);
/dports/security/py-angr/angr-9.0.5405/angr/analyses/decompiler/optimization_passes/
H A Ddiv_simplifier.py92 if isinstance(xC, Expr.Convert) and (xC.from_bits > xC.to_bits):
93 Y = xC.from_bits - xC.to_bits
94 if isinstance(xC.operand, Expr.BinaryOp) and xC.operand.op == 'Mul':
95 xC_ = xC.operand
107 if isinstance(xC, Expr.BinaryOp) and xC.op == 'Mul':
110 C = xC.operands[1].value
111 X = xC.operands[0]
118 if V_.operands[1] == xC:
120 elif isinstance(xC, Expr.BinaryOp) and xC.op == 'Shr':
129 X = xC.operands[0].operands[0]
[all …]
/dports/graphics/digikam/digikam-7.4.0/core/libs/heifutils/libde265/
H A Dsao.cc50 const int xC = xCtb*nSW; in apply_sao_internal() local
56 const int ctbSliceAddrRS = img->get_SliceHeader(xC,yC)->SliceAddrRS; in apply_sao_internal()
72 const int ctbW = (xC+nSW>width) ? width -xC : nSW; in apply_sao_internal()
104 const pixel_t* in_ptr = &in_img [xC+(yC+j)*in_stride]; in apply_sao_internal()
105 /* */ pixel_t* out_ptr = &out_img[xC+(yC+j)*out_stride]; in apply_sao_internal()
110 logtrace(LogSAO, "pos %d,%d\n",xC+i,yC+j); in apply_sao_internal()
124 int xS = xC+i+hPos[k]; in apply_sao_internal()
144 img->get_SliceHeader((xC+i)<<chromashiftW, in apply_sao_internal()
228 in_img[xC+i+(yC+j)*in_stride], in apply_sao_internal()
229 in_img[xC+i+(yC+j)*in_stride]+offset); in apply_sao_internal()
[all …]
/dports/multimedia/libde265/libde265-1.0.2/libde265/
H A Dsao.cc50 const int xC = xCtb*nSW; in apply_sao_internal() local
56 const int ctbSliceAddrRS = img->get_SliceHeader(xC,yC)->SliceAddrRS; in apply_sao_internal()
72 const int ctbW = (xC+nSW>width) ? width -xC : nSW; in apply_sao_internal()
104 const pixel_t* in_ptr = &in_img [xC+(yC+j)*in_stride]; in apply_sao_internal()
105 /* */ pixel_t* out_ptr = &out_img[xC+(yC+j)*out_stride]; in apply_sao_internal()
110 logtrace(LogSAO, "pos %d,%d\n",xC+i,yC+j); in apply_sao_internal()
124 int xS = xC+i+hPos[k]; in apply_sao_internal()
144 img->get_SliceHeader((xC+i)<<chromashiftW, in apply_sao_internal()
225 in_img[xC+i+(yC+j)*in_stride], in apply_sao_internal()
226 in_img[xC+i+(yC+j)*in_stride]+offset); in apply_sao_internal()
[all …]

12345678910>>...111