Merge branch 'master' of github.com:elastic/elasticsearch-net

Author: Mpdreamz

docs/asciidoc/aggregations/bucket/filter/filter-aggregation-usage.asciidoc

@@ -7,7 +7,7 @@
 [[filter-aggregation-usage]]
 == Filter Aggregation Usage
 
-Defines a single bucket of all the documents in the current document set context that match a specified filter. 
+Defines a single bucket of all the documents in the current document set context that match a specified filter.
 Often this will be used to narrow down the current aggregation context to a specific set of documents.
 
 Be sure to read the Elasticsearch documentation on {ref_current}/search-aggregations-bucket-filter-aggregation.html[Filter Aggregation]

docs/asciidoc/aggregations/pipeline/moving-average/moving-average-ewma-aggregation-usage.asciidoc

@@ -45,7 +45,7 @@ new SearchRequest<Project>()
     {
         Field = "startedOn",
         Interval = DateInterval.Month,
-        Aggregations = 
+        Aggregations =
             new SumAggregation("commits", "numberOfCommits") &&
             new MovingAverageAggregation("commits_moving_avg", "commits")
             {

docs/asciidoc/aggregations/pipeline/moving-average/moving-average-holt-linear-aggregation-usage.asciidoc

@@ -46,7 +46,7 @@ new SearchRequest<Project>()
     {
         Field = "startedOn",
         Interval = DateInterval.Month,
-        Aggregations = 
+        Aggregations =
             new SumAggregation("commits", "numberOfCommits") &&
             new MovingAverageAggregation("commits_moving_avg", "commits")
             {

docs/asciidoc/aggregations/pipeline/moving-average/moving-average-holt-winters-aggregation-usage.asciidoc

@@ -51,7 +51,7 @@ new SearchRequest<Project>()
     {
         Field = "startedOn",
         Interval = DateInterval.Month,
-        Aggregations = 
+        Aggregations =
             new SumAggregation("commits", "numberOfCommits") &&
             new MovingAverageAggregation("commits_moving_avg", "commits")
             {

docs/asciidoc/aggregations/pipeline/moving-average/moving-average-linear-aggregation-usage.asciidoc

@@ -44,7 +44,7 @@ new SearchRequest<Project>()
     {
         Field = "startedOn",
         Interval = DateInterval.Month,
-        Aggregations = 
+        Aggregations =
             new SumAggregation("commits", "numberOfCommits") &&
             new MovingAverageAggregation("commits_moving_avg", "commits")
             {

docs/asciidoc/aggregations/pipeline/moving-average/moving-average-simple-aggregation-usage.asciidoc

@@ -45,7 +45,7 @@ new SearchRequest<Project>()
     {
         Field = "startedOn",
         Interval = DateInterval.Month,
-        Aggregations = 
+        Aggregations =
             new SumAggregation("commits", "numberOfCommits") &&
             new MovingAverageAggregation("commits_moving_avg", "commits")
             {

docs/asciidoc/client-concepts/connection-pooling/building-blocks/date-time-providers.asciidoc

@@ -7,7 +7,7 @@
 [[date-time-providers]]
 == Date time providers
 
-Not typically something you'll have to pass to the client but all calls to `System.DateTime.UtcNow` 
+Not typically something you'll have to pass to the client but all calls to `System.DateTime.UtcNow`
 in the client have been abstracted by `IDateTimeProvider`. This allows us to unit test timeouts and cluster failover
 without being bound to wall clock time as calculated by using `System.DateTime.UtcNow` directly.
 
@@ -45,7 +45,7 @@ var maxTimeout = TimeSpan.FromMinutes(30);
 Plotting these defaults looks as followed:
 
 [[timeout]]
-.Default formula, x-axis time in minutes, y-axis number of attempts to revive
+.Default formula, x-axis number of attempts to revive, y-axis time in minutes
 image::timeoutplot.png[dead timeout]
 
 The goal here is that whenever a node is resurrected and is found to still be offline, we send it_back to the doghouse_ for an ever increasingly long period, until we hit a bounded maximum.

docs/asciidoc/client-concepts/connection-pooling/pinging/first-usage.asciidoc

@@ -67,7 +67,7 @@ var audit = new Auditor(() => Framework.Cluster
 The first call goes to 9200 which succeeds 
 
 The 2nd call does a ping on 9201 because its used for the first time.
-It fails and so we ping 9202 which also fails. We then ping 9203 becuase
+It fails and so we ping 9202 which also fails. We then ping 9203 because
 we haven't used it before and it succeeds 
 
 Finally we assert that the connectionpool has two nodes that are marked as dead 

docs/asciidoc/client-concepts/connection-pooling/round-robin/round-robin.asciidoc

@@ -14,7 +14,7 @@ round robin over the `live` nodes to evenly distribute request load over all kno
 
 `GetNext` is implemented in a lock free thread safe fashion, meaning each callee gets returned its own cursor to advance
 over the internal list of nodes. This to guarantee each request that needs to fall over tries all the nodes without
-suffering from noisy neighboors advancing a global cursor.
+suffering from noisy neighbours advancing a global cursor.
 
 [source,csharp]
 ----

docs/asciidoc/client-concepts/connection-pooling/round-robin/skip-dead-nodes.asciidoc

@@ -13,7 +13,7 @@ When selecting nodes the connection pool will try and skip all the nodes that ar
 
 GetNext is implemented in a lock free thread safe fashion, meaning each callee gets returned its own cursor to advance
 over the internal list of nodes. This to guarantee each request that needs to fall over tries all the nodes without
-suffering from noisy neighboors advancing a global cursor.
+suffering from noisy neighbours advancing a global cursor.
 
 [source,csharp]
 ----