mirror of
https://github.com/ansible-collections/google.cloud.git
synced 2025-07-28 07:31:29 -07:00
Fix many documentation lint errors
This commit is contained in:
parent
1a7d4e3cda
commit
608a8486e3
17 changed files with 75 additions and 86 deletions
|
@ -476,7 +476,7 @@ options:
|
|||
- The load balancing algorithm used within the scope of the locality.
|
||||
- The possible values are - * ROUND_ROBIN - This is a simple policy in which each
|
||||
healthy backend is selected in round robin order.
|
||||
- "* LEAST_REQUEST - An O(1) algorithm which selects two random healthy hosts
|
||||
- "* LEAST_REQUEST - An algorithm which selects two random healthy hosts
|
||||
and picks the host which has fewer active requests."
|
||||
- "* RING_HASH - The ring/modulo hash load balancer implements consistent hashing
|
||||
to backends. The algorithm has the property that the addition/removal of a host
|
||||
|
@ -566,6 +566,7 @@ options:
|
|||
be used to disable ejection or to ramp it up slowly. Defaults to 0.
|
||||
required: false
|
||||
type: int
|
||||
default: 0
|
||||
enforcing_success_rate:
|
||||
description:
|
||||
- The percentage chance that a host will be actually ejected when an outlier
|
||||
|
@ -1222,7 +1223,7 @@ localityLbPolicy:
|
|||
- The load balancing algorithm used within the scope of the locality.
|
||||
- The possible values are - * ROUND_ROBIN - This is a simple policy in which each
|
||||
healthy backend is selected in round robin order.
|
||||
- "* LEAST_REQUEST - An O(1) algorithm which selects two random healthy hosts and
|
||||
- "* LEAST_REQUEST - An algorithm which selects two random healthy hosts and
|
||||
picks the host which has fewer active requests."
|
||||
- "* RING_HASH - The ring/modulo hash load balancer implements consistent hashing
|
||||
to backends. The algorithm has the property that the addition/removal of a host
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue