Home
last modified time | relevance | path

Searched refs:next_j (Results 1 – 25 of 196) sorted by relevance

12345678

/dports/devel/interactive_rebase_tool/git-interactive-rebase-tool-1.2.1/cargo-crates/pdcurses-sys-0.7.0/src/PDCurses/demos/
H A Drain.c35 static int next_j(int j) in next_j() function
107 j = next_j(j); in main()
110 j = next_j(j); in main()
115 j = next_j(j); in main()
122 j = next_j(j); in main()
/dports/audio/ncspot/ncspot-0.9.3/cargo-crates/pdcurses-sys-0.7.1/src/PDCurses/demos/
H A Drain.c35 static int next_j(int j) in next_j() function
107 j = next_j(j); in main()
110 j = next_j(j); in main()
115 j = next_j(j); in main()
122 j = next_j(j); in main()
/dports/devel/mingw32-pdcurses/PDCurses-3.4/demos/
H A Drain.c37 static int next_j(int j) in next_j() function
109 j = next_j(j); in main()
112 j = next_j(j); in main()
117 j = next_j(j); in main()
124 j = next_j(j); in main()
/dports/devel/pdcurses/PDCurses-3.5/demos/
H A Drain.c35 static int next_j(int j)
108 j = next_j(j);
111 j = next_j(j);
116 j = next_j(j);
123 j = next_j(j);
/dports/lang/python27/Python-2.7.18/Demo/curses/
H A Drain.py10 def next_j(j): function
59 j = next_j(j)
62 j = next_j(j)
67 j = next_j(j)
74 j = next_j(j)
/dports/lang/python-legacy/Python-2.7.18/Demo/curses/
H A Drain.py10 def next_j(j): function
59 j = next_j(j)
62 j = next_j(j)
67 j = next_j(j)
74 j = next_j(j)
/dports/devel/interactive_rebase_tool/git-interactive-rebase-tool-1.2.1/cargo-crates/pancurses-0.16.1/examples/
H A Drain.rs35 fn next_j<T: Rng>(mut j: usize, rng: &mut T, window: &Window) -> usize { in next_j() function
100 j = next_j(j, &mut rng, &window); in main()
103 j = next_j(j, &mut rng, &window); in main()
108 j = next_j(j, &mut rng, &window); in main()
115 j = next_j(j, &mut rng, &window); in main()
/dports/audio/ncspot/ncspot-0.9.3/cargo-crates/pancurses-0.16.1/examples/
H A Drain.rs35 fn next_j<T: Rng>(mut j: usize, rng: &mut T, window: &Window) -> usize {
100 j = next_j(j, &mut rng, &window);
103 j = next_j(j, &mut rng, &window);
108 j = next_j(j, &mut rng, &window);
115 j = next_j(j, &mut rng, &window);
/dports/audio/ncspot/ncspot-0.9.3/cargo-crates/pancurses-0.17.0/examples/
H A Drain.rs37 fn next_j<T: Rng>(mut j: usize, rng: &mut T, window: &Window) -> usize { in next_j() function
102 j = next_j(j, &mut rng, &window); in main()
105 j = next_j(j, &mut rng, &window); in main()
110 j = next_j(j, &mut rng, &window); in main()
117 j = next_j(j, &mut rng, &window); in main()
/dports/science/openbabel/openbabel-3.1.1/src/formats/libinchi/
H A Dichimak2.c337 next_neigh = (j == at[next_j].neighbor[0]); in Copy2StereoBondOrAllene()
338 j = next_j; in Copy2StereoBondOrAllene()
339 next_j = at[next_j].neighbor[next_neigh]; in Copy2StereoBondOrAllene()
351 next_neigh = (j == at[next_j].neighbor[0]); in Copy2StereoBondOrAllene()
352 j = next_j; in Copy2StereoBondOrAllene()
353 next_j = at[next_j].neighbor[next_neigh]; in Copy2StereoBondOrAllene()
365 at_num = pCanonRank[next_j]; in Copy2StereoBondOrAllene()
518 int next_j, next_neigh; in MarkAmbiguousStereo() local
526 j = next_j; in MarkAmbiguousStereo()
527 next_j = at[next_j].neighbor[next_neigh]; in MarkAmbiguousStereo()
[all …]
/dports/devel/ncurses/ncurses-6.3/test/
H A Drain.c106 next_j(int j) in next_j() function
181 next_j(data->state); in really_draw()
401 j = next_j(j); in main()
404 j = next_j(j); in main()
407 j = next_j(j); in main()
410 j = next_j(j); in main()
/dports/biology/abyss/abyss-2.3.1/Align/
H A Dsmith_waterman.cpp102 int next_j=I_j[current_i][current_j]; in Backtrack() local
105 while(((current_i!=next_i) || (current_j!=next_j)) && (next_j!=0) && (next_i!=0)){ in Backtrack()
113 if(next_j==current_j) { in Backtrack()
133 current_j = next_j; in Backtrack()
135 next_j=I_j[current_i][current_j]; in Backtrack()
/dports/multimedia/libv4l/linux-5.13-rc2/net/rxrpc/
H A Dconn_event.c398 unsigned long j = jiffies, next_j; in rxrpc_process_delayed_final_acks() local
403 next_j = j + LONG_MAX; in rxrpc_process_delayed_final_acks()
416 if (time_before(ack_at, next_j)) { in rxrpc_process_delayed_final_acks()
417 next_j = ack_at; in rxrpc_process_delayed_final_acks()
429 if (time_before_eq(next_j, j)) in rxrpc_process_delayed_final_acks()
432 rxrpc_reduce_conn_timer(conn, next_j); in rxrpc_process_delayed_final_acks()
/dports/multimedia/v4l_compat/linux-5.13-rc2/net/rxrpc/
H A Dconn_event.c398 unsigned long j = jiffies, next_j; in rxrpc_process_delayed_final_acks() local
403 next_j = j + LONG_MAX; in rxrpc_process_delayed_final_acks()
416 if (time_before(ack_at, next_j)) { in rxrpc_process_delayed_final_acks()
417 next_j = ack_at; in rxrpc_process_delayed_final_acks()
429 if (time_before_eq(next_j, j)) in rxrpc_process_delayed_final_acks()
432 rxrpc_reduce_conn_timer(conn, next_j); in rxrpc_process_delayed_final_acks()
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/examples/graph/som/
H A Dsom_graph.cpp267 int next_j = 0; in graph_teach() local
271 int j = next_j; // try to make reproducible in graph_teach()
272 next_j = (epoch+1) % in.size(); in graph_teach()
280 (send_to[(epoch+1)%SPECULATION_CNT])->try_put(in[next_j]); in graph_teach()
284 (send_to[(epoch+1)%SPECULATION_CNT])->try_put(in[next_j]); in graph_teach()
301 … restart_submaps(get<1>(min_sr), get<2>(min_sr), radius, (epoch+1)%SPECULATION_CNT, in[next_j]); in graph_teach()
/dports/devel/tbb/oneTBB-2020.3/examples/graph/som/
H A Dsom_graph.cpp267 int next_j = 0; in graph_teach() local
271 int j = next_j; // try to make reproducible in graph_teach()
272 next_j = (epoch+1) % in.size(); in graph_teach()
280 (send_to[(epoch+1)%SPECULATION_CNT])->try_put(in[next_j]); in graph_teach()
284 (send_to[(epoch+1)%SPECULATION_CNT])->try_put(in[next_j]); in graph_teach()
301 … restart_submaps(get<1>(min_sr), get<2>(min_sr), radius, (epoch+1)%SPECULATION_CNT, in[next_j]); in graph_teach()
/dports/multimedia/v4l-utils/linux-5.13-rc2/net/rxrpc/
H A Dconn_event.c398 unsigned long j = jiffies, next_j; in rxrpc_process_delayed_final_acks() local
403 next_j = j + LONG_MAX; in rxrpc_process_delayed_final_acks()
416 if (time_before(ack_at, next_j)) { in rxrpc_process_delayed_final_acks()
417 next_j = ack_at; in rxrpc_process_delayed_final_acks()
429 if (time_before_eq(next_j, j)) in rxrpc_process_delayed_final_acks()
432 rxrpc_reduce_conn_timer(conn, next_j); in rxrpc_process_delayed_final_acks()
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/s2/
H A Ds2polyline.cc556 int const next_j = NextDistinctVertex(covered, state.j); in NearlyCoversPolyline() local
557 if (next_j == covered.num_vertices()) { in NearlyCoversPolyline()
571 i_begin, covered.vertex(state.j), covered.vertex(next_j)); in NearlyCoversPolyline()
574 if (S2EdgeUtil::IsEdgeBNearEdgeA(j_begin, covered.vertex(next_j), in NearlyCoversPolyline()
580 j_begin, covered.vertex(next_j), in NearlyCoversPolyline()
582 pending.push_back(SearchState(state.i, next_j, true)); in NearlyCoversPolyline()
/dports/math/igraph/igraph-0.9.5/vendor/glpk/misc/
H A Dtriang.c105 { int head, i, j, jj, k, kk, ks, len, len2, next_j, ns, size; in triang() local
157 for (j = ptr[len]; j != 0; j = next_j) in triang()
158 { next_j = next[j]; in triang()
/dports/math/glpk/glpk-5.0/src/misc/
H A Dtriang.c105 { int head, i, j, jj, k, kk, ks, len, len2, next_j, ns, size; in triang() local
157 for (j = ptr[len]; j != 0; j = next_j) in triang()
158 { next_j = next[j]; in triang()
/dports/graphics/R-cran-s2/s2/src/s2/
H A Ds2polyline.cc602 const int next_j = NextDistinctVertex(covered, state.j); in NearlyCovers() local
603 if (next_j == covered.num_vertices()) { in NearlyCovers()
617 i_begin, covered.vertex(state.j), covered.vertex(next_j)); in NearlyCovers()
620 if (S2::IsEdgeBNearEdgeA(j_begin, covered.vertex(next_j), in NearlyCovers()
625 j_begin, covered.vertex(next_j), max_error)) { in NearlyCovers()
626 pending.push_back(SearchState(state.i, next_j, true)); in NearlyCovers()
/dports/graphics/s2/s2geometry-0.9.0/src/s2/
H A Ds2polyline.cc602 const int next_j = NextDistinctVertex(covered, state.j); in NearlyCovers() local
603 if (next_j == covered.num_vertices()) { in NearlyCovers()
617 i_begin, covered.vertex(state.j), covered.vertex(next_j)); in NearlyCovers()
620 if (S2::IsEdgeBNearEdgeA(j_begin, covered.vertex(next_j), in NearlyCovers()
625 j_begin, covered.vertex(next_j), max_error)) { in NearlyCovers()
626 pending.push_back(SearchState(state.i, next_j, true)); in NearlyCovers()
/dports/graphics/py-s2/s2geometry-0.9.0/src/s2/
H A Ds2polyline.cc602 const int next_j = NextDistinctVertex(covered, state.j); in NearlyCovers() local
603 if (next_j == covered.num_vertices()) { in NearlyCovers()
617 i_begin, covered.vertex(state.j), covered.vertex(next_j)); in NearlyCovers()
620 if (S2::IsEdgeBNearEdgeA(j_begin, covered.vertex(next_j), in NearlyCovers()
625 j_begin, covered.vertex(next_j), max_error)) { in NearlyCovers()
626 pending.push_back(SearchState(state.i, next_j, true)); in NearlyCovers()
/dports/devel/onetbb/oneTBB-2021.4.0/examples/graph/som/
H A Dsom_graph.cpp387 int next_j = 0; in graph_teach() local
391 int j = next_j; // try to make reproducible in graph_teach()
392 next_j = (epoch + 1) % in.size(); in graph_teach()
400 (send_to[(epoch + 1) % SPECULATION_CNT])->try_put(in[next_j]); in graph_teach()
404 (send_to[(epoch + 1) % SPECULATION_CNT])->try_put(in[next_j]); in graph_teach()
427 in[next_j]); in graph_teach()
/dports/science/frontistr/FrontISTR-c66bdc397de319ca59a0565b3f3b1a3b33f0c50c/hecmw1/src/visualizer/
H A Dhecmw_vis_rendering.c72 int pixel_i[2][2], flag, tmp_i, last_j, next_j; in HECMW_vis_rendering_surface() local
981 next_j = (int)(pixel_i[0][1] + in HECMW_vis_rendering_surface()
983 if (last_j <= next_j) { in HECMW_vis_rendering_surface()
1071 last_j = next_j; in HECMW_vis_rendering_surface()
1218 next_j = (int)(pixel_i[0][1] + in HECMW_vis_rendering_surface()
1220 if (last_j <= next_j) { in HECMW_vis_rendering_surface()
1308 last_j = next_j; in HECMW_vis_rendering_surface()
1583 if (last_j <= next_j) { in HECMW_vis_rendering_surface()
1643 last_j = next_j; in HECMW_vis_rendering_surface()
2023 if (last_j <= next_j) { in HECMW_vis_rendering_surface()
[all …]

12345678