/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 | 13 public void swap(Vector values, int left, int right); 16 public static void sortStrings(Vector values , int left, int right, Swapper swapper) { 18 int oright= right; 19 String mid= (String)values.elementAt((left + right) / 2); 23 while (mid.compareTo((String)(values.elementAt(right))) < 0) 24 right--; 25 if (left <= right) { 26 swapper.swap(values, left, right); 28 right--; 30 } while (left <= right); [all...] |
/external/chromium_org/components/dom_distiller/core/ |
article_entry_unittest.cc | 32 ArticleEntry right; local 34 right.set_entry_id("entry1"); 35 EXPECT_FALSE(AreEntriesEqual(left, right)); 36 right = left; 37 EXPECT_TRUE(AreEntriesEqual(left, right)); 40 EXPECT_FALSE(AreEntriesEqual(left, right)); 41 right.set_title("a different title"); 42 EXPECT_FALSE(AreEntriesEqual(left, right)); 43 right.set_title("a title"); 44 EXPECT_TRUE(AreEntriesEqual(left, right)); [all...] |
/frameworks/base/services/core/java/com/android/server/notification/ |
GlobalSortKeyComparator.java | 25 public int compare(NotificationRecord left, NotificationRecord right) { 29 if (right.getGlobalSortKey() == null) { 30 throw new IllegalStateException("Missing right global sort key: " + right); 32 return left.getGlobalSortKey().compareTo(right.getGlobalSortKey());
|
/external/chromium_org/third_party/WebKit/Source/core/animation/animatable/ |
AnimatableValue.cpp | 52 PassRefPtrWillBeRawPtr<AnimatableValue> AnimatableValue::interpolate(const AnimatableValue* left, const AnimatableValue* right, double fraction) 55 ASSERT(right); 57 ASSERT(!right->isNeutral()); 59 if (fraction && fraction != 1 && left->isSameType(right)) 60 return left->interpolateTo(right, fraction); 62 return defaultInterpolateTo(left, right, fraction); 65 double AnimatableValue::distance(const AnimatableValue* left, const AnimatableValue* right) 68 ASSERT(right); 70 if (left->isSameType(right)) 71 return left->distanceTo(right); [all...] |
/external/chromium_org/third_party/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...] |
/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...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
TSearch.h | 13 static T* QSort_Partition(T* left, T* right, T* pivot) 16 SkTSwap(*pivot, *right); 18 while (left < right) { 25 SkTSwap(*newPivot, *right); 30 void QSort(T* left, T* right) 32 if (left >= right) { 35 T* pivot = left + (right - left >> 1); 36 pivot = QSort_Partition(left, right, pivot); 38 QSort(pivot + 1, right); 42 static T** QSort_Partition(T** left, T** right, T** pivot [all...] |
/external/skia/experimental/Intersection/ |
TSearch.h | 13 static T* QSort_Partition(T* left, T* right, T* pivot) 16 SkTSwap(*pivot, *right); 18 while (left < right) { 25 SkTSwap(*newPivot, *right); 30 void QSort(T* left, T* right) 32 if (left >= right) { 35 T* pivot = left + (right - left >> 1); 36 pivot = QSort_Partition(left, right, pivot); 38 QSort(pivot + 1, right); 42 static T** QSort_Partition(T** left, T** right, T** pivot [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; 70 left = top = right = bottom = 0.0f [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...] |
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/utility/ |
swap.hpp | 30 void swap_impl(T& left, T& right) 33 swap(left,right); 37 void swap_impl(T (& left)[N], T (& right)[N]) 41 ::boost_swap_impl::swap_impl(left[i], right[i]); 49 void swap(T1& left, T2& right) 51 ::boost_swap_impl::swap_impl(left, right);
|
/external/clang/test/CodeGenCXX/ |
microsoft-abi-multiple-nonvirtual-inheritance.cpp | 7 struct Right { 8 virtual void right(); 11 struct ChildNoOverride : Left, Right { 14 struct ChildOverride : Left, Right { 16 virtual void right(); 68 child->right(); 69 // When calling a right base's virtual method, one needs to adjust 'this' at 74 // CHECK: %[[RIGHT:.*]] = bitcast i8* %[[RIGHT_i8]] to %struct.Right* 76 // CHECK: %[[VFPTR:.*]] = bitcast %struct.Right* %[[RIGHT]] to void (%struct.Right*)** 84 void ChildOverride::right() { function in class:ChildOverride 129 void GrandchildOverride::right() { function in class:GrandchildOverride [all...] |
/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/native/services/surfaceflinger/DisplayHardware/ |
FloatRect.h | 29 float right; member in class:android::FloatRect 34 : left(other.left), top(other.top), right(other.right), bottom(other.bottom) { } 36 inline float getWidth() const { return right - left; }
|
/external/chromium_org/ui/gfx/geometry/ |
insets.cc | 15 Insets::Insets(int top, int left, int bottom, int right) 16 : InsetsBase<Insets, int>(top, left, bottom, right) {} 22 return base::StringPrintf("%d,%d,%d,%d", top(), left(), bottom(), right());
|
insets_f.cc | 15 InsetsF::InsetsF(float top, float left, float bottom, float right) 16 : InsetsBase<InsetsF, float>(top, left, bottom, right) {} 22 return base::StringPrintf("%f,%f,%f,%f", top(), left(), bottom(), right());
|
/frameworks/base/libs/hwui/ |
Rect.h | 32 (r).left, (r).top, (r).right, (r).bottom 34 (r).left(), (r).top(), (r).right(), (r).bottom() 44 float right; member in class:android::uirenderer::Rect 56 right(0), 60 inline Rect(float left, float top, float right, float bottom): 63 right(right), 70 right(width), 77 right(rect.fRight), 90 left = top = right = bottom = 0.0f [all...] |
/external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
IntRectExtent.h | 47 IntRectExtent(int top, int right, int bottom, int left) 49 , m_right(right) 58 int right() const { return m_right; } function in class:blink::IntRectExtent 59 void setRight(int right) { m_right = right; } 67 bool isZero() const { return !left() && !right() && !top() && !bottom(); } 75 rect.expand(left() + right(), top() + bottom()); 88 && a.right() == b.right() 101 a.setRight(a.right() + b.right()) [all...] |
/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/chromium_org/remoting/base/ |
typed_buffer_unittest.cc | 52 TypedBuffer<Data> right(sizeof(int)); 56 EXPECT_TRUE(right.get()); 57 EXPECT_EQ(right.length(), sizeof(int)); 59 Data* raw_ptr = right.get(); 60 left = right.Pass(); 68 EXPECT_FALSE(right.get()); 69 EXPECT_EQ(right.length(), 0u); 75 TypedBuffer<Data> right(sizeof(int) * 2); 79 EXPECT_TRUE(right.get()); 80 EXPECT_EQ(right.length(), sizeof(int) * 2) [all...] |