| /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...] |
| /external/avahi/avahi-core/ |
| prioq.h | 38 AvahiPrioQueueNode *left, *right, *parent, *next, *prev; member in struct:AvahiPrioQueueNode
|
| /external/chromium-trace/catapult/telemetry/telemetry/internal/image_processing/ |
| bitmaptools.cc | 31 Box() : left(), top(), right(), bottom() {}
47 right = left + width;
54 if (right <= x) right = x + 1;
59 int width() const { return right - left; }
64 int right; member in struct:Box
106 box.right * pixel_stride > row_size) {
119 row_size = (box.right - box.left) * pixel_stride;
209 box.right = 0;
|
| /external/chromium-trace/catapult/third_party/graphy/graphy/ |
| bar_chart_test.py | 57 self.assertEqual([c.left, c.right], c.GetDependentAxes())
61 self.assertEqual([c.left, c.right], c.GetIndependentAxes())
63 right2 = c.AddAxis(common.AxisPosition.RIGHT, common.Axis())
67 self.assertEqual([c.left, c.right, right2], c.GetDependentAxes())
71 self.assertEqual([c.left, c.right, right2], c.GetIndependentAxes())
|
| formatters.py | 21 chart.formatters.append(LabelSeparator(right=8))
79 Charts can have multiple dependent axes (chart.left & chart.right, for
82 only the right axis then your values will be automatically copied to the left
125 def __init__(self, left=None, right=None, bottom=None):
127 self.right = right
132 self.AdjustLabels(chart.right, self.right)
173 """Provide a legend for line charts by attaching labels to the right
188 chart.right.min = chart.left.mi
[all...] |
| /external/chromium-trace/catapult/third_party/polymer/components/web-animations-js/src/ |
| transform-handler.js | 110 function mergeMatrices(left, right) {
111 if (left.decompositionPair !== right) {
112 left.decompositionPair = right;
115 if (right.decompositionPair !== left) {
116 right.decompositionPair = left;
117 var rightArgs = scope.makeMatrixDecomposition(right);
120 return [[false], [true], function(x) { return x ? right[0].d : left[0].d; }];
143 function mergeTransforms(left, right) {
147 if (!left.length || !right.length) {
150 left = right;
[all...] |
| /external/fio/lib/ |
| 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-hand child, go down and then left as fa
[all...] |
| /external/freetype/include/ |
| ftpfr.h | 112 * right :: Index of the right glyph.
131 FT_UInt right,
|
| /external/freetype/include/internal/services/ |
| svpfr.h | 42 FT_UInt right,
|
| /external/guava/guava/src/com/google/common/collect/ |
| Ordering.java | 104 @SuppressWarnings("unchecked") // TODO(kevinb): right way to explain this??
276 @Override public int compare(Object left, Object right) {
277 if (left == right) {
281 } else if (right == null) {
285 int rightCode = identityHashCode(right);
291 int result = uids.get(left).compareTo(uids.get(right));
446 @Override public abstract int compare(@Nullable T left, @Nullable T right);
705 int right = bufferCap - 1; local
711 while (left < right) {
712 int pivotIndex = (left + right + 1) >>> 1
[all...] |
| /external/guava/guava-gwt/test-super/com/google/common/primitives/super/com/google/common/primitives/ |
| ByteArrayAsListTest.java | 79 private static Byte[] concat(Byte[] left, Byte[] right) {
80 Byte[] result = new Byte[left.length + right.length];
82 System.arraycopy(right, 0, result, left.length, right.length);
|
| CharArrayAsListTest.java | 79 private static Character[] concat(Character[] left, Character[] right) {
80 Character[] result = new Character[left.length + right.length];
82 System.arraycopy(right, 0, result, left.length, right.length);
|
| DoubleArrayAsListTest.java | 79 private static Double[] concat(Double[] left, Double[] right) {
80 Double[] result = new Double[left.length + right.length];
82 System.arraycopy(right, 0, result, left.length, right.length);
|
| FloatArrayAsListTest.java | 79 private static Float[] concat(Float[] left, Float[] right) {
80 Float[] result = new Float[left.length + right.length];
82 System.arraycopy(right, 0, result, left.length, right.length);
|
| IntArrayAsListTest.java | 80 private static Integer[] concat(Integer[] left, Integer[] right) {
81 Integer[] result = new Integer[left.length + right.length];
83 System.arraycopy(right, 0, result, left.length, right.length);
|
| LongArrayAsListTest.java | 79 private static Long[] concat(Long[] left, Long[] right) {
80 Long[] result = new Long[left.length + right.length];
82 System.arraycopy(right, 0, result, left.length, right.length);
|
| ShortArrayAsListTest.java | 79 private static Short[] concat(Short[] left, Short[] right) {
80 Short[] result = new Short[left.length + right.length];
82 System.arraycopy(right, 0, result, left.length, right.length);
|
| /external/icu/icu4c/source/i18n/ |
| taiwncal.h | 82 * @param right the object to be copied.
85 TaiwanCalendar& operator=(const TaiwanCalendar& right);
|
| /external/opencv/cv/src/ |
| _cvkdtree.hpp | 71 int left, right; // node indices of left and right branches member in struct:CvKDTree::node
72 scalar_type boundary; // left if deref(value,dim)<=boundary, otherwise right
178 n.right = nexti;
193 int right = insert(split, last, ctor); local
194 nodes[i].right = right;
212 else // right
213 r = remove(&n.right, p);
216 if (n.left == -1 && n.right == -1
[all...] |
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| kdtree_index.h | 370 /* Bubble end value down to right location by repeated swapping. */
397 int right = count-1; local
399 while (left<=right && dataset_[ind[left]][cutfeat]<cutval) ++left;
400 while (left<=right && dataset_[ind[right]][cutfeat]>=cutval) --right;
401 if (left>right) break;
402 std::swap(ind[left], ind[right]); ++left; --right;
405 right = count-1
[all...] |
| /external/opencv3/modules/objdetect/src/ |
| HaarStructs.h | 15 float right; member in struct:__anon21767
|
| /external/pdfium/fpdfsdk/include/fxedit/ |
| fxet_list.h | 38 CLST_Rect() { left = top = right = bottom = 0.0f; }
46 right = other_right;
53 right = rect.right;
59 void Default() { left = top = right = bottom = 0.0f; }
64 right = rect.right;
78 FX_FLOAT Width() const { return right - left; }
88 CPDF_Point RightBottom() const { return CPDF_Point(right, bottom); }
92 right += point.x
[all...] |
| /external/pdfium/public/ |
| fpdf_text.h | 97 // right - Pointer to a double number receiving right position
111 double* right,
194 // right - Pointer to a double value receiving the rectangle
195 // right boundary.
205 double* right,
215 // right - Right boundary.
237 double right,
388 // right - Pointer to a double value receiving the rectangl
[all...] |
| /external/pdfium/third_party/freetype/include/freetype/ |
| ftpfr.h | 112 * right :: Index of the right glyph.
131 FT_UInt right,
|
| /external/pdfium/third_party/freetype/include/freetype/internal/services/ |
| svpfr.h | 42 FT_UInt right,
|
