/dports/textproc/py-nltk/nltk-3.4.1/nltk/translate/ |
H A D | bleu_score.py | 205 p_n = [ 540 for p_i in p_n 575 return p_n 591 return p_n 606 m[i] = p_n[i] 607 return p_n 626 pi0 = 0 if p_n[i - 2] == 0 else p_n[i - 1] ** 2 / p_n[i - 2] 633 return p_n 642 p_n = self.method4(p_n, references, hypothesis, hyp_len) 643 p_n = self.method5(p_n, references, hypothesis, hyp_len) [all …]
|
/dports/graphics/jogamp-jogl/jogl/src/jogl/classes/com/jogamp/opengl/math/geom/ |
H A D | Frustum.java | 262 final float[] p_n = p.n; in updateByPMV() local 273 final float[] p_n = p.n; in updateByPMV() local 284 final float[] p_n = p.n; in updateByPMV() local 295 final float[] p_n = p.n; in updateByPMV() local 306 final float[] p_n = p.n; in updateByPMV() local 317 final float[] p_n = p.n; in updateByPMV() local 327 final float[] p_n = p.n; in updateByPMV() local 328 final double invl = Math.sqrt(p_n[0] * p_n[0] + p_n[1] * p_n[1] + p_n[2] * p_n[2]); in updateByPMV() 330 p_n[0] /= invl; in updateByPMV() 331 p_n[1] /= invl; in updateByPMV() [all …]
|
/dports/multimedia/vcdimager/vcdimager-2.0.1/test/ |
H A D | mpegscan.c | 44 CdioListNode_t *p_n; in main() local 56 _CDIO_LIST_FOREACH (p_n, vcd_mpeg_source_get_info (p_src)->shdr[0].aps_list) in main() 58 struct aps_data *p_data = _cdio_list_node_data (p_n); in main() 78 for(p_n = _cdio_list_node_next (aps_node); p_n; in main() 79 p_n = _cdio_list_node_next (p_n)) in main() 81 p_data = _cdio_list_node_data (p_n); in main() 85 aps_node = p_n; in main()
|
/dports/databases/spatialite/libspatialite-5.0.1/src/gaiageo/ |
H A D | gg_vanuatu.c | 647 p = p_n; in vanuatu_linestring_xy() 687 p = p_n; in vanuatu_linestring_xyz() 727 p = p_n; in vanuatu_linestring_xym() 767 p = p_n; in vanuatu_linestring_xyzm() 852 p = p_n; in vanuatu_ring_xy() 898 p = p_n; in vanuatu_ring_xyz() 944 p = p_n; in vanuatu_ring_xym() 990 p = p_n; in vanuatu_ring_xyzm() 1031 p = p_n; in vanuatu_polygon_any_type() 1182 p = p_n; in vanuatu_multipoint_xy() [all …]
|
H A D | gg_ewkt.c | 618 p = p_n; in ewkt_linestring_xy() 658 p = p_n; in ewkt_linestring_xyz() 698 p = p_n; in ewkt_linestring_xym() 738 p = p_n; in ewkt_linestring_xyzm() 822 p = p_n; in ewkt_ring_xy() 868 p = p_n; in ewkt_ring_xyz() 914 p = p_n; in ewkt_ring_xym() 960 p = p_n; in ewkt_ring_xyzm() 1001 p = p_n; in ewkt_polygon_any_type() 1151 p = p_n; in ewkt_multipoint_xy() [all …]
|
/dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/src/mathsResources/specialFunctions/ |
H A D | orthogonalPolynomials.cpp | 46 if ( val.size() > 1 ) { *val_i = p_n; } in chebyshevPolynomials() 49 p_n2 = p_n1; p_n1 = p_n; *val_i = p_n = Two_x * p_n1 - p_n2; in chebyshevPolynomials() 68 *val_i = p_n; in gegenbauerPolynomials() 72 p_n2 = p_n1; p_n1 = p_n; in gegenbauerPolynomials() 101 p_n2 = p_n1; p_n1 = p_n; in jacobiPolynomials() 102 *val_i = p_n = in jacobiPolynomials() 131 real_t p_n(x), p_n1(1.), p_n2; in legendrePolynomials() local 135 *val_i++ = p_n; in legendrePolynomials() 140 p_n2 = p_n1; p_n1 = p_n; *val_i = p_n = ( nx2m1 * x * p_n1 - nm1 * p_n2 ) / n; in legendrePolynomials() 160 real_t p_n(1.), p_n1(0.), p_n2; in legendrePolynomialsDerivative() local [all …]
|
/dports/devel/godot/godot-3.2.3-stable/core/ |
H A D | ring_buffer.h | 132 inline int advance_read(int p_n) { in advance_read() argument 133 p_n = MIN(p_n, data_left()); in advance_read() 134 inc(read_pos, p_n); in advance_read() 135 return p_n; in advance_read() 138 inline int decrease_write(int p_n) { in decrease_write() argument 139 p_n = MIN(p_n, data_left()); in decrease_write() 140 inc(write_pos, size_mask + 1 - p_n); in decrease_write() 141 return p_n; in decrease_write()
|
/dports/devel/godot-tools/godot-3.2.3-stable/core/ |
H A D | ring_buffer.h | 132 inline int advance_read(int p_n) { in advance_read() argument 133 p_n = MIN(p_n, data_left()); in advance_read() 134 inc(read_pos, p_n); in advance_read() 135 return p_n; in advance_read() 138 inline int decrease_write(int p_n) { in decrease_write() argument 139 p_n = MIN(p_n, data_left()); in decrease_write() 140 inc(write_pos, size_mask + 1 - p_n); in decrease_write() 141 return p_n; in decrease_write()
|
/dports/devel/R-cran-vctrs/vctrs/src/ |
H A D | order-groups.h | 52 #define PROTECT_GROUP_INFO(p_info, p_n) do { \ argument 55 *(p_n) += 2; \ 98 #define PROTECT_GROUP_INFOS(p_info, p_n) do { \ argument 101 *(p_n) += 2; \ 102 PROTECT_GROUP_INFO((p_info)->p_p_group_info[0], (p_n)); \ 103 PROTECT_GROUP_INFO((p_info)->p_p_group_info[1], (p_n)); \
|
/dports/devel/splint/splint-3.1.2/src/Headers/ |
H A D | uentry.h | 380 uentry_makePrivFunction2 (cstring p_n, ctype p_t, 396 uentry_makeSpecFunction (cstring p_n, ctype p_t, 401 uentry_makeEnumConstant (cstring p_n, ctype p_t) /*@*/ ; 423 uentry_makeDatatypeAux (/*@temp@*/ cstring p_n, ctype p_t, ynm p_mut, 435 uentry_makeEndIter (cstring p_n, /*@only@*/ fileloc p_f) /*@*/ ; 437 uentry_makeEnumTagLoc (cstring p_n, ctype p_t) /*@*/ ; 442 uentry_makeFunction (cstring p_n, ctype p_t, 456 uentry_makeStructTagLoc (cstring p_n, ctype p_t); 460 uentry_makeUnionTagLoc (cstring p_n, ctype p_t); 464 uentry_makeVariableLoc (cstring p_n, ctype p_t); [all …]
|
H A D | nameNode.h | 15 extern void nameNode_free (/*@null@*/ /*@only@*/ nameNode p_n); 16 extern /*@only@*/ /*@null@*/ nameNode nameNode_copy (/*@null@*/ nameNode p_n) /*@*/ ; 17 extern /*@only@*/ cstring nameNode_unparse (/*@null@*/ nameNode p_n) /*@*/ ; 18 extern /*@only@*/ nameNode nameNode_copySafe (nameNode p_n) /*@*/ ;
|
/dports/math/R/R-4.1.2/src/nmath/ |
H A D | qDiscrete_search.h | 127 double p_n; /* p in the "normal" (lower_tail=TRUE, log.p=FALSE) scale */ \ 129 p_n = R_DT_qIv(p); /* need check again (cancellation!): */ \ 130 R_DBG_printf(" upper tail or log_p: (p_n, 1-p_n) = (%.15g, %.15g)\n", p_n, 1-p_n); \ 135 if (p_n == 0) R_DBG_printf("** p_n == 0: _NO LONGER_ returning 0"); \ 136 if (p_n == 1) R_DBG_printf("** p_n == 1: _NO LONGER_ returning +Inf"); \ 138 p_n = p; \ 141 if (p_n + 1.01*DBL_EPSILON >= 1.) { \ 143 1-p_n); \
|
/dports/math/libRmath/R-4.1.1/src/nmath/ |
H A D | qDiscrete_search.h | 127 double p_n; /* p in the "normal" (lower_tail=TRUE, log.p=FALSE) scale */ \ 129 p_n = R_DT_qIv(p); /* need check again (cancellation!): */ \ 130 R_DBG_printf(" upper tail or log_p: (p_n, 1-p_n) = (%.15g, %.15g)\n", p_n, 1-p_n); \ 135 if (p_n == 0) R_DBG_printf("** p_n == 0: _NO LONGER_ returning 0"); \ 136 if (p_n == 1) R_DBG_printf("** p_n == 1: _NO LONGER_ returning +Inf"); \ 138 p_n = p; \ 141 if (p_n + 1.01*DBL_EPSILON >= 1.) { \ 143 1-p_n); \
|
/dports/math/gsl/gsl-2.7/specfunc/ |
H A D | hermite.c | 108 double p_n = p_n1; in gsl_sf_hermite_prob_e() local 127 p_n1 = p_n; in gsl_sf_hermite_prob_e() 285 p_n1 = p_n; in gsl_sf_hermite_e() 576 p_n1 = p_n; in gsl_sf_hermite_prob_array() 650 p_n1 = p_n; in gsl_sf_hermite_prob_array_deriv() 722 p_n1 = p_n; in gsl_sf_hermite_prob_deriv_array() 726 p_n = 1.0; in gsl_sf_hermite_prob_deriv_array() 729 p_n = p_n*(n-j+1); in gsl_sf_hermite_prob_deriv_array() 840 p_n1 = p_n; in gsl_sf_hermite_array() 900 double p_n; in gsl_sf_hermite_array_deriv() local [all …]
|
/dports/audio/ardour6/Ardour-6.8.0/libs/evoral/test/ |
H A D | BeatsTest.cc | 64 const Beats p_n = p1 + n1; in addTest() local 65 CPPUNIT_ASSERT_EQUAL(-11, p_n.get_beats()); in addTest() 66 CPPUNIT_ASSERT_EQUAL((int32_t)(Beats::PPQN * -0.34), p_n.get_ticks()); in addTest() 67 CPPUNIT_ASSERT_DOUBLES_EQUAL(-11.34, p_n.to_double(), delta); in addTest() 101 const Beats p_n = p1 - n1; in subtractTest() local 102 CPPUNIT_ASSERT_EQUAL(13, p_n.get_beats()); in subtractTest() 103 CPPUNIT_ASSERT_EQUAL((int32_t)(Beats::PPQN * 0.34), p_n.get_ticks()); in subtractTest() 104 CPPUNIT_ASSERT_DOUBLES_EQUAL(13.34, p_n.to_double(), delta); in subtractTest()
|
/dports/math/suitesparse-klu/SuiteSparse-5.10.1/SPQR/Source/ |
H A D | spqr_append.cpp | 20 Long *p_n, // n = # of columns of A so far; increased one in spqr_append() argument 36 n = *p_n ; in spqr_append() 43 *p_n = n ; in spqr_append() 123 *p_n = n ; in spqr_append() 144 Long *p_n, // number of columns of A; increased by one 161 Long *p_n, // number of columns of A; increased by one
|
/dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/SPQR/Source/ |
H A D | spqr_append.cpp | 20 Long *p_n, // n = # of columns of A so far; increased one in spqr_append() argument 36 n = *p_n ; in spqr_append() 43 *p_n = n ; in spqr_append() 123 *p_n = n ; in spqr_append() 144 Long *p_n, // number of columns of A; increased by one 161 Long *p_n, // number of columns of A; increased by one
|
/dports/math/suitesparse-config/SuiteSparse-5.10.1/SPQR/Source/ |
H A D | spqr_append.cpp | 20 Long *p_n, // n = # of columns of A so far; increased one in spqr_append() argument 36 n = *p_n ; in spqr_append() 43 *p_n = n ; in spqr_append() 123 *p_n = n ; in spqr_append() 144 Long *p_n, // number of columns of A; increased by one 161 Long *p_n, // number of columns of A; increased by one
|
/dports/math/suitesparse-amd/SuiteSparse-5.10.1/SPQR/Source/ |
H A D | spqr_append.cpp | 20 Long *p_n, // n = # of columns of A so far; increased one in spqr_append() argument 36 n = *p_n ; in spqr_append() 43 *p_n = n ; in spqr_append() 123 *p_n = n ; in spqr_append() 144 Long *p_n, // number of columns of A; increased by one 161 Long *p_n, // number of columns of A; increased by one
|
/dports/math/suitesparse-ldl/SuiteSparse-5.10.1/SPQR/Source/ |
H A D | spqr_append.cpp | 20 Long *p_n, // n = # of columns of A so far; increased one in spqr_append() argument 36 n = *p_n ; in spqr_append() 43 *p_n = n ; in spqr_append() 123 *p_n = n ; in spqr_append() 144 Long *p_n, // number of columns of A; increased by one 161 Long *p_n, // number of columns of A; increased by one
|
/dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/SPQR/Source/ |
H A D | spqr_append.cpp | 20 Long *p_n, // n = # of columns of A so far; increased one in spqr_append() argument 36 n = *p_n ; in spqr_append() 43 *p_n = n ; in spqr_append() 123 *p_n = n ; in spqr_append() 144 Long *p_n, // number of columns of A; increased by one 161 Long *p_n, // number of columns of A; increased by one
|
/dports/math/suitesparse-colamd/SuiteSparse-5.10.1/SPQR/Source/ |
H A D | spqr_append.cpp | 20 Long *p_n, // n = # of columns of A so far; increased one in spqr_append() argument 36 n = *p_n ; in spqr_append() 43 *p_n = n ; in spqr_append() 123 *p_n = n ; in spqr_append() 144 Long *p_n, // number of columns of A; increased by one 161 Long *p_n, // number of columns of A; increased by one
|
/dports/math/suitesparse-ccolamd/SuiteSparse-5.10.1/SPQR/Source/ |
H A D | spqr_append.cpp | 20 Long *p_n, // n = # of columns of A so far; increased one in spqr_append() argument 36 n = *p_n ; in spqr_append() 43 *p_n = n ; in spqr_append() 123 *p_n = n ; in spqr_append() 144 Long *p_n, // number of columns of A; increased by one 161 Long *p_n, // number of columns of A; increased by one
|
/dports/math/suitesparse-cholmod/SuiteSparse-5.10.1/SPQR/Source/ |
H A D | spqr_append.cpp | 20 Long *p_n, // n = # of columns of A so far; increased one in spqr_append() argument 36 n = *p_n ; in spqr_append() 43 *p_n = n ; in spqr_append() 123 *p_n = n ; in spqr_append() 144 Long *p_n, // number of columns of A; increased by one 161 Long *p_n, // number of columns of A; increased by one
|
/dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/SPQR/Source/ |
H A D | spqr_append.cpp | 20 Long *p_n, // n = # of columns of A so far; increased one in spqr_append() argument 36 n = *p_n ; in spqr_append() 43 *p_n = n ; in spqr_append() 123 *p_n = n ; in spqr_append() 144 Long *p_n, // number of columns of A; increased by one 161 Long *p_n, // number of columns of A; increased by one
|