diff --git a/src/java/com/samskivert/swing/util/ProximityTracker.java b/src/java/com/samskivert/swing/util/ProximityTracker.java
index d4dea4b3..b6b50eb6 100644
--- a/src/java/com/samskivert/swing/util/ProximityTracker.java
+++ b/src/java/com/samskivert/swing/util/ProximityTracker.java
@@ -240,7 +240,7 @@ public class ProximityTracker
 	int high = _size-1;
 
 	while (low <= high) {
-	    int mid = (low + high) >> 1;
+	    int mid = (low + high) >>> 1;
 	    int cmp = (_records[mid].x - x);
 
 	    if (cmp < 0) {
diff --git a/src/java/com/samskivert/util/ArrayUtil.java b/src/java/com/samskivert/util/ArrayUtil.java
index d081f6b7..f8d10f20 100644
--- a/src/java/com/samskivert/util/ArrayUtil.java
+++ b/src/java/com/samskivert/util/ArrayUtil.java
@@ -325,7 +325,7 @@ public class ArrayUtil
     {
 	int low = offset, high = offset+length-1;
 	while (low <= high) {
-	    int mid = (low + high) >> 1;
+	    int mid = (low + high) >>> 1;
 	    T midVal = array[mid];
 	    int cmp = midVal.compareTo(key);
 	    if (cmp < 0) {
@@ -361,7 +361,7 @@ public class ArrayUtil
     {
 	int low = offset, high = offset+length-1;
 	while (low <= high) {
-	    int mid = (low + high) >> 1;
+	    int mid = (low + high) >>> 1;
 	    T midVal = array[mid];
 	    int cmp = comp.compare(midVal, key);
 	    if (cmp < 0) {
diff --git a/src/java/com/samskivert/util/QuickSort.java b/src/java/com/samskivert/util/QuickSort.java
index 40a1da01..6202a598 100644
--- a/src/java/com/samskivert/util/QuickSort.java
+++ b/src/java/com/samskivert/util/QuickSort.java
@@ -96,7 +96,7 @@ public class QuickSort
         }
 
         // the middle element in the array is our partitioning element
-        T mid = a[(lo0 + hi0)/2];
+        T mid = a[(lo0 + hi0) >>> 1];
 
         // set up our partitioning boundaries
         int lo = lo0-1, hi = hi0+1;
@@ -164,7 +164,7 @@ public class QuickSort
         }
 
         // the middle element in the array is our partitioning element
-        T mid = a[(lo0 + hi0)/2];
+        T mid = a[(lo0 + hi0) >>> 1];
 
         // set up our partitioning boundaries
         int lo = lo0-1, hi = hi0+1;
@@ -230,7 +230,7 @@ public class QuickSort
         }
 
         // the middle element in the array is our partitioning element
-        T mid = a[(lo0 + hi0)/2];
+        T mid = a[(lo0 + hi0) >>> 1];
 
         // set up our partitioning boundaries
         int lo = lo0-1, hi = hi0+1;
@@ -296,7 +296,7 @@ public class QuickSort
         }
 
         // the middle element in the array is our partitioning element
-        T mid = a[(lo0 + hi0)/2];
+        T mid = a[(lo0 + hi0) >>> 1];
 
         // set up our partitioning boundaries
         int lo = lo0-1, hi = hi0+1;
@@ -421,7 +421,7 @@ public class QuickSort
         }
 
         // the middle element in the array is our partitioning element
-        T mid = a.get((lo0 + hi0)/2);
+        T mid = a.get((lo0 + hi0) >>> 1);
 
         // set up our partitioning boundaries
         int lo = lo0-1, hi = hi0+1;