Home
last modified time | relevance | path

Searched refs:n_cur (Results 1 – 25 of 104) sorted by relevance

12345

/dports/math/igraph/igraph-0.9.5/src/community/spinglass/
H A Dpottsmodel_2.cpp60 NNode *n_cur; in PottsModel() local
91 n_cur = iter.Next(); in PottsModel()
120 NNode *n_cur; in assign_initial_conf() local
331 NNode *node, *n_cur; in HeatBathParallelLookupZeroTemp() local
468 NNode *node, *n_cur; in HeatBathLookupZeroTemp() local
577 NNode *node, *n_cur; in HeatBathParallelLookup() local
749 NNode *node, *n_cur; in HeatBathLookup() local
1353 correlation[n_cur->Get_Index()]->Set(n_cur->Get_Index()) = 0.0; in GammaSweep()
1438 correlation[n_cur->Get_Index()]->Set(n_cur->Get_Index()) = 0.0; in GammaSweepZeroTemp()
1596 NNode *n_cur; in assign_initial_conf() local
[all …]
H A DNetRoutines.cpp138 NNode *n_cur; in reduce_cliques() local
173 n_cur = iter.First(largest_c); in reduce_cliques()
175 fprintf(file, "%s", n_cur->Get_Name()); in reduce_cliques()
176 n_cur = iter.Next(); in reduce_cliques()
177 if (n_cur) { in reduce_cliques()
265 NNode *n_cur; in clear_all_markers() local
266 n_cur = iter.First(net->node_list); in clear_all_markers()
268 n_cur->Set_Marker(0); in clear_all_markers()
269 n_cur = iter.Next(); in clear_all_markers()
/dports/math/R-cran-igraph/igraph/src/
H A Dpottsmodel_2.cpp60 NNode *n_cur; in PottsModel() local
91 n_cur = iter.Next(); in PottsModel()
122 NNode *n_cur; in assign_initial_conf() local
330 NNode *node, *n_cur; in HeatBathParallelLookupZeroTemp() local
467 NNode *node, *n_cur; in HeatBathLookupZeroTemp() local
576 NNode *node, *n_cur; in HeatBathParallelLookup() local
748 NNode *node, *n_cur; in HeatBathLookup() local
1352 correlation[n_cur->Get_Index()]->Set(n_cur->Get_Index()) = 0.0; in GammaSweep()
1437 correlation[n_cur->Get_Index()]->Set(n_cur->Get_Index()) = 0.0; in GammaSweepZeroTemp()
1591 NNode *n_cur; in assign_initial_conf() local
[all …]
H A DNetRoutines.cpp152 NNode *n_cur; in reduce_cliques() local
187 n_cur = iter.First(largest_c); in reduce_cliques()
189 fprintf(file, "%s", n_cur->Get_Name()); in reduce_cliques()
190 n_cur = iter.Next(); in reduce_cliques()
191 if (n_cur) { in reduce_cliques()
279 NNode *n_cur; in clear_all_markers() local
280 n_cur = iter.First(net->node_list); in clear_all_markers()
282 n_cur->Set_Marker(0); in clear_all_markers()
283 n_cur = iter.Next(); in clear_all_markers()
/dports/x11/libfm-extra/libfm-1.3.2/src/base/
H A Dfm-nav-history.c43 guint n_cur; member
175 return nh->n_cur > 0; in fm_nav_history_can_forward()
198 nh->n_cur--; in fm_nav_history_forward()
241 nh->n_cur++; in fm_nav_history_back()
284 nh->n_cur--; in fm_nav_history_chdir()
330 nh->n_cur = 0; in fm_nav_history_clear()
348 nh->n_cur = 0; in fm_nav_history_set_max()
370 return nh->n_cur; in fm_nav_history_get_cur_index()
390 if(n == nh->n_cur) in fm_nav_history_get_nth_path()
419 if(n == nh->n_cur) in fm_nav_history_go_to()
[all …]
/dports/x11/libfm/libfm-1.3.2/src/base/
H A Dfm-nav-history.c43 guint n_cur; member
175 return nh->n_cur > 0; in fm_nav_history_can_forward()
198 nh->n_cur--; in fm_nav_history_forward()
241 nh->n_cur++; in fm_nav_history_back()
284 nh->n_cur--; in fm_nav_history_chdir()
330 nh->n_cur = 0; in fm_nav_history_clear()
348 nh->n_cur = 0; in fm_nav_history_set_max()
370 return nh->n_cur; in fm_nav_history_get_cur_index()
390 if(n == nh->n_cur) in fm_nav_history_get_nth_path()
419 if(n == nh->n_cur) in fm_nav_history_go_to()
[all …]
/dports/textproc/R-cran-stringi/stringi/src/
H A Dstri_search_class_split.cpp116 int n_cur = n_cont.get(i); in stri_split_charclass() local
119 if (n_cur >= INT_MAX-1) in stri_split_charclass()
121 else if (n_cur < 0) in stri_split_charclass()
122 n_cur = INT_MAX; in stri_split_charclass()
123 else if (n_cur == 0) { in stri_split_charclass()
128 n_cur++; // we need to do one split ahead here in stri_split_charclass()
137 for (j=0, k=1; j<str_cur_n && k < n_cur; ) { in stri_split_charclass()
153 if (k == n_cur) in stri_split_charclass()
158 if (tokens_only1 && n_cur < INT_MAX) { in stri_split_charclass()
159 n_cur--; // one split ahead could have been made, see above in stri_split_charclass()
[all …]
H A Dstri_search_coll_split.cpp120 int n_cur = n_cont.get(i); in stri_split_coll() local
127 stri__vector_empty_strings((omit_empty_cur || n_cur == 0)?0:1));) in stri_split_coll()
133 if (n_cur >= INT_MAX-1) in stri_split_coll()
135 else if (n_cur < 0) in stri_split_coll()
136 n_cur = INT_MAX; in stri_split_coll()
137 else if (n_cur == 0) { in stri_split_coll()
142 n_cur++; // we need to do one split ahead here in stri_split_coll()
149 … for (k=1; k < n_cur && USEARCH_DONE != usearch_next(matcher, &status) && !U_FAILURE(status); ) { in stri_split_coll()
166 if (tokens_only1 && n_cur < INT_MAX) { in stri_split_coll()
167 n_cur--; // one split ahead could have been made, see above in stri_split_coll()
[all …]
H A Dstri_search_fixed_split.cpp120 int n_cur = n_cont.get(i); in stri_split_fixed() local
127 stri__vector_empty_strings((omit_empty_cur || n_cur == 0)?0:1));) in stri_split_fixed()
132 if (n_cur >= INT_MAX-1) in stri_split_fixed()
134 else if (n_cur < 0) in stri_split_fixed()
135 n_cur = INT_MAX; in stri_split_fixed()
136 else if (n_cur == 0) { in stri_split_fixed()
141 n_cur++; // we need to do one split ahead here in stri_split_fixed()
149 for (k=1; k < n_cur && USEARCH_DONE != matcher->findNext(); ) { in stri_split_fixed()
165 if (tokens_only1 && n_cur < INT_MAX) { in stri_split_fixed()
166 n_cur--; // one split ahead could have been made, see above in stri_split_fixed()
[all …]
H A Dstri_search_regex_split.cpp118 int n_cur = n_cont.get(i); in stri_split_regex() local
125 stri__vector_empty_strings((omit_empty_cur || n_cur == 0)?0:1));) in stri_split_regex()
130 if (n_cur >= INT_MAX-1) in stri_split_regex()
132 else if (n_cur < 0) in stri_split_regex()
133 n_cur = INT_MAX; in stri_split_regex()
134 else if (n_cur == 0) { in stri_split_regex()
139 n_cur++; // we need to do one split ahead here in stri_split_regex()
153 for (k=1; k < n_cur; ) { in stri_split_regex()
175 if (tokens_only1 && n_cur < INT_MAX) { in stri_split_regex()
176 n_cur--; // one split ahead could have been made, see above in stri_split_regex()
[all …]
H A Dstri_search_boundaries_split.cpp93 int n_cur = n_cont.get(i); in stri_split_boundaries() local
100 if (n_cur >= INT_MAX-1) in stri_split_boundaries()
102 else if (n_cur < 0) in stri_split_boundaries()
103 n_cur = INT_MAX; in stri_split_boundaries()
104 else if (n_cur == 0) { in stri_split_boundaries()
117 while (k < n_cur && brkiter.next(curpair)) { in stri_split_boundaries()
128 if (k == n_cur && !tokens_only1) in stri_split_boundaries()
/dports/science/py-ase/ase-3.22.0/ase/
H A Dautoneb.py157 for i in range(n_cur):
250 n_cur = self.__initialize__()
259 for j in range(n_cur - 1):
296 n_cur += n_between
321 while n_cur < self.n_max:
384 n_cur += 1
470 n_cur = index_exists[-1] + 1
499 for i in range(n_cur):
508 return n_cur
541 n_cur = len(self.all_images)
[all …]
/dports/net-mgmt/nagtail/nagtail-0.0.31/
H A Dmain.cpp101 int n_cur = 0; in main() local
120 parse_2_0_statuslog(fd, &cur, &n_cur); in main()
122 parse_1_0_statuslog(fd, &cur, &n_cur); in main()
126 for(loop=0; loop<n_cur; loop++) in main()
138 if (should_i_show_entry(cur, n_cur, loop, 0, 0, 0, 1)) in main()
193 n_prev = n_cur; in main()
/dports/math/blis/blis-0.8.1/frame/3/herk/other/
H A Dbli_herk_u_ker_var2rr.c206 dim_t n_cur; \
345 n_cur = ( bli_is_not_edge_f( j, n_iter, n_left ) ? NR : n_left ); \
385 if ( bli_intersects_diag_n( diagoffc_ij, m_cur, n_cur ) ) \
402 m_cur, n_cur, \
407 else if ( bli_is_strictly_above_diag_n( diagoffc_ij, m_cur, n_cur ) ) \
410 if ( m_cur == MR && n_cur == NR ) \
441 PASTEMAC(ch,xpbys_mxn)( m_cur, n_cur, \
472 n_cur = ( bli_is_not_edge_f( j, n_iter, n_left ) ? NR : n_left ); \
515 if ( m_cur == MR && n_cur == NR ) \
546 PASTEMAC(ch,xpbys_mxn)( m_cur, n_cur, \
H A Dbli_herk_u_ker_var2sl.c206 dim_t n_cur; \
346 n_cur = ( bli_is_not_edge_f( j, n_iter, n_left ) ? NR : n_left ); \
386 if ( bli_intersects_diag_n( diagoffc_ij, m_cur, n_cur ) ) \
403 m_cur, n_cur, \
408 else if ( bli_is_strictly_above_diag_n( diagoffc_ij, m_cur, n_cur ) ) \
411 if ( m_cur == MR && n_cur == NR ) \
442 PASTEMAC(ch,xpbys_mxn)( m_cur, n_cur, \
473 n_cur = ( bli_is_not_edge_f( j, n_iter, n_left ) ? NR : n_left ); \
516 if ( m_cur == MR && n_cur == NR ) \
547 PASTEMAC(ch,xpbys_mxn)( m_cur, n_cur, \
H A Dbli_herk_l_ker_var2rr.c206 dim_t n_cur; \
343 n_cur = ( bli_is_not_edge_f( j, n_iter, n_left ) ? NR : n_left ); \
386 if ( m_cur == MR && n_cur == NR ) \
417 PASTEMAC(ch,xpbys_mxn)( m_cur, n_cur, \
448 n_cur = ( bli_is_not_edge_f( j, n_iter, n_left ) ? NR : n_left ); \
488 if ( bli_intersects_diag_n( diagoffc_ij, m_cur, n_cur ) ) \
505 m_cur, n_cur, \
510 else if ( bli_is_strictly_below_diag_n( diagoffc_ij, m_cur, n_cur ) ) \
513 if ( m_cur == MR && n_cur == NR ) \
544 PASTEMAC(ch,xpbys_mxn)( m_cur, n_cur, \
H A Dbli_herk_l_ker_var2sl.c206 dim_t n_cur; \
343 n_cur = ( bli_is_not_edge_f( j, n_iter, n_left ) ? NR : n_left ); \
386 if ( m_cur == MR && n_cur == NR ) \
417 PASTEMAC(ch,xpbys_mxn)( m_cur, n_cur, \
449 n_cur = ( bli_is_not_edge_f( j, n_iter, n_left ) ? NR : n_left ); \
489 if ( bli_intersects_diag_n( diagoffc_ij, m_cur, n_cur ) ) \
506 m_cur, n_cur, \
511 else if ( bli_is_strictly_below_diag_n( diagoffc_ij, m_cur, n_cur ) ) \
514 if ( m_cur == MR && n_cur == NR ) \
545 PASTEMAC(ch,xpbys_mxn)( m_cur, n_cur, \
/dports/math/blis/blis-0.8.1/frame/3/herk/
H A Dbli_herk_l_ker_var2.c203 dim_t n_cur; \
345 n_cur = ( bli_is_not_edge_f( j, n_iter, n_left ) ? NR : n_left ); \
388 if ( m_cur == MR && n_cur == NR ) \
419 PASTEMAC(ch,xpbys_mxn)( m_cur, n_cur, \
451 n_cur = ( bli_is_not_edge_f( j, n_iter, n_left ) ? NR : n_left ); \
491 if ( bli_intersects_diag_n( diagoffc_ij, m_cur, n_cur ) ) \
508 m_cur, n_cur, \
513 else if ( bli_is_strictly_below_diag_n( diagoffc_ij, m_cur, n_cur ) ) \
516 if ( m_cur == MR && n_cur == NR ) \
547 PASTEMAC(ch,xpbys_mxn)( m_cur, n_cur, \
H A Dbli_herk_u_ker_var2.c203 dim_t n_cur; \
346 n_cur = ( bli_is_not_edge_f( j, n_iter, n_left ) ? NR : n_left ); \
386 if ( bli_intersects_diag_n( diagoffc_ij, m_cur, n_cur ) ) \
403 m_cur, n_cur, \
408 else if ( bli_is_strictly_above_diag_n( diagoffc_ij, m_cur, n_cur ) ) \
411 if ( m_cur == MR && n_cur == NR ) \
442 PASTEMAC(ch,xpbys_mxn)( m_cur, n_cur, \
476 n_cur = ( bli_is_not_edge_f( j, n_iter, n_left ) ? NR : n_left ); \
519 if ( m_cur == MR && n_cur == NR ) \
550 PASTEMAC(ch,xpbys_mxn)( m_cur, n_cur, \
/dports/textproc/libxml2/libxml2-2.9.12/
H A Dtestapi.c2852 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocContentDumpFormatOutput()
2903 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocContentDumpOutput()
2948 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDump()
2996 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDumpMemory()
3044 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDumpMemoryFormat()
3248 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDump()
3295 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDumpFile()
3346 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDumpFileFormat()
3514 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlSaveFile()
3557 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlSaveFileEnc()
[all …]
/dports/textproc/py-libxml2/libxml2-2.9.12/
H A Dtestapi.c2852 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocContentDumpFormatOutput()
2903 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocContentDumpOutput()
2948 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDump()
2996 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDumpMemory()
3044 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDumpMemoryFormat()
3248 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDump()
3295 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDumpFile()
3346 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDumpFileFormat()
3514 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlSaveFile()
3557 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlSaveFileEnc()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/libxml/src/
H A Dtestapi.c2852 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocContentDumpFormatOutput()
2903 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocContentDumpOutput()
2948 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDump()
2996 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDumpMemory()
3044 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDumpMemoryFormat()
3248 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDump()
3295 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDumpFile()
3346 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDumpFileFormat()
3514 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlSaveFile()
3557 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlSaveFileEnc()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/libxml/src/
H A Dtestapi.c2852 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocContentDumpFormatOutput()
2903 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocContentDumpOutput()
2948 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDump()
2996 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDumpMemory()
3044 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDumpMemoryFormat()
3248 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDump()
3295 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDumpFile()
3346 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDumpFileFormat()
3514 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlSaveFile()
3557 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlSaveFileEnc()
[all …]
/dports/graphics/opencollada/OpenCOLLADA-1.6.68/Externals/LibXML/
H A Dtestapi.c2813 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocContentDumpFormatOutput()
2864 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocContentDumpOutput()
2909 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDump()
2957 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDumpMemory()
3005 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDumpMemoryFormat()
3209 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDump()
3256 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDumpFile()
3307 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDumpFileFormat()
3475 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlSaveFile()
3518 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlSaveFileEnc()
[all …]
/dports/biology/py-python-libsbml/python-libsbml-5.19.0/libsbml_dependencies/libxml2/
H A Dtestapi.c2840 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocContentDumpFormatOutput()
2891 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocContentDumpOutput()
2936 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDump()
2984 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDumpMemory()
3032 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlDocDumpMemoryFormat()
3236 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDump()
3283 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDumpFile()
3334 for (n_cur = 0;n_cur < gen_nb_xmlNodePtr;n_cur++) { in test_htmlNodeDumpFileFormat()
3502 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlSaveFile()
3545 for (n_cur = 0;n_cur < gen_nb_xmlDocPtr;n_cur++) { in test_htmlSaveFileEnc()
[all …]

12345