for example you have 2 buttons, after both buttons are pressed you want a door to open. The bitmask would have 2 bits since both of them need to be enabled to open the door
so as many presses you do as many bit requests get sent?
sounds like trigger on event
you pass button A that enables the next node
in editor case its a bit more complicated
damn i understood complicated coding thingies i am not dumb after all
i may not understand it to its origin
but i get the idea
That's an interesting approach, but I think what would be more interesting would be edges from an event node to sequences Then you determine the number of bits in the bitmask with the number of edges reaching the event sequence.
Though I'm not sure if it would help that much. With tons of hooks and event sequences, the graph could become messy, making it more confusing.
In your graph there are edges from event sequence to hooks, and I guess from hooks you go back to event sequence, so I guess it would make the edge at the right would go back to the left?
Note that recently I gave the possibility to give names to event sequences. These alone can help a lot in identifying them.
Yeah, it would go back to an event sequence, but there would need to be a check to make sure it doesn't reference an event sequence already displayed since that would go on forever.
Using reflection you can display all the event nodes of an object
GeneralXXLXXL 2XXL 3XXXLOlympic GamesXXL EditorToolsOff-TopicXXL RomasteredXXL 2 RemasteredOther GamesModsCaesar's ChallengeUnfair XXLPatchesFan ArtPersonal ArtSpeedrunningMediaRandomizerBETA RomeHSKALPresence AdrienPresence SPQRPresence Mr. Rubinshtein
Helpdesk ☰
