| /dports/devel/hyperscan/boost_1_75_0/libs/math/tools/ |
| H A D | generate_rational_code.cpp | 54 for(int order = 2; order <= i; ++order) in print_polynomials() local
64 ofs << "a[" << order - 1 << "] * x + a[" << order - 2 << "]" ; in print_polynomials()
119 for(int order = 5; order <= i; ++order) in print_polynomials() local
128 if(order & 1) in print_polynomials()
132 ofs << "a[" << order - 1 << "] * x2 + a[" << order - 3 << "]" ; in print_polynomials()
215 for(int order = 5; order <= i; ++order) in print_polynomials() local
295 for(int order = 2; order <= i; ++order) in print_rationals() local
306 ofs << "a[" << order - 1 << "] * x + a[" << order - 2 << "]" ; in print_rationals()
315 ofs << "b[" << order - 1 << "] * x + b[" << order - 2 << "]" ; in print_rationals()
390 for(int order = 5; order <= i; ++order) in print_rationals() local
[all …]
|
| /dports/finance/gnucash/gnucash-4.9/libgnucash/engine/ |
| H A D | gncOrder.c | 159 GncOrder *order; in gnc_order_set_property() local
283 GncOrder *order; in gncOrderCreate() local
298 return order; in gncOrderCreate()
319 if (order->printname) g_free (order->printname); in gncOrderFree()
331 SET_STR (order, order->id, id); in gncOrderSetID()
370 SET_STR (order, order->notes, notes); in gncOrderSetNotes()
378 SET_STR (order, order->reference, reference); in gncOrderSetReference()
406 order->entries = g_list_insert_sorted (order->entries, entry, in gncOrderAddEntry()
421 order->entries = g_list_remove (order->entries, entry); in gncOrderRemoveEntry()
540 if (qof_instance_get_dirty_flag(order) || order->printname == NULL) in _gncOrderPrintable()
[all …]
|
| /dports/mail/sympa/sympa-6.2.62/src/lib/Sympa/Config/ |
| H A D | Schema.pm | 61 order => 4,
77 order => 20,
98 order => 50,
147 order => 59,
153 order => 60,
159 order => 70,
166 order => 71,
173 order => 72,
219 order => 1.01,
243 order => 1.10,
[all …]
|
| /dports/finance/odoo/odoo-19d77c2a03335eb95a686bd69a1b56b38e87d609/odoo/addons/sale_coupon/tests/ |
| H A D | test_program_numbers.py | 87 order = self.empty_order
92 'order_id': order.id,
124 order = self.empty_order
129 'order_id': order.id,
135 'order_id': order.id,
156 'order_id': order.id,
179 order = self.empty_order
185 'order_id': order.id,
218 'order_id': order.id,
260 order = self.empty_order
[all …]
|
| /dports/math/openturns/openturns-1.18/python/test/ |
| H A D | t_SobolIndicesAlgorithm_std.expout | 3 First order indices = [0.302751,0.460825,0.00669407]
4 Total order indices = [0.57499,0.427147,0.256687]
6 First order indices interval = [0.282294, 0.325412]
9 Total order indices interval = [0.541877, 0.613681]
19 First order indices interval = [0.282378, 0.323124]
22 Total order indices interval = [0.549412, 0.600568]
28 Total order indices = [0.541876,0.44902,0.240918]
30 First order indices interval = [0.293741, 0.341577]
33 Total order indices interval = [0.508571, 0.590435]
76 Total order indices = [0.55807,0.437403,0.243616]
[all …]
|
| /dports/cad/csxcad/CSXCAD-0.6.2-103-g3c4fb66/src/ |
| H A D | CSPropLorentzMaterial.h | 41 void SetEpsPlasmaFreq(int order, double val, int ny=0) {SetValue(val,EpsPlasma[order],ny);}
45 double GetEpsPlasmaFreq(int order, int ny=0) {return GetValue(EpsPlasma[order],ny);}
54 …asmaFreqWeighted(int order, int ny, const double* coords) {return GetWeight(WeightEpsPlasma[order]… in GetEpsPlasmaFreqWeighted() argument
57 void SetEpsLorPoleFreq(int order, double val, int ny=0) {SetValue(val,EpsLorPole[order],ny);}
61 double GetEpsLorPoleFreq(int order, int ny=0) {return GetValue(EpsLorPole[order],ny);}
73 void SetEpsRelaxTime(int order, double val, int ny=0) {SetValue(val,EpsRelaxTime[order],ny);}
77 double GetEpsRelaxTime(int order, int ny=0) {return GetValue(EpsRelaxTime[order],ny);}
89 void SetMuePlasmaFreq(int order, double val, int ny=0) {SetValue(val,MuePlasma[order],ny);}
93 double GetMuePlasmaFreq(int order, int ny=0) {return GetValue(MuePlasma[order],ny);}
109 double GetMueLorPoleFreq(int order, int ny=0) {return GetValue(MueLorPole[order],ny);}
[all …]
|
| /dports/finance/quickfix/quickfix-1.15.1/src/python2/ |
| H A D | quickfix41.py | 46 order[0] = 104
47 order[1] = 0
78 order[0] = 46
79 order[1] = 65
80 order[2] = 48
81 order[3] = 22
91 order[13] = 0
97 order[0] = 58
98 order[1] = 0
129 order[1] = 0
[all …]
|
| /dports/finance/quickfix/quickfix-1.15.1/src/python3/ |
| H A D | quickfix41.py | 46 order[0] = 104
47 order[1] = 0
78 order[0] = 46
79 order[1] = 65
80 order[2] = 48
81 order[3] = 22
91 order[13] = 0
97 order[0] = 58
98 order[1] = 0
129 order[1] = 0
[all …]
|
| /dports/finance/quickfix/quickfix-1.15.1/src/python/ |
| H A D | quickfix41.py | 46 order[0] = 104
47 order[1] = 0
78 order[0] = 46
79 order[1] = 65
80 order[2] = 48
81 order[3] = 22
91 order[13] = 0
97 order[0] = 58
98 order[1] = 0
129 order[1] = 0
[all …]
|
| /dports/finance/quickfix/quickfix-1.15.1/examples/tradeclientgui/banzai/src/quickfix/banzai/ |
| H A D | BanzaiApplication.java | 114 order.setOpen(order.getOpen() - diff); in executionReport()
139 order.setOpen(order.getQuantity()); in executionReport()
143 order.setOpen(order.getOpen() - (int)lastShares.getValue()); in executionReport()
181 order = orderTableModel.getOrder(order.getOriginalID()); in cancelReject()
186 orderTableModel.updateOrder(order, order.getID()); in cancelReject()
245 send(populateOrder(order, newOrderSingle), order.getSessionID()); in send40()
258 send(populateOrder(order, newOrderSingle), order.getSessionID()); in send41()
272 send(populateOrder(order, newOrderSingle), order.getSessionID()); in send42()
286 send(populateOrder(order, newOrderSingle), order.getSessionID()); in send43()
300 send(populateOrder(order, newOrderSingle), order.getSessionID()); in send44()
[all …]
|
| /dports/security/libecc/libecc-0.14.0/doc/external/ |
| H A D | TRINOMIALS | 24 The meaning of 'order' below is: the order of t, the smallest
55 6 3 Irreducible but not primitive. The order is 9.
58 9 1 Irreducible but not primitive. The order is 73.
62 12 3 Irreducible but not primitive. The order is 45.
63 12 5 Irreducible but not primitive. The order is 819.
71 18 3 Irreducible but not primitive. The order is 189.
73 18 9 Irreducible but not primitive. The order is 27.
75 20 5 Irreducible but not primitive. The order is 75.
77 21 7 Irreducible but not primitive. The order is 49.
98 36 9 Irreducible but not primitive. The order is 135.
[all …]
|
| /dports/security/libecc/libecc-0.14.0/ |
| H A D | TRINOMIALS | 24 The meaning of 'order' below is: the order of t, the smallest
55 6 3 Irreducible but not primitive. The order is 9.
58 9 1 Irreducible but not primitive. The order is 73.
62 12 3 Irreducible but not primitive. The order is 45.
63 12 5 Irreducible but not primitive. The order is 819.
71 18 3 Irreducible but not primitive. The order is 189.
73 18 9 Irreducible but not primitive. The order is 27.
75 20 5 Irreducible but not primitive. The order is 75.
77 21 7 Irreducible but not primitive. The order is 49.
98 36 9 Irreducible but not primitive. The order is 135.
[all …]
|
| /dports/net/google-cloud-sdk-app-engine-go/platform/google_appengine/goroot-1.9/src/cmd/compile/internal/gc/ |
| H A D | order.go | 68 order.out = append(order.out, a)
71 order.temp = append(order.temp, var_)
91 order.out = append(order.out, a)
231 order.temp = order.temp[:mark]
449 order.out = append(order.out, n)
478 order.out = append(order.out, n)
500 order.out = append(order.out, n)
601 order.out = append(order.out, n)
626 order.out = append(order.out, n)
633 order.out = append(order.out, n)
[all …]
|
| /dports/math/py-brial/BRiAl-1.2.10/tests/ |
| H A D | DegLexOrderTest.cc | 57 order_type order; in BOOST_FIXTURE_TEST_SUITE() local
72 order_type order; in BOOST_AUTO_TEST_CASE() local
80 order_type order; in BOOST_AUTO_TEST_CASE() local
115 order_type order; in BOOST_AUTO_TEST_CASE() local
205 order_type order; in BOOST_AUTO_TEST_CASE() local
207 BoolePolyRing::block_iterator start(order.blockBegin()),finish(order.blockEnd()); in BOOST_AUTO_TEST_CASE()
214 order.appendBlock(0); in BOOST_AUTO_TEST_CASE()
215 order.appendBlock(2); in BOOST_AUTO_TEST_CASE()
216 order.appendBlock(6); in BOOST_AUTO_TEST_CASE()
218 finish = order.blockEnd(); in BOOST_AUTO_TEST_CASE()
[all …]
|
| /dports/math/brial/BRiAl-1.2.10/tests/ |
| H A D | DegLexOrderTest.cc | 57 order_type order; in BOOST_FIXTURE_TEST_SUITE() local
72 order_type order; in BOOST_AUTO_TEST_CASE() local
80 order_type order; in BOOST_AUTO_TEST_CASE() local
115 order_type order; in BOOST_AUTO_TEST_CASE() local
205 order_type order; in BOOST_AUTO_TEST_CASE() local
207 BoolePolyRing::block_iterator start(order.blockBegin()),finish(order.blockEnd()); in BOOST_AUTO_TEST_CASE()
214 order.appendBlock(0); in BOOST_AUTO_TEST_CASE()
215 order.appendBlock(2); in BOOST_AUTO_TEST_CASE()
216 order.appendBlock(6); in BOOST_AUTO_TEST_CASE()
218 finish = order.blockEnd(); in BOOST_AUTO_TEST_CASE()
[all …]
|
| /dports/www/carbonapi/carbonapi-0.14.1/expr/functions/ |
| H A D | glue.go | 106 order interfaces.Order member
115 {name: "alias", order: alias.GetOrder(), f: alias.New},
123 {name: "below", order: below.GetOrder(), f: below.New},
135 {name: "ewma", order: ewma.GetOrder(), f: ewma.New},
138 {name: "fft", order: fft.GetOrder(), f: fft.New},
141 {name: "grep", order: grep.GetOrder(), f: grep.New},
150 {name: "ifft", order: ifft.GetOrder(), f: ifft.New},
178 {name: "pow", order: pow.GetOrder(), f: pow.New},
196 {name: "sum", order: sum.GetOrder(), f: sum.New},
208 if funcs[i].order == interfaces.Any && funcs[j].order == interfaces.Last {
[all …]
|
| /dports/finance/quickfix/quickfix-1.15.1/src/ruby/ |
| H A D | quickfix40.rb | 75 order[0] = 137
76 order[1] = 138
77 order[2] = 139
78 order[3] = 0
156 order[0] = 11
157 order[1] = 37
160 order[4] = 0
172 order[4] = 0
183 order[3] = 0
240 order[3] = 6
[all …]
|
| /dports/cad/gmsh/gmsh-4.9.2-source/Numeric/ |
| H A D | pointsGenerators.cpp | 184 int nbMonomials = serendip ? 3 * order : (order + 1) * (order + 2) / 2; in gmshGenerateMonomialsTriangle()
225 int nbMonomials = forSerendipPoints ? order * 4 : (order + 1) * (order + 1); in gmshGenerateMonomialsQuadrangle()
278 int nbMonomials = order ? order * 4 : 1; in gmshGenerateMonomialsQuadSerendipity()
320 (order + 1) * (order + 2) * (order + 3) / 6; in gmshGenerateMonomialsTetrahedron()
406 (order + 1) * (order + 1) * (order + 2) / 2; in gmshGenerateMonomialsPrism()
519 int nbMonomials = order ? 6 + (order - 1) * 9 : 1; in gmshGenerateMonomialsPrismSerendipity()
587 (order + 1) * (order + 1) * (order + 1); in gmshGenerateMonomialsHexahedron()
1194 monomials.resize((order + 1) * (order + 1), 2); in gmshGenerateOrderedMonomials()
1205 monomials.resize((order + 1) * (order + 2) * (order + 3) / 6, 3); in gmshGenerateOrderedMonomials()
1219 monomials.resize((order + 1) * (order + 1) * (order + 2) / 2, 3); in gmshGenerateOrderedMonomials()
[all …]
|
| /dports/math/gismo/gismo-21.12.0/external/onurbs/ |
| H A D | opennurbs_knot.cpp | 342 k += (knot[order+1] - knot[order]); in ON_SuperfluousKnot()
368 if ( order < 2 || cv_count < order || !knot ) { in ON_IsKnotVectorPeriodic()
490 if ( order >= 2 && cv_count >= order && knot && knot[order-2] < knot[cv_count-1] ) { in ON_KnotVectorStyle()
732 if ( !(knot[order-2] < knot[order-1]) ) in ON_IsValidKnotVector()
737 order,order-2,knot[order-2],order-1,knot[order-1]); in ON_IsValidKnotVector()
801 if ( knot && order >= 2 && cv_count >= order ) { in ON_ClampKnotVector()
831 if ( order < 2 || cv_count < order || !knot ) { in ON_MakeKnotVectorPeriodic()
943 if ( order <= 2 || knot[0] == knot[order-2]) { in ON_GrevilleAbcissa()
1136 if ( knot && order >= 2 && cv_count >= order ) { in ON_ClampKnotVector()
1176 if ( order < 2 || !knot || knot_value < knot[order-2] || knot[order-1] <= knot_value ) { in ON_InsertSingleKnot()
[all …]
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/surface/src/3rdparty/opennurbs/ |
| H A D | opennurbs_knot.cpp | 342 k += (knot[order+1] - knot[order]); in ON_SuperfluousKnot()
368 if ( order < 2 || cv_count < order || !knot ) { in ON_IsKnotVectorPeriodic()
490 if ( order >= 2 && cv_count >= order && knot && knot[order-2] < knot[cv_count-1] ) { in ON_KnotVectorStyle()
732 if ( !(knot[order-2] < knot[order-1]) ) in ON_IsValidKnotVector()
737 order,order-2,knot[order-2],order-1,knot[order-1]); in ON_IsValidKnotVector()
801 if ( knot && order >= 2 && cv_count >= order ) { in ON_ClampKnotVector()
831 if ( order < 2 || cv_count < order || !knot ) { in ON_MakeKnotVectorPeriodic()
943 if ( order <= 2 || knot[0] == knot[order-2]) { in ON_GrevilleAbcissa()
1136 if ( knot && order >= 2 && cv_count >= order ) { in ON_ClampKnotVector()
1176 if ( order < 2 || !knot || knot_value < knot[order-2] || knot[order-1] <= knot_value ) { in ON_InsertSingleKnot()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/endian/ |
| H A D | endian.hpp | 28 typedef order endianness;
32 template <BOOST_SCOPED_ENUM(order) Order, class T, std::size_t n_bits,
38 typedef endian_arithmetic< order::big, int_least8_t, 8 > big8_t;
39 typedef endian_arithmetic< order::big, int_least16_t, 16 > big16_t;
40 typedef endian_arithmetic< order::big, int_least32_t, 24 > big24_t;
41 typedef endian_arithmetic< order::big, int_least32_t, 32 > big32_t;
42 typedef endian_arithmetic< order::big, int_least64_t, 40 > big40_t;
43 typedef endian_arithmetic< order::big, int_least64_t, 48 > big48_t;
44 typedef endian_arithmetic< order::big, int_least64_t, 56 > big56_t;
45 typedef endian_arithmetic< order::big, int_least64_t, 64 > big64_t;
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/endian/ |
| H A D | endian.hpp | 28 typedef order endianness;
32 template <BOOST_SCOPED_ENUM(order) Order, class T, std::size_t n_bits,
38 typedef endian_arithmetic< order::big, int_least8_t, 8 > big8_t;
39 typedef endian_arithmetic< order::big, int_least16_t, 16 > big16_t;
40 typedef endian_arithmetic< order::big, int_least32_t, 24 > big24_t;
41 typedef endian_arithmetic< order::big, int_least32_t, 32 > big32_t;
42 typedef endian_arithmetic< order::big, int_least64_t, 40 > big40_t;
43 typedef endian_arithmetic< order::big, int_least64_t, 48 > big48_t;
44 typedef endian_arithmetic< order::big, int_least64_t, 56 > big56_t;
45 typedef endian_arithmetic< order::big, int_least64_t, 64 > big64_t;
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/endian/ |
| H A D | endian.hpp | 28 typedef order endianness;
32 template <BOOST_SCOPED_ENUM(order) Order, class T, std::size_t n_bits,
38 typedef endian_arithmetic< order::big, int_least8_t, 8 > big8_t;
39 typedef endian_arithmetic< order::big, int_least16_t, 16 > big16_t;
40 typedef endian_arithmetic< order::big, int_least32_t, 24 > big24_t;
41 typedef endian_arithmetic< order::big, int_least32_t, 32 > big32_t;
42 typedef endian_arithmetic< order::big, int_least64_t, 40 > big40_t;
43 typedef endian_arithmetic< order::big, int_least64_t, 48 > big48_t;
44 typedef endian_arithmetic< order::big, int_least64_t, 56 > big56_t;
45 typedef endian_arithmetic< order::big, int_least64_t, 64 > big64_t;
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/endian/ |
| H A D | endian.hpp | 28 typedef order endianness;
32 template <BOOST_SCOPED_ENUM(order) Order, class T, std::size_t n_bits,
38 typedef endian_arithmetic< order::big, int_least8_t, 8 > big8_t;
39 typedef endian_arithmetic< order::big, int_least16_t, 16 > big16_t;
40 typedef endian_arithmetic< order::big, int_least32_t, 24 > big24_t;
41 typedef endian_arithmetic< order::big, int_least32_t, 32 > big32_t;
42 typedef endian_arithmetic< order::big, int_least64_t, 40 > big40_t;
43 typedef endian_arithmetic< order::big, int_least64_t, 48 > big48_t;
44 typedef endian_arithmetic< order::big, int_least64_t, 56 > big56_t;
45 typedef endian_arithmetic< order::big, int_least64_t, 64 > big64_t;
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/endian/ |
| H A D | endian.hpp | 28 typedef order endianness;
32 template <BOOST_SCOPED_ENUM(order) Order, class T, std::size_t n_bits,
38 typedef endian_arithmetic< order::big, int_least8_t, 8 > big8_t;
39 typedef endian_arithmetic< order::big, int_least16_t, 16 > big16_t;
40 typedef endian_arithmetic< order::big, int_least32_t, 24 > big24_t;
41 typedef endian_arithmetic< order::big, int_least32_t, 32 > big32_t;
42 typedef endian_arithmetic< order::big, int_least64_t, 40 > big40_t;
43 typedef endian_arithmetic< order::big, int_least64_t, 48 > big48_t;
44 typedef endian_arithmetic< order::big, int_least64_t, 56 > big56_t;
45 typedef endian_arithmetic< order::big, int_least64_t, 64 > big64_t;
[all …]
|