/frameworks/base/media/java/android/media/videoeditor/ |
EffectKenBurns.java | 96 start.left = getStartRect().left; 100 end.left = getEndRect().left;
|
/hardware/qcom/display/msm8960/libtilerenderer/ |
tilerenderer.h | 32 void startTileRendering(OpenGLRenderer* renderer, int left, int top, int right, int bottom);
|
/hardware/qcom/display/msm8x26/libtilerenderer/ |
tilerenderer.h | 32 void startTileRendering(OpenGLRenderer* renderer, int left, int top, int right, int bottom);
|
/packages/apps/Settings/src/com/android/settings/applications/ |
LinearColorBar.java | 192 int left = 0; local 194 int right = left + (int)(width*mRedRatio); 242 if (left < right) { 243 mRect.left = left; 247 width -= (right-left); 248 left = right; 256 if (left < right) { 257 mRect.left = left; [all...] |
/packages/apps/UnifiedEmail/src/com/android/mail/utils/ |
RectUtils.java | 30 * The top-left of the transformed full rectangle will always be placed at (0, 0). 47 // Then translate so that the upper left corner of the rotated full rect is at (0,0). 49 matrix.setTranslate(-fullRectF.left, -fullRectF.top); 53 fullRect.set((int) fullRectF.left, (int) fullRectF.top, (int) fullRectF.right, 55 partialRect.set((int) partialRectF.left, (int) partialRectF.top, (int) partialRectF.right, 64 rect.set((int) rectF.left, (int) rectF.top, (int) rectF.right, (int) rectF.bottom);
|
/frameworks/base/tests/HwAccelerationTest/src/com/android/test/hwui/ |
ThinPatchesActivity.java | 78 final int left = (getWidth() - width) / 2; local 84 mPatch3.setBounds(left, top, left + height, top + width); 89 mPatch1.setBounds(left, top, left + width, top + height); 95 mPatch2.setBounds(left, top, left + width, top + height);
|
/external/chromium-trace/trace-viewer/src/cc/ |
picture_debugger.css | 18 picture-debugger > left-panel { 23 picture-debugger > left-panel > picture-info { 28 picture-debugger > left-panel > picture-info > .title { 30 margin-left: 5px; 40 margin-left: 5px;
|
/external/chromium_org/remoting/webapp/ |
menu_button.css | 14 left: 1px; 23 background-image: -webkit-gradient(linear, left top, left bottom, 32 margin-left: 7px; 65 background-position: left center;
|
/external/chromium_org/tools/deep_memory_profiler/visualizer/static/ |
index.css | 34 float: left; 40 float: left; 41 margin-left: 50px; 54 padding-left: 15px; 66 padding-left: 15px;
|
/external/chromium_org/ui/views/ |
border.cc | 20 SidedSolidBorder(int top, int left, int bottom, int right, SkColor color); 35 int left, 40 insets_(top, left, bottom, right) { 46 // Left border. 47 canvas->FillRect(gfx::Rect(0, 0, insets_.left(), view.height()), color_); 77 EmptyBorder(int top, int left, int bottom, int right) 78 : insets_(top, left, bottom, right) {} 141 Border* Border::CreateEmptyBorder(int top, int left, int bottom, int right) { 142 return new EmptyBorder(top, left, bottom, right); 147 int left, [all...] |
/external/qemu/distrib/zlib-1.2.3/ |
inftrees.c | 46 int left; /* number of prefix codes available */ local 131 left = 1; 133 left <<= 1; 134 left -= count[len]; 135 if (left < 0) return -1; /* over-subscribed */ 137 if (left > 0 && (type == CODES || max != 1)) 270 left = (int)(1 << curr); 272 left -= count[curr + drop]; 273 if (left <= 0) break; 275 left <<= 1 [all...] |
/external/zlib/src/contrib/infback9/ |
inftree9.c | 46 int left; /* number of prefix codes available */ local 125 left = 1; 127 left <<= 1; 128 left -= count[len]; 129 if (left < 0) return -1; /* over-subscribed */ 131 if (left > 0 && (type == CODES || max != 1)) 263 left = (int)(1 << curr); 265 left -= count[curr + drop]; 266 if (left <= 0) break; 268 left <<= 1 [all...] |
/external/zlib/src/ |
inftrees.c | 46 int left; /* number of prefix codes available */ local 131 left = 1; 133 left <<= 1; 134 left -= count[len]; 135 if (left < 0) return -1; /* over-subscribed */ 137 if (left > 0 && (type == CODES || max != 1)) 270 left = (int)(1 << curr); 272 left -= count[curr + drop]; 273 if (left <= 0) break; 275 left <<= 1 [all...] |
/libcore/luni/src/main/java/java/util/ |
DualPivotQuicksort.java | 97 * on {@code left} or {@code right}. 100 * @param left the index of the first element, inclusive, to be sorted 103 private static void doSort(int[] a, int left, int right) { 105 if (right - left + 1 < INSERTION_SORT_THRESHOLD) { 106 for (int i = left + 1; i <= right; i++) { 109 for (j = i - 1; j >= left && ai < a[j]; j--) { 115 dualPivotQuicksort(a, left, right); 124 * @param left the index of the first element, inclusive, to be sorted 127 private static void dualPivotQuicksort(int[] a, int left, int right) { 129 int sixth = (right - left + 1) / 6 [all...] |
/external/chromium_org/chrome/browser/resources/downloads/ |
downloads.css | 15 float: left; 25 float: left; 46 float: left; 80 left: -110px; 86 left: auto; 100 left: 9px; 107 left: auto; 121 background-position: left bottom; 135 left: 0; 142 left: auto [all...] |
/external/dropbear/libtomcrypt/src/misc/pkcs5/ |
pkcs_5_2.c | 38 unsigned long stored, left, x, y; local 66 left = *outlen; 69 while (left != 0) { 104 for (y = 0; y < x && left != 0; ++y) { 106 --left;
|
/external/guava/guava/src/com/google/common/collect/ |
BstNode.java | 19 import static com.google.common.collect.BstSide.LEFT; 46 * The key on which this binary search tree is ordered. All descendants of the left subtree of 52 * The left child of this node. A null value indicates that this node has no left child. 55 private final N left; field in class:BstNode 63 BstNode(@Nullable K key, @Nullable N left, @Nullable N right) { 65 this.left = left; 83 case LEFT: 84 return left; [all...] |
/external/qemu/distrib/sdl-1.2.15/src/video/bwindow/ |
SDL_BView.h | 65 bounds.top = bounds.left = 0; 89 dest.left = updateRect.left + xoff; 102 dest.left = updateRect.left + xoff;
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
DESEngine.java | 408 int work, right, left; local 410 left = (in[inOff + 0] & 0xff) << 24; 411 left |= (in[inOff + 1] & 0xff) << 16; 412 left |= (in[inOff + 2] & 0xff) << 8; 413 left |= (in[inOff + 3] & 0xff); 420 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; 422 left ^= (work << 4); 423 work = ((left >>> 16) ^ right) & 0x0000ffff; 425 left ^= (work << 16); 426 work = ((right >>> 2) ^ left) & 0x33333333 [all...] |
/external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/crypto/cipher/ |
DES.java | 285 int work, right, left; local 287 left = (in[inOff + 0] & 0xff) << 24; 288 left |= (in[inOff + 1] & 0xff) << 16; 289 left |= (in[inOff + 2] & 0xff) << 8; 290 left |= (in[inOff + 3] & 0xff); 297 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; 299 left ^= (work << 4); 300 work = ((left >>> 16) ^ right) & 0x0000ffff; 302 left ^= (work << 16); 303 work = ((right >>> 2) ^ left) & 0x33333333 [all...] |
/frameworks/base/libs/hwui/ |
OpenGLRenderer.h | 171 * @param left The left coordinate of the dirty rectangle 179 virtual status_t prepareDirty(float left, float top, float right, float bottom, bool opaque); 225 ANDROID_API int saveLayer(float left, float top, float right, float bottom, 229 return saveLayer(left, top, right, bottom, paint ? paint->getAlpha() : 255, mode, flags); 231 ANDROID_API int saveLayerAlpha(float left, float top, float right, float bottom, 233 return saveLayer(left, top, right, bottom, alpha, SkXfermode::kSrcOver_Mode, flags); 235 virtual int saveLayer(float left, float top, float right, float bottom, 238 int saveLayerDeferred(float left, float top, float right, float bottom, 257 bool quickRejectPreStroke(float left, float top, float right, float bottom, SkPaint* paint) [all...] |
/external/chromium_org/third_party/skia/src/core/ |
SkRect.cpp | 12 void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) { 14 if (left >= right || top >= bottom) { 20 this->set(left, top, right, bottom); 22 if (left < fLeft) fLeft = left; 133 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, 135 if (left < right && top < bottom && !this->isEmpty() && // check for empties 136 fLeft < right && left < fRight && fTop < bottom && top < fBottom) 138 if (fLeft < left) fLeft = left; [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
BstTesting.java | 18 import static com.google.common.collect.BstSide.LEFT; 39 SimpleNode(Character key, @Nullable SimpleNode left, @Nullable SimpleNode right) { 40 super(key, left, right); 53 && Objects.equal(childOrNull(LEFT), node.childOrNull(LEFT)) 61 return Objects.hashCode(getKey(), childOrNull(LEFT), childOrNull(RIGHT)); 68 SimpleNode source, @Nullable SimpleNode left, @Nullable SimpleNode right) { 69 return new SimpleNode(source.getKey(), left, right); 76 @Nullable SimpleNode left, @Nullable SimpleNode right) { 77 return checkNotNull(nodeFactory).createNode(source, left, right) [all...] |
/external/libvpx/mips-dspr2/ |
vp9_rtcd.h | 27 void vp9_d207_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 30 void vp9_d45_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 33 void vp9_d63_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 36 void vp9_h_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 37 void vp9_h_predictor_4x4_dspr2(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 40 void vp9_d117_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 43 void vp9_d135_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 46 void vp9_d153_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 49 void vp9_v_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 52 void vp9_tm_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); [all...] |
/external/skia/src/core/ |
SkRect.cpp | 12 void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) { 14 if (left >= right || top >= bottom) { 20 this->set(left, top, right, bottom); 22 if (left < fLeft) fLeft = left; 133 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, 135 if (left < right && top < bottom && !this->isEmpty() && // check for empties 136 fLeft < right && left < fRight && fTop < bottom && top < fBottom) 138 if (fLeft < left) fLeft = left; [all...] |