Searched defs:left (Results 51 - 75 of 1217) sorted by relevance

1234567891011>>

/external/chromium_org/ui/file_manager/file_manager/foreground/js/
H A Ddrag_selector.js88 x: event.clientX - rect.left + element.scrollLeft,
123 this.border_.style.left = this.startX_ + 'px';
151 left: Math.max(Math.min(this.startX_, pos.x), 0),
156 borderBounds.width = borderBounds.right - borderBounds.left;
161 borderBounds.left,
218 this.border_.style.left = borderBounds.left + 'px';
/external/chromium_org/ui/metro_viewer/
H A Dime_types.h41 int32 left; member in struct:metro_viewer::CharacterBounds
/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/eigen/bench/btl/libs/BLAS/
H A Dblas_interface.hh62 static char left = 'L'; variable
/external/guava/guava/src/com/google/common/collect/
H A DBstBalancePolicy.java32 * 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); argument
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); argument
H A DBstNode.java46 * The key on which this binary search tree is ordered. All descendants of the left subtree of
52 * The left child of this node. A null value indicates that this node has no left child.
55 private final N left; field in class:BstNode
63 BstNode(@Nullable K key, @Nullable N left, @Nullable N right) { argument
65 this.left = left;
84 return left;
H A DByFunctionOrdering.java45 @Override public int compare(F left, F right) { argument
46 return ordering.compare(function.apply(left), function.apply(right));
H A DComparisonChain.java67 Comparable left, Comparable right) {
68 return classify(left.compareTo(right));
71 @Nullable T left, @Nullable T right, Comparator<T> comparator) {
72 return classify(comparator.compare(left, right));
74 @Override public ComparisonChain compare(int left, int right) {
75 return classify(Ints.compare(left, right));
77 @Override public ComparisonChain compare(long left, long right) {
78 return classify(Longs.compare(left, right));
80 @Override public ComparisonChain compare(float left, float right) {
81 return classify(Float.compare(left, righ
107 compare( @ullable Comparable left, @Nullable Comparable right) argument
111 compare(@ullable T left, @Nullable T right, @Nullable Comparator<T> comparator) argument
115 compare(int left, int right) argument
118 compare(long left, long right) argument
121 compare(float left, float right) argument
124 compare(double left, double right) argument
127 compare(boolean left, boolean right) argument
140 compare( Comparable<?> left, Comparable<?> right) argument
147 compare( @ullable T left, @Nullable T right, Comparator<T> comparator) argument
155 compare(int left, int right) argument
162 compare(long left, long right) argument
169 compare(float left, float right) argument
176 compare(double left, double right) argument
183 compare(boolean left, boolean right) argument
[all...]
H A DUsingToStringOrdering.java29 @Override public int compare(Object left, Object right) { argument
30 return left.toString().compareTo(right.toString());
/external/guava/guava-tests/test/com/google/common/collect/
H A DAbstractBstBalancePolicyTest.java41 private SimpleNode balanceNew(char c, @Nullable SimpleNode left, @Nullable SimpleNode right) { argument
42 return getBalancePolicy().balance(nodeFactory, new SimpleNode(c, null, null), left, right);
/external/javassist/src/main/javassist/compiler/ast/
H A DPair.java25 protected ASTree left, right; field in class:Pair
28 left = _left;
37 sbuf.append(left == null ? "<null>" : left.toString());
44 public ASTree getLeft() { return left; }
48 public void setLeft(ASTree _left) { left = _left; }
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_treewriter.c37 unsigned int left, right; local
40 left = num_events[-tree[i]];
42 left = convert_distribution(tree[i], tree, branch_ct, num_events);
49 branch_ct[i >> 1][0] = left;
51 return left + right;
/external/lzma/CPP/7zip/Archive/Common/
H A DMultiStream.cpp17 int left = 0, mid = _streamIndex, right = Streams.Size(); local
24 left = mid + 1;
30 mid = (left + right) / 2;
/external/lzma/CPP/7zip/Common/
H A DFilePathAutoRename.cpp45 unsigned left = 1, right = (1 << 30); local
46 while (left != right)
48 unsigned mid = (left + right) / 2;
50 left = mid + 1;
/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/robolectric/src/main/java/com/xtremelabs/robolectric/matchers/
H A DHasCompoundDrawablesMatcher.java16 public HasCompoundDrawablesMatcher(int left, int top, int right, int bottom) { argument
17 expectedCompoundDrawables = new ShadowTextView.CompoundDrawables(left, top, right, bottom);
42 public static Matcher<TextView> hasCompoundDrawables(int left, int top, int right, int bottom) { argument
43 return new HasCompoundDrawablesMatcher(left, top, right, bottom);
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowMarginLayoutParams.java20 public void setMargins(int left, int top, int right, int bottom) { argument
21 realMarginLayoutParams.leftMargin = left;
/external/skia/experimental/Intersection/
H A DActiveEdge_Test.cpp22 // left top higher
27 // left top lower
33 // left bottom higher
38 // left bottom lower
70 UnitTest::ActiveEdge left, right; local
71 left.fWorkEdge.fEdge = &leftIn;
74 left.fAbove = leftRight[x][0];
75 left.fTangent = left.fBelow = leftRight[x][1];
78 SkASSERT(left < righ
[all...]
H A DTSearch.h13 static T* QSort_Partition(T* left, T* right, T* pivot) argument
17 T* newPivot = left;
18 while (left < right) {
19 if (*left < pivotValue) {
20 SkTSwap(*left, *newPivot);
23 left += 1;
30 void QSort(T* left, T* right) argument
32 if (left >= right) {
35 T* pivot = left + (right - left >>
42 QSort_Partition(T** left, T** right, T** pivot) argument
59 QSort(T** left, T** right) argument
71 QSort_Partition(S& context, T* left, T* right, T* pivot, bool (*lessThan)(S&, const T, const T)) argument
89 QSort(S& context, T* left, T* right, bool (*lessThan)(S& , const T, const T)) argument
[all...]
/external/skia/src/svg/
H A DSkSVGCircle.cpp30 SkScalar left, top, right, bottom; local
31 left = cx - r;
36 sprintf(scratch, "%g", SkScalarToDouble(left));
37 parser._addAttribute("left", scratch);
H A DSkSVGEllipse.cpp32 SkScalar left, top, right, bottom; local
33 left = cx - rx;
38 sprintf(scratch, "%g", SkScalarToDouble(left));
39 parser._addAttribute("left", scratch);
/external/smali/util/src/main/java/org/jf/util/
H A DTwoColumnOutput.java42 * output writers, one of which ends up writing to the left column and
49 /** &gt; 0; the left column width */
60 * @param leftWidth &gt; 0; width of the left column, in characters
85 * @param leftWidth &gt;= 1; width of the left column, in characters
96 public void write(String left, String right) throws IOException { argument
97 leftLines = StringWrapper.wrapString(left, leftWidth, leftLines);
/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;

Completed in 410 milliseconds

1234567891011>>