1 /* 2 * Copyright (C) 2008 The Guava Authors 3 * 4 * Licensed under the Apache License, Version 2.0 (the "License"); 5 * you may not use this file except in compliance with the License. 6 * You may obtain a copy of the License at 7 * 8 * http://www.apache.org/licenses/LICENSE-2.0 9 * 10 * Unless required by applicable law or agreed to in writing, software 11 * distributed under the License is distributed on an "AS IS" BASIS, 12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13 * See the License for the specific language governing permissions and 14 * limitations under the License. 15 */ 16 17 package com.google.common.collect.testing.google; 18 19 import com.google.common.annotations.GwtCompatible; 20 import com.google.common.collect.Multiset; 21 import com.google.common.collect.testing.AnEnum; 22 import com.google.common.collect.testing.SampleElements; 23 import com.google.common.collect.testing.SampleElements.Enums; 24 25 import java.util.Collections; 26 import java.util.List; 27 28 /** 29 * An abstract {@code TestMultisetGenerator} for generating multisets containing 30 * enum values. 31 * 32 * @author Jared Levy 33 */ 34 @GwtCompatible 35 public abstract class TestEnumMultisetGenerator 36 implements TestMultisetGenerator<AnEnum> { 37 @Override samples()38 public SampleElements<AnEnum> samples() { 39 return new Enums(); 40 } 41 42 @Override create(Object... elements)43 public Multiset<AnEnum> create(Object... elements) { 44 AnEnum[] array = new AnEnum[elements.length]; 45 int i = 0; 46 for (Object e : elements) { 47 array[i++] = (AnEnum) e; 48 } 49 return create(array); 50 } 51 create(AnEnum[] elements)52 protected abstract Multiset<AnEnum> create(AnEnum[] elements); 53 54 @Override createArray(int length)55 public AnEnum[] createArray(int length) { 56 return new AnEnum[length]; 57 } 58 59 /** 60 * Sorts the enums according to their natural ordering. 61 */ 62 @Override order(List<AnEnum> insertionOrder)63 public List<AnEnum> order(List<AnEnum> insertionOrder) { 64 Collections.sort(insertionOrder); 65 return insertionOrder; 66 } 67 } 68