Java 类org.apache.commons.collections4.bag.HashBag 实例源码

项目：jpl-framework 文件：KNearestNeighborLearningModel.java

/**
 * {@inheritDoc}
 * 
 * @return {@code null} if there are no neighbors in the dataset, the majority vote of the
 *         nearest neighbors otherwise and in the case of a tie, it returns the first result
 *         which reached that number of votes
 * @throws PredictionFailedException if the {@code instanceParameter} was not a
 *            {@link BaselearnerInstance}
 */
@Override
public Double predict(IInstance<?, ?, ?> instanceParameter) throws PredictionFailedException {
   assertInstanceHasCorrectType(instanceParameter, BaselearnerInstance.class);
   BaselearnerInstance instance = (BaselearnerInstance) instanceParameter;
   List<VectorDistanceTuple<Double>> neighbors;
   neighbors = kdTree.getNearestNeighbours(new DenseDoubleVector(instance.getContextFeatureVector()), k);

   logger.debug(FOUND_NEIGHBORS, neighbors.toString());
   Bag<Double> voteBag = new HashBag<>();
   for (VectorDistanceTuple<Double> pair : neighbors) {
      Double vote = pair.getValue();
      voteBag.add(vote);
   }

   logger.debug(VOTES, voteBag.toString());
   Double result = null;
   int winningCount = 0;
   for (Double object : voteBag.uniqueSet()) {
      if (voteBag.getCount(object) > winningCount) {
         winningCount = voteBag.getCount(object);
         result = object;
      }
   }
   return result;
}

项目：java_in_examples 文件：ApacheSynchronizedBagTest.java

public static void main(String[] args) {
    // Parse text to separate words
    String INPUT_TEXT = "Hello World! Hello All! Hi World!";
    // Create Multiset
    Bag bag = SynchronizedBag.synchronizedBag(new HashBag(Arrays.asList(INPUT_TEXT.split(" "))));

    // Print count words
    System.out.println(bag); // print [1:Hi,2:Hello,2:World!,1:All!] - in random orders
    // Print all unique words
    System.out.println(bag.uniqueSet());    // print [Hi, Hello, World!, All!] - in random orders

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

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

    // Print count unique words
    System.out.println(bag.uniqueSet().size());    //print 4
}

项目：java_in_examples 文件：ApacheHashBagTest.java

public static void main(String[] args) {
    // Parse text to separate words
    String INPUT_TEXT = "Hello World! Hello All! Hi World!";
    // Create Multiset
    Bag bag = new HashBag(Arrays.asList(INPUT_TEXT.split(" ")));

    // Print count words
    System.out.println(bag); // print [1:Hi,2:Hello,2:World!,1:All!] - in random orders
    // Print all unique words
    System.out.println(bag.uniqueSet());    // print [Hi, Hello, World!, All!] - in random orders

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

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

    // Print count unique words
    System.out.println(bag.uniqueSet().size());    //print 4
}

项目：java_in_examples 文件：ApacheSynchronizedBagTest.java

public static void main(String[] args) {
    // Разберем текст на слова
    String INPUT_TEXT = "Hello World! Hello All! Hi World!";
    // Создаем Multiset
    Bag bag = SynchronizedBag.synchronizedBag(new HashBag(Arrays.asList(INPUT_TEXT.split(" "))));

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

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

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

    // Выводим общее количество всех уникальных слов
    System.out.println(bag.uniqueSet().size());    //напечатает 4
}

项目：java_in_examples 文件：ApacheHashBagTest.java

public static void main(String[] args) {
    // Разберем текст на слова
    String INPUT_TEXT = "Hello World! Hello All! Hi World!";
    // Создаем Multiset
    Bag bag = new HashBag(Arrays.asList(INPUT_TEXT.split(" ")));

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

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

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

    // Выводим общее количество всех уникальных слов
    System.out.println(bag.uniqueSet().size());    //напечатает 4
}

项目：wikit 文件：CategoryTreeGraphRedisImpl.java

/**
 * find category articles distribution, each output line like the following format:
 * [article count] \t [the category count which contains this specified article count]
 */
public void displayCategoryConceptDistribution() throws MissedException {
    Collection<String> categories = listNames();
    Bag<Integer> catDistBag = new HashBag<>();

    ProgressCounter counter = new ProgressCounter();
    for (String c : categories) {
        counter.increment();
        int articleCount = getConceptCount(getIdByName(c));
        catDistBag.add(articleCount);
    }

    for (int key: catDistBag.uniqueSet()) {
        System.out.println(key + "\t" + catDistBag.getCount(key));
    }
}

项目：wikit 文件：CategoryCacheRedisImpl.java

/**
 * find category articles distribution, each output line like the following format:
 * [article count] \t [the category count which contains this specified article count]
 */
public void displayCategoryArticlesDistribution() throws MissedException {
    Collection<String> categories = listNames();
    Bag<Integer> catDistBag = new HashBag<>();

    ProgressCounter counter = new ProgressCounter();
    for (String c : categories) {
        counter.increment();
        int articleCount = getArticleCount(getIdByName(c));
        catDistBag.add(articleCount);
    }

    for (int key: catDistBag.uniqueSet()) {
        System.out.println(key + "\t" + catDistBag.getCount(key));
    }
}

项目：apt 文件：KBoundedSeparation.java

private Bag<State> expand(Bag<State> input, Event event, int g, boolean forward) {
    TransitionSystem ts = utility.getTransitionSystem();
    Bag<State> result = new HashBag<State>();

    for (State state : ts.getNodes()) {
        int increment = 0;
        for (Arc arc : forward ? state.getPostsetEdges() : state.getPresetEdges()) {
            if (arc.getEvent().equals(event)) {
                int value = getGradient(input, arc) - g;
                if (!forward)
                    value = -value;
                if (value > increment)
                    increment = value;
            }
        }
        result.add(state, input.getCount(state) + increment);
    }

    return result;
}

项目：apt 文件：KBoundedSeparation.java

/**
 * Add the excitation and switching regions of each event to the given collection.
 * The excitation region of an event e is the (multi)set of states in which it is enabled. Analogously, the
 * switching region is the (multi)set of states reached by some arc with label e.
 */
private void addExcitationAndSwitchingRegions(Collection<Bag<State>> result) {
    TransitionSystem ts = utility.getTransitionSystem();
    for (Event event : ts.getAlphabetEvents()) {
        Set<State> excitation = new HashSet<>();
        Set<State> switching = new HashSet<>();

        for (Arc arc : ts.getEdges()) {
            if (arc.getEvent().equals(event)) {
                excitation.add(arc.getSource());
                switching.add(arc.getTarget());
            }
        }

        debugFormat("For event %s, excitation=%s and switching=%s", event, excitation, switching);

        if (!excitation.isEmpty())
            result.add(new HashBag<>(excitation));
        if (!switching.isEmpty())
            result.add(new HashBag<>(switching));
    }
}

项目：peersim-pcbroadcast 文件：PartialView.java

public Iterable<Node> getPeers(int k) {
    if (this.partialView.size() == k || k == Integer.MAX_VALUE) {
        return this.getPeers();
    } else {
        HashBag<Node> sample = new HashBag<Node>();
        ArrayList<Node> clone = new ArrayList<Node>(this.partialView);
        while (sample.size() < Math.min(k, this.partialView.size())) {
            int rn = CommonState.r.nextInt(clone.size());
            sample.add(clone.get(rn));
            clone.remove(rn);
        }
        return sample;
    }
}

项目：peersim-pcbroadcast 文件：SprayPartialView.java

@Override
public SprayPartialView clone() {
    SprayPartialView spv = new SprayPartialView();
    spv.partialView = new HashBag<Node>(this.partialView);
    spv.ages = new HashMap<Node, Integer>(this.ages);
    return spv;
}

项目：peersim-pcbroadcast 文件：BiSpray.java

public BiSpray(String prefix) {
    super(prefix);

    BiSpray.listener = Configuration.getPid(prefix + "." + BiSpray.PAR_LISTENER, -1);

    this.inview = new HashBag<Node>();
    this.outview = new HashBag<Node>();
}

项目：HCFCore 文件：MultiMapUtils.java

/**
 * Gets a Bag from <code>MultiValuedMap</code> in a null-safe manner.
 *
 * @param <K> the key type
 * @param <V> the value type
 * @param map  the {@link MultiValuedMap} to use
 * @param key  the key to look up
 * @return the Collection in the {@link MultiValuedMap} as Bag, or null if input map is null
 */
public static <K, V> Bag<V> getValuesAsBag(final MultiValuedMap<K, V> map, final K key) {
    if (map != null) {
        Collection<V> col = map.get(key);
        if (col instanceof Bag) {
            return (Bag<V>) col;
        }
        return new HashBag<V>(col);
    }
    return null;
}

项目：HCFCore 文件：MultiMapUtils.java

/**
 * Gets a Bag from <code>MultiValuedMap</code> in a null-safe manner.
 *
 * @param <K> the key type
 * @param <V> the value type
 * @param map  the {@link MultiValuedMap} to use
 * @param key  the key to look up
 * @return the Collection in the {@link MultiValuedMap} as Bag, or null if input map is null
 */
public static <K, V> Bag<V> getValuesAsBag(final MultiValuedMap<K, V> map, final K key) {
    if (map != null) {
        Collection<V> col = map.get(key);
        if (col instanceof Bag) {
            return (Bag<V>) col;
        }
        return new HashBag<V>(col);
    }
    return null;
}

项目：PLTAG 文件：IncrementalSemanticsWidget.java

private IncrementalSemanticsWidget(Map<Predicate, Proposition> propositions, int timestamp, boolean fullSentence)
{
    this.propositions = propositions;
    predicatesWithSense = new HashSet<Predicate>();
    predicates = new HashSet<String>();
    argWords = new HashBag<String>();
    argRoles = new HashSet<Pair<Integer, Argument>>();
    incompleteArcs = new HashBag<String>();
    this.timestamp = timestamp;
    this.fullSentence = fullSentence;
}