Loading sharding-jdbc-doc/content/post/stress_test.md +1 −1 Original line number Diff line number Diff line Loading @@ -25,7 +25,7 @@ chart = true | 数据表行数 | 1000万 | 1000万 | ## 网络拓扑   ## 单库情况下Sharding-JDBC与JDBC性能对比 测试结论: Loading sharding-jdbc-doc/content/post/user_guide.md +4 −4 Original line number Diff line number Diff line Loading @@ -225,7 +225,7 @@ public Collection<String> doBetweenSharding(final Collection<String> availableTa 下面是一个余2的算法的例子,当分片键的值除以2余数就是实际表的结尾。注意注释中提供了一些算法生成SQL的结果,参数`tableNames`集合中有两个参数`t_order_0`和`t_order_1` ```java public final class ModuloDatabaseShardingAlgorithm implements SingleKeyDatabaseShardingAlgorithm<Integer> { public final class ModuloTableShardingAlgorithm implements SingleKeyTableShardingAlgorithm<Integer> { /** * select * from t_order from t_order where order_id = 11 Loading Loading @@ -254,9 +254,9 @@ public Collection<String> doBetweenSharding(final Collection<String> availableTa public Collection<String> doInSharding(final Collection<String> tableNames, final ShardingValue<Integer> shardingValue) { Collection<String> result = new LinkedHashSet<>(tableNames.size()); for (Integer value : shardingValue.getValues()) { for (String dataSourceName : tableNames) { if (dataSourceName.endsWith(value % 2 + "")) { result.add(dataSourceName); for (String tableName : tableNames) { if (tableName.endsWith(value % 2 + "")) { result.add(tableName); } } } Loading Loading
sharding-jdbc-doc/content/post/stress_test.md +1 −1 Original line number Diff line number Diff line Loading @@ -25,7 +25,7 @@ chart = true | 数据表行数 | 1000万 | 1000万 | ## 网络拓扑   ## 单库情况下Sharding-JDBC与JDBC性能对比 测试结论: Loading
sharding-jdbc-doc/content/post/user_guide.md +4 −4 Original line number Diff line number Diff line Loading @@ -225,7 +225,7 @@ public Collection<String> doBetweenSharding(final Collection<String> availableTa 下面是一个余2的算法的例子,当分片键的值除以2余数就是实际表的结尾。注意注释中提供了一些算法生成SQL的结果,参数`tableNames`集合中有两个参数`t_order_0`和`t_order_1` ```java public final class ModuloDatabaseShardingAlgorithm implements SingleKeyDatabaseShardingAlgorithm<Integer> { public final class ModuloTableShardingAlgorithm implements SingleKeyTableShardingAlgorithm<Integer> { /** * select * from t_order from t_order where order_id = 11 Loading Loading @@ -254,9 +254,9 @@ public Collection<String> doBetweenSharding(final Collection<String> availableTa public Collection<String> doInSharding(final Collection<String> tableNames, final ShardingValue<Integer> shardingValue) { Collection<String> result = new LinkedHashSet<>(tableNames.size()); for (Integer value : shardingValue.getValues()) { for (String dataSourceName : tableNames) { if (dataSourceName.endsWith(value % 2 + "")) { result.add(dataSourceName); for (String tableName : tableNames) { if (tableName.endsWith(value % 2 + "")) { result.add(tableName); } } } Loading