Home
last modified time | relevance | path

Searched refs:m_num (Results 51 – 75 of 517) sorted by relevance

12345678910>>...21

/dports/editors/lazarus/lazarus/components/aggpas/src/
H A Dagg_bspline.pas56 m_num : int;
97 m_num:=0;
148 m_num :=0;
183 if m_num < m_max then
188 inc(m_num );
202 if m_num > 2 then
207 n1:=3 * m_num;
220 n1:=m_num - 1;
270 while i < m_num - 2 do
299 if m_num > 2 then
[all …]
H A Dagg_ellipse.pas53 m_num ,
89 m_num :=4;
107 m_num :=num_steps;
111 if m_num = 0 then
124 m_num :=num_steps;
128 if m_num = 0 then
155 if m_step = m_num then
165 if m_step > m_num then
173 angle:=m_step / m_num * 2.0 * pi;
200 m_num:=trunc(2 * pi / da );
/dports/editors/lazarus-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/components/aggpas/src/
H A Dagg_bspline.pas56 m_num : int;
97 m_num:=0;
148 m_num :=0;
183 if m_num < m_max then
188 inc(m_num );
202 if m_num > 2 then
207 n1:=3 * m_num;
220 n1:=m_num - 1;
270 while i < m_num - 2 do
299 if m_num > 2 then
[all …]
H A Dagg_ellipse.pas53 m_num ,
89 m_num :=4;
107 m_num :=num_steps;
111 if m_num = 0 then
124 m_num :=num_steps;
128 if m_num = 0 then
155 if m_step = m_num then
165 if m_step > m_num then
173 angle:=m_step / m_num * 2.0 * pi;
200 m_num:=trunc(2 * pi / da );
/dports/editors/lazarus-qt5/lazarus/components/aggpas/src/
H A Dagg_bspline.pas56 m_num : int;
97 m_num:=0;
148 m_num :=0;
183 if m_num < m_max then
188 inc(m_num );
202 if m_num > 2 then
207 n1:=3 * m_num;
220 n1:=m_num - 1;
270 while i < m_num - 2 do
299 if m_num > 2 then
[all …]
/dports/editors/lazarus-qt5-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/components/aggpas/src/
H A Dagg_bspline.pas56 m_num : int;
97 m_num:=0;
148 m_num :=0;
183 if m_num < m_max then
188 inc(m_num );
202 if m_num > 2 then
207 n1:=3 * m_num;
220 n1:=m_num - 1;
270 while i < m_num - 2 do
299 if m_num > 2 then
[all …]
/dports/math/wxmaxima/wxmaxima-Version-20.04.0/src/
H A DFracCell.cpp55 if(cell.m_num) in FracCell()
56 SetNum(cell.m_num->CopyList()); in FracCell()
87 m_num = std::shared_ptr<Cell>(num); in SetNum()
88 m_numParenthesis->SetInner(m_num); in SetNum()
245 if (m_num->IsCompound()) in ToString()
288 if (m_num->IsCompound()) in ToMatlab()
291 s += m_num->ListToMatlab() + wxT("/"); in ToMatlab()
346 m_num->ListToMathML() + in ToMathML()
385 if (m_num && (!m_num->IsCompound())) in SetupBreakUps()
386 m_displayedNum = m_num; in SetupBreakUps()
[all …]
H A DTipOfTheDay.cpp183 m_num = 0; in TipOfTheDay()
186 if(m_num < 0) in TipOfTheDay()
187 m_num = m_tips.GetCount()-1; in TipOfTheDay()
189 m_num = 0; in TipOfTheDay()
319 m_num++; in OnNextButton()
321 m_num = 0; in OnNextButton()
322 m_tip->SetValue(m_tips[m_num]); in OnNextButton()
327 m_num--; in OnPreviousButton()
328 if(m_num < 0) in OnPreviousButton()
329 m_num = m_tips.GetCount()-1; in OnPreviousButton()
[all …]
/dports/multimedia/webcamoid/webcamoid-8.8.0/libAvKys/Lib/src/
H A Dakfrac.cpp30 qint64 m_num; member in AkFracPrivate
43 this->d->m_num = 0; in AkFrac()
51 this->d->m_num = 0; in AkFrac()
61 this->d->m_num = 0; in AkFrac()
71 this->d->m_num = other.d->m_num; in AkFrac()
83 this->d->m_num = other.d->m_num; in operator =()
98 return this->d->m_num * other.d->m_den == this->d->m_den * other.d->m_num; in operator ==()
108 return AkFrac(this->d->m_num * other.d->m_num, in operator *()
124 return this->d->m_num; in num()
169 this->d->m_num = 0; in setNumDen()
[all …]
/dports/math/z3/z3-z3-4.8.13/src/util/
H A Dmpq.cpp80 set(f, a.m_num); in floor()
92 set(c, a.m_num); in ceil()
132 display(out, a.m_num); in display()
187 reset(a.m_num); in set()
282 neg(a.m_num); in set()
313 return root(a.m_num, n, r.m_num) && root(a.m_den, n, r.m_den); in root()
331 if (SUB) sub(tmp1, tmp2, c.m_num); else add(tmp1, tmp2, c.m_num); in lin_arith_op()
357 div(a.m_num, g2, tmp1); in rat_mul()
358 div(b.m_num, g1, tmp2); in rat_mul()
364 mul(a.m_num, b.m_num, c.m_num); in rat_mul()
[all …]
H A Dmpbq.h34 mpz m_num; variable
38 mpbq():m_num(0), m_k(0) {} in mpbq()
39 mpbq(int v):m_num(v), m_k(0) {} in mpbq()
40 mpbq(int v, unsigned k):m_num(v), m_k(k) {} in mpbq()
43 void swap(mpbq & other) { m_num.swap(other.m_num); std::swap(m_k, other.m_k); } in swap()
85 void set(mpbq & a, mpbq const & b) { m_manager.set(a.m_num, b.m_num); a.m_k = b.m_k; } in set()
140 …ool eq(mpbq const & a, mpbq const & b) { return a.m_k == b.m_k && m_manager.eq(a.m_num, b.m_num); } in eq()
219 m.set(f, a.m_num); in floor()
223 m.machine_div2k(a.m_num, a.m_k, f); in floor()
231 m.set(c, a.m_num); in ceil()
[all …]
/dports/math/py-z3-solver/z3-z3-4.8.10/src/util/
H A Dmpq.cpp80 set(f, a.m_num); in floor()
92 set(c, a.m_num); in ceil()
132 display(out, a.m_num); in display()
187 reset(a.m_num); in set()
281 neg(a.m_num); in set()
312 return root(a.m_num, n, r.m_num) && root(a.m_den, n, r.m_den); in root()
330 if (SUB) sub(tmp1, tmp2, c.m_num); else add(tmp1, tmp2, c.m_num); in lin_arith_op()
356 div(a.m_num, g2, tmp1); in rat_mul()
357 div(b.m_num, g1, tmp2); in rat_mul()
363 mul(a.m_num, b.m_num, c.m_num); in rat_mul()
[all …]
H A Dmpbq.h34 mpz m_num; variable
38 mpbq():m_num(0), m_k(0) {} in mpbq()
39 mpbq(int v):m_num(v), m_k(0) {} in mpbq()
40 mpbq(int v, unsigned k):m_num(v), m_k(k) {} in mpbq()
43 void swap(mpbq & other) { m_num.swap(other.m_num); std::swap(m_k, other.m_k); } in swap()
85 void set(mpbq & a, mpbq const & b) { m_manager.set(a.m_num, b.m_num); a.m_k = b.m_k; } in set()
140 …ool eq(mpbq const & a, mpbq const & b) { return a.m_k == b.m_k && m_manager.eq(a.m_num, b.m_num); } in eq()
219 m.set(f, a.m_num); in floor()
223 m.machine_div2k(a.m_num, a.m_k, f); in floor()
231 m.set(c, a.m_num); in ceil()
[all …]
/dports/net/yaz++/yazpp-1.6.1/src/
H A Dyaz-z-databases.cpp18 m_num = 0; in Yaz_Z_Databases()
32 m_num = num; in set()
39 *num = m_num; in get()
40 *db = (char **) nmem_malloc (n, m_num * sizeof(char*)); in get()
41 for (int i = 0; i < m_num; i++) in get()
52 if (db.m_num != m_num) in match()
54 for (int i = 0; i<m_num; i++) in match()
62 if (num != m_num) in match()
64 for (int i = 0; i<m_num; i++) in match()
/dports/multimedia/opentoonz/opentoonz-1.5.0/toonz/sources/toonzlib/
H A Dcellpositionratio.cpp28 int gcd = greatestCommonDivisor(m_num, m_denom); in normalize()
30 m_num /= gcd; in normalize()
40 Ratio::Ratio(int num, int denom) : m_num(num), m_denom(denom) { in Ratio()
46 return Ratio(a.m_num * b.m_num, a.m_denom * b.m_denom); in operator *()
49 return Ratio(a.m_num * b.m_denom, a.m_denom * b.m_num); in operator /()
57 return Ratio(a.m_num * aMult + b.m_num * bMult, denom); in operator +()
65 return Ratio(a.m_num * aMult - b.m_num * bMult, denom); in operator -()
68 int operator*(const Ratio &a, int b) { return a.m_num * b / a.m_denom; } in operator *()
/dports/math/piranha/piranha-0.11/src/
H A Drational_function.hpp272 retval.m_num = a.m_num + b.m_num; in dispatch_binary_add()
276 retval.m_num = a.m_num * b.m_den + b.m_num; in dispatch_binary_add()
280 retval.m_num = a.m_num + b.m_num * a.m_den; in dispatch_binary_add()
284 retval.m_num = a.m_num * b.m_den + a.m_den * b.m_num; in dispatch_binary_add()
321 retval.m_num = a.m_num - b.m_num; in dispatch_binary_sub()
324 retval.m_num = a.m_num * b.m_den - b.m_num; in dispatch_binary_sub()
327 retval.m_num = a.m_num - b.m_num * a.m_den; in dispatch_binary_sub()
330 retval.m_num = a.m_num * b.m_den - a.m_den * b.m_num; in dispatch_binary_sub()
362 retval.m_num = a.m_num * b.m_num; in dispatch_binary_mul()
365 retval.m_num = a.m_num * b.m_num; in dispatch_binary_mul()
[all …]
H A Dmp_rational.hpp244 m_num += other.m_num; in in_place_add()
249 m_num = m_num * other.m_den + other.m_num; in in_place_add()
257 m_num += other.m_num; in in_place_add()
332 m_num -= other.m_num; in in_place_sub()
334 m_num = m_num * other.m_den - other.m_num; in in_place_sub()
337 m_num = m_num - m_den * other.m_num; in in_place_sub()
339 m_num -= other.m_num; in in_place_sub()
414 m_num *= other.m_num; in in_place_mult()
417 m_num *= other.m_num; in in_place_mult()
579 return q1.m_num < q2.m_num; in binary_less_than()
[all …]
/dports/math/py-piranha/piranha-0.11/src/
H A Drational_function.hpp272 retval.m_num = a.m_num + b.m_num; in dispatch_binary_add()
276 retval.m_num = a.m_num * b.m_den + b.m_num; in dispatch_binary_add()
280 retval.m_num = a.m_num + b.m_num * a.m_den; in dispatch_binary_add()
284 retval.m_num = a.m_num * b.m_den + a.m_den * b.m_num; in dispatch_binary_add()
321 retval.m_num = a.m_num - b.m_num; in dispatch_binary_sub()
324 retval.m_num = a.m_num * b.m_den - b.m_num; in dispatch_binary_sub()
327 retval.m_num = a.m_num - b.m_num * a.m_den; in dispatch_binary_sub()
330 retval.m_num = a.m_num * b.m_den - a.m_den * b.m_num; in dispatch_binary_sub()
362 retval.m_num = a.m_num * b.m_num; in dispatch_binary_mul()
365 retval.m_num = a.m_num * b.m_num; in dispatch_binary_mul()
[all …]
H A Dmp_rational.hpp244 m_num += other.m_num; in in_place_add()
249 m_num = m_num * other.m_den + other.m_num; in in_place_add()
257 m_num += other.m_num; in in_place_add()
332 m_num -= other.m_num; in in_place_sub()
334 m_num = m_num * other.m_den - other.m_num; in in_place_sub()
337 m_num = m_num - m_den * other.m_num; in in_place_sub()
339 m_num -= other.m_num; in in_place_sub()
414 m_num *= other.m_num; in in_place_mult()
417 m_num *= other.m_num; in in_place_mult()
579 return q1.m_num < q2.m_num; in binary_less_than()
[all …]
/dports/graphics/cfdg/cfdg-3.3_1/src-agg/agg2/
H A Dagg_ellipse.h35 m_num(4), m_step(0), m_cw(false) {} in ellipse()
40 m_num(num_steps), m_step(0), m_cw(cw) in m_x()
42 if(m_num == 0) calc_num_steps(); in m_x()
60 unsigned m_num; variable
73 m_num = num_steps; in init()
76 if(m_num == 0) calc_num_steps(); in init()
91 m_num = uround(2*pi / da); in calc_num_steps()
103 if(m_step == m_num) in vertex()
108 if(m_step > m_num) return path_cmd_stop; in vertex()
109 double angle = double(m_step) / double(m_num) * 2.0 * pi; in vertex()
/dports/graphics/agg/agg-2.5/include/
H A Dagg_ellipse.h40 m_num(4), m_step(0), m_cw(false) {} in ellipse()
45 m_num(num_steps), m_step(0), m_cw(cw) in m_x()
47 if(m_num == 0) calc_num_steps(); in m_x()
65 unsigned m_num; variable
78 m_num = num_steps; in init()
81 if(m_num == 0) calc_num_steps(); in init()
96 m_num = uround(2*pi / da); in calc_num_steps()
108 if(m_step == m_num) in vertex()
113 if(m_step > m_num) return path_cmd_stop; in vertex()
114 double angle = double(m_step) / double(m_num) * 2.0 * pi; in vertex()
/dports/math/py-matplotlib2/matplotlib-2.2.4/extern/agg24-svn/include/
H A Dagg_ellipse.h35 m_num(4), m_step(0), m_cw(false) {} in ellipse()
40 m_num(num_steps), m_step(0), m_cw(cw) in m_x()
42 if(m_num == 0) calc_num_steps(); in m_x()
60 unsigned m_num; variable
73 m_num = num_steps; in init()
76 if(m_num == 0) calc_num_steps(); in init()
91 m_num = uround(2*pi / da); in calc_num_steps()
103 if(m_step == m_num) in vertex()
108 if(m_step > m_num) return path_cmd_stop; in vertex()
109 double angle = double(m_step) / double(m_num) * 2.0 * pi; in vertex()
/dports/math/py-matplotlib/matplotlib-3.4.3/extern/agg24-svn/include/
H A Dagg_ellipse.h35 m_num(4), m_step(0), m_cw(false) {} in ellipse()
40 m_num(num_steps), m_step(0), m_cw(cw) in m_x()
42 if(m_num == 0) calc_num_steps(); in m_x()
60 unsigned m_num; variable
73 m_num = num_steps; in init()
76 if(m_num == 0) calc_num_steps(); in init()
91 m_num = uround(2*pi / da); in calc_num_steps()
103 if(m_step == m_num) in vertex()
108 if(m_step > m_num) return path_cmd_stop; in vertex()
109 double angle = double(m_step) / double(m_num) * 2.0 * pi; in vertex()
/dports/graphics/mapserver/mapserver-7.6.4/renderers/agg/include/
H A Dagg_ellipse.h35 m_num(4), m_step(0), m_cw(false) {} in ellipse()
40 m_num(num_steps), m_step(0), m_cw(cw) in m_x()
42 if(m_num == 0) calc_num_steps(); in m_x()
60 unsigned m_num; variable
73 m_num = num_steps; in init()
76 if(m_num == 0) calc_num_steps(); in init()
91 m_num = uround(2*pi / da); in calc_num_steps()
103 if(m_step == m_num) in vertex()
108 if(m_step > m_num) return path_cmd_stop; in vertex()
109 double angle = double(m_step) / double(m_num) * 2.0 * pi; in vertex()
/dports/sysutils/fluxengine/fluxengine-61ff48c/dep/agg/include/
H A Dagg_ellipse.h35 m_num(4), m_step(0), m_cw(false) {}
40 m_num(num_steps), m_step(0), m_cw(cw)
42 if(m_num == 0) calc_num_steps();
60 unsigned m_num;
73 m_num = num_steps;
76 if(m_num == 0) calc_num_steps();
91 m_num = uround(2*pi / da);
103 if(m_step == m_num)
108 if(m_step > m_num) return path_cmd_stop;
109 double angle = double(m_step) / double(m_num) * 2.0 * pi;

12345678910>>...21