| /bionic/libstdc++/include/ |
| typeinfo | 19 bool operator==(type_info const & right) const;
20 bool operator!=(type_info const & right) const;
21 bool before(type_info const & right) const;
24 type_info(type_info const & right);
25 type_info & operator=(type_info const & right);
|
| /ndk/build/platforms/android-3/arch-arm/usr/include/ |
| typeinfo | 19 bool operator==(type_info const & right) const;
20 bool operator!=(type_info const & right) const;
21 bool before(type_info const & right) const;
24 type_info(type_info const & right);
25 type_info & operator=(type_info const & right);
|
| /ndk/build/platforms/android-4/arch-arm/usr/include/ |
| typeinfo | 19 bool operator==(type_info const & right) const;
20 bool operator!=(type_info const & right) const;
21 bool before(type_info const & right) const;
24 type_info(type_info const & right);
25 type_info & operator=(type_info const & right);
|
| /ndk/build/platforms/android-5/arch-arm/usr/include/ |
| typeinfo | 19 bool operator==(type_info const & right) const;
20 bool operator!=(type_info const & right) const;
21 bool before(type_info const & right) const;
24 type_info(type_info const & right);
25 type_info & operator=(type_info const & right);
|
| /ndk/build/platforms/android-5/arch-x86/usr/include/ |
| typeinfo | 19 bool operator==(type_info const & right) const;
20 bool operator!=(type_info const & right) const;
21 bool before(type_info const & right) const;
24 type_info(type_info const & right);
25 type_info & operator=(type_info const & right);
|
| /ndk/build/platforms/android-8/arch-arm/usr/include/ |
| typeinfo | 19 bool operator==(type_info const & right) const;
20 bool operator!=(type_info const & right) const;
21 bool before(type_info const & right) const;
24 type_info(type_info const & right);
25 type_info & operator=(type_info const & right);
|
| /ndk/build/platforms/android-8/arch-x86/usr/include/ |
| typeinfo | 19 bool operator==(type_info const & right) const;
20 bool operator!=(type_info const & right) const;
21 bool before(type_info const & right) const;
24 type_info(type_info const & right);
25 type_info & operator=(type_info const & right);
|
| /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) {
19 int oright= right;
20 String mid= (String)values.elementAt((left + right) / 2);
24 while (mid.compareTo((String)(values.elementAt(right))) < 0)
25 right--;
26 if (left <= right) {
27 swapper.swap(values, left, right);
29 right--;
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) {
19 int oright= right;
20 String mid= (String)values.elementAt((left + right) / 2);
24 while (mid.compareTo((String)(values.elementAt(right))) < 0)
25 right--;
26 if (left <= right) {
27 swapper.swap(values, left, right);
29 right--;
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) {
17 int oright= right;
18 String mid= (String)values.elementAt((left + right) / 2);
22 while (mid.compareTo((String)(values.elementAt(right))) < 0)
23 right--;
24 if (left <= right) {
25 swapper.swap(values, left, right);
27 right--;
29 } while (left <= right);
[all...] |
| /bionic/libstdc++/src/ |
| typeinfo.cpp | 16 type_info::operator==(type_info const & right) const {
21 type_info::operator!=(type_info const & right) const {
26 type_info::before(type_info const & right) const {
30 type_info::type_info(type_info const & right) {
|
| /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) {
20 int oright= right;
21 String mid= (String)values.elementAt((left + right) / 2);
25 while (mid.compareTo((String)(values.elementAt(right))) < 0)
26 right--;
27 if (left <= right) {
28 swapper.swap(values, left, right);
30 right--;
32 } while (left <= right);
[all...] |
| /frameworks/base/media/libdrm/mobile2/src/rights/ |
| Right.cpp | 16 #include <rights/Right.h>
20 /** see Right.h */
21 Right::Right()
26 /** see Right.h */
27 Right::~Right()
39 /** see Right.h */
40 void Right::addAssetID(const string& id)
45 /** see Right.h *
[all...] |
| /frameworks/base/media/libdrm/mobile2/include/rights/ |
| Right.h | 26 class Right {
29 * Constructor for Right.
31 Right();
34 * Destructor for Right.
36 ~Right();
39 * Add the asset id related with right into asset name list.
45 * Add a operation permission into right's operation permission list.
58 * Test whether the right has specific operation type or not.
75 Right& operator=(const Right& right)
[all...] |
| /external/clearsilver/cs/ |
| test18.cs.gold | 6 <? cs set:foo["baz"] + right = "plus right" ?>
|
| test4.cs.gold | 44 right, 4 > 0
48 right, 0 <= 5
52 right, 0 >= 5
56 right "0" <= #5
62 right "9" < #14
69 right "9" < "14" (strings)
75 right hdf "9" < hdf "14"
|
| test_comma.cs.gold | 3 Comma tests, evalute both but pass right most as expression result
|
| /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...] |
| /external/v8/tools/ |
| splaytree.py | 36 self.right = None
73 node.right = self.root.right
74 self.root.right = None
76 node.right = self.root
94 # No left child, so the new tree is just the right child.
95 self.root = self.root.right
98 right = self.root.right
101 # Splay to make sure that the new root has an empty right child
[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...] |
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| WnnPOS.java | 28 /** The part of speech at right side */
29 public int right = 0; field in class:WnnPOS
40 * @param right The part of speech at right side
42 public WnnPOS(int left, int right) {
44 this.right = right;
|
| /external/webkit/WebCore/manual-tests/ |
| right-click-crash.html | 2 document.onmousedown = function () { alert("Dismiss this and quickly right click again."); };
3 </script></head><body>This page is intended to test crashes caused by repeated right clicks.
4 To try to reproduce the bug, right click and then dismiss the dialog by hitting Return.
|
| /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 */
133 right=limit;
144 while(/* x<array[right-1] *
[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/webkit/WebCore/manual-tests/qt/ |
| main.html | 6 <div style="float:right;">
|
