/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | TestsForMapsInJavaUtil.java | 329 public int compare(T left, T right) { argument 330 return String.valueOf(left).compareTo(String.valueOf(right));
|
/external/guava/guava-tests/benchmark/com/google/common/collect/ |
H A D | BinaryTreeTraverserBenchmark.java | 35 final Optional<BinaryNode> left; field in class:BinaryTreeTraverserBenchmark.BinaryNode 38 BinaryNode(int x, Optional<BinaryNode> left, Optional<BinaryNode> right) { argument 40 this.left = left; 118 return node.left;
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | TreeTraverserTest.java | 51 final BinaryTree left; field in class:TreeTraverserTest.BinaryTree 55 private BinaryTree(char value, BinaryTree left, BinaryTree right) { argument 57 this.left = left; 74 return Optional.fromNullable(node.left);
|
/external/harfbuzz_ng/test/api/ |
H A D | test-shape.c | 72 hb_codepoint_t left, hb_codepoint_t right, 75 if (left == 1 && right == 2) 71 glyph_h_kerning_func(hb_font_t *font, void *font_data, hb_codepoint_t left, hb_codepoint_t right, void *user_data) argument
|
/external/icu/icu4c/source/common/ |
H A D | uarrsort.c | 38 uprv_uint16Comparator(const void *context, const void *left, const void *right) { argument 39 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; 43 uprv_int32Comparator(const void *context, const void *left, const void *right) { argument 44 return *(const int32_t *)left - *(const int32_t *)right; 48 uprv_uint32Comparator(const void *context, const void *left, const void *right) { argument 49 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; 171 int32_t left, right; local 173 /* start and left are inclusive, limit and right are exclusive */ 180 left=start; 187 while(/* array[left]< [all...] |
H A D | unorm.cpp | 223 _concatenate(const UChar *left, int32_t leftLength, argument 232 left==NULL || leftLength<-1 || right==NULL || rightLength<-1) { 246 /* allow left==dest */ 248 if(left==dest) { 252 destString.append(left, leftLength); 259 unorm_concatenate(const UChar *left, int32_t leftLength, argument 271 return _concatenate(left, leftLength, right, rightLength, 274 return _concatenate(left, leftLength, right, rightLength,
|
/external/icu/icu4c/source/i18n/ |
H A D | collationcompare.cpp | 27 CollationCompare::compareUpToQuaternary(CollationIterator &left, CollationIterator &right, argument 47 int64_t ce = left.nextCE(errorCode); 55 left.setCurrentCE(ce & INT64_C(0xffffffff00000000)); 57 ce = left.nextCE(errorCode); 60 left.setCurrentCE(0); 117 leftSecondary = ((uint32_t)left.getCE(leftIndex++)) >> 16; 139 while((p = (uint32_t)(left.getCE(leftLimit) >> 32)) > 157 leftSecondary = ((uint32_t)left.getCE(--leftIndex)) >> 16; 174 U_ASSERT(left.getCE(leftLimit) == right.getCE(rightLimit)); 197 ce = left [all...] |
/external/icu/icu4c/source/test/cintltst/ |
H A D | sorttest.c | 124 linesComparator(const void *context, const void *left, const void *right) { argument 126 const Line *leftLine=(const Line *)left;
|
/external/javassist/src/main/javassist/compiler/ |
H A D | JvstTypeChecker.java | 68 protected void atFieldAssign(Expr expr, int op, ASTree left, ASTree right) argument 71 if (left instanceof Member 72 && ((Member)left).get().equals(codeGen.paramArrayName)) { 83 super.atFieldAssign(expr, op, left, right); 173 ASTree left = args.head(); 174 return (left instanceof Member 175 && ((Member)left).get().equals(codeGen.paramListName));
|
/external/javassist/src/main/javassist/compiler/ast/ |
H A D | ASTList.java | 25 private ASTree left; field in class:ASTList 29 left = _head; 34 left = _head; 42 public ASTree getLeft() { return left; } 46 public void setLeft(ASTree _left) { left = _left; } 55 public ASTree head() { return left; } 58 left = _head; 80 ASTree a = list.left; 129 if (list.left == oldObj) { 130 list.left [all...] |
/external/jsilver/src/com/google/clearsilver/jsilver/autoescape/ |
H A D | EscapeMode.java | 92 * values are provided by {@code left} and {@code right} respectively. For now, if either of the 99 public static EscapeMode combineModes(EscapeMode left, EscapeMode right) { argument 100 if (left.equals(ESCAPE_NONE) || right.equals(ESCAPE_NONE)) {
|
/external/jsilver/src/com/google/clearsilver/jsilver/data/ |
H A D | DefaultHdfParser.java | 57 output.setValue(createFullPath(context, split.left), split.right); 63 output.setValue(createFullPath(context, split.left), readToToken(lineReader, split.right)); 67 context.add(split.left); 74 output.setSymlink(createFullPath(context, split.left), split.right); 124 result.left = line.substring(0, position).trim(); 133 String left; field in class:DefaultHdfParser.Split
|
/external/libhevc/common/arm/ |
H A D | ihevc_intra_ref_substitution_a9q.c | 76 * UWORD8 pointer to the top-left 82 * UWORD8 pointer to the left 118 WORD32 bot_left, left, top, tp_right, tp_left; local 144 left = (nbr_flags & 0x000f0); 151 pu1_dst[(4 * nt)] = *pu1_top_left; // U top-left sample 152 pu1_dst[(4 * nt) + 1] = *(pu1_top_left + 1); // V top-left sample 155 if(0 != left) 159 pu1_dst[(4 * nt) - 2 - i] = pu1_left[j * src_strd]; // U left samples 160 pu1_dst[(4 * nt) - 1 - i] = pu1_left[(j * src_strd) + 1]; // V left samples 169 pu1_dst[(4 * nt) - 2 - i] = pu1_left[j * src_strd]; // U left sample 415 WORD32 bot_left, left, top, tp_right, tp_left; local [all...] |
/external/libvpx/libvpx/vp8/common/ |
H A D | findnearmv.c | 37 const MODE_INFO *left = here - 1; local 61 /* Process left */ 62 if (left->mbmi.ref_frame != INTRA_FRAME) 64 if (left->mbmi.mv.as_int) 68 this_mv.as_int = left->mbmi.mv.as_int; 69 mv_bias(ref_frame_sign_bias[left->mbmi.ref_frame], refframe, &this_mv, ref_frame_sign_bias); 83 /* Process above left */ 108 /* See if above-left MV can be merged with NEAREST */ 114 + (left->mbmi.mode == SPLITMV)) * 2
|
/external/libvpx/libvpx/vp8/encoder/ |
H A D | mr_dissim.c | 107 const MODE_INFO *left = here - 1; local 121 GET_MV_SIGN(left) 150 GET_MV(left)
|
/external/libvpx/libvpx/vpx_dsp/mips/ |
H A D | intrapred16_dspr2.c | 15 const uint8_t *above, const uint8_t *left) { 20 "lb %[tmp1], (%[left]) \n\t" 21 "lb %[tmp2], 1(%[left]) \n\t" 22 "lb %[tmp3], 2(%[left]) \n\t" 23 "lb %[tmp4], 3(%[left]) \n\t" 24 "lb %[tmp5], 4(%[left]) \n\t" 25 "lb %[tmp6], 5(%[left]) \n\t" 26 "lb %[tmp7], 6(%[left]) \n\t" 27 "lb %[tmp8], 7(%[left]) \n\t" 28 "lb %[tmp9], 8(%[left]) \ 14 vpx_h_predictor_16x16_dspr2(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument 161 vpx_dc_predictor_16x16_dspr2(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument [all...] |
H A D | intrapred4_dspr2.c | 15 const uint8_t *above, const uint8_t *left) { 19 "lb %[tmp1], (%[left]) \n\t" 20 "lb %[tmp2], 1(%[left]) \n\t" 21 "lb %[tmp3], 2(%[left]) \n\t" 22 "lb %[tmp4], 3(%[left]) \n\t" 37 : [left] "r" (left), [dst] "r" (dst), [stride] "r" (stride) 42 const uint8_t *above, const uint8_t *left) { 49 "lw %[left_c], (%[left]) \n\t" 78 : [above] "r" (above), [left] " 14 vpx_h_predictor_4x4_dspr2(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument 41 vpx_dc_predictor_4x4_dspr2(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument 83 vpx_tm_predictor_4x4_dspr2(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument [all...] |
/external/ltrace/sysdeps/linux-gnu/ia64/ |
H A D | breakpoint.c | 74 unsigned char left, right; local 76 left = (c >> (to % 8)) << (to % 8); 82 c |= right | left;
|
/external/lzma/CPP/7zip/Common/ |
H A D | LimitedStreams.cpp | 147 unsigned left = 0, right = Extents.Size() - 1;
local 150 unsigned mid = (left + right) / 2;
151 if (mid == left)
156 left = mid;
159 const CSeekExtent &extent = Extents[left];
168 UInt64 rem = Extents[left + 1].Virt - _virtPos;
|
/external/lzma/CPP/7zip/UI/FileManager/ |
H A D | SysIconUtils.cpp | 119 unsigned left = 0, right = vect.Size();
local 120 while (left != right)
122 unsigned mid = (left + right) / 2;
129 left = mid + 1;
131 insertPos = left;
137 unsigned left = 0, right = vect.Size();
local 138 while (left != right)
140 unsigned mid = (left + right) / 2;
147 left = mid + 1;
149 insertPos = left;
[all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_string.h | 198 size_t left; member in struct:util_strbuf 208 sbuf->left = size; 215 if(sbuf->left > 1) { 219 written = util_vsnprintf(sbuf->ptr, sbuf->left, format, ap); 222 sbuf->left -= written;
|
/external/opencv3/3rdparty/libwebp/enc/ |
H A D | tree.c | 338 int left = preds[-1]; local 340 const uint8_t* const probas = kBModesProba[top_pred[x]][left]; 341 left = PutI4Mode(bw, preds[x], probas);
|
/external/opencv3/3rdparty/zlib/ |
H A D | gzread.c | 79 left unchanged if there is no more input data available, will be set to COPY 488 unsigned left, n; local 514 left = (unsigned)len - 1; 515 if (left) do { 525 n = state->x.have > left ? left : state->x.have; 535 left -= n; 537 } while (left && eol == NULL);
|
H A D | infback.c | 131 left = strm->avail_out; \ 142 strm->avail_out = left; \ 212 if (left == 0) { \ 214 left = state->wsize; \ 215 state->whave = left; \ 216 if (out(out_desc, put, left)) { \ 260 unsigned have, left; /* available input and output */ local 287 left = state->wsize; 346 if (copy > left) copy = left; [all...] |
/external/opencv3/modules/core/test/ |
H A D | test_countnonzero.cpp | 135 double left = -1.0, right = 1.0; local 142 rng.fill(src, RNG::UNIFORM, Scalar::all(left), Scalar::all(right));
|