Home
last modified time | relevance | path

Searched refs:numSteps (Results 1 – 25 of 786) sorted by relevance

12345678910>>...32

/dports/x11-toolkits/qwt6/qwt-6.1.6/src/
H A Dqwt_abstract_slider.cpp310 int numSteps = 0; in wheelEvent() local
318 numSteps = -numSteps; in wheelEvent()
327 numSteps = -numSteps; in wheelEvent()
376 int numSteps = 0; in keyPressEvent() local
385 numSteps = -numSteps; in keyPressEvent()
393 numSteps = -numSteps; in keyPressEvent()
401 numSteps = -numSteps; in keyPressEvent()
408 numSteps = -numSteps; in keyPressEvent()
416 numSteps = -numSteps; in keyPressEvent()
423 numSteps = -numSteps; in keyPressEvent()
[all …]
H A Dqwt_date_scale_engine.cpp123 if ( numSteps > 1 && numSteps <= maxSteps && in qwtStepCount()
126 return numSteps; in qwtStepCount()
140 for ( int numSteps = maxSteps; numSteps > 1; numSteps-- ) in qwtStepSize() local
272 int numSteps; in qwtDivideMajorStep() local
286 if ( numSteps > 0 ) in qwtDivideMajorStep()
293 int numSteps = 0; in qwtDivideMajorStep() local
310 if ( numSteps > 0 ) in qwtDivideMajorStep()
317 int numSteps = 0; in qwtDivideMajorStep() local
334 if ( numSteps > 0 ) in qwtDivideMajorStep()
379 if ( numSteps > 0 ) in qwtDivideMajorStep()
[all …]
/dports/devel/xelfviewer/XELFViewer-0.03/XQwt/3rdparty/qwt/src/
H A Dqwt_abstract_slider.cpp310 int numSteps = 0; in wheelEvent() local
318 numSteps = -numSteps; in wheelEvent()
327 numSteps = -numSteps; in wheelEvent()
376 int numSteps = 0; in keyPressEvent() local
385 numSteps = -numSteps; in keyPressEvent()
393 numSteps = -numSteps; in keyPressEvent()
401 numSteps = -numSteps; in keyPressEvent()
408 numSteps = -numSteps; in keyPressEvent()
416 numSteps = -numSteps; in keyPressEvent()
423 numSteps = -numSteps; in keyPressEvent()
[all …]
H A Dqwt_date_scale_engine.cpp123 if ( numSteps > 1 && numSteps <= maxSteps && in qwtStepCount()
126 return numSteps; in qwtStepCount()
140 for ( int numSteps = maxSteps; numSteps > 1; numSteps-- ) in qwtStepSize() local
272 int numSteps; in qwtDivideMajorStep() local
286 if ( numSteps > 0 ) in qwtDivideMajorStep()
293 int numSteps = 0; in qwtDivideMajorStep() local
310 if ( numSteps > 0 ) in qwtDivideMajorStep()
317 int numSteps = 0; in qwtDivideMajorStep() local
334 if ( numSteps > 0 ) in qwtDivideMajorStep()
379 if ( numSteps > 0 ) in qwtDivideMajorStep()
[all …]
/dports/science/cantera/cantera-2.5.1-611-gc4d6ecc15/test/thermo/
H A DBinarySolutionTabulatedThermo_Test.cpp49 int numSteps= 9; in TEST_F() local
50 double dx = (xmax-xmin)/(numSteps-1); in TEST_F()
80 int numSteps= 9; in TEST_F() local
81 double dx = (xmax-xmin)/(numSteps-1); in TEST_F()
82 for (int i = 0; i < numSteps; ++i) in TEST_F()
112 int numSteps= 9; in TEST_F() local
113 double dx = (xmax-xmin)/(numSteps-1); in TEST_F()
115 for (int i = 0; i < numSteps; ++i) in TEST_F()
129 int numSteps= 9; in TEST_F() local
132 for (int i = 0; i < numSteps; ++i) in TEST_F()
[all …]
H A DPengRobinson_Test.cpp55 int numSteps = 9; in TEST_F() local
58 for(int i=0; i < numSteps; ++i) in TEST_F()
77 int numSteps = 9; in TEST_F() local
80 for(int i=0; i < numSteps; ++i) in TEST_F()
103 int numSteps = 9; in TEST_F() local
106 for(int i=0; i < numSteps; ++i) in TEST_F()
134 int numSteps = 9; in TEST_F() local
138 for(int i=0; i < numSteps; ++i) in TEST_F()
243 int numSteps = 9; in TEST_F() local
265 int numSteps = 9; in TEST_F() local
[all …]
H A DRedlichKisterTest.cpp57 int numSteps = 9; in TEST_F() local
58 double dx = (xmax-xmin)/(numSteps-1); in TEST_F()
87 int numSteps = 9; in TEST_F() local
88 double dx = (xmax-xmin)/(numSteps-1); in TEST_F()
111 int numSteps = 9; in TEST_F() local
112 double dx = (xmax-xmin)/(numSteps-1); in TEST_F()
114 for(int i=0; i < numSteps; ++i) in TEST_F()
142 int numSteps = 9; in TEST_F() local
143 double dx = (xmax-xmin)/(numSteps-1); in TEST_F()
192 int numSteps = 9; in TEST_F() local
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/Plugin/
H A DTetrahedralize.cpp72 int numSteps = data1->getNumTimeSteps(); in execute() local
81 for(int step = 0; step < numSteps; step++) in execute()
114 if((int)p[0]->val.size() == 9 * numSteps && in execute()
115 (int)p[1]->val.size() == 9 * numSteps && in execute()
116 (int)p[2]->val.size() == 9 * numSteps && in execute()
117 (int)p[3]->val.size() == 9 * numSteps) { in execute()
130 else if((int)p[0]->val.size() == numSteps && in execute()
131 (int)p[1]->val.size() == numSteps && in execute()
132 (int)p[2]->val.size() == numSteps && in execute()
133 (int)p[3]->val.size() == numSteps) { in execute()
[all …]
/dports/science/madness/madness-ebb3fd7/src/madness/external/elemental/include/elemental/lapack-like/factor/
H A DID.hpp100 pinvTol = numSteps*epsilon; in BusingerGolub()
106 auto RL = LockedViewRange( A, 0, 0, numSteps, numSteps ); in BusingerGolub()
107 auto RR = LockedViewRange( A, 0, numSteps, numSteps, n ); in BusingerGolub()
131 pinvTol = numSteps*epsilon; in BusingerGolub()
137 auto RL = LockedViewRange( A, 0, 0, numSteps, numSteps ); in BusingerGolub()
138 auto RR = LockedViewRange( A, 0, numSteps, numSteps, n ); in BusingerGolub()
176 ID( A, pPerm, Z, numSteps, Base<F>(-1) ); in ID()
186 ID( A, pPerm, Z, numSteps, Base<F>(-1), canOverwrite ); in ID()
225 Int numSteps ) in ID() argument
228 ID( A, pPerm, Z, numSteps, Base<F>(-1) ); in ID()
[all …]
H A DSkeleton.hpp39 const Int numSteps = qr::BusingerGolub( B, permR, maxSteps, tol ); in Skeleton() local
44 B.Resize( B.Height(), numSteps ); in Skeleton()
53 qr::BusingerGolub( B, permC, numSteps ); in Skeleton()
58 B.Resize( B.Height(), numSteps ); in Skeleton()
78 const Int numSteps = qr::BusingerGolub( B, permR, maxSteps, tol ); in Skeleton() local
83 B.Resize( B.Height(), numSteps ); in Skeleton()
92 qr::BusingerGolub( B, permC, numSteps ); in Skeleton()
97 B.Resize( B.Height(), numSteps ); in Skeleton()
/dports/graphics/osg/OpenSceneGraph-OpenSceneGraph-3.6.5/src/osgText/
H A DStyle.cpp54 void Bevel::roundedBevel(float width, unsigned int numSteps) in roundedBevel() argument
61 for(; i<=numSteps; ++i) in roundedBevel()
63 float angle = float(osg::PI)*0.5f*(float(i)/float(numSteps)); in roundedBevel()
69 for(; i<=numSteps; ++i) in roundedBevel()
71 float angle = float(osg::PI)*0.5f*(float(numSteps-i)/float(numSteps)); in roundedBevel()
76 void Bevel::roundedBevel2(float width, unsigned int numSteps) in roundedBevel2() argument
88 for(; i<=numSteps; ++i) in roundedBevel2()
90 float angle = float(osg::PI)*0.5f*(float(i)/float(numSteps)); in roundedBevel2()
96 for(; i<=numSteps; ++i) in roundedBevel2()
98 float angle = float(osg::PI)*0.5f*(float(numSteps-i)/float(numSteps)); in roundedBevel2()
/dports/graphics/osg34/OpenSceneGraph-OpenSceneGraph-3.4.1/src/osgText/
H A DStyle.cpp54 void Bevel::roundedBevel(float width, unsigned int numSteps) in roundedBevel() argument
61 for(; i<=numSteps; ++i) in roundedBevel()
63 float angle = float(osg::PI)*0.5f*(float(i)/float(numSteps)); in roundedBevel()
69 for(; i<=numSteps; ++i) in roundedBevel()
71 float angle = float(osg::PI)*0.5f*(float(numSteps-i)/float(numSteps)); in roundedBevel()
76 void Bevel::roundedBevel2(float width, unsigned int numSteps) in roundedBevel2() argument
88 for(; i<=numSteps; ++i) in roundedBevel2()
90 float angle = float(osg::PI)*0.5f*(float(i)/float(numSteps)); in roundedBevel2()
96 for(; i<=numSteps; ++i) in roundedBevel2()
98 float angle = float(osg::PI)*0.5f*(float(numSteps-i)/float(numSteps)); in roundedBevel2()
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Filtering/Path/include/
H A DitkChainCodeToFourierSeriesPathFilter.hxx51 size_t numSteps; in GenerateData() local
63 numSteps = inputPtr->NumberOfSteps(); in GenerateData()
73 else if ( numHarmonics * 2 > numSteps ) in GenerateData()
75 numHarmonics = numSteps / 2; in GenerateData()
84 for ( InputPathInputType step = 0; step < numSteps; step++ ) in GenerateData()
87 theta = 2 * n * nPI * ( double(step + 1) ) / numSteps; in GenerateData()
95 cosCoefficient += indexVector * ( std::cos(theta) / numSteps ); in GenerateData()
96 sinCoefficient += indexVector * ( std::sin(theta) / numSteps ); in GenerateData()
H A DitkPathFunctions.h95 size_t numSteps = chainPath.NumberOfSteps();
106 else if ( numHarmonics * 2 > numSteps )
108 numHarmonics = numSteps / 2;
117 for ( ChainInputType step = 0; step < numSteps; step++ )
120 theta = 2 * n * PI * ( double(step + 1) ) / numSteps;
127 cosCoefficient += indexVector * ( std::cos(theta) / numSteps );
128 sinCoefficient += indexVector * ( std::sin(theta) / numSteps );
/dports/science/cdo/cdo-2.0.0/src/
H A DRunstat.cc130 int numSteps = 0; in Runstat() local
143 numSteps = (tsID < ndates) ? tsID : ndates - 1; in Runstat()
145 dtlist.taxis_inq_timestep(taxisID1, numSteps); in Runstat()
159 auto &rvars1 = vars1[numSteps][varID][levelID]; in Runstat()
166 vars2[numSteps][varID][levelID].nmiss = rvars1.nmiss; in Runstat()
167 vars2[numSteps][varID][levelID].vec_d = rvars1.vec_d; in Runstat()
186 for (int inp = 0; inp < numSteps; inp++) in Runstat()
196 field2_moq(vars2[numSteps][varID][levelID], vars1[numSteps][varID][levelID]); in Runstat()
200 for (int inp = 0; inp < numSteps; inp++) in Runstat()
210 for (int inp = 0; inp < numSteps; inp++) in Runstat()
[all …]
/dports/comms/hamlib/hamlib-4.3.1/rigs/aor/
H A Dar7030.c193 rxr_writeByte(rig, 0x30 | (0x0F & (char)(numSteps >> 4)));
194 rxr_writeByte(rig, 0x60 | (0x0F & (char)(numSteps)));
204 rxr_writeByte(rig, 0x30 | (0x0F & (char)(numSteps >> 4))); in Execute_Routine_3_1()
205 rxr_writeByte(rig, 0x60 | (0x0F & (char)(numSteps))); in Execute_Routine_3_1()
217 rxr_writeByte(rig, 0x30 | (0x0F & (char)(numSteps >> 4))); in Execute_Routine_4_1()
223 rxr_writeByte(rig, 0x60 | (0x0F & (char)(numSteps))); in Execute_Routine_4_1()
238 rxr_writeByte(rig, 0x60 | (0x0F & (char)(numSteps >> 8))); in Execute_Routine_4_3()
239 rxr_writeByte(rig, 0x30 | (0x0F & (char)(numSteps >> 4))); in Execute_Routine_4_3()
240 rxr_writeByte(rig, 0x60 | (0x0F & (char)(numSteps))); in Execute_Routine_4_3()
256 rxr_writeByte(rig, 0x60 | (0x0F & (char)(numSteps)));
[all …]
/dports/misc/glow/glow-f24d960e3cc80db95ac0bc17b1900dbf60ca044a/examples/
H A Dchar-rnn.cpp162 dim_t minibatchSize, dim_t numSteps, in createNetwork() argument
167 ElemKind::FloatTy, {minibatchSize, numSteps, 128}, "input", false); in createNetwork()
177 for (unsigned t = 0; t < numSteps; t++) { in createNetwork()
193 for (unsigned i = 0; i < numSteps; i++) { in createNetwork()
215 const dim_t numSteps = 50; in main() local
217 const dim_t batchSize = text.size() - numSteps; in main()
220 CHECK_GT(text.size(), numSteps) << "Text is too short"; in main()
240 Tensor thisCharTrain(ElemKind::FloatTy, {batchSize, numSteps, 128}); in main()
241 Tensor nextCharTrain(ElemKind::Int64ITy, {batchSize, numSteps}); in main()
281 input.insert(input.begin(), text.begin(), text.begin() + numSteps); in main()
[all …]
H A Dptb.cpp58 unsigned loadPTB(Tensor &inputWords, Tensor &targetWords, dim_t numSteps, in loadPTB() argument
116 dim_t numBatches = (batchLength - 1) / numSteps; in loadPTB()
122 inputWords.reset(ElemKind::FloatTy, {numSequences, vocabSize * numSteps}); in loadPTB()
123 targetWords.reset(ElemKind::Int64ITy, {numSequences, numSteps}); in loadPTB()
129 for (unsigned step = 0; step < numSteps; step++) { in loadPTB()
130 int wordCounterId = step + iter * numSteps + batch * batchLength; in loadPTB()
173 const dim_t numSteps = 10; in testPTB() local
207 for (unsigned t = 0; t < numSteps; t++) { in testPTB()
244 size_t numBatches = (numWords / minibatchSize - 1) / numSteps; in testPTB()
266 {minibatchSize, vocabSize * numSteps}); in testPTB()
[all …]
/dports/science/madness/madness-ebb3fd7/src/madness/external/elemental/include/elemental/convex/SVT/
H A DPivotedQR.hpp26 PivotedQR( Matrix<F>& A, Base<F> tau, Int numSteps, bool relative=false ) in PivotedQR() argument
30 if( numSteps > std::min(A.Height(),A.Width()) ) in PivotedQR()
39 qr::BusingerGolub( ACopy, t, d, pPerm, numSteps ); in PivotedQR()
41 LockedView( ACopyUpper, ACopy, 0, 0, numSteps, n ); in PivotedQR()
53 ACopy.Resize( m, numSteps ); in PivotedQR()
64 PivotedQR( DistMatrix<F>& A, Base<F> tau, Int numSteps, bool relative=false ) in PivotedQR() argument
68 if( numSteps > std::min(A.Height(),A.Width()) ) in PivotedQR()
79 qr::BusingerGolub( ACopy, t, d, pPerm, numSteps ); in PivotedQR()
81 LockedView( ACopyUpper, ACopy, 0, 0, numSteps, n ); in PivotedQR()
93 ACopy.Resize( m, numSteps ); in PivotedQR()
/dports/astro/tkgeomap/tkgeomap-2.11.6/tk/
H A DtkTrig.c533 int numSteps; /* Number of curve points to
541 t = ((double) i)/((double) numSteps);
582 int numSteps; /* Number of curve points to
590 t = ((double) i)/((double) numSteps);
665 return 1 + numPoints * numSteps;
684 xPoints += numSteps+1;
690 dblPoints += 2*(numSteps+1);
692 outputPoints += numSteps+1;
776 xPoints += numSteps;
780 dblPoints += 2*numSteps;
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/trilinos/packages/rol/src/function/simopt/
H A DROL_Objective_SimOpt.hpp281 for(int i=0;i<numSteps;++i) { in checkGradient_1()
304 int numSteps = steps.size(); in checkGradient_1() local
401 for(int i=0;i<numSteps;++i) { in checkGradient_2()
424 int numSteps = steps.size(); in checkGradient_2() local
535 for(int i=0;i<numSteps;++i) { in checkHessVec_11()
561 int numSteps = steps.size(); in checkHessVec_11() local
679 for(int i=0;i<numSteps;++i) { in checkHessVec_12()
705 int numSteps = steps.size(); in checkHessVec_12() local
826 for(int i=0;i<numSteps;++i) { in checkHessVec_21()
852 int numSteps = steps.size(); in checkHessVec_21() local
[all …]
/dports/x11-toolkits/tk87/tk8.7a5/generic/
H A DtkTrig.c1065 xPoints += numSteps+1; in TkMakeBezierCurve()
1073 outputPoints += numSteps+1; in TkMakeBezierCurve()
1154 xPoints += numSteps; in TkMakeBezierCurve()
1158 dblPoints += 2*numSteps; in TkMakeBezierCurve()
1160 outputPoints += numSteps; in TkMakeBezierCurve()
1270 xPoints += numSteps; in TkMakeRawCurve()
1274 dblPoints += 2*numSteps; in TkMakeRawCurve()
1276 outputPoints += numSteps; in TkMakeRawCurve()
1331 xPoints += numSteps; in TkMakeRawCurve()
1335 dblPoints += 2*numSteps; in TkMakeRawCurve()
[all …]
/dports/x11-toolkits/tk86/tk8.6.12/generic/
H A DtkTrig.c1068 xPoints += numSteps+1; in TkMakeBezierCurve()
1076 outputPoints += numSteps+1; in TkMakeBezierCurve()
1157 xPoints += numSteps; in TkMakeBezierCurve()
1161 dblPoints += 2*numSteps; in TkMakeBezierCurve()
1163 outputPoints += numSteps; in TkMakeBezierCurve()
1273 xPoints += numSteps; in TkMakeRawCurve()
1277 dblPoints += 2*numSteps; in TkMakeRawCurve()
1279 outputPoints += numSteps; in TkMakeRawCurve()
1334 xPoints += numSteps; in TkMakeRawCurve()
1338 dblPoints += 2*numSteps; in TkMakeRawCurve()
[all …]
/dports/misc/visp/visp-3.4.0/modules/sensor/include/visp3/sensor/
H A DvpLaserScan.h70 …: listScanPoints(), startTimestamp(0), endTimestamp(0), measurementId(0), numSteps(0), startAngle(… in vpLaserScan()
76 …ScanPoints(scan.listScanPoints), startTimestamp(0), endTimestamp(0), measurementId(0), numSteps(0), in vpLaserScan()
82 numSteps = scan.numSteps; in vpLaserScan()
108 inline void setNumSteps(const unsigned short &num_steps) { this->numSteps = num_steps; } in setNumSteps()
125 unsigned short numSteps; variable
/dports/science/gromacs/gromacs-2021.4/src/programs/mdrun/tests/
H A Dmultiple_time_stepping.cpp95 const int numSteps = 4; in TEST_P() local
107 numSteps, isPullTest ? "reaction-field" : "PME"); in TEST_P()
125 const int nstfout = 2 * numSteps; in TEST_P()
134 numSteps, numSteps, nstfout); in TEST_P()
147 mtsScheme.c_str(), numSteps, numSteps, nstfout); in TEST_P()

12345678910>>...32