Java-类库-Guava-Multiset

来源:互联网 发布:指南针炒股软件诈骗: 编辑:程序博客网 时间:2024/06/08 03:52

Guava中定义的新集合有:
  Multiset
  SortedMultiset
  Multimap
  ListMultimap
  SetMultimap
  BiMap
  ClassToInstanceMap
  Table
  Multiset集合

  Multiset是什么?顾名思义,Multiset和Set的区别就是可以保存多个相同的对象。在JDK中,List和Set有一个基本的区别,就是List可以包含多个相同对象,且是有顺序的,而Set不能有重复,且不保证顺序(有些实现有顺序,例如LinkedHashSet和SortedSet等)所以Multiset占据了List和Set之间的一个灰色地带:允许重复,但是不保证顺序。
 使用场景:Multiset有一个有用的功能,就是跟踪每种对象的数量,所以你可以用来进行数字统计。 常见的普通实现方式如下:
 

@Test    public void testWordCount(){        String strWorld="wer|dffd|ddsa|dfd|dreg|de|dr|ce|ghrt|cf|gt|ser|tg|ghrt|cf|gt|" +                "ser|tg|gt|kldf|dfg|vcd|fg|gt|ls|lser|dfr|wer|dffd|ddsa|dfd|dreg|de|dr|" +                "ce|ghrt|cf|gt|ser|tg|gt|kldf|dfg|vcd|fg|gt|ls|lser|dfr";        String[] words=strWorld.split("\\|");        Map<String, Integer> countMap = new HashMap<String, Integer>();        for (String word : words) {            Integer count = countMap.get(word);            if (count == null) {                 countMap.put(word, 1);             }            else {                 countMap.put(word, count + 1);             }        }                System.out.println("countMap:");        for(String key:countMap.keySet()){            System.out.println(key+" count:"+countMap.get(key));        }    }
 public void testMultsetWordCount(){        String strWorld="wer|dfd|dd|dfd|dda|de|dr";        String[] words=strWorld.split("\\|");        List<String> wordList=new ArrayList<String>();        for (String word : words) {            wordList.add(word);        }        Multiset<String> wordsMultiset = HashMultiset.create();        wordsMultiset.addAll(wordList);        for(String key:wordsMultiset.elementSet()){            System.out.println(key+" count:"+wordsMultiset.count(key));        }    }

 Multiset主要方法

  Multiset接口定义的接口主要有:
    add(E element) :向其中添加单个元素
    add(E element,int occurrences) : 向其中添加指定个数的元素
    count(Object element) : 返回给定参数元素的个数
    remove(E element) : 移除一个元素,其count值 会响应减少
    remove(E element,int occurrences): 移除相应个数的元素
    elementSet() : 将不同的元素放入一个Set中
    entrySet(): 类似与Map.entrySet 返回Set

@Test    public void testMultsetWordCount(){        String strWorld="wer|dfd|dd|dfd|dda|de|dr";        String[] words=strWorld.split("\\|");        List<String> wordList=new ArrayList<String>();        for (String word : words) {            wordList.add(word);        }        Multiset<String> wordsMultiset = HashMultiset.create();        wordsMultiset.addAll(wordList);        //System.out.println("wordsMultiset:"+wordsMultiset);        for(String key:wordsMultiset.elementSet()){            System.out.println(key+" count:"+wordsMultiset.count(key));        }        if(!wordsMultiset.contains("peida")){            wordsMultiset.add("peida", 2);        }        System.out.println("============================================");        for(String key:wordsMultiset.elementSet()){            System.out.println(key+" count:"+wordsMultiset.count(key));        }        if(wordsMultiset.contains("peida")){            wordsMultiset.setCount("peida", 23);        }        System.out.println("============================================");        for(String key:wordsMultiset.elementSet()){            System.out.println(key+" count:"+wordsMultiset.count(key));        }        if(wordsMultiset.contains("peida")){            wordsMultiset.setCount("peida", 23,45);        }        System.out.println("============================================");        for(String key:wordsMultiset.elementSet()){            System.out.println(key+" count:"+wordsMultiset.count(key));        }        if(wordsMultiset.contains("peida")){            wordsMultiset.setCount("peida", 44,67);        }        System.out.println("============================================");        for(String key:wordsMultiset.elementSet()){            System.out.println(key+" count:"+wordsMultiset.count(key));        }    }
de count:1dda count:1dd count:1dfd count:2wer count:1dr count:1============================================de count:1dda count:1dd count:1dfd count:2peida count:2wer count:1dr count:1============================================de count:1dda count:1dd count:1dfd count:2peida count:23wer count:1dr count:1============================================de count:1dda count:1dd count:1dfd count:2peida count:45wer count:1dr count:1============================================de count:1dda count:1dd count:1dfd count:2peida count:45wer count:1dr count:1

说明:setCount(E element,int oldCount,int newCount): 方法,如果传入的oldCount和element的不一致的时候,是不能讲element的count设置成newCount的。需要注意。
Multiset不是Map

  需要注意的是Multiset不是一个Map

0 0
原创粉丝点击