/* * Decompiled with CFR 0.152. */ package com.google.common.collect; import com.google.common.annotations.GwtCompatible; import com.google.common.base.Preconditions; import com.google.common.collect.AbstractMultiset; import com.google.common.collect.BoundType; import com.google.common.collect.DescendingMultiset; import com.google.common.collect.GwtTransient; import com.google.common.collect.Multiset; import com.google.common.collect.Multisets; import com.google.common.collect.Ordering; import com.google.common.collect.SortedMultiset; import com.google.common.collect.SortedMultisets; import java.util.Comparator; import java.util.Iterator; import java.util.NavigableSet; import javax.annotation.Nullable; @GwtCompatible(emulated=true) abstract class AbstractSortedMultiset extends AbstractMultiset implements SortedMultiset { @GwtTransient final Comparator comparator; private transient SortedMultiset descendingMultiset; AbstractSortedMultiset() { this(Ordering.natural()); } AbstractSortedMultiset(Comparator comparator) { this.comparator = Preconditions.checkNotNull(comparator); } @Override public NavigableSet elementSet() { return (NavigableSet)super.elementSet(); } @Override NavigableSet createElementSet() { return new SortedMultisets.NavigableElementSet(this); } @Override public Comparator comparator() { return this.comparator; } @Override public Multiset.Entry firstEntry() { Iterator entryIterator = this.entryIterator(); return entryIterator.hasNext() ? entryIterator.next() : null; } @Override public Multiset.Entry lastEntry() { Iterator> entryIterator = this.descendingEntryIterator(); return entryIterator.hasNext() ? entryIterator.next() : null; } @Override public Multiset.Entry pollFirstEntry() { Iterator entryIterator = this.entryIterator(); if (entryIterator.hasNext()) { Multiset.Entry result = entryIterator.next(); result = Multisets.immutableEntry(result.getElement(), result.getCount()); entryIterator.remove(); return result; } return null; } @Override public Multiset.Entry pollLastEntry() { Iterator> entryIterator = this.descendingEntryIterator(); if (entryIterator.hasNext()) { Multiset.Entry result = entryIterator.next(); result = Multisets.immutableEntry(result.getElement(), result.getCount()); entryIterator.remove(); return result; } return null; } @Override public SortedMultiset subMultiset(@Nullable E fromElement, BoundType fromBoundType, @Nullable E toElement, BoundType toBoundType) { Preconditions.checkNotNull(fromBoundType); Preconditions.checkNotNull(toBoundType); return this.tailMultiset(fromElement, fromBoundType).headMultiset(toElement, toBoundType); } abstract Iterator> descendingEntryIterator(); Iterator descendingIterator() { return Multisets.iteratorImpl(this.descendingMultiset()); } @Override public SortedMultiset descendingMultiset() { SortedMultiset result = this.descendingMultiset; return result == null ? (this.descendingMultiset = this.createDescendingMultiset()) : result; } SortedMultiset createDescendingMultiset() { return new DescendingMultiset(){ @Override SortedMultiset forwardMultiset() { return AbstractSortedMultiset.this; } @Override Iterator> entryIterator() { return AbstractSortedMultiset.this.descendingEntryIterator(); } @Override public Iterator iterator() { return AbstractSortedMultiset.this.descendingIterator(); } }; } }