/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;
|
/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...] |
/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/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/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...] |
/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());
|
/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...] |
/external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
HTMLEntitySearch.cpp | 33 static const HTMLEntityTableEntry* halfway(const HTMLEntityTableEntry* left, const HTMLEntityTableEntry* right) 35 return &left[(right - left) / 2]; 60 const HTMLEntityTableEntry* right = m_last; local 61 if (left == right) 67 return right; 68 while (left + 1 < right) { 69 const HTMLEntityTableEntry* probe = halfway(left, right); 75 right = probe; 78 ASSERT(left + 1 == right); 79 return right; 85 const HTMLEntityTableEntry* right = m_last; local [all...] |
/external/chromium_org/v8/src/compiler/ |
machine-operator-reducer.cc | 51 if (m.right().Is(0)) return Replace(m.right().node()); // x & 0 => 0 52 if (m.right().Is(-1)) return Replace(m.left().node()); // x & -1 => x 54 return ReplaceInt32(m.left().Value() & m.right().Value()); 61 if (m.right().Is(0)) return Replace(m.left().node()); // x | 0 => x 62 if (m.right().Is(-1)) return Replace(m.right().node()); // x | -1 => -1 64 return ReplaceInt32(m.left().Value() | m.right().Value()); 67 if (m.left().IsWord32Shl() && m.right().IsWord32Shr()) { 69 Int32BinopMatcher mright(m.right().node()) [all...] |
/external/javassist/src/main/javassist/compiler/ast/ |
DoubleConst.java | 44 public ASTree compute(int op, ASTree right) { 45 if (right instanceof IntConst) 46 return compute0(op, (IntConst)right); 47 else if (right instanceof DoubleConst) 48 return compute0(op, (DoubleConst)right); 53 private DoubleConst compute0(int op, DoubleConst right) { 56 || right.type == TokenId.DoubleConstant) 61 return compute(op, this.value, right.value, newType); 64 private DoubleConst compute0(int op, IntConst right) { 65 return compute(op, this.value, (double)right.value, this.type) [all...] |
Pair.java | 25 protected ASTree left, right; field in class:Pair 29 right = _right; 39 sbuf.append(right == null ? "<null>" : right.toString()); 46 public ASTree getRight() { return right; } 50 public void setRight(ASTree _right) { right = _right; }
|
/external/apache-xml/src/main/java/org/apache/xpath/operations/ |
Bool.java | 38 * @param right non-null reference to the evaluated right operand. 44 public XObject operate(XObject right) throws javax.xml.transform.TransformerException 47 if (XObject.CLASS_BOOLEAN == right.getType()) 48 return right; 50 return right.bool() ? XBoolean.S_TRUE : XBoolean.S_FALSE;
|
Number.java | 38 * @param right non-null reference to the evaluated right operand. 44 public XObject operate(XObject right) throws javax.xml.transform.TransformerException 47 if (XObject.CLASS_NUMBER == right.getType()) 48 return right; 50 return new XNumber(right.num());
|
String.java | 37 * @param right non-null reference to the evaluated right operand. 43 public XObject operate(XObject right) throws javax.xml.transform.TransformerException 45 return (XString)right.xstr(); // semi-safe cast.
|
/external/chromium_org/chrome/browser/resources/ |
profile_signin_confirmation.css | 8 margin-right: 0; 16 margin-right: 0;
|
/external/chromium_org/third_party/skia/tests/ |
CanvasStateHelpers.h | 23 float right, float bottom, int32_t spacer); 32 float left, float top, float right, float bottom, int32_t spacer); 39 int32_t right, int32_t bottom, int32_t clipOp, const SkRegion& localRegion); 48 int32_t left, int32_t top, int32_t right, int32_t bottom, int32_t clipOp,
|
/external/libunwind/scripts/ |
kernel-diff.sh | 7 right=$(eval echo $r) 8 # echo $left $right 9 diff -up $left $right
|
/external/chromium_org/chrome/browser/sync_file_system/drive_backend/ |
drive_backend_test_util.cc | 23 const FileDetails& right) { 28 for (int i = 0; i < right.parent_folder_ids_size(); ++i) 32 EXPECT_EQ(left.title(), right.title()); 33 EXPECT_EQ(left.file_kind(), right.file_kind()); 34 EXPECT_EQ(left.md5(), right.md5()); 35 EXPECT_EQ(left.etag(), right.etag()); 36 EXPECT_EQ(left.creation_time(), right.creation_time()); 37 EXPECT_EQ(left.modification_time(), right.modification_time()); 38 EXPECT_EQ(left.missing(), right.missing()); 39 EXPECT_EQ(left.change_id(), right.change_id()) [all...] |