Bumped Barcode Scanner version to 3.5 final.

[zxing.git] / csharp / common / Collections.cs

diff --git a/csharp/common/Collections.cs b/csharp/common/Collections.cs
index 85e8c74..d9b8c29 100755 (executable)
--- a/csharp/common/Collections.cs
+++ b/csharp/common/Collections.cs
@@ -1,5 +1,5 @@
-/*\r
-* Copyright 2008 ZXing authors\r
+/*\r
+* Copyright 2007 ZXing authors\r
 *\r
 * Licensed under the Apache License, Version 2.0 (the "License");\r
 * you may not use this file except in compliance with the License.\r
@@ -13,40 +13,36 @@
 * See the License for the specific language governing permissions and\r
 * limitations under the License.\r
 */\r
+using System;\r
 namespace com.google.zxing.common\r
 {\r
-    using System;\r
-    using System.Text;\r
-\r
-    /// <summary> A class which wraps a 2D array of bytes. The default usage is signed. If you want to use it as a\r
-    /// unsigned container, it's up to you to do byteValue & 0xff at each location.\r
-    /// *\r
-    /// JAVAPORT: I'm not happy about the argument ordering throughout the file, as I always like to have\r
-    /// the horizontal component first, but this is for compatibility with the C++ code. The original\r
-    /// code was a 2D array of ints, but since it only ever gets assigned -1, 0, and 1, I'm going to use\r
-    /// less memory and go with bytes.\r
-    /// *\r
-    /// </summary>\r
-    /// <author>  dswitkin@google.com (Daniel Switkin)\r
-    /// \r
-    /// </author>\r
-    public sealed class Collections\r
-    {\r
-\r
-        private Collections()\r
-        {\r
-        }\r
-\r
-        /**\r
-         * Sorts its argument (destructively) using insert sort; in the context of this package\r
-         * insertion sort is simple and efficient given its relatively small inputs.\r
-         *\r
-         * @param vector vector to sort\r
-         * @param comparator comparator to define sort ordering\r
-         */\r
-        public static void insertionSort(System.Collections.ArrayList vector, Comparator comparator)\r
-        {\r
-            int max = vector.Count;\r
+       \r
+       /// <summary> <p>This is basically a substitute for <code>java.util.Collections</code>, which is not\r
+       /// present in MIDP 2.0 / CLDC 1.1.</p>\r
+       /// \r
+       /// </summary>\r
+       /// <author>  Sean Owen\r
+       /// </author>\r
+       /// <author>www.Redivivus.in (suraj.supekar@redivivus.in) - Ported from ZXING Java Source \r
+       /// </author>\r
+       public sealed class Collections\r
+       {\r
+               \r
+               private Collections()\r
+               {\r
+               }\r
+               \r
+               /// <summary> Sorts its argument (destructively) using insert sort; in the context of this package\r
+               /// insertion sort is simple and efficient given its relatively small inputs.\r
+               /// \r
+               /// </summary>\r
+               /// <param name="vector">vector to sort\r
+               /// </param>\r
+               /// <param name="comparator">comparator to define sort ordering\r
+               /// </param>\r
+               public static void  insertionSort(System.Collections.ArrayList vector, Comparator comparator)\r
+               {\r
+                       int max = vector.Count;\r
                        for (int i = 1; i < max; i++)\r
                        {\r
                                System.Object value_Renamed = vector[i];\r
@@ -59,6 +55,6 @@ namespace com.google.zxing.common
                                }\r
                                vector[j + 1] = value_Renamed;\r
                        }\r
-        }\r
-    }\r
+               }\r
+       }\r
 }
\ No newline at end of file