/external/icu/android_icu4j/src/main/java/android/icu/impl/locale/ |
H A D | XLocaleDistance.java | 230 final int distance; field in class:XLocaleDistance.DistanceNode 232 public DistanceNode(int distance) { argument 233 this.distance = distance; 245 && distance == ((DistanceNode) obj).distance); 249 return distance; 253 return "\ndistance: " + distance; 353 public StringDistanceNode(int distance, DistanceTable distanceTable) { argument 354 super(distance); 373 StringDistanceNode(int distance) argument 483 addSubtable(String desired, String supported, int distance) argument 722 public int distance(ULocale desired, ULocale supported, int threshold, DistanceOption distanceOption) { method in class:XLocaleDistance 962 printMatchXml(List<String> desired, List<String> supported, Integer distance, Boolean oneway) argument [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/locale/ |
H A D | XLocaleDistance.java | 226 final int distance; field in class:XLocaleDistance.DistanceNode 228 public DistanceNode(int distance) { argument 229 this.distance = distance; 241 && distance == ((DistanceNode) obj).distance); 245 return distance; 249 return "\ndistance: " + distance; 349 public StringDistanceNode(int distance, DistanceTable distanceTable) { argument 350 super(distance); 369 StringDistanceNode(int distance) argument 479 addSubtable(String desired, String supported, int distance) argument 718 public int distance(ULocale desired, ULocale supported, int threshold, DistanceOption distanceOption) { method in class:XLocaleDistance 958 printMatchXml(List<String> desired, List<String> supported, Integer distance, Boolean oneway) argument [all...] |
/external/brotli/research/ |
H A D | draw_histogram.cc | 27 DEFINE_uint64(min_distance, 0, "Minimum distance."); 28 DEFINE_uint64(max_distance, 1 << 30, "Maximum distance."); 31 DEFINE_bool(linear, false, "True if using linear distance mapping."); 84 int copy, pos, distance, x, y; local 86 while (ReadBackwardReference(fin, ©, &pos, &distance)) { 88 if (distance < min_distance || distance >= GetMaxDistance()) continue; 92 if (pos >= skip && distance <= pos) { 95 dist = DistanceTransform(static_cast<double>(distance)) - min_dist; 108 printf("pos = %d, distance [all...] |
/external/ImageMagick/MagickCore/ |
H A D | compare.c | 273 distance; 283 distance=Sa*p[i]-Da*GetPixelChannel(reconstruct_image,channel,q); 284 if ((distance*distance) > fuzz) 429 distance; 439 distance=Sa*p[i]-Da*GetPixelChannel(reconstruct_image,channel,q); 440 if ((distance*distance) > fuzz) 533 distance; 543 distance 271 distance; local 426 distance; local 530 distance; local 634 distance; local 732 distance; local 833 distance; local 1095 distance; local 1573 distance; local 1712 distance; local [all...] |
/external/libtextclassifier/util/calendar/ |
H A D | calendar-icu.cc | 50 int distance) { 60 for (int i = 0; i < distance; i++) { 76 date->add(UCalendarDateFields::UCAL_DAY_OF_MONTH, -1 * distance, status); 85 date->add(UCalendarDateFields::UCAL_DAY_OF_MONTH, -7 * (distance - 1), 95 date->add(UCalendarDateFields::UCAL_MONTH, -1 * (distance - 1), status); 103 date->add(UCalendarDateFields::UCAL_YEAR, -1 * (distance - 1), status); 179 int distance) { 189 for (int i = 0; i < distance; i++) { 205 date->add(UCalendarDateFields::UCAL_DAY_OF_MONTH, distance, status); 214 date->add(UCalendarDateFields::UCAL_DAY_OF_MONTH, 7 * distance, statu 49 DispatchToRecedeOrToLastDayOfWeek(icu::Calendar* date, int relation_type, int distance) argument 178 DispatchToAdvancerOrToNextDayOfWeek(icu::Calendar* date, int relation_type, int distance) argument [all...] |
/external/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_mcomp.h | 29 // Allowed motion vector pixel distance outside image border 62 int sad_per_bit, int distance, 88 int sad_per_bit, int distance, 93 int sad_per_bit, int distance,
|
/external/lzma/CS/7zip/Compress/LZ/ |
H A D | LzInWindow.cs | 108 public UInt32 GetMatchLen(Int32 index, UInt32 distance, UInt32 limit)
argument 113 distance++;
118 for (i = 0; i < limit && _bufferBase[pby + i] == _bufferBase[pby + i - distance]; i++);
|
/external/lzma/Java/SevenZip/Compression/LZ/ |
H A D | InWindow.java | 108 public int GetMatchLen(int index, int distance, int limit)
argument 113 distance++;
118 for (i = 0; i < limit && _bufferBase[pby + i] == _bufferBase[pby + i - distance]; i++);
|
/external/skia/src/effects/ |
H A D | SkDashPathEffect.cpp | 270 SkScalar distance = 0; local 300 distance += clampedInitialDashLength; 303 distance += fIntervals[1]; // skip over the next blank block too 305 distance += clampedInitialDashLength; 310 distance += SkScalarHalf(fIntervals[0]); 313 SkScalar x = pts[0].fX + tangent.fX * distance; 314 SkScalar y = pts[0].fY + tangent.fY * distance; 320 distance += fIntervalLength; 323 distance -= SkScalarHalf(fIntervals[0]); 329 SkScalar temp = length - distance; [all...] |
/external/skqp/src/effects/ |
H A D | SkDashPathEffect.cpp | 270 SkScalar distance = 0; local 300 distance += clampedInitialDashLength; 303 distance += fIntervals[1]; // skip over the next blank block too 305 distance += clampedInitialDashLength; 310 distance += SkScalarHalf(fIntervals[0]); 313 SkScalar x = pts[0].fX + tangent.fX * distance; 314 SkScalar y = pts[0].fY + tangent.fY * distance; 320 distance += fIntervalLength; 323 distance -= SkScalarHalf(fIntervals[0]); 329 SkScalar temp = length - distance; [all...] |
/external/lzma/C/ |
H A D | LzmaDec.c | 263 UInt32 distance;
local 269 distance = rep1;
278 distance = rep2;
283 distance = rep3;
289 rep0 = distance;
367 UInt32 distance;
local 370 TREE_6_DECODE(prob, distance);
371 if (distance >= kStartPosModelIndex)
373 unsigned posSlot = (unsigned)distance;
374 unsigned numDirectBits = (unsigned)(((distance >> [all...] |
/external/brotli/java/org/brotli/dec/ |
H A D | State.java | 64 int distance; field in class:State
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | DiscreteDomain.java | 29 * operations: {@link #next}, {@link #previous} and {@link #distance}, according 71 @Override public long distance(Integer start, Integer end) { method in class:DiscreteDomain.IntegerDomain 118 @Override public long distance(Long start, Long end) { method in class:DiscreteDomain.LongDomain 175 @Override public long distance(BigInteger start, BigInteger end) { method in class:DiscreteDomain.BigIntegerDomain 220 * next(next(next(start)))}, then {@code distance(start, end) == 3} and {@code 221 * distance(end, start) == -3}. As well, {@code distance(a, a)} is always 227 * @return the distance as described above, or {@link Long#MIN_VALUE} or 228 * {@link Long#MAX_VALUE} if the distance is too small or too large, 231 public abstract long distance( method in class:DiscreteDomain [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | RegularContiguousSet.java | 95 long distance = domain.distance(first(), last()); 96 return (distance >= Integer.MAX_VALUE) ? Integer.MAX_VALUE : (int) distance + 1;
|
/external/libcxx/test/std/containers/associative/map/map.cons/ |
H A D | iter_iter_comp_alloc.pass.cpp | 48 assert(distance(m.begin(), m.end()) == 3); 74 assert(distance(m.begin(), m.end()) == 3); 101 assert(distance(m.begin(), m.end()) == 3); 114 assert(distance(m.begin(), m.end()) == 3);
|
/external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
H A D | initializer_list_compare_alloc.pass.cpp | 46 assert(distance(m.begin(), m.end()) == 9); 80 assert(distance(m.begin(), m.end()) == 9); 112 assert(distance(m.begin(), m.end()) == 9); 145 assert(distance(m.begin(), m.end()) == 9);
|
/external/libcxx/test/std/containers/associative/multiset/multiset.cons/ |
H A D | copy.pass.cpp | 46 assert(distance(m.begin(), m.end()) == 9); 60 assert(distance(mo.begin(), mo.end()) == 9); 93 assert(distance(m.begin(), m.end()) == 9); 107 assert(distance(mo.begin(), mo.end()) == 9);
|
H A D | copy_assign.pass.cpp | 46 assert(distance(m.begin(), m.end()) == 9); 60 assert(distance(mo.begin(), mo.end()) == 9); 113 assert(distance(m.begin(), m.end()) == 9); 127 assert(distance(mo.begin(), mo.end()) == 9);
|
H A D | initializer_list_compare_alloc.pass.cpp | 31 assert(distance(m.begin(), m.end()) == 6);
|
H A D | iter_iter_comp.pass.cpp | 43 assert(distance(m.begin(), m.end()) == 9);
|
/external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
H A D | iter_iter.pass.cpp | 35 assert(d.size() == static_cast<std::size_t>(std::distance(f, l))); 36 assert(static_cast<std::size_t>(distance(d.begin(), d.end())) == d.size()); 49 assert(d.size() == static_cast<std::size_t>(std::distance(f, l))); 50 assert(static_cast<std::size_t>(distance(d.begin(), d.end())) == d.size());
|
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
H A D | sort.pass.cpp | 36 assert(distance(c.begin(), c.end()) == N);
|
/external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
H A D | insert_iter_value.pass.cpp | 31 assert(distance(l1.begin(), l1.end()) == 4);
|
/external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
H A D | init_size_hash_equal.pass.cpp | 66 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size()); 67 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size()); 101 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size()); 102 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
|
H A D | range_size.pass.cpp | 66 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size()); 67 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size()); 102 assert(static_cast<std::size_t>(std::distance(c.begin(), c.end())) == c.size()); 103 assert(static_cast<std::size_t>(std::distance(c.cbegin(), c.cend())) == c.size());
|