Hot Chocolate VS sangria

have a look here https://youtu.be/qrh97hToWpM https://chillicream.com/

There are some libraries which allows you to declare some class with more or less arbitrary methods which will be called by it at runtime. I believe many of them do that in optimal way, not just using usual reflection. One of the examples is HotChocolate library https://github.com/ChilliCream/hotchocolate . You declare class with arbitrary methods which contain arbitrary arguments. "Arbitrary" doesn mean arbitrary at all, but if parameter type is registered in DI or marked by specific attribute, it can be passed to the method.

At work we are considering using GraphQL to build our read-only data-APIs using .NET 6, EF Core and SQL Server. Looking at the ecosystem the most relevant plattforms seems to be graphql-dotnet and ChilliCream.

I'm starting a brand new project. Looks like if we want to do GraphQL in .NET, it's either graphql-dotnet or Hot Chocolate. Both look pretty good on paper.

If you know it better: Please try statically typed generated graphql queries in C# (like write the graphql queries, have a graphql schema, then get generated C# types which resemble the query, the only thing I've found that could do it was https://chillicream.com/docs/strawberryshake and there I quickly hit this bug with super simple queries containing unions: https://github.com/ChilliCream/hotchocolate/issues/4662

If you don't know Hot Chocolate framework, feel free to read about it on chillicream.com (official website) and feel free to join the great community (which is always willing to help) on slack

I love using Hot Chocolate in C# ❤

Hotchocolate GraphQL server. This is the most advanced server for a .Net environment. This article does not go into the basics and assumes some framework knowledge.

I think for the time being that's the case, yeah. I'm confirming with the great people over at https://github.com/ChilliCream/hotchocolate to see if we can somehow work around that.

I am taking a look at Resolver from the Sangria GraphQL library and I cannot figure out how calcComplexity works. The code in the `Success` us really confusing to me. Where is the complexity getting calculated?

I started taking a look at QueryReducer from the Sangria GraphQL library and I am having a really hard tracing the logic for rejectMaxDepth. More specifically, I don't understand why depth is a parameter to measureDepth, where it is coming from, and how the depth is being calculated in measureDepth.

Instead of constructing an object, it uses classes to define the types and operations for the schema that it generates. The schema generated by this implementation will have the same structure as the schema created with graphql-js. Using classes to define your schema has the advantage of being less mutable and more structured when writing code. Similar implementations can be found for TypeScript with the library TypeGraphQL or Sangria GraphQL for Scala.

As Api gateway we use sangria on top of Finagle (finch to be precise) and that has been a huge boon in making the connection between microservices and frontend seamless/safe.