diff options
author | Yohann Roussel <yroussel@google.com> | 2014-03-19 16:25:37 +0100 |
---|---|---|
committer | Yohann Roussel <yroussel@google.com> | 2014-03-20 15:13:33 +0100 |
commit | 4eceb95409e844fdc33c9c706e1dc307bfd40303 (patch) | |
tree | ee9f4f3fc79f757c79081c336bce4f1782c6ccd8 /guava/src/com/google/common/collect/AbstractMultiset.java | |
parent | 3d2402901b1a6462e2cf47a6fd09711f327961c3 (diff) | |
download | toolchain_jack-4eceb95409e844fdc33c9c706e1dc307bfd40303.zip toolchain_jack-4eceb95409e844fdc33c9c706e1dc307bfd40303.tar.gz toolchain_jack-4eceb95409e844fdc33c9c706e1dc307bfd40303.tar.bz2 |
Initial Jack import.
Change-Id: I953cf0a520195a7187d791b2885848ad0d5a9b43
Diffstat (limited to 'guava/src/com/google/common/collect/AbstractMultiset.java')
-rw-r--r-- | guava/src/com/google/common/collect/AbstractMultiset.java | 221 |
1 files changed, 221 insertions, 0 deletions
diff --git a/guava/src/com/google/common/collect/AbstractMultiset.java b/guava/src/com/google/common/collect/AbstractMultiset.java new file mode 100644 index 0000000..20ea93f --- /dev/null +++ b/guava/src/com/google/common/collect/AbstractMultiset.java @@ -0,0 +1,221 @@ +/* + * Copyright (C) 2007 The Guava Authors + * + * Licensed under the Apache License, Version 2.0 (the "License"); + * you may not use this file except in compliance with the License. + * You may obtain a copy of the License at + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * Unless required by applicable law or agreed to in writing, software + * distributed under the License is distributed on an "AS IS" BASIS, + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + * See the License for the specific language governing permissions and + * limitations under the License. + */ + +package com.google.common.collect; + +import static com.google.common.collect.Multisets.setCountImpl; + +import com.google.common.annotations.GwtCompatible; +import com.google.common.base.Objects; + +import java.util.AbstractCollection; +import java.util.Collection; +import java.util.Iterator; +import java.util.Set; + +import javax.annotation.Nullable; + +/** + * This class provides a skeletal implementation of the {@link Multiset} + * interface. A new multiset implementation can be created easily by extending + * this class and implementing the {@link Multiset#entrySet()} method, plus + * optionally overriding {@link #add(Object, int)} and + * {@link #remove(Object, int)} to enable modifications to the multiset. + * + * <p>The {@link #count} and {@link #size} implementations all iterate across + * the set returned by {@link Multiset#entrySet()}, as do many methods acting on + * the set returned by {@link #elementSet()}. Override those methods for better + * performance. + * + * @author Kevin Bourrillion + * @author Louis Wasserman + */ +@GwtCompatible +abstract class AbstractMultiset<E> extends AbstractCollection<E> + implements Multiset<E> { + // Query Operations + + @Override public int size() { + return Multisets.sizeImpl(this); + } + + @Override public boolean isEmpty() { + return entrySet().isEmpty(); + } + + @Override public boolean contains(@Nullable Object element) { + return count(element) > 0; + } + + @Override public Iterator<E> iterator() { + return Multisets.iteratorImpl(this); + } + + @Override + public int count(@Nullable Object element) { + for (Entry<E> entry : entrySet()) { + if (Objects.equal(entry.getElement(), element)) { + return entry.getCount(); + } + } + return 0; + } + + // Modification Operations + + @Override public boolean add(@Nullable E element) { + add(element, 1); + return true; + } + + @Override + public int add(@Nullable E element, int occurrences) { + throw new UnsupportedOperationException(); + } + + @Override public boolean remove(@Nullable Object element) { + return remove(element, 1) > 0; + } + + @Override + public int remove(@Nullable Object element, int occurrences) { + throw new UnsupportedOperationException(); + } + + @Override + public int setCount(@Nullable E element, int count) { + return setCountImpl(this, element, count); + } + + @Override + public boolean setCount(@Nullable E element, int oldCount, int newCount) { + return setCountImpl(this, element, oldCount, newCount); + } + + // Bulk Operations + + /** + * {@inheritDoc} + * + * <p>This implementation is highly efficient when {@code elementsToAdd} + * is itself a {@link Multiset}. + */ + @Override public boolean addAll(Collection<? extends E> elementsToAdd) { + return Multisets.addAllImpl(this, elementsToAdd); + } + + @Override public boolean removeAll(Collection<?> elementsToRemove) { + return Multisets.removeAllImpl(this, elementsToRemove); + } + + @Override public boolean retainAll(Collection<?> elementsToRetain) { + return Multisets.retainAllImpl(this, elementsToRetain); + } + + @Override public void clear() { + Iterators.clear(entryIterator()); + } + + // Views + + private transient Set<E> elementSet; + + @Override + public Set<E> elementSet() { + Set<E> result = elementSet; + if (result == null) { + elementSet = result = createElementSet(); + } + return result; + } + + /** + * Creates a new instance of this multiset's element set, which will be + * returned by {@link #elementSet()}. + */ + Set<E> createElementSet() { + return new ElementSet(); + } + + class ElementSet extends Multisets.ElementSet<E> { + @Override + Multiset<E> multiset() { + return AbstractMultiset.this; + } + } + + abstract Iterator<Entry<E>> entryIterator(); + + abstract int distinctElements(); + + private transient Set<Entry<E>> entrySet; + + @Override public Set<Entry<E>> entrySet() { + Set<Entry<E>> result = entrySet; + return (result == null) ? entrySet = createEntrySet() : result; + } + + class EntrySet extends Multisets.EntrySet<E> { + @Override Multiset<E> multiset() { + return AbstractMultiset.this; + } + + @Override public Iterator<Entry<E>> iterator() { + return entryIterator(); + } + + @Override public int size() { + return distinctElements(); + } + } + + Set<Entry<E>> createEntrySet() { + return new EntrySet(); + } + + // Object methods + + /** + * {@inheritDoc} + * + * <p>This implementation returns {@code true} if {@code object} is a multiset + * of the same size and if, for each element, the two multisets have the same + * count. + */ + @Override public boolean equals(@Nullable Object object) { + return Multisets.equalsImpl(this, object); + } + + /** + * {@inheritDoc} + * + * <p>This implementation returns the hash code of {@link + * Multiset#entrySet()}. + */ + @Override public int hashCode() { + return entrySet().hashCode(); + } + + /** + * {@inheritDoc} + * + * <p>This implementation returns the result of invoking {@code toString} on + * {@link Multiset#entrySet()}. + */ + @Override public String toString() { + return entrySet().toString(); + } +} |