| /dports/graphics/diffpdf/diffpdf-2.1.3/ |
| H A D | sequence_matcher.cpp | 171 int best_j = b_low; in find_longest_match() local
185 best_j = j - k + 1; in find_longest_match()
192 while (best_i > a_low && best_j > b_low && in find_longest_match()
193 a[best_i - 1] == b[best_j - 1]) { in find_longest_match()
195 --best_j; in find_longest_match()
198 while (best_i + best_size < a_high && best_j + best_size < b_high && in find_longest_match()
199 a[best_i + best_size] == b[best_j + best_size]) in find_longest_match()
202 return Match(best_i, best_j, best_size); in find_longest_match()
|
| /dports/misc/vxl/vxl-3.3.2/contrib/mul/clsfy/ |
| H A D | clsfy_adaboost_trainer.cxx | 107 int best_j=-1; in build_strong_classifier() local
122 best_j = j; in build_strong_classifier()
126 std::cout<<"best_j= "<<best_j<<'\n' in build_strong_classifier()
133 strong_classifier.add_classifier( best_c1d, alpha, best_j); in build_strong_classifier()
154 strong_classifier.add_classifier( best_c1d, alpha, best_j); in build_strong_classifier()
159 clsfy_get_elements(egs0_1d,egs0,best_j); in build_strong_classifier()
160 clsfy_get_elements(egs1_1d,egs1,best_j); in build_strong_classifier()
|
| /dports/devel/py-rapidfuzz/rapidfuzz-1.8.0/src/rapidfuzz-cpp/rapidfuzz/details/ |
| H A D | matching_blocks.hpp | 62 std::size_t best_j = b_low; in find_longest_match() local
94 best_j = j - k + 1; in find_longest_match()
104 while (best_i > a_low && best_j > b_low && in find_longest_match()
105 common::mixed_sign_equal(a_[best_i - 1], b_[best_j - 1])) { in find_longest_match()
107 --best_j; in find_longest_match()
111 while ((best_i + best_size) < a_high && (best_j + best_size) < b_high && in find_longest_match()
112 common::mixed_sign_equal(a_[best_i + best_size], b_[best_j + best_size])) in find_longest_match()
117 return std::make_tuple(best_i, best_j, best_size); in find_longest_match()
|
| /dports/math/cadabra2/cadabra2-2.3.6.8/libs/internal/include/internal/ |
| H A D | difflib.h | 251 size_t best_j = j1; in find_longest_match() local
266 best_j = j - k + 1; in find_longest_match()
275 best_j > j1 && in find_longest_match()
280 --best_j; in find_longest_match()
286 best_j + best_size < j2 && in find_longest_match()
295 best_j > j1 && in find_longest_match()
300 --best_j; in find_longest_match()
306 best_j + best_size < j2 && in find_longest_match()
650 size_t best_j = 0; in fancy_replace() local
673 best_j = j; in fancy_replace()
[all …]
|
| /dports/devel/rapidfuzz-cpp/rapidfuzz-cpp-47df6f7/rapidfuzz/details/ |
| H A D | matching_blocks.hpp | 60 size_t best_j = b_low; in find_longest_match() local
79 best_j = j - k + 1; in find_longest_match()
91 … while (best_i > a_low && best_j > b_low && common::mixed_sign_equal(a_[best_i-1], b_[best_j-1])) { in find_longest_match()
93 --best_j; in find_longest_match()
97 while ((best_i+best_size) < a_high && (best_j+best_size) < b_high in find_longest_match()
98 && common::mixed_sign_equal(a_[best_i+best_size], b_[best_j+best_size])) in find_longest_match()
103 return std::make_tuple(best_i, best_j, best_size); in find_longest_match()
|
| /dports/biology/iolib/io_lib-io_lib-1-14-10/progs/ |
| H A D | scram_merge.c | 339 int best_j = 0, j; in main() local
353 best_j = j; in main()
361 if (-1 == scram_put_seq(out, s[best_j])) in main()
364 if (scram_get_seq(in[best_j], &s[best_j]) < 0) { in main()
365 if (scram_close(in[best_j])) in main()
367 in[best_j] = NULL; in main()
368 free(s[best_j]); in main()
|
| /dports/audio/festival/speech_tools/stats/ |
| H A D | dynamic_program.cc | 261 int best_i=-1,best_j=-1; in dp_sub() local
279 best_j = j; in dp_sub()
291 best_j = j-1; in dp_sub()
308 best_j = j; in dp_sub()
328 best_j=j-1; in dp_sub()
341 best_j=j-1; in dp_sub()
354 best_j=j; in dp_sub()
362 DP_path_j.a_no_check(i,j) = best_j; in dp_sub()
|
| /dports/audio/spectmorph/spectmorph-0.5.2/lib/ |
| H A D | smsinedecoder.cc | 130 int best_i = 0, best_j = 0; /* init to get rid of gcc warning */ in process() local
140 best_j = j; in process()
148 double nfreq = nfreqs[best_j]; in process()
149 nfreqs[best_j] = -1; in process()
151 double nmag = block.mags_f (best_j); in process()
170 next_synth_fixed_phase[best_j] = phase; in process()
182 next_synth_fixed_phase[best_j] = phase; in process()
|
| /dports/misc/vxl/vxl-3.3.2/contrib/mul/mbl/ |
| H A D | mbl_dyn_prog.cxx | 216 int best_j = 0; in solve() local
220 if (ci[j]<best_cost) { best_j=j; best_cost=ci[j]; } in solve()
223 construct_path(x,best_j); in solve()
246 int best_j = 0; in solve_asym() local
251 best_j=last_state; in solve_asym()
259 if (ci[j]<best_cost) { best_j=j; best_cost=ci[j]; } in solve_asym()
262 construct_path(x,best_j); in solve_asym()
|
| /dports/multimedia/librav1e/rav1e-0.5.1/cargo-crates/difflib-0.4.0/src/ |
| H A D | sequencematcher.rs | 150 let (mut best_i, mut best_j, mut best_size) = (first_start, second_start, 0); in find_longest_match()
178 best_j = j + 1 - size; in find_longest_match()
187 && best_j > second_start in find_longest_match()
188 && first_sequence.get(best_i - 1) == second_sequence.get(best_j - 1) in find_longest_match()
191 best_j -= 1; in find_longest_match()
195 && best_j + best_size < second_end in find_longest_match()
196 && first_sequence.get(best_i + best_size) == second_sequence.get(best_j + best_size) in find_longest_match()
201 Match::new(best_i, best_j, best_size) in find_longest_match()
|
| /dports/multimedia/rav1e/rav1e-0.5.1/cargo-crates/difflib-0.4.0/src/ |
| H A D | sequencematcher.rs | 150 let (mut best_i, mut best_j, mut best_size) = (first_start, second_start, 0); in find_longest_match()
178 best_j = j + 1 - size; in find_longest_match()
187 && best_j > second_start in find_longest_match()
188 && first_sequence.get(best_i - 1) == second_sequence.get(best_j - 1) in find_longest_match()
191 best_j -= 1; in find_longest_match()
195 && best_j + best_size < second_end in find_longest_match()
196 && first_sequence.get(best_i + best_size) == second_sequence.get(best_j + best_size) in find_longest_match()
201 Match::new(best_i, best_j, best_size) in find_longest_match()
|
| /dports/devel/tigcc/tigcc-0.96.b8_10/tigcc/tigcclib/examples/ |
| H A D | Othello-Reversi.c | 253 int minmax_search(char figure,int depth,int alpha,int *best_i,int *best_j) in minmax_search() argument
257 *best_i=0; *best_j=0; in minmax_search()
272 max=score; *best_i=i; *best_j=j; in minmax_search()
276 *best_i=i; *best_j=j; in minmax_search()
291 int best_i,best_j; in computer_move() local
294 minmax_search(WHITE,1,1000,&best_i,&best_j); in computer_move()
299 try_a_move(best_i,best_j,WHITE); in computer_move()
300 sprintf(str,"My move: %c%d",best_j-1+'A',best_i); in computer_move()
|
| /dports/devel/sentry-cli/sentry-cli-1.71.0/cargo-crates/difflib-0.4.0/src/ |
| H A D | sequencematcher.rs | 150 let (mut best_i, mut best_j, mut best_size) = (first_start, second_start, 0); in find_longest_match()
178 best_j = j + 1 - size; in find_longest_match()
187 && best_j > second_start in find_longest_match()
188 && first_sequence.get(best_i - 1) == second_sequence.get(best_j - 1) in find_longest_match()
191 best_j -= 1; in find_longest_match()
195 && best_j + best_size < second_end in find_longest_match()
196 && first_sequence.get(best_i + best_size) == second_sequence.get(best_j + best_size) in find_longest_match()
201 Match::new(best_i, best_j, best_size) in find_longest_match()
|
| /dports/devel/grex/grex-1.3.0/cargo-crates/difflib-0.4.0/src/ |
| H A D | sequencematcher.rs | 150 let (mut best_i, mut best_j, mut best_size) = (first_start, second_start, 0); in find_longest_match()
178 best_j = j + 1 - size; in find_longest_match()
187 && best_j > second_start in find_longest_match()
188 && first_sequence.get(best_i - 1) == second_sequence.get(best_j - 1) in find_longest_match()
191 best_j -= 1; in find_longest_match()
195 && best_j + best_size < second_end in find_longest_match()
196 && first_sequence.get(best_i + best_size) == second_sequence.get(best_j + best_size) in find_longest_match()
201 Match::new(best_i, best_j, best_size) in find_longest_match()
|
| /dports/sysutils/hexyl/hexyl-0.9.0/cargo-crates/difflib-0.4.0/src/ |
| H A D | sequencematcher.rs | 150 let (mut best_i, mut best_j, mut best_size) = (first_start, second_start, 0); in find_longest_match()
178 best_j = j + 1 - size; in find_longest_match()
187 && best_j > second_start in find_longest_match()
188 && first_sequence.get(best_i - 1) == second_sequence.get(best_j - 1) in find_longest_match()
191 best_j -= 1; in find_longest_match()
195 && best_j + best_size < second_end in find_longest_match()
196 && first_sequence.get(best_i + best_size) == second_sequence.get(best_j + best_size) in find_longest_match()
201 Match::new(best_i, best_j, best_size) in find_longest_match()
|
| /dports/graphics/librsvg2-rust/librsvg-2.52.8/vendor/difflib/src/ |
| H A D | sequencematcher.rs | 150 let (mut best_i, mut best_j, mut best_size) = (first_start, second_start, 0); in find_longest_match()
178 best_j = j + 1 - size; in find_longest_match()
187 && best_j > second_start in find_longest_match()
188 && first_sequence.get(best_i - 1) == second_sequence.get(best_j - 1) in find_longest_match()
191 best_j -= 1; in find_longest_match()
195 && best_j + best_size < second_end in find_longest_match()
196 && first_sequence.get(best_i + best_size) == second_sequence.get(best_j + best_size) in find_longest_match()
201 Match::new(best_i, best_j, best_size) in find_longest_match()
|
| /dports/misc/xplr/xplr-0.17.0/cargo-crates/difflib-0.4.0/src/ |
| H A D | sequencematcher.rs | 150 let (mut best_i, mut best_j, mut best_size) = (first_start, second_start, 0); in find_longest_match()
178 best_j = j + 1 - size; in find_longest_match()
187 && best_j > second_start in find_longest_match()
188 && first_sequence.get(best_i - 1) == second_sequence.get(best_j - 1) in find_longest_match()
191 best_j -= 1; in find_longest_match()
195 && best_j + best_size < second_end in find_longest_match()
196 && first_sequence.get(best_i + best_size) == second_sequence.get(best_j + best_size) in find_longest_match()
201 Match::new(best_i, best_j, best_size) in find_longest_match()
|
| /dports/net/oha/oha-0.4.7/cargo-crates/difflib-0.4.0/src/ |
| H A D | sequencematcher.rs | 150 let (mut best_i, mut best_j, mut best_size) = (first_start, second_start, 0); in find_longest_match()
178 best_j = j + 1 - size; in find_longest_match()
187 && best_j > second_start in find_longest_match()
188 && first_sequence.get(best_i - 1) == second_sequence.get(best_j - 1) in find_longest_match()
191 best_j -= 1; in find_longest_match()
195 && best_j + best_size < second_end in find_longest_match()
196 && first_sequence.get(best_i + best_size) == second_sequence.get(best_j + best_size) in find_longest_match()
201 Match::new(best_i, best_j, best_size) in find_longest_match()
|
| /dports/devel/cargo-generate/cargo-generate-0.9.0/cargo-crates/difflib-0.4.0/src/ |
| H A D | sequencematcher.rs | 150 let (mut best_i, mut best_j, mut best_size) = (first_start, second_start, 0); in find_longest_match()
178 best_j = j + 1 - size; in find_longest_match()
187 && best_j > second_start in find_longest_match()
188 && first_sequence.get(best_i - 1) == second_sequence.get(best_j - 1) in find_longest_match()
191 best_j -= 1; in find_longest_match()
195 && best_j + best_size < second_end in find_longest_match()
196 && first_sequence.get(best_i + best_size) == second_sequence.get(best_j + best_size) in find_longest_match()
201 Match::new(best_i, best_j, best_size) in find_longest_match()
|
| /dports/textproc/mdbook/mdBook-0.4.13/cargo-crates/difflib-0.4.0/src/ |
| H A D | sequencematcher.rs | 150 let (mut best_i, mut best_j, mut best_size) = (first_start, second_start, 0); in find_longest_match()
178 best_j = j + 1 - size; in find_longest_match()
187 && best_j > second_start in find_longest_match()
188 && first_sequence.get(best_i - 1) == second_sequence.get(best_j - 1) in find_longest_match()
191 best_j -= 1; in find_longest_match()
195 && best_j + best_size < second_end in find_longest_match()
196 && first_sequence.get(best_i + best_size) == second_sequence.get(best_j + best_size) in find_longest_match()
201 Match::new(best_i, best_j, best_size) in find_longest_match()
|
| /dports/www/xh/xh-0.14.1/cargo-crates/difflib-0.4.0/src/ |
| H A D | sequencematcher.rs | 150 let (mut best_i, mut best_j, mut best_size) = (first_start, second_start, 0); in find_longest_match()
178 best_j = j + 1 - size; in find_longest_match()
187 && best_j > second_start in find_longest_match()
188 && first_sequence.get(best_i - 1) == second_sequence.get(best_j - 1) in find_longest_match()
191 best_j -= 1; in find_longest_match()
195 && best_j + best_size < second_end in find_longest_match()
196 && first_sequence.get(best_i + best_size) == second_sequence.get(best_j + best_size) in find_longest_match()
201 Match::new(best_i, best_j, best_size) in find_longest_match()
|
| /dports/www/miniserve/miniserve-0.18.0/cargo-crates/difflib-0.4.0/src/ |
| H A D | sequencematcher.rs | 150 let (mut best_i, mut best_j, mut best_size) = (first_start, second_start, 0); in find_longest_match()
178 best_j = j + 1 - size; in find_longest_match()
187 && best_j > second_start in find_longest_match()
188 && first_sequence.get(best_i - 1) == second_sequence.get(best_j - 1) in find_longest_match()
191 best_j -= 1; in find_longest_match()
195 && best_j + best_size < second_end in find_longest_match()
196 && first_sequence.get(best_i + best_size) == second_sequence.get(best_j + best_size) in find_longest_match()
201 Match::new(best_i, best_j, best_size) in find_longest_match()
|
| /dports/benchmarks/inferno/inferno-0.10.9/cargo-crates/difflib-0.4.0/src/ |
| H A D | sequencematcher.rs | 150 let (mut best_i, mut best_j, mut best_size) = (first_start, second_start, 0); in find_longest_match()
178 best_j = j + 1 - size; in find_longest_match()
187 && best_j > second_start in find_longest_match()
188 && first_sequence.get(best_i - 1) == second_sequence.get(best_j - 1) in find_longest_match()
191 best_j -= 1; in find_longest_match()
195 && best_j + best_size < second_end in find_longest_match()
196 && first_sequence.get(best_i + best_size) == second_sequence.get(best_j + best_size) in find_longest_match()
201 Match::new(best_i, best_j, best_size) in find_longest_match()
|
| /dports/benchmarks/hyperfine/hyperfine-1.12.0/cargo-crates/difflib-0.4.0/src/ |
| H A D | sequencematcher.rs | 150 let (mut best_i, mut best_j, mut best_size) = (first_start, second_start, 0); in find_longest_match()
178 best_j = j + 1 - size; in find_longest_match()
187 && best_j > second_start in find_longest_match()
188 && first_sequence.get(best_i - 1) == second_sequence.get(best_j - 1) in find_longest_match()
191 best_j -= 1; in find_longest_match()
195 && best_j + best_size < second_end in find_longest_match()
196 && first_sequence.get(best_i + best_size) == second_sequence.get(best_j + best_size) in find_longest_match()
201 Match::new(best_i, best_j, best_size) in find_longest_match()
|
| /dports/biology/dsr-pdb/dsr-pdb-1.0.3/include/dsrpdb_internal/ |
| H A D | align_points.h | 152 int best_j(0); in greedy_matching()
168 best_j= 0; in greedy_matching()
180 double v_j= -gap_cost*best_j + dp_matrix[i-1][j-best_j-1].first; in greedy_matching()
185 best_j=0; in greedy_matching()
189 if (v_d >= v_j) best_j=0; in greedy_matching()
191 dp_matrix[i][j] = DpP(ss+v_j, -best_j); in greedy_matching()
212 ++best_j; in greedy_matching()
|