line break at 80 characters

Author: David R. MacIver

src/com/rabbitmq/utility/IntAllocator.java

@@ -37,9 +37,10 @@
  */
 public class IntAllocator{
 
-    // Invariant: Sorted in order of first element. Non-overlapping, non-adjacent.
-    // This could really use being a balanced binary tree. However for normal usages
-    // it doesn't actually matter.
+    // Invariant: Sorted in order of first element. 
+    // Invariant: Intervals are non-overlapping, non-adjacent. 
+    // This could really use being a balanced binary tree. However for normal 
+    // usages it doesn't actually matter.
     private IntervalList base;
 
     private final int[] unsorted;
@@ -115,10 +116,13 @@ public static IntervalList fromArray(int[] xs, int length){
 
 
     /**
-    * Creates an IntAllocator allocating integer IDs within the inclusive range [start, end]
+    * Creates an IntAllocator allocating integer IDs within the inclusive range 
+    * [start, end]
     */
     public IntAllocator(int start, int end){
-       if(start > end) throw new IllegalArgumentException("illegal range [" + start    +", " + end + "]");
+        if(start > end) 
+            throw new IllegalArgumentException("illegal range [" + start    + 
+              ", " + end + "]");
 
         // Fairly arbitrary heuristic for a good size for the unsorted set.
         unsorted = new int[Math.max(32, (int)Math.sqrt(end - start))];
@@ -144,8 +148,8 @@ public int allocate(){
     /**
      * Make the provided integer available for allocation again. This operation
      * runs in amortized O(sqrt(range size)) time: About every sqrt(range size)
-     * operations    will take O(range_size + number of intervals) to complete and
-     * the rest run in constant time.
+     * operations    will take O(range_size + number of intervals) to complete 
+     * and the rest run in constant time.
      *
      * No error checking is performed, so if you double free or free an integer
      * that was not originally allocated the results are undefined. Sorry.
@@ -158,12 +162,12 @@ public void free(int id){
     }
 
     /**
-     * Attempt to reserve the provided ID as if it had been allocated. Returns true
-     * if it is available, false otherwise.
+     * Attempt to reserve the provided ID as if it had been allocated. Returns 
+     * true if it is available, false otherwise.
      *
-     * This operation runs in O(id) in the worst case scenario, though it can usually
-     * be expected to perform better than that unless a great deal of fragmentation
-     * has occurred.
+     * This operation runs in O(id) in the worst case scenario, though it can 
+     * usually be expected to perform better than that unless a great deal of 
+     * fragmentation has occurred.
      */
     public boolean reserve(int id){
         flush();