| /external/clang/test/Modules/Inputs/ |
| diamond_right.h | 3 double right(double *);
6 int left, right; member in struct:left_and_right
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| StateCluster.java | 30 /** A Cluster object points to the left/right (start and end) states of a
35 public NFAState right; field in class:StateCluster
37 public StateCluster(NFAState left, NFAState right) {
39 this.right = right;
|
| /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;
|
| /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...] |
| /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) {
|
| /external/skia/src/core/ |
| SkScalar.cpp | 22 int right = 0; local
23 while (right < length && searchKey > keys[right])
24 right++;
27 if (length == right)
29 if (0 == right)
31 // Otherwise, interpolate between right - 1 and right.
32 SkScalar rightKey = keys[right];
33 SkScalar leftKey = keys[right-1]
[all...] |
| /sdk/rule_api/src/com/android/ide/common/api/ |
| Margins.java | 23 * Set of margins - distances to outer left, top, right and bottom edges. These objects
35 /** The right margin */
36 public final int right; field in class:Margins
48 * @param right the right side margin
52 public Margins(int left, int right, int top, int bottom) {
55 this.right = right;
63 return "Margins [left=" + left + ", right=" + right + ", top=" + top + ", bottom=" + botto
[all...] |
| /frameworks/base/graphics/java/android/graphics/ |
| RectF.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).
36 public float right; field in class:RectF
46 * checking is performed, so the caller must ensure that left <= right and
51 * @param right The X coordinate of the right side of the rectangle
54 public RectF(float left, float top, float right, float bottom) {
57 this.right = right;
71 right = r.right
[all...] |
| Insets.java | 33 public final int right; field in class:Insets
36 private Insets(int left, int top, int right, int bottom) {
39 this.right = right;
50 * @param right the right inset
55 public static Insets of(int left, int top, int right, int bottom) {
56 if (left == 0 && top == 0 && right == 0 && bottom == 0) {
59 return new Insets(left, top, right, bottom);
70 return (r == null) ? NONE : of(r.left, r.top, r.right, r.bottom)
[all...] |
| /dalvik/vm/compiler/template/armv5te-vfp/ |
| TEMPLATE_CMPG_DOUBLE_VFP.S | 4 %verify "right arg NaN"
|
| TEMPLATE_CMPG_FLOAT_VFP.S | 4 %verify "right arg NaN"
|
| TEMPLATE_CMPL_DOUBLE_VFP.S | 4 %verify "right arg NaN"
|
| TEMPLATE_CMPL_FLOAT_VFP.S | 4 %verify "right arg NaN"
|
| /dalvik/vm/mterp/arm-vfp/ |
| OP_CMPG_DOUBLE.S | 4 %verify "right arg NaN"
|
| OP_CMPG_FLOAT.S | 4 %verify "right arg NaN"
|
| OP_CMPL_DOUBLE.S | 4 %verify "right arg NaN"
|
| OP_CMPL_FLOAT.S | 4 %verify "right arg NaN"
|
| /dalvik/vm/mterp/armv5te/ |
| OP_CMPL_DOUBLE.S | 5 %verify "right arg NaN"
|
| OP_CMPL_FLOAT.S | 5 %verify "right arg NaN"
|
| /frameworks/av/media/libeffects/lvm/lib/Common/src/ |
| From2iToMS_16x16.c | 33 LVM_INT32 temp1,left,right; local
40 right = (LVM_INT32)*src;
44 temp1 = (left+right)>>1;
49 temp1 = (left-right)>>1;
|
| /frameworks/compile/linkloader/tests/images/ |
| simple-test.c | 27 unsigned int right = 99; local
32 printf("Please input a number [%d-%d]:\n", left, right);
38 if (user < left || user > right) {
47 right = user;
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/ |
| TestExpressionFeatures.g3 | 116 | e '^'<assoc=right>^ e
121 | e ('='<assoc=right>^
122 |'+='<assoc=right>^
123 |'-='<assoc=right>^
124 |'*='<assoc=right>^
125 |'/='<assoc=right>^
126 |'&='<assoc=right>^
127 |'|='<assoc=right>^
128 |'^='<assoc=right>^
129 |'>>='<assoc=right>
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ComparisonChain.java | 67 Comparable left, Comparable right) {
68 return classify(left.compareTo(right));
71 @Nullable T left, @Nullable T right, Comparator<T> comparator) {
72 return classify(comparator.compare(left, right));
74 @Override public ComparisonChain compare(int left, int right) {
75 return classify(Ints.compare(left, right));
77 @Override public ComparisonChain compare(long left, long right) {
78 return classify(Longs.compare(left, right));
80 @Override public ComparisonChain compare(float left, float right) {
81 return classify(Float.compare(left, right));
[all...] |
| BstCountBasedBalancePolicies.java | 23 import static com.google.common.collect.BstSide.RIGHT;
52 BstNodeFactory<N> nodeFactory, N source, @Nullable N left, @Nullable N right) {
53 return checkNotNull(nodeFactory).createNode(source, left, right);
58 public N combine(BstNodeFactory<N> nodeFactory, @Nullable N left, @Nullable N right) {
60 return right;
61 } else if (right == null) {
63 } else if (countAggregate.treeValue(left) > countAggregate.treeValue(right)) {
65 left, left.childOrNull(LEFT), combine(nodeFactory, left.childOrNull(RIGHT), right));
67 return nodeFactory.createNode(right, combine(nodeFactory, left, right.childOrNull(LEFT))
[all...] |
| /external/webkit/Source/WebCore/html/parser/ |
| HTMLEntitySearch.cpp | 35 const HTMLEntityTableEntry* halfway(const HTMLEntityTableEntry* left, const HTMLEntityTableEntry* right)
37 return &left[(right - left) / 2];
64 const HTMLEntityTableEntry* right = m_last; local
65 if (left == right)
71 return right;
72 while (left + 1 < right) {
73 const HTMLEntityTableEntry* probe = halfway(left, right);
79 right = probe;
82 ASSERT(left + 1 == right);
83 return right;
89 const HTMLEntityTableEntry* right = m_last; local
[all...] |
