| /external/apache-xml/src/main/java/org/apache/xpath/operations/ |
| 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/remoting/webapp/ |
| connection_stats.css | 8 left: 0;
|
| /external/chromium_org/sync/internal_api/ |
| syncapi_internal.h | 37 const sync_pb::EntitySpecifics& left,
40 // Return true iff |left| and |right| are equal.
41 bool AreAttachmentMetadataEqual(const sync_pb::AttachmentMetadata& left,
|
| /external/chromium_org/third_party/webrtc/modules/audio_coding/neteq/tools/ |
| audio_sink.h | 47 AudioSinkFork(AudioSink* left, AudioSink* right)
48 : left_sink_(left), right_sink_(right) {}
|
| /external/chromium_org/third_party/webrtc/modules/video_render/linux/ |
| video_x11_render.h | 36 const float left,
45 float& left, float& top,
|
| /external/chromium_org/third_party/webrtc/voice_engine/ |
| voe_volume_control_impl.h | 48 virtual int SetOutputVolumePan(int channel, float left, float right);
50 virtual int GetOutputVolumePan(int channel, float& left, float& right);
|
| /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/chromium_org/third_party/polymer/components/paper-checkbox/ |
| paper-checkbox.css | 36 left: -15px;
50 left: 0px;
69 left: 0px;
76 left: 5px;
86 left: 0px;
93 left: 5px;
100 border-left: none;
110 left: 5px;
117 left: 6px;
129 left: 5px
[all...] |
| /external/chromium_org/third_party/polymer/components-chromium/paper-checkbox/ |
| paper-checkbox.css | 36 left: -15px;
50 left: 0px;
69 left: 0px;
76 left: 5px;
86 left: 0px;
93 left: 5px;
100 border-left: none;
110 left: 5px;
117 left: 6px;
129 left: 5px
[all...] |
| /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/chromium_org/third_party/WebKit/Source/platform/geometry/ |
| IntRect.cpp | 65 int left = std::max(x(), other.x()); local
71 if (left >= right || top >= bottom) {
72 left = 0;
78 m_location.setX(left);
80 m_size.setWidth(right - left);
94 int left = std::min(x(), other.x()); local
99 m_location.setX(left);
101 m_size.setWidth(right - left);
115 int left = std::min(x(), other.x()); local
120 m_location.setX(left);
[all...] |
| /external/chromium_org/third_party/webrtc/modules/video_render/android/java/src/org/webrtc/videoengine/ |
| ViESurfaceRenderer.java | 55 dstRect.right = (int)(dstRect.left + dstRightScale * dstWidth);
67 " srcRect.left:" + srcRect.left +
71 " dstRect.left:" + dstRect.left +
82 changeDestRect(dst.right - dst.left, dst.bottom - dst.top);
84 " dst.left:" + dst.left +
88 " srcRect.left:" + srcRect.left
[all...] |
| /external/chromium_org/third_party/WebKit/Source/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(); variable
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...] |
| /external/chromium_org/third_party/polymer/components/core-drawer-panel/ |
| core-drawer-panel.css | 14 left: 0;
23 left: 0;
38 left: auto;
51 left: 0;
66 transition: left ease-in-out 0.3s, padding ease-in-out 0.3s;
70 left: 0;
87 left: 0;
116 left: auto;
122 left: 0 !important;
127 left: 0
[all...] |
| /external/chromium_org/third_party/polymer/components-chromium/core-drawer-panel/ |
| core-drawer-panel.css | 14 left: 0;
23 left: 0;
38 left: auto;
51 left: 0;
66 transition: left ease-in-out 0.3s, padding ease-in-out 0.3s;
70 left: 0;
87 left: 0;
116 left: auto;
122 left: 0 !important;
127 left: 0
[all...] |
| /external/chromium_org/ui/file_manager/video_player/css/ |
| video_player.css | 16 left: 0;
33 left: 0;
46 left: 0;
59 left: 50%;
60 margin-left: -16px;
69 left: 0;
82 left: 0;
96 left: 40px;
124 left: 0;
152 left: 0
[all...] |
| /external/chromium_org/ui/login/ |
| bubble.css | 34 left: 17px;
42 html[dir=rtl] .bubble-left::before {
44 left: -16px;
54 left: 17px;
61 html[dir=ltr] .bubble-left::before,
82 left: 17px;
90 html[dir=rtl] .bubble-left::after {
92 left: -15px;
102 left: 17px;
109 html[dir=ltr] .bubble-left::after
[all...] |
| /external/e2fsprogs/e2fsck/ |
| dict.c | 51 #define left dict_left macro
69 #define dict_root(D) ((D)->nilnode.left)
77 * Perform a ``left rotation'' adjustment on the tree. The given node P and
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
88 upper->right = lowleft = lower->left;
94 the sentinel nil node, and root->parent->left points back to root */
96 if (upper == upparent->left) {
97 upparent->left = lower;
103 lower->left = upper
861 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *left; local
895 dnode_t *nil = dict_nil(dict), *parent, *left; local
[all...] |
| /external/chromium_org/ui/webui/resources/js/cr/ui/ |
| position_util.js | 13 * @typedef {{left: number, top: number, width: number, height: number,
24 * The popup's right edge is aligned with the left edge of the anchor.
27 BEFORE: 1, // p: right, a: left, p: top, a: top
30 * The popop's left edge is aligned with the right edge of the anchor.
33 AFTER: 2, // p: left a: right, p: top, a: top
37 * The popup's left edge is aligned with the left edge of the anchor.
39 ABOVE: 3, // p: bottom, a: top, p: left, a: left
43 * The popup's left edge is aligned with the left edge of the anchor
[all...] |
| /cts/tests/tests/view/src/android/view/cts/ |
| GravityTest.java | 52 assertEquals(19, mOutRect.left);
57 assertEquals(24, mOutRect.left);
62 assertEquals(19, mOutRect.left);
67 assertEquals(19, mOutRect.left);
73 assertEquals(19, mOutRect.left);
78 assertEquals(24, mOutRect.left);
83 assertEquals(19, mOutRect.left);
88 assertEquals(19, mOutRect.left);
93 Gravity.apply(Gravity.LEFT, 2, 10, mInRect, mOutRect);
94 assertEquals(10, mOutRect.left);
[all...] |
| /external/opencv/cv/src/ |
| cvutils.cpp | 113 int top, int left, int cn, const uchar* )
118 if( srcstep == dststep && dst + dststep*top + left*cn == src &&
132 return ifunc( src, srcstep, srcroi, dstroi, top, left );
147 return func( src, srcstep, srcroi, dst, dststep, dstroi, top, left );
161 left *= cn;
165 if( idst + left != isrc )
167 idst[j + left] = isrc[j];
168 for( j = left - 1; j >= 0; j-- )
170 for( j = left+srcroi.width; j < dstroi.width; j++ )
180 left *= cn
[all...] |
