Searched refs:left (Results 201 - 225 of 2403) sorted by relevance

1234567891011>>

/external/guava/guava/src/com/google/common/collect/
H A DNaturalOrdering.java34 @Override public int compare(Comparable left, Comparable right) { argument
35 checkNotNull(left); // for GWT
37 if (left == right) {
41 return left.compareTo(right);
H A DNullsFirstOrdering.java34 @Override public int compare(@Nullable T left, @Nullable T right) { argument
35 if (left == right) {
38 if (left == null) {
44 return ordering.compare(left, right);
H A DNullsLastOrdering.java34 @Override public int compare(@Nullable T left, @Nullable T right) { argument
35 if (left == right) {
38 if (left == null) {
44 return ordering.compare(left, right);
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;
/external/hyphenation/
H A Dsubstrings.c27 int left=0, right=max-1; local
28 while (left <= right) {
29 int mid = ((right-left)/2)+left;
32 left = mid + 1;
63 int left,
70 p = left;
71 for (i=left; i<right; i++) {
87 int left,
90 while (right > left) {
60 partition( char *a[], char *b[], int left, int right, int p ) argument
84 qsort_arr( char *a[], char *b[], int left, int right ) argument
[all...]
/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/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/skia/src/core/
H A DSkBlitter_Sprite.cpp21 void SkSpriteBlitter::setup(const SkBitmap& device, int left, int top, argument
24 fLeft = left;
55 int left, int top,
60 a bit of a hack, since we "could" pass in the fractional left/top for the bitmap,
84 blitter->setup(device, left, top, paint);
52 ChooseSprite( const SkBitmap& device, const SkPaint& paint, const SkBitmap& source, int left, int top, void* storage, size_t storageSize) argument
H A DSkRect.cpp12 void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) { argument
14 if (left >= right || top >= bottom) {
20 this->set(left, top, right, bottom);
22 if (left < fLeft) fLeft = left;
133 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, argument
135 if (left < right && top < bottom && !this->isEmpty() && // check for empties
136 fLeft < right && left < fRight && fTop < bottom && top < fBottom)
138 if (fLeft < left) fLeft = left;
167 join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) argument
[all...]
/external/chromium_org/chrome/browser/resources/chromeos/
H A Dkeyboard_overlay.js10 left: 0,
17 left: 370,
55 37: 'left',
406 // Currently there is no way to identify whether the left shift or the
407 // right shift is preesed from the key event, so I assume the left shift
409 // 'Shift - Shift' (Toggle caps lock) on the left shift key, the
444 if (format == 'left' || format == 'right') {
473 keys['3A'] = {label: 'caps lock', format: 'left'};
476 keys['DISABLED'] = {label: 'disabled', format: 'left'};
499 key.style.left
[all...]
/external/chromium-trace/trace-viewer/src/cc/
H A Dpicture_debugger.css18 picture-debugger > left-panel {
23 picture-debugger > left-panel > picture-info {
28 picture-debugger > left-panel > picture-info > .title {
30 margin-left: 5px;
40 margin-left: 5px;
/external/chromium_org/remoting/webapp/
H A Dmenu_button.css14 left: 1px;
23 background-image: -webkit-gradient(linear, left top, left bottom,
32 margin-left: 7px;
65 background-position: left center;
/external/chromium_org/tools/deep_memory_profiler/visualizer/static/
H A Dindex.css34 float: left;
40 float: left;
41 margin-left: 50px;
54 padding-left: 15px;
66 padding-left: 15px;
/external/chromium_org/ui/views/
H A Dborder.cc20 SidedSolidBorder(int top, int left, int bottom, int right, SkColor color);
35 int left,
40 insets_(top, left, bottom, right) {
47 canvas->FillRect(gfx::Rect(0, 0, insets_.left(), view.height()), color_);
77 EmptyBorder(int top, int left, int bottom, int right) argument
78 : insets_(top, left, bottom, right) {}
141 Border* Border::CreateEmptyBorder(int top, int left, int bottom, int right) { argument
142 return new EmptyBorder(top, left, bottom, right);
147 int left,
151 return new SidedSolidBorder(top, left, botto
34 SidedSolidBorder(int top, int left, int bottom, int right, SkColor color) argument
146 CreateSolidSidedBorder(int top, int left, int bottom, int right, SkColor color) argument
[all...]
/external/zlib/src/
H A Dinftrees.c46 int left; /* number of prefix codes available */ local
131 left = 1;
133 left <<= 1;
134 left -= count[len];
135 if (left < 0) return -1; /* over-subscribed */
137 if (left > 0 && (type == CODES || max != 1))
270 left = (int)(1 << curr);
272 left -= count[curr + drop];
273 if (left <= 0) break;
275 left <<
[all...]
/external/chromium_org/chrome/browser/resources/downloads/
H A Ddownloads.css15 float: left;
25 float: left;
46 float: left;
80 left: -110px;
86 left: auto;
100 left: 9px;
107 left: auto;
121 background-position: left bottom;
135 left: 0;
142 left
[all...]
/external/dropbear/libtomcrypt/src/misc/pkcs5/
H A Dpkcs_5_2.c38 unsigned long stored, left, x, y; local
66 left = *outlen;
69 while (left != 0) {
104 for (y = 0; y < x && left != 0; ++y) {
106 --left;
/external/qemu/distrib/sdl-1.2.15/src/video/bwindow/
H A DSDL_BView.h65 bounds.top = bounds.left = 0;
89 dest.left = updateRect.left + xoff;
102 dest.left = updateRect.left + xoff;
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
H A DDESEngine.java408 int work, right, left;
410 left = (in[inOff + 0] & 0xff) << 24;
411 left |= (in[inOff + 1] & 0xff) << 16;
412 left |= (in[inOff + 2] & 0xff) << 8;
413 left |= (in[inOff + 3] & 0xff);
420 work = ((left >>> 4) ^ right) & 0x0f0f0f0f;
422 left ^= (work << 4);
423 work = ((left >>> 16) ^ right) & 0x0000ffff;
425 left ^= (work << 16);
426 work = ((right >>> 2) ^ left)
[all...]
/external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/crypto/cipher/
H A DDES.java285 int work, right, left;
287 left = (in[inOff + 0] & 0xff) << 24;
288 left |= (in[inOff + 1] & 0xff) << 16;
289 left |= (in[inOff + 2] & 0xff) << 8;
290 left |= (in[inOff + 3] & 0xff);
297 work = ((left >>> 4) ^ right) & 0x0f0f0f0f;
299 left ^= (work << 4);
300 work = ((left >>> 16) ^ right) & 0x0000ffff;
302 left ^= (work << 16);
303 work = ((right >>> 2) ^ left)
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkRect.cpp12 void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) { argument
14 if (left >= right || top >= bottom) {
20 this->set(left, top, right, bottom);
22 if (left < fLeft) fLeft = left;
133 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, argument
135 if (left < right && top < bottom && !this->isEmpty() && // check for empties
136 fLeft < right && left < fRight && fTop < bottom && top < fBottom)
138 if (fLeft < left) fLeft = left;
167 join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) argument
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DBstTesting.java39 SimpleNode(Character key, @Nullable SimpleNode left, @Nullable SimpleNode right) { argument
40 super(key, left, right);
68 SimpleNode source, @Nullable SimpleNode left, @Nullable SimpleNode right) {
69 return new SimpleNode(source.getKey(), left, right);
76 @Nullable SimpleNode left, @Nullable SimpleNode right) {
77 return checkNotNull(nodeFactory).createNode(source, left, right);
82 public SimpleNode combine(BstNodeFactory<SimpleNode> nodeFactory, @Nullable SimpleNode left,
84 // Shove right into the rightmost position in the left tree.
85 if (left == null) {
88 return left;
[all...]
/external/libvpx/mips-dspr2/
H A Dvp9_rtcd.h27 void vp9_d207_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left);
30 void vp9_d45_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left);
33 void vp9_d63_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left);
36 void vp9_h_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left);
37 void vp9_h_predictor_4x4_dspr2(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left);
40 void vp9_d117_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left);
43 void vp9_d135_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left);
46 void vp9_d153_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left);
49 void vp9_v_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left);
52 void vp9_tm_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left);
[all...]
/external/zlib/src/examples/
H A Dgzappend.c122 /* rotate list[0..len-1] left by rot positions, in place */
137 /* do simple left shift by one */
163 *to = *from; /* shift left */
173 unsigned left; /* bytes available at next */ member in struct:__anon29820
186 in->left = (unsigned)len;
198 #define read1(in) (in->left == 0 ? readmore(in) : 0, \
199 in->left--, *(in->next)++)
206 if (n > in->left) {
207 n -= in->left;
215 if (n > in->left)
261 int ret, lastbit, left, full; local
391 unsigned left; local
[all...]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/
H A Dclosebrackets.js40 for (var i = 0; i < pairs.length; i += 2) (function(left, right) {
41 if (left != right) closingBrackets += right;
44 cm.replaceSelection(left + selection + right);
51 map["'" + left + "'"] = function(cm) {
52 if (left == "'" && cm.getTokenAt(cm.getCursor()).type == "comment")
55 if (left == right && maybeOverwrite(cm) != CodeMirror.Pass) return;
58 if (left == right && CodeMirror.isWordChar(curChar))
61 cm.replaceSelection(left + right, {head: ahead, anchor: ahead});
65 if (left != right) map["'" + right + "'"] = maybeOverwrite;

Completed in 911 milliseconds

1234567891011>>