| /external/libcxx/test/input.output/iostreams.base/ios.base/fmtflags.state/ |
| unsetf_mask.pass.cpp | 33 t.unsetf(test::dec | test::right);
|
| /external/e2fsprogs/e2fsck/ |
| dict.c | 52 #define right dict_right macro
78 * its right child C are rearranged so that the P instead becomes the left
79 * child of C. The left subtree of C is inherited as the new right subtree
87 lower = upper->right;
88 upper->right = lowleft = lower->left;
99 assert (upper == upparent->right);
100 upparent->right = lower;
109 * the same procedure, but with left and right interchanged.
117 upper->left = lowright = lower->right;
122 if (upper == upparent->right) {
877 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *right; local
921 dnode_t *nil = dict_nil(dict), *parent, *right; local
[all...] |
| /external/chromium_org/third_party/webrtc/modules/video_render/external/ |
| video_render_external_impl.cc | 53 const float right,
72 float& right,
80 right = 0;
144 const float right,
156 const float right,
178 const float right,
190 const float right,
|
| /external/chromium_org/chrome/browser/resources/chromeos/ |
| power.css | 11 margin-right: auto;
20 border-right-width: 0;
28 text-align: right;
35 margin-right: 10px;
42 border-right-width: 1px;
|
| /external/chromium_org/printing/ |
| page_setup.cc | 17 right(0),
26 right = 0;
36 right == rhs.right &&
69 DCHECK_LE(printable_area.right(), physical_size.width());
130 effective_margins_.right = std::max(requested_margins_.right,
132 bounds.right());
144 effective_margins_.right -
157 effective_margins_.right
[all...] |
| /external/chromium_org/tools/code_coverage/ |
| croc.css | 27 padding-right:10px;
55 text-align:right;
65 text-align:right;
69 text-align:right;
73 text-align:right;
|
| /external/lldb/examples/scripting/ |
| dictionary.c | 18 struct tree_node *right; member in struct:tree_node
71 new_node->right = NULL;
77 if (root->right != NULL)
78 insert (root->right, word);
84 new_node->right = NULL;
85 root->right = new_node;
111 new_node->right = NULL;
136 return find_word (dictionary->right, word);
153 if (dictionary->right)
154 print_tree (dictionary->right);
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| BstNode.java | 20 import static com.google.common.collect.BstSide.RIGHT;
58 * The right child of this node. A null value indicates that this node has no right child.
61 private final N right; field in class:BstNode
63 BstNode(@Nullable K key, @Nullable N left, @Nullable N right) {
66 this.right = right;
85 case RIGHT:
86 return right;
120 if (hasChild(RIGHT)) {
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
| DESEngine.java | 408 int work, right, left; local
415 right = (in[inOff + 4] & 0xff) << 24;
416 right |= (in[inOff + 5] & 0xff) << 16;
417 right |= (in[inOff + 6] & 0xff) << 8;
418 right |= (in[inOff + 7] & 0xff);
420 work = ((left >>> 4) ^ right) & 0x0f0f0f0f;
421 right ^= work;
423 work = ((left >>> 16) ^ right) & 0x0000ffff;
424 right ^= work;
426 work = ((right >>> 2) ^ left) & 0x33333333
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkRect.cpp | 12 void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) {
14 if (left >= right || top >= bottom) {
20 this->set(left, top, right, bottom);
24 if (right > fRight) fRight = right;
102 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right,
104 if (left < right && top < bottom && !this->isEmpty() && // check for empties
105 fLeft < right && left < fRight && fTop < bottom && top < fBottom)
109 if (fRight > right) fRight = right;
[all...] |
| /external/chromium_org/v8/benchmarks/spinning-balls/ |
| splay-tree.js | 79 node.right = this.root_.right;
80 this.root_.right = null;
82 node.right = this.root_;
108 this.root_ = this.root_.right;
110 var right = this.root_.right;
112 // Splay to make sure that the new root has an empty right child.
114 // Insert the original right child as the right child of the ne
[all...] |
| /external/chromium_org/v8/tools/ |
| splaytree.js | 81 node.right = this.root_.right;
82 this.root_.right = null;
84 node.right = this.root_;
110 this.root_ = this.root_.right;
112 var right = this.root_.right;
114 // Splay to make sure that the new root has an empty right child.
116 // Insert the original right child as the right child of the ne
[all...] |
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| RectFTest.java | 62 assertEquals(5.0f, mRectF.right);
68 assertEquals(10.0f, mRectF.right);
79 assertEquals(3.0f, mRectF.right);
91 assertEquals(3.0f, mRectF.right);
103 assertEquals(3.0f, mRectF.right);
114 assertEquals(10.0f, mRectF.right);
121 assertEquals(10.0f, mRectF.right);
147 assertEquals(10.0f, mRectF.right);
154 assertEquals(10.0f, mRectF.right);
168 assertEquals(10.0f, mRectF.right);
[all...] |
| EmbossMaskFilterTest.java | 62 Rect right = new Rect(CENTER_X, 0, BITMAP_WIDTH, BITMAP_HEIGHT); local
65 assertTrue(brightness(bitmap, left) > brightness(bitmap, right));
72 left.right = START_X;
74 right.left = END_X;
75 assertEquals(0, brightness(bitmap, right));
85 for (int x = rect.left; x < rect.right; x++) {
|
| /external/chromium_org/third_party/WebKit/Source/platform/ |
| PODRedBlackTree.h | 286 Node* right() const { return m_right; } function in class:blink::PODRedBlackTree::Node
309 // given node based on the values in the left and right children. It
312 // in the left and right children. This method should return true if
339 current = current->right();
353 return treeSearchFullComparisons(current->right(), data);
357 // We may need to traverse both the left and right subtrees.
360 result = treeSearchFullComparisons(current->right(), data);
373 x = x->right();
390 if (x->right())
391 return treeMinimum(x->right());
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| BstNodeTest.java | 18 import static com.google.common.collect.BstSide.RIGHT;
55 testLacksChild(leaf, RIGHT);
62 testLacksChild(node, RIGHT);
69 testChildIs(node, RIGHT, leaf);
74 SimpleNode right = new SimpleNode('c', null, null); local
75 SimpleNode node = new SimpleNode('b', left, right);
77 testChildIs(node, RIGHT, right);
96 for (SimpleNode right : GOOD_RIGHTS) {
98 new SimpleNode(MIDDLE_KEY, left, right).orderingInvariantHolds(Ordering.natural()))
[all...] |
| /external/chromium_org/chrome/common/extensions/docs/examples/extensions/news/css/ |
| options.css | 47 padding-right: 7px;
53 border-bottom-right-radius: 12px 12px;
57 border-top-right-radius: 12px 12px;
67 text-align: right;
73 padding-right: 20px;
76 float: right;
96 float: right;
|
| /external/chromium_org/third_party/WebKit/Source/platform/graphics/ |
| PathTraversalState.cpp | 58 void split(QuadraticBezier& left, QuadraticBezier& right) const
61 right.control = midPoint(control, end);
63 FloatPoint leftControlToRightControl = midPoint(left.control, right.control);
65 right.start = leftControlToRightControl;
68 right.end = end;
70 left.splitDepth = right.splitDepth = splitDepth + 1;
100 void split(CubicBezier& left, CubicBezier& right) const
108 right.control2 = midPoint(control2, end);
109 right.control1 = midPoint(right.control2, startToControl1)
[all...] |
| /external/chromium_org/tools/deep_memory_profiler/visualizer/static/ |
| utility.js | 16 var right = this.length - 1;
17 while (left <= right) {
18 var mid = Math.floor((left + right) / 2);
22 right = mid - 1;
32 * @param {Array.<*>} right
35 var intersectionOfSorted = function(left, right) {
38 var idx = right.indexOf(current, from);
|
| /external/chromium_org/third_party/webrtc/modules/video_render/mac/ |
| video_render_mac_cocoa_impl.mm | 110 const float right,
123 nsOpenGLChannel = _ptrCocoaRender->CreateNSGLChannel(streamId, zOrder, left, top, right, bottom);
145 float& right,
148 return _ptrCocoaRender->GetChannelProperties(streamId, zOrder, left, top, right, bottom);
215 const float right,
225 const float right,
244 const float right,
247 return _ptrCocoaRender->SetText(textId, text, textLength, textColorRef, backgroundColorRef, left, top, right, bottom);
255 const float right,
|
| /external/chromium-trace/trace-viewer/src/ui/ |
| filter_control.css | 16 right: 0.5ex;
17 text-align: right;
31 margin-right: 0;
|
| /external/chromium_org/cc/resources/ |
| layer_tiling_data.cc | 75 int* right,
85 *right = tiling_data_.TileXIndexFromSrcCoord(content_rect.right() - 1);
104 int left, top, right, bottom; local
106 gfx::Rect(tiling_size), &left, &top, &right, &bottom); local
109 if (it->first.first > right || it->first.second > bottom)
|
| /external/chromium_org/chrome/browser/resources/chromeos/first_run/ |
| step_bubble.css | 20 margin-right: 20px;
27 margin-right: 20px;
37 margin-right: 18px;
|
| /external/chromium_org/third_party/polymer/components/core-header-panel/ |
| core-header-panel.css | 18 right: 0;
41 right: 0;
67 right: 0;
|
| /external/chromium_org/third_party/polymer/components-chromium/core-header-panel/ |
| core-header-panel.css | 18 right: 0;
41 right: 0;
67 right: 0;
|
