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

/libcore/ojluni/src/main/java/java/lang/
H A DInteger.java1489 * right rotation: {@code rotateLeft(val, -distance) == rotateRight(val,
1492 * ignored, even if the distance is negative: {@code rotateLeft(val,
1493 * distance) == rotateLeft(val, distance & 0x1F)}.
1502 public static int rotateLeft(int i, int distance) { method in class:Integer
1513 * left rotation: {@code rotateRight(val, -distance) == rotateLeft(val,
H A DLong.java1487 * right rotation: {@code rotateLeft(val, -distance) == rotateRight(val,
1490 * ignored, even if the distance is negative: {@code rotateLeft(val,
1491 * distance) == rotateLeft(val, distance & 0x3F)}.
1500 public static long rotateLeft(long i, int distance) { method in class:Long
1511 * left rotation: {@code rotateRight(val, -distance) == rotateLeft(val,
/libcore/ojluni/src/main/java/java/util/
H A DHashMap.java2182 static <K,V> TreeNode<K,V> rotateLeft(TreeNode<K,V> root, method in class:HashMap.TreeNode
2237 root = rotateLeft(root, x = xp);
2265 root = rotateLeft(root, xpp);
2290 root = rotateLeft(root, xp);
2318 root = rotateLeft(root, xp);
2345 root = rotateLeft(root, xpl);
H A DTreeMap.java2277 private void rotateLeft(TreeMapEntry<K,V> p) { method in class:TreeMap
2327 rotateLeft(x);
2347 rotateLeft(parentOf(parentOf(x)));
2414 rotateLeft(parentOf(x));
2432 rotateLeft(parentOf(x));
2453 rotateLeft(sib);
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DConcurrentHashMap.java3095 static <K,V> TreeNode<K,V> rotateLeft(TreeNode<K,V> root, method in class:ConcurrentHashMap.TreeBin
3150 root = rotateLeft(root, x = xp);
3178 root = rotateLeft(root, xpp);
3203 root = rotateLeft(root, xp);
3231 root = rotateLeft(root, xp);
3258 root = rotateLeft(root, xpl);

Completed in 358 milliseconds