Home
last modified time | relevance | path

Searched refs:best_count (Results 1 – 25 of 138) sorted by relevance

123456

/dports/devel/upp/upp/examples/CompDir/
H A Dtextdiff.cpp60 … Find(int start1, int end1, int start2, int end2, int& best_match, int& best_count) const;
135 …omparator::Find(int start1, int end1, int start2, int end2, int& best_match, int& best_count) const in Find()
141 int lvl = GetHashLevel(best_count + 1, hash1.GetCount()); in Find()
143 int last = max(best_count - chunk + 1, 0); in Find()
150 if(i + best_count >= end2) in Find()
157 if(cnt > best_count) { in Find()
158 best_count = cnt; in Find()
161 last = best_count - chunk + 1; in Find()
162 if(best_count + 1 >= 2 * chunk) in Find()
164 lvl = GetHashLevel(best_count + 1, hash1.GetCount()); in Find()
[all …]
/dports/devel/upp/upp/uppsrc/TextDiffCtrl/
H A DTextDiff.cpp62 … Find(int start1, int end1, int start2, int end2, int& best_match, int& best_count) const;
137 …omparator::Find(int start1, int end1, int start2, int end2, int& best_match, int& best_count) const in Find()
143 int lvl = GetHashLevel(best_count + 1, hash1.GetCount()); in Find()
145 int last = max(best_count - chunk + 1, 0); in Find()
152 if(i + best_count >= end2) in Find()
159 if(cnt > best_count) { in Find()
160 best_count = cnt; in Find()
163 last = best_count - chunk + 1; in Find()
164 if(best_count + 1 >= 2 * chunk) in Find()
166 lvl = GetHashLevel(best_count + 1, hash1.GetCount()); in Find()
[all …]
/dports/graphics/tesseract/tesseract-5.0.0/src/ccutil/
H A Dsorthelper.h87 int best_count = -INT32_MAX; in MaxCount() local
89 if (it.count > best_count) { in MaxCount()
90 best_count = it.count; in MaxCount()
96 return best_count; in MaxCount()
/dports/biology/vsearch/vsearch-2.17.1/src/
H A Dsintax.cc220 int best_count, in sintax_analyse() argument
327 fprintf(fp_tabbedout, "\t%d\t%d", best_count, count); in sintax_analyse()
339 unsigned int best_count[2] = {0, 0}; in sintax_query() local
390 if (e.count > best_count[s]) in sintax_query()
392 best_count[s] = e.count; in sintax_query()
406 if (best_count[0] > best_count[1]) { in sintax_query()
408 } else if (best_count[1] > best_count[0]) { in sintax_query()
424 best_count[best_strand], in sintax_query()
H A Dmsa.cc322 prof_type best_count = 0; in msa() local
326 if (count > best_count) in msa()
328 best_count = count; in msa()
335 if ((best_count == 0) && (n_count > 0)) in msa()
337 best_count = n_count; in msa()
343 if (best_count >= gap_count) in msa()
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ]
65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ]
80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6
97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
/dports/devel/llvm11/llvm-11.0.1.src/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ]
65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ]
80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6
97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ]
65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ]
80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6
97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
/dports/devel/llvm10/llvm-10.0.1.src/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ]
65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ]
80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6
97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ]
65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ]
80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6
97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
/dports/devel/llvm90/llvm-9.0.1.src/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ]
65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ]
80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6
97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ]
65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ]
80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6
97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ]
65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ]
80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6
97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ]
65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ]
80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6
97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ]
65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ]
80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6
97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ]
65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ]
80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6
97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
/dports/devel/llvm80/llvm-8.0.1.src/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ]
65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ]
80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6
97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
/dports/graphics/llvm-mesa/llvm-13.0.1.src/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ]
65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ]
80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6
97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
/dports/devel/llvm70/llvm-7.0.1.src/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ]
65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ]
80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6
97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/test/Transforms/StructurizeCFG/
H A Dpost-order-traversal-bug.ll23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ]
65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ]
80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6
97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
/dports/archivers/advancecomp/advancecomp-2.1-6-g7b08f7a/
H A Dscroll.cc178 unsigned best_count; in compare() local
184 best_count = compare_shift(0, 0, width, height, p0, p1, pixel, line); in compare()
196 if (count > best_count) { in compare()
197 prev_count = best_count; in compare()
198 best_count = count; in compare()
209 if (best_count < total / 4) { in compare()
/dports/lang/gnatdroid-binutils-x86/binutils-2.27/bfd/
H A Dformat.c212 int match_count, best_count, best_match; in bfd_check_format_matches() local
277 best_count = 0; in bfd_check_format_matches()
345 best_count = 0; in bfd_check_format_matches()
347 best_count++; in bfd_check_format_matches()
368 if (best_count == 1) in bfd_check_format_matches()
418 if (matching_vector && match_count > 1 && best_count != match_count) in bfd_check_format_matches()
/dports/lang/gnatdroid-binutils/binutils-2.27/bfd/
H A Dformat.c212 int match_count, best_count, best_match; in bfd_check_format_matches() local
277 best_count = 0; in bfd_check_format_matches()
345 best_count = 0; in bfd_check_format_matches()
347 best_count++; in bfd_check_format_matches()
368 if (best_count == 1) in bfd_check_format_matches()
418 if (matching_vector && match_count > 1 && best_count != match_count) in bfd_check_format_matches()
/dports/lang/sdcc/sdcc-4.0.0/support/sdbinutils/bfd/
H A Dformat.c215 int match_count, best_count, best_match; in bfd_check_format_matches() local
280 best_count = 0; in bfd_check_format_matches()
348 best_count = 0; in bfd_check_format_matches()
350 best_count++; in bfd_check_format_matches()
371 if (best_count == 1) in bfd_check_format_matches()
421 if (matching_vector && match_count > 1 && best_count != match_count) in bfd_check_format_matches()
/dports/graphics/tesseract/tesseract-5.0.0/src/textord/
H A Dpithsync.cpp323 int16_t best_count; // no of cuts in check_pitch_sync2() local
415 best_count = INT16_MAX; in check_pitch_sync2()
422 best_count + best_fake) { in check_pitch_sync2()
430 best_count = cutpts[x - array_origin].index(); in check_pitch_sync2()
465 mean_sum = mean_sum * mean_sum / best_count; in check_pitch_sync2()
468 seg_it.data()->sum(), best_count); in check_pitch_sync2()
516 int16_t best_count; // no of cuts in check_pitch_sync3() local
633 best_count = INT16_MAX; in check_pitch_sync3()
640 best_count + best_fake) { in check_pitch_sync3()
684 mean_sum = mean_sum * mean_sum / best_count; in check_pitch_sync3()
[all …]

123456