Committed C# port from Mohamad

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

diff --git a/csharp/common/Collections.cs b/csharp/common/Collections.cs
new file mode 100755 (executable)
index 0000000..85e8c74
--- /dev/null
+++ b/csharp/common/Collections.cs
@@ -0,0 +1,64 @@
+/*\r
+* Copyright 2008 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
+* You may obtain a copy of the License at\r
+*\r
+*      http://www.apache.org/licenses/LICENSE-2.0\r
+*\r
+* Unless required by applicable law or agreed to in writing, software\r
+* distributed under the License is distributed on an "AS IS" BASIS,\r
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r
+* See the License for the specific language governing permissions and\r
+* limitations under the License.\r
+*/\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
+                       for (int i = 1; i < max; i++)\r
+                       {\r
+                               System.Object value_Renamed = vector[i];\r
+                               int j = i - 1;\r
+                               System.Object valueB;\r
+                               while (j >= 0 && comparator.compare((valueB = vector[j]), value_Renamed) > 0)\r
+                               {\r
+                                       vector[j + 1] = valueB;\r
+                                       j--;\r
+                               }\r
+                               vector[j + 1] = value_Renamed;\r
+                       }\r
+        }\r
+    }\r
+}
\ No newline at end of file