honeymoose/OpenSearch
1
0
Fork 0
mirror of https://github.com/honeymoose/OpenSearch.git synced 2025-02-17 10:25:15 +00:00
Code Issues Packages Projects Releases Wiki Activity

[TEST] Added sort duel between a single shard index and a multi shard index.

Browse Source
This commit is contained in:
Martijn van Groningen 2014-06-02 14:16:35 +02:00
parent 15515f0f05
commit f2641d29ae
1 changed files with 36 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

37
src/test/java/org/elasticsearch/search/sort/SimpleSortTests.java
View File

@ -28,6 +28,7 @@ import org.elasticsearch.action.index.IndexRequestBuilder;
import org.elasticsearch.action.search.SearchPhaseExecutionException;
import org.elasticsearch.action.search.SearchResponse;
import org.elasticsearch.action.search.ShardSearchFailure;
import org.elasticsearch.cluster.metadata.IndexMetaData;
import org.elasticsearch.common.text.StringAndBytesText;
import org.elasticsearch.common.text.Text;
import org.elasticsearch.common.xcontent.XContentBuilder;
@ -51,7 +52,6 @@ import static org.elasticsearch.common.xcontent.XContentFactory.jsonBuilder;
import static org.elasticsearch.index.query.QueryBuilders.*;
import static org.elasticsearch.index.query.functionscore.ScoreFunctionBuilders.scriptFunction;
import static org.elasticsearch.test.hamcrest.ElasticsearchAssertions.*;
import static org.elasticsearch.test.hamcrest.ElasticsearchAssertions.assertNoFailures;
import static org.hamcrest.Matchers.*;
@ -1579,5 +1579,40 @@ public class SimpleSortTests extends ElasticsearchIntegrationTest {
}
}
@Test
public void testSortDuelBetweenSingleShardAndMultiShardIndex() throws Exception {
String sortField = "sortField";
assertAcked(prepareCreate("test1")
.setSettings(IndexMetaData.SETTING_NUMBER_OF_SHARDS, between(2, maximumNumberOfShards()))
.addMapping("type", sortField, "type=long").get());
assertAcked(prepareCreate("test2")
.setSettings(IndexMetaData.SETTING_NUMBER_OF_SHARDS, 1)
.addMapping("type", sortField, "type=long").get());
for (String index : new String[]{"test1", "test2"}) {
List<IndexRequestBuilder> docs = new ArrayList<>();
for (int i = 0; i < 256; i++) {
docs.add(client().prepareIndex(index, "type", Integer.toString(i)).setSource(sortField, i));
}
indexRandom(true, docs);
}
ensureSearchable("test1", "test2");
SortOrder order = randomBoolean() ? SortOrder.ASC : SortOrder.DESC;
int from = between(0, 256);
int size = between(0, 256);
SearchResponse multiShardResponse = client().prepareSearch("test1").setFrom(from).setSize(size).addSort(sortField, order).get();
assertNoFailures(multiShardResponse);
SearchResponse singleShardResponse = client().prepareSearch("test2").setFrom(from).setSize(size).addSort(sortField, order).get();
assertNoFailures(singleShardResponse);
assertThat(multiShardResponse.getHits().totalHits(), equalTo(singleShardResponse.getHits().totalHits()));
assertThat(multiShardResponse.getHits().getHits().length, equalTo(singleShardResponse.getHits().getHits().length));
for (int i = 0; i < multiShardResponse.getHits().getHits().length; i++) {
assertThat(multiShardResponse.getHits().getAt(i).sortValues()[0], equalTo(singleShardResponse.getHits().getAt(i).sortValues()[0]));
assertThat(multiShardResponse.getHits().getAt(i).id(), equalTo(singleShardResponse.getHits().getAt(i).id()));
}
}
}