All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.eclipse.collections.api.bag.Bag Maven / Gradle / Ivy

There is a newer version: 12.0.0.M3
Show newest version
/*
 * Copyright (c) 2016 Goldman Sachs.
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * and Eclipse Distribution License v. 1.0 which accompany this distribution.
 * The Eclipse Public License is available at http://www.eclipse.org/legal/epl-v10.html
 * and the Eclipse Distribution License is available at
 * http://www.eclipse.org/org/documents/edl-v10.php.
 */

package org.eclipse.collections.api.bag;

import java.util.AbstractMap;
import java.util.DoubleSummaryStatistics;
import java.util.IntSummaryStatistics;
import java.util.LongSummaryStatistics;
import java.util.Map;
import java.util.Optional;
import java.util.function.BiConsumer;
import java.util.function.BinaryOperator;
import java.util.function.Supplier;
import java.util.stream.Collector;
import java.util.stream.Stream;

import org.eclipse.collections.api.RichIterable;
import org.eclipse.collections.api.block.function.Function;
import org.eclipse.collections.api.block.function.primitive.DoubleFunction;
import org.eclipse.collections.api.block.function.primitive.FloatFunction;
import org.eclipse.collections.api.block.function.primitive.IntFunction;
import org.eclipse.collections.api.block.function.primitive.LongFunction;
import org.eclipse.collections.api.block.predicate.Predicate;
import org.eclipse.collections.api.block.predicate.Predicate2;
import org.eclipse.collections.api.block.predicate.primitive.IntPredicate;
import org.eclipse.collections.api.block.procedure.Procedure;
import org.eclipse.collections.api.block.procedure.primitive.ObjectIntProcedure;
import org.eclipse.collections.api.list.ListIterable;
import org.eclipse.collections.api.map.MapIterable;
import org.eclipse.collections.api.multimap.bag.BagMultimap;
import org.eclipse.collections.api.partition.bag.PartitionBag;
import org.eclipse.collections.api.set.SetIterable;
import org.eclipse.collections.api.tuple.Pair;
import org.eclipse.collections.api.tuple.primitive.ObjectIntPair;

/**
 * A Bag is a Collection whose elements are unordered and may contain duplicate entries.  It varies from
 * MutableCollection in that it adds a protocol for determining, adding, and removing the number of occurrences for an
 * item.
 *
 * @since 1.0
 */
public interface Bag
        extends RichIterable
{
    /**
     * Two bagsb1 and b2 are equal if m1.toMapOfItemToCount().equals(m2.toMapOfItemToCount()).
     *
     * @see Map#equals(Object)
     */
    @Override
    boolean equals(Object object);

    /**
     * Returns the hash code for this Bag, defined as this.{@link #toMapOfItemToCount()}.hashCode().
     *
     * @see Map#hashCode()
     */
    @Override
    int hashCode();

    @Override
    Bag tap(Procedure procedure);

    @Override
    Bag select(Predicate predicate);

    @Override
    

Bag selectWith(Predicate2 predicate, P parameter); @Override Bag reject(Predicate predicate); @Override

Bag rejectWith(Predicate2 predicate, P parameter); @Override PartitionBag partition(Predicate predicate); @Override

PartitionBag partitionWith(Predicate2 predicate, P parameter); @Override Bag selectInstancesOf(Class clazz); @Override BagMultimap groupBy(Function function); @Override BagMultimap groupByEach(Function> function); @Override SetIterable> zipWithIndex(); /** * For each distinct item, with the number of occurrences, execute the specified procedure. */ void forEachWithOccurrences(ObjectIntProcedure procedure); /** * The occurrences of a distinct item in the bag. */ int occurrencesOf(Object item); /** * Returns all elements of the bag that have a number of occurrences that satisfy the predicate. * * @since 3.0 */ Bag selectByOccurrences(IntPredicate predicate); /** * Returns the {@code count} most frequently occurring items. * * In the event of a tie, all of the items with the number of occurrences that match the occurrences of the last * item will be returned. * * @since 6.0 */ ListIterable> topOccurrences(int count); /** * Returns the {@code count} least frequently occurring items. * * In the event of a tie, all of the items with the number of occurrences that match the occurrences of the last * item will be returned. * * @since 6.0 */ ListIterable> bottomOccurrences(int count); /** * The size of the Bag when counting only distinct elements. */ int sizeDistinct(); /** * Converts the Bag to a Map of the Item type to its count as an Integer. */ MapIterable toMapOfItemToCount(); /** * Returns a string representation of this bag. The string representation consists of a list of element-count mappings. * The elements each appear once, in an order consistent with other methods like {@link #forEachWithOccurrences(ObjectIntProcedure)} * and {@link #iterator()}. The element-count mappings are enclosed in braces ("{}"). Adjacent mappings are * separated by the characters ", " (comma and space). Each element-count mapping is rendered as the element * followed by an equals sign ("=") followed by the number of ooccurrences. Elements and are converted to * strings as by {@link String#valueOf(Object)}. *

* The string representation is similar to {@link AbstractMap#toString()}, not {@link RichIterable#toString()}. * * @return a string representation of this bag * @since 3.0 */ String toStringOfItemToCount(); ImmutableBagIterable toImmutable(); /** * @since 8.0 */ default IntSummaryStatistics summarizeInt(IntFunction function) { IntSummaryStatistics stats = new IntSummaryStatistics(); this.forEachWithOccurrences((each, occurrences) -> { int result = function.intValueOf(each); for (int i = 0; i < occurrences; i++) { stats.accept(result); } }); return stats; } /** * @since 8.0 */ default DoubleSummaryStatistics summarizeFloat(FloatFunction function) { DoubleSummaryStatistics stats = new DoubleSummaryStatistics(); this.forEachWithOccurrences((each, occurrences) -> { float result = function.floatValueOf(each); for (int i = 0; i < occurrences; i++) { stats.accept(result); } }); return stats; } /** * @since 8.0 */ default LongSummaryStatistics summarizeLong(LongFunction function) { LongSummaryStatistics stats = new LongSummaryStatistics(); this.forEachWithOccurrences((each, occurrences) -> { long result = function.longValueOf(each); for (int i = 0; i < occurrences; i++) { stats.accept(result); } }); return stats; } /** * @since 8.0 */ default DoubleSummaryStatistics summarizeDouble(DoubleFunction function) { DoubleSummaryStatistics stats = new DoubleSummaryStatistics(); this.forEachWithOccurrences((each, occurrences) -> { double result = function.doubleValueOf(each); for (int i = 0; i < occurrences; i++) { stats.accept(result); } }); return stats; } /** * This method produces the equivalent result as {@link Stream#collect(Collector)}. * * @since 8.0 */ @Override default R reduceInPlace(Collector collector) { A mutableResult = collector.supplier().get(); BiConsumer accumulator = collector.accumulator(); this.forEachWithOccurrences((each, occurrences) -> { for (int i = 0; i < occurrences; i++) { accumulator.accept(mutableResult, each); } }); return collector.finisher().apply(mutableResult); } /** * This method produces the equivalent result as {@link Stream#collect(Supplier, BiConsumer, BiConsumer)}. * * @since 8.0 */ @Override default R reduceInPlace(Supplier supplier, BiConsumer accumulator) { R mutableResult = supplier.get(); this.forEachWithOccurrences((each, occurrences) -> { for (int i = 0; i < occurrences; i++) { accumulator.accept(mutableResult, each); } }); return mutableResult; } }