uint -> ulong

[NovacoinLibrary.git] / Novacoin / uint160.cs

diff --git a/Novacoin/uint160.cs b/Novacoin/uint160.cs
index cdf633a..e12f10b 100644 (file)
--- a/Novacoin/uint160.cs
+++ b/Novacoin/uint160.cs
@@ -18,6 +18,7 @@
 
 using System;
 using System.Diagnostics.Contracts;
+using System.Linq;
 
 namespace Novacoin
 {
@@ -194,7 +195,7 @@ namespace Novacoin
             return a;
         }
 
-        public static uint160 operator /(uint160 a, uint b)
+        public static uint160 operator /(uint160 a, uint divisor)
         {
             var result = new uint160();
 
@@ -205,13 +206,150 @@ namespace Novacoin
             {
                 r <<= 32;
                 r |= a.pn[i];
-                result.pn[i] = (uint)(r / b);
-                r %= b;
+                result.pn[i] = (uint)(r / divisor);
+                r %= divisor;
             }
 
             return result;
         }
 
+        public static uint160 operator *(uint160 a, ulong multiplier)
+        {
+            var result = new uint160();
+
+            ulong c = 0;
+            uint i = 0;
+
+            do
+            {
+                c += a.pn[i] * multiplier;
+                result.pn[i] = (uint)c;
+                c >>= 32;
+            } while (++i < result.nWidth);
+
+            return result;
+        }
+
+        public static uint160 operator *(uint160 a, uint160 b)
+        {
+            if (!a || !b)
+            {
+                // Multiplication by zero results with zero.
+                return 0;
+            }
+            else if (b.bits <= 32)
+            {
+                if (b.pn[0] == 1)
+                {
+                    // If right is 1 then return left operand value
+                    return a;
+                }
+
+                return a * b.pn[0];
+            }
+            else if (a.bits <= 32)
+            {
+                if (a.pn[0] == 1)
+                {
+                    // If left is 1 then return right operand value
+                    return b;
+                }
+
+                return a * b.pn[0];
+            }
+
+            int m = a.bits / 32 + (a.bits % 32 != 0 ? 1 : 0);
+            int n = b.bits / 32 + (b.bits % 32 != 0 ? 1 : 0);
+
+            uint160 result = new uint160();
+
+            uint[] left = a.pn.Take(m).ToArray();
+            uint[] right = b.pn.Take(n).ToArray();
+
+            for (int i = 0; i < m; ++i)
+            {
+                uint ai = left[i];
+                int k = i;
+
+                ulong temp = 0;
+                for (int j = 0; j < n; ++j)
+                {
+                    temp = temp + ((ulong)ai) * right[j] + result.pn[k];
+                    result.pn[k++] = (uint)temp;
+                    temp >>= 32;
+                }
+
+                while (temp != 0)
+                {
+                    temp += result.pn[k];
+                    result.pn[k++] = (uint)temp;
+                    temp >>= 32;
+                }
+            }
+
+            return result;
+        }
+
+        public static uint operator %(uint160 a, uint divisor)
+        {
+            ulong r = 0;
+            int i = a.nWidth;
+
+            while (i-- > 0)
+            {
+                r <<= 32;
+                r |= a.pn[i];
+                r %= divisor;
+            }
+
+            return (uint)r;
+        }
+
+        public static uint160 operator /(uint160 a, uint160 b)
+        {
+            if (b.bits <= 32)
+            {
+                return a / b.Low32;
+            }
+
+            uint160 result = new uint160();
+
+            uint[] quotient;
+            uint[] remainder_value;
+
+            int m = a.bits / 32 + (a.bits % 32 != 0 ? 1 : 0);
+            int n = b.bits / 32 + (b.bits % 32 != 0 ? 1 : 0);
+
+            BignumHelper.DivModUnsigned(a.pn.Take(m).ToArray(), b.pn.Take(n).ToArray(), out quotient, out remainder_value);
+
+            quotient.CopyTo(result.pn, 0);
+
+            return result;
+        }
+
+        public static uint160 operator %(uint160 a, uint160 b)
+        {
+            if (b.bits <= 32)
+            {
+                return a % b.Low32;
+            }
+
+            uint160 result = new uint160();
+
+            uint[] quotient;
+            uint[] remainder_value;
+
+            int m = a.bits / 32 + (a.bits % 32 != 0 ? 1 : 0);
+            int n = b.bits / 32 + (b.bits % 32 != 0 ? 1 : 0);
+
+            BignumHelper.DivModUnsigned(a.pn.Take(m).ToArray(), b.pn.Take(n).ToArray(), out quotient, out remainder_value);
+
+            remainder_value.CopyTo(result.pn, 0);
+
+            return result;
+
+        }
+
         #endregion
 
         #region Shift