/external/chromium_org/third_party/webrtc/modules/desktop_capture/ |
H A D | 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 134 // Comparison functions used for std::lower_bound(). Compare left or right 140 static void AddSpanToRow(Row* row, int32_t left, int32_t right);
|
/external/chromium_org/third_party/webrtc/video_engine/ |
H A D | vie_render_manager.cc | 93 const float right, 119 left, top, right, 130 // We need exclusive right to the items in the render manager to delete a 88 AddRenderStream(const int32_t render_id, void* window, const uint32_t z_order, const float left, const float top, const float right, const float bottom) argument
|
/external/chromium_org/third_party/webrtc/voice_engine/test/auto_test/standard/ |
H A D | volume_test.cc | 248 TEST_LOG("Speak and verify that the following levels look right:\n"); 274 float right = -1.0; local 276 EXPECT_EQ(0, voe_volume_control_->GetOutputVolumePan(channel_, left, right)); 278 EXPECT_FLOAT_EQ(1.0, right); 290 TEST_LOG("Panning right.\n"); 296 float right = 0.0f; local 298 EXPECT_EQ(0, voe_volume_control_->GetOutputVolumePan(channel_, left, right)); 300 EXPECT_FLOAT_EQ(0.8f, right);
|
/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
H A D | inttree.h | 15 struct IntervalTreeNode *left, *right, *parent; member in struct:IntervalTreeNode 25 * right branch in searching for intervals but possibly come back
|
/external/chromium_org/ui/base/ime/ |
H A D | candidate_window.cc | 39 const Entry& right = cw.candidates_[i]; local 40 if (left.value != right.value || 41 left.label != right.label || 42 left.annotation != right.annotation || 43 left.description_title != right.description_title || 44 left.description_body != right.description_body)
|
/external/chromium_org/ui/gfx/geometry/ |
H A D | insets_base.h | 20 Type right() const { return right_; } function in class:gfx::InsetsBase 23 // left and right insets. 33 void Set(Type top, Type left, Type bottom, Type right) { argument 37 right_ = right; 61 InsetsBase(Type top, Type left, Type bottom, Type right) argument 65 right_(right) {}
|
H A D | quad_unittest.cc | 248 float right = 2.1f; local 250 EXPECT_EQ(RectF(left, top, right - left, bottom - top),
|
/external/chromium_org/ui/views/controls/ |
H A D | focusable_border.cc | 64 void FocusableBorder::SetInsets(int top, int left, int bottom, int right) { argument 65 insets_.Set(top, left, bottom, right);
|
/external/chromium_org/ui/views/window/ |
H A D | frame_background.cc | 36 const gfx::ImageSkia* right, 40 right_edge_ = right; 34 SetSideImages(const gfx::ImageSkia* left, const gfx::ImageSkia* top, const gfx::ImageSkia* right, const gfx::ImageSkia* bottom) argument
|
/external/chromium_org/v8/src/arm/ |
H A D | interface-descriptors-arm.cc | 36 const Register InstanceofDescriptor::right() { return r1; } function in class:v8::internal::InstanceofDescriptor
|
/external/chromium_org/v8/src/arm64/ |
H A D | interface-descriptors-arm64.cc | 41 const Register InstanceofDescriptor::right() { function in class:v8::internal::InstanceofDescriptor 246 // x0: right operand 257 // x0: right operand 266 // x0: right operand
|
/external/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyLogical.h | 65 const LExpr *right() const { return RHS; } function in class:clang::threadSafety::lexpr::BinOp 66 LExpr *right() { return RHS; } function in class:clang::threadSafety::lexpr::BinOp
|
/external/clang/test/CodeGenCXX/ |
H A D | microsoft-abi-multiple-nonvirtual-inheritance.cpp | 8 virtual void right(); 16 virtual void right(); 68 child->right(); 69 // When calling a right base's virtual method, one needs to adjust 'this' at 84 void ChildOverride::right() { function in class:ChildOverride 85 // CHECK: define x86_thiscallcc void @"\01?right@ChildOverride@@UAEXXZ"(i8* 87 // ChildOverride::right gets 'this' cast to Right* in ECX (i.e. this+4) so we 106 child->right(); 107 // When calling a right child's virtual method, one needs to adjust 'this' at 126 virtual void right(); 129 void GrandchildOverride::right() { function in class:GrandchildOverride [all...] |
/external/fio/lib/ |
H A D | prio_tree.h | 9 struct prio_tree_node *right; member in struct:prio_tree_node 48 (ptr)->left = (ptr)->right = (ptr)->parent = (ptr); \ 79 return node->right == node;
|
H A D | rbtree.c | 27 struct rb_node *right = node->rb_right; local 30 if ((node->rb_right = right->rb_left)) 31 rb_set_parent(right->rb_left, node); 32 right->rb_left = node; 34 rb_set_parent(right, parent); 39 parent->rb_left = right; 41 parent->rb_right = right; 44 root->rb_node = right; 45 rb_set_parent(node, right); 312 * If we have a right [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | ReverseNaturalOrdering.java | 28 @SuppressWarnings("unchecked") // TODO(kevinb): the right way to explain this?? 33 @Override public int compare(Comparable left, Comparable right) { argument 34 checkNotNull(left); // right null is caught later 35 if (left == right) { 39 return right.compareTo(left);
|
/external/guava/guava/src/com/google/common/primitives/ |
H A D | SignedBytes.java | 146 // For pre-sizing a builder, just get the right order of magnitude 179 public int compare(byte[] left, byte[] right) { argument 180 int minLength = Math.min(left.length, right.length); 182 int result = SignedBytes.compare(left[i], right[i]); 187 return left.length - right.length;
|
H A D | UnsignedBytes.java | 170 // For pre-sizing a builder, just get the right order of magnitude 278 // @Override public int compare(byte[] left, byte[] right) { 279 // int minLength = Math.min(left.length, right.length); 289 // long rw = theUnsafe.getLong(right, BYTE_ARRAY_BASE_OFFSET + (long) i); 323 // int result = UnsignedBytes.compare(left[i], right[i]); 328 // return left.length - right.length; 337 @Override public int compare(byte[] left, byte[] right) { argument 338 int minLength = Math.min(left.length, right.length); 340 int result = UnsignedBytes.compare(left[i], right[i]); 345 return left.length - right [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | BstTesting.java | 39 SimpleNode(Character key, @Nullable SimpleNode left, @Nullable SimpleNode right) { argument 40 super(key, left, right); 68 SimpleNode source, @Nullable SimpleNode left, @Nullable SimpleNode right) { 69 return new SimpleNode(source.getKey(), left, right); 76 @Nullable SimpleNode left, @Nullable SimpleNode right) { 77 return checkNotNull(nodeFactory).createNode(source, left, right); 83 @Nullable SimpleNode right) { 84 // Shove right into the rightmost position in the left tree. 86 return right; 87 } else if (right [all...] |
/external/guava/guava-tests/test/com/google/common/primitives/ |
H A D | ByteArrayAsListTest.java | 115 private static Byte[] concat(Byte[] left, Byte[] right) { argument 116 Byte[] result = new Byte[left.length + right.length]; 118 System.arraycopy(right, 0, result, left.length, right.length);
|
H A D | CharArrayAsListTest.java | 115 private static Character[] concat(Character[] left, Character[] right) { argument 116 Character[] result = new Character[left.length + right.length]; 118 System.arraycopy(right, 0, result, left.length, right.length);
|
H A D | DoubleArrayAsListTest.java | 115 private static Double[] concat(Double[] left, Double[] right) { argument 116 Double[] result = new Double[left.length + right.length]; 118 System.arraycopy(right, 0, result, left.length, right.length);
|
H A D | FloatArrayAsListTest.java | 115 private static Float[] concat(Float[] left, Float[] right) { argument 116 Float[] result = new Float[left.length + right.length]; 118 System.arraycopy(right, 0, result, left.length, right.length);
|
H A D | IntArrayAsListTest.java | 116 private static Integer[] concat(Integer[] left, Integer[] right) { argument 117 Integer[] result = new Integer[left.length + right.length]; 119 System.arraycopy(right, 0, result, left.length, right.length);
|
H A D | LongArrayAsListTest.java | 115 private static Long[] concat(Long[] left, Long[] right) { argument 116 Long[] result = new Long[left.length + right.length]; 118 System.arraycopy(right, 0, result, left.length, right.length);
|