| /frameworks/base/graphics/java/android/graphics/ |
| Insets.java | 31 public final int left; field in class:Insets
36 private Insets(int left, int top, int right, int bottom) {
37 this.left = left;
48 * @param left the left inset
55 public static Insets of(int left, int top, int right, int bottom) {
56 if (left == 0 && top == 0 && right == 0 && bottom == 0) {
59 return new Insets(left, top, right, bottom);
70 return (r == null) ? NONE : of(r.left, r.top, r.right, r.bottom)
[all...] |
| Rect.java | 29 * represented by the coordinates of its 4 edges (left, top, right bottom).
32 * the coordinates are sorted correctly (i.e. left <= right and top <= bottom).
36 * into the column and row described by its left and top coordinates, but not
40 public int left; field in class:Rect
67 * checking is performed, so the caller must ensure that left <= right and
70 * @param left The X coordinate of the left side of the rectangle
75 public Rect(int left, int top, int right, int bottom) {
76 this.left = left;
[all...] |
| /frameworks/base/core/java/android/hardware/camera2/params/ |
| ReprocessFormatsMap.java | 77 int left = entry.length; local
81 left--;
84 if (left < 1) {
90 left--;
99 if (left < length) {
103 "expected: %d)", inputFormat, left, length));
107 left -= length;
132 int left = mEntry.length; local
136 left--;
139 if (left < 1)
180 int left = mEntry.length; local
[all...] |
| /device/asus/fugu/dumpstate/ |
| dumpstate.cpp | 56 int left = 0; local
59 int ret = read(fd, &buffer[left], sizeof(buffer) - left);
63 left += ret;
65 while (left > 2) {
67 left -= 3;
75 if (left) {
76 memmove(buffer, &buffer[ofs], left);
81 if (!left) {
87 count = left;
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/ui/ |
| SelectionRenderer.java | 24 public static void drawSelection(Canvas canvas, int left, int top, int right, int bottom,
26 canvas.drawRect(left, top, right, top + stroke, paint);
27 canvas.drawRect(left, bottom - stroke, right, bottom, paint);
28 canvas.drawRect(left, top, left + stroke, bottom, paint);
32 public static void drawSelection(Canvas canvas, int left, int top, int right, int bottom,
34 canvas.drawRect(left, top, right, top + stroke, selectPaint);
35 canvas.drawRect(left, bottom - stroke, right, bottom, selectPaint);
36 canvas.drawRect(left, top, left + stroke, bottom, selectPaint)
[all...] |
| /frameworks/base/libs/hwui/ |
| Rect.h | 34 (r).left, (r).top, (r).right, (r).bottom
36 (r).left(), (r).top(), (r).right(), (r).bottom()
44 float left; member in class:android::uirenderer::Rect
56 left(0),
62 inline Rect(float left, float top, float right, float bottom):
63 left(left),
70 left(0.0f),
77 left(rect.fLeft),
84 left(rect.fLeft)
[all...] |
| /external/chromium-trace/catapult/third_party/coverage/coverage/htmlfiles/ |
| jquery.isonscreen.js | 17 left: $(window).scrollLeft(),
24 if( box.left+box.width-container.left > 0 &&
25 box.left < container.width+container.left &&
39 left: $(window).scrollLeft(),
46 if( $(this).offset().left+$(this).width()-container.left > 0 &&
47 $(this).offset().left < container.width+container.left &
[all...] |
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/mp4/objectdescriptors/ |
| BitReaderBuffer.java | 19 int left = 8 - position % 8;
21 if (i <= left) {
22 rc = (v << (position % 8) & 0xFF) >> ((position % 8) + (left - i));
25 int now = left;
26 int then = i - left;
40 int left = 8 - position % 8;
41 if (left == 8) {
42 left = 0;
44 readBits(left);
45 return left;
[all...] |
| /libcore/luni/src/main/native/ |
| canonicalize_path.cpp | 60 // Iterate over path components in 'left'.
62 std::string left(path + 1);
63 while (!left.empty()) {
65 size_t nextSlash = left.find('/');
66 std::string nextPathComponent = left.substr(0, nextSlash);
68 left.erase(0, nextSlash + 1);
70 left.clear();
111 if (!left.empty()) {
113 left = symlink + maybeSlash + left;
[all...] |
| /external/clang/test/CodeGenCXX/ |
| microsoft-abi-multiple-nonvirtual-inheritance.cpp | 3 struct Left {
4 virtual void left();
11 struct ChildNoOverride : Left, Right {
14 struct ChildOverride : Left, Right {
15 virtual void left();
25 child->left();
26 // Only need to cast 'this' to Left*.
27 // CHECK: %[[LEFT:.*]] = bitcast %struct.ChildNoOverride* %[[CHILD]] to %struct.Left*
28 // CHECK: %[[VFPTR:.*]] = bitcast %struct.Left* %[[LEFT]] to void (%struct.Left*)**
36 void ChildOverride::left() { function in class:ChildOverride
[all...] |
| /external/javassist/src/main/javassist/compiler/ast/ |
| Pair.java | 25 protected ASTree left, right; field in class:Pair
28 left = _left;
37 sbuf.append(left == null ? "<null>" : left.toString());
44 public ASTree getLeft() { return left; }
48 public void setLeft(ASTree _left) { left = _left; }
|
| /frameworks/base/core/java/android/animation/ |
| RectEvaluator.java | 59 * (left, top, right, and bottom).
73 int left = startValue.left + (int) ((endValue.left - startValue.left) * fraction); local
78 return new Rect(left, top, right, bottom);
80 mRect.set(left, top, right, bottom);
|
| /frameworks/base/services/core/java/com/android/server/notification/ |
| NotificationComparator.java | 27 public int compare(NotificationRecord left, NotificationRecord right) {
28 final int leftImportance = left.getImportance();
36 final int leftPackagePriority = left.getPackagePriority();
43 final int leftPriority = left.sbn.getNotification().priority;
50 final float leftPeople = left.getContactAffinity();
58 return -1 * Long.compare(left.getRankingTimeMs(), right.getRankingTimeMs());
|
| /frameworks/support/transition/ics/android/support/transition/ |
| RectEvaluator.java | 61 * (left, top, right, and bottom).
75 int left = startValue.left + (int) ((endValue.left - startValue.left) * fraction); local
80 return new Rect(left, top, right, bottom);
82 mRect.set(left, top, right, bottom);
|
| /frameworks/base/packages/DocumentsUI/src/com/android/documentsui/dirlist/ |
| Model.java | 228 int left = 0; local
231 while (left < right) {
232 int mid = (left + right) >>> 1;
250 left = mid + 1;
254 int n = start - left;
257 positions[left + 2] = positions[left + 1];
258 sortKey[left + 2] = sortKey[left + 1];
259 isDirs[left + 2] = isDirs[left + 1]
301 int left = 0; local
[all...] |
| /art/test/550-checker-multiply-accumulate/src/ |
| Main.java | 40 /// CHECK: <<Left:i\d+>> ParameterValue
42 /// CHECK: <<Mul:i\d+>> Mul [<<Left>>,<<Right>>]
48 /// CHECK: <<Left:i\d+>> ParameterValue
50 /// CHECK: <<MulAdd:i\d+>> MultiplyAccumulate [<<Acc>>,<<Left>>,<<Right>>] kind:Add
62 /// CHECK: <<Left:i\d+>> ParameterValue
64 /// CHECK: <<Mul:i\d+>> Mul [<<Left>>,<<Right>>]
70 /// CHECK: <<Left:i\d+>> ParameterValue
72 /// CHECK: <<MulAdd:i\d+>> MultiplyAccumulate [<<Acc>>,<<Left>>,<<Right>>] kind:Add
82 public static int $opt$noinline$mulAdd(int acc, int left, int right) {
84 return acc + left * right
[all...] |
| /device/google/accessory/demokit/app/src/com/google/android/DemoKit/ |
| Utilities.java | 9 int left = x - w / 2; local
11 int right = left + w;
13 d.setBounds(left, top, right, bottom);
|
| /art/tools/ahat/src/ |
| style.css | 26 padding-left: 4px;
31 padding-left: 8px;
|
| /bionic/libc/upstream-openbsd/lib/libc/stdlib/ |
| tsearch.c | 20 struct node_t *left, *right; member in struct:node_t
40 &(*rootp)->left : /* T3: follow left branch */
47 q->left = q->right = (struct node_t *)0;
69 &(*rootp)->left : /* follow left branch */
75 if ((q = (*rootp)->left) == (struct node_t *)0) /* Left (struct node_t *)0? */
78 if (r->left == (struct node_t *)0) { /* D2: Find successor */
79 r->left = q
[all...] |
| /external/libbrillo/brillo/ |
| unittest_utils.h | 34 // The left and right sockets are bi-directional connected and
35 // indistinguishable file descriptor. We named them left/right for easier
37 int left{-1};
|
| /external/libunwind/scripts/ |
| kernel-diff.sh | 6 left=$(eval echo $l)
8 # echo $left $right
9 diff -up $left $right
|
| /external/skia/tests/ |
| CanvasStateHelpers.h | 22 void complex_layers_draw(SkCanvas* canvas, float left, float top,
32 float left, float top, float right, float bottom, int32_t spacer);
38 void complex_clips_draw(SkCanvas* canvas, int32_t left, int32_t top,
48 int32_t left, int32_t top, int32_t right, int32_t bottom, int32_t clipOp,
|
| /frameworks/native/libs/ui/ |
| Rect.cpp | 34 left = 0;
44 if (left < rhs.left) {
46 } else if (left == rhs.left) {
60 right -= left - x;
62 left = x;
68 left += x;
76 const Rect result(left + rhs.x, top + rhs.y, right + rhs.x, bottom + rhs.y);
81 const Rect result(left - rhs.x, top - rhs.y, right - rhs.x, bottom - rhs.y)
104 int left = height - result.bottom; local
[all...] |
| /external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/ |
| ShadowRect.java | 14 public void __constructor__(int left, int top, int right, int bottom) {
15 realRect.left = left;
22 realRect.left = otherRect.left;
30 set(rect.left, rect.top, rect.right, rect.bottom);
34 public void set(int left, int top, int right, int bottom) {
35 realRect.left = left;
43 return realRect.right - realRect.left;
[all...] |
| /external/clang/test/Modules/ |
| diamond-pch.c | 12 left(&f);
24 lr.left = 17;
|
