HomeSort by relevance Sort by last modified time
    Searched full:left (Results 26 - 50 of 6784) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/opencore/oscl/oscl/osclbase/src/
oscl_tree.cpp 23 x->right = y->left;
24 if (y->left != 0)
25 y->left->parent = x;
30 else if (x == x->parent->left)
31 x->parent->left = y;
34 y->left = x;
40 base_link_type y = x->left;
41 x->left = y->right;
51 x->parent->left = y;
61 if (x->parent == x->parent->parent->left)
    [all...]
  /external/webkit/WebCore/manual-tests/
animate-left.html 7 <title>Animation of left property</title>
11 left: 100px;
24 left: 100px;
27 left: 300px;
34 <h1>Animation of 'left' property</h1>
36 <p>The element below should bounce 200 pixels left and right continuously</p>
drag_select_highlighting.html 6 <p>Drag across the following line from right to left and all the way back.</p>
10 <p>Drag across the following line from left to right and all the way back.</p>
11 <p style="font-family:'Lucida Grande'; font-size:12px; text-align:left; direction:rtl; unicode-bidi:bidi-override;">
  /external/skia/src/core/
SkRect.cpp 19 void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom)
22 if (left >= right || top >= bottom)
27 this->set(left, top, right, bottom);
30 if (left < fLeft) fLeft = left;
107 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom)
109 if (left < right && top < bottom && !this->isEmpty() && // check for empties
110 fLeft < right && left < fRight && fTop < bottom && top < fBottom)
112 if (fLeft < left) fLeft = left;
    [all...]
SkTSearch.cpp 149 char* left = first; local
151 char* pivot = left;
153 while (left <= rite)
155 while (left < last && compare(left, pivot) < 0)
156 left += elemSize;
159 if (left <= rite)
161 if (left < rite)
163 SkASSERT(compare(left, rite) >= 0);
164 sk_qsort_swap(left, rite, elemSize)
    [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/expat/doc/
style.css 17 padding-left: 2em;
42 padding-left: 1em;
48 margin-left: 2em;
53 padding-left: 1em;
59 margin-left: 2em;
70 margin-left: 2em;
88 margin-left: 2em;
  /external/v8/benchmarks/
splay.js 57 left: GeneratePayloadTree(depth - 1, key),
172 node.left = this.root_;
177 node.left = this.root_.left;
178 this.root_.left = null;
201 if (!this.root_.left) {
205 this.root_ = this.root_.left;
244 // the left subtree.
247 } else if (this.root_.left) {
248 return this.findMax(this.root_.left);
    [all...]
  /external/webkit/SunSpider/tests/v8-v4/
v8-splay.js 52 left: GeneratePayloadTree(depth - 1, key),
167 node.left = this.root_;
172 node.left = this.root_.left;
173 this.root_.left = null;
196 if (!this.root_.left) {
200 this.root_ = this.root_.left;
239 // the left subtree.
242 } else if (this.root_.left) {
243 return this.findMax(this.root_.left);
    [all...]
  /frameworks/base/include/ui/
Rect.h 28 int left; member in class:android::Rect
41 : left(0), top(0), right(w), bottom(h) {
44 : left(l), top(t), right(r), bottom(b) {
47 : left(lt.x), top(lt.y), right(rb.x), bottom(rb.y) {
53 left = top = right = bottom = 0;
72 return right-left;
81 left = lt.x;
92 return Point(left, top);
101 return Point(left, bottom);
106 return (left == rhs.left) && (top == rhs.top) &
    [all...]
  /external/icu4c/common/
uarrsort.h 30 * @param left Pointer to the "left" item.
33 * <0 if left<right
34 * ==0 if left==right
35 * >0 if left>right
40 UComparator(const void *context, const void *left, const void *right);
68 uprv_uint16Comparator(const void *context, const void *left, const void *right);
75 uprv_int32Comparator(const void *context, const void *left, const void *right);
82 uprv_uint32Comparator(const void *context, const void *left, const void *right);
  /frameworks/base/core/tests/coretests/src/android/widget/listview/focus/
ListButtonsDiagonalAcrossItemsTest.java 31 * make sure going right and left doesn't change selection
61 assertTrue("left button focused", mLeftButton.isFocused());
63 assertTrue("left left of center",
67 assertTrue("center left of right",
71 assertEquals("focus search right from left button should be center button",
77 assertEquals("focus search left from centr button should be left button",
89 assertTrue("left should still be focused", mLeftButton.isFocused());
  /packages/apps/Mms/src/com/android/mms/model/
RegionModel.java 30 public RegionModel(String regionId, int left, int top,
32 this(regionId, DEFAULT_FIT, left, top, width, height);
35 public RegionModel(String regionId, String fit, int left, int top,
37 this(regionId, fit, left, top, width, height, null);
40 public RegionModel(String regionId, String fit, int left, int top,
44 mLeft = left;
81 * @param left the mLeft to set
83 public void setLeft(int left) {
84 mLeft = left;
  /external/webkit/JavaScriptCore/assembler/
MacroAssembler.h 113 void branch32(Condition cond, RegisterID left, Address right, Label target)
115 branch32(cond, left, right).linkTo(target, this);
118 void branch16(Condition cond, BaseIndex left, RegisterID right, Label target)
120 branch16(cond, left, right).linkTo(target, this);
229 void setPtr(Condition cond, RegisterID left, Imm32 right, RegisterID dest)
231 set32(cond, left, right, dest);
265 Jump branchPtr(Condition cond, RegisterID left, RegisterID right)
267 return branch32(cond, left, right);
270 Jump branchPtr(Condition cond, RegisterID left, ImmPtr right)
272 return branch32(cond, left, Imm32(right))
    [all...]
  /external/webkit/SunSpider/tests/sunspider-0.9/
access-binary-trees.js 5 function TreeNode(left,right,item){
6 this.left = left;
12 if (this.left==null) return this.item;
13 else return this.item + this.left.itemCheck() - this.right.itemCheck();
  /external/webkit/SunSpider/tests/sunspider-0.9.1/
access-binary-trees.js 5 function TreeNode(left,right,item){
6 this.left = left;
12 if (this.left==null) return this.item;
13 else return this.item + this.left.itemCheck() - this.right.itemCheck();
  /external/v8/tools/
splaytree.js 86 node.left = this.root_;
91 node.left = this.root_.left;
92 this.root_.left = null;
115 if (!this.root_.left) {
119 this.root_ = this.root_.left;
154 while (current.left) {
155 current = current.left;
188 // the left subtree.
191 } else if (this.root_.left) {
    [all...]
  /cts/tests/tests/graphics/src/android/graphics/cts/
RegionIteratorTest.java 56 assertEquals(1, rect.left);
62 assertEquals(1, rect.left);
73 assertEquals(1, rect.left);
78 assertEquals(1, rect.left);
83 assertEquals(5, rect.left);
89 assertEquals(1, rect.left);
100 assertEquals(1, rect.left);
105 assertEquals(1, rect.left);
111 assertEquals(1, rect.left);
122 assertEquals(5, rect.left);
    [all...]
  /dalvik/dx/tests/108-string-annotation/
Blort.java 20 // This space intentionally left blank.
25 // This space intentionally left blank.
30 // This space intentionally left blank.
  /development/samples/ApiDemos/src/com/example/android/apis/graphics/kube/
Cube.java 22 public Cube(GLWorld world, float left, float bottom, float back, float right, float top, float front) {
24 GLVertex leftBottomBack = addVertex(left, bottom, back);
26 GLVertex leftTopBack = addVertex(left, top, back);
28 GLVertex leftBottomFront = addVertex(left, bottom, front);
30 GLVertex leftTopFront = addVertex(left, top, front);
38 // left
  /external/icu4c/data/unidata/
BidiMirroring.txt 39 0028; 0029 # LEFT PARENTHESIS
43 005B; 005D # LEFT SQUARE BRACKET
45 007B; 007D # LEFT CURLY BRACKET
47 00AB; 00BB # LEFT-POINTING DOUBLE ANGLE QUOTATION MARK
55 2039; 203A # SINGLE LEFT-POINTING ANGLE QUOTATION MARK
57 2045; 2046 # LEFT SQUARE BRACKET WITH QUILL
59 207D; 207E # SUPERSCRIPT LEFT PARENTHESIS
61 208D; 208E # SUBSCRIPT LEFT PARENTHESIS
121 22A3; 22A2 # LEFT TACK
134 22C9; 22CA # LEFT NORMAL FACTOR SEMIDIRECT PRODUC
    [all...]
  /sdk/hierarchyviewer/src/com/android/hierarchyviewer/ui/
LayoutRenderer.java 70 g.clipRect(insets.left, insets.top,
71 getWidth() - insets.left - insets.right,
83 int x = (getWidth() - insets.left - insets.right - root.width) / 2;
85 g.translate(insets.left + x, insets.top + y);
88 g.drawRect(root.left, root.top, root.width - 1, root.height - 1);
89 g.clipRect(root.left - 1, root.top - 1, root.width + 1, root.height + 1);
99 s.translate(p.left - p.scrollX, p.top - p.scrollY);
103 s.drawImage(node.image, node.left, node.top, null);
105 s.drawRect(node.left, node.top, node.width - 1, node.height - 1);
109 g.translate(-insets.left - x, -insets.top - y)
    [all...]
  /external/icu4c/
icu4c.css 48 border-left: 2px solid #22d;
50 padding-left: 4px;
74 padding-left: 0;
75 margin-left: 1em;
93 margin-left: 1.5em;
112 margin-left: 1.8em;
115 padding-left: 0.75em;
121 margin-left: 2em;
125 * Navigation sidebar on the left hand of most pages
134 padding-left: 0.2em
    [all...]
  /dalvik/libcore/xml/src/test/resources/
SimpleParserTest.xml 3 <!-- This space intentionally left blank. -->
  /external/bison/tests/
existing.at 54 %left LEX_OR
55 %left LEX_AND
56 %left LEX_GETLINE
58 %left FUNC_CALL LEX_BUILTIN LEX_LENGTH
62 %left CONCAT_OP
63 %left YSTRING YNUMBER
64 %left '+' '-'
65 %left '*' '/' '%'
68 %left INCREMENT DECREMENT
69 %left '$
    [all...]

Completed in 66 milliseconds

12 3 4 5 6 7 8 91011>>