Searched refs:left (Results 1 - 25 of 2877) sorted by relevance

1234567891011>>

/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DStateCluster.java30 /** A Cluster object points to the left/right (start and end) states of a
34 public NFAState left; field in class:StateCluster
37 public StateCluster(NFAState left, NFAState right) { argument
38 this.left = left;
/external/chromium_org/tools/gyp/test/ninja/s-needs-no-depfiles/
H A Dempty.s1 # This file intentionally left blank.
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DTSearch.h13 static T* QSort_Partition(T* left, T* right, T* pivot) argument
17 T* newPivot = left;
18 while (left < right) {
19 if (*left < pivotValue) {
20 SkTSwap(*left, *newPivot);
23 left += 1;
30 void QSort(T* left, T* right) argument
32 if (left >= right) {
35 T* pivot = left + (right - left >>
42 QSort_Partition(T** left, T** right, T** pivot) argument
59 QSort(T** left, T** right) argument
71 QSort_Partition(S& context, T* left, T* right, T* pivot, bool (*lessThan)(S&, const T, const T)) argument
89 QSort(S& context, T* left, T* right, bool (*lessThan)(S& , const T, const T)) argument
[all...]
/external/skia/experimental/Intersection/
H A DTSearch.h13 static T* QSort_Partition(T* left, T* right, T* pivot) argument
17 T* newPivot = left;
18 while (left < right) {
19 if (*left < pivotValue) {
20 SkTSwap(*left, *newPivot);
23 left += 1;
30 void QSort(T* left, T* right) argument
32 if (left >= right) {
35 T* pivot = left + (right - left >>
42 QSort_Partition(T** left, T** right, T** pivot) argument
59 QSort(T** left, T** right) argument
71 QSort_Partition(S& context, T* left, T* right, T* pivot, bool (*lessThan)(S&, const T, const T)) argument
89 QSort(S& context, T* left, T* right, bool (*lessThan)(S& , const T, const T)) argument
[all...]
/external/chromium_org/chrome/browser/resources/
H A Dabout_version_android.css6 text-align: left;
16 margin-left: auto;
H A Dabout_nacl.css11 margin-left: 10px;
/external/clang/test/Modules/Inputs/
H A Ddiamond_left.h3 float left(float *);
H A Ddiamond_right.h6 int left, right; member in struct:left_and_right
H A Dcategory_left.h4 -(void)left;
8 -(void)left;
/external/chromium_org/tools/deep_memory_profiler/visualizer/static/
H A Dutility.js15 var left = 0;
17 while (left <= right) {
18 var mid = Math.floor((left + right) / 2);
20 left = mid + 1;
26 return left;
31 * @param {Array.<*>} left
35 var intersectionOfSorted = function(left, right) {
37 return left.reduce(function(previous, current) {
/external/chromium_org/third_party/WebKit/Source/core/animation/animatable/
H A DAnimatableValue.cpp52 PassRefPtrWillBeRawPtr<AnimatableValue> AnimatableValue::interpolate(const AnimatableValue* left, const AnimatableValue* right, double fraction) argument
54 ASSERT(left);
56 ASSERT(!left->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) argument
67 ASSERT(left);
70 if (left->isSameType(right))
71 return left
[all...]
/external/chromium_org/components/dom_distiller/core/
H A Darticle_entry_unittest.cc31 ArticleEntry left; local
33 left.set_entry_id("entry0");
35 EXPECT_FALSE(AreEntriesEqual(left, right));
36 right = left;
37 EXPECT_TRUE(AreEntriesEqual(left, right));
39 left.set_title("a title");
40 EXPECT_FALSE(AreEntriesEqual(left, right));
42 EXPECT_FALSE(AreEntriesEqual(left, right));
44 EXPECT_TRUE(AreEntriesEqual(left, right));
48 *left
[all...]
/external/chromium_org/v8/benchmarks/spinning-balls/
H A Dsplay-tree.js78 node.left = this.root_;
83 node.left = this.root_.left;
84 this.root_.left = null;
107 if (!this.root_.left) {
111 this.root_ = this.root_.left;
165 // the left subtree.
168 } else if (this.root_.left) {
169 return this.findMax(this.root_.left);
204 // the L tree of the algorithm. The left chil
[all...]
/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-1439135.js30 var left = "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX";
33 var cons = left + right;
H A Dregress-95485.js29 var left = 'XXX';
32 var cons = left + right;
/external/chromium_org/ui/gfx/geometry/
H A Dinsets.cc15 Insets::Insets(int top, int left, int bottom, int right) argument
16 : InsetsBase<Insets, int>(top, left, bottom, right) {}
22 return base::StringPrintf("%d,%d,%d,%d", top(), left(), bottom(), right());
H A Dinsets_f.cc15 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/guava/guava/src/com/google/common/io/
H A DLimitInputStream.java35 private long left; field in class:LimitInputStream
48 left = limit;
52 return (int) Math.min(in.available(), left);
57 mark = left;
62 if (left == 0) {
68 --left;
74 if (left == 0) {
78 len = (int) Math.min(len, left);
81 left -= result;
95 left
[all...]
/external/chromium_org/v8/tools/
H A Dsplaytree.js80 node.left = this.root_;
85 node.left = this.root_.left;
86 this.root_.left = null;
109 if (!this.root_.left) {
113 this.root_ = this.root_.left;
148 while (current.left) {
149 current = current.left;
182 // the left subtree.
185 } else if (this.root_.left) {
[all...]
/external/chromium-trace/trace-viewer/src/tracing/importer/v8/
H A Dsplaytree.js62 node.left = this.root_;
67 node.left = this.root_.left;
68 this.root_.left = null;
91 if (!this.root_.left) {
95 this.root_ = this.root_.left;
131 while (current.left) {
132 current = current.left;
165 // the left subtree.
168 } else if (this.root_.left) {
[all...]
/external/chromium_org/third_party/WebKit/Source/core/html/parser/
H A DHTMLEntitySearch.cpp33 static const HTMLEntityTableEntry* halfway(const HTMLEntityTableEntry* left, const HTMLEntityTableEntry* right) argument
35 return &left[(right - left) / 2];
59 const HTMLEntityTableEntry* left = m_first; local
61 if (left == right)
62 return left;
63 CompareResult result = compare(left, nextCharacter);
65 return left;
68 while (left + 1 < right) {
69 const HTMLEntityTableEntry* probe = halfway(left, righ
84 const HTMLEntityTableEntry* left = m_first; local
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DComparisonChain.java67 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, righ
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 DBstCountBasedBalancePolicies.java52 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) {
59 if (left == null) {
62 return left;
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, righ
[all...]
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/coverage/htmlfiles/
H A Djquery.isonscreen.js17 left: $(window).scrollLeft(),
24 if( box.left+box.width-container.left > 0 &&
25 box.left < container.width+container.left &&
39 left: $(window).scrollLeft(),
46 if( $(this).offset().left+$(this).width()-container.left > 0 &&
47 $(this).offset().left < container.width+container.left
[all...]
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/mp4/objectdescriptors/
H A DBitReaderBuffer.java19 int left = 8 - position % 8;
21 if (i <= left) {
22 rc = (v << (position % 8) & 0xFF) >> ((position % 8) + (left - i));
25 int now = left;
26 int then = i - left;
40 int left = 8 - position % 8;
41 if (left == 8) {
42 left = 0;
44 readBits(left);
45 return left;
[all...]

Completed in 735 milliseconds

1234567891011>>