| /dports/devel/R-cran-purrr/purrr/src/ |
| H A D | map.c | 154 SEXP j_val = VECTOR_ELT(l_val, j); in pmap_impl() local
156 if (!Rf_isVector(j_val) && !Rf_isNull(j_val)) { in pmap_impl()
157 stop_bad_element_type(j_val, j + 1, "a vector", NULL, l_name); in pmap_impl()
160 int nj = Rf_length(j_val); in pmap_impl()
164 copy_names(j_val, out); in pmap_impl()
177 SEXP j_val = VECTOR_ELT(l_val, j); in pmap_impl() local
178 int nj = Rf_length(j_val); in pmap_impl()
181 stop_bad_element_length(j_val, j + 1, n, NULL, ".l", true); in pmap_impl()
|
| /dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libigl/igl/ |
| H A D | sort_angles.cpp | 42 auto j_val = M(j, idx); in sort_angles() local
43 if (i_val != j_val) { in sort_angles()
44 return i_val < j_val; in sort_angles()
|
| /dports/graphics/wings/libigl-2.1.0/include/igl/ |
| H A D | sort_angles.cpp | 42 auto j_val = M(j, idx); in sort_angles() local
43 if (i_val != j_val) { in sort_angles()
44 return i_val < j_val; in sort_angles()
|
| /dports/math/chuffed/chuffed-e04bedd/chuffed/globals/ |
| H A D | edit_distance.cpp | 242 for (int j_val : *jVar) { in getMinimumSubstitutionCost()
243 if (i_val == 0 && j_val == 0) { in getMinimumSubstitutionCost()
246 if (i_val == 0 && j_val != 0) { in getMinimumSubstitutionCost()
247 … min_substitution_costs = std::min(min_substitution_costs, deletion_cost[j_val-1]); in getMinimumSubstitutionCost()
249 if (i_val != 0 && j_val == 0) { in getMinimumSubstitutionCost()
252 if (i_val != 0 && j_val != 0) { in getMinimumSubstitutionCost()
253 …substitution_costs = std::min(min_substitution_costs, substitution_cost[substCoord(i_val, j_val)]); in getMinimumSubstitutionCost()
|
| /dports/graphics/scantailor/scantailor-advanced-1.0.16/imageproc/ |
| H A D | PolynomialLine.cpp | 73 const double j_val = powers[j]; in doLeastSquares() local
74 AtA(i, j) += i_val * j_val; in doLeastSquares()
|
| H A D | PolynomialSurface.cpp | 271 const double j_val = full_powers[j]; in prepareDataForLeastSquares() local
272 *p_AtA += i_val * j_val; in prepareDataForLeastSquares()
354 const double j_val = full_powers[j]; in prepareDataForLeastSquares() local
355 *p_AtA += i_val * j_val; in prepareDataForLeastSquares()
|
| /dports/cad/gtkwave/gtkwave-3.3.107/contrib/fst_jni/ |
| H A D | fstAPI.c | 210 (JNIEnv *env, jobject obj, jlong ctx, jint handle, jstring j_val) in Java_fstAPI_fstWriterEmitValueChange__JILjava_lang_String_2() argument
212 const char *val = (*env)->GetStringUTFChars(env, j_val, 0); in Java_fstAPI_fstWriterEmitValueChange__JILjava_lang_String_2()
216 (*env)->ReleaseStringUTFChars(env, j_val, val); in Java_fstAPI_fstWriterEmitValueChange__JILjava_lang_String_2()
293 (JNIEnv *env, jobject obj, jlong ctx, jint handle, jstring j_val, jint len) in Java_fstAPI_fstWriterEmitVariableLengthValueChange() argument
295 const char *val = (*env)->GetStringUTFChars(env, j_val, 0); in Java_fstAPI_fstWriterEmitVariableLengthValueChange()
299 (*env)->ReleaseStringUTFChars(env, j_val, val); in Java_fstAPI_fstWriterEmitVariableLengthValueChange()
|
| /dports/math/libmesh/libmesh-1.6.2/src/numerics/ |
| H A D | petsc_matrix.C | 1134 PetscInt i_val=i, j_val=j; in set() local
1137 ierr = MatSetValues(_mat, 1, &i_val, 1, &j_val, in set()
1152 PetscInt i_val=i, j_val=j; in add() local
1155 ierr = MatSetValues(_mat, 1, &i_val, 1, &j_val, in add()
1300 j_val=static_cast<PetscInt>(j_in); in operator()
1315 std::equal_range (petsc_cols, petsc_cols + ncols, j_val); in operator()
1327 libmesh_assert_equal_to (petsc_cols[j], j_val); in operator()
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/math/lp/ |
| H A D | lp_core_solver_base.h | 595 std::string j_val = strm.str(); in print_column_info() local
596 out << "[" << j << "] " << std::setw(6) << " := " << j_val; in print_column_info()
601 for (auto k = j_val.size(); k < 15; ++k) in print_column_info()
|
| /dports/math/z3/z3-z3-4.8.13/src/math/lp/ |
| H A D | lp_core_solver_base.h | 595 std::string j_val = strm.str(); in print_column_info() local
596 out << "[" << j << "] " << std::setw(6) << " := " << j_val; in print_column_info()
601 for (auto k = j_val.size(); k < 15; ++k) in print_column_info()
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/s2/ |
| H A D | s2polyline.cc | 466 inline SearchState(int i_val, int j_val, bool i_in_progress_val) in SearchState()
467 : i(i_val), j(j_val), i_in_progress(i_in_progress_val) {} in SearchState()
|
| /dports/graphics/R-cran-s2/s2/src/s2/ |
| H A D | s2polyline.cc | 508 inline SearchState(int i_val, int j_val, bool i_in_progress_val) in SearchState()
509 : i(i_val), j(j_val), i_in_progress(i_in_progress_val) {} in SearchState()
|
| /dports/graphics/s2/s2geometry-0.9.0/src/s2/ |
| H A D | s2polyline.cc | 508 inline SearchState(int i_val, int j_val, bool i_in_progress_val) in SearchState()
509 : i(i_val), j(j_val), i_in_progress(i_in_progress_val) {} in SearchState()
|
| /dports/graphics/py-s2/s2geometry-0.9.0/src/s2/ |
| H A D | s2polyline.cc | 508 inline SearchState(int i_val, int j_val, bool i_in_progress_val) in SearchState()
509 : i(i_val), j(j_val), i_in_progress(i_in_progress_val) {} in SearchState()
|
| /dports/math/stp/stp-2.3.3/lib/Simplifier/ |
| H A D | Simplifier.cpp | 2332 unsigned int j_val = j.GetUnsignedConst(); in simplify_term_switch() local
2337 assert(0 == j_val); in simplify_term_switch()
2353 _bm->CreateBVConst(32, j_val + innerLow)); in simplify_term_switch()
2377 else if (len_a0 > i_val && j_val >= len_u) in simplify_term_switch()
2383 j = _bm->CreateBVConst(32, j_val - len_u); in simplify_term_switch()
2395 u = SimplifyTerm(nf->CreateTerm(BVEXTRACT, len_u - j_val, u, m, j), in simplify_term_switch()
2418 if (j_val != 0) in simplify_term_switch()
|
| /dports/math/z3/z3-z3-4.8.13/src/muz/spacer/ |
| H A D | spacer_qe_project.cpp | 2134 rational j_val, jm1_val; in ackermann() local
2135 VERIFY (m_ari_u.is_numeral (val, j_val)); in ackermann()
2137 if (j_val >= jm1_val) break; in ackermann()
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/muz/spacer/ |
| H A D | spacer_qe_project.cpp | 2134 rational j_val, jm1_val; in ackermann() local
2135 VERIFY (m_ari_u.is_numeral (val, j_val)); in ackermann()
2137 if (j_val >= jm1_val) break; in ackermann()
|
| /dports/net/freeswitch/freeswitch-1.10.3.-release/src/mod/applications/mod_fifo/ |
| H A D | mod_fifo.c | 296 const char *j_val = switch_event_get_header(queue->data[j], name); in fifo_queue_pop_nameval() local
298 if (j_val && val && !strcmp(j_val, val) && (force || !check_caller_outbound_call(uuid))) { in fifo_queue_pop_nameval()
|
| /dports/www/mod_qos/mod_qos-11.66/apache2/ |
| H A D | mod_qos.c | 3769 static int j_val(apr_pool_t *pool, char **val, apr_table_t *tl, char *name, int rec);
3884 rc = j_val(pool, &d, tl, thisname, rec); in j_obj()
3913 rc = j_val(pool, &d, tl, apr_psprintf(pool, "%s%d", name, index), rec); in j_ar()
3938 static int j_val(apr_pool_t *pool, char **val, apr_table_t *tl, char *name, int rec) { in j_val() function
4038 rc = j_val(r->pool, &value, tl, "J", 0); in qos_json()
|