| /external/epid-sdk/epid/member/tiny/math/unittests/ |
| fq6-test.cc | 58 Fq6Elem right = {{{0x848cdb73, 0x6399829e, 0xcaa20cc0, 0x1b02bff6, 0x2b477bd2, local
71 Fq6Add(&actual, &left, &right);
103 Fq6Elem right = {{{0x848cdb73, 0x6399829e, 0xcaa20cc0, 0x1b02bff6, 0x2b477bd2, local
116 Fq6Sub(&actual, &left, &right);
148 Fq6Elem right = {{{0x848cdb73, 0x6399829e, 0xcaa20cc0, 0x1b02bff6, 0x2b477bd2, local
161 Fq6Mul(&actual, &left, &right);
|
| /external/guava/guava/src/com/google/common/collect/ |
| BinaryTreeTraverser.java | 49 * Returns the right child of the specified node, or {@link Optional#absent()} if the specified
50 * node has no right child.
55 * Returns the children of this node, in left-to-right order.
78 Optional<T> right = rightChild(root); local
79 if (right.isPresent()) {
80 return right.get();
|
| LexicographicalOrdering.java | 42 Iterator<T> right = rightIterable.iterator(); local
44 if (!right.hasNext()) {
47 int result = elementOrder.compare(left.next(), right.next());
52 if (right.hasNext()) {
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| BinaryTreeTraverser.java | 42 * Returns the right child of the specified node, or {@link Optional#absent()} if the specified
43 * node has no right child.
48 * Returns the children of this node, in left-to-right order.
71 Optional<T> right = rightChild(root); local
72 if (right.isPresent()) {
73 return right.get();
|
| /external/jsilver/src/com/google/clearsilver/jsilver/functions/operators/ |
| AddFunction.java | 31 Value right = args[1]; local
32 EscapeMode mode = EscapeMode.combineModes(left.getEscapeMode(), right.getEscapeMode());
33 return literalValue(left.asString() + right.asString(), mode, left.isPartiallyEscaped()
34 || right.isPartiallyEscaped());
|
| SubtractFunction.java | 34 Value right = args[1]; local
35 return literalConstant(left.asNumber() - right.asNumber(), left, right);
|
| /external/libaom/libaom/av1/common/ |
| tile_common.h | 44 int left, top, right, bottom; member in struct:__anon26561
|
| /external/libchrome/ui/gfx/geometry/mojo/ |
| geometry_struct_traits.h | 28 static int right(const gfx::Insets& p) { return p.right(); } function in struct:mojo::StructTraits
30 out->Set(data.top(), data.left(), data.bottom(), data.right());
40 static float right(const gfx::InsetsF& p) { return p.right(); } function in struct:mojo::StructTraits
42 out->Set(data.top(), data.left(), data.bottom(), data.right());
|
| /external/lzma/CPP/7zip/Common/ |
| UniqBlocks.cpp | 11 unsigned left = 0, right = Sorted.Size();
local
12 while (left != right)
14 unsigned mid = (left + right) / 2;
19 right = mid;
30 right = mid;
|
| /external/parameter-framework/upstream/test/tmpfile/ |
| TmpFile.hpp | 58 TmpFile(TmpFile &&right) : mPath(std::move(right.mPath)) { right.mPath.clear(); }
62 TmpFile(const TmpFile &right) = delete; member in class:parameterFramework::utility::TmpFile
63 TmpFile &operator=(const TmpFile &right) = delete; member in class:parameterFramework::utility::TmpFile
66 TmpFile &operator=(TmpFile &&right)
69 mPath = std::move(right.mPath);
70 right.mPath.clear();
|
| /external/pdfium/core/fpdfapi/page/ |
| cpdf_pageobjectholder.cpp | 63 float right = -1000000.0f; local
68 right = std::max(right, pObj->m_Right);
72 return CFX_FloatRect(left, bottom, right, top);
|
| /external/skia/bench/ |
| TableBench.cpp | 58 SkRect right = SkRect::MakeLTRB(col * kCellWidth + (kCellWidth-SK_Scalar1), local
62 canvas->drawRect(right, borderPaint);
|
| /external/skia/tests/ |
| BlitMaskClip.cpp | 27 int right = x + width; variable
28 REPORTER_ASSERT(fReporter, right > fBounds.fLeft && right <= fBounds.fRight);
64 for (int right = left + 1; right <= b.fRight; right++) {
65 SkIRect clipRect = {left, top, right, bottom};
|
| /external/skqp/bench/ |
| TableBench.cpp | 58 SkRect right = SkRect::MakeLTRB(col * kCellWidth + (kCellWidth-SK_Scalar1), local
62 canvas->drawRect(right, borderPaint);
|
| /external/skqp/tests/ |
| BlitMaskClip.cpp | 27 int right = x + width; variable
28 REPORTER_ASSERT(fReporter, right > fBounds.fLeft && right <= fBounds.fRight);
64 for (int right = left + 1; right <= b.fRight; right++) {
65 SkIRect clipRect = {left, top, right, bottom};
|
| /external/u-boot/post/lib_powerpc/ |
| complex.c | 56 int right; local
65 right = 1;
68 right *= x;
70 right = 1 - right;
72 if (left != right)
|
| /external/v8/benchmarks/spinning-balls/ |
| 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 child of the ne
281 SplayTree.Node.prototype.right = null; method in class:SplayTree.Node
[all...] |
| /external/webrtc/webrtc/voice_engine/ |
| utility.cc | 93 int32_t right = 0; local
96 right = source[i] + target[i * 2 + 1];
98 target[i * 2 + 1] = WebRtcSpl_SatW32ToW16(right);
|
| /external/jsilver/src/com/google/clearsilver/jsilver/data/ |
| DefaultHdfParser.java | 57 output.setValue(createFullPath(context, split.left), split.right);
63 output.setValue(createFullPath(context, split.left), readToToken(lineReader, split.right));
74 output.setSymlink(createFullPath(context, split.left), split.right);
125 result.right = line.substring(position + delimiter.length()).trim();
134 String right; field in class:DefaultHdfParser.Split
|
| /art/compiler/optimizing/ |
| instruction_simplifier_x86_shared.cc | 32 HInstruction* right = instruction->GetRight(); local
33 // Perform simplication only when either left or right
36 if (left->IsNot() ^ right->IsNot()) {
38 HInstruction* other_ins = (left_is_not ? right : left);
39 HNot* not_ins = (left_is_not ? left : right)->AsNot();
70 HInstruction* right = instruction->GetRight(); local
71 if (AreLeastSetBitInputs(left, right)) {
73 other = right;
74 } else if (AreLeastSetBitInputs(right, left)) {
75 candidate = right;
101 HInstruction* right = instruction->GetRight(); local
[all...] |
| /bionic/libc/system_properties/include/system_properties/ |
| prop_area.h | 49 // left / \ right left / | prop +===========+
62 // left, right, children "pointers" in the trie node. To make sure readers who see the
67 // Its situation is similar to the left, right, children "pointers". So we use
72 // same field are carried out in the right order.
76 atomic_uint_least32_t right; member in struct:prop_bt
|
| /developers/build/prebuilts/gradle/WearMessagingApp/Wearable/src/main/java/com/example/android/wearable/wear/messaging/util/ |
| DividerItemDecoration.java | 37 int right = parent.getRight(); local
47 mDrawable.setBounds(left, top, right, bottom);
|
| /developers/samples/android/deprecated/wearable/wear/WearMessagingApp/Wearable/src/main/java/com/example/android/wearable/wear/messaging/util/ |
| DividerItemDecoration.java | 37 int right = parent.getRight(); local
47 mDrawable.setBounds(left, top, right, bottom);
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Objects/stringlib/ |
| transmogrify.h | 85 pad(PyObject *self, Py_ssize_t left, Py_ssize_t right, char fill)
91 if (right < 0)
92 right = 0;
94 if (left == 0 && right == 0 && STRINGLIB_CHECK_EXACT(self)) {
106 left + STRINGLIB_LEN(self) + right);
113 if (right)
115 fill, right);
local
154 "Return B right justified in a string of length width. Padding is\n"
|
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/ |
| ASTBase.h | 65 ASTBase *right() { return _right; }
function in class:ASTBase
70 PCCTS_AST *right() { return _right; } // define the SORCERER interface
function in class:ASTBase
|
