| Hi David, thanks for the info. I am asking for these details because I do not yet understand how a stack overflow could have happened in that code. I tried to reproduce deleting an enumeration (assuming we are talking about the same thing with edg:Enumeration instances) with the attached file, but there is only one level of recursion but no runaway recursion. The cases in which it could enter a deeper recursion would involve blank node structures - are you by any chance using those? The topics of this mailing list include TopBraid EDG and related technologies such as SHACL. To post to this group, send email to [email protected] --- You received this message because you are subscribed to the Google Groups "TopBraid Suite Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/topbraid-users/B31C99A2-E17F-4AAB-B8F6-D7A96BAFF3F3%40topquadrant.com. |
test_enum.ttl
Description: Binary data
Now thinking more about this, do you mean rdf:Lists by any chance? Those would be blank nodes and may cause recursive delete problems. If you cannot delete them in any other way, you could export the graph to a file, clear the graph and replace it with a hand-edited copy of the exported file. Or use the Source Code panel to delete the rdf:List. Holger
The topics of this mailing list include TopBraid EDG and related technologies such as SHACL. To post to this group, send email to [email protected] --- You received this message because you are subscribed to the Google Groups "TopBraid Suite Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/topbraid-users/B31C99A2-E17F-4AAB-B8F6-D7A96BAFF3F3%40topquadrant.com. |
