HomeSort by relevance Sort by last modified time
    Searched refs:right (Results 151 - 175 of 4228) sorted by null

1 2 3 4 5 67 8 91011>>

  /external/webrtc/webrtc/modules/video_render/mac/
video_render_mac_cocoa_impl.h 52 const float right,
61 float& right,
97 const float right,
104 const float right,
116 const float right,
124 const float right,
  /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/
ver4_patricia_trie_writing_helper.h 111 bool operator()(const DictProbability &left, const DictProbability &right) {
112 if (left.getProbability() != right.getProbability()) {
113 return left.getProbability() > right.getProbability();
115 if (left.getTimestamp() != right.getTimestamp()) {
116 return left.getTimestamp() < right.getTimestamp();
118 return left.getDictPos() > right.getDictPos();
  /external/avahi/avahi-core/
prioq.c 67 n = n->right;
100 a->parent->right = a;
109 r = a->right;
110 if ((a->right = b->right))
111 a->right->parent = a;
112 if ((b->right = r))
113 b->right->parent = b;
116 if ((b->right = a->right))
    [all...]
  /frameworks/base/core/java/android/app/usage/
UsageStats.java 121 * Add the statistics from the right {@link UsageStats} to the left. The package name for
123 * @param right The {@link UsageStats} object to merge into this one.
127 public void add(UsageStats right) {
128 if (!mPackageName.equals(right.mPackageName)) {
130 mPackageName + "' with UsageStats for package '" + right.mPackageName + "'.");
133 if (right.mBeginTimeStamp > mBeginTimeStamp) {
138 mLastEvent = right.mLastEvent;
139 mLastTimeUsed = right.mLastTimeUsed;
141 mBeginTimeStamp = Math.min(mBeginTimeStamp, right.mBeginTimeStamp);
142 mEndTimeStamp = Math.max(mEndTimeStamp, right.mEndTimeStamp)
    [all...]
  /external/skia/tools/lua/
skia.lua 20 Sk.Rect = { left = 0, top = 0, right = 0, bottom = 0 }
27 rect = { left = l, top = t, right = r, bottom = b }
30 rect = { right = l, bottom = t }
40 return self.right - self.left
54 value = value * self.right
62 self.right = 0
69 self.right = r
78 self.right = self.right + dx
87 self.right = self.right - d
    [all...]
  /external/skia/tests/
BlitMaskClip.cpp 23 int right = x + width; variable
24 REPORTER_ASSERT(fReporter, right > fBounds.fLeft && right <= fBounds.fRight);
56 for (int right = left + 1; right <= b.fRight; right++) {
57 SkIRect clipRect = {left, top, right, bottom};
  /frameworks/base/core/java/android/view/
Gravity.java 34 /** Raw bit controlling how the right/bottom edge is placed. */
36 /** Raw bit controlling whether the right/bottom edge is clipped to its
51 /** Push object to the right of its container, not changing its size. */
52 public static final int RIGHT = (AXIS_PULL_AFTER|AXIS_SPECIFIED)<<AXIS_X_SHIFT;
66 public static final int FILL_HORIZONTAL = LEFT|RIGHT;
85 * absolute LEFT/RIGHT).
118 public static final int END = RELATIVE_LAYOUT_DIRECTION | RIGHT;
176 * pushes it to the right; if gravity is RIGHT it pushes it to
178 * right or left; otherwise it is ignored
    [all...]
  /frameworks/base/core/java/com/android/internal/widget/
BackgroundFallback.java 52 int right = 0; local
75 right = Math.max(right, child.getRight());
79 if (left >= right || top >= bottom) {
92 if (right < width) {
93 mBackgroundFallback.setBounds(right, top, width, height);
97 mBackgroundFallback.setBounds(left, bottom, right, height);
  /libcore/ojluni/src/main/java/java/util/
DualPivotQuicksort.java 102 * @param right the index of the last element, inclusive, to be sorted
107 static void sort(int[] a, int left, int right,
110 if (right - left < QUICKSORT_THRESHOLD) {
111 sort(a, left, right, true);
123 for (int k = left; k < right; run[count] = k) {
125 while (++k <= right && a[k - 1] <= a[k]);
127 while (++k <= right && a[k - 1] >= a[k]);
132 for (int m = MAX_RUN_LENGTH; ++k <= right && a[k - 1] == a[k]; ) {
134 sort(a, left, right, true);
145 sort(a, left, right, true)
    [all...]
  /toolchain/binutils/binutils-2.25/libiberty/
splay-tree.c 84 deallocated, we just need to process left and right. */
93 if (active->right)
95 KDEL (active->right->key);
96 VDEL (active->right->value);
97 active->right->key = (splay_tree_key)pending;
98 pending = (splay_tree_node)(active->right);
117 tmp = n->right;
118 n->right = p;
123 /* Rotate the edge joining the right child N with its parent P. PP is the
132 p->right = tmp
420 splay_tree_node left, right; local
    [all...]
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
NFAFactory.java 86 while ( s!=alt.right ) {
120 NFAState right = newState(); local
122 right.associatedASTNode = associatedAST;
123 transitionBetweenStates(left, right, label);
124 StateCluster g = new StateCluster(left, right);
138 NFAState right = newState(); local
140 right.associatedASTNode = associatedAST;
142 Transition e = new Transition(label,right);
144 StateCluster g = new StateCluster(left, right);
165 NFAState right = newState() local
237 NFAState right = newState(); local
248 NFAState right = newState(); local
266 NFAState right = newState(); local
280 NFAState right = newState(); local
673 NFAState right = newState(); local
    [all...]
  /frameworks/base/graphics/java/android/graphics/
Outline.java 161 public void setRect(int left, int top, int right, int bottom) {
162 setRoundRect(left, top, right, bottom, 0.0f);
169 setRect(rect.left, rect.top, rect.right, rect.bottom);
177 public void setRoundRect(int left, int top, int right, int bottom, float radius) {
178 if (left >= right || top >= bottom) {
184 mRect.set(left, top, right, bottom);
193 setRoundRect(rect.left, rect.top, rect.right, rect.bottom, radius);
227 public void setOval(int left, int top, int right, int bottom) {
228 if (left >= right || top >= bottom) {
233 if ((bottom - top) == (right - left))
    [all...]
  /external/icu/icu4c/source/i18n/
dtrule.cpp 69 DateTimeRule::operator=(const DateTimeRule& right) {
70 if (this != &right) {
71 fMonth = right.fMonth;
72 fDayOfMonth = right.fDayOfMonth;
73 fDayOfWeek = right.fDayOfWeek;
74 fWeekInMonth = right.fWeekInMonth;
75 fMillisInDay = right.fMillisInDay;
76 fDateRuleType = right.fDateRuleType;
77 fTimeRuleType = right.fTimeRuleType;
  /external/v8/test/webkit/
order-of-operations.js 29 function right() { function
30 leftRight = leftRight + "Right";
33 shouldBe('(function(){ leftRight = ""; left() > right(); return leftRight; })()', '"LeftRight"');
34 shouldBe('(function(){ leftRight = ""; left() >= right(); return leftRight; })()', '"LeftRight"');
35 shouldBe('(function(){ leftRight = ""; left() < right(); return leftRight; })()', '"LeftRight"');
36 shouldBe('(function(){ leftRight = ""; left() <= right(); return leftRight; })()', '"LeftRight"');
37 shouldBe('(function(){ leftRight = ""; left() + right(); return leftRight; })()', '"LeftRight"');
38 shouldBe('(function(){ leftRight = ""; left() - right(); return leftRight; })()', '"LeftRight"');
39 shouldBe('(function(){ leftRight = ""; left() / right(); return leftRight; })()', '"LeftRight"');
40 shouldBe('(function(){ leftRight = ""; left() * right(); return leftRight; })()', '"LeftRight"')
    [all...]
  /cts/tests/camera/src/android/hardware/cts/helpers/
CameraUtils.java 56 long right = widthB * (long) heightB; local
57 if (left == right) {
59 right = widthB;
61 return (left < right) ? -1 : (left > right ? 1 : 0);
  /development/samples/ApiDemos/src/com/example/android/apis/graphics/kube/
Cube.java 22 public Cube(GLWorld world, float left, float bottom, float back, float right, float top, float front) {
25 GLVertex rightBottomBack = addVertex(right, bottom, back);
27 GLVertex rightTopBack = addVertex(right, top, back);
29 GLVertex rightBottomFront = addVertex(right, bottom, front);
31 GLVertex rightTopFront = addVertex(right, top, front);
40 // right
  /external/chromium-trace/catapult/third_party/polymer/components/web-animations-js/src/
number-handler.js 30 function mergeNumbers(left, right) {
31 return [left, right, numberToString];
35 function mergeFlex(left, right) {
38 return clampedMergeNumbers(0, Infinity)(left, right);
41 function mergePositiveIntegers(left, right) {
42 return [left, right, function(x) {
48 return function(left, right) {
49 return [left, right, function(x) {
55 function round(left, right) {
56 return [left, right, Math.round]
    [all...]
  /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/libvpx/libvpx/vp9/encoder/
vp9_treewriter.c 37 unsigned int left, right; local
45 right = num_events[-tree[i + 1]];
47 right = convert_distribution(tree[i + 1], tree, branch_ct, num_events);
50 branch_ct[i >> 1][1] = right;
51 return left + right;
  /external/lzma/CPP/7zip/Common/
FilePathAutoRename.cpp 45 unsigned left = 1, right = (1 << 30); local
46 while (left != right)
48 unsigned mid = (left + right) / 2;
52 right = mid;
54 return !MakeAutoName(name, extension, right, fullProcessedPath);
UniqBlocks.cpp 9 unsigned left = 0, right = Sorted.Size(); local
10 while (left != right)
12 unsigned mid = (left + right) / 2;
17 right = mid;
26 right = mid;
  /external/opencv3/modules/calib3d/test/opencl/
test_stereobm.cpp 56 Mat left, right, disp; local
65 right = readImage("gpu/stereobm/aloe-R.png", IMREAD_GRAYSCALE);
68 ASSERT_FALSE(right.empty());
71 right.copyTo(uright);
86 OCL_OFF(bm->compute(left, right, disp));
  /external/pdfium/public/
fpdf_transformpage.h 24 * @param[in] right - The right of the rectangle.
31 float right,
39 * @param[in] right - The right of the rectangle.
46 float right,
55 * @param[in] right - Pointer to a double value receiving the right of the
64 float* right,
73 * @param[in] right - Pointer to a double value receiving the right of th
    [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...]
  /external/skia/src/gpu/vk/
GrVkRenderPass.h 30 bool operator==(const AttachmentDesc& right) const {
31 return (fFormat == right.fFormat && fSamples == right.fSamples);
33 bool operator!=(const AttachmentDesc& right) const {
34 return !(*this == right);

Completed in 1304 milliseconds

1 2 3 4 5 67 8 91011>>