List.Contains实现对比

来源:互联网 发布:影视后期剪辑软件界面 编辑:程序博客网 时间:2024/05/17 00:16

假如你有一个实体User,在用这个实体的list的时候,有时会有这样的需求,就是我们不希望list里面有重复项(所谓的重复就是按我们自己的要求定义唯一性,像主键一样),那我们是否可以通过Constains来判断呢?对于string类型或者Int类型,我们很常用的直接用List<string> listAdd=new List<string>(); listAdd.Contains()来判断是否存在。

 

第一:

 

 public class User

        {

            private string userName;

            private string passwords;

            private string message;

 

            public string UserName

            {

                get { return userName; }

                set { userName = value; }

            }

 

            public string Passwords

            {

                get { return passwords; }

                set { passwords = value; }

            }

 

            public string Message

            {

                get { return message; }

                set { message = value; }

            }

         public User(string name, string pwd, string msg)

            {

 

                this.UserName = name;

                this.Passwords = pwd;

                this.Message = msg;

            }         

 

        }

 

        private List<User> userList=new List<User>();

 

        public bool AddMessage(string userName, string passwords, string message)

        {

            User info = new User(userName, passwords, message);

 

 

 

            if (!userList.Contains(info))

            {

                userList.Add(info);

                return true;

            }

            else

            {

                return false;

            }

        }

 

当我们以为已经实现我们所要的功能,运行的时候却发现,即使对于两个字段都相同,constains还是返回False的,那就让我们看一下Constains的执行代码吧:

 

     // Contains returns true if the specified element is in the List.

    // It does a linear, O(n) search.  Equality is determined by calling

        // item.Equals().

        //

        public bool Contains(T item)

        {

            if ((Object)item == null)

            {

                for (int i = 0; i < _size; i++)

                    if ((Object)_items[i] == null)

                        return true;

                return false;

            }

            else

            {

                EqualityComparer<T> c = EqualityComparer<T>.Default;

                for (int i = 0; i < _size; i++)

                {

                    if (c.Equals(_items[i], item)) return true;

                }

                return false;

            }

        }

 

通过以上代码,我们不难发现,其实主要是根据Equals函数去做处理的,那我们应该如何来做呢?

 

第二:

 

     public class User

        {

            public string UserName

            {

                get { return userName; }

                set { userName = value; }

            }

 

            public string Passwords

            {

                get { return passwords; }

                set { passwords = value; }

            }

 

            public string Message

            {

                get { return message; }

                set { message = value; }

            }

            public User(string name, string pwd, string msg)

            {

 

                this.UserName = name;

                this.Passwords = pwd;

                this.Message = msg;

            }         

            public override bool Equals(object obj)

            {

                if (obj is User)

                {

                    User nm = obj as User;

                    return (nm.UserName == UserName && nm.Message == Message);

 

                }

                return false;

            }

            public override int GetHashCode()

            {

                return string.Format("{0}{1}", UserName, Message).GetHashCode();

            }

        }

 

通过override这两个行数,EqualsGetHashCode来处理帮助我们进行contains的操作,以达到我们的目的。

 

最后,我们来想想有没有其他的方法可以处理呢,其实,我们也可以利用list.Find的方法来帮助我们实现:

 

    User t=userList.Find(delegate(User p) { return (p.UserName ==UserName); });

            if (t==null)

            {

                userList.Add(newInfo);              

            }

 

 

 

关于EqualsGetHashCode:

 

http://www.cnblogs.com/sutengcn/archive/2007/03/16/677206.html

 

原创粉丝点击