001/*
002 * Copyright (C) 2008 The Guava Authors
003 *
004 * Licensed under the Apache License, Version 2.0 (the "License");
005 * you may not use this file except in compliance with the License.
006 * You may obtain a copy of the License at
007 *
008 * http://www.apache.org/licenses/LICENSE-2.0
009 *
010 * Unless required by applicable law or agreed to in writing, software
011 * distributed under the License is distributed on an "AS IS" BASIS,
012 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
013 * See the License for the specific language governing permissions and
014 * limitations under the License.
015 */
016
017package com.google.common.collect.testing.google;
018
019import static java.util.Collections.sort;
020
021import com.google.common.annotations.GwtCompatible;
022import com.google.common.collect.Multiset;
023import com.google.common.collect.testing.AnEnum;
024import com.google.common.collect.testing.SampleElements;
025import com.google.common.collect.testing.SampleElements.Enums;
026import java.util.List;
027
028/**
029 * An abstract {@code TestMultisetGenerator} for generating multisets containing enum values.
030 *
031 * @author Jared Levy
032 */
033@GwtCompatible
034@ElementTypesAreNonnullByDefault
035public abstract class TestEnumMultisetGenerator implements TestMultisetGenerator<AnEnum> {
036  @Override
037  public SampleElements<AnEnum> samples() {
038    return new Enums();
039  }
040
041  @Override
042  public Multiset<AnEnum> create(Object... elements) {
043    AnEnum[] array = new AnEnum[elements.length];
044    int i = 0;
045    for (Object e : elements) {
046      array[i++] = (AnEnum) e;
047    }
048    return create(array);
049  }
050
051  protected abstract Multiset<AnEnum> create(AnEnum[] elements);
052
053  @Override
054  public AnEnum[] createArray(int length) {
055    return new AnEnum[length];
056  }
057
058  /** Sorts the enums according to their natural ordering. */
059  @Override
060  public List<AnEnum> order(List<AnEnum> insertionOrder) {
061    sort(insertionOrder);
062    return insertionOrder;
063  }
064}