项目：guava-mock
文件：SetGenerators.java
@Override
protected SortedSet<Integer> create(Integer[] elements) {
SortedSet<Integer> set = nullCheckedTreeSet(elements);
if (set.isEmpty()) {
/*
* The (tooLow + 1,tooHigh) arguments below would be invalid because tooLow would be
* greater than tooHigh.
*/
return ContiguousSet.create(Range.openClosed(0,1),discreteDomain.integers()).subSet(0,1);
}
int tooHigh = set.last() + 1;
int tooLow = set.first() - 1;
set.add(tooHigh);
set.add(tooLow);
return checkedCreate(set).subSet(tooLow + 1,tooHigh);
}
@Test
public void multipleGroupBytest() throws Exception {
Set expectedAges = new HashSet<Integer>(ContiguousSet.create(Range.closed(20,40),discreteDomain.integers()));
Map<String,Set<Integer>> buckets = new HashMap<>();
Aggregations result = query(String.format("SELECT COUNT(*) FROM %s/account GROUP BY gender,terms('field'='age','size'=200,'alias'='age')",TEST_INDEX));
Terms gender = result.get("gender");
for(Terms.Bucket genderBucket : gender.getBuckets()) {
String genderKey = genderBucket.getKey().toString();
buckets.put(genderKey,new HashSet<Integer>());
Terms ageBuckets = (Terms) genderBucket.getAggregations().get("age");
for(Terms.Bucket ageBucket : ageBuckets.getBuckets()) {
buckets.get(genderKey).add(Integer.parseInt(ageBucket.getKey().toString()));
}
}
Assert.assertEquals(2,buckets.keySet().size());
Assert.assertEquals(expectedAges,buckets.get("m"));
Assert.assertEquals(expectedAges,buckets.get("f"));
}
@Test
public void multipleGroupBysWithSize() throws Exception {
Set expectedAges = new HashSet<Integer>(ContiguousSet.create(Range.closed(20,terms('alias'='ageAgg','field'='age','size'=3)",TEST_INDEX));
Terms gender = result.get("gender");
Assert.assertEquals(2,gender.getBuckets().size());
for(Terms.Bucket genderBucket : gender.getBuckets()) {
String genderKey = genderBucket.getKey().toString();
buckets.put(genderKey,new HashSet<Integer>());
Terms ageBuckets = genderBucket.getAggregations().get("ageAgg");
Assert.assertEquals(3,ageBuckets.getBuckets().size());
}
}
@Override
protected SortedSet<Integer> create(Integer[] elements) {
SortedSet<Integer> set = nullCheckedTreeSet(elements);
if (set.isEmpty()) {
/*
* The (tooLow + 1,tooHigh);
}
项目：Backmemed
文件：BiomeEndDecorator.java
public WorldGenSpikes.EndSpike[] load(Long p_load_1_) throws Exception
{
List<Integer> list = Lists.newArrayList(ContiguousSet.create(Range.closedOpen(Integer.valueOf(0),Integer.valueOf(10)),discreteDomain.integers()));
Collections.shuffle(list,new Random(p_load_1_.longValue()));
WorldGenSpikes.EndSpike[] aworldgenspikes$endspike = new WorldGenSpikes.EndSpike[10];
for (int i = 0; i < 10; ++i)
{
int j = (int)(42.0D * Math.cos(2.0D * (-Math.PI + (Math.PI / 10D) * (double)i)));
int k = (int)(42.0D * Math.sin(2.0D * (-Math.PI + (Math.PI / 10D) * (double)i)));
int l = ((Integer)list.get(i)).intValue();
int i1 = 2 + l / 3;
int j1 = 76 + l * 3;
boolean flag = l == 1 || l == 2;
aworldgenspikes$endspike[i] = new WorldGenSpikes.EndSpike(j,k,i1,j1,flag);
}
return aworldgenspikes$endspike;
}
项目：CustomWorldGen
文件：BiomeEndDecorator.java
public WorldGenSpikes.EndSpike[] load(Long p_load_1_) throws Exception
{
List<Integer> list = Lists.newArrayList(ContiguousSet.create(Range.closedOpen(Integer.valueOf(0),flag);
}
return aworldgenspikes$endspike;
}
项目：fact-tools
文件：Utils.java
/**
* Return an int array with the ids of the pixelSet belonging to the given Key,* return all camera pixel Ids if the set is not existing
*/
public static int[] getValidPixelSetAsIntArr(Data item,int npix,String pixelSetKey) {
int[] pixels;
//Load a given pixelset,otherwise use the the whole camera
if (pixelSetKey == null) {
ContiguousSet<Integer> numbers = ContiguousSet.create(Range.closed(0,npix - 1),discreteDomain.integers());
pixels = Ints.toArray(numbers);
} else {
Utils.iskeyvalid(item,pixelSetKey,PixelSet.class);
PixelSet pixelSet = (PixelSet) item.get(pixelSetKey);
pixels = pixelSet.toIntArray();
}
return pixels;
}
private String modify(String data,Set<Integer> indexesToRemove) {
List<String> lines = Arrays.asList(StringUtils.split(data,NEWLINE));
Set<Integer> dataIndexes = ContiguousSet.create(Range.closed(1,lines.size()),discreteDomain.integers());
if (!dataIndexes.containsAll(indexesToRemove)) {
LOGGER.warn("Some of defined ranges exceed source lenght. Source length is: " + lines.size());
}
Set<Integer> filtereedindexesToRemove = Sets.intersection(dataIndexes,indexesToRemove);
List<String> modifiedLines = new ArrayList<String>(
lines.size() - filtereedindexesToRemove.size());
for (int i = 0; i < lines.size(); i++) {
if (!filtereedindexesToRemove.contains(i + 1)) {
modifiedLines.add(lines.get(i));
}
}
return StringUtils.join(modifiedLines,NEWLINE);
}
项目：owsi-core-parent
文件：AbstractExcelTableExport.java
/**
* Ajoute les en-têtes dans la feuille de calcul et cache les colonnes qui doivent l'être.
*
* @param sheet feuille de calcul
* @param rowIndex numéro de la ligne
* @param columnInfos RangeMap contenant les @R_511_4045@ions de colonnes (valeurs) et les index sur auxquelles s'appliquent ces colonnes (clés).
* Les "colonnes" s'étendant sur plus d'un index seront automatiquement fusionnées.
*/
protected void addHeadersToSheet(Sheet sheet,int rowIndex,RangeMap<Integer,Column@R_511_4045@ion> columnInfos) {
Row rowHeader = sheet.createRow(rowIndex);
for (Map.Entry<Range<Integer>,Column@R_511_4045@ion> entry : columnInfos.asMapOfRanges().entrySet()) {
Range<Integer> range = entry.getKey();
Column@R_511_4045@ion column@R_511_4045@ion = entry.getValue();
addHeaderCell(rowHeader,range.lowerEndpoint(),getColumnLabel(column@R_511_404[email protected]()));
for (Integer columnIndex : ContiguousSet.create(range,discreteDomain.integers())) {
sheet.setColumnHidden(columnIndex,column@R_511_404[email protected]());
}
int beginIndex = range.lowerEndpoint();
int endindex = range.upperEndpoint();
if (beginIndex != endindex) {
sheet.addMergedRegion(new CellRangeAddress(rowIndex,rowIndex,beginIndex,endindex));
}
}
}
private static void checkOnNext(MemoizingObserver<Object> observer) {
assertTrue(observer.responses().isEmpty());
final Object firstResponse = new Object();
observer.onNext(firstResponse);
assertEquals(firstResponse,observer.firstResponse());
final ContiguousSet<Integer> sorted = ContiguousSet.create(Range.closed(1,20),discreteDomain.integers());
final List<Integer> moreResponses = newArrayList(newHashSet(sorted));
for (Integer element : moreResponses) {
observer.onNext(element);
}
final List<Object> actualResponses = observer.responses();
assertEquals(firstResponse,actualResponses.get(0));
assertEquals(moreResponses.size() + 1,// as there was the first response
actualResponses.size());
assertEquals(moreResponses,actualResponses.subList(1,actualResponses.size()));
}
项目：greyfish
文件：Recombinations.java
@VisibleForTesting
UniformCrossover(final RandomGenerator rng,final double p) {
this(new Function<Integer,Iterable<Integer>>() {
@Override
public Iterable<Integer> apply(final Integer bitStringLength) {
if (bitStringLength * p < 0.01) {
return Samplings.random(rng).withoutReplacement().sample(
ContiguousSet.create(Range.closedOpen(0,bitStringLength),discreteDomain.integers()),new Binomialdistribution(rng,bitStringLength,p).sample()
);
} else {
return Iterables.filter(
ContiguousSet.create(Range.closedOpen(0,new Predicate<Integer>() {
@Override
public boolean apply(@Nullable final Integer input) {
return p > rng.nextFloat();
}
});
}
}
});
}
@Test
public void multipleGroupBytest() throws Exception {
Set expectedAges = new HashSet<Integer>(ContiguousSet.create(Range.closed(20,age",TestsConstants.TEST_INDEX));
Terms gender = result.get("gender");
for(Terms.Bucket genderBucket : gender.getBuckets()) {
String genderKey = genderBucket.getKey().toString();
buckets.put(genderKey,buckets.get("f"));
}
项目：guava
文件：SetGenerators.java
@Override
protected SortedSet<Integer> create(Integer[] elements) {
SortedSet<Integer> set = nullCheckedTreeSet(elements);
if (set.isEmpty()) {
/*
* The (tooLow + 1,tooHigh);
}
@Test
public void multipleGroupBytest() throws Exception {
Set expectedAges = new HashSet<Integer>(ContiguousSet.create(Range.closed(20,TEST_INDEX_ACCOUNT));
Terms gender = result.get("gender");
for(Terms.Bucket genderBucket : gender.getBuckets()) {
String genderKey = genderBucket.getKey().toString();
buckets.put(genderKey,buckets.get("f"));
}
@Test
public void multipleGroupBysWithSize() throws Exception {
Set expectedAges = new HashSet<Integer>(ContiguousSet.create(Range.closed(20,TEST_INDEX_ACCOUNT));
Terms gender = result.get("gender");
Assert.assertEquals(2,ageBuckets.getBuckets().size());
}
}
项目：java-util-examples
文件：GenerateOddNumbers.java
@Test
public void generate_odd_numbers_in_range_guava() {
Set<Integer> set = ContiguousSet.create(Range.closed(1,10),discreteDomain.integers());
Iterable<Integer> oddNumbers = Iterables.filter(set,new Predicate<Integer>() {
@Override
public boolean apply(Integer input) {
return input % 2 != 0;
}
});
logger.info(oddNumbers);
assertthat(
oddNumbers,contains(new Integer(1),new Integer(3),new Integer(5),new Integer(7),new Integer(9)));
}
@Test
public void generate_even_numbers_in_range_guava() {
Set<Integer> set = ContiguousSet.create(Range.closed(1,discreteDomain.integers());
Iterable<Integer> evennumbers = Iterables.filter(set,new Predicate<Integer>() {
@Override
public boolean apply(Integer input) {
return input % 2 == 0;
}
});
assertthat(
evennumbers,contains(new Integer(2),new Integer(4),new Integer(6),new Integer(8),new Integer(10)));
}
项目：grappa
文件：RangeMatcherBuilder.java
private static Range<Integer> normalizeRange(final Range<Integer> range)
{
Range<Integer> newRange = AT_LEAST_ZERO.intersection(range);
if (newRange.isEmpty())
throw new IllegalArgumentException("illegal range " + range
+ ": intersection with " + AT_LEAST_ZERO + " is empty");
newRange = newRange.canonical(discreteDomain.integers());
final int lowerBound = newRange.lowerEndpoint();
return newRange.hasUpperBound()
? Range.closed(lowerBound,newRange.upperEndpoint() - 1)
: Range.atLeast(lowerBound);
}
项目：streamjit
文件：Storage.java
/**
* Returns a range spanning the indices written in this storage during an
* execution of the given schedule. (Note that,as a span,not every
* contained index will be written.) The returned range will be
* {@link Range#canonical(com.google.common.collect.discreteDomain) canonical}.
* The range is not cached so as to be responsive to changes in output index
* functions.
* @param externalSchedule the schedule
* @return a range spanning the indices written during the given schedule
* under the current index functions
* @see #writeIndices(java.util.Map)
*/
public Range<Integer> writeIndexSpan(Map<ActorGroup,Integer> externalSchedule) {
Range<Integer> range = null;
for (Actor a : upstream()) {
//just the first and last iteration
int maxIteration = a.group().schedule().get(a) * externalSchedule.get(a.group())-1;
if (maxIteration >= 0)
for (int iteration : new int[]{0,maxIteration}) {
ImmutableSortedSet<Integer> writes = a.writes(this,iteration);
Range<Integer> writerange = writes.isEmpty() ? range : Range.closed(writes.first(),writes.last());
range = range == null ? writerange : range.span(writerange);
}
}
range = (range != null ? range : Range.closedOpen(0,0));
return range.canonical(discreteDomain.integers());
}
项目：SpigotSource
文件：BiomeTheEndDecorator.java
public WorldGenEnder.Spike[] a(Long olong) throws Exception {
ArrayList arraylist = Lists.newArrayList(ContiguousSet.create(Range.closedOpen(Integer.valueOf(0),discreteDomain.integers()));
Collections.shuffle(arraylist,new Random(olong.longValue()));
WorldGenEnder.Spike[] aworldgenender_spike = new WorldGenEnder.Spike[10];
for (int i = 0; i < 10; ++i) {
int j = (int) (42.0D * Math.cos(2.0D * (-3.141592653589793D + 0.3141592653589793D * (double) i)));
int k = (int) (42.0D * Math.sin(2.0D * (-3.141592653589793D + 0.3141592653589793D * (double) i)));
int l = ((Integer) arraylist.get(i)).intValue();
int i1 = 2 + l / 3;
int j1 = 76 + l * 3;
boolean flag = l == 1 || l == 2;
aworldgenender_spike[i] = new WorldGenEnder.Spike(j,flag);
}
return aworldgenender_spike;
}
项目：MFIBlocking
文件：MathUtilsTest.java
@Test
public void testnormilize() throws Exception {
int[] rangeNumbersPrimitive = Ints.toArray(ContiguousSet.create(Range.closed(1,discreteDomain.integers()));
HashMap<Integer,Float> idTovalue = new HashMap<>();
for (int index = 0; index < rangeNumbersPrimitive.length; index++) {
idTovalue.put(index,(float) rangeNumbersPrimitive[index]);
}
HashMap<Integer,Float> copyMap = new HashMap<>(idTovalue);
MathUtils.normilize(idTovalue);
//assert range
for (Float normValue : idTovalue.values()) {
assertthat((double) normValue,allOf(lessthanorEqualTo(1.0),greaterThanorEqualTo(0.0)));
}
//assert values
for (Map.Entry<Integer,Float> entry : idTovalue.entrySet()) {
Integer key = entry.getKey();
assertthat((double) entry.getValue(),closeto((copyMap.get(key) - 1.0) / (9),0.0001));
}
}
项目：levelup-java-examples
文件：GenerateOddNumbers.java
@Test
public void generate_odd_numbers_in_range_guava() {
Set<Integer> set = ContiguousSet.create(Range.closed(1,new Integer(9)));
}
@Test
public void generate_even_numbers_in_range_guava() {
Set<Integer> set = ContiguousSet.create(Range.closed(1,new Integer(10)));
}
private final BitSet convertToBitSet(final RangeSet<Integer> rangeSet) {
if(rangeSet.isEmpty()) {
return new BitSet();
}
final BitSet bitSet = new BitSet(rangeSet.span().upperEndpoint());
rangeSet.asRanges().forEach(range -> {
if(!range.canonical(discreteDomain.integers()).isEmpty()) {
Range<Integer> closedRange = ContiguousSet.create(range,discreteDomain.integers()).range();
bitSet.set(closedRange.lowerEndpoint(),closedRange.upperEndpoint() + 1);
}
});
return bitSet;
}
@Override public String toString() {
final List<String> ranges = new ArrayList<>();
rangeSet.asRanges().forEach(range -> {
if(!range.isEmpty()) {
Range<Integer> closedRange = ContiguousSet.create(range,discreteDomain.integers()).range();
final int from = closedRange.lowerEndpoint();
final int to = closedRange.upperEndpoint();
if(from != to)
ranges.add("" + from + "-" + to);
else
ranges.add("" + from);
}
});
if(containSEOF)
ranges.add("EOF");
return "[" + String.join(",",ranges) + "]";
}
项目：RoaringBitmap
文件：TestRoaringBitmap.java
@Test
public void testFirstLast_AfterLazyMutation2() {
RoaringBitmap rb = new RoaringBitmap();
Iterable<Integer> willForceUSEOfBitmapContainer = Iterables.filter(
ContiguousSet.create(Range.openClosed(0,1 << 16),new Predicate<Integer>() {
@Override
public boolean apply(Integer input) {
return input % 3 == 0;
}
}
);
int max = 0;
for(Integer i : willForceUSEOfBitmapContainer) {
rb.add(i);
max = i;
}
Assert.assertEquals(3,rb.first());
Assert.assertEquals(max,rb.last());
RoaringBitmap mutator = new RoaringBitmap();
mutator.add(0,2,4,6,8);
rb.lazyor(mutator);
Assert.assertEquals(0,rb.last());
}
项目：pentaho-kettle
文件：MemoryGroupByAggregationTest.java
private Iterable<Object[]> getRows() {
if ( data.isEmpty() ) {
return ImmutableSet.of();
}
Range<Integer> rows = Range.closed( 0,data.rowMap().lastKey() );
return FluentIterable.from( ContiguousSet.create( rows,discreteDomain.integers() ) )
.transform( Functions.forMap( data.rowMap(),ImmutableMap.<Integer,Optional<Object>>of() ) )
.transform( new Function<Map<Integer,Optional<Object>>,Object[]>() {
@Override public Object[] apply( Map<Integer,Optional<Object>> input ) {
Object[] row = new Object[rowMeta.size()];
for ( Map.Entry<Integer,Optional<Object>> entry : input.entrySet() ) {
row[entry.getKey()] = entry.getValue().orNull();
}
return row;
}
} );
}
项目：open-kilda
文件：ResourcePool.java
/**
* Allocates resource id.
*
* @return allocated resource id
*/
public Integer allocate() {
for (Integer id : ContiguousSet.create(range,discreteDomain.integers())) {
if (resources.add(id)) {
return id;
}
}
throw new Arrayindexoutofboundsexception("Could not allocate resource: pool is full");
}
项目：guava-mock
文件：SetGenerators.java
protected final ContiguousSet<Integer> checkedCreate(SortedSet<Integer> elementsSet) {
List<Integer> elements = newArrayList(elementsSet);
/*
* A ContiguousSet can't have holes. If a test demands a hole,it should be changed so that it
* doesn't need one,or it should be suppressed for ContiguousSet.
*/
for (int i = 0; i < elements.size() - 1; i++) {
assertEquals(elements.get(i) + 1,(int) elements.get(i + 1));
}
Range<Integer> range =
(elements.isEmpty()) ? Range.closedOpen(0,0) : Range.encloseAll(elements);
return ContiguousSet.create(range,discreteDomain.integers());
}
项目：javaide
文件：JavaInput.java
public RangeSet<Integer> characterRangesToTokenRanges(Collection<Range<Integer>> characterRanges)
throws FormatterException {
RangeSet<Integer> tokenRangeSet = TreeRangeSet.create();
for (Range<Integer> characterRange0 : characterRanges) {
Range<Integer> characterRange = characterRange0.canonical(discreteDomain.integers());
tokenRangeSet.add(
characterRangetoTokenRange(
characterRange.lowerEndpoint(),characterRange.upperEndpoint() - characterRange.lowerEndpoint()));
}
return tokenRangeSet;
}
项目：matplotlib4j
文件：NumpyUtils.java
public static List<Double> arange(double start,double end,double step) {
double scaledStart = start / step;
double scaledEnd = end / step;
double floorGap = scaledStart - (int) scaledStart;
return ContiguousSet.create(Range.closed((int) scaledStart,(int) scaledEnd),discreteDomain.integers())
.stream().map(x -> (x + floorGap) * step).collect(Collectors.toList());
}
@Test
public void testSubAggregations() throws Exception {
Set expectedAges = new HashSet<>(ContiguousSet.create(Range.closed(20,discreteDomain.integers()));
final String query = String.format("SELECT /*! DOCS_WITH_AGGREGATION(10) */" +
" * FROM %s/account GROUP BY (gender,'alias'='age')),(state) LIMIT 200,200",TEST_INDEX);
Map<String,Set<Integer>> buckets = new HashMap<>();
sqlElasticSearchRequestBuilder select = getSearchRequestBuilder(query);
SearchResponse response = (SearchResponse) select.get();
Aggregations result = response.getAggregations();
Terms gender = result.get("gender");
for(Terms.Bucket genderBucket : gender.getBuckets()) {
String genderKey = genderBucket.getKey().toString();
buckets.put(genderKey,buckets.get("f"));
Terms state = result.get("state");
for(Terms.Bucket stateBucket : state.getBuckets()) {
if(stateBucket.getKey().toString().equalsIgnoreCase("ak")) {
Assert.assertTrue("There are 22 entries for state ak",stateBucket.getDocCount() == 22);
}
}
Assert.assertEquals(response.getHits().totalHits(),1000);
Assert.assertEquals(response.getHits().hits().length,10);
}
static EncodeddiscreteResources of(Set<discreteResource> resources,discreteResourceCodec codec) {
RangeSet<Integer> rangeSet = TreeRangeSet.create();
resources.stream()
.map(x -> x.valueAs(Object.class))
.flatMap(Tools::stream)
.map(x -> codec.encode(x))
.map(Range::singleton)
.map(x -> x.canonical(discreteDomain.integers()))
.forEach(rangeSet::add);
return new EncodeddiscreteResources(rangeSet,codec);
}
protected final ContiguousSet<Integer> checkedCreate(SortedSet<Integer> elementsSet) {
List<Integer> elements = newArrayList(elementsSet);
/*
* A ContiguousSet can't have holes. If a test demands a hole,discreteDomain.integers());
}
项目：Mastering-Mesos
文件：Numbers.java
/**
* Performs {@link #toRange(IRange)} for a collection of ranges,and convert the result to a set
* of integers.
*
* @param ranges Ranges to convert.
* @return A set representing {@code ranges}.
*/
public static Set<Integer> rangesToInstanceIds(Iterable<IRange> ranges) {
ImmutableRangeSet.Builder<Integer> instanceIds = ImmutableRangeSet.builder();
for (IRange range : ranges) {
instanceIds.add(toRange(range));
}
return instanceIds.build().asSet(discreteDomain.integers());
}
项目：Mastering-Mesos
文件：JobDiff.java
/**
* Creates a map of {@code instanceCount} copies of {@code config}.
*
* @param config Configuration to generate an instance mapping for.
* @param instanceCount Number of instances to represent.
* @return A map of instance IDs (from 0 to {@code instanceCount - 1}) to {@code config}.
*/
public static Map<Integer,ITaskConfig> asMap(ITaskConfig config,int instanceCount) {
requireNonNull(config);
Set<Integer> desiredInstances = ContiguousSet.create(
Range.closedOpen(0,instanceCount),discreteDomain.integers());
return ImmutableMap.copyOf(Maps.asMap(desiredInstances,Functions.constant(config)));
}
/**
* Constructs a SanitizedConfiguration object and populates the set of instance IDs for
* the provided {@link org.apache.aurora.scheduler.storage.entities.ITaskConfig}.
*
* @param sanitized A sanitized configuration.
*/
@VisibleForTesting
public SanitizedConfiguration(IJobConfiguration sanitized) {
this.sanitized = sanitized;
this.instanceIds = ContiguousSet.create(
Range.closedOpen(0,sanitized.getInstanceCount()),discreteDomain.integers());
}
项目：Mastering-Mesos
文件：CrontabEntry.java
private String fieldToString(RangeSet<Integer> rangeSet,Range<Integer> coveringRange) {
if (rangeSet.asRanges().size() == 1 && rangeSet.encloses(coveringRange)) {
return "*";
}
List<String> components = Lists.newArrayList();
for (Range<Integer> range : rangeSet.asRanges()) {
ContiguousSet<Integer> set = ContiguousSet.create(range,discreteDomain.integers());
if (set.size() == 1) {
components.add(set.first().toString());
} else {
components.add(set.first() + "-" + set.last());
}
}
return String.join(",components);
}
private Range<Long> getEffectiveAddedRange(TimeRange requested,Range<Long> returned) {
if (returned == null) {
return requested.getTimes().canonical(discreteDomain.longs());
}
switch (requested.getorder()) {
case NEWEST_FirsT:
return Range.closed(returned.lowerEndpoint(),requested.getTimes().upperEndpoint());
case OLDEST_FirsT:
return Range.closed(requested.getTimes().lowerEndpoint(),returned.upperEndpoint());
default:
throw new IllegalArgumentException(
"Unexpected value for enum: " + requested.getorder());
}
}
版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 [email protected] 举报，一经查实，本站将立刻删除。