HomeSort by relevance Sort by last modified time
    Searched defs:right (Results 126 - 150 of 693) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/skqp/src/pathops/
SkIntersectionHelper.h 58 SkScalar right() const { function in class:SkIntersectionHelper
  /external/skqp/src/sksl/lex/
RegexParser.cpp 71 RegexNode right = this->pop(); local
73 fStack.emplace(RegexNode::kConcat_Kind, std::move(left), std::move(right));
165 RegexNode right = this->pop(); local
167 fStack.push(RegexNode(RegexNode::kOr_Kind, left, right));
  /external/skqp/tests/
PathOpsLineIntersectionTest.cpp 122 double right = SkTMax(line1[0].fX, line1[1].fX); local
124 ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left);
129 double right = SkTMax(line2[0].fX, line2[1].fX); local
131 ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left);
165 double right = SkTMax(line1[0].fX, line1[1].fX); local
167 ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left);
174 double right = SkTMax(line2[0].fX, line2[1].fX); local
176 ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left);
  /external/tensorflow/tensorflow/contrib/boosted_trees/lib/testutil/
random_tree_gen.cc 113 // Add left and right leaves.
117 TreeNode* right = ret.add_nodes(); local
118 right->mutable_leaf()->mutable_sparse_vector()->add_index(0);
119 right->mutable_leaf()->mutable_sparse_vector()->add_value(
141 // Shift left/right branch's indices internally so that everything is
185 // right when the feature is missing.
  /external/v4l2_codec2/vda/
rect.h 52 constexpr int right() const { return x() + width(); } function in class:media::Rect
67 return (rect.x() >= x() && rect.right() <= right() && rect.y() >= y() &&
  /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
376 SplayTree.Node.prototype.right = null; method in class:SplayTree.Node
    [all...]
  /external/webrtc/webrtc/common_audio/
audio_util_unittest.cc 112 int16_t left[kSamplesPerChannel], right[kSamplesPerChannel]; local
113 int16_t* deinterleaved[] = {left, right};
118 ExpectArraysEq(kRefRight, right, kSamplesPerChannel);
  /external/webrtc/webrtc/common_audio/resampler/
resampler.cc 411 int16_t* right = (int16_t*)malloc(lengthIn * sizeof(int16_t) / 2); local
419 right[i >> 1] = samplesIn[i + 1];
427 // Do resampling for right channel
429 res |= slave_right_->Push(right, lengthIn, out_right, maxLen / 2, actualOutLen_right);
433 free(right);
448 free(right);
  /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);
screen_capturer_helper.cc 97 int right = UpToMultiple(it.rect().right(), grid_size, grid_size_mask); local
100 result->AddRect(DesktopRect::MakeLTRB(left, top, right, bottom));
  /frameworks/av/media/ndk/include/media/
NdkImage.h 552 * <p>Note that the right and bottom coordinates are exclusive, so the width of the rectangle is
553 * (right - left) and the height of the rectangle is (bottom - top).</p>
558 int32_t right; member in struct:AImageCropRect
  /external/apache-xml/src/main/java/org/apache/xpath/operations/
Operation.java 40 /** The right operand expression.
80 * Set the left and right operand expressions for this operation.
84 * @param r The right expression operand.
110 XObject right = m_right.execute(xctxt, true); local
112 XObject result = operate(left, right);
114 right.detach();
123 * @param right non-null reference to the evaluated right operand.
129 public XObject operate(XObject left, XObject right)
141 /** @return the right operand of binary operation, as an Expression
    [all...]
  /art/compiler/optimizing/
instruction_simplifier_arm.cc 96 HInstruction* right = use->InputAt(1); local
97 DCHECK(left == bitfield_op || right == bitfield_op);
99 if (left == right) {
108 if (bitfield_op == right) {
112 other_input = right;
instruction_simplifier_arm64.cc 102 HInstruction* right; local
105 right = use->InputAt(1);
108 right = use->AsNeg()->InputAt(0);
109 left = GetGraph()->GetConstant(right->GetType(), 0);
111 DCHECK(left == bitfield_op || right == bitfield_op);
113 if (left == right) {
122 if (bitfield_op == right) {
126 other_input = right;
instruction_simplifier_shared.cc 168 // right inputs perform the same operation.
176 HInstruction* right = mul->GetRight(); local
177 if ((right->IsAdd() || right->IsSub()) &&
178 TrySimpleMultiplyAccumulatePatterns(mul, right->AsBinaryOperation(), left)) {
182 TrySimpleMultiplyAccumulatePatterns(mul, left->AsBinaryOperation(), right)) {
192 HInstruction* right = op->GetRight(); local
196 if (left->IsNot() ^ right->IsNot()) {
197 HInstruction* hnot = (left->IsNot() ? left : right);
198 HInstruction* hother = (left->IsNot() ? right : left)
    [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;
  /cts/tests/openglperf2/jni/primitive/fullpipeline/
FullPipelineRenderer.cpp 136 float right = ratio; local
142 mProjectionMatrix = Matrix::newFrustum(left, right, bottom, top, near, far);
  /cts/tests/openglperf2/jni/reference/scene/glowing/
GlowingScene.cpp 105 float right = ratio; local
111 return Matrix::newFrustum(left, right, bottom, top, near, far);
  /cts/tests/openglperf2/test/
MatrixTest.cpp 170 float right = ratio; local
176 Matrix* m = Matrix::newFrustum(left, right, bottom, top, near, far);
  /cts/tests/tests/graphics/src/android/graphics/cts/
EmbossMaskFilterTest.java 71 Rect right = new Rect(CENTER_X, 0, BITMAP_WIDTH, BITMAP_HEIGHT); local
74 assertTrue(brightness(bitmap, left) > brightness(bitmap, right));
81 left.right = START_X;
83 right.left = END_X;
84 assertEquals(0, brightness(bitmap, right));
94 for (int x = rect.left; x < rect.right; x++) {
  /cts/tests/tests/text/src/android/text/style/cts/
LineBackgroundSpan_StandardTest.java 69 final int right = 200; local
75 span.drawBackground(canvas, paint, left, right, top, baseline, bottom,
77 verify(canvas).drawRect(left, top, right, bottom, paint);
  /cts/tests/tests/view/src/android/view/cts/
View_LayoutPositionTest.java 74 int right = left + vRect.width(); local
79 assertEquals(right, view.getRight());
106 assertEquals(right + h_offset, nright);
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
DESEngine.java 409 int work, right, left; local
412 right = Pack.bigEndianToInt(in, inOff + 4);
414 work = ((left >>> 4) ^ right) & 0x0f0f0f0f;
415 right ^= work;
417 work = ((left >>> 16) ^ right) & 0x0000ffff;
418 right ^= work;
420 work = ((right >>> 2) ^ left) & 0x33333333;
422 right ^= (work << 2);
423 work = ((right >>> 8) ^ left) & 0x00ff00ff;
425 right ^= (work << 8)
    [all...]
  /external/brotli/research/
draw_histogram.cc 106 int right = 1ul * (pos + copy - 1) * width / max_pos; local
107 if (right < 0) {
108 printf("pos = %d, distance = %d, copy = %d, y = %d, right = %d\n",
109 pos, distance, copy, y, right);
110 assert(right >= 0);
112 if (y == right) {
117 for (int i = y + 1; i < right && i < width; ++i) {
121 if (right < width) {
122 pos2 = static_cast<int>(ceil(1.0 * right * max_pos / width));
123 histo[x][right] += pos + copy - 1 - pos2 + 1
    [all...]
  /external/deqp/external/vulkancts/modules/vulkan/draw/
vktDrawBaseClass.hpp 77 , right (0.3)
84 double right; member in struct:vkt::Draw::ReferenceImageCoordinates
93 , right (0.6)
100 double right; member in struct:vkt::Draw::ReferenceImageInstancedCoordinates

Completed in 4836 milliseconds

1 2 3 4 56 7 8 91011>>