/external/eigen/bench/btl/libs/BLAS/ |
H A D | blas_interface.hh | 61 static char right = 'R'; variable
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | BstBalancePolicy.java | 32 * subtrees {@code left} and {@code right}. It is guaranteed that the resulting tree will have 34 * then the subtree {@code right}. 36 N balance(BstNodeFactory<N> nodeFactory, N source, @Nullable N left, @Nullable N right); argument 39 * Constructs a locally balanced tree around the subtrees {@code left} and {@code right}. It is 41 * {@code left}, then the subtree {@code right}. 44 N combine(BstNodeFactory<N> nodeFactory, @Nullable N left, @Nullable N right); argument
|
H A D | BstNode.java | 58 * The right child of this node. A null value indicates that this node has no right child. 61 private final N right; field in class:BstNode 63 BstNode(@Nullable K key, @Nullable N left, @Nullable N right) { argument 66 this.right = right; 86 return right;
|
H A D | ByFunctionOrdering.java | 45 @Override public int compare(F left, F right) { argument 46 return ordering.compare(function.apply(left), function.apply(right));
|
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 | UsingToStringOrdering.java | 29 @Override public int compare(Object left, Object right) { argument 30 return left.toString().compareTo(right.toString());
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | AbstractBstBalancePolicyTest.java | 41 private SimpleNode balanceNew(char c, @Nullable SimpleNode left, @Nullable SimpleNode right) { argument 42 return getBalancePolicy().balance(nodeFactory, new SimpleNode(c, null, null), left, right);
|
/external/javassist/src/main/javassist/compiler/ast/ |
H A D | 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/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_treewriter.c | 37 unsigned int left, right; local 45 right = num_events[-tree[i + 1]]; 47 right = convert_distribution(tree[i + 1], tree, branch_ct, num_events); 50 branch_ct[i >> 1][1] = right; 51 return left + right;
|
/external/lzma/CPP/7zip/Archive/Common/ |
H A D | MultiStream.cpp | 17 int left = 0, mid = _streamIndex, right = Streams.Size();
local 22 right = mid;
30 mid = (left + right) / 2;
|
/external/lzma/CPP/7zip/Common/ |
H A D | FilePathAutoRename.cpp | 45 unsigned left = 1, right = (1 << 30);
local 46 while (left != right)
48 unsigned mid = (left + right) / 2;
52 right = mid;
54 return !MakeAutoName(name, extension, right, fullProcessedPath);
|
/external/replicaisland/src/com/replica/replicaisland/ |
H A D | QuickSorter.java | 44 // quicksort a[left] to a[right] 45 public void quicksort(Type[] a, int left, int right, Comparator<Type> comparator) { argument 46 if (right <= left) return; 47 int i = partition(a, left, right, comparator); 49 quicksort(a, i + 1, right, comparator); 52 // partition a[left] to a[right], assumes left < right 53 private int partition(Type[] a, int left, int right, Comparator<Type> comparator) { argument 55 int j = right; 57 while (comparator.compare(a[++i], a[right]) < [all...] |
/external/robolectric/src/main/java/com/xtremelabs/robolectric/matchers/ |
H A D | HasCompoundDrawablesMatcher.java | 16 public HasCompoundDrawablesMatcher(int left, int top, int right, int bottom) { argument 17 expectedCompoundDrawables = new ShadowTextView.CompoundDrawables(left, top, right, bottom); 42 public static Matcher<TextView> hasCompoundDrawables(int left, int top, int right, int bottom) { argument 43 return new HasCompoundDrawablesMatcher(left, top, right, bottom);
|
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
H A D | ShadowMarginLayoutParams.java | 20 public void setMargins(int left, int top, int right, int bottom) { argument 23 realMarginLayoutParams.rightMargin = right;
|
/external/skia/bench/ |
H A D | TableBench.cpp | 58 SkRect right = SkRect::MakeLTRB(col * kCellWidth + (kCellWidth-SK_Scalar1), local 62 canvas->drawRect(right, borderPaint);
|
/external/skia/experimental/Intersection/ |
H A D | ActiveEdge_Test.cpp | 70 UnitTest::ActiveEdge left, right; local 72 right.fWorkEdge.fEdge = &rightIn; 76 right.fAbove = leftRight[x][2]; 77 right.fTangent = right.fBelow = leftRight[x][3]; 78 SkASSERT(left < right); 79 SkASSERT(operator_less_than(left, right)); 80 SkASSERT(!(right < left)); 81 SkASSERT(!operator_less_than(right, left));
|
H A D | TSearch.h | 13 static T* QSort_Partition(T* left, T* right, T* pivot) argument 16 SkTSwap(*pivot, *right); 18 while (left < right) { 25 SkTSwap(*newPivot, *right); 30 void QSort(T* left, T* right) argument 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, 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/src/svg/ |
H A D | SkSVGCircle.cpp | 30 SkScalar left, top, right, bottom; local 33 right = cx + r; 40 sprintf(scratch, "%g", SkScalarToDouble(right)); 41 parser._addAttribute("right", scratch);
|
H A D | SkSVGEllipse.cpp | 32 SkScalar left, top, right, bottom; local 35 right = cx + rx; 42 sprintf(scratch, "%g", SkScalarToDouble(right)); 43 parser._addAttribute("right", scratch);
|
/external/smali/util/src/main/java/org/jf/util/ |
H A D | TwoColumnOutput.java | 43 * one which goes on the right. 61 * @param rightWidth > 0; width of the right column, in characters 86 * @param rightWidth >= 1; width of the right column, in characters 96 public void write(String left, String right) throws IOException { argument 98 rightLines = StringWrapper.wrapString(right, rightWidth, rightLines);
|
/external/chromium_org/chrome/browser/prefs/ |
H A D | pref_service_browsertest.cc | 152 int right = 0; local 153 EXPECT_TRUE(root_dict->GetInteger(kBrowserWindowPlacement + ".right", 154 &right)); 155 EXPECT_EQ(right, bounds.x() + bounds.width()); 217 int right = 0; local 218 EXPECT_TRUE(root_dict->GetInteger(kBrowserWindowPlacement + ".right", 219 &right)); 220 EXPECT_EQ(right, bounds.x() + bounds.width());
|
/external/chromium_org/chrome/browser/ui/webui/chromeos/first_run/ |
H A D | first_run_actor.cc | 29 FirstRunActor::StepPosition& FirstRunActor::StepPosition::SetRight(int right) { argument 30 right_ = right; 50 result->SetInteger("right", right_);
|
/external/chromium_org/chrome/installer/util/ |
H A D | delete_tree_work_item.cc | 18 bool SafeCast(L left, R* right) { argument 19 DCHECK(right); 20 COMPILE_ASSERT(sizeof(left) == sizeof(right), 24 *right = static_cast<L>(left);
|
/external/chromium_org/components/dom_distiller/core/ |
H A D | article_entry.cc | 28 bool AreEntriesEqual(const ArticleEntry& left, const ArticleEntry& right) { argument 30 DCHECK(IsEntryValid(right)); 31 return left.SerializeAsString() == right.SerializeAsString();
|
/external/chromium_org/content/browser/gamepad/ |
H A D | gamepad_standard_mappings.cc | 39 bool right = false; local 49 right = dir >= -.75f && dir < -.1f; 56 mapped->buttons[kButtonDpadRight].pressed = right; 57 mapped->buttons[kButtonDpadRight].value = right ? 1.f : 0.f;
|