| /external/deqp-deps/SPIRV-Tools/source/comp/ |
| huffman_codec.h | 51 : value(in_value), left(in_left), right(in_right) {}
61 uint32_t right = 0; member in struct:spvtools::comp::HuffmanCodec::Node
101 const uint32_t right = queue.top(); local
107 root_ = right;
114 // Combine left and right into a new tree and push it into the queue.
116 MutableWeightOf(parent) = WeightOf(right) + WeightOf(left);
118 MutableRightOf(parent) = right;
162 code << ", " << node.left << ", " << node.right << "},\n";
174 // Right tree branches appear above left branches. Taking the right pat
[all...] |
| move_to_front.h | 40 // the right side).
112 uint32_t right = 0; member in struct:spvtools::comp::MoveToFront::Node
137 // Returns right child of |node|.
138 uint32_t RightOf(uint32_t node) const { return nodes_.at(node).right; }
167 // Returns mutable reference to handle of right child of |node|.
170 return nodes_.at(node).right;
203 // Returns true iff |node| is right child of its parent.
221 // Returns the height difference between right and left subtrees.
262 // Rotates |node| right, reassigns all connections and returns the node
|
| /external/eigen/Eigen/src/Core/arch/AVX/ |
| MathFunctions.h | 88 Packet8f right = pmadd(p8f_coeff_right_6, z_minus_two2, p8f_coeff_right_4); local
89 right = pmadd(right, z_minus_two2, p8f_coeff_right_2);
90 right = pmadd(right, z_minus_two2, p8f_coeff_right_0);
103 // Assemble the results, i.e. select the left and right polynomials.
105 right = _mm256_and_ps(ival_mask, right);
106 Packet8f res = _mm256_or_ps(left, right);
314 // digits right
[all...] |
| /external/eigen/bench/ |
| bench_gemm.cpp | 58 static char right = 'R'; variable
|
| /external/eigen/unsupported/Eigen/src/Splines/ |
| Spline.h | 260 BasisVectorType right(p+1); right(0) = Scalar(0);
263 VectorBlock<BasisVectorType,Degree>(right,1,p) = VectorBlock<const KnotVectorType,Degree>(U,i+1,p) - u;
272 const Scalar tmp = N(r)/(right(r+1)+left(j-r));
273 N[r] = saved + right(r+1)*tmp;
393 BasisVectorType right = BasisVectorType::Zero(p+1); local
405 right[j] = U[span+j]-u;
411 ndu(j,r) = right[r+1]+left[j-r];
414 ndu(r,j) = static_cast<Scalar>(saved+right[r+1] * temp);
|
| /external/elfutils/libdwelf/ |
| dwelf_strtab.c | 52 struct Dwelf_Strent *right; member in struct:Dwelf_Strent
173 newstr->right = NULL;
207 return searchstring (&(*sep)->right, newstr);
263 newstr->right = (*sep)->right;
311 if (nodep->right != NULL)
312 copystrings (nodep->right, freep, offsetp);
|
| /external/epid-sdk/epid/member/tiny/math/src/ |
| vli.c | 51 VeryLargeInt const* right) {
55 uint32_t sum = left->word[i] + right->word[i] + carry;
63 VeryLargeInt const* right) {
72 uint64_t product = (uint64_t)left->word[i] * right->word[k - i];
92 VeryLargeInt const* right) {
97 uint32_t diff = left->word[i] - right->word[i] - borrow;
148 int VliCmp(VeryLargeInt const* left, VeryLargeInt const* right) {
152 ((left->word[i] > right->word[i]) - (left->word[i] < right->word[i])) *
159 VeryLargeInt const* right, VeryLargeInt const* mod)
257 uint32_t left = 0, right; local
[all...] |
| /external/grpc-grpc-java/examples/src/main/java/io/grpc/examples/routeguide/ |
| RouteGuideServer.java | 143 int right = max(request.getLo().getLongitude(), request.getHi().getLongitude()); local
154 if (lon >= left && lon <= right && lat >= bottom && lat <= top) {
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| TransliterationRule.java | 152 * @param anchorEnd true if the rule is anchored on the right to the
285 * right. The characters of r1 must equal (or be a superset
315 int right = pattern.length() - left; local
322 if (left == left2 && right == right2 &&
332 (right < right2 ||
333 (right == right2 && keyLength <= r2.keyLength)) &&
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/stringprep/ |
| NFS4StringPrep.java | 107 int left, middle, right,rc; local
110 right= sortedArr.length-1;
112 while(left <= right){
113 middle = (left+right)/2;
119 right = middle -1;
|
| /external/icu/icu4c/source/common/ |
| propsvec.cpp | 315 const uint32_t *left=(const uint32_t *)l, *right=(const uint32_t *)r; local
324 if(left[i]!=right[i]) {
325 return left[i]<right[i] ? -1 : 1;
|
| /external/icu/icu4c/source/test/cintltst/ |
| nfsprep.c | 155 int left, middle, right,rc; local
158 right= sortedArrLen-1;
160 while(left <= right){
161 middle = (left+right)/2;
167 right = middle -1;
|
| /external/icu/icu4j/main/classes/translit/src/com/ibm/icu/text/ |
| TransliterationRule.java | 151 * @param anchorEnd true if the rule is anchored on the right to the
284 * right. The characters of r1 must equal (or be a superset
314 int right = pattern.length() - left; local
321 if (left == left2 && right == right2 &&
331 (right < right2 ||
332 (right == right2 && keyLength <= r2.keyLength)) &&
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/stringprep/ |
| NFS4StringPrep.java | 104 int left, middle, right,rc; local
107 right= sortedArr.length-1;
109 while(left <= right){
110 middle = (left+right)/2;
116 right = middle -1;
|
| /external/iproute2/tc/ |
| em_meta.c | 282 struct tcf_meta_val *right = obj; local
284 if (TCF_META_TYPE(right->kind) == TCF_META_TYPE(left->kind))
287 if (can_adopt(left) && !can_adopt(right)) {
288 if (is_compatible(left, right))
289 left->kind = overwrite_type(left, right);
292 } else if (can_adopt(right) && !can_adopt(left)) {
293 if (is_compatible(right, left))
294 right->kind = overwrite_type(right, left);
297 } else if (can_adopt(left) && can_adopt(right)) {
[all...] |
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/expr/ |
| BinaryExpr.java | 39 * An expression with an expression on the left, an expression on the right, and an operator in the middle.
112 private Expression right; field in class:BinaryExpr
121 public BinaryExpr(Expression left, Expression right, Operator operator) {
122 this(null, left, right, operator);
129 public BinaryExpr(TokenRange tokenRange, Expression left, Expression right, Operator operator) {
132 setRight(right);
161 return right;
190 public BinaryExpr setRight(final Expression right) {
191 assertNotNull(right);
192 if (right == this.right)
[all...] |
| /external/jline/src/src/main/java/jline/ |
| ANSIBuffer.java | 162 * wrapping (useful for writing the right-most column without
194 * Moves the cursor n positions to the right. If n plus the current
198 public static String right(final int n) { method in class:ANSIBuffer.ANSICodes
221 * the upper left corner. The lower right corner of a usual DOS
310 * RIGHT ARROW (num keypad) 0;77 54 0;116 --
320 * RIGHT ARROW (224;77) (224;77) (224;116) (224;157)
|
| /external/jsilver/src/com/google/clearsilver/jsilver/compiler/ |
| EscapingEvaluator.java | 138 JavaExpression right = currentEscapingExpression; local
140 setEscaping(or(left, right));
|
| /external/kernel-headers/original/uapi/drm/ |
| qxl_drm.h | 102 __u32 right; member in struct:drm_qxl_update_area
|
| /external/kernel-headers/original/uapi/sound/ |
| asound_fm.h | 62 unsigned char right; /* stereo right */ member in struct:snd_dm_fm_voice
|
| /external/libaom/libaom/aom_scale/generic/ |
| yv12extend.c | 28 /* copy the left and right most columns out */
69 /* copy the left and right most columns out */
150 const int right = left + ybf->widths[is_uv] - ybf->crop_widths[is_uv]; local
153 left, bottom, right);
162 const int right = left + ybf->widths[is_uv] - ybf->crop_widths[is_uv]; local
165 bottom, right);
|
| /external/libaom/libaom/common/ |
| args.c | 60 char *left, *right, *comment; local
64 right = strchr(actual_line, ':');
65 if (right == NULL) continue;
66 right[0] = '\0';
69 right = ignore_front_spaces(right + 1);
71 comment = strchr(right, '#');
75 ignore_end_spaces(right);
82 if (!strcmp(right, "ON"))
85 snprintf(new_line, sizeof(*new_line) * 128, "--%s=%s", left, right);
[all...] |
| /external/libchrome/ui/gfx/geometry/ |
| rect.h | 99 constexpr int right() const { return x() + width(); } function in class:gfx::Rect
102 constexpr Point top_right() const { return Point(right(), y()); }
104 constexpr Point bottom_right() const { return Point(right(), bottom()); }
118 void SetByBounds(int left, int top, int right, int bottom);
129 void Inset(int left, int top, int right, int bottom);
230 // Clamp the size to avoid integer overflow in bottom() and right().
263 // points", except that we consider points on the right/bottom edges of the
285 std::ceil(rect.right() * x_scale)));
291 x : static_cast<int>(std::ceil(rect.right() * x_scale));
329 std::floor(rect.right() * x_scale)))
[all...] |
| /external/libcups/cups/ |
| array.c | 1146 * Shift other elements to the right...
1202 right, /* Right side of search */ local
1240 * Start with previous on right side...
1244 right = prev;
1253 right = a->num_elements - 1;
1263 right = a->num_elements - 1;
1268 current = (left + right) / 2;
1271 DEBUG_printf(("9cups_array_find: left=%d, right=%d, current=%d, diff=%d",
1272 left, right, current, diff))
[all...] |
| /external/libdrm/include/drm/ |
| qxl_drm.h | 104 __u32 right; member in struct:drm_qxl_update_area
|
