Searched defs:rotateRight (Results 1 - 5 of 5) sorted by relevance

/libcore/ojluni/src/main/java/java/lang/
H A DInteger.java1496 * right rotation: {@code rotateLeft(val, -distance) == rotateRight(val,
1520 * left rotation: {@code rotateRight(val, -distance) == rotateLeft(val,
1523 * ignored, even if the distance is negative: {@code rotateRight(val,
1524 * distance) == rotateRight(val, distance & 0x1F)}.
1533 public static int rotateRight(int i, int distance) { method in class:Integer
H A DLong.java1491 * right rotation: {@code rotateLeft(val, -distance) == rotateRight(val,
1515 * left rotation: {@code rotateRight(val, -distance) == rotateLeft(val,
1518 * ignored, even if the distance is negative: {@code rotateRight(val,
1519 * distance) == rotateRight(val, distance & 0x3F)}.
1528 public static long rotateRight(long i, int distance) { method in class:Long
/libcore/ojluni/src/main/java/java/util/
H A DHashMap.java2200 static <K,V> TreeNode<K,V> rotateRight(TreeNode<K,V> root, method in class:HashMap.TreeNode
2244 root = rotateRight(root, xpp);
2258 root = rotateRight(root, x = xp);
2307 root = rotateRight(root, xpr);
2328 root = rotateRight(root, xp);
2356 root = rotateRight(root, xp);
H A DTreeMap.java2270 private void rotateRight(TreeMapEntry<K,V> p) { method in class:TreeMap
2305 rotateRight(parentOf(parentOf(x)));
2317 rotateRight(x);
2400 rotateRight(sib);
2415 rotateRight(parentOf(x));
2433 rotateRight(parentOf(x));
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DConcurrentHashMap.java3113 static <K,V> TreeNode<K,V> rotateRight(TreeNode<K,V> root, method in class:ConcurrentHashMap.TreeBin
3157 root = rotateRight(root, xpp);
3171 root = rotateRight(root, x = xp);
3220 root = rotateRight(root, xpr);
3241 root = rotateRight(root, xp);
3269 root = rotateRight(root, xp);

Completed in 31 milliseconds