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

[DOCS] Clarify migrate guide and search request validation 

Relates to  #26811
This commit is contained in:
javanna 2017-10-31 12:36:00 +01:00 committed by Luca Cavanna
parent c3e2bdf20c
commit 34666844b3
2 changed files with 10 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
core/src/test/java/org/elasticsearch/search/aggregations/bucket/adjacency/AdjacencyMatrixAggregationBuilderTests.java
View File

@ -43,7 +43,6 @@ import static org.mockito.Mockito.when;
public class AdjacencyMatrixAggregationBuilderTests extends ESTestCase { public class AdjacencyMatrixAggregationBuilderTests extends ESTestCase {
public void testFilterSizeLimitation() throws Exception { public void testFilterSizeLimitation() throws Exception {
// filter size grater than max size should thrown a exception // filter size grater than max size should thrown a exception
QueryShardContext queryShardContext = mock(QueryShardContext.class); QueryShardContext queryShardContext = mock(QueryShardContext.class);

13
docs/reference/migration/migrate_7_0/search.asciidoc
View File

@ -22,7 +22,14 @@ PUT /_cluster/settings
-------------------------------------------------- --------------------------------------------------
// CONSOLE // CONSOLE
=== `_search/scroll` returns `400` for invalid requests ==== Search API returns `400` for invalid requests
The `/_search/scroll` endpoint returns `400 - Bad request` when the request invalid, while it would previously The Search API returns `400 - Bad request` while it would previously return
return `500 - Internal Server Error` in such case. `500 - Internal Server Error` in the following cases of invalid request:
* the result window is too large
* sort is used in combination with rescore
* the rescore window is too large
* the number of slices is too large
* keep alive for scroll is too large
* number of filters in the adjacency matrix aggregation is too large