| /external/chromium_org/ppapi/generators/ |
| idl_propertynode.py | 119 right = BuildNode('Right', ['Right=Right'])
120 top = BuildNode('Top', ['Left=Top', 'Right=Top'], [left, right])
123 errors += ExpectProp(top, 'Right', 'Top')
126 errors += ExpectProp(left, 'Right', 'Top')
128 errors += ExpectProp(right, 'Left', 'Top')
129 errors += ExpectProp(right, 'Right', 'Right'
[all...] |
| /external/chromium_org/printing/ |
| print_settings_initializer_mac.cc | 57 (paper_rect.right - paper_rect.left),
62 (page_rect.right - page_rect.left),
|
| /external/chromium_org/remoting/base/ |
| capabilities_unittest.cc | 22 const char* right; member in struct:__anon12092::IntersectTestData
93 // Verify that intersection of |right| with all permutations of |left| yields
100 EXPECT_EQ(IntersectCapabilities(JoinString(caps, " "), data[i].right),
|
| /external/chromium_org/remoting/tools/ |
| zip2msi.py | 79 def Merge(left, right):
83 TypeError: |left| and |right| cannot be merged.
86 - if both |left| and |right| are dictionaries, they are merged recursively.
87 - if both |left| and |right| are lists, the result is a list containing
89 - if both |left| and |right| are simple value, |right| is returned.
94 if isinstance(right, dict):
96 for key, value in right.iteritems():
105 if isinstance(right, list):
106 return left + right
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| quirks.css | 26 margin-right: 3px;
28 img[align="right"] {
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderScrollbarPart.h | 54 virtual LayoutUnit marginRight() const OVERRIDE { ASSERT(isIntegerValue(m_marginBox.right())); return m_marginBox.right(); }
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| canvasProfiler.css | 36 right: 0;
61 right: 0;
69 right: 4px;
77 right: 0;
|
| /external/chromium_org/third_party/WebKit/Tools/TestResultServer/static-dashboards/ |
| flakiness_dashboard.css | 44 margin-right: 15px;
|
| /external/chromium_org/third_party/skia/include/core/ |
| SkRegion.h | 118 * If left < right and top < bottom, set this region to that rectangle and
121 bool setRect(int32_t left, int32_t top, int32_t right, int32_t bottom);
195 bool quickContains(int32_t left, int32_t top, int32_t right,
199 return left < right && top < bottom &&
201 /* fBounds.contains(left, top, right, bottom); */
203 fBounds.fRight >= right && fBounds.fBottom >= bottom;
262 bool op(int left, int top, int right, int bottom, Op op) {
264 rect.set(left, top, right, bottom);
347 * Y scanline, clipped to the specified left and right X values.
351 Spanerator(const SkRegion&, int y, int left, int right);
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsLine.h | 30 static double ExactPointH(const SkDPoint& xy, double left, double right, double y);
34 static double NearPointH(const SkDPoint& xy, double left, double right, double y);
|
| /external/chromium_org/ui/gfx/ |
| box_f.cc | 36 float max_x = std::max(right(), box.right());
|
| /external/chromium_org/ui/views/controls/ |
| focusable_border.cc | 63 void FocusableBorder::SetInsets(int top, int left, int bottom, int right) {
64 insets_.Set(top, left, bottom, right);
|
| /external/clang/www/ |
| menu.css | 12 padding-right:4ex;
|
| /external/compiler-rt/www/ |
| menu.css | 13 padding-right:4ex;
|
| /external/guava/guava/src/com/google/common/collect/ |
| ByFunctionOrdering.java | 45 @Override public int compare(F left, F right) {
46 return ordering.compare(function.apply(left), function.apply(right));
|
| CompoundOrdering.java | 46 @Override public int compare(T left, T right) {
48 int result = comparator.compare(left, right);
|
| ExplicitOrdering.java | 39 @Override public int compare(T left, T right) {
40 return rank(left) - rank(right); // safe because both are nonnegative
|
| /external/jsilver/src/com/google/clearsilver/jsilver/autoescape/ |
| EscapeMode.java | 26 // subsequent template contents to determine the right escaping command to use.
92 * values are provided by {@code left} and {@code right} respectively. For now, if either of the
99 public static EscapeMode combineModes(EscapeMode left, EscapeMode right) {
100 if (left.equals(ESCAPE_NONE) || right.equals(ESCAPE_NONE)) {
|
| /external/libvorbis/doc/ |
| 10-tables.tex | 9 lookup table consiting of the following values (read left to right
|
| /external/libvpx/libvpx/tools/ |
| intersect-diffs.py | 43 rhs_file = rhs_hunk.right.filename.split("/")[1:]
57 # Join the right hand side of the older diff with the left hand side of the
62 old_lines = old_hunk.right
|
| /external/skia/bench/ |
| TableBench.cpp | 65 SkRect right = SkRect::MakeLTRB(col * kCellWidth + (kCellWidth-SK_Scalar1), local
69 canvas->drawRect(right, borderPaint);
|
| /external/skia/include/core/ |
| SkRegion.h | 118 * If left < right and top < bottom, set this region to that rectangle and
121 bool setRect(int32_t left, int32_t top, int32_t right, int32_t bottom);
195 bool quickContains(int32_t left, int32_t top, int32_t right,
199 return left < right && top < bottom &&
201 /* fBounds.contains(left, top, right, bottom); */
203 fBounds.fRight >= right && fBounds.fBottom >= bottom;
262 bool op(int left, int top, int right, int bottom, Op op) {
264 rect.set(left, top, right, bottom);
347 * Y scanline, clipped to the specified left and right X values.
351 Spanerator(const SkRegion&, int y, int left, int right);
[all...] |
| /external/skia/src/pathops/ |
| SkPathOpsLine.h | 30 static double ExactPointH(const SkDPoint& xy, double left, double right, double y);
34 static double NearPointH(const SkDPoint& xy, double left, double right, double y);
|
| /external/skia/tests/ |
| StrokeTest.cpp | 17 SkScalarNearlyEqual(a.right(), b.right()) &&
|
| /external/v8/src/ |
| splay-tree-inl.h | 136 // the right subtree.
209 // No left child, so the new tree is just the right child.
213 Node* right = root_->right_; local
216 // Splay to make sure that the new root has an empty right child.
218 // Insert the original right child as the right child of the new
220 root_->right_ = right;
231 // counter-intuitive: The right child of the dummy node will hold
234 // and right will always be nodes and we avoid special cases.
237 Node* right = dummy local
[all...] |
