| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/fe/ |
| H A D | fe_poly_tensor.cc | 541 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
566 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
593 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
634 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
673 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
700 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
742 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
802 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
895 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_values() local
1131 for (unsigned int n = 0; n < spacedim; ++n) in fill_fe_face_values() local
[all …]
|
| /dports/math/octave-forge-statistics/statistics-1.4.3/inst/ |
| H A D | copularnd.m | 119 d = n; variable
124 d = size (theta, 1); variable
127 n = 1; variable
129 n = nu; variable
152 n = 1; variable
163 d = 2; variable
165 d = n; variable
172 n = 1; variable
174 n = nu; variable
203 k = []; variable
[all …]
|
| /dports/science/apbs/apbs-pdb2pqr-apbs-1.5-102-g500c1473/apbs/externals/pb_s_am/pbsam/src/ |
| H A D | Gradsolvmat.h | 45 Ptx get_mat_knm(int k, int n, int m) { return mat_[k](n, m+p_); } in get_mat_knm()
47 cmplx get_mat_knm_d(int k, int n, int m, int d) in get_mat_knm_d()
53 void set_mat_knm(int k, int n, int m, Ptx val) in set_mat_knm()
56 void set_mat_knm_d(int k, int n, int m, int d, cmplx val) in set_mat_knm_d()
66 for (int n = 0; n < p_; n++) in set_mat_k() local
86 for (int d = 0; d < 3; d++) variable
115 for (int d = 0; d < 3; d++) in print_kmat() local
166 Ptx get_mat_knm(int k, int n, int m) { return mat_cmplx_[k](n,m+p_); } in get_mat_knm()
179 for (int d = 0; d < 3; d++) variable
200 for (int d = 0; d < 3; d++) in print_kmat() local
[all …]
|
| /dports/math/fxt/fxt/src/walsh/ |
| H A D | walsheigen.cc | 12 walsh_wak_eigen(double *v, ulong ldn, ulong k) in walsh_wak_eigen()
16 ulong n = 1UL << ldn; in walsh_wak_eigen() local
18 double d = sqrt((double)n); // normalization in walsh_wak_eigen() local
24 walsh_wal_eigen(double *v, ulong ldn, ulong k) in walsh_wal_eigen()
28 ulong n = 1UL << ldn; in walsh_wal_eigen() local
30 double d = sqrt((double)n); // normalization in walsh_wal_eigen() local
37 walsh_pal_eigen(double *v, ulong ldn, ulong k) in walsh_pal_eigen()
41 ulong n = 1UL << ldn; in walsh_pal_eigen() local
43 double d = sqrt((double)n); // normalization in walsh_pal_eigen() local
|
| /dports/math/yices/yices-2.6.2/src/mcsat/utils/ |
| H A D | value_hash_map.c | 33 static bool is_power_of_two(uint32_t n) { in is_power_of_two()
132 uint32_t j, n, mask; in value_hmap_cleanup() local
160 uint32_t j, n, n2, mask; in value_hmap_extend() local
198 value_hmap_pair_t *d; in value_hmap_find() local
229 value_hmap_pair_t *d; in value_hmap_get_clean() local
355 uint32_t i, n; in value_hmap_reset() local
356 value_hmap_pair_t *d; in value_hmap_reset() local
414 value_hmap_pair_t *d; in value_hmap_remove_records() local
415 uint32_t i, n, k; in value_hmap_remove_records() local
445 value_hmap_pair_t *d; in value_hmap_iterate() local
[all …]
|
| /dports/math/R-cran-ddalpha/ddalpha/src/ |
| H A D | Common.cpp | 16 T3DMatrix as3DMatrix(double* arr, int n, int t, int d){ in as3DMatrix()
29 TDMatrix asMatrix(double* arr, int n, int d){ in asMatrix()
36 double** newM(int n, int d){ in newM()
46 TDMatrix copyM(TDMatrix X, int n, int d){ in copyM()
52 void printMatrix(TDMatrix mat, int n, int d){ in printMatrix()
62 unsigned long long choose(unsigned long long n, unsigned long long k){ in choose()
173 double* means(TDMatrix X, int n, int d) { in means()
184 TDMatrix cov(TDMatrix X, int n, int d) { in cov()
189 for (int k = 0; k < d; k++) in cov() local
222 void GetDirections(TDMatrix directions, int k, int d){ in GetDirections()
[all …]
|
| H A D | HD.cpp | 48 int intHD1(double** x, int n) { in intHD1()
118 int nHD_Rec(double** xx, int n, int d) { in nHD_Rec()
188 double HD_Rec(double* z, double** xx, int n, int d) { in HD_Rec()
222 int getRank(double** x, int n, int d, int* piv) { in getRank()
286 void project(double** x, int n, int d, int rank, int indices[]) { in project()
406 int HD1proj(double** x, int n, int d, double* p, int indices[]) { in HD1proj()
447 int nHD_Comb(double** xx, int n, int d) { in nHD_Comb()
500 double HD_Comb(double* z, double** xx, int n, int d) { in HD_Comb()
640 int HD2proj(double** x, int n, int d, double** p, int* indices) { in HD2proj()
686 int nHD_Comb2(double** xx, int n, int d) { in nHD_Comb2()
[all …]
|
| /dports/converters/wkhtmltopdf/qt-5db36ec/src/qt3support/tools/ |
| H A D | q3gdict.h | 62 Q3PtrCollection::Item setData( Q3PtrCollection::Item d ) { return data = d; } in setData()
64 void setNext( Q3BaseBucket *n) { next = n; } in setNext()
66 Q3BaseBucket( Q3PtrCollection::Item d, Q3BaseBucket *n ) : data(d), next(n) {} in Q3BaseBucket() function
74 Q3StringBucket( const QString &k, Q3PtrCollection::Item d, Q3BaseBucket *n ) in Q3StringBucket()
84 Q3AsciiBucket( const char *k, Q3PtrCollection::Item d, Q3BaseBucket *n ) in Q3AsciiBucket()
94 Q3IntBucket( long k, Q3PtrCollection::Item d, Q3BaseBucket *n ) in Q3IntBucket()
104 Q3PtrBucket( void *k, Q3PtrCollection::Item d, Q3BaseBucket *n ) in Q3PtrBucket()
|
| /dports/math/fxt/fxt/src/comb/ |
| H A D | print-set.cc | 27 print_set(const char *bla, const ulong *x, ulong n, ulong off/*=0*/) in print_set()
37 for (ulong k=0; k<n; ++k) in print_set() local
55 const char *d = ( nullptr==c01 ? n01 : c01 ); in print_set_as_deltaset() local
58 for (ulong k=0; k<n; ++k) in print_set_as_deltaset() local
80 const char *d = ( nullptr==c01 ? n01 : c01 ); in print_set1_as_deltaset() local
82 for (ulong k=0; k<n; ++k) in print_set1_as_deltaset() local
100 print_deltaset_as_set(const char *bla, const ulong *x, ulong n, int eq/*=0*/) in print_deltaset_as_set()
110 ulong k = 0; in print_deltaset_as_set() local
147 ulong k = 0; in print_deltaset_as_set1() local
182 const char *d = ( nullptr==c01 ? n01 : c01 ); in print_deltaset() local
[all …]
|
| H A D | acgray.cc | 13 ac_gray_delta(uchar *d, ulong ldn) in ac_gray_delta()
57 ulong n = 1UL<<ldn; in ac_gray_delta() local
64 for (ulong k=0; k<nh; ++k) d[k] = (uchar)((ldn - 2) - d[k]); in ac_gray_delta() local
67 for (ulong k=0, j=n-2; k<j; ++k, --j) d[j] = d[k]; in ac_gray_delta() local
72 for (ulong k=nh-2, j=nh-1; 0!=j; --k, --j) d[j] = (uchar)(d[k] + 1); in ac_gray_delta() local
73 for (ulong k=2, j=n-2; k<j; ++k, --j) d[j] = d[k]; in ac_gray_delta() local
82 test_ac_gray(ulong *g, ulong n) in test_ac_gray()
87 for (ulong k=2; k<n; ++k) in test_ac_gray() local
104 ulong n = 1UL<<ldn; in ac_gray() local
105 uchar * d = new uchar[n]; in ac_gray() local
|
| H A D | test-gray.cc | 12 test_gray_path(const ulong *f, ulong n) in test_gray_path()
18 for (ulong k=1; k<n; ++k) in test_gray_path() local
21 ulong d = v ^ vk; in test_gray_path() local
30 is_gray_path(const ulong *f, ulong n) in is_gray_path()
39 test_canonical_gray(const ulong *f, ulong n) in test_canonical_gray()
47 for (ulong k=1; k<n; ++k) in test_canonical_gray() local
50 ulong d = v ^ vk; in test_canonical_gray() local
66 is_canonical_gray(const ulong *f, ulong n) in is_canonical_gray()
77 is_monotonic_gray(const ulong *f, ulong n) in is_monotonic_gray()
84 for (ulong k=0; k<n; ++k) in is_monotonic_gray() local
[all …]
|
| /dports/math/yices/yices-2.6.2/src/utils/ |
| H A D | int_hash_map.c | 86 static uint32_t hash_key(int32_t k) { in hash_key()
123 uint32_t j, n, mask; in int_hmap_cleanup() local
151 uint32_t j, n, n2, mask; in int_hmap_extend() local
189 int_hmap_pair_t *d; in int_hmap_find() local
212 int_hmap_pair_t *d; in int_hmap_get_clean() local
328 uint32_t i, n; in int_hmap_reset() local
329 int_hmap_pair_t *d; in int_hmap_reset() local
385 int_hmap_pair_t *d; in int_hmap_remove_records() local
386 uint32_t i, n, k; in int_hmap_remove_records() local
415 int_hmap_pair_t *d; in int_hmap_iterate() local
[all …]
|
| H A D | backtrack_int_hash_map.c | 36 static bool is_power_of_two(uint32_t n) { in is_power_of_two()
45 static uint32_t hash_key(int32_t k) { in hash_key()
131 static void back_hmap_clean_copy_all(back_hmap_data_t *d, const back_hmap_data_t *s, uint32_t n, ui… in back_hmap_clean_copy_all()
155 static back_hmap_elem_t *find(const back_hmap_data_t *d, int32_t k, uint32_t mask) { in find()
177 static back_hmap_elem_t *get_clean(back_hmap_data_t *d, int32_t k, uint32_t l, uint32_t mask) { in get_clean()
201 static uint32_t erase_level(back_hmap_data_t *d, uint32_t l, uint32_t n) { in erase_level()
282 uint32_t n, new_size; in back_hmap_extend() local
310 uint32_t n; in back_hmap_cleanup() local
330 back_hmap_elem_t *back_hmap_get(back_hmap_t *hmap, int32_t k) { in back_hmap_get()
331 back_hmap_elem_t *d, *aux; in back_hmap_get() local
[all …]
|
| H A D | ptr_hash_map.c | 36 static bool is_power_of_two(uint32_t n) { in is_power_of_two()
88 static uint32_t hash_key(int32_t k) { in hash_key()
124 ptr_hmap_pair_t *tmp, *d; in ptr_hmap_cleanup() local
125 uint32_t j, n, mask; in ptr_hmap_cleanup() local
153 uint32_t j, n, n2, mask; in ptr_hmap_extend() local
191 ptr_hmap_pair_t *d; in ptr_hmap_find() local
214 ptr_hmap_pair_t *d; in ptr_hmap_get_clean() local
298 uint32_t i, n; in ptr_hmap_reset() local
299 ptr_hmap_pair_t *d; in ptr_hmap_reset() local
320 ptr_hmap_pair_t *d; in ptr_hmap_remove_records() local
[all …]
|
| /dports/math/yices/yices-2.6.2/src/solvers/bv/ |
| H A D | bvconst_hmap.c | 33 static bool is_power_of_two(uint32_t n) { in is_power_of_two()
44 void init_bvconst_hmap(bvconst_hmap_t *hmap, uint32_t n) { in init_bvconst_hmap()
76 uint32_t i, n, k; in delete_bvconst_hmap() local
98 uint32_t i, n, k; in reset_bvconst_hmap() local
120 static uint32_t hash_key(int32_t k) { in hash_key()
159 bvconst_hmap_rec_t *tmp, *d; in bvconst_hmap_extend() local
160 uint32_t j, n, n2, mask; in bvconst_hmap_extend() local
193 bvconst_hmap_rec_t *bvconst_hmap_find(bvconst_hmap_t *hmap, int32_t k) { in bvconst_hmap_find()
195 bvconst_hmap_rec_t *d; in bvconst_hmap_find() local
217 bvconst_hmap_rec_t *d; in bvconst_hmap_get() local
[all …]
|
| /dports/devel/qmake/qt-x11-free-3.3.8/src/tools/ |
| H A D | qgdict.h | 54 QPtrCollection::Item setData( QPtrCollection::Item d ) { return data = d; } in setData()
56 void setNext( QBaseBucket *n) { next = n; } in setNext()
58 QBaseBucket( QPtrCollection::Item d, QBaseBucket *n ) : data(d), next(n) {} in QBaseBucket() function
66 QStringBucket( const QString &k, QPtrCollection::Item d, QBaseBucket *n ) in QStringBucket()
76 QAsciiBucket( const char *k, QPtrCollection::Item d, QBaseBucket *n ) in QAsciiBucket()
86 QIntBucket( long k, QPtrCollection::Item d, QBaseBucket *n ) in QIntBucket()
96 QPtrBucket( void *k, QPtrCollection::Item d, QBaseBucket *n ) in QPtrBucket()
|
| /dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/util/ |
| H A D | CombinatoricsUtils.java | 77 public static long binomialCoefficient(final int n, final int k) in binomialCoefficient()
115 final long d = ArithmeticUtils.gcd(i, j); in binomialCoefficient() local
125 final long d = ArithmeticUtils.gcd(i, j); in binomialCoefficient() local
158 public static double binomialCoefficientDouble(final int n, final int k) in binomialCoefficientDouble()
203 public static double binomialCoefficientLog(final int n, final int k) in binomialCoefficientLog()
299 public static double factorialDouble(final int n) throws NotPositiveException { in factorialDouble()
317 public static double factorialLog(final int n) throws NotPositiveException { in factorialLog()
351 public static long stirlingS2(final int n, final int k) in stirlingS2()
438 public static Iterator<int[]> combinationsIterator(int n, int k) { in combinationsIterator()
450 public static void checkBinomial(final int n, in checkBinomial()
[all …]
|
| /dports/science/py-rmf/rmf-1.3.1/src/backend/ |
| H A D | SharedDataAdaptor.h | 34 typename Traits::Type get_loaded_value(NodeID n, ID<Traits> k) const { in get_loaded_value()
38 typename Traits::Type get_static_value(NodeID n, ID<Traits> k) const { in get_static_value()
42 std::string get_name(T k) const { in get_name()
50 void set_static_value(NodeID n, ID<Traits> k, in set_static_value()
51 typename Traits::ArgumentType d) { in set_static_value()
55 void set_loaded_value(NodeID n, ID<Traits> k, in set_loaded_value()
56 typename Traits::ArgumentType d) { in set_loaded_value()
|
| /dports/science/rmf/rmf-1.3.1/src/backend/ |
| H A D | SharedDataAdaptor.h | 34 typename Traits::Type get_loaded_value(NodeID n, ID<Traits> k) const { in get_loaded_value()
38 typename Traits::Type get_static_value(NodeID n, ID<Traits> k) const { in get_static_value()
42 std::string get_name(T k) const { in get_name()
50 void set_static_value(NodeID n, ID<Traits> k, in set_static_value()
51 typename Traits::ArgumentType d) { in set_static_value()
55 void set_loaded_value(NodeID n, ID<Traits> k, in set_loaded_value()
56 typename Traits::ArgumentType d) { in set_loaded_value()
|
| /dports/math/mathgl/mathgl-2.5/src/ |
| H A D | random.cpp | 40 const long n = d->GetNN(), da=hi-lo; in mgl_data_rnd_integer() local
53 const long n = d->GetNN(); in mgl_data_rnd_uniform() local
67 const long n = d->GetNN(); in mgl_data_rnd_bernoulli() local
85 const long n = d->GetNN(); in mgl_data_rnd_binomial() local
107 const long n = d->GetNN(); in mgl_data_rnd_gaussian() local
120 const long n = d->GetNN(); in mgl_data_rnd_exponential() local
128 long n=A->GetNx(); in mgl_rnd_discrete() local
186 for(long k=0;k<m;k++) in mgl_shuffle() local
208 for(long k=0;k<m;k++) in mgl_shuffle() local
215 long n = d->GetNN(); in mgl_shuffle() local
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/base/ |
| H A D | flow_function.cc | 214 for (unsigned int k = 0; k < n; ++k) in vector_values() local
277 unsigned int n = points.size(); in vector_laplacians() local
313 unsigned int n = points.size(); in vector_values() local
362 unsigned int n = points.size(); in vector_gradients() local
428 unsigned int n = points.size(); in vector_laplacians() local
553 unsigned int n = points.size(); in vector_values() local
593 unsigned int n = points.size(); in vector_gradients() local
653 unsigned int n = points.size(); in vector_laplacians() local
686 unsigned int n = points.size(); in vector_values() local
711 unsigned int n = points.size(); in vector_gradients() local
[all …]
|
| /dports/math/fxt/fxt/src/comb/attic/ |
| H A D | num2mixedradix.h | 9 inline void num2mixedradix(ulong n, const ulong *r, ulong k, ulong * restrict d) in num2mixedradix()
17 ulong d[j] = n % r[j]; in num2mixedradix() local
24 inline ulong mixedradix2num(const ulong *r, ulong k, const ulong *d) in mixedradix2num()
28 ulong n=0, p=1; in mixedradix2num() local
|
| /dports/math/z3/z3-z3-4.8.13/src/tactic/arith/ |
| H A D | bound_manager.cpp | 46 static decl_kind swap_decl(decl_kind k) { in swap_decl()
58 decl_kind bound_manager::neg(decl_kind k) { in neg()
70 void bound_manager::norm(numeral & n, decl_kind & k) { in norm()
89 static bool is_lower(decl_kind k) { in is_lower()
93 static bool is_strict(decl_kind k) { in is_strict()
109 numeral n; in operator ()() local
122 decl_kind k = t->get_decl_kind(); in operator ()() local
152 void bound_manager::insert_upper(expr * v, bool strict, numeral const & n, expr_dependency * d) { in insert_upper()
172 void bound_manager::insert_lower(expr * v, bool strict, numeral const & n, expr_dependency * d) { in insert_lower()
200 numeral n; in is_equality_bound() local
[all …]
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/tactic/arith/ |
| H A D | bound_manager.cpp | 46 static decl_kind swap_decl(decl_kind k) { in swap_decl()
58 decl_kind bound_manager::neg(decl_kind k) { in neg()
70 void bound_manager::norm(numeral & n, decl_kind & k) { in norm()
89 static bool is_lower(decl_kind k) { in is_lower()
93 static bool is_strict(decl_kind k) { in is_strict()
109 numeral n; in operator ()() local
122 decl_kind k = t->get_decl_kind(); in operator ()() local
152 void bound_manager::insert_upper(expr * v, bool strict, numeral const & n, expr_dependency * d) { in insert_upper()
172 void bound_manager::insert_lower(expr * v, bool strict, numeral const & n, expr_dependency * d) { in insert_lower()
200 numeral n; in is_equality_bound() local
[all …]
|
| /dports/math/gismo/gismo-21.12.0/src/gsUtils/ |
| H A D | gsCombinatorics.h | 29 inline unsigned factorial( unsigned n) in factorial()
69 inline Z binomial(const Z n, const Z r) in binomial()
95 inline void binomial_into( unsigned n, gsVector<unsigned>& v) in binomial_into()
142 bool nextCombination (Vec & v, const unsigned n) in nextCombination()
162 const index_t n=current.size(); in firstPermutation() local
174 const index_t n=current.size(); in nextPermutation() local
487 inline index_t numCubeElements(const index_t k, const index_t d) in numCubeElements()
571 for (index_t k=0; k!=dd; ++k) in cubeIsometry() local
582 for (index_t k=0; k!=dd; ++k) in cubeIsometry() local
634 const index_t k = v.size() - 1; in nextComposition() local
[all …]
|