C#操作Redis Set 无序集合

/// <summary>
        /// redis 无序集合
        /// </summary>
        public static void Redis_Set()
        {
            RedisClient client = new RedisClient("127.0.0.1", 6379);
            //清空数据库缓存，慎用
            client.FlushAll();
            #region Set无序集合
            /*
             它是string类型的无序集合。set是通过hash table实现的，添加，删除和查找,对集合我们可以取并集，交集，差集
             */
            client.AddItemToSet("Set1", "lily");
            client.AddItemToSet("Set1", "lucy");
            client.AddItemToSet("Set1", "hanmeimei");
            client.AddItemToSet("Set1", "lilei");
            HashSet<string> hastsetA = client.GetAllItemsFromSet("Set1");
            foreach (string item in hastsetA)
            {
                Console.WriteLine("Set无序集合ValueA:{0}", item); //出来的结果是无须的
            }

            client.AddItemToSet("Set2", "lilei");
            client.AddItemToSet("Set2", "liming");
            client.AddItemToSet("Set2", "lucy");
            client.AddItemToSet("Set2", "mr wang");
            HashSet<string> hastsetB = client.GetAllItemsFromSet("Set2");
            foreach (string item in hastsetB)
            {
                Console.WriteLine("Set无序集合ValueB:{0}", item); //出来的结果是无序的
            }
            //求并集
            HashSet<string> hashUnion = client.GetUnionFromSets(new string[] { "Set1", "Set2" });
            //便利结果数据
            foreach (string item in hashUnion)
            {
                Console.WriteLine("求Set1和Set2的并集:{0}", item); //并集
            }
            //求交集
            HashSet<string> hashG = client.GetIntersectFromSets(new string[] { "Set1", "Set2" });
            //便利结果数据
            foreach (string item in hashG)
            {
                Console.WriteLine("求Set1和Set2的交集:{0}", item);  //交集
            }
            //[返回存在于第一个集合，但是不存在于其他集合的数据。差集]
            HashSet<string> hashD = client.GetDifferencesFromSet("Set1", new string[] { "Set2" });
            foreach (string item in hashD)
            {
                Console.WriteLine("求Set1和Set2的差集:{0}", item);  //差集
            }

            #endregion
        }