Java 类org.apache.commons.collections4.Bag 实例源码

项目：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;
}

项目：HCFCore 文件：AbstractMapBag.java

/**
 * Remove any members of the bag that are not in the given bag, respecting
 * cardinality.
 * @see #retainAll(Collection)
 *
 * @param other the bag to retain
 * @return <code>true</code> if this call changed the collection
 */
boolean retainAll(final Bag<?> other) {
    boolean result = false;
    final Bag<E> excess = new HashBag<E>();
    final Iterator<E> i = uniqueSet().iterator();
    while (i.hasNext()) {
        final E current = i.next();
        final int myCount = getCount(current);
        final int otherCount = other.getCount(current);
        if (1 <= otherCount && otherCount <= myCount) {
            excess.add(current, myCount - otherCount);
        } else {
            excess.add(current, myCount);
        }
    }
    if (!excess.isEmpty()) {
        result = removeAll(excess);
    }
    return result;
}

项目：HCFCore 文件：AbstractMapBag.java

/**
 * Compares this Bag to another. This Bag equals another Bag if it contains
 * the same number of occurrences of the same elements.
 *
 * @param object the Bag to compare to
 * @return true if equal
 */
@Override
public boolean equals(final Object object) {
    if (object == this) {
        return true;
    }
    if (object instanceof Bag == false) {
        return false;
    }
    final Bag<?> other = (Bag<?>) object;
    if (other.size() != size()) {
        return false;
    }
    for (final E element : map.keySet()) {
        if (other.getCount(element) != getCount(element)) {
            return false;
        }
    }
    return true;
}

项目：HCFCore 文件：AbstractMapBag.java

/**
 * Remove any members of the bag that are not in the given bag, respecting
 * cardinality.
 * @see #retainAll(Collection)
 *
 * @param other the bag to retain
 * @return <code>true</code> if this call changed the collection
 */
boolean retainAll(final Bag<?> other) {
    boolean result = false;
    final Bag<E> excess = new HashBag<E>();
    final Iterator<E> i = uniqueSet().iterator();
    while (i.hasNext()) {
        final E current = i.next();
        final int myCount = getCount(current);
        final int otherCount = other.getCount(current);
        if (1 <= otherCount && otherCount <= myCount) {
            excess.add(current, myCount - otherCount);
        } else {
            excess.add(current, myCount);
        }
    }
    if (!excess.isEmpty()) {
        result = removeAll(excess);
    }
    return result;
}

项目：HCFCore 文件：AbstractMapBag.java

/**
 * Compares this Bag to another. This Bag equals another Bag if it contains
 * the same number of occurrences of the same elements.
 *
 * @param object the Bag to compare to
 * @return true if equal
 */
@Override
public boolean equals(final Object object) {
    if (object == this) {
        return true;
    }
    if (object instanceof Bag == false) {
        return false;
    }
    final Bag<?> other = (Bag<?>) object;
    if (other.size() != size()) {
        return false;
    }
    for (final E element : map.keySet()) {
        if (other.getCount(element) != getCount(element)) {
            return false;
        }
    }
    return true;
}

项目：java_in_examples 文件：ApacheSynchronizedSortedBagTest.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 = SynchronizedSortedBag.synchronizedBag(new TreeBag(Arrays.asList(INPUT_TEXT.split(" "))));

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


    // 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) {
    // 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 文件：ApacheTreeBagTest.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 TreeBag(Arrays.asList(INPUT_TEXT.split(" ")));

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

    // 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 文件：ApacheSynchronizedSortedBagTest.java

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

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


    // Выводим количество по каждому слову
    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 文件：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 文件：ApacheTreeBagTest.java

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

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

    // Выводим количество по каждому слову
    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));
    }
}