From a0e960449c0de3956c34b2bf638a49f6a59b8823 Mon Sep 17 00:00:00 2001
From: samskivert <samskivert@6335cc39-0255-0410-8fd6-9bcaacd3b74c>
Date: Tue, 12 May 2009 17:21:28 +0000
Subject: [PATCH] When constructing a set with an array of values, copy and
 sort the array rather than doing individual add()s.

git-svn-id: https://samskivert.googlecode.com/svn/trunk@2556 6335cc39-0255-0410-8fd6-9bcaacd3b74c
---
 src/java/com/samskivert/util/ArrayIntSet.java | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/src/java/com/samskivert/util/ArrayIntSet.java b/src/java/com/samskivert/util/ArrayIntSet.java
index e6dcb04e..2f745bab 100644
--- a/src/java/com/samskivert/util/ArrayIntSet.java
+++ b/src/java/com/samskivert/util/ArrayIntSet.java
@@ -41,7 +41,8 @@ public class ArrayIntSet extends AbstractSet<Integer>
     public ArrayIntSet (int[] values)
     {
         this(values.length);
-        add(values);
+        System.arraycopy(values, 0, _values, 0, values.length);
+        Arrays.sort(_values);
     }
 
     /**