Skip to content

Commit

Permalink
Auto-generated API code
Browse files Browse the repository at this point in the history
  • Loading branch information
elasticmachine committed Nov 11, 2024
1 parent 2807398 commit 66eee3f
Show file tree
Hide file tree
Showing 8 changed files with 2 additions and 264 deletions.
6 changes: 1 addition & 5 deletions elasticsearch/_async/client/__init__.py
Original file line number Diff line number Diff line change
Expand Up @@ -2496,6 +2496,7 @@ async def info(
),
parameter_aliases={"_source": "source"},
)
@_stability_warning(Stability.EXPERIMENTAL)
async def knn_search(
self,
*,
Expand Down Expand Up @@ -3792,7 +3793,6 @@ async def search(
] = None,
lenient: t.Optional[bool] = None,
max_concurrent_shard_requests: t.Optional[int] = None,
min_compatible_shard_node: t.Optional[str] = None,
min_score: t.Optional[float] = None,
pit: t.Optional[t.Mapping[str, t.Any]] = None,
post_filter: t.Optional[t.Mapping[str, t.Any]] = None,
Expand Down Expand Up @@ -3929,8 +3929,6 @@ async def search(
requests per node this search executes concurrently. This value should be
used to limit the impact of the search on the cluster in order to limit the
number of concurrent shard requests.
:param min_compatible_shard_node: The minimum version of the node that can handle
the request Any handling node with a lower version will fail the request.
:param min_score: Minimum `_score` for matching documents. Documents with a lower
`_score` are not included in the search results.
:param pit: Limits the search to a point in time (PIT). If you provide a PIT,
Expand Down Expand Up @@ -4107,8 +4105,6 @@ async def search(
__query["lenient"] = lenient
if max_concurrent_shard_requests is not None:
__query["max_concurrent_shard_requests"] = max_concurrent_shard_requests
if min_compatible_shard_node is not None:
__query["min_compatible_shard_node"] = min_compatible_shard_node
if pre_filter_shard_size is not None:
__query["pre_filter_shard_size"] = pre_filter_shard_size
if preference is not None:
Expand Down
4 changes: 0 additions & 4 deletions elasticsearch/_async/client/async_search.py
Original file line number Diff line number Diff line change
Expand Up @@ -265,7 +265,6 @@ async def submit(
] = None,
lenient: t.Optional[bool] = None,
max_concurrent_shard_requests: t.Optional[int] = None,
min_compatible_shard_node: t.Optional[str] = None,
min_score: t.Optional[float] = None,
pit: t.Optional[t.Mapping[str, t.Any]] = None,
post_filter: t.Optional[t.Mapping[str, t.Any]] = None,
Expand Down Expand Up @@ -388,7 +387,6 @@ async def submit(
per node this search executes concurrently. This value should be used to
limit the impact of the search on the cluster in order to limit the number
of concurrent shard requests
:param min_compatible_shard_node:
:param min_score: Minimum _score for matching documents. Documents with a lower
_score are not included in the search results.
:param pit: Limits the search to a point in time (PIT). If you provide a PIT,
Expand Down Expand Up @@ -517,8 +515,6 @@ async def submit(
__query["lenient"] = lenient
if max_concurrent_shard_requests is not None:
__query["max_concurrent_shard_requests"] = max_concurrent_shard_requests
if min_compatible_shard_node is not None:
__query["min_compatible_shard_node"] = min_compatible_shard_node
if pre_filter_shard_size is not None:
__query["pre_filter_shard_size"] = pre_filter_shard_size
if preference is not None:
Expand Down
119 changes: 0 additions & 119 deletions elasticsearch/_async/client/cat.py

Large diffs are not rendered by default.

4 changes: 0 additions & 4 deletions elasticsearch/_async/client/fleet.py
Original file line number Diff line number Diff line change
Expand Up @@ -322,7 +322,6 @@ async def search(
indices_boost: t.Optional[t.Sequence[t.Mapping[str, float]]] = None,
lenient: t.Optional[bool] = None,
max_concurrent_shard_requests: t.Optional[int] = None,
min_compatible_shard_node: t.Optional[str] = None,
min_score: t.Optional[float] = None,
pit: t.Optional[t.Mapping[str, t.Any]] = None,
post_filter: t.Optional[t.Mapping[str, t.Any]] = None,
Expand Down Expand Up @@ -416,7 +415,6 @@ async def search(
:param indices_boost: Boosts the _score of documents from specified indices.
:param lenient:
:param max_concurrent_shard_requests:
:param min_compatible_shard_node:
:param min_score: Minimum _score for matching documents. Documents with a lower
_score are not included in the search results.
:param pit: Limits the search to a point in time (PIT). If you provide a PIT,
Expand Down Expand Up @@ -531,8 +529,6 @@ async def search(
__query["lenient"] = lenient
if max_concurrent_shard_requests is not None:
__query["max_concurrent_shard_requests"] = max_concurrent_shard_requests
if min_compatible_shard_node is not None:
__query["min_compatible_shard_node"] = min_compatible_shard_node
if pre_filter_shard_size is not None:
__query["pre_filter_shard_size"] = pre_filter_shard_size
if preference is not None:
Expand Down
6 changes: 1 addition & 5 deletions elasticsearch/_sync/client/__init__.py
Original file line number Diff line number Diff line change
Expand Up @@ -2494,6 +2494,7 @@ def info(
),
parameter_aliases={"_source": "source"},
)
@_stability_warning(Stability.EXPERIMENTAL)
def knn_search(
self,
*,
Expand Down Expand Up @@ -3790,7 +3791,6 @@ def search(
] = None,
lenient: t.Optional[bool] = None,
max_concurrent_shard_requests: t.Optional[int] = None,
min_compatible_shard_node: t.Optional[str] = None,
min_score: t.Optional[float] = None,
pit: t.Optional[t.Mapping[str, t.Any]] = None,
post_filter: t.Optional[t.Mapping[str, t.Any]] = None,
Expand Down Expand Up @@ -3927,8 +3927,6 @@ def search(
requests per node this search executes concurrently. This value should be
used to limit the impact of the search on the cluster in order to limit the
number of concurrent shard requests.
:param min_compatible_shard_node: The minimum version of the node that can handle
the request Any handling node with a lower version will fail the request.
:param min_score: Minimum `_score` for matching documents. Documents with a lower
`_score` are not included in the search results.
:param pit: Limits the search to a point in time (PIT). If you provide a PIT,
Expand Down Expand Up @@ -4105,8 +4103,6 @@ def search(
__query["lenient"] = lenient
if max_concurrent_shard_requests is not None:
__query["max_concurrent_shard_requests"] = max_concurrent_shard_requests
if min_compatible_shard_node is not None:
__query["min_compatible_shard_node"] = min_compatible_shard_node
if pre_filter_shard_size is not None:
__query["pre_filter_shard_size"] = pre_filter_shard_size
if preference is not None:
Expand Down
4 changes: 0 additions & 4 deletions elasticsearch/_sync/client/async_search.py
Original file line number Diff line number Diff line change
Expand Up @@ -265,7 +265,6 @@ def submit(
] = None,
lenient: t.Optional[bool] = None,
max_concurrent_shard_requests: t.Optional[int] = None,
min_compatible_shard_node: t.Optional[str] = None,
min_score: t.Optional[float] = None,
pit: t.Optional[t.Mapping[str, t.Any]] = None,
post_filter: t.Optional[t.Mapping[str, t.Any]] = None,
Expand Down Expand Up @@ -388,7 +387,6 @@ def submit(
per node this search executes concurrently. This value should be used to
limit the impact of the search on the cluster in order to limit the number
of concurrent shard requests
:param min_compatible_shard_node:
:param min_score: Minimum _score for matching documents. Documents with a lower
_score are not included in the search results.
:param pit: Limits the search to a point in time (PIT). If you provide a PIT,
Expand Down Expand Up @@ -517,8 +515,6 @@ def submit(
__query["lenient"] = lenient
if max_concurrent_shard_requests is not None:
__query["max_concurrent_shard_requests"] = max_concurrent_shard_requests
if min_compatible_shard_node is not None:
__query["min_compatible_shard_node"] = min_compatible_shard_node
if pre_filter_shard_size is not None:
__query["pre_filter_shard_size"] = pre_filter_shard_size
if preference is not None:
Expand Down
Loading

0 comments on commit 66eee3f

Please sign in to comment.