Searched refs:left (Results 51 - 75 of 2403) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/
H A Daccess-binary-trees.js5 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/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/
H A Daccess-binary-trees.js5 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/chromium_org/third_party/WebKit/Source/platform/
H A DCalculationValue.cpp40 float left = m_leftSide->evaluate(maxValue); local
44 return left + right;
46 return left - right;
48 return left * right;
52 return left / right;
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/mp4/objectdescriptors/
H A DBitWriterBuffer.java20 int left = 8 - position % 8;
21 if (numBits <= left) {
24 current += i << (left - numBits);
28 int bitsSecondWrite = numBits - left;
29 writeBits(i >> bitsSecondWrite, left);
/external/wpa_supplicant_8/hostapd/src/crypto/
H A Daes-ctr.c28 size_t j, len, left = data_len; local
38 while (left > 0) {
41 len = (left < AES_BLOCK_SIZE) ? left : AES_BLOCK_SIZE;
45 left -= len;
/external/wpa_supplicant_8/src/crypto/
H A Daes-ctr.c28 size_t j, len, left = data_len; local
38 while (left > 0) {
41 len = (left < AES_BLOCK_SIZE) ? left : AES_BLOCK_SIZE;
45 left -= len;
/external/wpa_supplicant_8/wpa_supplicant/src/crypto/
H A Daes-ctr.c28 size_t j, len, left = data_len; local
38 while (left > 0) {
41 len = (left < AES_BLOCK_SIZE) ? left : AES_BLOCK_SIZE;
45 left -= len;
/external/chromium_org/chrome/browser/resources/chromeos/first_run/
H A Dbubble.css23 border-left-color: white;
24 left: 100%;
32 .bubble .arrow.points-left {
49 .bubble .arrow.left {
50 left: 12px;
/external/chromium_org/tools/gn/
H A Doperators.cc98 const Token& left,
101 const Value* old_value = scope->GetValue(left.value(), false);
103 if (scope->IsSetButUnused(left.value())) {
110 *err = Err(op_node->left()->GetRange(), "Overwriting unused variable.",
112 left.value().as_string() + "\" that had no effect.");
113 err->AppendSubErr(Err(*scope->GetValue(left.value()),
128 *err = Err(op_node->left()->GetRange(), "Replacing nonempty list.",
138 left.value().as_string() + " = []\nbefore reassigning."));
146 if (right.type() == Value::LIST && left.value() == kSourcesName) {
150 Value* set_value = scope->SetValue(left
96 ExecuteEquals(Scope* scope, const BinaryOpNode* op_node, const Token& left, const Value& right, Err* err) argument
163 ValuePlusEquals(const Scope* scope, const BinaryOpNode* op_node, const Token& left_token, Value* left, const Value& right, bool allow_type_conversion, Err* err) argument
242 ExecutePlusEquals(Scope* scope, const BinaryOpNode* op_node, const Token& left, const Value& right, Err* err) argument
262 ValueMinusEquals(const BinaryOpNode* op_node, Value* left, const Value& right, bool allow_type_conversion, Err* err) argument
298 ExecuteMinusEquals(Scope* scope, const BinaryOpNode* op_node, const Token& left, const Value& right, Err* err) argument
318 ExecutePlus(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) argument
329 ExecuteMinus(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) argument
342 ExecuteEqualsEquals(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) argument
352 ExecuteNotEquals(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) argument
363 FillNeedsTwoIntegersError(const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) argument
374 ExecuteLessEquals(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) argument
384 ExecuteGreaterEquals(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) argument
394 ExecuteGreater(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) argument
404 ExecuteLess(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) argument
416 ExecuteOr(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) argument
431 ExecuteAnd(Scope* scope, const BinaryOpNode* op_node, const Value& left, const Value& right, Err* err) argument
501 ExecuteBinaryOperator(Scope* scope, const BinaryOpNode* op_node, const ParseNode* left, const ParseNode* right, Err* err) argument
[all...]
/external/jmonkeyengine/engine/src/core/com/jme3/scene/control/
H A DBillboardControl.java54 private Vector3f left; field in class:BillboardControl
86 left = new Vector3f();
151 // coopt left for our own purposes.
152 Vector3f xzp = left;
192 // coopt loc for our left direction:
193 left.set(camera.getLeft()).negateLocal();
194 orient.fromAxes(left, camera.getUp(), look);
217 spatial.getParent().getWorldRotation().mult(look, left); // coopt left for our own
219 left
[all...]
/external/chromium_org/chrome/browser/ui/tabs/
H A Dtab_resources.cc17 // Windows and Ash have shadows in the left, right and top parts of the tab.
35 SkScalar left = kTabInset; local
40 // Start in the lower-left corner.
41 path->moveTo(left, bottom);
44 path->lineTo(left + kTabBottomCurveWidth, bottom - kTabBottomCurveWidth);
45 path->lineTo(left + kTabCapWidth - kTabTopCurveWidth,
47 path->lineTo(left + kTabCapWidth, top);
51 path->lineTo(left + kTabCapWidth, 0);
65 path->lineTo(left, bottom);
/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-2073.js41 this.left = null;
57 child.left = this.last;
75 if (parent.tail == this) parent.tail = this.left;
76 if (this.left) this.left.right = this.right;
77 if (this.right) this.right.left = this.left;
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/utils/
H A DPair.java22 private final L left; field in class:Pair
30 public Pair(L left, R right) { argument
31 this.left = left;
66 return left;
78 public static <L, R> Pair<L, R> create(L left, R right) { argument
79 return new Pair<L, R>(left, right);
/external/replicaisland/src/com/replica/replicaisland/
H A DQuickSorter.java44 // quicksort a[left] to a[right]
45 public void quicksort(Type[] a, int left, int right, Comparator<Type> comparator) { argument
46 if (right <= left) return;
47 int i = partition(a, left, right, comparator);
48 quicksort(a, left, i - 1, comparator);
52 // partition a[left] to a[right], assumes left < right
53 private int partition(Type[] a, int left, int right, Comparator<Type> comparator) { argument
54 int i = left - 1;
57 while (comparator.compare(a[++i], a[right]) < 0) { // find item on left t
[all...]
/external/libvpx/libvpx/vp9/common/mips/dspr2/
H A Dvp9_intrapred4_dspr2.c18 const uint8_t *above, const uint8_t *left) {
22 "lb %[tmp1], (%[left]) \n\t"
23 "lb %[tmp2], 1(%[left]) \n\t"
24 "lb %[tmp3], 2(%[left]) \n\t"
25 "lb %[tmp4], 3(%[left]) \n\t"
40 : [left] "r" (left), [dst] "r" (dst), [stride] "r" (stride)
45 const uint8_t *above, const uint8_t *left) {
52 "lw %[left_c], (%[left]) \n\t"
81 : [above] "r" (above), [left] "
17 vp9_h_predictor_4x4_dspr2(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument
44 vp9_dc_predictor_4x4_dspr2(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument
86 vp9_tm_predictor_4x4_dspr2(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkTSort.h121 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { argument
122 for (T* next = left + 1; next <= right; ++next) {
125 while (left < hole && lessThan(insert, *(hole - 1))) {
136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { argument
139 T* newPivot = left;
140 while (left < right) {
141 if (lessThan(*left, pivotValue)) {
142 SkTSwap(*left, *newPivot);
145 left += 1;
154 * This implementation recurses on the left regio
163 SkTIntroSort(int depth, T* left, T* right, C lessThan) argument
191 SkTQSort(T* left, T* right, C lessThan) argument
201 SkTQSort(T* left, T* right) argument
206 SkTQSort(T** left, T** right) argument
[all...]
/external/chromium_org/tools/telemetry/telemetry/page/actions/
H A Dgesture_common.js13 left: bound.left,
17 var outsideWidth = (rect.left + rect.width) - window.innerWidth;
/external/clang/www/analyzer/
H A Dmenu.css4 clear: left;
25 text-align: left;
29 float: left;
38 left: 0;
41 border-left: 1px solid;
46 left:auto;
/external/jsilver/src/com/google/clearsilver/jsilver/functions/numeric/
H A DMaxFunction.java35 Value left = args[0];
37 return literalConstant(max(left.asNumber(), right.asNumber()), left, right);
H A DMinFunction.java35 Value left = args[0];
37 return literalConstant(min(left.asNumber(), right.asNumber()), left, right);
/external/jsilver/src/com/google/clearsilver/jsilver/functions/operators/
H A DAndFunction.java29 Value left = args[0];
31 return literalConstant(left.asBoolean() && right.asBoolean(), left, right);
H A DDivideFunction.java29 Value left = args[0];
31 return literalConstant(left.asNumber() / right.asNumber(), left, right);
H A DEqualFunction.java29 Value left = args[0];
31 return literalConstant(left.equals(right), left, right);
H A DGreaterFunction.java29 Value left = args[0];
31 return literalConstant(left.asNumber() > right.asNumber(), left, right);
H A DGreaterOrEqualFunction.java29 Value left = args[0];
31 return literalConstant(left.asNumber() >= right.asNumber(), left, right);

Completed in 4765 milliseconds

1234567891011>>