Tristan Ravitch
Tristan Ravitch
Thanks! I'm excited by some aspects of it (e.g., it works with weird build systems that use static binaries, mess with the environment, hard code paths, etc), but it does...
It has been a very long time since I looked at this library, but that sounds like something that could be true. I don't have any idea off the top...
Wow, that looks like a bad bug. I'll take a look at it.
Thanks for the report. It looks like there was a bug in the stratification code. Can you try now?
When I first wrote the code I think I was unclear what rules like that should mean, for some reason. I see now and I'll fix it.
The edge will not be added if either vertex does not exist in the graph. Also, it allows simple graphs to reject duplicate edges if the edge already exists.
Correct, that is currently the only method for combining graphs. Unlike fgl, there is no monoid instance for merging graphs because vertex creation is tightly-controlled. I could imagine some interesting...
There is currently no way to do this. The reasons noted by @NerdGGuy probably cover the bigger issues. I have nothing against a vertical orientation, but haven't investigated at all....
I think that is probably the easiest approach for now, especially if gtk doesn’t give us tools for constraining things properly. It might be nice longer term to cook up...
If available, we could probably listen for the `PrepareForSleep(false)` DBus signal from logind (part of systemd): https://www.freedesktop.org/wiki/Software/systemd/logind/. I believe that is sent when the system wakes up. It used to...