| /external/webkit/JavaScriptCore/icu/unicode/ |
| utf_old.h | 1 /* This file is intentionally left blank. */
|
| /external/webkit/JavaScriptGlue/icu/unicode/ |
| utf_old.h | 1 /* This file is intentionally left blank. */
|
| /external/webkit/WebCore/icu/unicode/ |
| utf_old.h | 1 /* This file is intentionally left blank. */
|
| /external/webkit/WebKit/mac/icu/unicode/ |
| utf_old.h | 1 /* This file is intentionally left blank. */
|
| /dalvik/dx/src/junit/runner/ |
| Sorter.java | 14 public void swap(Vector values, int left, int right);
17 public static void sortStrings(Vector values , int left, int right, Swapper swapper) {
18 int oleft= left;
20 String mid= (String)values.elementAt((left + right) / 2);
22 while (((String)(values.elementAt(left))).compareTo(mid) < 0)
23 left++;
26 if (left <= right) {
27 swapper.swap(values, left, right);
28 left++;
31 } while (left <= right)
[all...] |
| /dalvik/libcore/luni/src/test/java/junit/runner/ |
| Sorter.java | 14 public void swap(Vector values, int left, int right);
17 public static void sortStrings(Vector values , int left, int right, Swapper swapper) {
18 int oleft= left;
20 String mid= (String)values.elementAt((left + right) / 2);
22 while (((String)(values.elementAt(left))).compareTo(mid) < 0)
23 left++;
26 if (left <= right) {
27 swapper.swap(values, left, right);
28 left++;
31 } while (left <= right)
[all...] |
| /external/junit/src/junit/runner/ |
| Sorter.java | 12 public void swap(Vector values, int left, int right);
15 public static void sortStrings(Vector values , int left, int right, Swapper swapper) {
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 <= right)
[all...] |
| /dalvik/dx/tests/099-dex-core-library-error/ |
| Blort.java | 4 // This space intentionally left blank.
|
| Muffins.java | 4 // This space intentionally left blank.
|
| Zorch.java | 4 // This space intentionally left blank.
|
| /dalvik/tests/060-reflection-security/src/other/ |
| Blort.java | 10 // This space intentionally left blank.
14 // This space intentionally left blank.
18 // This space intentionally left blank.
22 // This space intentionally left blank.
|
| /frameworks/base/test-runner/src/junit/runner/ |
| Sorter.java | 15 public void swap(Vector values, int left, int right);
18 public static void sortStrings(Vector values , int left, int right, Swapper swapper) {
19 int oleft= left;
21 String mid= (String)values.elementAt((left + right) / 2);
23 while (((String)(values.elementAt(left))).compareTo(mid) < 0)
24 left++;
27 if (left <= right) {
28 swapper.swap(values, left, right);
29 left++;
32 } while (left <= right)
[all...] |
| /external/bluetooth/glib/build/ |
| README | 2 are left. See the separate "build" module in GNOME SVN for history.
|
| /build/tools/apriori/ |
| rangesort.c | 52 static inline int INTERSECT(range_t *left, range_t *right) {
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)) {
71 range_t *left = (range_t *)l, *right = (range_t *)r; local
97 range_t *left = (range_t *)l, *right = (range_t *)r; local
[all...] |
| /frameworks/base/libs/ui/ |
| Rect.cpp | 30 left = 0;
41 if (left < rhs.left) {
43 } else if (left == rhs.left) {
58 right -= left - x;
60 left = x;
67 left += x;
76 const Rect result(left+rhs.x, top+rhs.y, right+rhs.x, bottom+rhs.y);
82 const Rect result(left-rhs.x, top-rhs.y, right-rhs.x, bottom-rhs.y)
[all...] |
| /external/guava/src/com/google/common/collect/ |
| 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, right))
[all...] |
| /external/webkit/WebCore/manual-tests/ |
| transition-left.html | 7 <title>Transition of left property</title>
11 left: 100px;
15 -webkit-transition-property: left;
26 evt.target.style.left = "300px";
28 evt.target.style.left = "100px";
37 <h1>Transition of 'left' property</h1>
39 <p>The element below should move 200 pixels left or right when clicked</p>
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| WnnPOS.java | 25 /** The part of speech at left side */
26 public int left = 0; field in class:WnnPOS
39 * @param left The part of speech at left side
42 public WnnPOS(int left, int right) {
43 this.left = left;
|
| /external/v8/tools/ |
| 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.
97 # Left child exists.
99 # Make the original left child the new root.
100 self.root = self.root.left
[all...] |
| /external/guava/src/com/google/common/io/ |
| 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 = mark
[all...] |
| /external/elfcopy/ |
| rangesort.c | 52 static inline int INTERSECT(range_t *left, range_t *right) {
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
[all...] |
| /external/icu4c/common/ |
| uarrsort.c | 31 uprv_uint16Comparator(const void *context, const void *left, const void *right) {
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) {
37 return *(const int32_t *)left - *(const int32_t *)right;
41 uprv_uint32Comparator(const void *context, const void *left, const void *right) {
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]<x *
[all...] |
| /frameworks/base/graphics/java/android/graphics/ |
| Rect.java | 28 * represented by the coordinates of its 4 edges (left, top, right bottom).
31 * the coordinates are sorted correctly (i.e. left <= right and top <= bottom).
34 public int left; field in class:Rect
49 * checking is performed, so the caller must ensure that left <= right and
52 * @param left The X coordinate of the left side of the rectagle
57 public Rect(int left, int top, int right, int bottom) {
58 this.left = left;
66 * rectangle (which is left unmodified)
[all...] |
| RectF.java | 26 * represented by the coordinates of its 4 edges (left, top, right bottom).
29 * the coordinates are sorted correctly (i.e. left <= right and top <= bottom).
32 public float left; field in class:RectF
44 * checking is performed, so the caller must ensure that left <= right and
47 * @param left The X coordinate of the left side of the rectagle
52 public RectF(float left, float top, float right, float bottom) {
53 this.left = left;
61 * rectangle (which is left unmodified)
[all...] |
| /frameworks/base/awt/java/awt/ |
| Insets.java | 31 * the right side, and the left side. The space can be filled with a border, a
50 * The left inset indicates the size of the space added to the left side of
53 public int left; field in class:Insets
68 * Instantiates a new Inset object with the specified top, left, bottom,
73 * @param left
74 * the left inset.
80 public Insets(int top, int left, int bottom, int right) {
81 setValues(top, left, bottom, right);
93 hashCode = HashCode.combine(hashCode, left);
[all...] |
