Searched refs:left (Results 1 - 25 of 2298) 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/WebKit/Source/core/animation/
H A DAnimatableValue.cpp44 PassRefPtr<AnimatableValue> AnimatableValue::interpolate(const AnimatableValue* left, const AnimatableValue* right, double fraction) argument
46 ASSERT(left);
48 ASSERT(!left->isNeutral());
51 if (fraction && fraction != 1 && left->isSameType(right))
52 return left->interpolateTo(right, fraction);
54 return defaultInterpolateTo(left, right, fraction);
57 PassRefPtr<AnimatableValue> AnimatableValue::add(const AnimatableValue* left, const AnimatableValue* right) argument
59 ASSERT(left);
62 if (left->isNeutral())
65 return takeConstRef(left);
[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/chromium_org/content/common/
H A Dfind_match_rect_android.cc10 : left(0.0f),
16 FindMatchRect::FindMatchRect(float left, float top, float right, float bottom) argument
17 : left(left),
H A Dfind_match_rect_android.h13 FindMatchRect(float left, float top, float right, float bottom);
14 float left; member in struct:content::FindMatchRect
/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/webkit/data/test_shell/sort/
H A Dsort-quick.js3 function sort_quick(sort, left, right) {
5 left = 0;
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) {
17 sort.add_work(function(){partition_step(sort, left, righ
[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/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/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/
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/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];
58 const HTMLEntityTableEntry* left = m_first; local
60 if (left == right)
61 return left;
62 CompareResult result = compare(left, nextCharacter);
64 return left;
67 while (left + 1 < right) {
68 const HTMLEntityTableEntry* probe = halfway(left, righ
83 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...]

Completed in 490 milliseconds

1234567891011>>