-\feffusing System;
-using System.Collections.Generic;
+\feff/**
+ * Novacoin classes library
+ * Copyright (C) 2015 Alex D. (balthazar.ad@gmail.com)
+
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU Affero General Public License as
+ * published by the Free Software Foundation, either version 3 of the
+ * License, or (at your option) any later version.
+
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU Affero General Public License for more details.
+
+ * You should have received a copy of the GNU Affero General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
+ */
+
+using System;
using System.Diagnostics.Contracts;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
-using System.Numerics;
namespace Novacoin
{
public class uint256 : base_uint
{
- new public readonly int nWidth = 8;
+ #region Access to internal representation
+ new protected int nWidth {
+ get { return base.nWidth; }
+ private set { base.nWidth = value; }
+ }
+ new protected uint[] pn {
+ get { return base.pn; }
+ private set { base.pn = value; }
+ }
+ #endregion
+ #region Constructors
public uint256()
{
- base.nWidth = nWidth;
+ nWidth = 8;
pn = new uint[nWidth];
-
- for (int i = 0; i < nWidth; i++)
- {
- pn[i] = 0;
- }
}
- public uint256(uint256 b)
+ public uint256(uint256 b) : this()
{
- base.nWidth = nWidth;
- pn = new uint[nWidth];
-
for (int i = 0; i < nWidth; i++)
{
pn[i] = b.pn[i];
}
}
-
- public uint256(ulong n)
+ public uint256(ulong n) : this()
{
- base.nWidth = nWidth;
- pn = new uint[nWidth];
-
pn[0] = (uint)n;
pn[1] = (uint)(n >> 32);
for (int i = 2; i < nWidth; i++)
}
}
- public uint256(byte[] bytes)
+ public uint256(byte[] bytes) : this()
{
Contract.Requires<ArgumentException>(bytes.Length == 32, "Incorrect array length");
- base.nWidth = nWidth;
pn = Interop.ToUInt32Array(bytes);
}
- public uint256(string hex)
+ public uint256(string hex) : this()
{
Contract.Requires<ArgumentException>(hex.Length == 64, "Incorrect string");
- base.nWidth = nWidth;
var bytes = Interop.ReverseBytes(Interop.HexToArray(hex));
pn = Interop.ToUInt32Array(bytes);
}
+ #endregion
+ #region Cast operators
+ public static implicit operator uint256(byte[] bytes)
+ {
+ return new uint256(bytes);
+ }
+
+ public static implicit operator uint256(ulong n)
+ {
+ return new uint256(n);
+ }
+ #endregion
+
+ #region Compact representation
/// <summary>
/// Compact representation of unsigned 256bit numbers.
///
int nSize = (bits + 7) / 8;
uint nCompact = 0;
if (nSize <= 3)
- nCompact = ((uint)GetLow64()) << 8 * (3 - nSize);
+ nCompact = ((uint)Low64) << 8 * (3 - nSize);
else
{
uint256 bn = this >> 8 * (nSize - 3);
- nCompact = (uint)bn.GetLow64();
+ nCompact = (uint)bn.Low64;
}
if ((nCompact & 0x00800000) != 0)
pn = i.pn;
}
}
+ #endregion
- private void SetBytes(byte[] bytes)
- {
- pn = Interop.ToUInt32Array(Interop.ReverseBytes(bytes));
- }
-
+ #region Bitwise operations
public static uint256 operator ~(uint256 a)
{
var ret = new uint256();
return ret;
}
+ public static uint256 operator ^(uint256 a, uint256 b)
+ {
+ var result = new uint256();
+ result.pn = new uint[a.nWidth];
+ for (int i = 0; i < result.nWidth; i++)
+ {
+ result.pn[i] = a.pn[i] ^ b.pn[i];
+ }
+ return result;
+ }
+
+ public static uint256 operator &(uint256 a, uint256 b)
+ {
+ var result = new uint256();
+ result.pn = new uint[a.nWidth];
+ for (int i = 0; i < result.nWidth; i++)
+ {
+ result.pn[i] = a.pn[i] & b.pn[i];
+ }
+ return result;
+ }
+
+ public static uint256 operator |(uint256 a, uint256 b)
+ {
+ var result = new uint256();
+ result.pn = new uint[a.nWidth];
+ for (int i = 0; i < result.nWidth; i++)
+ {
+ result.pn[i] = a.pn[i] | b.pn[i];
+ }
+ return result;
+ }
+ #endregion
+
+ #region Basic arithmetics
public static uint256 operator -(uint256 a)
{
var ret = new uint256();
return ret;
}
-
public static uint256 operator ++(uint256 a)
{
int i = 0;
return a;
}
- public static uint256 operator ^(uint256 a, uint256 b)
- {
- var result = new uint256();
- result.pn = new uint[a.nWidth];
- for (int i = 0; i < result.nWidth; i++)
- {
- result.pn[i] = a.pn[i] ^ b.pn[i];
- }
- return result;
- }
public static uint256 operator +(uint256 a, uint256 b)
{
return a - new uint256(b);
}
- public static uint256 operator &(uint256 a, uint256 b)
+ public static uint256 operator /(uint256 a, uint divisor)
{
var result = new uint256();
- result.pn = new uint[a.nWidth];
- for (int i = 0; i < result.nWidth; i++)
+
+ ulong r = 0;
+ int i = a.nWidth;
+
+ while (i-- > 0)
{
- result.pn[i] = a.pn[i] & b.pn[i];
+ r <<= 32;
+ r |= a.pn[i];
+ result.pn[i] = (uint)(r / divisor);
+ r %= divisor;
}
+
return result;
}
- public static uint256 operator |(uint256 a, uint256 b)
+ public static uint256 operator *(uint256 a, uint multiplier)
{
var result = new uint256();
- result.pn = new uint[a.nWidth];
- for (int i = 0; i < result.nWidth; i++)
+
+ ulong c = 0;
+ uint i = 0;
+
+ do
{
- result.pn[i] = a.pn[i] | b.pn[i];
- }
+ c += a.pn[i] * (ulong)multiplier;
+ result.pn[i] = (uint)c;
+ c >>= 32;
+ } while (++i < result.nWidth);
+
return result;
}
+ public static uint operator %(uint256 a, uint divisor)
+ {
+ ulong r = 0;
+ int i = a.nWidth;
+
+ while (i-- > 0)
+ {
+ r <<= 32;
+ r |= a.pn[i];
+ r %= divisor;
+ }
+
+ return (uint)r;
+ }
+ #endregion
+
+ #region Shift
public static uint256 operator <<(uint256 a, int shift)
{
var result = new uint256();
return result;
}
+ #endregion
}
}