HomeSort by relevance Sort by last modified time
    Searched full:right (Results 101 - 125 of 21084) sorted by null

1 2 3 45 6 7 8 91011>>

  /frameworks/native/libs/ui/
Rect.cpp 36 right = -1;
50 if (right < rhs.right) {
60 right -= left - x;
70 right += 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);
88 result->right = min(right, with.right);
106 int right = height - result.top; local
    [all...]
  /frameworks/native/services/surfaceflinger/DisplayHardware/
FloatRect.h 30 float right; member in class:android::FloatRect
34 : left(0), top(0), right(0), bottom(0) { }
36 : left(other.left), top(other.top), right(other.right), bottom(other.bottom) { }
38 inline float getWidth() const { return right - left; }
  /packages/services/Car/car-cluster-demo-renderer/res/values/
strings.xml 22 <string name="turn_slight_right">Slight right</string>
24 <string name="turn_right">Turn right</string>
26 <string name="turn_sharp_right">Sharp right turn</string>
28 <string name="turn_u_turn_right">Make right u-turn</string>
30 <string name="turn_on_ramp_right">Turn right on ramp</string>
  /external/icu/icu4c/source/common/
uarrsort.c 38 uprv_uint16Comparator(const void *context, const void *left, const void *right) {
39 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right;
43 uprv_int32Comparator(const void *context, const void *left, const void *right) {
44 return *(const int32_t *)left - *(const int32_t *)right;
48 uprv_uint32Comparator(const void *context, const void *left, const void *right) {
49 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right;
171 int32_t left, right; local
173 /* start and left are inclusive, limit and right are exclusive */
181 right=limit;
192 while(/* x<array[right-1] *
    [all...]
  /external/skia/src/core/
SkTSort.h 121 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) {
122 for (T* next = left + 1; next <= right; ++next) {
136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) {
138 SkTSwap(*pivot, *right);
140 while (left < right) {
147 SkTSwap(*newPivot, *right);
154 * This implementation recurses on the left region after pivoting and loops on the right,
160 * @param right the end of the region to be sorted (inclusive).
163 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) {
165 if (right - left < 32)
    [all...]
  /prebuilts/gdb/darwin-x86/lib/python2.7/encodings/
mac_farsi.py 80 u' ' # 0x20 -> SPACE, left-right
81 u'!' # 0x21 -> EXCLAMATION MARK, left-right
82 u'"' # 0x22 -> QUOTATION MARK, left-right
83 u'#' # 0x23 -> NUMBER SIGN, left-right
84 u'$' # 0x24 -> DOLLAR SIGN, left-right
85 u'%' # 0x25 -> PERCENT SIGN, left-right
86 u'&' # 0x26 -> AMPERSAND, left-right
87 u"'" # 0x27 -> APOSTROPHE, left-right
88 u'(' # 0x28 -> LEFT PARENTHESIS, left-right
89 u')' # 0x29 -> RIGHT PARENTHESIS, left-righ
    [all...]
  /prebuilts/gdb/linux-x86/lib/python2.7/encodings/
mac_farsi.py 80 u' ' # 0x20 -> SPACE, left-right
81 u'!' # 0x21 -> EXCLAMATION MARK, left-right
82 u'"' # 0x22 -> QUOTATION MARK, left-right
83 u'#' # 0x23 -> NUMBER SIGN, left-right
84 u'$' # 0x24 -> DOLLAR SIGN, left-right
85 u'%' # 0x25 -> PERCENT SIGN, left-right
86 u'&' # 0x26 -> AMPERSAND, left-right
87 u"'" # 0x27 -> APOSTROPHE, left-right
88 u'(' # 0x28 -> LEFT PARENTHESIS, left-right
89 u')' # 0x29 -> RIGHT PARENTHESIS, left-righ
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/encodings/
mac_farsi.py 80 u' ' # 0x20 -> SPACE, left-right
81 u'!' # 0x21 -> EXCLAMATION MARK, left-right
82 u'"' # 0x22 -> QUOTATION MARK, left-right
83 u'#' # 0x23 -> NUMBER SIGN, left-right
84 u'$' # 0x24 -> DOLLAR SIGN, left-right
85 u'%' # 0x25 -> PERCENT SIGN, left-right
86 u'&' # 0x26 -> AMPERSAND, left-right
87 u"'" # 0x27 -> APOSTROPHE, left-right
88 u'(' # 0x28 -> LEFT PARENTHESIS, left-right
89 u')' # 0x29 -> RIGHT PARENTHESIS, left-righ
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/encodings/
mac_farsi.py 80 u' ' # 0x20 -> SPACE, left-right
81 u'!' # 0x21 -> EXCLAMATION MARK, left-right
82 u'"' # 0x22 -> QUOTATION MARK, left-right
83 u'#' # 0x23 -> NUMBER SIGN, left-right
84 u'$' # 0x24 -> DOLLAR SIGN, left-right
85 u'%' # 0x25 -> PERCENT SIGN, left-right
86 u'&' # 0x26 -> AMPERSAND, left-right
87 u"'" # 0x27 -> APOSTROPHE, left-right
88 u'(' # 0x28 -> LEFT PARENTHESIS, left-right
89 u')' # 0x29 -> RIGHT PARENTHESIS, left-righ
    [all...]
  /external/clang/test/CodeGenCXX/
microsoft-abi-multiple-nonvirtual-inheritance.cpp 7 struct Right {
8 virtual void right();
11 struct ChildNoOverride : Left, Right {
14 struct ChildOverride : Left, Right {
16 virtual void right();
68 child->right();
69 // When calling a right base's virtual method, one needs to adjust 'this' at
74 // CHECK: %[[RIGHT:.*]] = bitcast i8* %[[RIGHT_i8]] to %struct.Right*
76 // CHECK: %[[VFPTR:.*]] = bitcast %struct.Right* %[[RIGHT]] to void (%struct.Right*)**
84 void ChildOverride::right() { function in class:ChildOverride
129 void GrandchildOverride::right() { function in class:GrandchildOverride
    [all...]
microsoft-abi-methods.cpp 20 // Make sure that the call uses the right calling convention:
24 // Make sure that the definition uses the right calling convention:
32 // Make sure that the call uses the right calling convention:
36 // Make sure that the definition uses the right calling convention:
44 // Make sure that the call uses the right calling convention:
48 // Make sure that the definition uses the right calling convention:
54 // Make sure that the call uses the right calling convention:
58 // Make sure that the definition uses the right calling convention:
73 // the right calling convention:
78 // Make sure that the Base constructor definition uses the right CC
    [all...]
  /cts/tests/tests/graphics/src/android/graphics/cts/
RectFTest.java 62 assertEquals(5.0f, mRectF.right);
68 assertEquals(10.0f, mRectF.right);
79 assertEquals(3.0f, mRectF.right);
91 assertEquals(3.0f, mRectF.right);
103 assertEquals(3.0f, mRectF.right);
114 assertEquals(10.0f, mRectF.right);
121 assertEquals(10.0f, mRectF.right);
147 assertEquals(10.0f, mRectF.right);
154 assertEquals(10.0f, mRectF.right);
168 assertEquals(10.0f, mRectF.right);
    [all...]
RegionIteratorTest.java 44 assertEquals(10, rect.right);
50 assertEquals(1, rect.right);
61 assertEquals(10, rect.right);
66 assertEquals(15, rect.right);
71 assertEquals(15, rect.right);
77 assertEquals(1, rect.right);
88 assertEquals(10, rect.right);
93 assertEquals(5, rect.right);
99 assertEquals(1, rect.right);
110 assertEquals(10, rect.right);
    [all...]
  /frameworks/support/v7/gridlayout/tests/src/android/support/v7/widget/
GridLayoutTest.java 71 int right = mRightView.getWidth(); local
74 assertTrue("right item should get some width", right > 0);
76 assertTrue("left view should be almost two times right view " + left + " vs " + right,
77 Math.abs(right * 2 - left) < 2);
84 int right = mRightView.getWidth(); local
87 assertTrue("right item should get some width", right > 0);
89 assertTrue("left view should be almost two times right view " + left + " vs " + right
97 int right = mRightView.getWidth(); local
122 int right = mRightView.getHeight(); local
    [all...]
  /packages/apps/Settings/src/com/android/settings/applications/
LinearColorBar.java 194 int right = left + (int)(width*mRedRatio); local
195 int right2 = right + (int)(width*mYellowRatio);
203 indicatorLeft = right;
242 if (left < right) {
244 mRect.right = right;
247 width -= (right-left);
248 left = right;
251 mLastLeftDiv = right;
254 right = right2
    [all...]
  /prebuilts/go/darwin-x86/doc/codewalk/
codewalk.css 35 #comment-column.right {
36 float: right;
53 margin-right: 10px; /* yes, for both .left and .right */
60 .right .comment {
64 .right .comment.first {
67 .right .comment.last {
80 .right .comment.selected {
86 border-right-width: 12px;
87 margin-right: 0px
    [all...]
  /prebuilts/go/linux-x86/doc/codewalk/
codewalk.css 35 #comment-column.right {
36 float: right;
53 margin-right: 10px; /* yes, for both .left and .right */
60 .right .comment {
64 .right .comment.first {
67 .right .comment.last {
80 .right .comment.selected {
86 border-right-width: 12px;
87 margin-right: 0px
    [all...]
  /art/tools/ahat/src/
style.css 22 * Most of the columns show numbers of bytes. Numbers should be right aligned.
27 padding-right: 4px;
32 padding-right: 8px;
  /external/chromium-trace/catapult/third_party/polymer/components/web-animations-js/src/
visibility-handler.js 17 function merge(left, right) {
18 if (left != 'visible' && right != 'visible') return;
21 if (x >= 1) return right;
  /external/llvm/test/CodeGen/WinEH/
wineh-no-demotion.ll 28 cleanupret from %0 unwind label %right
30 right:
67 cleanupret from %0 unwind label %right
69 right:
102 to label %exit unwind label %right
108 right:
110 br i1 %x, label %shared, label %right.other
112 right.other:
116 %phi = phi i32 [ 1, %left ], [ 0, %right ], [ -1, %right.other
    [all...]
  /external/llvm/test/Transforms/CorrelatedValuePropagation/
2010-09-02-Trunc.ll 7 br i1 %c, label %left, label %right
9 right:
20 %f = phi i1 [%b, %left], [%d, %right]
  /external/opencv3/doc/
mymath.js 6 matTT: [ "\\[ \\left|\\begin{array}{ccc} #1 & #2 & #3\\\\ #4 & #5 & #6\\\\ #7 & #8 & #9 \\end{array}\\right| \\]", 9],
7 fork: ["\\left\\{ \\begin{array}{l l} #1 & \\mbox{#2}\\\\ #3 & \\mbox{#4}\\\\ \\end{array} \\right.", 4],
8 forkthree: ["\\left\\{ \\begin{array}{l l} #1 & \\mbox{#2}\\\\ #3 & \\mbox{#4}\\\\ #5 & \\mbox{#6}\\\\ \\end{array} \\right.", 6],
  /external/v8/test/mjsunit/regress/
regress-416730.js 9 function Crash(left, right) {
11 x: right.x - left.x,
12 y: right.y - left.y
  /external/valgrind/helgrind/tests/
tc14_laog_dinphils.c 19 long right = (left + 1) % 5; local
22 pthread_mutex_lock(&chop[right].m);
25 pthread_mutex_unlock(&chop[right].m);
  /sdk/testapps/basicProjectWithAidl/src/com/android/tests/basicprojectwithaidl/
Rect.java 9 public int right; field in class:Rect
32 out.writeInt(right);
39 right = in.readInt();

Completed in 1619 milliseconds

1 2 3 45 6 7 8 91011>>