.NET (Core and Framework)

namespace Test_Foo {
    public class Foo<T, T2> {
        public T Tag;

        public Foo<T2, T2> _innerFoo;
    }


    public class Bar {
        public void Baz() {
            Foo<int, double> intFoo = new Foo<int, double>();
            intFoo.Tag = 5;

            intFoo._innerFoo = new Foo<double, double>();  // <<< second double is arbitrary
            intFoo._innerFoo.Tag = 1.25D;
        }
    }
}

Member 2256533 wrote:

int numberofrows = DG.Rows.Count;
int len = numberofrows.ToString().Length;
string NumberForRow;
for (x = 0; x < DG.Rows.Count; x++)
{
NumberForRow = Convert.ToString(x + 1);
while (NumberForRow.Length < len)
{
NumberForRow = "0" + NumberForRow;
}
DG.Rows[x].HeaderCell.Value = NumberForRow;

int NumberForRow = 1;
foreach (DataGridViewRow row in DG.Rows)
{
   if(NumberForRow < 10)
     row.HeaderCell.Value = String.Format("{0:D2}", NumberForRow );
   else
     row.HeaderCell.Value = NumberForRow;
   
   NumberForRow = NumberForRow+ 1;
}

row.HeaderCell.Value = NumberForRow.ToString().PadLeft(requiredWidth, '0');

private void dataGridView1_DataBindingComplete(object sender, DataGridViewBindingCompleteEventArgs e)
{
  foreach (DataGridViewRow R in dataGridView1.Rows)
   {
     R.Cells[0].Value = R.Index;
   }
}

if value   n 	return	  reason
14	   2	 1	  14 has two factors, 2 and 7
18	   5	 0	  18 does not have 5 factors, it only has four (2, 3, 6 and 9)
25	   2	 0	  25 = 5*5 but we are only interested in distinct factors so the 5 is only counted once.
36	   7	 1	  36 has seven factors (2, 3, 4, 6, 9, 12, 18). Note that 6 is counted only once.
7	   0	 1	  all prime numbers are 0-factored
-5	  anything	  0	the value must be greated than 0

public static int GetFactorCount(int numberToCheck, int n)
     {
         int factorCount = 0;
         int sqrt = n;

         // Start from 1 as we want our method to also work when numberToCheck is 0 or 1.
         for (int i = 1; i < sqrt; i++)
         {
             if (numberToCheck % i == 0)
             {
                 factorCount += 2; //  We found a pair of factors.
             }
         }

         // Check if our number is an exact square.
         if (sqrt * sqrt == numberToCheck)
         {
             factorCount++;
         }

         return factorCount;
     }

Richard MacCutchan wrote:

Is this really a .NET question?