Replies: 1 comment
-
Hi, @jzabroski I’m not sure that I understood you correctly. I assume you are talking about cyclic reference resolution in As of v5.5 we have moved reference serialization functionality to the |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
I found your library today while researching RPC SerDe libraries. Of all your claims, this was the least typical.
Typically, coming from an object/relational mapping framework background, the way cyclic references are resolved is through Floyd-Warshall and "uniquing" the object graph. But I get the sense you are also doing something clever in the implementation, and was wondering if you could point me to where that code is, so I can read it. I'm also curious then if you have tests that test the complexity of the object graph, and how you generate those large object graphs. I typically generate them through de-composing the problem into smaller problems of creating sub-graphs, and stitching graphs together until I get really huge graphs.
Beta Was this translation helpful? Give feedback.
All reactions