/external/junit/src/junit/runner/ |
H A D | Sorter.java | 12 public void swap(Vector values, int left, int right); argument 15 public static void sortStrings(Vector values , int left, int right, Swapper swapper) { argument 16 int oleft= left; 18 String mid= (String)values.elementAt((left + right) / 2); 20 while (((String)(values.elementAt(left))).compareTo(mid) < 0) 21 left++; 24 if (left <= right) { 25 swapper.swap(values, left, right); 26 left++; 29 } while (left < [all...] |
/external/guava/src/com/google/common/collect/ |
H A D | ComparisonChain.java | 66 Comparable left, Comparable right) { 67 return classify(left.compareTo(right)); 70 @Nullable T left, @Nullable T right, Comparator<T> comparator) { 71 return classify(comparator.compare(left, right)); 73 @Override public ComparisonChain compare(int left, int right) { 74 return classify(Ints.compare(left, right)); 76 @Override public ComparisonChain compare(long left, long right) { 77 return classify(Longs.compare(left, right)); 79 @Override public ComparisonChain compare(float left, float right) { 80 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 D | UsingToStringOrdering.java | 29 public int compare(Object left, Object right) { argument 30 return left.toString().compareTo(right.toString());
|
/external/v8/test/mjsunit/regress/ |
H A D | regress-1439135.js | 30 var left = "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX"; 33 var cons = left + right;
|
/external/guava/src/com/google/common/io/ |
H A D | LimitInputStream.java | 33 private long left; field in class:LimitInputStream 46 left = limit; 50 return (int) Math.min(in.available(), left); 55 mark = left; 60 if (left == 0) { 66 --left; 72 if (left == 0) { 76 len = (int) Math.min(len, left); 79 left -= result; 93 left [all...] |
/external/v8/tools/ |
H A D | splaytree.js | 86 node.left = this.root_; 91 node.left = this.root_.left; 92 this.root_.left = null; 115 if (!this.root_.left) { 119 this.root_ = this.root_.left; 154 while (current.left) { 155 current = current.left; 188 // the left subtree. 191 } else if (this.root_.left) { [all...] |
H A D | splaytree.py | 35 self.left = None 72 node.left = self.root 77 node.left = self.root.left 78 self.root.left = None 93 if not self.root.left: 94 # No left child, so the new tree is just the right child. 99 # Make the original left child the new root. 100 self.root = self.root.left 131 while current.left ! [all...] |
/external/icu4c/common/ |
H A D | uarrsort.h | 30 * @param left Pointer to the "left" item. 33 * <0 if left<right 34 * ==0 if left==right 35 * >0 if left>right 40 UComparator(const void *context, const void *left, const void *right); 68 uprv_uint16Comparator(const void *context, const void *left, const void *right); 75 uprv_int32Comparator(const void *context, const void *left, const void *right); 82 uprv_uint32Comparator(const void *context, const void *left, const void *right);
|
H A D | uarrsort.c | 31 uprv_uint16Comparator(const void *context, const void *left, const void *right) { argument 32 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; 36 uprv_int32Comparator(const void *context, const void *left, const void *right) { argument 37 return *(const int32_t *)left - *(const int32_t *)right; 41 uprv_uint32Comparator(const void *context, const void *left, const void *right) { argument 42 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; 123 int32_t left, right; local 125 /* start and left are inclusive, limit and right are exclusive */ 132 left=start; 139 while(/* array[left]< [all...] |
/external/v8/benchmarks/ |
H A D | splay.js | 57 left: GeneratePayloadTree(depth - 1, key), 172 node.left = this.root_; 177 node.left = this.root_.left; 178 this.root_.left = null; 201 if (!this.root_.left) { 205 this.root_ = this.root_.left; 244 // the left subtree. 247 } else if (this.root_.left) { 248 return this.findMax(this.root_.left); [all...] |
/external/webkit/SunSpider/tests/v8-v4/ |
H A D | v8-splay.js | 52 left: GeneratePayloadTree(depth - 1, key), 167 node.left = this.root_; 172 node.left = this.root_.left; 173 this.root_.left = null; 196 if (!this.root_.left) { 200 this.root_ = this.root_.left; 239 // the left subtree. 242 } else if (this.root_.left) { 243 return this.findMax(this.root_.left); [all...] |
/external/webkit/WebCore/platform/graphics/win/ |
H A D | IntRectWin.cpp | 35 : m_location(IntPoint(r.left, r.top)), m_size(IntSize(r.right-r.left, r.bottom-r.top))
|
/external/webkit/SunSpider/tests/sunspider-0.9/ |
H A D | access-binary-trees.js | 5 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/webkit/SunSpider/tests/sunspider-0.9.1/ |
H A D | access-binary-trees.js | 5 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/opencore/oscl/oscl/osclbase/src/ |
H A D | oscl_tree.cpp | 23 x->right = y->left; 24 if (y->left != 0) 25 y->left->parent = x; 30 else if (x == x->parent->left) 31 x->parent->left = y; 34 y->left = x; 40 base_link_type y = x->left; 41 x->left = y->right; 51 x->parent->left = y; 61 if (x->parent == x->parent->parent->left) [all...] |
/external/elfcopy/ |
H A D | rangesort.c | 52 static inline int INTERSECT(range_t *left, range_t *right) { argument 54 (IN_RANGE(left, right->start) && 55 IN_RANGE(right, left->start + left->length)) || 56 (IN_RANGE(right, left->start) && 57 IN_RANGE(left, right->start + right->length)); 61 range_t *left = (range_t *)l, *right = (range_t *)r; local 62 if (INTERSECT(left, right) || 63 CONTAINS(left, right) || 64 CONTAINS(right, left)) { 80 range_t *left = (range_t *)l, *right = (range_t *)r; local 106 range_t *left = (range_t *)l, *right = (range_t *)r; local 188 handle_range_error(range_error_t err, range_t *left, range_t *right) argument 216 handle_contiguous_range_error(range_error_t err, range_t *left, range_t *right) argument [all...] |
/external/zlib/contrib/blast/ |
H A D | blast.c | 40 unsigned left; /* available input at in */ member in struct:state 64 * bit buffer, using shift left. 73 if (s->left == 0) { 74 s->left = s->infun(s->inhow, &(s->in)); 75 if (s->left == 0) longjmp(s->env, 1); /* out of input */ 78 s->left--; 82 /* drop need bits and update buffer, always zero to seven bits left */ 131 int left; /* bits left in next or left t local 189 int left; /* number of possible codes left of current length */ local [all...] |
/external/webkit/WebCore/css/ |
H A D | Rect.idl | 26 readonly attribute CSSPrimitiveValue left;
|
/external/skia/src/core/ |
H A D | SkRect.cpp | 19 void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) argument 22 if (left >= right || top >= bottom) 27 this->set(left, top, right, bottom); 30 if (left < fLeft) fLeft = left; 107 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) argument 109 if (left < right && top < bottom && !this->isEmpty() && // check for empties 110 fLeft < right && left < fRight && fTop < bottom && top < fBottom) 112 if (fLeft < left) fLeft = left; 127 join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) argument [all...] |
H A D | SkTSearch.cpp | 149 char* left = first; local 151 char* pivot = left; 153 while (left <= rite) 155 while (left < last && compare(left, pivot) < 0) 156 left += elemSize; 159 if (left <= rite) 161 if (left < rite) 163 SkASSERT(compare(left, rite) >= 0); 164 sk_qsort_swap(left, rit [all...] |
/external/wpa_supplicant/ |
H A D | eap_tlv.c | 109 size_t left, tlv_len; local 116 left = be_to_host16(hdr->length) - sizeof(struct eap_hdr) - 1; 119 wpa_hexdump(MSG_DEBUG, "EAP-TLV: Received TLVs", pos, left); 120 while (left >= 4) { 126 left -= 4; 127 if (tlv_len > left) { 129 "(tlv_len=%lu left=%lu)", 131 (unsigned long) left); 155 left -= tlv_len; 157 if (left) { [all...] |
/external/webkit/WebCore/rendering/style/ |
H A D | BorderData.h | 36 BorderValue left; member in class:WebCore::BorderData 51 return left.nonZero(!haveImage) || right.nonZero(!haveImage) || top.nonZero(!haveImage) || bottom.nonZero(!haveImage); 69 if (!image.hasImage() && (left.style() == BNONE || left.style() == BHIDDEN)) 71 return left.width; 97 return left == o.left && right == o.right && top == o.top && bottom == o.bottom && image == o.image &&
|
/external/zlib/examples/ |
H A D | gzjoin.c | 80 unsigned left; /* bytes remaining at next */ member in struct:__anon6249 112 in->left = 0; 126 if (in->left != 0) 130 len = (long)read(in->fd, in->buf + in->left, CHUNK - in->left); 133 in->left += (unsigned)len; 134 } while (len != 0 && in->left < CHUNK); 139 #define bget(in) (in->left ? 0 : bload(in), \ 140 in->left ? (in->left 175 unsigned left; local [all...] |
/external/webkit/WebCore/inspector/front-end/ |
H A D | audits.css | 44 left: 200px; 58 left: 0; 71 float: left; 96 padding-left: 16px; 106 margin-left: 16px; 121 padding-left: 18px; 155 left: 0; 172 left: 0; 191 left: -8px; 204 left [all...] |
/external/webkit/WebCore/rendering/ |
H A D | GapRects.h | 31 const IntRect& left() const { return m_left; } function in struct:WebCore::GapRects 38 void unite(const GapRects& o) { uniteLeft(o.left()); uniteCenter(o.center()); uniteRight(o.right()); } 50 return m_left == other.left() && m_center == other.center() && m_right == other.right();
|