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

<<11121314151617181920>>

  /external/chromium-trace/catapult/dashboard/dashboard/
find_step.py 69 left, right = values[:step_index], values[step_index:]
70 step_size = abs(math_utils.Mean(left) - math_utils.Mean(right))
87 left, right = values[:step_index], values[step_index:]
89 step_right = len(right) * [math_utils.Mean(right)]
  /external/icu/icu4c/source/i18n/
tztrans.cpp 55 TimeZoneTransition::operator=(const TimeZoneTransition& right) {
56 if (this != &right) {
57 fTime = right.fTime;
58 setFrom(*right.fFrom);
59 setTo(*right.fTo);
  /external/llvm/docs/_static/
llvm.css 11 address img { float: right; width: 88px; height: 31px; }
12 address { clear: right; }
16 margin-right: 1em; margin-bottom: 1em; }
54 .doc_text { text-align: left; padding-left: 20pt; padding-right: 10pt }
81 h2+div, h2+p {text-align: left; padding-left: 20pt; padding-right: 10pt;}
82 h3+div, h3+p {text-align: left; padding-left: 20pt; padding-right: 10pt;}
83 h4+div, h4+p {text-align: left; padding-left: 20pt; padding-right: 10pt;}
98 tr.layout, td.layout, td.left, td.right
101 td.right { text-align: right }
    [all...]
  /external/skia/tools/
imgslice.cpp 81 int top, bottom, left, right; local
88 FLAGS_max = right = SkTPin(FLAGS_max, left, bitmap.width()-1);
91 left = right = SkTPin(FLAGS_column, 0, bitmap.width()-1);
113 for (int x = right; x >= left; --x) {
121 for (int x = left; x <= right; ++x) {
  /external/v8/benchmarks/
splay.js 58 right: GeneratePayloadTree(depth - 1, tag)
97 // Verify that the splay tree has the right size.
174 node.right = this.root_.right;
175 this.root_.right = null;
177 node.right = this.root_;
203 this.root_ = this.root_.right;
205 var right = this.root_.right;
207 // Splay to make sure that the new root has an empty right child
    [all...]
  /external/webrtc/webrtc/modules/desktop_capture/
desktop_region.h 34 RowSpan(int32_t left, int32_t right);
38 return left == that.left && right == that.right;
42 int32_t right; member in struct:webrtc::DesktopRegion::RowSpan
135 // Comparison functions used for std::lower_bound(). Compare left or right
141 static void AddSpanToRow(Row* row, int32_t left, int32_t right);
differ.cc 28 // One additional row/column is added as a boundary on the right & bottom.
56 // Calc size of partial blocks which may be present on right and bottom edge.
146 // We've found a modified block. Look at blocks to the right and below
154 // Group with blocks to the right.
157 bool* right = diff_info + 1; local
158 while (*right) {
159 *right++ = false;
171 right = bottom;
173 if (!*right++) {
183 right = bottom
    [all...]
  /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/policy/
KeyguardUserSwitcherScrim.java 62 canvas.drawRect(isLtr ? bounds.right - width : 0, 0,
63 isLtr ? bounds.right : bounds.left + width, width, mRadialGradientPaint);
88 public void onLayoutChange(View v, int left, int top, int right, int bottom, int oldLeft,
90 if (left != oldLeft || top != oldTop || right != oldRight || bottom != oldBottom) {
91 mLayoutWidth = right - left;
  /frameworks/data-binding/compiler/src/main/java/android/databinding/tool/expr/
MathExpr.java 27 MathExpr(Expr left, String op, Expr right) {
28 super(left, right);
109 final Expr right = getRight(); local
110 final Expr constExpr = left.isDynamic() ? right : left;
111 final Expr varExpr = left.isDynamic() ? left : right;
  /toolchain/binutils/binutils-2.25/gas/
expr.c 185 for me to fix right. Thus a hack. JF: Just make generic_bignum bigger,
1769 expressionS right; local
2078 valueT left, right; local
2271 case O_left_shift: left <<= right; break; local
2272 case O_right_shift: left >>= right; break; local
    [all...]
  /cts/apps/CtsVerifier/src/com/android/cts/verifier/sensors/renderers/
GLArrowSensorTestRenderer.java 200 * @param right the right operand of the cross product
203 public static void crossProduct(float[] left, float[] right, float[] out) {
204 out[0] = left[1] * right[2] - left[2] * right[1];
205 out[1] = left[2] * right[0] - left[0] * right[2];
206 out[2] = left[0] * right[1] - left[1] * right[0];
213 * @param right the second dot product operan
    [all...]
  /external/skia/src/core/
SkRect.cpp 11 void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) {
13 if (left >= right || top >= bottom) {
19 this->set(left, top, right, bottom);
23 if (right > fRight) fRight = right;
113 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) {
114 CHECK_INTERSECT(left, top, right, bottom, fLeft, fTop, fRight, fBottom);
129 void SkRect::join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) {
131 if (left >= right || top >= bottom) {
137 this->set(left, top, right, bottom)
    [all...]
  /frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/samples/simplecamera/
FaceSquareFilter.java 88 int right = (tempRect.right+WIDTH_OFFSET)*dims[0]/FACE_X_RANGE; local
105 if (right > dims[0]) {
106 right = dims[0];
107 } else if (right < 0) {
108 right = 0;
122 // Right edge
123 if (right > 0 && top > 0) {
124 pixels[ImageConstants.PIX_CHANNELS * (dims[0] * (top + j) + right) +
126 pixels[ImageConstants.PIX_CHANNELS * (dims[0] * (top + j) + right)
    [all...]
  /frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/tests/src/androidx/media/filterfw/samples/simplecamera/
FaceSquareFilterTest.java 77 // ensure the output image has the rectangle in the right place
90 int right = (faceRect.right+WIDTH_OFFSET)*bitmap.getWidth()/FACE_X_RANGE; local
107 if (right > bitmap.getWidth()) {
108 right = bitmap.getWidth();
109 } else if (right < 0) {
110 right = 0;
124 // Right edge
125 if (right > 0 && top > 0) {
126 pixels[ImageConstants.PIX_CHANNELS * (bitmap.getWidth() * (top + j) + right)
    [all...]
  /hardware/ti/omap4-aah/camera/
CameraHalUtilClasses.cpp 131 hRange = CameraArea::RIGHT - CameraArea::LEFT;
151 ssize_t right,
156 if ( ( 0 == top ) && ( 0 == left ) && ( 0 == bottom ) && ( 0 == right ) && ( 0 == weight ) ) {
175 if ( ( CameraArea::LEFT > left ) || ( CameraArea::RIGHT < left ) ) {
180 if ( ( CameraArea::LEFT > right ) || ( CameraArea::RIGHT < right ) ) {
181 CAMHAL_LOGEB("Camera area right coordinate is invalid %d", right );
185 if ( left >= right ) {
210 ssize_t top, left, bottom, right, weight; local
    [all...]
  /hardware/ti/omap4xxx/camera/
CameraHalUtilClasses.cpp 133 hRange = CameraArea::RIGHT - CameraArea::LEFT;
153 ssize_t right,
158 if ( ( 0 == top ) && ( 0 == left ) && ( 0 == bottom ) && ( 0 == right ) && ( 0 == weight ) ) {
177 if ( ( CameraArea::LEFT > left ) || ( CameraArea::RIGHT < left ) ) {
182 if ( ( CameraArea::LEFT > right ) || ( CameraArea::RIGHT < right ) ) {
183 CAMHAL_LOGEB("Camera area right coordinate is invalid %d", right );
187 if ( left >= right ) {
212 ssize_t top, left, bottom, right, weight; local
    [all...]
  /bionic/libc/upstream-openbsd/lib/libc/net/
res_random.c 138 u_int left, right, tmp; local
144 right = in & 0xff;
147 * Each round swaps the width of left and right. Even rounds have
153 tmp = ru_prf->prf8[(i << (8 - 1)) | right] & 0x7f;
155 tmp = ru_prf->prf7[((i - 1) << (7 - 1)) | right];
157 left = right;
158 right = tmp;
161 return (right << 8) | left;
  /external/libjpeg-turbo/doc/html/search/
search.css 13 right: 0px;
27 background-position:right;
41 .right #MSearchSelect {
42 right:5px;
63 #MSearchBox .right {
66 right:10px;
89 .right #MSearchClose {
90 right: 2px;
110 -webkit-border-top-right-radius: 4px;
112 -webkit-border-bottom-right-radius: 4px
    [all...]
  /external/sl4a/ScriptingLayerForAndroid/src/com/googlecode/android_scripting/
ActivityFlinger.java 49 public ActivityTransition(Class<? extends Activity> left, Class<? extends Activity> right) {
51 mRight = right;
71 Class<? extends Activity> right = null; typedefs
79 right = it.next();
81 right = null;
83 mActivityTransitions.put(current, new ActivityTransition(left, right));
85 current = right;
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binary_heap_/
erase_fn_imps.hpp 188 size_type right = m_size - 1; local
190 while (right + 1 != left)
196 else if (pred(m_a_entries[right]))
197 --right;
200 _GLIBCXX_DEBUG_ASSERT(left < right);
201 std::swap(m_a_entries[left], m_a_entries[right]);
203 --right;
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binary_heap_/
erase_fn_imps.hpp 188 size_type right = m_size - 1; local
190 while (right + 1 != left)
196 else if (pred(m_a_entries[right]))
197 --right;
200 _GLIBCXX_DEBUG_ASSERT(left < right);
201 std::swap(m_a_entries[left], m_a_entries[right]);
203 --right;
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/binary_heap_/
erase_fn_imps.hpp 188 size_type right = m_size - 1; local
190 while (right + 1 != left)
196 else if (pred(m_a_entries[right]))
197 --right;
200 _GLIBCXX_DEBUG_ASSERT(left < right);
201 std::swap(m_a_entries[left], m_a_entries[right]);
203 --right;
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/binary_heap_/
erase_fn_imps.hpp 188 size_type right = m_size - 1; local
190 while (right + 1 != left)
196 else if (pred(m_a_entries[right]))
197 --right;
200 _GLIBCXX_DEBUG_ASSERT(left < right);
201 std::swap(m_a_entries[left], m_a_entries[right]);
203 --right;
  /external/v8/src/compiler/mips64/
instruction-selector-mips64.cc 105 inputs[input_count++] = g.UseOperand(m.right().node(), opcode);
268 m.right().HasValue()) {
269 uint32_t mask = m.right().Value();
279 if (mleft.right().HasValue()) {
281 uint32_t lsb = mleft.right().Value() & 0x1f;
297 if (m.right().HasValue()) {
298 uint32_t mask = m.right().Value();
318 m.right().HasValue()) {
319 uint64_t mask = m.right().Value();
329 if (mleft.right().HasValue())
642 Node* right = node->InputAt(1); local
710 Node* right = node->InputAt(1); local
741 Node* right = node->InputAt(1); local
1433 Node* right = node->InputAt(1); local
1831 Node* right = node->InputAt(1); local
1840 Node* right = node->InputAt(1); local
    [all...]
  /external/fio/lib/
prio_tree.c 142 old->parent->right = node;
151 node->right = old->right;
152 old->right->parent = node;
213 cur->right = node;
217 cur = cur->right;
256 cur = cur->right;
261 get_index(cur->right, &r_index, &h_index_right);
271 cur = cur->right;
280 if (cur->parent->right == cur
    [all...]

Completed in 1486 milliseconds

<<11121314151617181920>>