Kekun commented on issue #1988: URL: https://github.com/apache/buildstream/issues/1988#issuecomment-2627728790
IMO it's not a tree to begin with as several elements can have the same dependency, so probably more a loop-free directed graph. But ultimately all that matters is to get a unique identifier for an element that changes if anything "below" it in the graph or itself changed. > The fact that a sorting function works for this is a coincidence Well clearly a sorting function doesn't really work for this, it seems to be too simple, and by simple I mean wrong. :x I don't know BuildStream well enough to know what should be done here. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
