/* * Copyright 1999-2015 dangdang.com. *

* 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.dangdang.ddframe.rdb.sharding.spring.algorithm; import com.dangdang.ddframe.rdb.sharding.api.RangeShardingValue; import com.dangdang.ddframe.rdb.sharding.api.ShardingValue; import com.dangdang.ddframe.rdb.sharding.api.strategy.table.SingleKeyTableShardingAlgorithm; import com.google.common.collect.Range; import java.util.Collection; import java.util.LinkedHashSet; public class SingleKeyModuloTableShardingAlgorithm implements SingleKeyTableShardingAlgorithm { @Override public String doEqualSharding(final Collection availableTargetNames, final ShardingValue shardingValue) { for (String each : availableTargetNames) { if (each.endsWith(shardingValue.getValue() % 4 + "")) { return each; } } throw new UnsupportedOperationException(); } @Override public Collection doBetweenSharding(final Collection availableTargetNames, final RangeShardingValue shardingValue) { Collection result = new LinkedHashSet<>(availableTargetNames.size()); Range range = shardingValue.getValueRange(); for (Integer i = range.lowerEndpoint(); i <= range.upperEndpoint(); i++) { for (String each : availableTargetNames) { if (each.endsWith(i % 4 + "")) { result.add(each); } } } return result; } }