Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:min_length (Results 1 - 25 of 63) sorted by null

1 2 3

/art/test/660-checker-simd-sad-char/src/
Main.java	27 int min_length = Math.min(s1.length, s2.length); local 29 for (int i = 0; i < min_length; i++) { 36 int min_length = Math.min(s1.length, s2.length); local 38 for (int i = 0; i < min_length; i++) { 47 int min_length = Math.min(s1.length, s2.length); local 49 for (int i = 0; i < min_length; i++) { 74 int min_length = Math.min(s1.length, s2.length); local 76 for (int i = 0; i < min_length; i++) { 97 int min_length = Math.min(s1.length, s2.length); local 99 for (int i = 0; i < min_length; i++) 122 int min_length = Math.min(s1.length, s2.length); local 152 int min_length = Math.min(s1.length, s2.length); local 180 int min_length = Math.min(s1.length, s2.length); local     [all...]
/external/brotli/c/enc/
static_dict.h	32 const uint8_t* data, size_t min_length, size_t max_length,
/external/bsdiff/include/bsdiff/
bsdiff.h	37 // The |min_length| parameter determines the required minimum length of a match 50 size_t min_length,
/art/test/660-checker-simd-sad-byte/src/
Main.java	25 int min_length = Math.min(b1.length, b2.length); local 27 for (int i = 0; i < min_length; i++) { 34 int min_length = Math.min(b1.length, b2.length); local 36 for (int i = 0; i < min_length; i++) { 45 int min_length = Math.min(b1.length, b2.length); local 47 for (int i = 0; i < min_length; i++) { 58 int min_length = Math.min(b1.length, b2.length); local 60 for (int i = 0; i < min_length; i++) { 67 int min_length = Math.min(b1.length, b2.length); local 69 for (int i = 0; i < min_length; i++) 78 int min_length = Math.min(b1.length, b2.length); local 113 int min_length = Math.min(b1.length, b2.length); local 144 int min_length = Math.min(b1.length, b2.length); local 177 int min_length = Math.min(b1.length, b2.length); local 216 int min_length = Math.min(b1.length, b2.length); local 253 int min_length = Math.min(b1.length, b2.length); local     [all...]
/art/runtime/arch/
memcmp16_test.cc	49 static void CheckSeparate(size_t max_length, size_t min_length) { 63 count1 = (r.next() % max_length) + min_length; 64 count2 = (r.next() % max_length) + min_length; 68 count1 = (r.next() % max_length) + min_length; 74 count2 = (r.next() % max_length) + min_length;
/art/test/660-checker-simd-sad-short/src/
Main.java	25 int min_length = Math.min(s1.length, s2.length); local 27 for (int i = 0; i < min_length; i++) { 34 int min_length = Math.min(s1.length, s2.length); local 36 for (int i = 0; i < min_length; i++) { 45 int min_length = Math.min(s1.length, s2.length); local 47 for (int i = 0; i < min_length; i++) { 80 int min_length = Math.min(s1.length, s2.length); local 82 for (int i = 0; i < min_length; i++) { 111 int min_length = Math.min(s1.length, s2.length); local 113 for (int i = 0; i < min_length; i++) 144 int min_length = Math.min(s1.length, s2.length); local 183 int min_length = Math.min(s1.length, s2.length); local 220 int min_length = Math.min(s1.length, s2.length); local     [all...]
/art/test/660-checker-simd-sad-int/src/
Main.java	43 int min_length = Math.min(x.length, y.length); local 45 for (int i = 0; i < min_length; i++) { 69 int min_length = Math.min(x.length, y.length); local 71 for (int i = 0; i < min_length; i++) { 100 int min_length = Math.min(x.length, y.length); local 102 for (int i = 0; i < min_length; i++) { 139 int min_length = Math.min(x.length, y.length); local 141 for (int i = 0; i < min_length; i++) { 176 int min_length = Math.min(x.length, y.length); local 178 for (int i = 0; i < min_length; i++)     [all...]
/art/test/646-checker-hadd-short/src/
Main.java	45 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 46 for (int i = 0; i < min_length; i++) { 71 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 72 for (int i = 0; i < min_length; i++) { 107 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 108 for (int i = 0; i < min_length; i++) { 130 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 131 for (int i = 0; i < min_length; i++) { 153 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 154 for (int i = 0; i < min_length; i++) 180 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 218 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 255 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 279 int min_length = Math.min(bo.length, b1.length); local 313 int min_length = Math.min(bo.length, b1.length); local     [all...]
/external/brotli/research/
find_opt_references.cc	27 "for small values of min_length."); 28 DEFINE_int32(min_length, 1, "Minimal length of found backward references."); 132 int min_length = FLAGS_min_length; local 156 if ((left_ix >= 0 && left_lcp >= min_length) || 157 (right_ix < size - 1 && right_lcp >= min_length)) {
/art/test/660-checker-simd-sad-long/src/
Main.java	47 int min_length = Math.min(x.length, y.length); local 49 for (int i = 0; i < min_length; i++) { 74 int min_length = Math.min(x.length, y.length); local 76 for (int i = 0; i < min_length; i++) { 109 int min_length = Math.min(x.length, y.length); local 111 for (int i = 0; i < min_length; i++) { 146 int min_length = Math.min(x.length, y.length); local 148 for (int i = 0; i < min_length; i++) {
/external/autotest/client/site_tests/cellular_Identifiers/
cellular_Identifiers.py	31 min_length, max_length): 39 if (len(device_value) < min_length or len(device_value) > max_length):
/art/test/660-checker-simd-sad-short2/src/
Main.java	27 int min_length = Math.min(s1.length, s2.length); local 29 for (int i = 0; i < min_length; i++) { 36 int min_length = Math.min(s1.length, s2.length); local 38 for (int i = 0; i < min_length; i++) { 47 int min_length = Math.min(s1.length, s2.length); local 49 for (int i = 0; i < min_length; i++) { 98 int min_length = Math.min(s1.length, s2.length); local 100 for (int i = 0; i < min_length; i++) { 148 int min_length = Math.min(s1.length, s2.length); local 150 for (int i = 0; i < min_length; i++) 200 int min_length = Math.min(s1.length, s2.length); local 258 int min_length = Math.min(s1.length, s2.length); local 314 int min_length = Math.min(s1.length, s2.length); local     [all...]
/external/bsdiff/
bsdiff_arguments.h	36 int min_length() const { return min_length_; } function in class:bsdiff::BsdiffArguments
bsdiff_arguments_unittest.cc	92 EXPECT_EQ(12, arguments.min_length());
bsdiff.cc	65 size_t newsize, size_t min_length, PatchWriterInterface* patch, 123 (len>oldscore+8 && len>=min_length)) break;
/art/test/646-checker-hadd-alt-byte/src/
Main.java	48 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 49 for (int i = 0; i < min_length; i++) { 83 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 84 for (int i = 0; i < min_length; i++) { 106 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 107 for (int i = 0; i < min_length; i++) { 143 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 144 for (int i = 0; i < min_length; i++) { 166 int min_length = Math.min(bo.length, b1.length); local 167 for (int i = 0; i < min_length; i++) 200 int min_length = Math.min(bo.length, b1.length); local     [all...]
/art/test/646-checker-hadd-alt-char/src/
Main.java	48 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 49 for (int i = 0; i < min_length; i++) { 87 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 88 for (int i = 0; i < min_length; i++) { 110 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 111 for (int i = 0; i < min_length; i++) { 150 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 151 for (int i = 0; i < min_length; i++) { 173 int min_length = Math.min(bo.length, b1.length); local 174 for (int i = 0; i < min_length; i++) 210 int min_length = Math.min(bo.length, b1.length); local     [all...]
/art/test/646-checker-hadd-alt-short/src/
Main.java	48 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 49 for (int i = 0; i < min_length; i++) { 83 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 84 for (int i = 0; i < min_length; i++) { 106 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 107 for (int i = 0; i < min_length; i++) { 143 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 144 for (int i = 0; i < min_length; i++) { 166 int min_length = Math.min(bo.length, b1.length); local 167 for (int i = 0; i < min_length; i++) 200 int min_length = Math.min(bo.length, b1.length); local     [all...]
/art/test/646-checker-hadd-byte/src/
Main.java	45 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 46 for (int i = 0; i < min_length; i++) { 80 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 81 for (int i = 0; i < min_length; i++) { 103 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 104 for (int i = 0; i < min_length; i++) { 140 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 141 for (int i = 0; i < min_length; i++) { 163 int min_length = Math.min(bo.length, b1.length); local 164 for (int i = 0; i < min_length; i++) 197 int min_length = Math.min(bo.length, b1.length); local     [all...]
/art/test/646-checker-hadd-char/src/
Main.java	57 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 58 for (int i = 0; i < min_length; i++) { 107 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 108 for (int i = 0; i < min_length; i++) { 142 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 143 for (int i = 0; i < min_length; i++) { 194 int min_length = Math.min(bo.length, Math.min(b1.length, b2.length)); local 195 for (int i = 0; i < min_length; i++) { 229 int min_length = Math.min(bo.length, b1.length); local 230 for (int i = 0; i < min_length; i++) 280 int min_length = Math.min(bo.length, b1.length); local     [all...]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Demo/classes/
bitvec.py	182 min_length = min(length, other._len) 183 return cmp(self[:min_length], other[:min_length]) or \ 184 cmp(self[min_length:], other[min_length:])
/external/python/cpython2/Demo/classes/
bitvec.py	182 min_length = min(length, other._len) 183 return cmp(self[:min_length], other[:min_length]) or \ 184 cmp(self[min_length:], other[min_length:])
/external/tensorflow/tensorflow/core/lib/io/
table_builder.cc	35 size_t min_length = std::min(start->size(), limit.size()); local 37 while ((diff_index < min_length) && 42 if (diff_index >= min_length) {
block_builder.cc	92 const size_t min_length = std::min(last_key_piece.size(), key.size()); local 93 while ((shared < min_length) && (last_key_piece[shared] == key[shared])) {
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
GCWrapper.java	528 private static final int MIN_LENGTH = 10; 545 if (x1 == x2 && Math.abs(y1 - y2) < MIN_LENGTH) { 546 int delta = (MIN_LENGTH - Math.abs(y1 - y2)) / 2; 555 } else if (y1 == y2 && Math.abs(x1 - x2) < MIN_LENGTH) { 556 int delta = (MIN_LENGTH - Math.abs(x1 - x2)) / 2;

Completed in 862 milliseconds

1 2 3