/external/clang/test/Modules/Inputs/ |
H A D | 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/ |
H A D | 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) { argument 39 this.right = right;
|
/external/chromium_org/chrome/browser/sync_file_system/drive_backend/ |
H A D | drive_backend_test_util.cc | 22 const ServiceMetadata& right) { 23 EXPECT_EQ(left.largest_change_id(), right.largest_change_id()); 24 EXPECT_EQ(left.sync_root_tracker_id(), right.sync_root_tracker_id()); 25 EXPECT_EQ(left.next_tracker_id(), right.next_tracker_id()); 29 const FileDetails& right) { 34 for (int i = 0; i < right.parent_folder_ids_size(); ++i) 38 EXPECT_EQ(left.title(), right.title()); 39 EXPECT_EQ(left.file_kind(), right.file_kind()); 40 EXPECT_EQ(left.md5(), right.md5()); 41 EXPECT_EQ(left.etag(), right 21 ExpectEquivalentServiceMetadata(const ServiceMetadata& left, const ServiceMetadata& right) argument 28 ExpectEquivalentDetails(const FileDetails& left, const FileDetails& right) argument 48 ExpectEquivalentMetadata(const FileMetadata& left, const FileMetadata& right) argument 54 ExpectEquivalentTrackers(const FileTracker& left, const FileTracker& right) argument [all...] |
/external/chromium_org/third_party/WebKit/Source/core/animation/ |
H A D | AnimatableValue.cpp | 45 PassRefPtr<AnimatableValue> AnimatableValue::interpolate(const AnimatableValue* left, const AnimatableValue* right, double fraction) argument 48 ASSERT(right); 50 ASSERT(!right->isNeutral()); 52 if (fraction && fraction != 1 && left->isSameType(right)) 53 return left->interpolateTo(right, fraction); 55 return defaultInterpolateTo(left, right, fraction); 58 PassRefPtr<AnimatableValue> AnimatableValue::add(const AnimatableValue* left, const AnimatableValue* right) argument 61 ASSERT(right); 64 return takeConstRef(right); 65 if (right [all...] |
/external/chromium_org/components/dom_distiller/core/ |
H A D | 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/skia/src/core/ |
H A D | 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 [all...] |
/external/skia/src/core/ |
H A D | 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 [all...] |
/external/chromium_org/webkit/data/test_shell/sort/ |
H A D | sort-quick.js | 3 function sort_quick(sort, left, right) { 6 right = sort.size - 1; 8 if (left < right) { 9 var pivot = left + Math.floor(Math.random()*(right-left)); 10 //var pivot = Math.floor(left + (right-left)/2); 11 partition(sort, left, right, pivot); 15 function partition(sort, left, right, pivot) { 16 sort.swap(pivot, right); 17 sort.add_work(function(){partition_step(sort, left, right, pivot, left, left);}); 20 function partition_step(sort, left, right, pivo [all...] |
/external/chromium_org/tools/deep_memory_profiler/visualizer/static/ |
H A D | utility.js | 16 var right = this.length - 1; 17 while (left <= right) { 18 var mid = Math.floor((left + right) / 2); 22 right = mid - 1; 32 * @param {Array.<*>} right 35 var intersectionOfSorted = function(left, right) { 38 var idx = right.indexOf(current, from);
|
/external/chromium_org/v8/benchmarks/spinning-balls/ |
H A D | splay-tree.js | 79 node.right = this.root_.right; 80 this.root_.right = null; 82 node.right = this.root_; 108 this.root_ = this.root_.right; 110 var right = this.root_.right; 112 // Splay to make sure that the new root has an empty right child. 114 // Insert the original right child as the right chil [all...] |
/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-1439135.js | 31 var right = "YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY"; 33 var cons = left + right;
|
H A D | regress-95485.js | 30 var right = 'YYY'; 32 var cons = left + right;
|
/external/v8/benchmarks/spinning-balls/ |
H A D | splay-tree.js | 79 node.right = this.root_.right; 80 this.root_.right = null; 82 node.right = this.root_; 108 this.root_ = this.root_.right; 110 var right = this.root_.right; 112 // Splay to make sure that the new root has an empty right child. 114 // Insert the original right child as the right chil [all...] |
/external/v8/test/mjsunit/regress/ |
H A D | regress-1439135.js | 31 var right = "YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY"; 33 var cons = left + right;
|
H A D | regress-95485.js | 30 var right = 'YYY'; 32 var cons = left + right;
|
/external/chromium_org/v8/tools/ |
H A D | splaytree.js | 81 node.right = this.root_.right; 82 this.root_.right = null; 84 node.right = this.root_; 110 this.root_ = this.root_.right; 112 var right = this.root_.right; 114 // Splay to make sure that the new root has an empty right child. 116 // Insert the original right child as the right chil [all...] |
/external/v8/tools/ |
H A D | splaytree.js | 81 node.right = this.root_.right; 82 this.root_.right = null; 84 node.right = this.root_; 110 this.root_ = this.root_.right; 112 var right = this.root_.right; 114 // Splay to make sure that the new root has an empty right child. 116 // Insert the original right child as the right chil [all...] |
/external/chromium_org/ui/gfx/ |
H A D | insets_f.cc | 15 InsetsF::InsetsF(float top, float left, float bottom, float right) argument 16 : InsetsBase<InsetsF, float>(top, left, bottom, right) {} 22 return base::StringPrintf("%f,%f,%f,%f", top(), left(), bottom(), right());
|
/external/chromium-trace/trace-viewer/src/tracing/importer/v8/ |
H A D | splaytree.js | 63 node.right = this.root_.right; 64 this.root_.right = null; 66 node.right = this.root_; 92 this.root_ = this.root_.right; 94 var right = this.root_.right; 96 // Splay to make sure that the new root has an empty right child. 98 // Insert the original right child as the right chil [all...] |
/external/clang/test/SemaCXX/ |
H A D | cxx1y-variable-templates_in_class.cpp | 8 template<typename T, typename T0> static const T right = T(100); member in class:A 9 template<typename T> static const T right<T,int> = 5; member in class:A 10 template<typename T> const int right<int,T>; // expected-error {{member 'right' declared as a template}} member in class:A 11 template<typename T> const float right<float,T> = 5; // expected-error {{member 'right' declared as a template}} member in class:A 12 template<> static const int right<int,int> = 7; // expected-error {{explicit specialization of 'right' in class scope}} member in class:A 13 template<> static const float right<float,int>; // expected-error {{explicit specialization of 'right' i member in class:A 14 template static const int right<int,int>; // expected-error {{template specialization requires 'template<>'}} \\ member in class:A 20 template<typename T, typename T0> static const T right = T(100); member in class:out_of_line::B0 21 template<typename T> static const T right<T,int> = T(5); member in class:out_of_line::B0 23 template<> const int B0::right<int,int> = 7; member in class:out_of_line::B0 24 template const int B0::right<int,int>; member in class:out_of_line::B0 25 template<> const int B0::right<int,float>; member in class:out_of_line::B0 26 template const int B0::right<int,float>; member in class:out_of_line::B0 29 template<typename T, typename T0> static const T right; member in class:out_of_line::B1 30 template<typename T> static const T right<T,int>; member in class:out_of_line::B1 32 template<typename T, typename T0> const T B1::right = T(100); member in class:out_of_line::B1 33 template<typename T> const T B1::right<T,int> = T(5); member in class:out_of_line::B1 36 template<typename T, typename T0> static const T right = T(100); // expected-note {{previous definition is here}} member in class:out_of_line::B2 37 template<typename T> static const T right<T,int> = T(5); // expected-note {{previous definition is here}} member in class:out_of_line::B2 39 template<typename T, typename T0> const T B2::right = T(100); // expected-error {{redefinition of 'right'}} member in class:out_of_line::B2 40 template<typename T> const T B2::right<T,int> = T(5); // expected-error {{redefinition of 'right'}} member in class:out_of_line::B2 43 template<typename T, typename T0> static const T right = T(100); member in class:out_of_line::B3 44 template<typename T> static const T right<T,int> = T(5); member in class:out_of_line::B3 46 template<typename T, typename T0> const T B3::right; // expected-error {{forward declaration of variable template cannot have a nested name specifier}} member in class:out_of_line::B3 47 template<typename T> const T B3::right<T,int>; // expected-error {{forward declaration of variable template partial specialization cannot have a nested name specifier}} member in class:out_of_line::B3 50 template<typename T, typename T0> static const T right; member in class:out_of_line::B4 51 template<typename T> static const T right<T,int>; member in class:out_of_line::B4 55 template<typename T, typename T0> const T B4::right; // expected-error {{forward declaration of variable template cannot have a nested name specifier}} member in class:out_of_line::B4 56 template<typename T> const T B4::right<T,int>; // expected-error {{forward declaration of variable template partial specialization cannot have a nested name specifier}} \\ member in class:out_of_line::B4 58 template const int B4::right<int,int>; // expected-error {{explicit instantiation of undefined static data member template 'right' of class}} member in class:out_of_line::B4 [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/ |
H A D | 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/ |
H A D | 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)); 107 compare( @ullable Comparable left, @Nullable Comparable right) argument 111 compare(@ullable T left, @Nullable T right, @Nullable Comparator<T> comparator) argument 115 compare(int left, int right) argument 118 compare(long left, long right) argument 121 compare(float left, float right) argument 124 compare(double left, double right) argument 127 compare(boolean left, boolean right) argument 140 compare( Comparable<?> left, Comparable<?> right) argument 147 compare( @ullable T left, @Nullable T right, Comparator<T> comparator) argument 155 compare(int left, int right) argument 162 compare(long left, long right) argument 169 compare(float left, float right) argument 176 compare(double left, double right) argument 183 compare(boolean left, boolean right) argument [all...] |
H A D | BstCountBasedBalancePolicies.java | 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)), 68 right [all...] |
/external/chromium_org/remoting/base/ |
H A D | 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 [all...] |
/external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
H A D | HTMLEntitySearch.cpp | 33 static const HTMLEntityTableEntry* halfway(const HTMLEntityTableEntry* left, const HTMLEntityTableEntry* right) argument 35 return &left[(right - left) / 2]; 59 const HTMLEntityTableEntry* right = m_last; local 60 if (left == right) 66 return right; 67 while (left + 1 < right) { 68 const HTMLEntityTableEntry* probe = halfway(left, right); 74 right = probe; 77 ASSERT(left + 1 == right); 78 return right; 84 const HTMLEntityTableEntry* right = m_last; local [all...] |