resizedInts() private méthode

private resizedInts ( int newLen ) : int[]
newLen int
Résultat int[]
        public IntArray Multiply(IntArray other, int m)
        {
            // Lenght of c is 2m bits rounded up to the next int (32 bit)
            int t = (m + 31) >> 5;

            if (m_ints.Length < t)
            {
                m_ints = resizedInts(t);
            }

            IntArray b = new IntArray(other.resizedInts(other.Length + 1));
            IntArray c = new IntArray((m + m + 31) >> 5);
            // IntArray c = new IntArray(t + t);
            int testBit = 1;

            for (int k = 0; k < 32; k++)
            {
                for (int j = 0; j < t; j++)
                {
                    if ((m_ints[j] & testBit) != 0)
                    {
                        // The kth bit of m_ints[j] is set
                        c.AddShifted(b, j);
                    }
                }
                testBit <<= 1;
                b.ShiftLeft();
            }
            return(c);
        }
		public IntArray Multiply(IntArray other, int m)
		{
			// Lenght of c is 2m bits rounded up to the next int (32 bit)
			int t = (m + 31) >> 5;
			if (m_ints.Length < t)
			{
				m_ints = resizedInts(t);
			}

			IntArray b = new IntArray(other.resizedInts(other.Length + 1));
			IntArray c = new IntArray((m + m + 31) >> 5);
			// IntArray c = new IntArray(t + t);
			int testBit = 1;
			for (int k = 0; k < 32; k++)
			{
				for (int j = 0; j < t; j++)
				{
					if ((m_ints[j] & testBit) != 0)
					{
						// The kth bit of m_ints[j] is set
						c.AddShifted(b, j);
					}
				}
				testBit <<= 1;
				b.ShiftLeft();
			}
			return c;
		}