Searched refs:n_issues (Results 1 – 4 of 4) sorted by relevance
/dports/science/py-dipy/dipy-1.4.1/tools/ |
H A D | github_stats.py | 173 n_issues, n_pulls = map(len, (issues, pulls)) variable 174 n_total = n_issues + n_pulls 210 n_issues)) 215 print('Issues (%d):\n' % n_issues)
|
/dports/math/py-matplotlib/matplotlib-3.4.3/tools/ |
H A D | github_stats.py | 173 n_issues, n_pulls = map(len, (issues, pulls)) variable 174 n_total = n_issues + n_pulls 210 print("We closed %d issues and merged %d pull requests." % (n_issues, n_pulls)) 228 print('Issues (%d):\n' % n_issues)
|
/dports/math/py-matplotlib2/matplotlib-2.2.4/tools/ |
H A D | github_stats.py | 180 n_issues, n_pulls = map(len, (issues, pulls)) variable 181 n_total = n_issues + n_pulls 217 print("We closed %d issues and merged %d pull requests." % (n_issues, n_pulls)) 235 print('Issues (%d):\n' % n_issues)
|
/dports/science/code_saturne/code_saturne-7.1.0/src/mesh/ |
H A D | cs_join_merge.c | 1442 cs_lnum_t n_issues = 0; in _check_tol_consistency() local 1458 for (j = 0; j < n_issues; j++) in _check_tol_consistency() 1461 if (j == n_issues) in _check_tol_consistency() 1462 issues[n_issues++] = subset_num[i1]; in _check_tol_consistency() 1470 return n_issues; /* Not a subset number */ in _check_tol_consistency() 1571 cs_lnum_t n_issues, in _break_equivalence() argument 1579 for (i = 0; i < n_issues; i++) { in _break_equivalence() 1683 cs_lnum_t i1, i2, k, n_issues; in _solve_transitivity() local 1744 n_issues = _check_tol_consistency(set_size, in _solve_transitivity() 1751 if (n_issues > 0) in _solve_transitivity() [all …]
|