com.google.common.collect.RegularImmutableSortedMultiset Maven / Gradle / Ivy
Go to download
This artifact provides a single jar that contains all classes required to use remote EJB and JMS, including
all dependencies. It is intended for use by those not using maven, maven users should just import the EJB and
JMS BOM's instead (shaded JAR's cause lots of problems with maven, as it is very easy to inadvertently end up
with different versions on classes on the class path).
/*
* Copyright (C) 2011 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.base.Preconditions.checkNotNull;
import static com.google.common.base.Preconditions.checkPositionIndexes;
import static com.google.common.collect.BoundType.CLOSED;
import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.VisibleForTesting;
import com.google.common.primitives.Ints;
import java.util.Comparator;
import java.util.function.ObjIntConsumer;
import javax.annotation.CheckForNull;
/**
* An immutable sorted multiset with one or more distinct elements.
*
* @author Louis Wasserman
*/
@SuppressWarnings("serial") // uses writeReplace, not default serialization
@GwtIncompatible
@ElementTypesAreNonnullByDefault
final class RegularImmutableSortedMultiset extends ImmutableSortedMultiset {
private static final long[] ZERO_CUMULATIVE_COUNTS = {0};
static final ImmutableSortedMultiset NATURAL_EMPTY_MULTISET =
new RegularImmutableSortedMultiset<>(Ordering.natural());
@VisibleForTesting final transient RegularImmutableSortedSet elementSet;
private final transient long[] cumulativeCounts;
private final transient int offset;
private final transient int length;
RegularImmutableSortedMultiset(Comparator super E> comparator) {
this.elementSet = ImmutableSortedSet.emptySet(comparator);
this.cumulativeCounts = ZERO_CUMULATIVE_COUNTS;
this.offset = 0;
this.length = 0;
}
RegularImmutableSortedMultiset(
RegularImmutableSortedSet elementSet, long[] cumulativeCounts, int offset, int length) {
this.elementSet = elementSet;
this.cumulativeCounts = cumulativeCounts;
this.offset = offset;
this.length = length;
}
private int getCount(int index) {
return (int) (cumulativeCounts[offset + index + 1] - cumulativeCounts[offset + index]);
}
@Override
Entry getEntry(int index) {
return Multisets.immutableEntry(elementSet.asList().get(index), getCount(index));
}
@Override
public void forEachEntry(ObjIntConsumer super E> action) {
checkNotNull(action);
for (int i = 0; i < length; i++) {
action.accept(elementSet.asList().get(i), getCount(i));
}
}
@Override
@CheckForNull
public Entry firstEntry() {
return isEmpty() ? null : getEntry(0);
}
@Override
@CheckForNull
public Entry lastEntry() {
return isEmpty() ? null : getEntry(length - 1);
}
@Override
public int count(@CheckForNull Object element) {
int index = elementSet.indexOf(element);
return (index >= 0) ? getCount(index) : 0;
}
@Override
public int size() {
long size = cumulativeCounts[offset + length] - cumulativeCounts[offset];
return Ints.saturatedCast(size);
}
@Override
public ImmutableSortedSet elementSet() {
return elementSet;
}
@Override
public ImmutableSortedMultiset headMultiset(E upperBound, BoundType boundType) {
return getSubMultiset(0, elementSet.headIndex(upperBound, checkNotNull(boundType) == CLOSED));
}
@Override
public ImmutableSortedMultiset tailMultiset(E lowerBound, BoundType boundType) {
return getSubMultiset(
elementSet.tailIndex(lowerBound, checkNotNull(boundType) == CLOSED), length);
}
ImmutableSortedMultiset getSubMultiset(int from, int to) {
checkPositionIndexes(from, to, length);
if (from == to) {
return emptyMultiset(comparator());
} else if (from == 0 && to == length) {
return this;
} else {
RegularImmutableSortedSet subElementSet = elementSet.getSubSet(from, to);
return new RegularImmutableSortedMultiset(
subElementSet, cumulativeCounts, offset + from, to - from);
}
}
@Override
boolean isPartialView() {
return offset > 0 || length < cumulativeCounts.length - 1;
}
}