使用委托,匿名方法对集合进行万能排序

本文介绍了一种使用Comparison<T>委托进行排序的方法,并通过实例演示了如何利用匿名方法进行灵活的排序操作。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

下面Demo中我使用了2种排序方式

1.让Employee继承IComparable 接口,实现CompareTo方法排序

2.定义一个方法使用Comparison<T>委托,排序的操作交给匿名方法 

看完下面的代码,你知道使用Comparison<T>委托的好处吗?

    class Employee:IComparable
    {
        public string Name { get; set; }
        public int Age { get; set; }
        public static List<Employee> GetEmployees()
        {
            return new List<Employee>()
            {
                new Employee(){Name ="GuoHu",Age =25},
                new Employee(){Name ="LeiHu",Age =23},
                new Employee(){Name ="JunWenLi",Age =24},
                new Employee(){Name ="JinHaoLiu",Age =25},
                new Employee(){Name ="ChengFang",Age =24}
            };
        }
        public int CompareTo(object obj)
        {
            Employee employee = obj as Employee;
            if (employee != null)
            {
                return Name.CompareTo(employee.Name);
            }
            else
            {
                throw new ArgumentException("obj is not Employee");
            }
        }
    }
    class Test
    {
        static void SortAndShowFiles(string title, Comparison<Employee> employeeInfo)
        {
            List<Employee> employee = Employee.GetEmployees();
            employee.Sort(employeeInfo);
            Console.WriteLine(title);
            foreach(Employee e in employee)
            {
                Console.WriteLine("Name:{0},Age:{1}", e.Name, e.Age);
            }
        }
        static void Main()
        {
            List<Employee> employeeInfo = Employee.GetEmployees();
            //Using IComparable sort 
            employeeInfo.Sort();
            employeeInfo.ForEach(e => Console.WriteLine("Name:{0},Age{1}/t", e.Name, e.Age));

            SortAndShowFiles("Sort by name", delegate(Employee e1, Employee e2) { return e1.Name.CompareTo(e2.Name); });

            SortAndShowFiles("Sort by age", delegate(Employee e1, Employee e2) { return e1.Age.CompareTo(e2.Age); });

        }
      
    }


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值