/external/robolectric/src/main/java/com/xtremelabs/robolectric/matchers/ |
H A D | HasCompoundDrawablesMatcher.java | 16 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/e2fsprogs/e2fsck/ |
H A D | 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) { 426 dict_similar(const dict_t *left, const dict_t *right) argument 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/printing/ |
H A D | 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/third_party/WebKit/Source/devtools/front_end/cm/ |
H A D | closebrackets.js | 40 for (var i = 0; i < pairs.length; i += 2) (function(left, right) { 41 if (left != right) closingBrackets += right; 44 cm.replaceSelection(left + selection + right); 48 if (ahead != right || cm.somethingSelected()) return CodeMirror.Pass; 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 [all...] |
/external/chromium_org/third_party/WebKit/Tools/GardeningServer/styles/ |
H A D | onebar.css | 39 border-right: none; 45 float: right; 47 margin-right: 8px; 67 right: 5px; 76 padding-right: 2px;
|
/external/chromium_org/tools/code_coverage/ |
H A D | croc.css | 27 padding-right:10px; 55 text-align:right; 65 text-align:right; 69 text-align:right; 73 text-align:right;
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | BstNode.java | 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) { argument 66 this.right = right; 86 return right;
|
/external/qemu/distrib/sdl-1.2.15/src/video/bwindow/ |
H A D | SDL_BView.h | 66 bounds.right = width; 91 dest.right = updateRect.right + xoff; 104 dest.right = updateRect.right + xoff;;
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
H A D | DESEngine.java | 408 int work, right, left; 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 >>> [all...] |
/external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/crypto/cipher/ |
H A D | DES.java | 285 int work, right, left; 292 right = (in[inOff + 4] & 0xff) << 24; 293 right |= (in[inOff + 5] & 0xff) << 16; 294 right |= (in[inOff + 6] & 0xff) << 8; 295 right |= (in[inOff + 7] & 0xff); 297 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; 298 right ^= work; 300 work = ((left >>> 16) ^ right) & 0x0000ffff; 301 right ^= work; 303 work = ((right >>> [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkRect.cpp | 12 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); 24 if (right > fRight) fRight = right; 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) 140 if (fRight > right) fRight = right; 167 join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) argument [all...] |
/external/hyphenation/ |
H A D | substrings.c | 27 int left=0, right=max-1;
local 28 while (left <= right) {
29 int mid = ((right-left)/2)+left;
34 right = mid -1;
64 int right,
69 swap2(a,b,p,right); // Move pivot to end
71 for (i=left; i<right; i++) {
77 swap2(a,b,right,p); // Move pivot to its final place
88 int right
90 while (right > lef 60 partition( char *a[], char *b[], int left, int right, int p ) argument [all...] |
/external/skia/src/core/ |
H A D | SkRect.cpp | 12 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); 24 if (right > fRight) fRight = right; 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) 140 if (fRight > right) fRight = right; 167 join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) argument [all...] |
/external/dropbear/libtomcrypt/src/ciphers/ |
H A D | kasumi.c | 103 u16 left, right; local 107 right = (u16) in&0xFFFF; 112 left ^= right; 114 right ^= key->kasumi.KOi2[round_no]; 115 right = FI( right, key->kasumi.KIi2[round_no] ); 116 right ^= left; 120 left ^= right; 122 return (((ulong32)right)<<16)+left; 128 /* split out the left and right halve 143 ulong32 left, right, temp; local 170 ulong32 left, right, temp; local [all...] |
/external/chromium_org/cc/resources/ |
H A D | layer_tiling_data.cc | 72 int* right, 82 *right = tiling_data_.TileXIndexFromSrcCoord(content_rect.right() - 1); 98 int left, top, right, bottom; local 99 ContentRectToTileIndices(content_rect, &left, &top, &right, &bottom); 101 for (int i = left; i <= right; ++i) { 123 int left, top, right, bottom; local 125 gfx::Rect(size), &left, &top, &right, &bottom); local 128 if (it->first.first > right || it->first.second > bottom) 69 ContentRectToTileIndices(gfx::Rect content_rect, int* left, int* top, int* right, int* bottom) const argument
|
/external/chromium_org/third_party/WebKit/Source/core/platform/ |
H A D | PODRedBlackTree.h | 286 Node* right() const { return m_right; } function in class:WebCore::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/ |
H A D | BstNodeTest.java | 74 SimpleNode right = new SimpleNode('c', null, null); 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())); 105 for (SimpleNode right : ALL_RIGHTS) { 107 new SimpleNode(MIDDLE_KEY, left, right).orderingInvariantHolds(Ordering.natural())); 114 for (SimpleNode right : BAD_RIGHTS) { 116 new SimpleNode(MIDDLE_KEY, left, right).orderingInvariantHolds(Ordering.natural()));
|
/external/chromium/chrome/common/extensions/docs/examples/extensions/news/css/ |
H A D | 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/chrome/common/extensions/docs/examples/extensions/news/css/ |
H A D | 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/devtools/front_end/ |
H A D | splitView.css | 34 right: 0; 59 right: 0; 63 right: 0; 72 right: 0; 92 border-right: 1px solid rgb(64%, 64%, 64%); 119 right: 0; 132 border-right: 1px solid gray;
|
/external/chromium_org/ui/keyboard/resources/webui/ |
H A D | main.css | 45 padding-right: 10px; 47 right: 0; 55 right: 7%; 79 right: 0; 84 /* Left and right-side special keys with a character letter next to them need 89 margin-right: 2px; 92 kb-shift-key.padded-right-special, 93 kb-key.padded-right-special { 133 .right-more { 150 .right [all...] |
/external/linux-tools-perf/util/ |
H A D | sort.c | 102 sort__thread_cmp(struct hist_entry *left, struct hist_entry *right) argument 104 return right->thread->pid - left->thread->pid; 144 sort__dso_cmp(struct hist_entry *left, struct hist_entry *right) argument 147 struct dso *dso_r = right->ms.map ? right->ms.map->dso : NULL; 179 sort__sym_cmp(struct hist_entry *left, struct hist_entry *right) argument 183 if (left->ms.sym == right->ms.sym) 187 ip_r = right->ms.sym ? right->ms.sym->start : right 217 sort__comm_cmp(struct hist_entry *left, struct hist_entry *right) argument 223 sort__comm_collapse(struct hist_entry *left, struct hist_entry *right) argument 237 sort__parent_cmp(struct hist_entry *left, struct hist_entry *right) argument 258 sort__cpu_cmp(struct hist_entry *left, struct hist_entry *right) argument [all...] |
/external/chromium/chrome/browser/resources/gpu_internals/ |
H A D | timeline.css | 33 padding-right: 5px; 40 text-align: right; 43 padding-right: 5px;
|
/external/chromium-trace/trace-viewer/src/ui/ |
H A D | filter_control.css | 16 right: 0.5ex; 17 text-align: right; 31 margin-right: 0;
|
/external/chromium_org/chrome/browser/resources/chromeos/ |
H A D | wrench_menu.css | 31 .right-button { 33 border-bottom-right-radius: 3px; 34 border-top-right-radius: 3px;
|