Searched refs:distance (Results 1 - 6 of 6) sorted by relevance
/libcore/ojluni/src/main/java/sun/security/provider/certpath/ |
H A D | Builder.java | 131 * get distance of one GeneralName from another 137 * @return distance of test name from base, where 0 143 static int distance(GeneralNameInterface base, method in class:Builder 149 debug.println("Builder.distance(): Names are different types"); 154 debug.println("Builder.distance(): Names are same type but " + 173 * get hop distance of one GeneralName from another in links where 175 * For example, the hop distance from ou=D,ou=C,o=B,c=US to 176 * ou=F,ou=E,ou=C,o=B,c=US is 3: D->C, C->E, E->F. The hop distance 183 * @return distance of test name from base measured in hops in the 250 * @return distance fro [all...] |
H A D | ForwardBuilder.java | 490 * then it is preferable, in order of increasing naming distance. 498 Builder.distance(tSubjectName, cIssuer1Name, -1); 500 Builder.distance(tSubjectName, cIssuer2Name, -1); 521 * then it is preferable, in order of increasing naming distance. 529 int distanceTto1 = Builder.distance 531 int distanceTto2 = Builder.distance 554 * distance. 593 * then it is preferable, in order of increasing naming distance. 607 int distanceStoI1 = Builder.distance 609 int distanceStoI2 = Builder.distance [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ArrayBlockingQueue.java | 1034 int distance = index - prevTakeIndex; 1035 if (distance < 0) 1036 distance += length; 1037 return dequeues > distance; 1221 private int distance(int index, int prevTakeIndex, int length) { method in class:ArrayBlockingQueue.Itr 1222 int distance = index - prevTakeIndex; 1223 if (distance < 0) 1224 distance += length; 1225 return distance; 1241 // distance fro [all...] |
/libcore/ojluni/src/main/java/java/lang/ |
H A D | Integer.java | 1208 * <p>Note that left rotation with a negative distance is equivalent to 1209 * right rotation: {@code rotateLeft(val, -distance) == rotateRight(val, 1210 * distance)}. Note also that rotation by any multiple of 32 is a 1211 * no-op, so all but the last five bits of the rotation distance can be 1212 * ignored, even if the distance is negative: {@code rotateLeft(val, 1213 * distance) == rotateLeft(val, distance & 0x1F)}. 1220 public static int rotateLeft(int i, int distance) { argument 1221 return (i << distance) | (i >>> -distance); 1242 rotateRight(int i, int distance) argument [all...] |
H A D | Long.java | 1134 * <p>Note that left rotation with a negative distance is equivalent to 1135 * right rotation: {@code rotateLeft(val, -distance) == rotateRight(val, 1136 * distance)}. Note also that rotation by any multiple of 64 is a 1137 * no-op, so all but the last six bits of the rotation distance can be 1138 * ignored, even if the distance is negative: {@code rotateLeft(val, 1139 * distance) == rotateLeft(val, distance & 0x3F)}. 1146 public static long rotateLeft(long i, int distance) { argument 1147 return (i << distance) | (i >>> -distance); 1168 rotateRight(long i, int distance) argument [all...] |
/libcore/ojluni/src/main/java/java/util/ |
H A D | Collections.java | 792 * Rotates the elements in the specified list by the specified distance. 794 * the element previously at index <tt>(i - distance)</tt> mod 821 * of the rotation distance. To move elements backward, use a positive 822 * shift distance. 832 * list into two sublist views around index <tt>-distance mod size</tt>. 839 * @param distance the distance to rotate the list. There are no 846 public static void rotate(List<?> list, int distance) { argument 848 rotate1(list, distance); 850 rotate2(list, distance); 853 rotate1(List<T> list, int distance) argument 876 rotate2(List<?> list, int distance) argument [all...] |
Completed in 485 milliseconds