泛型方法

namespace CSharp2._0
{
    public class Finder
    {
        //泛型方法
        public static int Find<T>(T[] items, T item)
        {
            for (int i = 0; i < items.Length; i++)
            {
                if (item.Equals(items[i]))
                {
                    return i;
                }
            }
            return -1;
        }
    }
    //耦合
    class Program
    {

        string sss;
        List<string> ss;
       
        static void Main(string[] args)
        {
            NoGenericStatc nst = new NoGenericStatc(5);
            nst.Push(1);
            nst.Push(2);
            nst.Push("你奶奶的");
            nst.Push(3);
            nst.Push("你妹的");

            Console.WriteLine(nst.Pop());
            Console.WriteLine(nst.Pop());
            Console.WriteLine(nst.Pop());

            GenericStac<int> intstac = new GenericStac<int>(4);
            intstac.Push(1);
            //intstac.Push("abc");

            GenericStac<Goods> gss = new GenericStac<Goods>(10);
            gss.Push(new Goods());
           
            //可以做一个学生类，然后来查找某个同学。
            string[] stuNames = new string[] {"abc","someone", "cba" };
            int index = Finder.Find<string>(stuNames, "someone");

            if (index > -1)
            {
                Console.WriteLine("someone在数组中的位置是:{0}", index);
            }

            int[] ages = new int[] { 18, 17, 20, 69, 5 };

            int findNum = 89;
            int indexB = Finder.Find<int>(ages, findNum);

            if (indexB > -1)
            {
                Console.WriteLine("{0}在数组中的位置是:{1}",findNum, index);
            }
            else
            {
                Console.WriteLine("{0}在数组并不存在", findNum);
            }

            string[] names = new string[] { "a", "abc", "c" };
            string findName = "c";

            int findPos = Finder.Find<string>(names, findName);

            Add(23, 32);
        }

        //参数
        static int Add(int a, int b)
        {
            return a + b;
        }
    }
}