Update version numbers for 1.0.4 release; add svn:eol-style property

HippyCraig · Jun 16, 2009 · 415513f · 415513f
1 parent 5b149e0
commit 415513f
Show file tree

Hide file tree

Showing 87 changed files with 9,998 additions and 9,980 deletions.
diff --git a/HashLib/Crc16.cs b/HashLib/Crc16.cs
@@ -1,87 +1,87 @@
-/* Copyright 2009 HPDI, LLC
- * 
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- * 
- *     http://www.apache.org/licenses/LICENSE-2.0
- * 
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-namespace Hpdi.HashLib
-{
-    /// <summary>
-    /// 16-bit CRC hash function.
-    /// </summary>
-    /// <author>Trevor Robinson</author>
-    public class Crc16 : Hash16
-    {
-        // Commonly used polynomials.
-        public const ushort IBM = 0xA001; // reversed
-        public const ushort DNP = 0xA6BC; // reversed
-        public const ushort CCITT = 0x1021;
-
-        private readonly ushort[] table;
-        private readonly ushort initial;
-        private readonly ushort final;
-        private readonly bool reverse;
-
-        public Crc16(ushort poly, bool reverse)
-            : this(poly, reverse, 0, 0)
-        {
-        }
-
-        public Crc16(ushort poly, bool reverse, ushort initial, ushort final)
-        {
-            this.table = GenerateTable(poly, reverse);
-            this.initial = initial;
-            this.final = final;
-            this.reverse = reverse;
-        }
-
-        public ushort Compute(byte[] bytes)
-        {
-            return Compute(bytes, 0, bytes.Length);
-        }
-
-        public ushort Compute(byte[] bytes, int offset, int limit)
-        {
-            var crc = initial;
-            while (offset < limit)
-            {
-                if (reverse)
-                {
-                    crc = (ushort)((crc >> 8) ^ table[(byte)(crc ^ bytes[offset++])]);
-                }
-                else
-                {
-                    crc = (ushort)((crc << 8) ^ table[((crc >> 8) ^ bytes[offset++])]);
-                }
-            }
-            return (ushort)(crc ^ final);
-        }
-
-        protected static ushort[] GenerateTable(ushort poly, bool reverse)
-        {
-            var table = new ushort[256];
-            var mask = (ushort)(reverse ? 1 : 0x8000);
-            for (int i = 0; i < table.Length; ++i)
-            {
-                var value = (ushort)(reverse ? i : i << 8);
-                for (int j = 0; j < 8; ++j)
-                {
-                    var xor = (value & mask) != 0;
-                    value = reverse ? (ushort)(value >> 1) : (ushort)(value << 1);
-                    if (xor) value ^= poly;
-                }
-                table[i] = value;
-            }
-            return table;
-        }
-    }
-}
+/* Copyright 2009 HPDI, LLC
+ * 
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ * 
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ * 
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+namespace Hpdi.HashLib
+{
+    /// <summary>
+    /// 16-bit CRC hash function.
+    /// </summary>
+    /// <author>Trevor Robinson</author>
+    public class Crc16 : Hash16
+    {
+        // Commonly used polynomials.
+        public const ushort IBM = 0xA001; // reversed
+        public const ushort DNP = 0xA6BC; // reversed
+        public const ushort CCITT = 0x1021;
+
+        private readonly ushort[] table;
+        private readonly ushort initial;
+        private readonly ushort final;
+        private readonly bool reverse;
+
+        public Crc16(ushort poly, bool reverse)
+            : this(poly, reverse, 0, 0)
+        {
+        }
+
+        public Crc16(ushort poly, bool reverse, ushort initial, ushort final)
+        {
+            this.table = GenerateTable(poly, reverse);
+            this.initial = initial;
+            this.final = final;
+            this.reverse = reverse;
+        }
+
+        public ushort Compute(byte[] bytes)
+        {
+            return Compute(bytes, 0, bytes.Length);
+        }
+
+        public ushort Compute(byte[] bytes, int offset, int limit)
+        {
+            var crc = initial;
+            while (offset < limit)
+            {
+                if (reverse)
+                {
+                    crc = (ushort)((crc >> 8) ^ table[(byte)(crc ^ bytes[offset++])]);
+                }
+                else
+                {
+                    crc = (ushort)((crc << 8) ^ table[((crc >> 8) ^ bytes[offset++])]);
+                }
+            }
+            return (ushort)(crc ^ final);
+        }
+
+        protected static ushort[] GenerateTable(ushort poly, bool reverse)
+        {
+            var table = new ushort[256];
+            var mask = (ushort)(reverse ? 1 : 0x8000);
+            for (int i = 0; i < table.Length; ++i)
+            {
+                var value = (ushort)(reverse ? i : i << 8);
+                for (int j = 0; j < 8; ++j)
+                {
+                    var xor = (value & mask) != 0;
+                    value = reverse ? (ushort)(value >> 1) : (ushort)(value << 1);
+                    if (xor) value ^= poly;
+                }
+                table[i] = value;
+            }
+            return table;
+        }
+    }
+}
diff --git a/HashLib/Crc32.cs b/HashLib/Crc32.cs
@@ -1,75 +1,75 @@
-/* Copyright 2009 HPDI, LLC
- * 
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- * 
- *     http://www.apache.org/licenses/LICENSE-2.0
- * 
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-namespace Hpdi.HashLib
-{
-    /// <summary>
-    /// 32-bit CRC hash function.
-    /// </summary>
-    /// <author>Trevor Robinson</author>
-    public class Crc32 : Hash32
-    {
-        // Commonly used polynomials.
-        public const uint IEEE = 0xEDB88320; // reversed
-
-        private readonly uint[] table;
-        private readonly uint initial;
-        private readonly uint final;
-
-        public Crc32(uint poly)
-            : this(poly, 0, 0)
-        {
-        }
-
-        public Crc32(uint poly, uint initial, uint final)
-        {
-            this.table = GenerateTable(poly);
-            this.initial = initial;
-            this.final = final;
-        }
-
-        public uint Compute(byte[] bytes)
-        {
-            return Compute(bytes, 0, bytes.Length);
-        }
-
-        public uint Compute(byte[] bytes, int offset, int limit)
-        {
-            var crc = initial;
-            while (offset < limit)
-            {
-                crc = (uint)((crc >> 8) ^ table[(byte)(crc ^ bytes[offset++])]);
-            }
-            return (uint)(crc ^ final);
-        }
-
-        protected static uint[] GenerateTable(uint poly)
-        {
-            var table = new uint[256];
-            for (int i = 0; i < table.Length; ++i)
-            {
-                var value = (uint)i;
-                for (int j = 0; j < 8; ++j)
-                {
-                    var xor = (value & 1) != 0;
-                    value >>= 1;
-                    if (xor) value ^= poly;
-                }
-                table[i] = value;
-            }
-            return table;
-        }
-    }
-}
+/* Copyright 2009 HPDI, LLC
+ * 
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ * 
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ * 
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+namespace Hpdi.HashLib
+{
+    /// <summary>
+    /// 32-bit CRC hash function.
+    /// </summary>
+    /// <author>Trevor Robinson</author>
+    public class Crc32 : Hash32
+    {
+        // Commonly used polynomials.
+        public const uint IEEE = 0xEDB88320; // reversed
+
+        private readonly uint[] table;
+        private readonly uint initial;
+        private readonly uint final;
+
+        public Crc32(uint poly)
+            : this(poly, 0, 0)
+        {
+        }
+
+        public Crc32(uint poly, uint initial, uint final)
+        {
+            this.table = GenerateTable(poly);
+            this.initial = initial;
+            this.final = final;
+        }
+
+        public uint Compute(byte[] bytes)
+        {
+            return Compute(bytes, 0, bytes.Length);
+        }
+
+        public uint Compute(byte[] bytes, int offset, int limit)
+        {
+            var crc = initial;
+            while (offset < limit)
+            {
+                crc = (uint)((crc >> 8) ^ table[(byte)(crc ^ bytes[offset++])]);
+            }
+            return (uint)(crc ^ final);
+        }
+
+        protected static uint[] GenerateTable(uint poly)
+        {
+            var table = new uint[256];
+            for (int i = 0; i < table.Length; ++i)
+            {
+                var value = (uint)i;
+                for (int j = 0; j < 8; ++j)
+                {
+                    var xor = (value & 1) != 0;
+                    value >>= 1;
+                    if (xor) value ^= poly;
+                }
+                table[i] = value;
+            }
+            return table;
+        }
+    }
+}