/external/chromium_org/tools/gyp/test/mac/type_envvars/ |
test_check_sdkroot.sh | 33 # Returns true if |string1| is smaller than |string2|. 36 function smaller() { function
|
/packages/apps/UnifiedEmail/src/org/apache/commons/io/filefilter/ |
SizeFileFilter.java | 23 * Filters files based on size, can filter either smaller files or 45 /** Whether the files accepted will be larger or smaller. */ 65 * otherwise smaller ones (but not equal to) 80 * If size equals threshold and smaller files are required, 89 boolean smaller = file.length() < size; 90 return acceptLarger ? !smaller : smaller;
|
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/objfmts/win64/tests/ |
sce4.asm | 4 [savexmm128 xmm7, 16*64*1024-16]; last smaller-sized 5 [savereg rsi, 8*64*1024-8] ; last smaller-sized 10 [allocstack 128] ; last smaller-sized
|
/external/chromium_org/chrome/browser/resources/chromeos/ |
keyboard_overlay_data.js | 92 'format': 'smaller', 385 'format': 'smaller' 388 'format': 'smaller' 392 'format': 'smaller', 396 'format': 'smaller', 424 'format': 'smaller', 701 'format': 'smaller' 704 'format': 'smaller' 708 'format': 'smaller', 712 'format': 'smaller', [all...] |
/external/chromium_org/courgette/ |
analyze_stress_test | 55 $(count_result "BEST_COURGETTE") patch(es) where courgette is smaller (bz2) 56 $(count_result "BEST_BSDIFF") patch(es) where bsdiff is smaller (xz) 58 $(count_result "XZBEST_COURGETTE") patch(es) where courgette (xz) is smaller 59 $(count_result "XZBEST_BSDIFF") patch(es) where bsdiff is smaller (xz)
|
run_stress_test | 172 $(count_result "BEST_COURGETTE") patch(es) where courgette (bz2) is smaller 173 $(count_result "BEST_BSDIFF") patch(es) where bsdiff is smaller (bz2) 175 $(count_result "XZBEST_COURGETTE") patch(es) where courgette (xz) is smaller 176 $(count_result "XZBEST_BSDIFF") patch(es) where bsdiff is smaller (xz)
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
QuadraticReduceOrder.cpp | 32 int smaller = reduction[1].y > reduction[0].y; local 33 int larger = smaller ^ 1; 36 if (reduction[smaller].y > yExtrema) { 37 reduction[smaller].y = yExtrema; 53 int smaller = reduction[1].x > reduction[0].x; local 54 int larger = smaller ^ 1; 57 if (reduction[smaller].x > xExtrema) { 58 reduction[smaller].x = xExtrema; 107 // sameSide > 0 means mid is smaller than either [0] or [2], so replace smaller [all...] |
CubicReduceOrder.cpp | 34 int smaller = reduction[1].y > reduction[0].y; local 35 int larger = smaller ^ 1; 39 if (reduction[smaller].y > yExtrema) { 40 reduction[smaller].y = yExtrema; 57 int smaller = reduction[1].x > reduction[0].x; local 58 int larger = smaller ^ 1; 62 if (reduction[smaller].x > xExtrema) { 63 reduction[smaller].x = xExtrema; 138 // sameSide > 0 means mid is smaller than either [0] or [3], so replace smaller [all...] |
CubicConvexHull.cpp | 52 Cubic smaller, larger; local 54 sub_divide(cubic1, minT1, maxT1, intersections.swapped() ? larger : smaller); 55 sub_divide(cubic2, minT2, maxT2, intersections.swapped() ? smaller : larger); 57 if (reduceOrder(smaller, smallResult, kReduceOrder_NoQuadraticsAllowed, 83 if (!bezier_clip(smaller, larger, minT, maxT)) {
|
/external/skia/experimental/Intersection/ |
QuadraticReduceOrder.cpp | 32 int smaller = reduction[1].y > reduction[0].y; local 33 int larger = smaller ^ 1; 36 if (reduction[smaller].y > yExtrema) { 37 reduction[smaller].y = yExtrema; 53 int smaller = reduction[1].x > reduction[0].x; local 54 int larger = smaller ^ 1; 57 if (reduction[smaller].x > xExtrema) { 58 reduction[smaller].x = xExtrema; 107 // sameSide > 0 means mid is smaller than either [0] or [2], so replace smaller [all...] |
CubicReduceOrder.cpp | 34 int smaller = reduction[1].y > reduction[0].y; local 35 int larger = smaller ^ 1; 39 if (reduction[smaller].y > yExtrema) { 40 reduction[smaller].y = yExtrema; 57 int smaller = reduction[1].x > reduction[0].x; local 58 int larger = smaller ^ 1; 62 if (reduction[smaller].x > xExtrema) { 63 reduction[smaller].x = xExtrema; 138 // sameSide > 0 means mid is smaller than either [0] or [3], so replace smaller [all...] |
CubicConvexHull.cpp | 52 Cubic smaller, larger; local 54 sub_divide(cubic1, minT1, maxT1, intersections.swapped() ? larger : smaller); 55 sub_divide(cubic2, minT2, maxT2, intersections.swapped() ? smaller : larger); 57 if (reduceOrder(smaller, smallResult, kReduceOrder_NoQuadraticsAllowed, 83 if (!bezier_clip(smaller, larger, minT, maxT)) {
|
/external/guava/guava-tests/test/com/google/common/collect/ |
AbstractTableReadTest.java | 127 Table<String, Integer, Character> smaller local 136 .addEqualityGroup(smaller)
|
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/ |
backtracking.rb | 53 * Note that k=1 results in a much smaller predictor for the
|
/external/chromium_org/third_party/skia/experimental/webtry/poly/ |
Gruntfile.js | 32 // Uglify the one big file into one smaller file.
|
/external/skia/experimental/webtry/poly/ |
Gruntfile.js | 32 // Uglify the one big file into one smaller file.
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/ext/pb_ds/detail/thin_heap_/ |
insert_fn_imps.hpp | 274 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local 278 if (smaller)
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/thin_heap_/ |
insert_fn_imps.hpp | 238 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local 240 if (smaller)
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/thin_heap_/ |
insert_fn_imps.hpp | 238 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local 240 if (smaller)
|
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/thin_heap_/ |
insert_fn_imps.hpp | 274 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local 278 if (smaller)
|
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/thin_heap_/ |
insert_fn_imps.hpp | 274 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local 278 if (smaller)
|
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/thin_heap_/ |
insert_fn_imps.hpp | 274 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local 278 if (smaller)
|
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/thin_heap_/ |
insert_fn_imps.hpp | 274 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local 278 if (smaller)
|
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/thin_heap_/ |
insert_fn_imps.hpp | 274 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local 278 if (smaller)
|
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/thin_heap_/ |
insert_fn_imps.hpp | 238 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local 240 if (smaller)
|