feat: .NET library settings (for generator behavior tweaks)

Google APIs · copybara-github · commit ed78055479a0 · 2023-03-28T08:55:34.000-07:00
docs: separate paragraphs in linear/exponential distributions

PiperOrigin-RevId: 520041337
diff --git a/google/api/client.proto b/google/api/client.proto
@@ -257,6 +257,36 @@ message NodeSettings {
 message DotnetSettings {
   // Some settings.
   CommonLanguageSettings common = 1;
+
+  // Map from original service names to renamed versions.
+  // This is used when the default generated types
+  // would cause a naming conflict. (Neither name is
+  // fully-qualified.)
+  // Example: Subscriber to SubscriberServiceApi.
+  map<string, string> renamed_services = 2;
+
+  // Map from full resource types to the effective short name
+  // for the resource. This is used when otherwise resource
+  // named from different services would cause naming collisions.
+  // Example entry:
+  // "datalabeling.googleapis.com/Dataset": "DataLabelingDataset"
+  map<string, string> renamed_resources = 3;
+
+  // List of full resource types to ignore during generation.
+  // This is typically used for API-specific Location resources,
+  // which should be handled by the generator as if they were actually
+  // the common Location resources.
+  // Example entry: "documentai.googleapis.com/Location"
+  repeated string ignored_resources = 4;
+
+  // Namespaces which must be aliased in snippets due to
+  // a known (but non-generator-predictable) naming collision
+  repeated string forced_namespace_aliases = 5;
+
+  // Method signatures (in the form "service.method(signature)")
+  // which are provided separately, so shouldn't be generated.
+  // Snippets *calling* these methods are still generated, however.
+  repeated string handwritten_signatures = 6;
 }
 
 // Settings for Ruby client libraries.
diff --git a/google/api/distribution.proto b/google/api/distribution.proto
@@ -73,6 +73,7 @@ message Distribution {
     // following boundaries:
     //
     //    Upper bound (0 <= i < N-1):     offset + (width * i).
+    //
     //    Lower bound (1 <= i < N):       offset + (width * (i - 1)).
     message Linear {
       // Must be greater than 0.
@@ -93,6 +94,7 @@ message Distribution {
     // following boundaries:
     //
     //    Upper bound (0 <= i < N-1):     scale * (growth_factor ^ i).
+    //
     //    Lower bound (1 <= i < N):       scale * (growth_factor ^ (i - 1)).
     message Exponential {
       // Must be greater than 0.
