[TOC] # 簡介 特點:無序,無重復元素 # 命令行     # 代碼 ~~~ Jedis jedis = init(); //有的話返回0,沒有的話添加成功是返回非0 Long a1 = jedis.sadd("friends:1", "dandan", "lulu", "lili"); Long a2 = jedis.sadd("friends:2", "laowang", "laodu", "laoli", "lili"); //判斷一個成員是否屬于指定的集合 Boolean isornot = jedis.sismember("friends:1","laowang"); System.out.println(isornot); //求2個集合的差并交集 Set<String> sdiff = jedis.sdiff("friends:1", "friends:2"); Set<String> sunion = jedis.sunion("friends:1", "friends:2"); Set<String> sinter = jedis.sinter("friends:1", "friends:2"); //打印結果 System.out.println("---差集---"); for (String sd: sdiff) { System.out.println(sd); } System.out.println("---并集---"); for (String su: sunion) { System.out.println(su); } System.out.println("---交集---"); for (String si: sinter) { System.out.println(si); } ~~~