feat: deterministic proto writer

since iteration of go maps are not deterministic, some sorting is required
to ensure a proper order.

non-deterministic ordering in proto files may lead to significant
unnescessary diffs if generated protos are checked in.

examples/bookstore.yaml.output.proto

@@ -6,6 +6,14 @@ import "google/protobuf/empty.proto";
 
 option go_package = "/bookstore";
 
+message Author {
+  string path = 1;
+}
+
+message ReadAuthorRequest {
+  string path = 1;
+}
+
 message Book {
   string path = 1;
 }
@@ -54,15 +62,11 @@ message ListPublisherResponse {
   repeated Publisher resources = 1;
 }
 
-message Author {
-  string path = 1;
-}
-
-message ReadAuthorRequest {
-  string path = 1;
-}
-
 service Bookstore {
+  rpc ReadAuthor ( ReadAuthorRequest ) returns ( Author ) {
+    option (google.api.http) = { get: "/{path=publisher/*/author/*}" };
+  }
+
   rpc CreateBook ( CreateBookRequest ) returns ( Book ) {
     option (google.api.http) = { post: "/{parent=publisher/*}/book" };
   }
@@ -90,8 +94,4 @@ service Bookstore {
   rpc ListPublisher ( ListPublisherRequest ) returns ( ListPublisherResponse ) {
     option (google.api.http) = { get: "/publisher" };
   }
-
-  rpc ReadAuthor ( ReadAuthorRequest ) returns ( Author ) {
-    option (google.api.http) = { get: "/{path=publisher/*/author/*}" };
-  }
 }

writer/proto/proto.go

@@ -16,6 +16,7 @@ package proto
 import (
 	"bytes"
 	"fmt"
+	"sort"
 	"strings"
 
 	"github.com/aep-dev/aepc/parser"
@@ -46,7 +47,7 @@ func WriteServiceToProto(ps *parser.ParsedService) ([]byte, error) {
 	fb.SetOptions(fo)
 	sb := builder.NewService(pServiceName)
 	fb.AddService(sb)
-	for _, r := range ps.ResourceByType {
+	for _, r := range getSortedResources(ps.ResourceByType) {
 		err := AddResource(r, fb, sb)
 		if err != nil {
 			return []byte{}, fmt.Errorf("adding resource %v failed: %w", r.Kind, err)
@@ -69,3 +70,16 @@ func toProtoServiceName(serviceName string) string {
 	parts := strings.SplitN(serviceName, ".", 2)
 	return capitalizer.String(parts[0])
 }
+
+func getSortedResources(prsByString map[string]*parser.ParsedResource) []*parser.ParsedResource {
+	keys := []string{}
+	for k := range prsByString {
+		keys = append(keys, k)
+	}
+	sort.Strings(keys)
+	resources := make([]*parser.ParsedResource, 0, len(keys))
+	for _, k := range keys {
+		resources = append(resources, prsByString[k])
+	}
+	return resources
+}