| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| breakpointsList.css | 34 margin-left: 23px;
40 margin-left: 0;
92 left: 0;
100 margin-left: 12px;
105 float: left;
108 left: -1px;
|
| /frameworks/base/policy/src/com/android/internal/policy/impl/ |
| RecentApplicationsBackground.java | 61 protected boolean setFrame(int left, int top, int right, int bottom) {
63 if (mLeft != left || mRight != right || mTop != top || mBottom != bottom) {
66 return super.setFrame(left, top, right, bottom);
106 int left, right; local
109 left = chld.left - bkg.left;
113 left = 0;
116 background.setBounds(left, top, right, bottom);
145 r.left = r.top = Integer.MAX_VALUE
[all...] |
| /sdk/testapps/basicProjectWithAidl/src/com/android/tests/basicprojectwithaidl/ |
| Rect.java | 7 public int left; field in class:Rect
30 out.writeInt(left);
37 left = in.readInt();
|
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| RectTest.java | 53 assertEquals(1, mRect.left);
65 assertEquals(1, mRect.left);
75 assertEquals(0, mRect.left);
82 assertEquals(0, mRect.left);
113 assertEquals(1, mRect.left);
128 assertEquals(5, mRect.left);
136 assertEquals(5, mRect.left);
146 // 1. left < right, top < bottom
147 // this.left < this.right, this.top < this.bottom
151 assertEquals(0, mRect.left);
[all...] |
| /external/chromium_org/chrome/browser/resources/ |
| incognito_tab.css | 20 float: left;
27 margin-left: auto;
45 left: 0;
|
| /external/chromium_org/ui/gfx/ |
| canvas_paint_win.cc | 17 ps_.rcPaint.left = ps.rcPaint.left;
29 ps_.rcPaint.left = x;
41 skia::DrawToNativeContext(canvas, paint_dc_, ps_.rcPaint.left,
55 const int width = ps_.rcPaint.right - ps_.rcPaint.left;
68 -ps_.rcPaint.left / ui::win::GetDeviceScaleFactor(),
|
| insets.h | 24 Insets(int top, int left, int bottom, int right);
37 static_cast<int>(left() * x_scale),
|
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| TreeBase.h | 22 NodeBase *left; member in class:mcld::NodeBase
27 : left(0), right(0)
81 { return ((m_pNode->left) != (m_pNode->left->right)); }
94 { X = X->left; }
102 { X->left = const_cast<NodeBase*>(Y); }
|
| /external/apache-xml/src/main/java/org/apache/xpath/operations/ |
| Div.java | 38 * @param left non-null reference to the evaluated left operand.
45 public XObject operate(XObject left, XObject right)
48 return new XNumber(left.num() / right.num());
|
| Minus.java | 38 * @param left non-null reference to the evaluated left operand.
46 public XObject operate(XObject left, XObject right)
49 return new XNumber(left.num() - right.num());
|
| Mod.java | 38 * @param left non-null reference to the evaluated left operand.
45 public XObject operate(XObject left, XObject right)
48 return new XNumber(left.num() % right.num());
|
| Mult.java | 38 * @param left non-null reference to the evaluated left operand.
45 public XObject operate(XObject left, XObject right)
48 return new XNumber(left.num() * right.num());
|
| Plus.java | 38 * @param left non-null reference to the evaluated left operand.
45 public XObject operate(XObject left, XObject right)
48 return new XNumber(left.num() + right.num());
|
| /external/chromium_org/chrome/browser/resources/chromeos/login/ |
| screen_account_picker.css | 16 left: 0;
|
| /external/chromium_org/chrome/browser/resources/sync_file_system_internals/ |
| main.css | 20 padding-left: 0.5em;
22 text-align: left;
47 padding-left: 18px;
54 padding-left: 18px;
|
| /external/chromium_org/remoting/webapp/ |
| connection_stats.css | 8 left: 0;
|
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XMLViewer.css | 41 margin-left: 20px;
51 margin-left: 1em;
61 margin-left: -10px;
64 background-position: left top;
|
| /external/chromium_org/ui/views/ |
| border.h | 52 static Border* CreateEmptyBorder(int top, int left, int bottom, int right);
57 int left,
|
| /external/guava/guava/src/com/google/common/collect/ |
| BstBalancePolicy.java | 32 * subtrees {@code left} and {@code right}. It is guaranteed that the resulting tree will have
33 * the same inorder traversal order as the subtree {@code left}, then the entry {@code source},
36 N balance(BstNodeFactory<N> nodeFactory, N source, @Nullable N left, @Nullable N right);
39 * Constructs a locally balanced tree around the subtrees {@code left} and {@code right}. It is
41 * {@code left}, then the subtree {@code right}.
44 N combine(BstNodeFactory<N> nodeFactory, @Nullable N left, @Nullable N right);
|
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
| ShadowMarginLayoutParams.java | 20 public void setMargins(int left, int top, int right, int bottom) {
21 realMarginLayoutParams.leftMargin = left;
|
| /external/chromium_org/v8/test/mjsunit/tools/ |
| splaytree.js | 64 left: { key: 30, value: 30,
65 left: { key: 10, value: 10, left: null,
67 left: { key: 15, value: 15,
68 left: null, right: null },
70 right: { key: 40, value: 40, left: null, right: null } },
71 right: { key: 60, value: 60, left: null,
73 left: { key: 70, value: 70, left: null,
75 left: null, right: null } }
[all...] |
| /external/v8/test/mjsunit/tools/ |
| splaytree.js | 64 left: { key: 30, value: 30,
65 left: { key: 10, value: 10, left: null,
67 left: { key: 15, value: 15,
68 left: null, right: null },
70 right: { key: 40, value: 40, left: null, right: null } },
71 right: { key: 60, value: 60, left: null,
73 left: { key: 70, value: 70, left: null,
75 left: null, right: null } }
[all...] |
| /external/chromium_org/third_party/protobuf/java/src/main/java/com/google/protobuf/ |
| RopeByteString.java | 116 private final ByteString left; field in class:RopeByteString
125 * @param left string on the left of this node, should have {@code size() >
130 private RopeByteString(ByteString left, ByteString right) {
131 this.left = left;
133 leftLength = left.size();
135 treeDepth = Math.max(left.getTreeDepth(), right.getTreeDepth()) + 1;
148 * @param left string on the left
660 ByteString left = prefixesStack.pop(); local
672 ByteString left = prefixesStack.pop(); local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/platform/ |
| PODIntervalTree.h | 163 // Because the intervals are sorted by left endpoint, inorder
166 // See whether we need to traverse the left subtree.
167 IntervalNode* left = node->left();
168 if (left
171 && !(left->data().maxHigh() < adapter.lowValue()))
172 searchForOverlapsFrom<AdapterType>(left, adapter);
189 IntervalNode* left = node->left(); local
190 if (left) {
213 IntervalNode* left = node->left(); local
[all...] |
| /external/chromium_org/third_party/bintrees/bintrees/ |
| walker.py | 72 return self._node.left is not None
78 self._node = self._node.left
83 self._node = self._node.left
89 return self._node.left is not None
94 def _next_item(self, key, left, right, less_than):
103 node = left(node)
113 while left(node) is not None:
114 node = left(node)
129 left=attrgetter("left"),
[all...] |
