AI导航网
微信公众号搜"智元新知"关注
微信扫一扫可直接关注哦！

com.google.common.collect.ConcurrentHashMultiset的实例源码

分类：Java实例代码作者：编程之家
项目：guava-mock    文件：ListenerCallQueueTest.java    
public void testEnqueueAnddispatch_multipleListeners() {
  Object listener1 = new Object();
  ListenerCallQueue<Object> queue = new ListenerCallQueue<>();
  queue.addListener(listener1,directExecutor());

  Multiset<Object> counters = ConcurrentHashMultiset.create();
  queue.enqueue(incrementingEvent(counters,listener1,1));
  queue.enqueue(incrementingEvent(counters,2));

  Object listener2 = new Object();
  queue.addListener(listener2,directExecutor());
  queue.enqueue(incrementingEvent(counters,multiset(listener1,3,listener2,1)));
  queue.enqueue(incrementingEvent(counters,4,2)));
  assertEquals(0,counters.size());
  queue.dispatch();
  assertEquals(multiset(listener1,2),counters);
}
项目：guava-mock    文件：ListenerCallQueueTest.java    
public void testEnqueueAnddispatch_withExceptions() {
  Object listener = new Object();
  ListenerCallQueue<Object> queue = new ListenerCallQueue<>();
  queue.addListener(listener,listener,1));
  queue.enqueue(THROWING_EVENT);
  queue.enqueue(incrementingEvent(counters,2));
  queue.enqueue(THROWING_EVENT);
  queue.enqueue(incrementingEvent(counters,3));
  queue.enqueue(THROWING_EVENT);
  queue.enqueue(incrementingEvent(counters,4));
  queue.enqueue(THROWING_EVENT);
  assertEquals(0,counters.size());
  queue.dispatch();
  assertEquals(multiset(listener,4),counters);
}
项目：guava-mock    文件：ListenerCallQueueTest.java    
public void testEnqueueAnddispatch_multithreaded() throws InterruptedException {
  Object listener = new Object();
  ExecutorService service = Executors.newFixedThreadPool(4);
  ListenerCallQueue<Object> queue = new ListenerCallQueue<>();
  try {
    queue.addListener(listener,service);

    final CountDownLatch latch = new CountDownLatch(1);
    Multiset<Object> counters = ConcurrentHashMultiset.create();
    queue.enqueue(incrementingEvent(counters,1));
    queue.enqueue(incrementingEvent(counters,2));
    queue.enqueue(incrementingEvent(counters,3));
    queue.enqueue(incrementingEvent(counters,4));
    queue.enqueue(countDownEvent(latch));
    assertEquals(0,counters.size());
    queue.dispatch();
    latch.await();
    assertEquals(multiset(listener,counters);
  } finally {
    service.shutdown();
  }
}
项目：neuralccg    文件：DependencyEvaluator.java    
public DependencyEvaluator(final File modelDir,final Stream<DependencyParse> trainSentences) {
    try {
        dependencyGenerator = new DependencyGenerator(modelDir);
    } catch (final IOException e) {
        throw new RuntimeException(e);
    }

    log.info("Counting valid dependencies...");
    final ConcurrentHashMultiset<String> dependencyCounts = ConcurrentHashMultiset.create();
    trainSentences
            .parallel()
            .map(DependencyParse::getDependencies)
            .map(CCGBankEvaluation::asResolvedDependencies)
            .flatMap(Set::stream)
            .forEach(dep -> dependencyCounts.add(
                    dep.getCategory().toString() + dep.getArgNumber()));
    validDependencies = dependencyCounts.entrySet().stream()
            .filter(entry -> entry.getCount() >= 10)
            .map(Entry::getElement)
            .collect(Collectors.toSet());
    log.info("{} valid dependencies found",validDependencies.size());
}
项目：phrasal    文件：AlignmentTemplates.java    
/**
 * Increment count for a given alignment for a given phrase-pair.
 */
public void incrementAlignmentCount(AlignmentTemplate alTemp) {
  if (storeAlignmentCounts) {
    int idx = alTemp.getKey();
    int alIdx = alTemp.getAKey();
    final ConcurrentHashMultiset<Integer> aCounts;
    if (idx >= 0) {
      assert (idx <= index.size());
      synchronized (aCounter) {
        // assert(idx <= aCounter.size());
        while (idx >= aCounter.size())
          aCounter.add(ConcurrentHashMultiset.create());
        aCounts = aCounter.get(idx);
      }
      aCounts.add(alIdx);
    }
  }
}
项目：java_in_examples    文件：GuavaConcurrentHashMultisetTest.java    
public static void main(String[] args) {
    // Parse text to separate words
    String INPUT_TEXT = "Hello World! Hello All! Hi World!";
    // Create Multiset
    Multiset<String> multiset = ConcurrentHashMultiset.create(Arrays.asList(INPUT_TEXT.split(" ")));

    // Print count words
    System.out.println(multiset); // print [Hi,Hello x 2,World! x 2,All!] - in random orders
    // Print all unique words
    System.out.println(multiset.elementSet());    // print [Hi,Hello,World!,All!] - in random orders

    // Print count occurrences of words
    System.out.println("Hello = " + multiset.count("Hello"));    // print 2
    System.out.println("World = " + multiset.count("World!"));    // print 2
    System.out.println("All = " + multiset.count("All!"));    // print 1
    System.out.println("Hi = " + multiset.count("Hi"));    // print 1
    System.out.println("Empty = " + multiset.count("Empty"));    // print 0

    // Print count all words
    System.out.println(multiset.size());    //print 6

    // Print count unique words
    System.out.println(multiset.elementSet().size());    //print 4
}
项目：java_in_examples    文件：GuavaConcurrentHashMultisetTest.java    
public static void main(String[] args) {
    // Разберем текст на слова
    String INPUT_TEXT = "Hello World! Hello All! Hi World!";
    // Создаем Multiset
    Multiset<String> multiset = ConcurrentHashMultiset.create(Arrays.asList(INPUT_TEXT.split(" ")));

    // Выводим кол-вом вхождений слов
    System.out.println(multiset); // напечатает [Hi,All!] - в произвольном порядке
    // Выводим все уникальные слова
    System.out.println(multiset.elementSet());    // напечатает [Hi,All!] - в произвольном порядке

    // Выводим количество по каждому слову
    System.out.println("Hello = " + multiset.count("Hello"));    // напечатает 2
    System.out.println("World = " + multiset.count("World!"));    // напечатает 2
    System.out.println("All = " + multiset.count("All!"));    // напечатает 1
    System.out.println("Hi = " + multiset.count("Hi"));    // напечатает 1
    System.out.println("Empty = " + multiset.count("Empty"));    // напечатает 0

    // Выводим общее количества всех слов в тексте
    System.out.println(multiset.size());    //напечатает 6

    // Выводим общее количество всех уникальных слов
    System.out.println(multiset.elementSet().size());    //напечатает 4
}
项目：codemining-treelm    文件：ContextFreeGrammar.java    
@Override
public void addCFGRule(final int rootId,final NodeConsequent ruleConsequent) {
    Multiset<NodeConsequent> ruleProduction;
    final Multiset<NodeConsequent> tempMultiset = ConcurrentHashMultiset
            .create();

    if (grammar instanceof ConcurrentMap) {
        final ConcurrentMap<Integer,Multiset<NodeConsequent>> conGrammar = (ConcurrentMap<Integer,Multiset<NodeConsequent>>) grammar;
        ruleProduction = conGrammar.putIfAbsent(rootId,tempMultiset);
    } else {
        if (grammar.containsKey(rootId)) {
            ruleProduction = grammar.get(rootId);
        } else {
            ruleProduction = null;
        }
    }
    if (ruleProduction == null) {
        ruleProduction = tempMultiset;
    }

    ruleProduction.add(ruleConsequent);
}
项目：codemining-treelm    文件：TSGrammar.java    
/**
 * Add a tree with the given number of times.
 *
 * @param subTree
 * @param count
 */
public void addTree(final TreeNode<T> subTree,final int count) {
    checkArgument(count > 0);
    final T rootNodeData = subTree.getData();

    final ConcurrentHashMultiset<TreeNode<T>> tempNew = ConcurrentHashMultiset
            .create();
    final ConcurrentHashMultiset<TreeNode<T>> nSet = grammar.putIfAbsent(
            rootNodeData,tempNew);

    if (nSet != null) {
        nSet.add(subTree,count);
    } else {
        tempNew.add(subTree,count);
    }
}
项目：codemining-sequencelm    文件：TokenVocabularyBuilder.java    
/**
 * Build a set of words in the vocabulary from a collection of files.
 * 
 * @param files
 * @return
 */
public static Set<String> buildVocabulary(final Collection<File> files,final ITokenizer tokenizer,final int threshold) {
    final ConcurrentHashMultiset<String> vocabulary = ConcurrentHashMultiset
            .create();

    // add everything
    final ParallelThreadPool threadPool = new ParallelThreadPool();

    for (final File fi : files) {
        threadPool.pushTask(new VocabularyExtractorRunnable(fi,vocabulary,tokenizer));
    }

    threadPool.waitForTermination();

    // Remove rare
    pruneElementsFromMultiset(threshold,vocabulary);

    LOGGER.info("Vocabulary built,with " + vocabulary.elementSet().size()
            + " words");

    return vocabulary.elementSet();
}
项目：guava    文件：ListenerCallQueueTest.java    
public void testEnqueueAnddispatch_multipleListeners() {
  Object listener1 = new Object();
  ListenerCallQueue<Object> queue = new ListenerCallQueue<>();
  queue.addListener(listener1,counters);
}
项目：guava    文件：ListenerCallQueueTest.java    
public void testEnqueueAnddispatch_withExceptions() {
  Object listener = new Object();
  ListenerCallQueue<Object> queue = new ListenerCallQueue<>();
  queue.addListener(listener,counters);
}
项目：guava    文件：ListenerCallQueueTest.java    
public void testEnqueueAnddispatch_multithreaded() throws InterruptedException {
  Object listener = new Object();
  ExecutorService service = Executors.newFixedThreadPool(4);
  ListenerCallQueue<Object> queue = new ListenerCallQueue<>();
  try {
    queue.addListener(listener,counters);
  } finally {
    service.shutdown();
  }
}
项目：pyramid    文件：NgramEnumerator.java    
public static Multiset<Ngram> gatherNgram(ESIndex index,String[] ids,NgramTemplate template,int minDF){
    Multiset<Ngram> multiset = ConcurrentHashMultiset.create();
    String field = template.getField();
    Arrays.stream(ids).parallel().forEach(id -> {
        Map<Integer,String> termVector = index.getTermVectorFromIndex(field,id);
        add(termVector,multiset,template);
    });
    Multiset<Ngram> filtered = ConcurrentHashMultiset.create();
    for (Multiset.Entry entry: multiset.entrySet()){
        Ngram ngram = (Ngram)entry.getElement();
        int count = entry.getCount();
        if (count>=minDF){
            filtered.add(ngram,count);
        }
    }
    return filtered;
}
项目：pyramid    文件：NgramEnumerator.java    
private static void add(List<String> source,Multiset<Ngram> multiset,String field,int slop,List<Integer> template){
    Multiset<Ngram> multiSetForDoc = ConcurrentHashMultiset.create();
    for (int i=0;i<source.size();i++){
        if(i+template.get(template.size()-1)<source.size()){
            List<String> list = new ArrayList<>();
            for (int j: template){
                list.add(source.get(i+j));
            }
            Ngram ngram = new Ngram();
            ngram.setNgram(Ngram.toNgramString(list));
            ngram.setSlop(slop);
            ngram.setField(field);
            ngram.setInorder(true);
            multiSetForDoc.setCount(ngram,1);
        }
    }
     multiset.addAll(multiSetForDoc);
}
项目：pyramid    文件：GeneralF1Predictor.java    
/**
 *
 * @param numClasses
 * @param samples sampled multi-labels; can have duplicates; their empirical probabilities will be estimated
 * @return
 */
public MultiLabel predict(int numClasses,List<MultiLabel> samples){
    Multiset<MultiLabel> multiset = ConcurrentHashMultiset.create();
    for (MultiLabel multiLabel: samples){
        multiset.add(multiLabel);
    }

    int sampleSize = samples.size();
    List<MultiLabel> uniqueOnes = new ArrayList<>();
    List<Double> probs = new ArrayList<>();
    for (Multiset.Entry<MultiLabel> entry: multiset.entrySet()){
        uniqueOnes.add(entry.getElement());
        probs.add((double)entry.getCount()/sampleSize);
    }
    return predict(numClasses,uniqueOnes,probs);
}
项目：guava-mock    文件：ListenerCallQueueTest.java    
public void testEnqueueAnddispatch() {
  Object listener = new Object();
  ListenerCallQueue<Object> queue = new ListenerCallQueue<>();
  queue.addListener(listener,2));
  queue.enqueue(incrementingEvent(counters,3));
  queue.enqueue(incrementingEvent(counters,4));
  assertEquals(0,counters);
}
项目：guava-mock    文件：ListenerCallQueueTest.java    
public void testEnqueueAnddispatch_multithreaded_withThrowingRunnable()
    throws InterruptedException {
  Object listener = new Object();
  ExecutorService service = Executors.newFixedThreadPool(4);
  ListenerCallQueue<Object> queue = new ListenerCallQueue<>();
  try {
    queue.addListener(listener,1));
    queue.enqueue(THROWING_EVENT);
    queue.enqueue(incrementingEvent(counters,2));
    queue.enqueue(THROWING_EVENT);
    queue.enqueue(incrementingEvent(counters,3));
    queue.enqueue(THROWING_EVENT);
    queue.enqueue(incrementingEvent(counters,4));
    queue.enqueue(THROWING_EVENT);
    queue.enqueue(countDownEvent(latch));
    assertEquals(0,counters);
  } finally {
    service.shutdown();
  }
}
项目：news-credibility    文件：TokenTransform.java    
public Tuple2<Double,Multiset<String>> transform(Row row) throws IOException {
    Double label = row.getDouble(1);
    StringReader document = new StringReader(row.getString(0).replaceAll("br2n",""));
    List<String> wordsList = new ArrayList<>();

    try (BulgarianAnalyzer analyzer = new BulgarianAnalyzer(BULGARIAN_STOP_WORDS_SET)) {
        TokenStream stream = analyzer.tokenStream("words",document);

        TokenFilter lowerFilter = new LowerCaseFilter(stream);
        TokenFilter numbers = new NumberFilter(lowerFilter);
        TokenFilter length = new LengthFilter(numbers,1000);
        TokenFilter stemmer = new BulgarianstemFilter(length);
        TokenFilter ngrams = new ShingleFilter(stemmer,2,3);

        try (TokenFilter filter = ngrams) {
            Attribute termAtt = filter.addAttribute(CharTermAttribute.class);
            filter.reset();
            while (filter.incrementToken()) {
                String word = termAtt.toString().replace(",","(comma)").replaceAll("\n|\r","");
                if (word.contains("_")) {
                    continue;
                }
                wordsList.add(word);
            }
        }
    }

    Multiset<String> words = ConcurrentHashMultiset.create(wordsList);

    return new Tuple2<>(label,words);
}
项目：micro-server    文件：LoggingRateLimiter.java    
public void resetAfterLimit() {
    if (System.currentTimeMillis() - limit > lastCleared.getTime()) {
        frequency = ConcurrentHashMultiset.create();
        lastCleared = new Date(
                               System.currentTimeMillis());
    }

}
项目：micro-server    文件：LoggingRateLimiterTest.java    
@Test
public void testResetAfterLimit() throws InterruptedException {
    rateLimiter = new  LoggingRateLimiter(0);
    ConcurrentHashMultiset freq = rateLimiter.getFrequency();

    rateLimiter.resetAfterLimit();

    assertTrue (freq != rateLimiter.getFrequency() );
    freq = rateLimiter.getFrequency();
    Thread.sleep(1);

    rateLimiter.resetAfterLimit();
    assertthat (freq,is( rateLimiter.getFrequency()));
}
项目：micro-server    文件：JobsBeingExecutedTest.java    
@Test
public void testOverflow() throws Throwable {
    when(pjp.getTarget()).thenReturn(this);
    Field field = findField(ConcurrentHashMultiset.class,"countMap");
    makeAccessible(field);
    ConcurrentMap map = (ConcurrentMap) getField(field,jobs.getStatCounter());
    map.put("java.lang.String",Integer.MAX_VALUE);
    testExecute();
}
项目：phrasal    文件：AlignmentTemplates.java    
private int getArgmaxAlignment(int idx) {
  if (idx >= aCounter.size())
    return -1;
  // Linear search:
  ConcurrentHashMultiset<Integer> aCounts = aCounter.get(idx);
  int maxK = -1;
  int maxV = Integer.MIN_VALUE;
  String maxKLex = null;
  for (int k : aCounts.elementSet()) {
    int v = aCounts.count(k);
    if (v == maxV) {
      // If there is a tie,take lexicographic order as defined in Moses:
      String kLex = AlignmentTemplate.alignmentToString(aIndex.get(k));
      if (maxKLex == null)
        maxKLex = AlignmentTemplate.alignmentToString(aIndex.get(maxK));
      if (kLex.compareto(maxKLex) < 0) {
        maxK = k;
        maxV = v;
        maxKLex = kLex;
      }
    } else if (v > maxV) {
      maxK = k;
      maxV = v;
      maxKLex = null;
    }
  }
  assert (maxK >= 0);
  return maxK;
}
项目：phrasal    文件：MosesPharoahFeatureExtractor.java    
private static void addCountToArray(ConcurrentHashMultiset<Integer> counter,int idx) {
  if (idx < 0)
    return;
  counter.add(idx);
  if (DEBUG_LEVEL >= 3)
    System.err.println("Increasing count idx=" + idx + " in vector (" + counter
        + ").");
}
项目：phrasal    文件：CountFeatureExtractor.java    
private static void addCountToArray(final ConcurrentHashMultiset<Integer> counter,int idx) {
  if (idx < 0)
    return;
  counter.add(idx);
  if (DEBUG_LEVEL >= 3)
    System.err.println("Increasing count idx=" + idx + " in vector (" + counter
        + ").");
}
项目：codemining-treelm    文件：TSGrammar.java    
/**
 * Adds all tree production of other grammar to this grammar.
 *
 * @param other
 */
public void addAll(final TSGrammar<T> other) {
    for (final ConcurrentHashMultiset<TreeNode<T>> treeSet : other.grammar
            .values()) {
        for (final Multiset.Entry<TreeNode<T>> entry : treeSet.entrySet()) {
            addTree(entry.getElement(),entry.getCount());
        }
    }
}
项目：codemining-treelm    文件：TSGrammar.java    
@Override
public SortedMultiset<Integer> computeGrammarTreeSizeStats() {
    // Get tree size distribution.
    final SortedMultiset<Integer> treeSizes = TreeMultiset.create();
    for (final Entry<T,ConcurrentHashMultiset<TreeNode<T>>> entry : grammar
            .entrySet()) {
        for (final Multiset.Entry<TreeNode<T>> rule : entry.getValue()
                .entrySet()) {
            treeSizes.add(rule.getElement().getTreeSize(),rule.getCount());
        }
    }
    return treeSizes;
}
项目：codemining-treelm    文件：TSGrammar.java    
@Override
public int countTreeOccurences(final TreeNode<T> root) {
    final ConcurrentHashMultiset<TreeNode<T>> productions = grammar
            .get(root.getData());
    if (productions == null) {
        return 0;
    }
    return productions.count(root);
}
项目：codemining-treelm    文件：TSGrammar.java    
@Override
public int countTreesWithRoot(final T root) {
    final ConcurrentHashMultiset<TreeNode<T>> set = grammar.get(root);
    if (set == null) {
        return 0;
    }
    return set.size();
}
项目：codemining-treelm    文件：TSGrammar.java    
@Override
public boolean removeTree(final TreeNode<T> subTree) {
    final T rootNodeData = subTree.getData();
    final ConcurrentHashMultiset<TreeNode<T>> productions = grammar
            .get(rootNodeData);
    if (productions == null) {
        return false;
    } else {
        return productions.remove(subTree);
    }
}
项目：codemining-treelm    文件：TSGrammar.java    
@Override
public int removeTree(final TreeNode<T> subTree,final int occurences) {
    final T rootNodeData = subTree.getData();
    final ConcurrentHashMultiset<TreeNode<T>> productions = grammar
            .get(rootNodeData);
    if (productions == null) {
        return -occurences;
    } else {
        return productions.remove(subTree,occurences) - occurences;
    }
}
项目：codemining-sequencelm    文件：TokenVocabularyBuilder.java    
public VocabularyExtractorRunnable(final File file,final ConcurrentHashMultiset<String> vocabulary,final ITokenizer tokenizerModule) {
    codeFile = file;
    vocabularySet = vocabulary;
    tokenizer = tokenizerModule;
}
项目：guava    文件：ListenerCallQueueTest.java    
public void testEnqueueAnddispatch() {
  Object listener = new Object();
  ListenerCallQueue<Object> queue = new ListenerCallQueue<>();
  queue.addListener(listener,counters);
}
项目：guava    文件：ListenerCallQueueTest.java    
public void testEnqueueAnddispatch_multithreaded_withThrowingRunnable()
    throws InterruptedException {
  Object listener = new Object();
  ExecutorService service = Executors.newFixedThreadPool(4);
  ListenerCallQueue<Object> queue = new ListenerCallQueue<>();
  try {
    queue.addListener(listener,NgramTemplate template){
    Multiset<Ngram> multiset = ConcurrentHashMultiset.create();
    String field = template.getField();
    Arrays.stream(ids).parallel().forEach(id -> {
        Map<Integer,template);
    });
    return multiset;
}

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 [email protected] 举报，一经查实，本站将立刻删除。

相关推荐

买水果
买水果
比较全面的redis工具类
比较全面的redis工具类
gson 反序列化到多态子类
gson 反序列化到多态子类
java 版本的 mb_strwidth
java 版本的 mb_strwidth
JAVA 反转字符串的最快方法,大概比StringBuffer.reverse()性能提升5倍
JAVA 反转字符串的最快方法,大概比StringBuffer.reverse()性能提升5倍
com.google.gson.internal.bind.ArrayTypeAdapter的实例源码
com.google.gson.internal.bind.ArrayTypeAdapter的实例源码
com.google.gson.JsonSyntaxException的实例源码
com.google.gson.JsonSyntaxException的实例源码
com.google.gson.JsonDeserializer的实例源码
com.google.gson.JsonDeserializer的实例源码
com.google.gson.internal.ConstructorConstructor的实例源码
com.google.gson.internal.ConstructorConstructor的实例源码
com.google.gson.JsonPrimitive的实例源码
com.google.gson.JsonPrimitive的实例源码
    pythonJavaScriptjavaHTMLreactjsC#AndroidCSSNode.jssqlrpython-3.xMysqLjQueryc++pandasFlutterangularIOSdjangolinuxswifttypescript路由器JSON路由器设置无线路由器h3c华三华三路由器设置华三路由器电脑软件教程arraysdocker软件图文教程Cvue.jslaravelspring-bootreact-native