public class TreeBag extends AbstractMapBag implements SortedBag, Serializable
SortedBag, using a TreeMap to provide
the data storage. This is the standard implementation of a sorted bag.
Order will be maintained among the bag members and can be viewed through the iterator.
A Bag stores each object in the collection together with a
count of occurrences. Extra methods on the interface allow multiple copies
of an object to be added or removed at once. It is important to read the
interface javadoc carefully as several methods violate the
Collection interface specification.
AbstractMapBag.MutableInteger| Constructor and Description |
|---|
TreeBag()
Constructs an empty
TreeBag. |
TreeBag(Collection coll)
Constructs a
TreeBag containing all the members of the
specified collection. |
TreeBag(Comparator comparator)
Constructs an empty bag that maintains order on its unique
representative members according to the given
Comparator. |
| Modifier and Type | Method and Description |
|---|---|
Comparator |
comparator()
Returns the comparator associated with this sorted set, or null
if it uses its elements' natural ordering.
|
Object |
first()
Returns the first (lowest) member.
|
Object |
last()
Returns the last (highest) member.
|
add, add, addAll, clear, contains, containsAll, doReadObject, doWriteObject, equals, getCount, getMap, hashCode, isEmpty, iterator, remove, remove, removeAll, retainAll, size, toArray, toArray, toString, uniqueSetclone, finalize, getClass, notify, notifyAll, wait, wait, waitpublic TreeBag()
TreeBag.public TreeBag(Comparator comparator)
Comparator.comparator - the comparator to usepublic TreeBag(Collection coll)
TreeBag containing all the members of the
specified collection.coll - the collection to copy into the bagpublic Object first()
SortedBagpublic Object last()
SortedBagpublic Comparator comparator()
SortedBagcomparator in interface SortedBagCopyright © 2001–2015 The Apache Software Foundation. All rights reserved.