HomeSort by relevance Sort by last modified time
    Searched refs:bIndex (Results 1 - 8 of 8) sorted by null

  /external/icu/android_icu4j/src/main/java/android/icu/lang/
CharSequences.java 50 * Find the longest n such that a[aIndex,n] = b[bIndex,n], and n is on a character boundary.
55 public static int matchAfter(CharSequence a, CharSequence b, int aIndex, int bIndex) {
56 int i = aIndex, j = bIndex;
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/lang/
CharSequences.java 48 * Find the longest n such that a[aIndex,n] = b[bIndex,n], and n is on a character boundary.
53 public static int matchAfter(CharSequence a, CharSequence b, int aIndex, int bIndex) {
54 int i = aIndex, j = bIndex;
  /external/skia/src/pathops/
SkIntersections.cpp 132 int bIndex) {
135 fT[1][0] = b.fT[0][bIndex];
137 fPt2[0] = b.fPt[bIndex];
  /external/skqp/src/pathops/
SkIntersections.cpp 132 int bIndex) {
135 fT[1][0] = b.fT[0][bIndex];
137 fPt2[0] = b.fPt[bIndex];
  /external/deqp/framework/common/
tcuImageCompare.cpp 452 const deInt32 bIndex = getPositionOfIEEEFloatWithoutDenormals(b);
453 return (deUint32)de::abs(aIndex - bIndex);
    [all...]
  /external/owasp/sanitizer/tools/findbugs/lib/
findbugs.jar 
  /external/cldr/tools/java/libs/
icu4j.jar 
  /external/icu/tools/srcgen/currysrc/libs/
org.eclipse.jdt.core_3.14.0.v20180528-0519.jar 

Completed in 250 milliseconds