honeymoose
/
OpenSearch
mirror of https://github.com/honeymoose/OpenSearch.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

reference original issue

This commit is contained in:
Michael McCandless 2015-08-27 13:06:00 -04:00 committed by mikemccand
parent 30a3e431ec
commit e2e1b7f76a
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
core/src/test/java/org/elasticsearch/index/shard/NewPathForShardTest.java
View File

@ -219,7 +219,7 @@ public class NewPathForShardTest extends ESTestCase {
dataPathToShardCount.put(NodeEnvironment.shardStatePathToDataPath(result1.getDataPath()), 1); dataPathToShardCount.put(NodeEnvironment.shardStatePathToDataPath(result1.getDataPath()), 1);
ShardPath result2 = ShardPath.selectNewPathForShard(nodeEnv, shardId, Settings.EMPTY, 100, dataPathToShardCount); ShardPath result2 = ShardPath.selectNewPathForShard(nodeEnv, shardId, Settings.EMPTY, 100, dataPathToShardCount);
// This was the original failure: on a node with 2 disks that have nearly equal // #11122: this was the original failure: on a node with 2 disks that have nearly equal
// free space, we would always allocate all N incoming shards to the one path that // free space, we would always allocate all N incoming shards to the one path that
// had the most free space, never using the other drive unless new shards arrive // had the most free space, never using the other drive unless new shards arrive
// after the first shards started using storage: // after the first shards started using storage: