/external/guava/guava/src/com/google/common/collect/ |
H A D | SortedMaps.java | 160 * the right map must all compare as distinct according to the comparator 164 * same mappings, call {@code left.equals(right)} instead of this method. 167 * @param right the map to treat as the "right" map for purposes of comparison 172 SortedMap<K, ? extends V> left, Map<? extends K, ? extends V> right) { 173 return Maps.difference(left, right); 171 difference( SortedMap<K, ? extends V> left, Map<? extends K, ? extends V> right) argument
|
/external/guava/guava/src/com/google/common/primitives/ |
H A D | UnsignedInts.java | 128 // For pre-sizing a builder, just get the right order of magnitude 157 public int compare(int[] left, int[] right) { argument 158 int minLength = Math.min(left.length, right.length); 160 if (left[i] != right[i]) { 161 return UnsignedInts.compare(left[i], right[i]); 164 return left.length - right.length;
|
H A D | UnsignedLongs.java | 129 // For pre-sizing a builder, just get the right order of magnitude 159 public int compare(long[] left, long[] right) { argument 160 int minLength = Math.min(left.length, right.length); 162 if (left[i] != right[i]) { 163 return UnsignedLongs.compare(left[i], right[i]); 166 return left.length - right.length;
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | RegularContiguousSet.java | 77 private static boolean equalsOrThrow(Comparable<?> left, @Nullable Comparable<?> right) { argument 78 return right != null && Range.compareOrThrow(left, right) == 0;
|
/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/icu4c/common/ |
H A D | uarrsort.c | 31 uprv_uint16Comparator(const void *context, const void *left, const void *right) { argument 32 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; 36 uprv_int32Comparator(const void *context, const void *left, const void *right) { argument 37 return *(const int32_t *)left - *(const int32_t *)right; 41 uprv_uint32Comparator(const void *context, const void *left, const void *right) { argument 42 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; 123 int32_t left, right; local 125 /* start and left are inclusive, limit and right are exclusive */ 133 right=limit; 144 while(/* x<array[right [all...] |
H A D | unorm.cpp | 226 const UChar *right, int32_t rightLength, 234 left==NULL || leftLength<-1 || right==NULL || rightLength<-1) { 239 /* check for overlapping right and destination */ 241 ((right>=dest && right<(dest+destCapacity)) || 242 (rightLength>0 && dest>=right && dest<(right+rightLength))) 256 return n2->append(destString, UnicodeString(rightLength<0, right, rightLength), *pErrorCode). 262 const UChar *right, int32_t rightLength, 273 return _concatenate(left, leftLength, right, rightLengt 225 _concatenate(const UChar *left, int32_t leftLength, const UChar *right, int32_t rightLength, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UErrorCode *pErrorCode) argument 261 unorm_concatenate(const UChar *left, int32_t leftLength, const UChar *right, int32_t rightLength, UChar *dest, int32_t destCapacity, UNormalizationMode mode, int32_t options, UErrorCode *pErrorCode) argument [all...] |
/external/icu4c/i18n/ |
H A D | buddhcal.cpp | 48 BuddhistCalendar& BuddhistCalendar::operator= ( const BuddhistCalendar& right) argument 50 GregorianCalendar::operator=(right);
|
H A D | taiwncal.cpp | 48 TaiwanCalendar& TaiwanCalendar::operator= ( const TaiwanCalendar& right) argument 50 GregorianCalendar::operator=(right);
|
/external/javassist/src/main/javassist/compiler/ |
H A D | JvstTypeChecker.java | 68 protected void atFieldAssign(Expr expr, int op, ASTree left, ASTree right) argument 73 right.accept(this); 83 super.atFieldAssign(expr, op, left, right);
|
/external/javassist/src/main/javassist/compiler/ast/ |
H A D | ASTList.java | 22 * The right subtree must be an ASTList object or null. 26 private ASTList right; field in class:ASTList 30 right = _tail; 35 right = null; 44 public ASTree getRight() { return right; } 49 right = (ASTList)_right; 64 public ASTList tail() { return right; } 67 right = _tail; 82 list = list.right; 102 list = list.right; [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/collision/bih/ |
H A D | BIHNode.java | 60 private BIHNode right; field in class:BIHNode 99 return right; 102 public void setRightChild(BIHNode right) { argument 103 this.right = right; 122 oc.write(right, "right_node", null); 133 right = (BIHNode) ic.readSavable("right_node", null); 193 node = node.right; 195 stack.add(new BIHStackData(node.right, 0, 0)); 203 // node = node.right; [all...] |
/external/jmonkeyengine/engine/src/test/jme3test/terrain/ |
H A D | TerrainGridAlphaMapTest.java | 267 private boolean right; field in class:TerrainGridAlphaMapTest 282 TerrainGridAlphaMapTest.this.right = true; 284 TerrainGridAlphaMapTest.this.right = false; 313 if (this.right) {
|
/external/jsilver/src/com/google/clearsilver/jsilver/autoescape/ |
H A D | EscapeMode.java | 26 // subsequent template contents to determine the right escaping command to use. 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)); 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
|
/external/libvpx/libvpx/vp8/encoder/ |
H A D | mr_dissim.c | 108 const MODE_INFO *right = NULL; local 124 right = here + 1; 126 GET_MV_SIGN(right) 153 right = here + 1; 155 GET_MV(right)
|
/external/linux-tools-perf/util/added/ |
H A D | rbtree.c | 28 struct rb_node *right = node->rb_right; local 31 if ((node->rb_right = right->rb_left)) 32 rb_set_parent(right->rb_left, node); 33 right->rb_left = node; 35 rb_set_parent(right, parent); 40 parent->rb_left = right; 42 parent->rb_right = right; 45 root->rb_node = right; 46 rb_set_parent(node, right); 390 /* If we have a right [all...] |
/external/pixman/demos/ |
H A D | radial-test.c | 29 * to right: 96 double x0, x1, radius0, radius1, left, right, center; local 105 right = MAX (x0 + radius0, x1 + radius1); 106 center = (left + right) * 0.5;
|
/external/qemu/distrib/sdl-1.2.15/src/audio/dc/ |
H A D | SDL_dcaudio.c | 112 uint32 *right = (uint32*)(rightpos+SPU_RAM_BASE); local 125 g2_write_32(right++,rval); 134 uint32 *right = (uint32*)(rightpos+SPU_RAM_BASE); local 143 g2_write_32(right++,rval);
|
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
H A D | ShadowRect.java | 14 public void __constructor__(int left, int top, int right, int bottom) { argument 17 realRect.right = right; 24 realRect.right = otherRect.right; 30 set(rect.left, rect.top, rect.right, rect.bottom); 34 public void set(int left, int top, int right, int bottom) { argument 37 realRect.right = right; 43 return realRect.right 104 intersect(int left, int top, int right, int bottom) argument [all...] |
/external/skia/src/core/ |
H A D | SkRasterClip.h | 56 bool quickContains(int left, int top, int right, int bottom) const { argument 57 return quickContains(SkIRect::MakeLTRB(left, top, right, bottom)); 83 // these 2 are caches based on querying the right obj based on fIsBW
|
H A D | SkTSort.h | 121 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { argument 122 for (T* next = left + 1; next <= right; ++next) { 136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { argument 138 SkTSwap(*pivot, *right); 140 while (left < right) { 147 SkTSwap(*newPivot, *right); 154 * This implementation recurses on the left region after pivoting and loops on the right, 160 * @param right the end of the region to be sorted (inclusive). 163 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) { argument 165 if (right 191 SkTQSort(T* left, T* right, C lessThan) argument 201 SkTQSort(T* left, T* right) argument 206 SkTQSort(T** left, T** right) argument [all...] |
/external/skia/src/gpu/gl/ |
H A D | GrGLCaps.cpp | 352 const GrGLCaps::MSAACoverageMode& right) { 353 if (left.fCoverageSampleCnt < right.fCoverageSampleCnt) { 355 } else if (right.fCoverageSampleCnt < left.fCoverageSampleCnt) { 357 } else if (left.fColorSampleCnt < right.fColorSampleCnt) { 351 cov_mode_less(const GrGLCaps::MSAACoverageMode& left, const GrGLCaps::MSAACoverageMode& right) argument
|
/external/skia/src/pathops/ |
H A D | SkPathOpsLine.cpp | 35 // <0 for P2 right of the line 96 double SkDLine::ExactPointH(const SkDPoint& xy, double left, double right, double y) { argument 101 if (xy.fX == right) { 108 double SkDLine::NearPointH(const SkDPoint& xy, double left, double right, double y) { argument 112 if (!AlmostBetweenUlps(left, xy.fX, right)) { 115 double t = (xy.fX - left) / (right - left);
|
/external/skia/tests/ |
H A D | PathOpsQuadLineIntersectionTest.cpp | 45 double right = line[1].fX; local 46 flipped = left > right; 48 SkTSwap<double>(left, right); 50 result = intersections.horizontal(quad, left, right, line[0].fY, flipped);
|